Commit | Line | Data |
---|---|---|
6e681866 | 1 | /* Ada language support routines for GDB, the GNU debugger. |
10a2c479 | 2 | |
618f726f | 3 | Copyright (C) 1992-2016 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" |
ccefe4c4 | 63 | |
4c4b4cd2 | 64 | /* Define whether or not the C operator '/' truncates towards zero for |
0963b4bd | 65 | differently signed operands (truncation direction is undefined in C). |
4c4b4cd2 PH |
66 | Copied from valarith.c. */ |
67 | ||
68 | #ifndef TRUNCATION_TOWARDS_ZERO | |
69 | #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2) | |
70 | #endif | |
71 | ||
d2e4a39e | 72 | static struct type *desc_base_type (struct type *); |
14f9c5c9 | 73 | |
d2e4a39e | 74 | static struct type *desc_bounds_type (struct type *); |
14f9c5c9 | 75 | |
d2e4a39e | 76 | static struct value *desc_bounds (struct value *); |
14f9c5c9 | 77 | |
d2e4a39e | 78 | static int fat_pntr_bounds_bitpos (struct type *); |
14f9c5c9 | 79 | |
d2e4a39e | 80 | static int fat_pntr_bounds_bitsize (struct type *); |
14f9c5c9 | 81 | |
556bdfd4 | 82 | static struct type *desc_data_target_type (struct type *); |
14f9c5c9 | 83 | |
d2e4a39e | 84 | static struct value *desc_data (struct value *); |
14f9c5c9 | 85 | |
d2e4a39e | 86 | static int fat_pntr_data_bitpos (struct type *); |
14f9c5c9 | 87 | |
d2e4a39e | 88 | static int fat_pntr_data_bitsize (struct type *); |
14f9c5c9 | 89 | |
d2e4a39e | 90 | static struct value *desc_one_bound (struct value *, int, int); |
14f9c5c9 | 91 | |
d2e4a39e | 92 | static int desc_bound_bitpos (struct type *, int, int); |
14f9c5c9 | 93 | |
d2e4a39e | 94 | static int desc_bound_bitsize (struct type *, int, int); |
14f9c5c9 | 95 | |
d2e4a39e | 96 | static struct type *desc_index_type (struct type *, int); |
14f9c5c9 | 97 | |
d2e4a39e | 98 | static int desc_arity (struct type *); |
14f9c5c9 | 99 | |
d2e4a39e | 100 | static int ada_type_match (struct type *, struct type *, int); |
14f9c5c9 | 101 | |
d2e4a39e | 102 | static int ada_args_match (struct symbol *, struct value **, int); |
14f9c5c9 | 103 | |
40658b94 PH |
104 | static int full_match (const char *, const char *); |
105 | ||
40bc484c | 106 | static struct value *make_array_descriptor (struct type *, struct value *); |
14f9c5c9 | 107 | |
4c4b4cd2 | 108 | static void ada_add_block_symbols (struct obstack *, |
f0c5f9b2 | 109 | const struct block *, const char *, |
2570f2b7 | 110 | domain_enum, struct objfile *, int); |
14f9c5c9 | 111 | |
22cee43f PMR |
112 | static void ada_add_all_symbols (struct obstack *, const struct block *, |
113 | const char *, domain_enum, int, int *); | |
114 | ||
d12307c1 | 115 | static int is_nonfunction (struct block_symbol *, int); |
14f9c5c9 | 116 | |
76a01679 | 117 | static void add_defn_to_vec (struct obstack *, struct symbol *, |
f0c5f9b2 | 118 | const struct block *); |
14f9c5c9 | 119 | |
4c4b4cd2 PH |
120 | static int num_defns_collected (struct obstack *); |
121 | ||
d12307c1 | 122 | static struct block_symbol *defns_collected (struct obstack *, int); |
14f9c5c9 | 123 | |
4c4b4cd2 | 124 | static struct value *resolve_subexp (struct expression **, int *, int, |
76a01679 | 125 | struct type *); |
14f9c5c9 | 126 | |
d2e4a39e | 127 | static void replace_operator_with_call (struct expression **, int, int, int, |
270140bd | 128 | struct symbol *, const struct block *); |
14f9c5c9 | 129 | |
d2e4a39e | 130 | static int possible_user_operator_p (enum exp_opcode, struct value **); |
14f9c5c9 | 131 | |
4c4b4cd2 PH |
132 | static char *ada_op_name (enum exp_opcode); |
133 | ||
134 | static const char *ada_decoded_op_name (enum exp_opcode); | |
14f9c5c9 | 135 | |
d2e4a39e | 136 | static int numeric_type_p (struct type *); |
14f9c5c9 | 137 | |
d2e4a39e | 138 | static int integer_type_p (struct type *); |
14f9c5c9 | 139 | |
d2e4a39e | 140 | static int scalar_type_p (struct type *); |
14f9c5c9 | 141 | |
d2e4a39e | 142 | static int discrete_type_p (struct type *); |
14f9c5c9 | 143 | |
aeb5907d JB |
144 | static enum ada_renaming_category parse_old_style_renaming (struct type *, |
145 | const char **, | |
146 | int *, | |
147 | const char **); | |
148 | ||
149 | static struct symbol *find_old_style_renaming_symbol (const char *, | |
270140bd | 150 | const struct block *); |
aeb5907d | 151 | |
4c4b4cd2 | 152 | static struct type *ada_lookup_struct_elt_type (struct type *, char *, |
76a01679 | 153 | int, int, int *); |
4c4b4cd2 | 154 | |
d2e4a39e | 155 | static struct value *evaluate_subexp_type (struct expression *, int *); |
14f9c5c9 | 156 | |
b4ba55a1 JB |
157 | static struct type *ada_find_parallel_type_with_name (struct type *, |
158 | const char *); | |
159 | ||
d2e4a39e | 160 | static int is_dynamic_field (struct type *, int); |
14f9c5c9 | 161 | |
10a2c479 | 162 | static struct type *to_fixed_variant_branch_type (struct type *, |
fc1a4b47 | 163 | const gdb_byte *, |
4c4b4cd2 PH |
164 | CORE_ADDR, struct value *); |
165 | ||
166 | static struct type *to_fixed_array_type (struct type *, struct value *, int); | |
14f9c5c9 | 167 | |
28c85d6c | 168 | static struct type *to_fixed_range_type (struct type *, struct value *); |
14f9c5c9 | 169 | |
d2e4a39e | 170 | static struct type *to_static_fixed_type (struct type *); |
f192137b | 171 | static struct type *static_unwrap_type (struct type *type); |
14f9c5c9 | 172 | |
d2e4a39e | 173 | static struct value *unwrap_value (struct value *); |
14f9c5c9 | 174 | |
ad82864c | 175 | static struct type *constrained_packed_array_type (struct type *, long *); |
14f9c5c9 | 176 | |
ad82864c | 177 | static struct type *decode_constrained_packed_array_type (struct type *); |
14f9c5c9 | 178 | |
ad82864c JB |
179 | static long decode_packed_array_bitsize (struct type *); |
180 | ||
181 | static struct value *decode_constrained_packed_array (struct value *); | |
182 | ||
183 | static int ada_is_packed_array_type (struct type *); | |
184 | ||
185 | static int ada_is_unconstrained_packed_array_type (struct type *); | |
14f9c5c9 | 186 | |
d2e4a39e | 187 | static struct value *value_subscript_packed (struct value *, int, |
4c4b4cd2 | 188 | struct value **); |
14f9c5c9 | 189 | |
50810684 | 190 | static void move_bits (gdb_byte *, int, const gdb_byte *, int, int, int); |
52ce6436 | 191 | |
4c4b4cd2 PH |
192 | static struct value *coerce_unspec_val_to_type (struct value *, |
193 | struct type *); | |
14f9c5c9 | 194 | |
d2e4a39e | 195 | static struct value *get_var_value (char *, char *); |
14f9c5c9 | 196 | |
d2e4a39e | 197 | static int lesseq_defined_than (struct symbol *, struct symbol *); |
14f9c5c9 | 198 | |
d2e4a39e | 199 | static int equiv_types (struct type *, struct type *); |
14f9c5c9 | 200 | |
d2e4a39e | 201 | static int is_name_suffix (const char *); |
14f9c5c9 | 202 | |
73589123 PH |
203 | static int advance_wild_match (const char **, const char *, int); |
204 | ||
205 | static int wild_match (const char *, const char *); | |
14f9c5c9 | 206 | |
d2e4a39e | 207 | static struct value *ada_coerce_ref (struct value *); |
14f9c5c9 | 208 | |
4c4b4cd2 PH |
209 | static LONGEST pos_atr (struct value *); |
210 | ||
3cb382c9 | 211 | static struct value *value_pos_atr (struct type *, struct value *); |
14f9c5c9 | 212 | |
d2e4a39e | 213 | static struct value *value_val_atr (struct type *, struct value *); |
14f9c5c9 | 214 | |
4c4b4cd2 PH |
215 | static struct symbol *standard_lookup (const char *, const struct block *, |
216 | domain_enum); | |
14f9c5c9 | 217 | |
108d56a4 | 218 | static struct value *ada_search_struct_field (const char *, struct value *, int, |
4c4b4cd2 PH |
219 | struct type *); |
220 | ||
221 | static struct value *ada_value_primitive_field (struct value *, int, int, | |
222 | struct type *); | |
223 | ||
0d5cff50 | 224 | static int find_struct_field (const char *, struct type *, int, |
52ce6436 | 225 | struct type **, int *, int *, int *, int *); |
4c4b4cd2 PH |
226 | |
227 | static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR, | |
228 | struct value *); | |
229 | ||
d12307c1 | 230 | static int ada_resolve_function (struct block_symbol *, int, |
4c4b4cd2 PH |
231 | struct value **, int, const char *, |
232 | struct type *); | |
233 | ||
4c4b4cd2 PH |
234 | static int ada_is_direct_array_type (struct type *); |
235 | ||
72d5681a PH |
236 | static void ada_language_arch_info (struct gdbarch *, |
237 | struct language_arch_info *); | |
714e53ab | 238 | |
52ce6436 PH |
239 | static struct value *ada_index_struct_field (int, struct value *, int, |
240 | struct type *); | |
241 | ||
242 | static struct value *assign_aggregate (struct value *, struct value *, | |
0963b4bd MS |
243 | struct expression *, |
244 | int *, enum noside); | |
52ce6436 PH |
245 | |
246 | static void aggregate_assign_from_choices (struct value *, struct value *, | |
247 | struct expression *, | |
248 | int *, LONGEST *, int *, | |
249 | int, LONGEST, LONGEST); | |
250 | ||
251 | static void aggregate_assign_positional (struct value *, struct value *, | |
252 | struct expression *, | |
253 | int *, LONGEST *, int *, int, | |
254 | LONGEST, LONGEST); | |
255 | ||
256 | ||
257 | static void aggregate_assign_others (struct value *, struct value *, | |
258 | struct expression *, | |
259 | int *, LONGEST *, int, LONGEST, LONGEST); | |
260 | ||
261 | ||
262 | static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int); | |
263 | ||
264 | ||
265 | static struct value *ada_evaluate_subexp (struct type *, struct expression *, | |
266 | int *, enum noside); | |
267 | ||
268 | static void ada_forward_operator_length (struct expression *, int, int *, | |
269 | int *); | |
852dff6c JB |
270 | |
271 | static struct type *ada_find_any_type (const char *name); | |
4c4b4cd2 PH |
272 | \f |
273 | ||
ee01b665 JB |
274 | /* The result of a symbol lookup to be stored in our symbol cache. */ |
275 | ||
276 | struct cache_entry | |
277 | { | |
278 | /* The name used to perform the lookup. */ | |
279 | const char *name; | |
280 | /* The namespace used during the lookup. */ | |
fe978cb0 | 281 | domain_enum domain; |
ee01b665 JB |
282 | /* The symbol returned by the lookup, or NULL if no matching symbol |
283 | was found. */ | |
284 | struct symbol *sym; | |
285 | /* The block where the symbol was found, or NULL if no matching | |
286 | symbol was found. */ | |
287 | const struct block *block; | |
288 | /* A pointer to the next entry with the same hash. */ | |
289 | struct cache_entry *next; | |
290 | }; | |
291 | ||
292 | /* The Ada symbol cache, used to store the result of Ada-mode symbol | |
293 | lookups in the course of executing the user's commands. | |
294 | ||
295 | The cache is implemented using a simple, fixed-sized hash. | |
296 | The size is fixed on the grounds that there are not likely to be | |
297 | all that many symbols looked up during any given session, regardless | |
298 | of the size of the symbol table. If we decide to go to a resizable | |
299 | table, let's just use the stuff from libiberty instead. */ | |
300 | ||
301 | #define HASH_SIZE 1009 | |
302 | ||
303 | struct ada_symbol_cache | |
304 | { | |
305 | /* An obstack used to store the entries in our cache. */ | |
306 | struct obstack cache_space; | |
307 | ||
308 | /* The root of the hash table used to implement our symbol cache. */ | |
309 | struct cache_entry *root[HASH_SIZE]; | |
310 | }; | |
311 | ||
312 | static void ada_free_symbol_cache (struct ada_symbol_cache *sym_cache); | |
76a01679 | 313 | |
4c4b4cd2 | 314 | /* Maximum-sized dynamic type. */ |
14f9c5c9 AS |
315 | static unsigned int varsize_limit; |
316 | ||
4c4b4cd2 PH |
317 | /* FIXME: brobecker/2003-09-17: No longer a const because it is |
318 | returned by a function that does not return a const char *. */ | |
319 | static char *ada_completer_word_break_characters = | |
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 | ||
345 | /* Space for allocating results of ada_lookup_symbol_list. */ | |
346 | static struct obstack symbol_list_obstack; | |
347 | ||
c6044dd1 JB |
348 | /* Maintenance-related settings for this module. */ |
349 | ||
350 | static struct cmd_list_element *maint_set_ada_cmdlist; | |
351 | static struct cmd_list_element *maint_show_ada_cmdlist; | |
352 | ||
353 | /* Implement the "maintenance set ada" (prefix) command. */ | |
354 | ||
355 | static void | |
356 | maint_set_ada_cmd (char *args, int from_tty) | |
357 | { | |
635c7e8a TT |
358 | help_list (maint_set_ada_cmdlist, "maintenance set ada ", all_commands, |
359 | gdb_stdout); | |
c6044dd1 JB |
360 | } |
361 | ||
362 | /* Implement the "maintenance show ada" (prefix) command. */ | |
363 | ||
364 | static void | |
365 | maint_show_ada_cmd (char *args, int from_tty) | |
366 | { | |
367 | cmd_show_list (maint_show_ada_cmdlist, from_tty, ""); | |
368 | } | |
369 | ||
370 | /* The "maintenance ada set/show ignore-descriptive-type" value. */ | |
371 | ||
372 | static int ada_ignore_descriptive_types_p = 0; | |
373 | ||
e802dbe0 JB |
374 | /* Inferior-specific data. */ |
375 | ||
376 | /* Per-inferior data for this module. */ | |
377 | ||
378 | struct ada_inferior_data | |
379 | { | |
380 | /* The ada__tags__type_specific_data type, which is used when decoding | |
381 | tagged types. With older versions of GNAT, this type was directly | |
382 | accessible through a component ("tsd") in the object tag. But this | |
383 | is no longer the case, so we cache it for each inferior. */ | |
384 | struct type *tsd_type; | |
3eecfa55 JB |
385 | |
386 | /* The exception_support_info data. This data is used to determine | |
387 | how to implement support for Ada exception catchpoints in a given | |
388 | inferior. */ | |
389 | const struct exception_support_info *exception_info; | |
e802dbe0 JB |
390 | }; |
391 | ||
392 | /* Our key to this module's inferior data. */ | |
393 | static const struct inferior_data *ada_inferior_data; | |
394 | ||
395 | /* A cleanup routine for our inferior data. */ | |
396 | static void | |
397 | ada_inferior_data_cleanup (struct inferior *inf, void *arg) | |
398 | { | |
399 | struct ada_inferior_data *data; | |
400 | ||
9a3c8263 | 401 | data = (struct ada_inferior_data *) inferior_data (inf, ada_inferior_data); |
e802dbe0 JB |
402 | if (data != NULL) |
403 | xfree (data); | |
404 | } | |
405 | ||
406 | /* Return our inferior data for the given inferior (INF). | |
407 | ||
408 | This function always returns a valid pointer to an allocated | |
409 | ada_inferior_data structure. If INF's inferior data has not | |
410 | been previously set, this functions creates a new one with all | |
411 | fields set to zero, sets INF's inferior to it, and then returns | |
412 | a pointer to that newly allocated ada_inferior_data. */ | |
413 | ||
414 | static struct ada_inferior_data * | |
415 | get_ada_inferior_data (struct inferior *inf) | |
416 | { | |
417 | struct ada_inferior_data *data; | |
418 | ||
9a3c8263 | 419 | data = (struct ada_inferior_data *) inferior_data (inf, ada_inferior_data); |
e802dbe0 JB |
420 | if (data == NULL) |
421 | { | |
41bf6aca | 422 | data = XCNEW (struct ada_inferior_data); |
e802dbe0 JB |
423 | set_inferior_data (inf, ada_inferior_data, data); |
424 | } | |
425 | ||
426 | return data; | |
427 | } | |
428 | ||
429 | /* Perform all necessary cleanups regarding our module's inferior data | |
430 | that is required after the inferior INF just exited. */ | |
431 | ||
432 | static void | |
433 | ada_inferior_exit (struct inferior *inf) | |
434 | { | |
435 | ada_inferior_data_cleanup (inf, NULL); | |
436 | set_inferior_data (inf, ada_inferior_data, NULL); | |
437 | } | |
438 | ||
ee01b665 JB |
439 | |
440 | /* program-space-specific data. */ | |
441 | ||
442 | /* This module's per-program-space data. */ | |
443 | struct ada_pspace_data | |
444 | { | |
445 | /* The Ada symbol cache. */ | |
446 | struct ada_symbol_cache *sym_cache; | |
447 | }; | |
448 | ||
449 | /* Key to our per-program-space data. */ | |
450 | static const struct program_space_data *ada_pspace_data_handle; | |
451 | ||
452 | /* Return this module's data for the given program space (PSPACE). | |
453 | If not is found, add a zero'ed one now. | |
454 | ||
455 | This function always returns a valid object. */ | |
456 | ||
457 | static struct ada_pspace_data * | |
458 | get_ada_pspace_data (struct program_space *pspace) | |
459 | { | |
460 | struct ada_pspace_data *data; | |
461 | ||
9a3c8263 SM |
462 | data = ((struct ada_pspace_data *) |
463 | program_space_data (pspace, ada_pspace_data_handle)); | |
ee01b665 JB |
464 | if (data == NULL) |
465 | { | |
466 | data = XCNEW (struct ada_pspace_data); | |
467 | set_program_space_data (pspace, ada_pspace_data_handle, data); | |
468 | } | |
469 | ||
470 | return data; | |
471 | } | |
472 | ||
473 | /* The cleanup callback for this module's per-program-space data. */ | |
474 | ||
475 | static void | |
476 | ada_pspace_data_cleanup (struct program_space *pspace, void *data) | |
477 | { | |
9a3c8263 | 478 | struct ada_pspace_data *pspace_data = (struct ada_pspace_data *) data; |
ee01b665 JB |
479 | |
480 | if (pspace_data->sym_cache != NULL) | |
481 | ada_free_symbol_cache (pspace_data->sym_cache); | |
482 | xfree (pspace_data); | |
483 | } | |
484 | ||
4c4b4cd2 PH |
485 | /* Utilities */ |
486 | ||
720d1a40 | 487 | /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after |
eed9788b | 488 | all typedef layers have been peeled. Otherwise, return TYPE. |
720d1a40 JB |
489 | |
490 | Normally, we really expect a typedef type to only have 1 typedef layer. | |
491 | In other words, we really expect the target type of a typedef type to be | |
492 | a non-typedef type. This is particularly true for Ada units, because | |
493 | the language does not have a typedef vs not-typedef distinction. | |
494 | In that respect, the Ada compiler has been trying to eliminate as many | |
495 | typedef definitions in the debugging information, since they generally | |
496 | do not bring any extra information (we still use typedef under certain | |
497 | circumstances related mostly to the GNAT encoding). | |
498 | ||
499 | Unfortunately, we have seen situations where the debugging information | |
500 | generated by the compiler leads to such multiple typedef layers. For | |
501 | instance, consider the following example with stabs: | |
502 | ||
503 | .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...] | |
504 | .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0 | |
505 | ||
506 | This is an error in the debugging information which causes type | |
507 | pck__float_array___XUP to be defined twice, and the second time, | |
508 | it is defined as a typedef of a typedef. | |
509 | ||
510 | This is on the fringe of legality as far as debugging information is | |
511 | concerned, and certainly unexpected. But it is easy to handle these | |
512 | situations correctly, so we can afford to be lenient in this case. */ | |
513 | ||
514 | static struct type * | |
515 | ada_typedef_target_type (struct type *type) | |
516 | { | |
517 | while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
518 | type = TYPE_TARGET_TYPE (type); | |
519 | return type; | |
520 | } | |
521 | ||
41d27058 JB |
522 | /* Given DECODED_NAME a string holding a symbol name in its |
523 | decoded form (ie using the Ada dotted notation), returns | |
524 | its unqualified name. */ | |
525 | ||
526 | static const char * | |
527 | ada_unqualified_name (const char *decoded_name) | |
528 | { | |
2b0f535a JB |
529 | const char *result; |
530 | ||
531 | /* If the decoded name starts with '<', it means that the encoded | |
532 | name does not follow standard naming conventions, and thus that | |
533 | it is not your typical Ada symbol name. Trying to unqualify it | |
534 | is therefore pointless and possibly erroneous. */ | |
535 | if (decoded_name[0] == '<') | |
536 | return decoded_name; | |
537 | ||
538 | result = strrchr (decoded_name, '.'); | |
41d27058 JB |
539 | if (result != NULL) |
540 | result++; /* Skip the dot... */ | |
541 | else | |
542 | result = decoded_name; | |
543 | ||
544 | return result; | |
545 | } | |
546 | ||
547 | /* Return a string starting with '<', followed by STR, and '>'. | |
548 | The result is good until the next call. */ | |
549 | ||
550 | static char * | |
551 | add_angle_brackets (const char *str) | |
552 | { | |
553 | static char *result = NULL; | |
554 | ||
555 | xfree (result); | |
88c15c34 | 556 | result = xstrprintf ("<%s>", str); |
41d27058 JB |
557 | return result; |
558 | } | |
96d887e8 | 559 | |
4c4b4cd2 PH |
560 | static char * |
561 | ada_get_gdb_completer_word_break_characters (void) | |
562 | { | |
563 | return ada_completer_word_break_characters; | |
564 | } | |
565 | ||
e79af960 JB |
566 | /* Print an array element index using the Ada syntax. */ |
567 | ||
568 | static void | |
569 | ada_print_array_index (struct value *index_value, struct ui_file *stream, | |
79a45b7d | 570 | const struct value_print_options *options) |
e79af960 | 571 | { |
79a45b7d | 572 | LA_VALUE_PRINT (index_value, stream, options); |
e79af960 JB |
573 | fprintf_filtered (stream, " => "); |
574 | } | |
575 | ||
f27cf670 | 576 | /* Assuming VECT points to an array of *SIZE objects of size |
14f9c5c9 | 577 | ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects, |
f27cf670 | 578 | updating *SIZE as necessary and returning the (new) array. */ |
14f9c5c9 | 579 | |
f27cf670 AS |
580 | void * |
581 | grow_vect (void *vect, size_t *size, size_t min_size, int element_size) | |
14f9c5c9 | 582 | { |
d2e4a39e AS |
583 | if (*size < min_size) |
584 | { | |
585 | *size *= 2; | |
586 | if (*size < min_size) | |
4c4b4cd2 | 587 | *size = min_size; |
f27cf670 | 588 | vect = xrealloc (vect, *size * element_size); |
d2e4a39e | 589 | } |
f27cf670 | 590 | return vect; |
14f9c5c9 AS |
591 | } |
592 | ||
593 | /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing | |
4c4b4cd2 | 594 | suffix of FIELD_NAME beginning "___". */ |
14f9c5c9 AS |
595 | |
596 | static int | |
ebf56fd3 | 597 | field_name_match (const char *field_name, const char *target) |
14f9c5c9 AS |
598 | { |
599 | int len = strlen (target); | |
5b4ee69b | 600 | |
d2e4a39e | 601 | return |
4c4b4cd2 PH |
602 | (strncmp (field_name, target, len) == 0 |
603 | && (field_name[len] == '\0' | |
61012eef | 604 | || (startswith (field_name + len, "___") |
76a01679 JB |
605 | && strcmp (field_name + strlen (field_name) - 6, |
606 | "___XVN") != 0))); | |
14f9c5c9 AS |
607 | } |
608 | ||
609 | ||
872c8b51 JB |
610 | /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to |
611 | a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME, | |
612 | and return its index. This function also handles fields whose name | |
613 | have ___ suffixes because the compiler sometimes alters their name | |
614 | by adding such a suffix to represent fields with certain constraints. | |
615 | If the field could not be found, return a negative number if | |
616 | MAYBE_MISSING is set. Otherwise raise an error. */ | |
4c4b4cd2 PH |
617 | |
618 | int | |
619 | ada_get_field_index (const struct type *type, const char *field_name, | |
620 | int maybe_missing) | |
621 | { | |
622 | int fieldno; | |
872c8b51 JB |
623 | struct type *struct_type = check_typedef ((struct type *) type); |
624 | ||
625 | for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++) | |
626 | if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name)) | |
4c4b4cd2 PH |
627 | return fieldno; |
628 | ||
629 | if (!maybe_missing) | |
323e0a4a | 630 | error (_("Unable to find field %s in struct %s. Aborting"), |
872c8b51 | 631 | field_name, TYPE_NAME (struct_type)); |
4c4b4cd2 PH |
632 | |
633 | return -1; | |
634 | } | |
635 | ||
636 | /* The length of the prefix of NAME prior to any "___" suffix. */ | |
14f9c5c9 AS |
637 | |
638 | int | |
d2e4a39e | 639 | ada_name_prefix_len (const char *name) |
14f9c5c9 AS |
640 | { |
641 | if (name == NULL) | |
642 | return 0; | |
d2e4a39e | 643 | else |
14f9c5c9 | 644 | { |
d2e4a39e | 645 | const char *p = strstr (name, "___"); |
5b4ee69b | 646 | |
14f9c5c9 | 647 | if (p == NULL) |
4c4b4cd2 | 648 | return strlen (name); |
14f9c5c9 | 649 | else |
4c4b4cd2 | 650 | return p - name; |
14f9c5c9 AS |
651 | } |
652 | } | |
653 | ||
4c4b4cd2 PH |
654 | /* Return non-zero if SUFFIX is a suffix of STR. |
655 | Return zero if STR is null. */ | |
656 | ||
14f9c5c9 | 657 | static int |
d2e4a39e | 658 | is_suffix (const char *str, const char *suffix) |
14f9c5c9 AS |
659 | { |
660 | int len1, len2; | |
5b4ee69b | 661 | |
14f9c5c9 AS |
662 | if (str == NULL) |
663 | return 0; | |
664 | len1 = strlen (str); | |
665 | len2 = strlen (suffix); | |
4c4b4cd2 | 666 | return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0); |
14f9c5c9 AS |
667 | } |
668 | ||
4c4b4cd2 PH |
669 | /* The contents of value VAL, treated as a value of type TYPE. The |
670 | result is an lval in memory if VAL is. */ | |
14f9c5c9 | 671 | |
d2e4a39e | 672 | static struct value * |
4c4b4cd2 | 673 | coerce_unspec_val_to_type (struct value *val, struct type *type) |
14f9c5c9 | 674 | { |
61ee279c | 675 | type = ada_check_typedef (type); |
df407dfe | 676 | if (value_type (val) == type) |
4c4b4cd2 | 677 | return val; |
d2e4a39e | 678 | else |
14f9c5c9 | 679 | { |
4c4b4cd2 PH |
680 | struct value *result; |
681 | ||
682 | /* Make sure that the object size is not unreasonable before | |
683 | trying to allocate some memory for it. */ | |
c1b5a1a6 | 684 | ada_ensure_varsize_limit (type); |
4c4b4cd2 | 685 | |
41e8491f JK |
686 | if (value_lazy (val) |
687 | || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val))) | |
688 | result = allocate_value_lazy (type); | |
689 | else | |
690 | { | |
691 | result = allocate_value (type); | |
9a0dc9e3 | 692 | value_contents_copy_raw (result, 0, val, 0, TYPE_LENGTH (type)); |
41e8491f | 693 | } |
74bcbdf3 | 694 | set_value_component_location (result, val); |
9bbda503 AC |
695 | set_value_bitsize (result, value_bitsize (val)); |
696 | set_value_bitpos (result, value_bitpos (val)); | |
42ae5230 | 697 | set_value_address (result, value_address (val)); |
14f9c5c9 AS |
698 | return result; |
699 | } | |
700 | } | |
701 | ||
fc1a4b47 AC |
702 | static const gdb_byte * |
703 | cond_offset_host (const gdb_byte *valaddr, long offset) | |
14f9c5c9 AS |
704 | { |
705 | if (valaddr == NULL) | |
706 | return NULL; | |
707 | else | |
708 | return valaddr + offset; | |
709 | } | |
710 | ||
711 | static CORE_ADDR | |
ebf56fd3 | 712 | cond_offset_target (CORE_ADDR address, long offset) |
14f9c5c9 AS |
713 | { |
714 | if (address == 0) | |
715 | return 0; | |
d2e4a39e | 716 | else |
14f9c5c9 AS |
717 | return address + offset; |
718 | } | |
719 | ||
4c4b4cd2 PH |
720 | /* Issue a warning (as for the definition of warning in utils.c, but |
721 | with exactly one argument rather than ...), unless the limit on the | |
722 | number of warnings has passed during the evaluation of the current | |
723 | expression. */ | |
a2249542 | 724 | |
77109804 AC |
725 | /* FIXME: cagney/2004-10-10: This function is mimicking the behavior |
726 | provided by "complaint". */ | |
a0b31db1 | 727 | static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2); |
77109804 | 728 | |
14f9c5c9 | 729 | static void |
a2249542 | 730 | lim_warning (const char *format, ...) |
14f9c5c9 | 731 | { |
a2249542 | 732 | va_list args; |
a2249542 | 733 | |
5b4ee69b | 734 | va_start (args, format); |
4c4b4cd2 PH |
735 | warnings_issued += 1; |
736 | if (warnings_issued <= warning_limit) | |
a2249542 MK |
737 | vwarning (format, args); |
738 | ||
739 | va_end (args); | |
4c4b4cd2 PH |
740 | } |
741 | ||
714e53ab PH |
742 | /* Issue an error if the size of an object of type T is unreasonable, |
743 | i.e. if it would be a bad idea to allocate a value of this type in | |
744 | GDB. */ | |
745 | ||
c1b5a1a6 JB |
746 | void |
747 | ada_ensure_varsize_limit (const struct type *type) | |
714e53ab PH |
748 | { |
749 | if (TYPE_LENGTH (type) > varsize_limit) | |
323e0a4a | 750 | error (_("object size is larger than varsize-limit")); |
714e53ab PH |
751 | } |
752 | ||
0963b4bd | 753 | /* Maximum value of a SIZE-byte signed integer type. */ |
4c4b4cd2 | 754 | static LONGEST |
c3e5cd34 | 755 | max_of_size (int size) |
4c4b4cd2 | 756 | { |
76a01679 | 757 | LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2); |
5b4ee69b | 758 | |
76a01679 | 759 | return top_bit | (top_bit - 1); |
4c4b4cd2 PH |
760 | } |
761 | ||
0963b4bd | 762 | /* Minimum value of a SIZE-byte signed integer type. */ |
4c4b4cd2 | 763 | static LONGEST |
c3e5cd34 | 764 | min_of_size (int size) |
4c4b4cd2 | 765 | { |
c3e5cd34 | 766 | return -max_of_size (size) - 1; |
4c4b4cd2 PH |
767 | } |
768 | ||
0963b4bd | 769 | /* Maximum value of a SIZE-byte unsigned integer type. */ |
4c4b4cd2 | 770 | static ULONGEST |
c3e5cd34 | 771 | umax_of_size (int size) |
4c4b4cd2 | 772 | { |
76a01679 | 773 | ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1); |
5b4ee69b | 774 | |
76a01679 | 775 | return top_bit | (top_bit - 1); |
4c4b4cd2 PH |
776 | } |
777 | ||
0963b4bd | 778 | /* Maximum value of integral type T, as a signed quantity. */ |
c3e5cd34 PH |
779 | static LONGEST |
780 | max_of_type (struct type *t) | |
4c4b4cd2 | 781 | { |
c3e5cd34 PH |
782 | if (TYPE_UNSIGNED (t)) |
783 | return (LONGEST) umax_of_size (TYPE_LENGTH (t)); | |
784 | else | |
785 | return max_of_size (TYPE_LENGTH (t)); | |
786 | } | |
787 | ||
0963b4bd | 788 | /* Minimum value of integral type T, as a signed quantity. */ |
c3e5cd34 PH |
789 | static LONGEST |
790 | min_of_type (struct type *t) | |
791 | { | |
792 | if (TYPE_UNSIGNED (t)) | |
793 | return 0; | |
794 | else | |
795 | return min_of_size (TYPE_LENGTH (t)); | |
4c4b4cd2 PH |
796 | } |
797 | ||
798 | /* The largest value in the domain of TYPE, a discrete type, as an integer. */ | |
43bbcdc2 PH |
799 | LONGEST |
800 | ada_discrete_type_high_bound (struct type *type) | |
4c4b4cd2 | 801 | { |
c3345124 | 802 | type = resolve_dynamic_type (type, NULL, 0); |
76a01679 | 803 | switch (TYPE_CODE (type)) |
4c4b4cd2 PH |
804 | { |
805 | case TYPE_CODE_RANGE: | |
690cc4eb | 806 | return TYPE_HIGH_BOUND (type); |
4c4b4cd2 | 807 | case TYPE_CODE_ENUM: |
14e75d8e | 808 | return TYPE_FIELD_ENUMVAL (type, TYPE_NFIELDS (type) - 1); |
690cc4eb PH |
809 | case TYPE_CODE_BOOL: |
810 | return 1; | |
811 | case TYPE_CODE_CHAR: | |
76a01679 | 812 | case TYPE_CODE_INT: |
690cc4eb | 813 | return max_of_type (type); |
4c4b4cd2 | 814 | default: |
43bbcdc2 | 815 | error (_("Unexpected type in ada_discrete_type_high_bound.")); |
4c4b4cd2 PH |
816 | } |
817 | } | |
818 | ||
14e75d8e | 819 | /* The smallest value in the domain of TYPE, a discrete type, as an integer. */ |
43bbcdc2 PH |
820 | LONGEST |
821 | ada_discrete_type_low_bound (struct type *type) | |
4c4b4cd2 | 822 | { |
c3345124 | 823 | type = resolve_dynamic_type (type, NULL, 0); |
76a01679 | 824 | switch (TYPE_CODE (type)) |
4c4b4cd2 PH |
825 | { |
826 | case TYPE_CODE_RANGE: | |
690cc4eb | 827 | return TYPE_LOW_BOUND (type); |
4c4b4cd2 | 828 | case TYPE_CODE_ENUM: |
14e75d8e | 829 | return TYPE_FIELD_ENUMVAL (type, 0); |
690cc4eb PH |
830 | case TYPE_CODE_BOOL: |
831 | return 0; | |
832 | case TYPE_CODE_CHAR: | |
76a01679 | 833 | case TYPE_CODE_INT: |
690cc4eb | 834 | return min_of_type (type); |
4c4b4cd2 | 835 | default: |
43bbcdc2 | 836 | error (_("Unexpected type in ada_discrete_type_low_bound.")); |
4c4b4cd2 PH |
837 | } |
838 | } | |
839 | ||
840 | /* The identity on non-range types. For range types, the underlying | |
76a01679 | 841 | non-range scalar type. */ |
4c4b4cd2 PH |
842 | |
843 | static struct type * | |
18af8284 | 844 | get_base_type (struct type *type) |
4c4b4cd2 PH |
845 | { |
846 | while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE) | |
847 | { | |
76a01679 JB |
848 | if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL) |
849 | return type; | |
4c4b4cd2 PH |
850 | type = TYPE_TARGET_TYPE (type); |
851 | } | |
852 | return type; | |
14f9c5c9 | 853 | } |
41246937 JB |
854 | |
855 | /* Return a decoded version of the given VALUE. This means returning | |
856 | a value whose type is obtained by applying all the GNAT-specific | |
857 | encondings, making the resulting type a static but standard description | |
858 | of the initial type. */ | |
859 | ||
860 | struct value * | |
861 | ada_get_decoded_value (struct value *value) | |
862 | { | |
863 | struct type *type = ada_check_typedef (value_type (value)); | |
864 | ||
865 | if (ada_is_array_descriptor_type (type) | |
866 | || (ada_is_constrained_packed_array_type (type) | |
867 | && TYPE_CODE (type) != TYPE_CODE_PTR)) | |
868 | { | |
869 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) /* array access type. */ | |
870 | value = ada_coerce_to_simple_array_ptr (value); | |
871 | else | |
872 | value = ada_coerce_to_simple_array (value); | |
873 | } | |
874 | else | |
875 | value = ada_to_fixed_value (value); | |
876 | ||
877 | return value; | |
878 | } | |
879 | ||
880 | /* Same as ada_get_decoded_value, but with the given TYPE. | |
881 | Because there is no associated actual value for this type, | |
882 | the resulting type might be a best-effort approximation in | |
883 | the case of dynamic types. */ | |
884 | ||
885 | struct type * | |
886 | ada_get_decoded_type (struct type *type) | |
887 | { | |
888 | type = to_static_fixed_type (type); | |
889 | if (ada_is_constrained_packed_array_type (type)) | |
890 | type = ada_coerce_to_simple_array_type (type); | |
891 | return type; | |
892 | } | |
893 | ||
4c4b4cd2 | 894 | \f |
76a01679 | 895 | |
4c4b4cd2 | 896 | /* Language Selection */ |
14f9c5c9 AS |
897 | |
898 | /* If the main program is in Ada, return language_ada, otherwise return LANG | |
ccefe4c4 | 899 | (the main program is in Ada iif the adainit symbol is found). */ |
d2e4a39e | 900 | |
14f9c5c9 | 901 | enum language |
ccefe4c4 | 902 | ada_update_initial_language (enum language lang) |
14f9c5c9 | 903 | { |
d2e4a39e | 904 | if (lookup_minimal_symbol ("adainit", (const char *) NULL, |
3b7344d5 | 905 | (struct objfile *) NULL).minsym != NULL) |
4c4b4cd2 | 906 | return language_ada; |
14f9c5c9 AS |
907 | |
908 | return lang; | |
909 | } | |
96d887e8 PH |
910 | |
911 | /* If the main procedure is written in Ada, then return its name. | |
912 | The result is good until the next call. Return NULL if the main | |
913 | procedure doesn't appear to be in Ada. */ | |
914 | ||
915 | char * | |
916 | ada_main_name (void) | |
917 | { | |
3b7344d5 | 918 | struct bound_minimal_symbol msym; |
f9bc20b9 | 919 | static char *main_program_name = NULL; |
6c038f32 | 920 | |
96d887e8 PH |
921 | /* For Ada, the name of the main procedure is stored in a specific |
922 | string constant, generated by the binder. Look for that symbol, | |
923 | extract its address, and then read that string. If we didn't find | |
924 | that string, then most probably the main procedure is not written | |
925 | in Ada. */ | |
926 | msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL); | |
927 | ||
3b7344d5 | 928 | if (msym.minsym != NULL) |
96d887e8 | 929 | { |
f9bc20b9 JB |
930 | CORE_ADDR main_program_name_addr; |
931 | int err_code; | |
932 | ||
77e371c0 | 933 | main_program_name_addr = BMSYMBOL_VALUE_ADDRESS (msym); |
96d887e8 | 934 | if (main_program_name_addr == 0) |
323e0a4a | 935 | error (_("Invalid address for Ada main program name.")); |
96d887e8 | 936 | |
f9bc20b9 JB |
937 | xfree (main_program_name); |
938 | target_read_string (main_program_name_addr, &main_program_name, | |
939 | 1024, &err_code); | |
940 | ||
941 | if (err_code != 0) | |
942 | return NULL; | |
96d887e8 PH |
943 | return main_program_name; |
944 | } | |
945 | ||
946 | /* The main procedure doesn't seem to be in Ada. */ | |
947 | return NULL; | |
948 | } | |
14f9c5c9 | 949 | \f |
4c4b4cd2 | 950 | /* Symbols */ |
d2e4a39e | 951 | |
4c4b4cd2 PH |
952 | /* Table of Ada operators and their GNAT-encoded names. Last entry is pair |
953 | of NULLs. */ | |
14f9c5c9 | 954 | |
d2e4a39e AS |
955 | const struct ada_opname_map ada_opname_table[] = { |
956 | {"Oadd", "\"+\"", BINOP_ADD}, | |
957 | {"Osubtract", "\"-\"", BINOP_SUB}, | |
958 | {"Omultiply", "\"*\"", BINOP_MUL}, | |
959 | {"Odivide", "\"/\"", BINOP_DIV}, | |
960 | {"Omod", "\"mod\"", BINOP_MOD}, | |
961 | {"Orem", "\"rem\"", BINOP_REM}, | |
962 | {"Oexpon", "\"**\"", BINOP_EXP}, | |
963 | {"Olt", "\"<\"", BINOP_LESS}, | |
964 | {"Ole", "\"<=\"", BINOP_LEQ}, | |
965 | {"Ogt", "\">\"", BINOP_GTR}, | |
966 | {"Oge", "\">=\"", BINOP_GEQ}, | |
967 | {"Oeq", "\"=\"", BINOP_EQUAL}, | |
968 | {"One", "\"/=\"", BINOP_NOTEQUAL}, | |
969 | {"Oand", "\"and\"", BINOP_BITWISE_AND}, | |
970 | {"Oor", "\"or\"", BINOP_BITWISE_IOR}, | |
971 | {"Oxor", "\"xor\"", BINOP_BITWISE_XOR}, | |
972 | {"Oconcat", "\"&\"", BINOP_CONCAT}, | |
973 | {"Oabs", "\"abs\"", UNOP_ABS}, | |
974 | {"Onot", "\"not\"", UNOP_LOGICAL_NOT}, | |
975 | {"Oadd", "\"+\"", UNOP_PLUS}, | |
976 | {"Osubtract", "\"-\"", UNOP_NEG}, | |
977 | {NULL, NULL} | |
14f9c5c9 AS |
978 | }; |
979 | ||
4c4b4cd2 PH |
980 | /* The "encoded" form of DECODED, according to GNAT conventions. |
981 | The result is valid until the next call to ada_encode. */ | |
982 | ||
14f9c5c9 | 983 | char * |
4c4b4cd2 | 984 | ada_encode (const char *decoded) |
14f9c5c9 | 985 | { |
4c4b4cd2 PH |
986 | static char *encoding_buffer = NULL; |
987 | static size_t encoding_buffer_size = 0; | |
d2e4a39e | 988 | const char *p; |
14f9c5c9 | 989 | int k; |
d2e4a39e | 990 | |
4c4b4cd2 | 991 | if (decoded == NULL) |
14f9c5c9 AS |
992 | return NULL; |
993 | ||
4c4b4cd2 PH |
994 | GROW_VECT (encoding_buffer, encoding_buffer_size, |
995 | 2 * strlen (decoded) + 10); | |
14f9c5c9 AS |
996 | |
997 | k = 0; | |
4c4b4cd2 | 998 | for (p = decoded; *p != '\0'; p += 1) |
14f9c5c9 | 999 | { |
cdc7bb92 | 1000 | if (*p == '.') |
4c4b4cd2 PH |
1001 | { |
1002 | encoding_buffer[k] = encoding_buffer[k + 1] = '_'; | |
1003 | k += 2; | |
1004 | } | |
14f9c5c9 | 1005 | else if (*p == '"') |
4c4b4cd2 PH |
1006 | { |
1007 | const struct ada_opname_map *mapping; | |
1008 | ||
1009 | for (mapping = ada_opname_table; | |
1265e4aa | 1010 | mapping->encoded != NULL |
61012eef | 1011 | && !startswith (p, mapping->decoded); mapping += 1) |
4c4b4cd2 PH |
1012 | ; |
1013 | if (mapping->encoded == NULL) | |
323e0a4a | 1014 | error (_("invalid Ada operator name: %s"), p); |
4c4b4cd2 PH |
1015 | strcpy (encoding_buffer + k, mapping->encoded); |
1016 | k += strlen (mapping->encoded); | |
1017 | break; | |
1018 | } | |
d2e4a39e | 1019 | else |
4c4b4cd2 PH |
1020 | { |
1021 | encoding_buffer[k] = *p; | |
1022 | k += 1; | |
1023 | } | |
14f9c5c9 AS |
1024 | } |
1025 | ||
4c4b4cd2 PH |
1026 | encoding_buffer[k] = '\0'; |
1027 | return encoding_buffer; | |
14f9c5c9 AS |
1028 | } |
1029 | ||
1030 | /* Return NAME folded to lower case, or, if surrounded by single | |
4c4b4cd2 PH |
1031 | quotes, unfolded, but with the quotes stripped away. Result good |
1032 | to next call. */ | |
1033 | ||
d2e4a39e AS |
1034 | char * |
1035 | ada_fold_name (const char *name) | |
14f9c5c9 | 1036 | { |
d2e4a39e | 1037 | static char *fold_buffer = NULL; |
14f9c5c9 AS |
1038 | static size_t fold_buffer_size = 0; |
1039 | ||
1040 | int len = strlen (name); | |
d2e4a39e | 1041 | GROW_VECT (fold_buffer, fold_buffer_size, len + 1); |
14f9c5c9 AS |
1042 | |
1043 | if (name[0] == '\'') | |
1044 | { | |
d2e4a39e AS |
1045 | strncpy (fold_buffer, name + 1, len - 2); |
1046 | fold_buffer[len - 2] = '\000'; | |
14f9c5c9 AS |
1047 | } |
1048 | else | |
1049 | { | |
1050 | int i; | |
5b4ee69b | 1051 | |
14f9c5c9 | 1052 | for (i = 0; i <= len; i += 1) |
4c4b4cd2 | 1053 | fold_buffer[i] = tolower (name[i]); |
14f9c5c9 AS |
1054 | } |
1055 | ||
1056 | return fold_buffer; | |
1057 | } | |
1058 | ||
529cad9c PH |
1059 | /* Return nonzero if C is either a digit or a lowercase alphabet character. */ |
1060 | ||
1061 | static int | |
1062 | is_lower_alphanum (const char c) | |
1063 | { | |
1064 | return (isdigit (c) || (isalpha (c) && islower (c))); | |
1065 | } | |
1066 | ||
c90092fe JB |
1067 | /* ENCODED is the linkage name of a symbol and LEN contains its length. |
1068 | This function saves in LEN the length of that same symbol name but | |
1069 | without either of these suffixes: | |
29480c32 JB |
1070 | . .{DIGIT}+ |
1071 | . ${DIGIT}+ | |
1072 | . ___{DIGIT}+ | |
1073 | . __{DIGIT}+. | |
c90092fe | 1074 | |
29480c32 JB |
1075 | These are suffixes introduced by the compiler for entities such as |
1076 | nested subprogram for instance, in order to avoid name clashes. | |
1077 | They do not serve any purpose for the debugger. */ | |
1078 | ||
1079 | static void | |
1080 | ada_remove_trailing_digits (const char *encoded, int *len) | |
1081 | { | |
1082 | if (*len > 1 && isdigit (encoded[*len - 1])) | |
1083 | { | |
1084 | int i = *len - 2; | |
5b4ee69b | 1085 | |
29480c32 JB |
1086 | while (i > 0 && isdigit (encoded[i])) |
1087 | i--; | |
1088 | if (i >= 0 && encoded[i] == '.') | |
1089 | *len = i; | |
1090 | else if (i >= 0 && encoded[i] == '$') | |
1091 | *len = i; | |
61012eef | 1092 | else if (i >= 2 && startswith (encoded + i - 2, "___")) |
29480c32 | 1093 | *len = i - 2; |
61012eef | 1094 | else if (i >= 1 && startswith (encoded + i - 1, "__")) |
29480c32 JB |
1095 | *len = i - 1; |
1096 | } | |
1097 | } | |
1098 | ||
1099 | /* Remove the suffix introduced by the compiler for protected object | |
1100 | subprograms. */ | |
1101 | ||
1102 | static void | |
1103 | ada_remove_po_subprogram_suffix (const char *encoded, int *len) | |
1104 | { | |
1105 | /* Remove trailing N. */ | |
1106 | ||
1107 | /* Protected entry subprograms are broken into two | |
1108 | separate subprograms: The first one is unprotected, and has | |
1109 | a 'N' suffix; the second is the protected version, and has | |
0963b4bd | 1110 | the 'P' suffix. The second calls the first one after handling |
29480c32 JB |
1111 | the protection. Since the P subprograms are internally generated, |
1112 | we leave these names undecoded, giving the user a clue that this | |
1113 | entity is internal. */ | |
1114 | ||
1115 | if (*len > 1 | |
1116 | && encoded[*len - 1] == 'N' | |
1117 | && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2]))) | |
1118 | *len = *len - 1; | |
1119 | } | |
1120 | ||
69fadcdf JB |
1121 | /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */ |
1122 | ||
1123 | static void | |
1124 | ada_remove_Xbn_suffix (const char *encoded, int *len) | |
1125 | { | |
1126 | int i = *len - 1; | |
1127 | ||
1128 | while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n')) | |
1129 | i--; | |
1130 | ||
1131 | if (encoded[i] != 'X') | |
1132 | return; | |
1133 | ||
1134 | if (i == 0) | |
1135 | return; | |
1136 | ||
1137 | if (isalnum (encoded[i-1])) | |
1138 | *len = i; | |
1139 | } | |
1140 | ||
29480c32 JB |
1141 | /* If ENCODED follows the GNAT entity encoding conventions, then return |
1142 | the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is | |
1143 | replaced by ENCODED. | |
14f9c5c9 | 1144 | |
4c4b4cd2 | 1145 | The resulting string is valid until the next call of ada_decode. |
29480c32 | 1146 | If the string is unchanged by decoding, the original string pointer |
4c4b4cd2 PH |
1147 | is returned. */ |
1148 | ||
1149 | const char * | |
1150 | ada_decode (const char *encoded) | |
14f9c5c9 AS |
1151 | { |
1152 | int i, j; | |
1153 | int len0; | |
d2e4a39e | 1154 | const char *p; |
4c4b4cd2 | 1155 | char *decoded; |
14f9c5c9 | 1156 | int at_start_name; |
4c4b4cd2 PH |
1157 | static char *decoding_buffer = NULL; |
1158 | static size_t decoding_buffer_size = 0; | |
d2e4a39e | 1159 | |
29480c32 JB |
1160 | /* The name of the Ada main procedure starts with "_ada_". |
1161 | This prefix is not part of the decoded name, so skip this part | |
1162 | if we see this prefix. */ | |
61012eef | 1163 | if (startswith (encoded, "_ada_")) |
4c4b4cd2 | 1164 | encoded += 5; |
14f9c5c9 | 1165 | |
29480c32 JB |
1166 | /* If the name starts with '_', then it is not a properly encoded |
1167 | name, so do not attempt to decode it. Similarly, if the name | |
1168 | starts with '<', the name should not be decoded. */ | |
4c4b4cd2 | 1169 | if (encoded[0] == '_' || encoded[0] == '<') |
14f9c5c9 AS |
1170 | goto Suppress; |
1171 | ||
4c4b4cd2 | 1172 | len0 = strlen (encoded); |
4c4b4cd2 | 1173 | |
29480c32 JB |
1174 | ada_remove_trailing_digits (encoded, &len0); |
1175 | ada_remove_po_subprogram_suffix (encoded, &len0); | |
529cad9c | 1176 | |
4c4b4cd2 PH |
1177 | /* Remove the ___X.* suffix if present. Do not forget to verify that |
1178 | the suffix is located before the current "end" of ENCODED. We want | |
1179 | to avoid re-matching parts of ENCODED that have previously been | |
1180 | marked as discarded (by decrementing LEN0). */ | |
1181 | p = strstr (encoded, "___"); | |
1182 | if (p != NULL && p - encoded < len0 - 3) | |
14f9c5c9 AS |
1183 | { |
1184 | if (p[3] == 'X') | |
4c4b4cd2 | 1185 | len0 = p - encoded; |
14f9c5c9 | 1186 | else |
4c4b4cd2 | 1187 | goto Suppress; |
14f9c5c9 | 1188 | } |
4c4b4cd2 | 1189 | |
29480c32 JB |
1190 | /* Remove any trailing TKB suffix. It tells us that this symbol |
1191 | is for the body of a task, but that information does not actually | |
1192 | appear in the decoded name. */ | |
1193 | ||
61012eef | 1194 | if (len0 > 3 && startswith (encoded + len0 - 3, "TKB")) |
14f9c5c9 | 1195 | len0 -= 3; |
76a01679 | 1196 | |
a10967fa JB |
1197 | /* Remove any trailing TB suffix. The TB suffix is slightly different |
1198 | from the TKB suffix because it is used for non-anonymous task | |
1199 | bodies. */ | |
1200 | ||
61012eef | 1201 | if (len0 > 2 && startswith (encoded + len0 - 2, "TB")) |
a10967fa JB |
1202 | len0 -= 2; |
1203 | ||
29480c32 JB |
1204 | /* Remove trailing "B" suffixes. */ |
1205 | /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */ | |
1206 | ||
61012eef | 1207 | if (len0 > 1 && startswith (encoded + len0 - 1, "B")) |
14f9c5c9 AS |
1208 | len0 -= 1; |
1209 | ||
4c4b4cd2 | 1210 | /* Make decoded big enough for possible expansion by operator name. */ |
29480c32 | 1211 | |
4c4b4cd2 PH |
1212 | GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1); |
1213 | decoded = decoding_buffer; | |
14f9c5c9 | 1214 | |
29480c32 JB |
1215 | /* Remove trailing __{digit}+ or trailing ${digit}+. */ |
1216 | ||
4c4b4cd2 | 1217 | if (len0 > 1 && isdigit (encoded[len0 - 1])) |
d2e4a39e | 1218 | { |
4c4b4cd2 PH |
1219 | i = len0 - 2; |
1220 | while ((i >= 0 && isdigit (encoded[i])) | |
1221 | || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1]))) | |
1222 | i -= 1; | |
1223 | if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_') | |
1224 | len0 = i - 1; | |
1225 | else if (encoded[i] == '$') | |
1226 | len0 = i; | |
d2e4a39e | 1227 | } |
14f9c5c9 | 1228 | |
29480c32 JB |
1229 | /* The first few characters that are not alphabetic are not part |
1230 | of any encoding we use, so we can copy them over verbatim. */ | |
1231 | ||
4c4b4cd2 PH |
1232 | for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1) |
1233 | decoded[j] = encoded[i]; | |
14f9c5c9 AS |
1234 | |
1235 | at_start_name = 1; | |
1236 | while (i < len0) | |
1237 | { | |
29480c32 | 1238 | /* Is this a symbol function? */ |
4c4b4cd2 PH |
1239 | if (at_start_name && encoded[i] == 'O') |
1240 | { | |
1241 | int k; | |
5b4ee69b | 1242 | |
4c4b4cd2 PH |
1243 | for (k = 0; ada_opname_table[k].encoded != NULL; k += 1) |
1244 | { | |
1245 | int op_len = strlen (ada_opname_table[k].encoded); | |
06d5cf63 JB |
1246 | if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1, |
1247 | op_len - 1) == 0) | |
1248 | && !isalnum (encoded[i + op_len])) | |
4c4b4cd2 PH |
1249 | { |
1250 | strcpy (decoded + j, ada_opname_table[k].decoded); | |
1251 | at_start_name = 0; | |
1252 | i += op_len; | |
1253 | j += strlen (ada_opname_table[k].decoded); | |
1254 | break; | |
1255 | } | |
1256 | } | |
1257 | if (ada_opname_table[k].encoded != NULL) | |
1258 | continue; | |
1259 | } | |
14f9c5c9 AS |
1260 | at_start_name = 0; |
1261 | ||
529cad9c PH |
1262 | /* Replace "TK__" with "__", which will eventually be translated |
1263 | into "." (just below). */ | |
1264 | ||
61012eef | 1265 | if (i < len0 - 4 && startswith (encoded + i, "TK__")) |
4c4b4cd2 | 1266 | i += 2; |
529cad9c | 1267 | |
29480c32 JB |
1268 | /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually |
1269 | be translated into "." (just below). These are internal names | |
1270 | generated for anonymous blocks inside which our symbol is nested. */ | |
1271 | ||
1272 | if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_' | |
1273 | && encoded [i+2] == 'B' && encoded [i+3] == '_' | |
1274 | && isdigit (encoded [i+4])) | |
1275 | { | |
1276 | int k = i + 5; | |
1277 | ||
1278 | while (k < len0 && isdigit (encoded[k])) | |
1279 | k++; /* Skip any extra digit. */ | |
1280 | ||
1281 | /* Double-check that the "__B_{DIGITS}+" sequence we found | |
1282 | is indeed followed by "__". */ | |
1283 | if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_') | |
1284 | i = k; | |
1285 | } | |
1286 | ||
529cad9c PH |
1287 | /* Remove _E{DIGITS}+[sb] */ |
1288 | ||
1289 | /* Just as for protected object subprograms, there are 2 categories | |
0963b4bd | 1290 | of subprograms created by the compiler for each entry. The first |
529cad9c PH |
1291 | one implements the actual entry code, and has a suffix following |
1292 | the convention above; the second one implements the barrier and | |
1293 | uses the same convention as above, except that the 'E' is replaced | |
1294 | by a 'B'. | |
1295 | ||
1296 | Just as above, we do not decode the name of barrier functions | |
1297 | to give the user a clue that the code he is debugging has been | |
1298 | internally generated. */ | |
1299 | ||
1300 | if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E' | |
1301 | && isdigit (encoded[i+2])) | |
1302 | { | |
1303 | int k = i + 3; | |
1304 | ||
1305 | while (k < len0 && isdigit (encoded[k])) | |
1306 | k++; | |
1307 | ||
1308 | if (k < len0 | |
1309 | && (encoded[k] == 'b' || encoded[k] == 's')) | |
1310 | { | |
1311 | k++; | |
1312 | /* Just as an extra precaution, make sure that if this | |
1313 | suffix is followed by anything else, it is a '_'. | |
1314 | Otherwise, we matched this sequence by accident. */ | |
1315 | if (k == len0 | |
1316 | || (k < len0 && encoded[k] == '_')) | |
1317 | i = k; | |
1318 | } | |
1319 | } | |
1320 | ||
1321 | /* Remove trailing "N" in [a-z0-9]+N__. The N is added by | |
1322 | the GNAT front-end in protected object subprograms. */ | |
1323 | ||
1324 | if (i < len0 + 3 | |
1325 | && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_') | |
1326 | { | |
1327 | /* Backtrack a bit up until we reach either the begining of | |
1328 | the encoded name, or "__". Make sure that we only find | |
1329 | digits or lowercase characters. */ | |
1330 | const char *ptr = encoded + i - 1; | |
1331 | ||
1332 | while (ptr >= encoded && is_lower_alphanum (ptr[0])) | |
1333 | ptr--; | |
1334 | if (ptr < encoded | |
1335 | || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_')) | |
1336 | i++; | |
1337 | } | |
1338 | ||
4c4b4cd2 PH |
1339 | if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1])) |
1340 | { | |
29480c32 JB |
1341 | /* This is a X[bn]* sequence not separated from the previous |
1342 | part of the name with a non-alpha-numeric character (in other | |
1343 | words, immediately following an alpha-numeric character), then | |
1344 | verify that it is placed at the end of the encoded name. If | |
1345 | not, then the encoding is not valid and we should abort the | |
1346 | decoding. Otherwise, just skip it, it is used in body-nested | |
1347 | package names. */ | |
4c4b4cd2 PH |
1348 | do |
1349 | i += 1; | |
1350 | while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n')); | |
1351 | if (i < len0) | |
1352 | goto Suppress; | |
1353 | } | |
cdc7bb92 | 1354 | else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_') |
4c4b4cd2 | 1355 | { |
29480c32 | 1356 | /* Replace '__' by '.'. */ |
4c4b4cd2 PH |
1357 | decoded[j] = '.'; |
1358 | at_start_name = 1; | |
1359 | i += 2; | |
1360 | j += 1; | |
1361 | } | |
14f9c5c9 | 1362 | else |
4c4b4cd2 | 1363 | { |
29480c32 JB |
1364 | /* It's a character part of the decoded name, so just copy it |
1365 | over. */ | |
4c4b4cd2 PH |
1366 | decoded[j] = encoded[i]; |
1367 | i += 1; | |
1368 | j += 1; | |
1369 | } | |
14f9c5c9 | 1370 | } |
4c4b4cd2 | 1371 | decoded[j] = '\000'; |
14f9c5c9 | 1372 | |
29480c32 JB |
1373 | /* Decoded names should never contain any uppercase character. |
1374 | Double-check this, and abort the decoding if we find one. */ | |
1375 | ||
4c4b4cd2 PH |
1376 | for (i = 0; decoded[i] != '\0'; i += 1) |
1377 | if (isupper (decoded[i]) || decoded[i] == ' ') | |
14f9c5c9 AS |
1378 | goto Suppress; |
1379 | ||
4c4b4cd2 PH |
1380 | if (strcmp (decoded, encoded) == 0) |
1381 | return encoded; | |
1382 | else | |
1383 | return decoded; | |
14f9c5c9 AS |
1384 | |
1385 | Suppress: | |
4c4b4cd2 PH |
1386 | GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3); |
1387 | decoded = decoding_buffer; | |
1388 | if (encoded[0] == '<') | |
1389 | strcpy (decoded, encoded); | |
14f9c5c9 | 1390 | else |
88c15c34 | 1391 | xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded); |
4c4b4cd2 PH |
1392 | return decoded; |
1393 | ||
1394 | } | |
1395 | ||
1396 | /* Table for keeping permanent unique copies of decoded names. Once | |
1397 | allocated, names in this table are never released. While this is a | |
1398 | storage leak, it should not be significant unless there are massive | |
1399 | changes in the set of decoded names in successive versions of a | |
1400 | symbol table loaded during a single session. */ | |
1401 | static struct htab *decoded_names_store; | |
1402 | ||
1403 | /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it | |
1404 | in the language-specific part of GSYMBOL, if it has not been | |
1405 | previously computed. Tries to save the decoded name in the same | |
1406 | obstack as GSYMBOL, if possible, and otherwise on the heap (so that, | |
1407 | in any case, the decoded symbol has a lifetime at least that of | |
0963b4bd | 1408 | GSYMBOL). |
4c4b4cd2 PH |
1409 | The GSYMBOL parameter is "mutable" in the C++ sense: logically |
1410 | const, but nevertheless modified to a semantically equivalent form | |
0963b4bd | 1411 | when a decoded name is cached in it. */ |
4c4b4cd2 | 1412 | |
45e6c716 | 1413 | const char * |
f85f34ed | 1414 | ada_decode_symbol (const struct general_symbol_info *arg) |
4c4b4cd2 | 1415 | { |
f85f34ed TT |
1416 | struct general_symbol_info *gsymbol = (struct general_symbol_info *) arg; |
1417 | const char **resultp = | |
615b3f62 | 1418 | &gsymbol->language_specific.demangled_name; |
5b4ee69b | 1419 | |
f85f34ed | 1420 | if (!gsymbol->ada_mangled) |
4c4b4cd2 PH |
1421 | { |
1422 | const char *decoded = ada_decode (gsymbol->name); | |
f85f34ed | 1423 | struct obstack *obstack = gsymbol->language_specific.obstack; |
5b4ee69b | 1424 | |
f85f34ed | 1425 | gsymbol->ada_mangled = 1; |
5b4ee69b | 1426 | |
f85f34ed | 1427 | if (obstack != NULL) |
224c3ddb SM |
1428 | *resultp |
1429 | = (const char *) obstack_copy0 (obstack, decoded, strlen (decoded)); | |
f85f34ed | 1430 | else |
76a01679 | 1431 | { |
f85f34ed TT |
1432 | /* Sometimes, we can't find a corresponding objfile, in |
1433 | which case, we put the result on the heap. Since we only | |
1434 | decode when needed, we hope this usually does not cause a | |
1435 | significant memory leak (FIXME). */ | |
1436 | ||
76a01679 JB |
1437 | char **slot = (char **) htab_find_slot (decoded_names_store, |
1438 | decoded, INSERT); | |
5b4ee69b | 1439 | |
76a01679 JB |
1440 | if (*slot == NULL) |
1441 | *slot = xstrdup (decoded); | |
1442 | *resultp = *slot; | |
1443 | } | |
4c4b4cd2 | 1444 | } |
14f9c5c9 | 1445 | |
4c4b4cd2 PH |
1446 | return *resultp; |
1447 | } | |
76a01679 | 1448 | |
2c0b251b | 1449 | static char * |
76a01679 | 1450 | ada_la_decode (const char *encoded, int options) |
4c4b4cd2 PH |
1451 | { |
1452 | return xstrdup (ada_decode (encoded)); | |
14f9c5c9 AS |
1453 | } |
1454 | ||
1455 | /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing | |
4c4b4cd2 PH |
1456 | suffixes that encode debugging information or leading _ada_ on |
1457 | SYM_NAME (see is_name_suffix commentary for the debugging | |
1458 | information that is ignored). If WILD, then NAME need only match a | |
1459 | suffix of SYM_NAME minus the same suffixes. Also returns 0 if | |
1460 | either argument is NULL. */ | |
14f9c5c9 | 1461 | |
2c0b251b | 1462 | static int |
40658b94 | 1463 | match_name (const char *sym_name, const char *name, int wild) |
14f9c5c9 AS |
1464 | { |
1465 | if (sym_name == NULL || name == NULL) | |
1466 | return 0; | |
1467 | else if (wild) | |
73589123 | 1468 | return wild_match (sym_name, name) == 0; |
d2e4a39e AS |
1469 | else |
1470 | { | |
1471 | int len_name = strlen (name); | |
5b4ee69b | 1472 | |
4c4b4cd2 PH |
1473 | return (strncmp (sym_name, name, len_name) == 0 |
1474 | && is_name_suffix (sym_name + len_name)) | |
61012eef | 1475 | || (startswith (sym_name, "_ada_") |
4c4b4cd2 PH |
1476 | && strncmp (sym_name + 5, name, len_name) == 0 |
1477 | && is_name_suffix (sym_name + len_name + 5)); | |
d2e4a39e | 1478 | } |
14f9c5c9 | 1479 | } |
14f9c5c9 | 1480 | \f |
d2e4a39e | 1481 | |
4c4b4cd2 | 1482 | /* Arrays */ |
14f9c5c9 | 1483 | |
28c85d6c JB |
1484 | /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure |
1485 | generated by the GNAT compiler to describe the index type used | |
1486 | for each dimension of an array, check whether it follows the latest | |
1487 | known encoding. If not, fix it up to conform to the latest encoding. | |
1488 | Otherwise, do nothing. This function also does nothing if | |
1489 | INDEX_DESC_TYPE is NULL. | |
1490 | ||
1491 | The GNAT encoding used to describle the array index type evolved a bit. | |
1492 | Initially, the information would be provided through the name of each | |
1493 | field of the structure type only, while the type of these fields was | |
1494 | described as unspecified and irrelevant. The debugger was then expected | |
1495 | to perform a global type lookup using the name of that field in order | |
1496 | to get access to the full index type description. Because these global | |
1497 | lookups can be very expensive, the encoding was later enhanced to make | |
1498 | the global lookup unnecessary by defining the field type as being | |
1499 | the full index type description. | |
1500 | ||
1501 | The purpose of this routine is to allow us to support older versions | |
1502 | of the compiler by detecting the use of the older encoding, and by | |
1503 | fixing up the INDEX_DESC_TYPE to follow the new one (at this point, | |
1504 | we essentially replace each field's meaningless type by the associated | |
1505 | index subtype). */ | |
1506 | ||
1507 | void | |
1508 | ada_fixup_array_indexes_type (struct type *index_desc_type) | |
1509 | { | |
1510 | int i; | |
1511 | ||
1512 | if (index_desc_type == NULL) | |
1513 | return; | |
1514 | gdb_assert (TYPE_NFIELDS (index_desc_type) > 0); | |
1515 | ||
1516 | /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient | |
1517 | to check one field only, no need to check them all). If not, return | |
1518 | now. | |
1519 | ||
1520 | If our INDEX_DESC_TYPE was generated using the older encoding, | |
1521 | the field type should be a meaningless integer type whose name | |
1522 | is not equal to the field name. */ | |
1523 | if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL | |
1524 | && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)), | |
1525 | TYPE_FIELD_NAME (index_desc_type, 0)) == 0) | |
1526 | return; | |
1527 | ||
1528 | /* Fixup each field of INDEX_DESC_TYPE. */ | |
1529 | for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++) | |
1530 | { | |
0d5cff50 | 1531 | const char *name = TYPE_FIELD_NAME (index_desc_type, i); |
28c85d6c JB |
1532 | struct type *raw_type = ada_check_typedef (ada_find_any_type (name)); |
1533 | ||
1534 | if (raw_type) | |
1535 | TYPE_FIELD_TYPE (index_desc_type, i) = raw_type; | |
1536 | } | |
1537 | } | |
1538 | ||
4c4b4cd2 | 1539 | /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */ |
14f9c5c9 | 1540 | |
d2e4a39e AS |
1541 | static char *bound_name[] = { |
1542 | "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3", | |
14f9c5c9 AS |
1543 | "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7" |
1544 | }; | |
1545 | ||
1546 | /* Maximum number of array dimensions we are prepared to handle. */ | |
1547 | ||
4c4b4cd2 | 1548 | #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *))) |
14f9c5c9 | 1549 | |
14f9c5c9 | 1550 | |
4c4b4cd2 PH |
1551 | /* The desc_* routines return primitive portions of array descriptors |
1552 | (fat pointers). */ | |
14f9c5c9 AS |
1553 | |
1554 | /* The descriptor or array type, if any, indicated by TYPE; removes | |
4c4b4cd2 PH |
1555 | level of indirection, if needed. */ |
1556 | ||
d2e4a39e AS |
1557 | static struct type * |
1558 | desc_base_type (struct type *type) | |
14f9c5c9 AS |
1559 | { |
1560 | if (type == NULL) | |
1561 | return NULL; | |
61ee279c | 1562 | type = ada_check_typedef (type); |
720d1a40 JB |
1563 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) |
1564 | type = ada_typedef_target_type (type); | |
1565 | ||
1265e4aa JB |
1566 | if (type != NULL |
1567 | && (TYPE_CODE (type) == TYPE_CODE_PTR | |
1568 | || TYPE_CODE (type) == TYPE_CODE_REF)) | |
61ee279c | 1569 | return ada_check_typedef (TYPE_TARGET_TYPE (type)); |
14f9c5c9 AS |
1570 | else |
1571 | return type; | |
1572 | } | |
1573 | ||
4c4b4cd2 PH |
1574 | /* True iff TYPE indicates a "thin" array pointer type. */ |
1575 | ||
14f9c5c9 | 1576 | static int |
d2e4a39e | 1577 | is_thin_pntr (struct type *type) |
14f9c5c9 | 1578 | { |
d2e4a39e | 1579 | return |
14f9c5c9 AS |
1580 | is_suffix (ada_type_name (desc_base_type (type)), "___XUT") |
1581 | || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE"); | |
1582 | } | |
1583 | ||
4c4b4cd2 PH |
1584 | /* The descriptor type for thin pointer type TYPE. */ |
1585 | ||
d2e4a39e AS |
1586 | static struct type * |
1587 | thin_descriptor_type (struct type *type) | |
14f9c5c9 | 1588 | { |
d2e4a39e | 1589 | struct type *base_type = desc_base_type (type); |
5b4ee69b | 1590 | |
14f9c5c9 AS |
1591 | if (base_type == NULL) |
1592 | return NULL; | |
1593 | if (is_suffix (ada_type_name (base_type), "___XVE")) | |
1594 | return base_type; | |
d2e4a39e | 1595 | else |
14f9c5c9 | 1596 | { |
d2e4a39e | 1597 | struct type *alt_type = ada_find_parallel_type (base_type, "___XVE"); |
5b4ee69b | 1598 | |
14f9c5c9 | 1599 | if (alt_type == NULL) |
4c4b4cd2 | 1600 | return base_type; |
14f9c5c9 | 1601 | else |
4c4b4cd2 | 1602 | return alt_type; |
14f9c5c9 AS |
1603 | } |
1604 | } | |
1605 | ||
4c4b4cd2 PH |
1606 | /* A pointer to the array data for thin-pointer value VAL. */ |
1607 | ||
d2e4a39e AS |
1608 | static struct value * |
1609 | thin_data_pntr (struct value *val) | |
14f9c5c9 | 1610 | { |
828292f2 | 1611 | struct type *type = ada_check_typedef (value_type (val)); |
556bdfd4 | 1612 | struct type *data_type = desc_data_target_type (thin_descriptor_type (type)); |
5b4ee69b | 1613 | |
556bdfd4 UW |
1614 | data_type = lookup_pointer_type (data_type); |
1615 | ||
14f9c5c9 | 1616 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
556bdfd4 | 1617 | return value_cast (data_type, value_copy (val)); |
d2e4a39e | 1618 | else |
42ae5230 | 1619 | return value_from_longest (data_type, value_address (val)); |
14f9c5c9 AS |
1620 | } |
1621 | ||
4c4b4cd2 PH |
1622 | /* True iff TYPE indicates a "thick" array pointer type. */ |
1623 | ||
14f9c5c9 | 1624 | static int |
d2e4a39e | 1625 | is_thick_pntr (struct type *type) |
14f9c5c9 AS |
1626 | { |
1627 | type = desc_base_type (type); | |
1628 | return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT | |
4c4b4cd2 | 1629 | && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL); |
14f9c5c9 AS |
1630 | } |
1631 | ||
4c4b4cd2 PH |
1632 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a |
1633 | pointer to one, the type of its bounds data; otherwise, NULL. */ | |
76a01679 | 1634 | |
d2e4a39e AS |
1635 | static struct type * |
1636 | desc_bounds_type (struct type *type) | |
14f9c5c9 | 1637 | { |
d2e4a39e | 1638 | struct type *r; |
14f9c5c9 AS |
1639 | |
1640 | type = desc_base_type (type); | |
1641 | ||
1642 | if (type == NULL) | |
1643 | return NULL; | |
1644 | else if (is_thin_pntr (type)) | |
1645 | { | |
1646 | type = thin_descriptor_type (type); | |
1647 | if (type == NULL) | |
4c4b4cd2 | 1648 | return NULL; |
14f9c5c9 AS |
1649 | r = lookup_struct_elt_type (type, "BOUNDS", 1); |
1650 | if (r != NULL) | |
61ee279c | 1651 | return ada_check_typedef (r); |
14f9c5c9 AS |
1652 | } |
1653 | else if (TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
1654 | { | |
1655 | r = lookup_struct_elt_type (type, "P_BOUNDS", 1); | |
1656 | if (r != NULL) | |
61ee279c | 1657 | return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r))); |
14f9c5c9 AS |
1658 | } |
1659 | return NULL; | |
1660 | } | |
1661 | ||
1662 | /* If ARR is an array descriptor (fat or thin pointer), or pointer to | |
4c4b4cd2 PH |
1663 | one, a pointer to its bounds data. Otherwise NULL. */ |
1664 | ||
d2e4a39e AS |
1665 | static struct value * |
1666 | desc_bounds (struct value *arr) | |
14f9c5c9 | 1667 | { |
df407dfe | 1668 | struct type *type = ada_check_typedef (value_type (arr)); |
5b4ee69b | 1669 | |
d2e4a39e | 1670 | if (is_thin_pntr (type)) |
14f9c5c9 | 1671 | { |
d2e4a39e | 1672 | struct type *bounds_type = |
4c4b4cd2 | 1673 | desc_bounds_type (thin_descriptor_type (type)); |
14f9c5c9 AS |
1674 | LONGEST addr; |
1675 | ||
4cdfadb1 | 1676 | if (bounds_type == NULL) |
323e0a4a | 1677 | error (_("Bad GNAT array descriptor")); |
14f9c5c9 AS |
1678 | |
1679 | /* NOTE: The following calculation is not really kosher, but | |
d2e4a39e | 1680 | since desc_type is an XVE-encoded type (and shouldn't be), |
4c4b4cd2 | 1681 | the correct calculation is a real pain. FIXME (and fix GCC). */ |
14f9c5c9 | 1682 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
4c4b4cd2 | 1683 | addr = value_as_long (arr); |
d2e4a39e | 1684 | else |
42ae5230 | 1685 | addr = value_address (arr); |
14f9c5c9 | 1686 | |
d2e4a39e | 1687 | return |
4c4b4cd2 PH |
1688 | value_from_longest (lookup_pointer_type (bounds_type), |
1689 | addr - TYPE_LENGTH (bounds_type)); | |
14f9c5c9 AS |
1690 | } |
1691 | ||
1692 | else if (is_thick_pntr (type)) | |
05e522ef JB |
1693 | { |
1694 | struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL, | |
1695 | _("Bad GNAT array descriptor")); | |
1696 | struct type *p_bounds_type = value_type (p_bounds); | |
1697 | ||
1698 | if (p_bounds_type | |
1699 | && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR) | |
1700 | { | |
1701 | struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type); | |
1702 | ||
1703 | if (TYPE_STUB (target_type)) | |
1704 | p_bounds = value_cast (lookup_pointer_type | |
1705 | (ada_check_typedef (target_type)), | |
1706 | p_bounds); | |
1707 | } | |
1708 | else | |
1709 | error (_("Bad GNAT array descriptor")); | |
1710 | ||
1711 | return p_bounds; | |
1712 | } | |
14f9c5c9 AS |
1713 | else |
1714 | return NULL; | |
1715 | } | |
1716 | ||
4c4b4cd2 PH |
1717 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit |
1718 | position of the field containing the address of the bounds data. */ | |
1719 | ||
14f9c5c9 | 1720 | static int |
d2e4a39e | 1721 | fat_pntr_bounds_bitpos (struct type *type) |
14f9c5c9 AS |
1722 | { |
1723 | return TYPE_FIELD_BITPOS (desc_base_type (type), 1); | |
1724 | } | |
1725 | ||
1726 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1727 | size of the field containing the address of the bounds data. */ |
1728 | ||
14f9c5c9 | 1729 | static int |
d2e4a39e | 1730 | fat_pntr_bounds_bitsize (struct type *type) |
14f9c5c9 AS |
1731 | { |
1732 | type = desc_base_type (type); | |
1733 | ||
d2e4a39e | 1734 | if (TYPE_FIELD_BITSIZE (type, 1) > 0) |
14f9c5c9 AS |
1735 | return TYPE_FIELD_BITSIZE (type, 1); |
1736 | else | |
61ee279c | 1737 | return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1))); |
14f9c5c9 AS |
1738 | } |
1739 | ||
4c4b4cd2 | 1740 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a |
556bdfd4 UW |
1741 | pointer to one, the type of its array data (a array-with-no-bounds type); |
1742 | otherwise, NULL. Use ada_type_of_array to get an array type with bounds | |
1743 | data. */ | |
4c4b4cd2 | 1744 | |
d2e4a39e | 1745 | static struct type * |
556bdfd4 | 1746 | desc_data_target_type (struct type *type) |
14f9c5c9 AS |
1747 | { |
1748 | type = desc_base_type (type); | |
1749 | ||
4c4b4cd2 | 1750 | /* NOTE: The following is bogus; see comment in desc_bounds. */ |
14f9c5c9 | 1751 | if (is_thin_pntr (type)) |
556bdfd4 | 1752 | return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)); |
14f9c5c9 | 1753 | else if (is_thick_pntr (type)) |
556bdfd4 UW |
1754 | { |
1755 | struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1); | |
1756 | ||
1757 | if (data_type | |
1758 | && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR) | |
05e522ef | 1759 | return ada_check_typedef (TYPE_TARGET_TYPE (data_type)); |
556bdfd4 UW |
1760 | } |
1761 | ||
1762 | return NULL; | |
14f9c5c9 AS |
1763 | } |
1764 | ||
1765 | /* If ARR is an array descriptor (fat or thin pointer), a pointer to | |
1766 | its array data. */ | |
4c4b4cd2 | 1767 | |
d2e4a39e AS |
1768 | static struct value * |
1769 | desc_data (struct value *arr) | |
14f9c5c9 | 1770 | { |
df407dfe | 1771 | struct type *type = value_type (arr); |
5b4ee69b | 1772 | |
14f9c5c9 AS |
1773 | if (is_thin_pntr (type)) |
1774 | return thin_data_pntr (arr); | |
1775 | else if (is_thick_pntr (type)) | |
d2e4a39e | 1776 | return value_struct_elt (&arr, NULL, "P_ARRAY", NULL, |
323e0a4a | 1777 | _("Bad GNAT array descriptor")); |
14f9c5c9 AS |
1778 | else |
1779 | return NULL; | |
1780 | } | |
1781 | ||
1782 | ||
1783 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1784 | position of the field containing the address of the data. */ |
1785 | ||
14f9c5c9 | 1786 | static int |
d2e4a39e | 1787 | fat_pntr_data_bitpos (struct type *type) |
14f9c5c9 AS |
1788 | { |
1789 | return TYPE_FIELD_BITPOS (desc_base_type (type), 0); | |
1790 | } | |
1791 | ||
1792 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1793 | size of the field containing the address of the data. */ |
1794 | ||
14f9c5c9 | 1795 | static int |
d2e4a39e | 1796 | fat_pntr_data_bitsize (struct type *type) |
14f9c5c9 AS |
1797 | { |
1798 | type = desc_base_type (type); | |
1799 | ||
1800 | if (TYPE_FIELD_BITSIZE (type, 0) > 0) | |
1801 | return TYPE_FIELD_BITSIZE (type, 0); | |
d2e4a39e | 1802 | else |
14f9c5c9 AS |
1803 | return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)); |
1804 | } | |
1805 | ||
4c4b4cd2 | 1806 | /* If BOUNDS is an array-bounds structure (or pointer to one), return |
14f9c5c9 | 1807 | the Ith lower bound stored in it, if WHICH is 0, and the Ith upper |
4c4b4cd2 PH |
1808 | bound, if WHICH is 1. The first bound is I=1. */ |
1809 | ||
d2e4a39e AS |
1810 | static struct value * |
1811 | desc_one_bound (struct value *bounds, int i, int which) | |
14f9c5c9 | 1812 | { |
d2e4a39e | 1813 | return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL, |
323e0a4a | 1814 | _("Bad GNAT array descriptor bounds")); |
14f9c5c9 AS |
1815 | } |
1816 | ||
1817 | /* If BOUNDS is an array-bounds structure type, return the bit position | |
1818 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
4c4b4cd2 PH |
1819 | bound, if WHICH is 1. The first bound is I=1. */ |
1820 | ||
14f9c5c9 | 1821 | static int |
d2e4a39e | 1822 | desc_bound_bitpos (struct type *type, int i, int which) |
14f9c5c9 | 1823 | { |
d2e4a39e | 1824 | return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2); |
14f9c5c9 AS |
1825 | } |
1826 | ||
1827 | /* If BOUNDS is an array-bounds structure type, return the bit field size | |
1828 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
4c4b4cd2 PH |
1829 | bound, if WHICH is 1. The first bound is I=1. */ |
1830 | ||
76a01679 | 1831 | static int |
d2e4a39e | 1832 | desc_bound_bitsize (struct type *type, int i, int which) |
14f9c5c9 AS |
1833 | { |
1834 | type = desc_base_type (type); | |
1835 | ||
d2e4a39e AS |
1836 | if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0) |
1837 | return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2); | |
1838 | else | |
1839 | return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2)); | |
14f9c5c9 AS |
1840 | } |
1841 | ||
1842 | /* If TYPE is the type of an array-bounds structure, the type of its | |
4c4b4cd2 PH |
1843 | Ith bound (numbering from 1). Otherwise, NULL. */ |
1844 | ||
d2e4a39e AS |
1845 | static struct type * |
1846 | desc_index_type (struct type *type, int i) | |
14f9c5c9 AS |
1847 | { |
1848 | type = desc_base_type (type); | |
1849 | ||
1850 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
d2e4a39e AS |
1851 | return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1); |
1852 | else | |
14f9c5c9 AS |
1853 | return NULL; |
1854 | } | |
1855 | ||
4c4b4cd2 PH |
1856 | /* The number of index positions in the array-bounds type TYPE. |
1857 | Return 0 if TYPE is NULL. */ | |
1858 | ||
14f9c5c9 | 1859 | static int |
d2e4a39e | 1860 | desc_arity (struct type *type) |
14f9c5c9 AS |
1861 | { |
1862 | type = desc_base_type (type); | |
1863 | ||
1864 | if (type != NULL) | |
1865 | return TYPE_NFIELDS (type) / 2; | |
1866 | return 0; | |
1867 | } | |
1868 | ||
4c4b4cd2 PH |
1869 | /* Non-zero iff TYPE is a simple array type (not a pointer to one) or |
1870 | an array descriptor type (representing an unconstrained array | |
1871 | type). */ | |
1872 | ||
76a01679 JB |
1873 | static int |
1874 | ada_is_direct_array_type (struct type *type) | |
4c4b4cd2 PH |
1875 | { |
1876 | if (type == NULL) | |
1877 | return 0; | |
61ee279c | 1878 | type = ada_check_typedef (type); |
4c4b4cd2 | 1879 | return (TYPE_CODE (type) == TYPE_CODE_ARRAY |
76a01679 | 1880 | || ada_is_array_descriptor_type (type)); |
4c4b4cd2 PH |
1881 | } |
1882 | ||
52ce6436 | 1883 | /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer |
0963b4bd | 1884 | * to one. */ |
52ce6436 | 1885 | |
2c0b251b | 1886 | static int |
52ce6436 PH |
1887 | ada_is_array_type (struct type *type) |
1888 | { | |
1889 | while (type != NULL | |
1890 | && (TYPE_CODE (type) == TYPE_CODE_PTR | |
1891 | || TYPE_CODE (type) == TYPE_CODE_REF)) | |
1892 | type = TYPE_TARGET_TYPE (type); | |
1893 | return ada_is_direct_array_type (type); | |
1894 | } | |
1895 | ||
4c4b4cd2 | 1896 | /* Non-zero iff TYPE is a simple array type or pointer to one. */ |
14f9c5c9 | 1897 | |
14f9c5c9 | 1898 | int |
4c4b4cd2 | 1899 | ada_is_simple_array_type (struct type *type) |
14f9c5c9 AS |
1900 | { |
1901 | if (type == NULL) | |
1902 | return 0; | |
61ee279c | 1903 | type = ada_check_typedef (type); |
14f9c5c9 | 1904 | return (TYPE_CODE (type) == TYPE_CODE_ARRAY |
4c4b4cd2 | 1905 | || (TYPE_CODE (type) == TYPE_CODE_PTR |
b0dd7688 JB |
1906 | && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))) |
1907 | == TYPE_CODE_ARRAY)); | |
14f9c5c9 AS |
1908 | } |
1909 | ||
4c4b4cd2 PH |
1910 | /* Non-zero iff TYPE belongs to a GNAT array descriptor. */ |
1911 | ||
14f9c5c9 | 1912 | int |
4c4b4cd2 | 1913 | ada_is_array_descriptor_type (struct type *type) |
14f9c5c9 | 1914 | { |
556bdfd4 | 1915 | struct type *data_type = desc_data_target_type (type); |
14f9c5c9 AS |
1916 | |
1917 | if (type == NULL) | |
1918 | return 0; | |
61ee279c | 1919 | type = ada_check_typedef (type); |
556bdfd4 UW |
1920 | return (data_type != NULL |
1921 | && TYPE_CODE (data_type) == TYPE_CODE_ARRAY | |
1922 | && desc_arity (desc_bounds_type (type)) > 0); | |
14f9c5c9 AS |
1923 | } |
1924 | ||
1925 | /* Non-zero iff type is a partially mal-formed GNAT array | |
4c4b4cd2 | 1926 | descriptor. FIXME: This is to compensate for some problems with |
14f9c5c9 | 1927 | debugging output from GNAT. Re-examine periodically to see if it |
4c4b4cd2 PH |
1928 | is still needed. */ |
1929 | ||
14f9c5c9 | 1930 | int |
ebf56fd3 | 1931 | ada_is_bogus_array_descriptor (struct type *type) |
14f9c5c9 | 1932 | { |
d2e4a39e | 1933 | return |
14f9c5c9 AS |
1934 | type != NULL |
1935 | && TYPE_CODE (type) == TYPE_CODE_STRUCT | |
1936 | && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL | |
4c4b4cd2 PH |
1937 | || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL) |
1938 | && !ada_is_array_descriptor_type (type); | |
14f9c5c9 AS |
1939 | } |
1940 | ||
1941 | ||
4c4b4cd2 | 1942 | /* If ARR has a record type in the form of a standard GNAT array descriptor, |
14f9c5c9 | 1943 | (fat pointer) returns the type of the array data described---specifically, |
4c4b4cd2 | 1944 | a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled |
14f9c5c9 | 1945 | in from the descriptor; otherwise, they are left unspecified. If |
4c4b4cd2 PH |
1946 | the ARR denotes a null array descriptor and BOUNDS is non-zero, |
1947 | returns NULL. The result is simply the type of ARR if ARR is not | |
14f9c5c9 | 1948 | a descriptor. */ |
d2e4a39e AS |
1949 | struct type * |
1950 | ada_type_of_array (struct value *arr, int bounds) | |
14f9c5c9 | 1951 | { |
ad82864c JB |
1952 | if (ada_is_constrained_packed_array_type (value_type (arr))) |
1953 | return decode_constrained_packed_array_type (value_type (arr)); | |
14f9c5c9 | 1954 | |
df407dfe AC |
1955 | if (!ada_is_array_descriptor_type (value_type (arr))) |
1956 | return value_type (arr); | |
d2e4a39e AS |
1957 | |
1958 | if (!bounds) | |
ad82864c JB |
1959 | { |
1960 | struct type *array_type = | |
1961 | ada_check_typedef (desc_data_target_type (value_type (arr))); | |
1962 | ||
1963 | if (ada_is_unconstrained_packed_array_type (value_type (arr))) | |
1964 | TYPE_FIELD_BITSIZE (array_type, 0) = | |
1965 | decode_packed_array_bitsize (value_type (arr)); | |
1966 | ||
1967 | return array_type; | |
1968 | } | |
14f9c5c9 AS |
1969 | else |
1970 | { | |
d2e4a39e | 1971 | struct type *elt_type; |
14f9c5c9 | 1972 | int arity; |
d2e4a39e | 1973 | struct value *descriptor; |
14f9c5c9 | 1974 | |
df407dfe AC |
1975 | elt_type = ada_array_element_type (value_type (arr), -1); |
1976 | arity = ada_array_arity (value_type (arr)); | |
14f9c5c9 | 1977 | |
d2e4a39e | 1978 | if (elt_type == NULL || arity == 0) |
df407dfe | 1979 | return ada_check_typedef (value_type (arr)); |
14f9c5c9 AS |
1980 | |
1981 | descriptor = desc_bounds (arr); | |
d2e4a39e | 1982 | if (value_as_long (descriptor) == 0) |
4c4b4cd2 | 1983 | return NULL; |
d2e4a39e | 1984 | while (arity > 0) |
4c4b4cd2 | 1985 | { |
e9bb382b UW |
1986 | struct type *range_type = alloc_type_copy (value_type (arr)); |
1987 | struct type *array_type = alloc_type_copy (value_type (arr)); | |
4c4b4cd2 PH |
1988 | struct value *low = desc_one_bound (descriptor, arity, 0); |
1989 | struct value *high = desc_one_bound (descriptor, arity, 1); | |
4c4b4cd2 | 1990 | |
5b4ee69b | 1991 | arity -= 1; |
0c9c3474 SA |
1992 | create_static_range_type (range_type, value_type (low), |
1993 | longest_to_int (value_as_long (low)), | |
1994 | longest_to_int (value_as_long (high))); | |
4c4b4cd2 | 1995 | elt_type = create_array_type (array_type, elt_type, range_type); |
ad82864c JB |
1996 | |
1997 | if (ada_is_unconstrained_packed_array_type (value_type (arr))) | |
e67ad678 JB |
1998 | { |
1999 | /* We need to store the element packed bitsize, as well as | |
2000 | recompute the array size, because it was previously | |
2001 | computed based on the unpacked element size. */ | |
2002 | LONGEST lo = value_as_long (low); | |
2003 | LONGEST hi = value_as_long (high); | |
2004 | ||
2005 | TYPE_FIELD_BITSIZE (elt_type, 0) = | |
2006 | decode_packed_array_bitsize (value_type (arr)); | |
2007 | /* If the array has no element, then the size is already | |
2008 | zero, and does not need to be recomputed. */ | |
2009 | if (lo < hi) | |
2010 | { | |
2011 | int array_bitsize = | |
2012 | (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0); | |
2013 | ||
2014 | TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8; | |
2015 | } | |
2016 | } | |
4c4b4cd2 | 2017 | } |
14f9c5c9 AS |
2018 | |
2019 | return lookup_pointer_type (elt_type); | |
2020 | } | |
2021 | } | |
2022 | ||
2023 | /* If ARR does not represent an array, returns ARR unchanged. | |
4c4b4cd2 PH |
2024 | Otherwise, returns either a standard GDB array with bounds set |
2025 | appropriately or, if ARR is a non-null fat pointer, a pointer to a standard | |
2026 | GDB array. Returns NULL if ARR is a null fat pointer. */ | |
2027 | ||
d2e4a39e AS |
2028 | struct value * |
2029 | ada_coerce_to_simple_array_ptr (struct value *arr) | |
14f9c5c9 | 2030 | { |
df407dfe | 2031 | if (ada_is_array_descriptor_type (value_type (arr))) |
14f9c5c9 | 2032 | { |
d2e4a39e | 2033 | struct type *arrType = ada_type_of_array (arr, 1); |
5b4ee69b | 2034 | |
14f9c5c9 | 2035 | if (arrType == NULL) |
4c4b4cd2 | 2036 | return NULL; |
14f9c5c9 AS |
2037 | return value_cast (arrType, value_copy (desc_data (arr))); |
2038 | } | |
ad82864c JB |
2039 | else if (ada_is_constrained_packed_array_type (value_type (arr))) |
2040 | return decode_constrained_packed_array (arr); | |
14f9c5c9 AS |
2041 | else |
2042 | return arr; | |
2043 | } | |
2044 | ||
2045 | /* If ARR does not represent an array, returns ARR unchanged. | |
2046 | Otherwise, returns a standard GDB array describing ARR (which may | |
4c4b4cd2 PH |
2047 | be ARR itself if it already is in the proper form). */ |
2048 | ||
720d1a40 | 2049 | struct value * |
d2e4a39e | 2050 | ada_coerce_to_simple_array (struct value *arr) |
14f9c5c9 | 2051 | { |
df407dfe | 2052 | if (ada_is_array_descriptor_type (value_type (arr))) |
14f9c5c9 | 2053 | { |
d2e4a39e | 2054 | struct value *arrVal = ada_coerce_to_simple_array_ptr (arr); |
5b4ee69b | 2055 | |
14f9c5c9 | 2056 | if (arrVal == NULL) |
323e0a4a | 2057 | error (_("Bounds unavailable for null array pointer.")); |
c1b5a1a6 | 2058 | ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal))); |
14f9c5c9 AS |
2059 | return value_ind (arrVal); |
2060 | } | |
ad82864c JB |
2061 | else if (ada_is_constrained_packed_array_type (value_type (arr))) |
2062 | return decode_constrained_packed_array (arr); | |
d2e4a39e | 2063 | else |
14f9c5c9 AS |
2064 | return arr; |
2065 | } | |
2066 | ||
2067 | /* If TYPE represents a GNAT array type, return it translated to an | |
2068 | ordinary GDB array type (possibly with BITSIZE fields indicating | |
4c4b4cd2 PH |
2069 | packing). For other types, is the identity. */ |
2070 | ||
d2e4a39e AS |
2071 | struct type * |
2072 | ada_coerce_to_simple_array_type (struct type *type) | |
14f9c5c9 | 2073 | { |
ad82864c JB |
2074 | if (ada_is_constrained_packed_array_type (type)) |
2075 | return decode_constrained_packed_array_type (type); | |
17280b9f UW |
2076 | |
2077 | if (ada_is_array_descriptor_type (type)) | |
556bdfd4 | 2078 | return ada_check_typedef (desc_data_target_type (type)); |
17280b9f UW |
2079 | |
2080 | return type; | |
14f9c5c9 AS |
2081 | } |
2082 | ||
4c4b4cd2 PH |
2083 | /* Non-zero iff TYPE represents a standard GNAT packed-array type. */ |
2084 | ||
ad82864c JB |
2085 | static int |
2086 | ada_is_packed_array_type (struct type *type) | |
14f9c5c9 AS |
2087 | { |
2088 | if (type == NULL) | |
2089 | return 0; | |
4c4b4cd2 | 2090 | type = desc_base_type (type); |
61ee279c | 2091 | type = ada_check_typedef (type); |
d2e4a39e | 2092 | return |
14f9c5c9 AS |
2093 | ada_type_name (type) != NULL |
2094 | && strstr (ada_type_name (type), "___XP") != NULL; | |
2095 | } | |
2096 | ||
ad82864c JB |
2097 | /* Non-zero iff TYPE represents a standard GNAT constrained |
2098 | packed-array type. */ | |
2099 | ||
2100 | int | |
2101 | ada_is_constrained_packed_array_type (struct type *type) | |
2102 | { | |
2103 | return ada_is_packed_array_type (type) | |
2104 | && !ada_is_array_descriptor_type (type); | |
2105 | } | |
2106 | ||
2107 | /* Non-zero iff TYPE represents an array descriptor for a | |
2108 | unconstrained packed-array type. */ | |
2109 | ||
2110 | static int | |
2111 | ada_is_unconstrained_packed_array_type (struct type *type) | |
2112 | { | |
2113 | return ada_is_packed_array_type (type) | |
2114 | && ada_is_array_descriptor_type (type); | |
2115 | } | |
2116 | ||
2117 | /* Given that TYPE encodes a packed array type (constrained or unconstrained), | |
2118 | return the size of its elements in bits. */ | |
2119 | ||
2120 | static long | |
2121 | decode_packed_array_bitsize (struct type *type) | |
2122 | { | |
0d5cff50 DE |
2123 | const char *raw_name; |
2124 | const char *tail; | |
ad82864c JB |
2125 | long bits; |
2126 | ||
720d1a40 JB |
2127 | /* Access to arrays implemented as fat pointers are encoded as a typedef |
2128 | of the fat pointer type. We need the name of the fat pointer type | |
2129 | to do the decoding, so strip the typedef layer. */ | |
2130 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
2131 | type = ada_typedef_target_type (type); | |
2132 | ||
2133 | raw_name = ada_type_name (ada_check_typedef (type)); | |
ad82864c JB |
2134 | if (!raw_name) |
2135 | raw_name = ada_type_name (desc_base_type (type)); | |
2136 | ||
2137 | if (!raw_name) | |
2138 | return 0; | |
2139 | ||
2140 | tail = strstr (raw_name, "___XP"); | |
720d1a40 | 2141 | gdb_assert (tail != NULL); |
ad82864c JB |
2142 | |
2143 | if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1) | |
2144 | { | |
2145 | lim_warning | |
2146 | (_("could not understand bit size information on packed array")); | |
2147 | return 0; | |
2148 | } | |
2149 | ||
2150 | return bits; | |
2151 | } | |
2152 | ||
14f9c5c9 AS |
2153 | /* Given that TYPE is a standard GDB array type with all bounds filled |
2154 | in, and that the element size of its ultimate scalar constituents | |
2155 | (that is, either its elements, or, if it is an array of arrays, its | |
2156 | elements' elements, etc.) is *ELT_BITS, return an identical type, | |
2157 | but with the bit sizes of its elements (and those of any | |
2158 | constituent arrays) recorded in the BITSIZE components of its | |
4c4b4cd2 | 2159 | TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size |
4a46959e JB |
2160 | in bits. |
2161 | ||
2162 | Note that, for arrays whose index type has an XA encoding where | |
2163 | a bound references a record discriminant, getting that discriminant, | |
2164 | and therefore the actual value of that bound, is not possible | |
2165 | because none of the given parameters gives us access to the record. | |
2166 | This function assumes that it is OK in the context where it is being | |
2167 | used to return an array whose bounds are still dynamic and where | |
2168 | the length is arbitrary. */ | |
4c4b4cd2 | 2169 | |
d2e4a39e | 2170 | static struct type * |
ad82864c | 2171 | constrained_packed_array_type (struct type *type, long *elt_bits) |
14f9c5c9 | 2172 | { |
d2e4a39e AS |
2173 | struct type *new_elt_type; |
2174 | struct type *new_type; | |
99b1c762 JB |
2175 | struct type *index_type_desc; |
2176 | struct type *index_type; | |
14f9c5c9 AS |
2177 | LONGEST low_bound, high_bound; |
2178 | ||
61ee279c | 2179 | type = ada_check_typedef (type); |
14f9c5c9 AS |
2180 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY) |
2181 | return type; | |
2182 | ||
99b1c762 JB |
2183 | index_type_desc = ada_find_parallel_type (type, "___XA"); |
2184 | if (index_type_desc) | |
2185 | index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0), | |
2186 | NULL); | |
2187 | else | |
2188 | index_type = TYPE_INDEX_TYPE (type); | |
2189 | ||
e9bb382b | 2190 | new_type = alloc_type_copy (type); |
ad82864c JB |
2191 | new_elt_type = |
2192 | constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)), | |
2193 | elt_bits); | |
99b1c762 | 2194 | create_array_type (new_type, new_elt_type, index_type); |
14f9c5c9 AS |
2195 | TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits; |
2196 | TYPE_NAME (new_type) = ada_type_name (type); | |
2197 | ||
4a46959e JB |
2198 | if ((TYPE_CODE (check_typedef (index_type)) == TYPE_CODE_RANGE |
2199 | && is_dynamic_type (check_typedef (index_type))) | |
2200 | || get_discrete_bounds (index_type, &low_bound, &high_bound) < 0) | |
14f9c5c9 AS |
2201 | low_bound = high_bound = 0; |
2202 | if (high_bound < low_bound) | |
2203 | *elt_bits = TYPE_LENGTH (new_type) = 0; | |
d2e4a39e | 2204 | else |
14f9c5c9 AS |
2205 | { |
2206 | *elt_bits *= (high_bound - low_bound + 1); | |
d2e4a39e | 2207 | TYPE_LENGTH (new_type) = |
4c4b4cd2 | 2208 | (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; |
14f9c5c9 AS |
2209 | } |
2210 | ||
876cecd0 | 2211 | TYPE_FIXED_INSTANCE (new_type) = 1; |
14f9c5c9 AS |
2212 | return new_type; |
2213 | } | |
2214 | ||
ad82864c JB |
2215 | /* The array type encoded by TYPE, where |
2216 | ada_is_constrained_packed_array_type (TYPE). */ | |
4c4b4cd2 | 2217 | |
d2e4a39e | 2218 | static struct type * |
ad82864c | 2219 | decode_constrained_packed_array_type (struct type *type) |
d2e4a39e | 2220 | { |
0d5cff50 | 2221 | const char *raw_name = ada_type_name (ada_check_typedef (type)); |
727e3d2e | 2222 | char *name; |
0d5cff50 | 2223 | const char *tail; |
d2e4a39e | 2224 | struct type *shadow_type; |
14f9c5c9 | 2225 | long bits; |
14f9c5c9 | 2226 | |
727e3d2e JB |
2227 | if (!raw_name) |
2228 | raw_name = ada_type_name (desc_base_type (type)); | |
2229 | ||
2230 | if (!raw_name) | |
2231 | return NULL; | |
2232 | ||
2233 | name = (char *) alloca (strlen (raw_name) + 1); | |
2234 | tail = strstr (raw_name, "___XP"); | |
4c4b4cd2 PH |
2235 | type = desc_base_type (type); |
2236 | ||
14f9c5c9 AS |
2237 | memcpy (name, raw_name, tail - raw_name); |
2238 | name[tail - raw_name] = '\000'; | |
2239 | ||
b4ba55a1 JB |
2240 | shadow_type = ada_find_parallel_type_with_name (type, name); |
2241 | ||
2242 | if (shadow_type == NULL) | |
14f9c5c9 | 2243 | { |
323e0a4a | 2244 | lim_warning (_("could not find bounds information on packed array")); |
14f9c5c9 AS |
2245 | return NULL; |
2246 | } | |
f168693b | 2247 | shadow_type = check_typedef (shadow_type); |
14f9c5c9 AS |
2248 | |
2249 | if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY) | |
2250 | { | |
0963b4bd MS |
2251 | lim_warning (_("could not understand bounds " |
2252 | "information on packed array")); | |
14f9c5c9 AS |
2253 | return NULL; |
2254 | } | |
d2e4a39e | 2255 | |
ad82864c JB |
2256 | bits = decode_packed_array_bitsize (type); |
2257 | return constrained_packed_array_type (shadow_type, &bits); | |
14f9c5c9 AS |
2258 | } |
2259 | ||
ad82864c JB |
2260 | /* Given that ARR is a struct value *indicating a GNAT constrained packed |
2261 | array, returns a simple array that denotes that array. Its type is a | |
14f9c5c9 AS |
2262 | standard GDB array type except that the BITSIZEs of the array |
2263 | target types are set to the number of bits in each element, and the | |
4c4b4cd2 | 2264 | type length is set appropriately. */ |
14f9c5c9 | 2265 | |
d2e4a39e | 2266 | static struct value * |
ad82864c | 2267 | decode_constrained_packed_array (struct value *arr) |
14f9c5c9 | 2268 | { |
4c4b4cd2 | 2269 | struct type *type; |
14f9c5c9 | 2270 | |
11aa919a PMR |
2271 | /* If our value is a pointer, then dereference it. Likewise if |
2272 | the value is a reference. Make sure that this operation does not | |
2273 | cause the target type to be fixed, as this would indirectly cause | |
2274 | this array to be decoded. The rest of the routine assumes that | |
2275 | the array hasn't been decoded yet, so we use the basic "coerce_ref" | |
2276 | and "value_ind" routines to perform the dereferencing, as opposed | |
2277 | to using "ada_coerce_ref" or "ada_value_ind". */ | |
2278 | arr = coerce_ref (arr); | |
828292f2 | 2279 | if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR) |
284614f0 | 2280 | arr = value_ind (arr); |
4c4b4cd2 | 2281 | |
ad82864c | 2282 | type = decode_constrained_packed_array_type (value_type (arr)); |
14f9c5c9 AS |
2283 | if (type == NULL) |
2284 | { | |
323e0a4a | 2285 | error (_("can't unpack array")); |
14f9c5c9 AS |
2286 | return NULL; |
2287 | } | |
61ee279c | 2288 | |
50810684 | 2289 | if (gdbarch_bits_big_endian (get_type_arch (value_type (arr))) |
32c9a795 | 2290 | && ada_is_modular_type (value_type (arr))) |
61ee279c PH |
2291 | { |
2292 | /* This is a (right-justified) modular type representing a packed | |
2293 | array with no wrapper. In order to interpret the value through | |
2294 | the (left-justified) packed array type we just built, we must | |
2295 | first left-justify it. */ | |
2296 | int bit_size, bit_pos; | |
2297 | ULONGEST mod; | |
2298 | ||
df407dfe | 2299 | mod = ada_modulus (value_type (arr)) - 1; |
61ee279c PH |
2300 | bit_size = 0; |
2301 | while (mod > 0) | |
2302 | { | |
2303 | bit_size += 1; | |
2304 | mod >>= 1; | |
2305 | } | |
df407dfe | 2306 | bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size; |
61ee279c PH |
2307 | arr = ada_value_primitive_packed_val (arr, NULL, |
2308 | bit_pos / HOST_CHAR_BIT, | |
2309 | bit_pos % HOST_CHAR_BIT, | |
2310 | bit_size, | |
2311 | type); | |
2312 | } | |
2313 | ||
4c4b4cd2 | 2314 | return coerce_unspec_val_to_type (arr, type); |
14f9c5c9 AS |
2315 | } |
2316 | ||
2317 | ||
2318 | /* The value of the element of packed array ARR at the ARITY indices | |
4c4b4cd2 | 2319 | given in IND. ARR must be a simple array. */ |
14f9c5c9 | 2320 | |
d2e4a39e AS |
2321 | static struct value * |
2322 | value_subscript_packed (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
2323 | { |
2324 | int i; | |
2325 | int bits, elt_off, bit_off; | |
2326 | long elt_total_bit_offset; | |
d2e4a39e AS |
2327 | struct type *elt_type; |
2328 | struct value *v; | |
14f9c5c9 AS |
2329 | |
2330 | bits = 0; | |
2331 | elt_total_bit_offset = 0; | |
df407dfe | 2332 | elt_type = ada_check_typedef (value_type (arr)); |
d2e4a39e | 2333 | for (i = 0; i < arity; i += 1) |
14f9c5c9 | 2334 | { |
d2e4a39e | 2335 | if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY |
4c4b4cd2 PH |
2336 | || TYPE_FIELD_BITSIZE (elt_type, 0) == 0) |
2337 | error | |
0963b4bd MS |
2338 | (_("attempt to do packed indexing of " |
2339 | "something other than a packed array")); | |
14f9c5c9 | 2340 | else |
4c4b4cd2 PH |
2341 | { |
2342 | struct type *range_type = TYPE_INDEX_TYPE (elt_type); | |
2343 | LONGEST lowerbound, upperbound; | |
2344 | LONGEST idx; | |
2345 | ||
2346 | if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0) | |
2347 | { | |
323e0a4a | 2348 | lim_warning (_("don't know bounds of array")); |
4c4b4cd2 PH |
2349 | lowerbound = upperbound = 0; |
2350 | } | |
2351 | ||
3cb382c9 | 2352 | idx = pos_atr (ind[i]); |
4c4b4cd2 | 2353 | if (idx < lowerbound || idx > upperbound) |
0963b4bd MS |
2354 | lim_warning (_("packed array index %ld out of bounds"), |
2355 | (long) idx); | |
4c4b4cd2 PH |
2356 | bits = TYPE_FIELD_BITSIZE (elt_type, 0); |
2357 | elt_total_bit_offset += (idx - lowerbound) * bits; | |
61ee279c | 2358 | elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type)); |
4c4b4cd2 | 2359 | } |
14f9c5c9 AS |
2360 | } |
2361 | elt_off = elt_total_bit_offset / HOST_CHAR_BIT; | |
2362 | bit_off = elt_total_bit_offset % HOST_CHAR_BIT; | |
d2e4a39e AS |
2363 | |
2364 | v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off, | |
4c4b4cd2 | 2365 | bits, elt_type); |
14f9c5c9 AS |
2366 | return v; |
2367 | } | |
2368 | ||
4c4b4cd2 | 2369 | /* Non-zero iff TYPE includes negative integer values. */ |
14f9c5c9 AS |
2370 | |
2371 | static int | |
d2e4a39e | 2372 | has_negatives (struct type *type) |
14f9c5c9 | 2373 | { |
d2e4a39e AS |
2374 | switch (TYPE_CODE (type)) |
2375 | { | |
2376 | default: | |
2377 | return 0; | |
2378 | case TYPE_CODE_INT: | |
2379 | return !TYPE_UNSIGNED (type); | |
2380 | case TYPE_CODE_RANGE: | |
2381 | return TYPE_LOW_BOUND (type) < 0; | |
2382 | } | |
14f9c5c9 | 2383 | } |
d2e4a39e | 2384 | |
f93fca70 | 2385 | /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET, |
5b639dea | 2386 | unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of |
f93fca70 | 2387 | the unpacked buffer. |
14f9c5c9 | 2388 | |
5b639dea JB |
2389 | The size of the unpacked buffer (UNPACKED_LEN) is expected to be large |
2390 | enough to contain at least BIT_OFFSET bits. If not, an error is raised. | |
2391 | ||
f93fca70 JB |
2392 | IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode, |
2393 | zero otherwise. | |
14f9c5c9 | 2394 | |
f93fca70 | 2395 | IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type. |
a1c95e6b | 2396 | |
f93fca70 JB |
2397 | IS_SCALAR is nonzero if the data corresponds to a signed type. */ |
2398 | ||
2399 | static void | |
2400 | ada_unpack_from_contents (const gdb_byte *src, int bit_offset, int bit_size, | |
2401 | gdb_byte *unpacked, int unpacked_len, | |
2402 | int is_big_endian, int is_signed_type, | |
2403 | int is_scalar) | |
2404 | { | |
a1c95e6b JB |
2405 | int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8; |
2406 | int src_idx; /* Index into the source area */ | |
2407 | int src_bytes_left; /* Number of source bytes left to process. */ | |
2408 | int srcBitsLeft; /* Number of source bits left to move */ | |
2409 | int unusedLS; /* Number of bits in next significant | |
2410 | byte of source that are unused */ | |
2411 | ||
a1c95e6b JB |
2412 | int unpacked_idx; /* Index into the unpacked buffer */ |
2413 | int unpacked_bytes_left; /* Number of bytes left to set in unpacked. */ | |
2414 | ||
4c4b4cd2 | 2415 | unsigned long accum; /* Staging area for bits being transferred */ |
a1c95e6b | 2416 | int accumSize; /* Number of meaningful bits in accum */ |
14f9c5c9 | 2417 | unsigned char sign; |
a1c95e6b | 2418 | |
4c4b4cd2 PH |
2419 | /* Transmit bytes from least to most significant; delta is the direction |
2420 | the indices move. */ | |
f93fca70 | 2421 | int delta = is_big_endian ? -1 : 1; |
14f9c5c9 | 2422 | |
5b639dea JB |
2423 | /* Make sure that unpacked is large enough to receive the BIT_SIZE |
2424 | bits from SRC. .*/ | |
2425 | if ((bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT > unpacked_len) | |
2426 | error (_("Cannot unpack %d bits into buffer of %d bytes"), | |
2427 | bit_size, unpacked_len); | |
2428 | ||
14f9c5c9 | 2429 | srcBitsLeft = bit_size; |
086ca51f | 2430 | src_bytes_left = src_len; |
f93fca70 | 2431 | unpacked_bytes_left = unpacked_len; |
14f9c5c9 | 2432 | sign = 0; |
f93fca70 JB |
2433 | |
2434 | if (is_big_endian) | |
14f9c5c9 | 2435 | { |
086ca51f | 2436 | src_idx = src_len - 1; |
f93fca70 JB |
2437 | if (is_signed_type |
2438 | && ((src[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1)))) | |
4c4b4cd2 | 2439 | sign = ~0; |
d2e4a39e AS |
2440 | |
2441 | unusedLS = | |
4c4b4cd2 PH |
2442 | (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT) |
2443 | % HOST_CHAR_BIT; | |
14f9c5c9 | 2444 | |
f93fca70 JB |
2445 | if (is_scalar) |
2446 | { | |
2447 | accumSize = 0; | |
2448 | unpacked_idx = unpacked_len - 1; | |
2449 | } | |
2450 | else | |
2451 | { | |
4c4b4cd2 PH |
2452 | /* Non-scalar values must be aligned at a byte boundary... */ |
2453 | accumSize = | |
2454 | (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT; | |
2455 | /* ... And are placed at the beginning (most-significant) bytes | |
2456 | of the target. */ | |
086ca51f JB |
2457 | unpacked_idx = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1; |
2458 | unpacked_bytes_left = unpacked_idx + 1; | |
f93fca70 | 2459 | } |
14f9c5c9 | 2460 | } |
d2e4a39e | 2461 | else |
14f9c5c9 AS |
2462 | { |
2463 | int sign_bit_offset = (bit_size + bit_offset - 1) % 8; | |
2464 | ||
086ca51f | 2465 | src_idx = unpacked_idx = 0; |
14f9c5c9 AS |
2466 | unusedLS = bit_offset; |
2467 | accumSize = 0; | |
2468 | ||
f93fca70 | 2469 | if (is_signed_type && (src[src_len - 1] & (1 << sign_bit_offset))) |
4c4b4cd2 | 2470 | sign = ~0; |
14f9c5c9 | 2471 | } |
d2e4a39e | 2472 | |
14f9c5c9 | 2473 | accum = 0; |
086ca51f | 2474 | while (src_bytes_left > 0) |
14f9c5c9 AS |
2475 | { |
2476 | /* Mask for removing bits of the next source byte that are not | |
4c4b4cd2 | 2477 | part of the value. */ |
d2e4a39e | 2478 | unsigned int unusedMSMask = |
4c4b4cd2 PH |
2479 | (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) - |
2480 | 1; | |
2481 | /* Sign-extend bits for this byte. */ | |
14f9c5c9 | 2482 | unsigned int signMask = sign & ~unusedMSMask; |
5b4ee69b | 2483 | |
d2e4a39e | 2484 | accum |= |
086ca51f | 2485 | (((src[src_idx] >> unusedLS) & unusedMSMask) | signMask) << accumSize; |
14f9c5c9 | 2486 | accumSize += HOST_CHAR_BIT - unusedLS; |
d2e4a39e | 2487 | if (accumSize >= HOST_CHAR_BIT) |
4c4b4cd2 | 2488 | { |
086ca51f | 2489 | unpacked[unpacked_idx] = accum & ~(~0L << HOST_CHAR_BIT); |
4c4b4cd2 PH |
2490 | accumSize -= HOST_CHAR_BIT; |
2491 | accum >>= HOST_CHAR_BIT; | |
086ca51f JB |
2492 | unpacked_bytes_left -= 1; |
2493 | unpacked_idx += delta; | |
4c4b4cd2 | 2494 | } |
14f9c5c9 AS |
2495 | srcBitsLeft -= HOST_CHAR_BIT - unusedLS; |
2496 | unusedLS = 0; | |
086ca51f JB |
2497 | src_bytes_left -= 1; |
2498 | src_idx += delta; | |
14f9c5c9 | 2499 | } |
086ca51f | 2500 | while (unpacked_bytes_left > 0) |
14f9c5c9 AS |
2501 | { |
2502 | accum |= sign << accumSize; | |
086ca51f | 2503 | unpacked[unpacked_idx] = accum & ~(~0L << HOST_CHAR_BIT); |
14f9c5c9 | 2504 | accumSize -= HOST_CHAR_BIT; |
9cd4d857 JB |
2505 | if (accumSize < 0) |
2506 | accumSize = 0; | |
14f9c5c9 | 2507 | accum >>= HOST_CHAR_BIT; |
086ca51f JB |
2508 | unpacked_bytes_left -= 1; |
2509 | unpacked_idx += delta; | |
14f9c5c9 | 2510 | } |
f93fca70 JB |
2511 | } |
2512 | ||
2513 | /* Create a new value of type TYPE from the contents of OBJ starting | |
2514 | at byte OFFSET, and bit offset BIT_OFFSET within that byte, | |
2515 | proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then | |
2516 | assigning through the result will set the field fetched from. | |
2517 | VALADDR is ignored unless OBJ is NULL, in which case, | |
2518 | VALADDR+OFFSET must address the start of storage containing the | |
2519 | packed value. The value returned in this case is never an lval. | |
2520 | Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */ | |
2521 | ||
2522 | struct value * | |
2523 | ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr, | |
2524 | long offset, int bit_offset, int bit_size, | |
2525 | struct type *type) | |
2526 | { | |
2527 | struct value *v; | |
bfb1c796 | 2528 | const gdb_byte *src; /* First byte containing data to unpack */ |
f93fca70 | 2529 | gdb_byte *unpacked; |
220475ed | 2530 | const int is_scalar = is_scalar_type (type); |
d0a9e810 JB |
2531 | const int is_big_endian = gdbarch_bits_big_endian (get_type_arch (type)); |
2532 | gdb_byte *staging = NULL; | |
2533 | int staging_len = 0; | |
2534 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); | |
f93fca70 JB |
2535 | |
2536 | type = ada_check_typedef (type); | |
2537 | ||
d0a9e810 | 2538 | if (obj == NULL) |
bfb1c796 | 2539 | src = valaddr + offset; |
d0a9e810 | 2540 | else |
bfb1c796 | 2541 | src = value_contents (obj) + offset; |
d0a9e810 JB |
2542 | |
2543 | if (is_dynamic_type (type)) | |
2544 | { | |
2545 | /* The length of TYPE might by dynamic, so we need to resolve | |
2546 | TYPE in order to know its actual size, which we then use | |
2547 | to create the contents buffer of the value we return. | |
2548 | The difficulty is that the data containing our object is | |
2549 | packed, and therefore maybe not at a byte boundary. So, what | |
2550 | we do, is unpack the data into a byte-aligned buffer, and then | |
2551 | use that buffer as our object's value for resolving the type. */ | |
2552 | staging_len = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
aa5c10ce | 2553 | staging = (gdb_byte *) malloc (staging_len); |
d0a9e810 JB |
2554 | make_cleanup (xfree, staging); |
2555 | ||
2556 | ada_unpack_from_contents (src, bit_offset, bit_size, | |
2557 | staging, staging_len, | |
2558 | is_big_endian, has_negatives (type), | |
2559 | is_scalar); | |
2560 | type = resolve_dynamic_type (type, staging, 0); | |
0cafa88c JB |
2561 | if (TYPE_LENGTH (type) < (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT) |
2562 | { | |
2563 | /* This happens when the length of the object is dynamic, | |
2564 | and is actually smaller than the space reserved for it. | |
2565 | For instance, in an array of variant records, the bit_size | |
2566 | we're given is the array stride, which is constant and | |
2567 | normally equal to the maximum size of its element. | |
2568 | But, in reality, each element only actually spans a portion | |
2569 | of that stride. */ | |
2570 | bit_size = TYPE_LENGTH (type) * HOST_CHAR_BIT; | |
2571 | } | |
d0a9e810 JB |
2572 | } |
2573 | ||
f93fca70 JB |
2574 | if (obj == NULL) |
2575 | { | |
2576 | v = allocate_value (type); | |
bfb1c796 | 2577 | src = valaddr + offset; |
f93fca70 JB |
2578 | } |
2579 | else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj)) | |
2580 | { | |
0cafa88c | 2581 | int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8; |
bfb1c796 | 2582 | gdb_byte *buf; |
0cafa88c | 2583 | |
f93fca70 | 2584 | v = value_at (type, value_address (obj) + offset); |
bfb1c796 PA |
2585 | buf = (gdb_byte *) alloca (src_len); |
2586 | read_memory (value_address (v), buf, src_len); | |
2587 | src = buf; | |
f93fca70 JB |
2588 | } |
2589 | else | |
2590 | { | |
2591 | v = allocate_value (type); | |
bfb1c796 | 2592 | src = value_contents (obj) + offset; |
f93fca70 JB |
2593 | } |
2594 | ||
2595 | if (obj != NULL) | |
2596 | { | |
2597 | long new_offset = offset; | |
2598 | ||
2599 | set_value_component_location (v, obj); | |
2600 | set_value_bitpos (v, bit_offset + value_bitpos (obj)); | |
2601 | set_value_bitsize (v, bit_size); | |
2602 | if (value_bitpos (v) >= HOST_CHAR_BIT) | |
2603 | { | |
2604 | ++new_offset; | |
2605 | set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT); | |
2606 | } | |
2607 | set_value_offset (v, new_offset); | |
2608 | ||
2609 | /* Also set the parent value. This is needed when trying to | |
2610 | assign a new value (in inferior memory). */ | |
2611 | set_value_parent (v, obj); | |
2612 | } | |
2613 | else | |
2614 | set_value_bitsize (v, bit_size); | |
bfb1c796 | 2615 | unpacked = value_contents_writeable (v); |
f93fca70 JB |
2616 | |
2617 | if (bit_size == 0) | |
2618 | { | |
2619 | memset (unpacked, 0, TYPE_LENGTH (type)); | |
d0a9e810 | 2620 | do_cleanups (old_chain); |
f93fca70 JB |
2621 | return v; |
2622 | } | |
2623 | ||
d0a9e810 | 2624 | if (staging != NULL && staging_len == TYPE_LENGTH (type)) |
f93fca70 | 2625 | { |
d0a9e810 JB |
2626 | /* Small short-cut: If we've unpacked the data into a buffer |
2627 | of the same size as TYPE's length, then we can reuse that, | |
2628 | instead of doing the unpacking again. */ | |
2629 | memcpy (unpacked, staging, staging_len); | |
f93fca70 | 2630 | } |
d0a9e810 JB |
2631 | else |
2632 | ada_unpack_from_contents (src, bit_offset, bit_size, | |
2633 | unpacked, TYPE_LENGTH (type), | |
2634 | is_big_endian, has_negatives (type), is_scalar); | |
f93fca70 | 2635 | |
d0a9e810 | 2636 | do_cleanups (old_chain); |
14f9c5c9 AS |
2637 | return v; |
2638 | } | |
d2e4a39e | 2639 | |
14f9c5c9 AS |
2640 | /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to |
2641 | TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must | |
4c4b4cd2 | 2642 | not overlap. */ |
14f9c5c9 | 2643 | static void |
fc1a4b47 | 2644 | move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source, |
50810684 | 2645 | int src_offset, int n, int bits_big_endian_p) |
14f9c5c9 AS |
2646 | { |
2647 | unsigned int accum, mask; | |
2648 | int accum_bits, chunk_size; | |
2649 | ||
2650 | target += targ_offset / HOST_CHAR_BIT; | |
2651 | targ_offset %= HOST_CHAR_BIT; | |
2652 | source += src_offset / HOST_CHAR_BIT; | |
2653 | src_offset %= HOST_CHAR_BIT; | |
50810684 | 2654 | if (bits_big_endian_p) |
14f9c5c9 AS |
2655 | { |
2656 | accum = (unsigned char) *source; | |
2657 | source += 1; | |
2658 | accum_bits = HOST_CHAR_BIT - src_offset; | |
2659 | ||
d2e4a39e | 2660 | while (n > 0) |
4c4b4cd2 PH |
2661 | { |
2662 | int unused_right; | |
5b4ee69b | 2663 | |
4c4b4cd2 PH |
2664 | accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source; |
2665 | accum_bits += HOST_CHAR_BIT; | |
2666 | source += 1; | |
2667 | chunk_size = HOST_CHAR_BIT - targ_offset; | |
2668 | if (chunk_size > n) | |
2669 | chunk_size = n; | |
2670 | unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset); | |
2671 | mask = ((1 << chunk_size) - 1) << unused_right; | |
2672 | *target = | |
2673 | (*target & ~mask) | |
2674 | | ((accum >> (accum_bits - chunk_size - unused_right)) & mask); | |
2675 | n -= chunk_size; | |
2676 | accum_bits -= chunk_size; | |
2677 | target += 1; | |
2678 | targ_offset = 0; | |
2679 | } | |
14f9c5c9 AS |
2680 | } |
2681 | else | |
2682 | { | |
2683 | accum = (unsigned char) *source >> src_offset; | |
2684 | source += 1; | |
2685 | accum_bits = HOST_CHAR_BIT - src_offset; | |
2686 | ||
d2e4a39e | 2687 | while (n > 0) |
4c4b4cd2 PH |
2688 | { |
2689 | accum = accum + ((unsigned char) *source << accum_bits); | |
2690 | accum_bits += HOST_CHAR_BIT; | |
2691 | source += 1; | |
2692 | chunk_size = HOST_CHAR_BIT - targ_offset; | |
2693 | if (chunk_size > n) | |
2694 | chunk_size = n; | |
2695 | mask = ((1 << chunk_size) - 1) << targ_offset; | |
2696 | *target = (*target & ~mask) | ((accum << targ_offset) & mask); | |
2697 | n -= chunk_size; | |
2698 | accum_bits -= chunk_size; | |
2699 | accum >>= chunk_size; | |
2700 | target += 1; | |
2701 | targ_offset = 0; | |
2702 | } | |
14f9c5c9 AS |
2703 | } |
2704 | } | |
2705 | ||
14f9c5c9 AS |
2706 | /* Store the contents of FROMVAL into the location of TOVAL. |
2707 | Return a new value with the location of TOVAL and contents of | |
2708 | FROMVAL. Handles assignment into packed fields that have | |
4c4b4cd2 | 2709 | floating-point or non-scalar types. */ |
14f9c5c9 | 2710 | |
d2e4a39e AS |
2711 | static struct value * |
2712 | ada_value_assign (struct value *toval, struct value *fromval) | |
14f9c5c9 | 2713 | { |
df407dfe AC |
2714 | struct type *type = value_type (toval); |
2715 | int bits = value_bitsize (toval); | |
14f9c5c9 | 2716 | |
52ce6436 PH |
2717 | toval = ada_coerce_ref (toval); |
2718 | fromval = ada_coerce_ref (fromval); | |
2719 | ||
2720 | if (ada_is_direct_array_type (value_type (toval))) | |
2721 | toval = ada_coerce_to_simple_array (toval); | |
2722 | if (ada_is_direct_array_type (value_type (fromval))) | |
2723 | fromval = ada_coerce_to_simple_array (fromval); | |
2724 | ||
88e3b34b | 2725 | if (!deprecated_value_modifiable (toval)) |
323e0a4a | 2726 | error (_("Left operand of assignment is not a modifiable lvalue.")); |
14f9c5c9 | 2727 | |
d2e4a39e | 2728 | if (VALUE_LVAL (toval) == lval_memory |
14f9c5c9 | 2729 | && bits > 0 |
d2e4a39e | 2730 | && (TYPE_CODE (type) == TYPE_CODE_FLT |
4c4b4cd2 | 2731 | || TYPE_CODE (type) == TYPE_CODE_STRUCT)) |
14f9c5c9 | 2732 | { |
df407dfe AC |
2733 | int len = (value_bitpos (toval) |
2734 | + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
aced2898 | 2735 | int from_size; |
224c3ddb | 2736 | gdb_byte *buffer = (gdb_byte *) alloca (len); |
d2e4a39e | 2737 | struct value *val; |
42ae5230 | 2738 | CORE_ADDR to_addr = value_address (toval); |
14f9c5c9 AS |
2739 | |
2740 | if (TYPE_CODE (type) == TYPE_CODE_FLT) | |
4c4b4cd2 | 2741 | fromval = value_cast (type, fromval); |
14f9c5c9 | 2742 | |
52ce6436 | 2743 | read_memory (to_addr, buffer, len); |
aced2898 PH |
2744 | from_size = value_bitsize (fromval); |
2745 | if (from_size == 0) | |
2746 | from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT; | |
50810684 | 2747 | if (gdbarch_bits_big_endian (get_type_arch (type))) |
df407dfe | 2748 | move_bits (buffer, value_bitpos (toval), |
50810684 | 2749 | value_contents (fromval), from_size - bits, bits, 1); |
14f9c5c9 | 2750 | else |
50810684 UW |
2751 | move_bits (buffer, value_bitpos (toval), |
2752 | value_contents (fromval), 0, bits, 0); | |
972daa01 | 2753 | write_memory_with_notification (to_addr, buffer, len); |
8cebebb9 | 2754 | |
14f9c5c9 | 2755 | val = value_copy (toval); |
0fd88904 | 2756 | memcpy (value_contents_raw (val), value_contents (fromval), |
4c4b4cd2 | 2757 | TYPE_LENGTH (type)); |
04624583 | 2758 | deprecated_set_value_type (val, type); |
d2e4a39e | 2759 | |
14f9c5c9 AS |
2760 | return val; |
2761 | } | |
2762 | ||
2763 | return value_assign (toval, fromval); | |
2764 | } | |
2765 | ||
2766 | ||
7c512744 JB |
2767 | /* Given that COMPONENT is a memory lvalue that is part of the lvalue |
2768 | CONTAINER, assign the contents of VAL to COMPONENTS's place in | |
2769 | CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not | |
2770 | COMPONENT, and not the inferior's memory. The current contents | |
2771 | of COMPONENT are ignored. | |
2772 | ||
2773 | Although not part of the initial design, this function also works | |
2774 | when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER | |
2775 | had a null address, and COMPONENT had an address which is equal to | |
2776 | its offset inside CONTAINER. */ | |
2777 | ||
52ce6436 PH |
2778 | static void |
2779 | value_assign_to_component (struct value *container, struct value *component, | |
2780 | struct value *val) | |
2781 | { | |
2782 | LONGEST offset_in_container = | |
42ae5230 | 2783 | (LONGEST) (value_address (component) - value_address (container)); |
7c512744 | 2784 | int bit_offset_in_container = |
52ce6436 PH |
2785 | value_bitpos (component) - value_bitpos (container); |
2786 | int bits; | |
7c512744 | 2787 | |
52ce6436 PH |
2788 | val = value_cast (value_type (component), val); |
2789 | ||
2790 | if (value_bitsize (component) == 0) | |
2791 | bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component)); | |
2792 | else | |
2793 | bits = value_bitsize (component); | |
2794 | ||
50810684 | 2795 | if (gdbarch_bits_big_endian (get_type_arch (value_type (container)))) |
7c512744 | 2796 | move_bits (value_contents_writeable (container) + offset_in_container, |
52ce6436 PH |
2797 | value_bitpos (container) + bit_offset_in_container, |
2798 | value_contents (val), | |
2799 | TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits, | |
50810684 | 2800 | bits, 1); |
52ce6436 | 2801 | else |
7c512744 | 2802 | move_bits (value_contents_writeable (container) + offset_in_container, |
52ce6436 | 2803 | value_bitpos (container) + bit_offset_in_container, |
50810684 | 2804 | value_contents (val), 0, bits, 0); |
7c512744 JB |
2805 | } |
2806 | ||
4c4b4cd2 PH |
2807 | /* The value of the element of array ARR at the ARITY indices given in IND. |
2808 | ARR may be either a simple array, GNAT array descriptor, or pointer | |
14f9c5c9 AS |
2809 | thereto. */ |
2810 | ||
d2e4a39e AS |
2811 | struct value * |
2812 | ada_value_subscript (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
2813 | { |
2814 | int k; | |
d2e4a39e AS |
2815 | struct value *elt; |
2816 | struct type *elt_type; | |
14f9c5c9 AS |
2817 | |
2818 | elt = ada_coerce_to_simple_array (arr); | |
2819 | ||
df407dfe | 2820 | elt_type = ada_check_typedef (value_type (elt)); |
d2e4a39e | 2821 | if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
2822 | && TYPE_FIELD_BITSIZE (elt_type, 0) > 0) |
2823 | return value_subscript_packed (elt, arity, ind); | |
2824 | ||
2825 | for (k = 0; k < arity; k += 1) | |
2826 | { | |
2827 | if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY) | |
323e0a4a | 2828 | error (_("too many subscripts (%d expected)"), k); |
2497b498 | 2829 | elt = value_subscript (elt, pos_atr (ind[k])); |
14f9c5c9 AS |
2830 | } |
2831 | return elt; | |
2832 | } | |
2833 | ||
deede10c JB |
2834 | /* Assuming ARR is a pointer to a GDB array, the value of the element |
2835 | of *ARR at the ARITY indices given in IND. | |
919e6dbe PMR |
2836 | Does not read the entire array into memory. |
2837 | ||
2838 | Note: Unlike what one would expect, this function is used instead of | |
2839 | ada_value_subscript for basically all non-packed array types. The reason | |
2840 | for this is that a side effect of doing our own pointer arithmetics instead | |
2841 | of relying on value_subscript is that there is no implicit typedef peeling. | |
2842 | This is important for arrays of array accesses, where it allows us to | |
2843 | preserve the fact that the array's element is an array access, where the | |
2844 | access part os encoded in a typedef layer. */ | |
14f9c5c9 | 2845 | |
2c0b251b | 2846 | static struct value * |
deede10c | 2847 | ada_value_ptr_subscript (struct value *arr, int arity, struct value **ind) |
14f9c5c9 AS |
2848 | { |
2849 | int k; | |
919e6dbe | 2850 | struct value *array_ind = ada_value_ind (arr); |
deede10c | 2851 | struct type *type |
919e6dbe PMR |
2852 | = check_typedef (value_enclosing_type (array_ind)); |
2853 | ||
2854 | if (TYPE_CODE (type) == TYPE_CODE_ARRAY | |
2855 | && TYPE_FIELD_BITSIZE (type, 0) > 0) | |
2856 | return value_subscript_packed (array_ind, arity, ind); | |
14f9c5c9 AS |
2857 | |
2858 | for (k = 0; k < arity; k += 1) | |
2859 | { | |
2860 | LONGEST lwb, upb; | |
aa715135 | 2861 | struct value *lwb_value; |
14f9c5c9 AS |
2862 | |
2863 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY) | |
323e0a4a | 2864 | error (_("too many subscripts (%d expected)"), k); |
d2e4a39e | 2865 | arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
4c4b4cd2 | 2866 | value_copy (arr)); |
14f9c5c9 | 2867 | get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb); |
aa715135 JG |
2868 | lwb_value = value_from_longest (value_type(ind[k]), lwb); |
2869 | arr = value_ptradd (arr, pos_atr (ind[k]) - pos_atr (lwb_value)); | |
14f9c5c9 AS |
2870 | type = TYPE_TARGET_TYPE (type); |
2871 | } | |
2872 | ||
2873 | return value_ind (arr); | |
2874 | } | |
2875 | ||
0b5d8877 | 2876 | /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the |
aa715135 JG |
2877 | actual type of ARRAY_PTR is ignored), returns the Ada slice of |
2878 | HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of | |
2879 | this array is LOW, as per Ada rules. */ | |
0b5d8877 | 2880 | static struct value * |
f5938064 JG |
2881 | ada_value_slice_from_ptr (struct value *array_ptr, struct type *type, |
2882 | int low, int high) | |
0b5d8877 | 2883 | { |
b0dd7688 | 2884 | struct type *type0 = ada_check_typedef (type); |
aa715135 | 2885 | struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)); |
0c9c3474 | 2886 | struct type *index_type |
aa715135 | 2887 | = create_static_range_type (NULL, base_index_type, low, high); |
6c038f32 | 2888 | struct type *slice_type = |
b0dd7688 | 2889 | create_array_type (NULL, TYPE_TARGET_TYPE (type0), index_type); |
aa715135 JG |
2890 | int base_low = ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)); |
2891 | LONGEST base_low_pos, low_pos; | |
2892 | CORE_ADDR base; | |
2893 | ||
2894 | if (!discrete_position (base_index_type, low, &low_pos) | |
2895 | || !discrete_position (base_index_type, base_low, &base_low_pos)) | |
2896 | { | |
2897 | warning (_("unable to get positions in slice, use bounds instead")); | |
2898 | low_pos = low; | |
2899 | base_low_pos = base_low; | |
2900 | } | |
5b4ee69b | 2901 | |
aa715135 JG |
2902 | base = value_as_address (array_ptr) |
2903 | + ((low_pos - base_low_pos) | |
2904 | * TYPE_LENGTH (TYPE_TARGET_TYPE (type0))); | |
f5938064 | 2905 | return value_at_lazy (slice_type, base); |
0b5d8877 PH |
2906 | } |
2907 | ||
2908 | ||
2909 | static struct value * | |
2910 | ada_value_slice (struct value *array, int low, int high) | |
2911 | { | |
b0dd7688 | 2912 | struct type *type = ada_check_typedef (value_type (array)); |
aa715135 | 2913 | struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)); |
0c9c3474 SA |
2914 | struct type *index_type |
2915 | = create_static_range_type (NULL, TYPE_INDEX_TYPE (type), low, high); | |
6c038f32 | 2916 | struct type *slice_type = |
0b5d8877 | 2917 | create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type); |
aa715135 | 2918 | LONGEST low_pos, high_pos; |
5b4ee69b | 2919 | |
aa715135 JG |
2920 | if (!discrete_position (base_index_type, low, &low_pos) |
2921 | || !discrete_position (base_index_type, high, &high_pos)) | |
2922 | { | |
2923 | warning (_("unable to get positions in slice, use bounds instead")); | |
2924 | low_pos = low; | |
2925 | high_pos = high; | |
2926 | } | |
2927 | ||
2928 | return value_cast (slice_type, | |
2929 | value_slice (array, low, high_pos - low_pos + 1)); | |
0b5d8877 PH |
2930 | } |
2931 | ||
14f9c5c9 AS |
2932 | /* If type is a record type in the form of a standard GNAT array |
2933 | descriptor, returns the number of dimensions for type. If arr is a | |
2934 | simple array, returns the number of "array of"s that prefix its | |
4c4b4cd2 | 2935 | type designation. Otherwise, returns 0. */ |
14f9c5c9 AS |
2936 | |
2937 | int | |
d2e4a39e | 2938 | ada_array_arity (struct type *type) |
14f9c5c9 AS |
2939 | { |
2940 | int arity; | |
2941 | ||
2942 | if (type == NULL) | |
2943 | return 0; | |
2944 | ||
2945 | type = desc_base_type (type); | |
2946 | ||
2947 | arity = 0; | |
d2e4a39e | 2948 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
14f9c5c9 | 2949 | return desc_arity (desc_bounds_type (type)); |
d2e4a39e AS |
2950 | else |
2951 | while (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
14f9c5c9 | 2952 | { |
4c4b4cd2 | 2953 | arity += 1; |
61ee279c | 2954 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
14f9c5c9 | 2955 | } |
d2e4a39e | 2956 | |
14f9c5c9 AS |
2957 | return arity; |
2958 | } | |
2959 | ||
2960 | /* If TYPE is a record type in the form of a standard GNAT array | |
2961 | descriptor or a simple array type, returns the element type for | |
2962 | TYPE after indexing by NINDICES indices, or by all indices if | |
4c4b4cd2 | 2963 | NINDICES is -1. Otherwise, returns NULL. */ |
14f9c5c9 | 2964 | |
d2e4a39e AS |
2965 | struct type * |
2966 | ada_array_element_type (struct type *type, int nindices) | |
14f9c5c9 AS |
2967 | { |
2968 | type = desc_base_type (type); | |
2969 | ||
d2e4a39e | 2970 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
14f9c5c9 AS |
2971 | { |
2972 | int k; | |
d2e4a39e | 2973 | struct type *p_array_type; |
14f9c5c9 | 2974 | |
556bdfd4 | 2975 | p_array_type = desc_data_target_type (type); |
14f9c5c9 AS |
2976 | |
2977 | k = ada_array_arity (type); | |
2978 | if (k == 0) | |
4c4b4cd2 | 2979 | return NULL; |
d2e4a39e | 2980 | |
4c4b4cd2 | 2981 | /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */ |
14f9c5c9 | 2982 | if (nindices >= 0 && k > nindices) |
4c4b4cd2 | 2983 | k = nindices; |
d2e4a39e | 2984 | while (k > 0 && p_array_type != NULL) |
4c4b4cd2 | 2985 | { |
61ee279c | 2986 | p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type)); |
4c4b4cd2 PH |
2987 | k -= 1; |
2988 | } | |
14f9c5c9 AS |
2989 | return p_array_type; |
2990 | } | |
2991 | else if (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
2992 | { | |
2993 | while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
4c4b4cd2 PH |
2994 | { |
2995 | type = TYPE_TARGET_TYPE (type); | |
2996 | nindices -= 1; | |
2997 | } | |
14f9c5c9 AS |
2998 | return type; |
2999 | } | |
3000 | ||
3001 | return NULL; | |
3002 | } | |
3003 | ||
4c4b4cd2 | 3004 | /* The type of nth index in arrays of given type (n numbering from 1). |
dd19d49e UW |
3005 | Does not examine memory. Throws an error if N is invalid or TYPE |
3006 | is not an array type. NAME is the name of the Ada attribute being | |
3007 | evaluated ('range, 'first, 'last, or 'length); it is used in building | |
3008 | the error message. */ | |
14f9c5c9 | 3009 | |
1eea4ebd UW |
3010 | static struct type * |
3011 | ada_index_type (struct type *type, int n, const char *name) | |
14f9c5c9 | 3012 | { |
4c4b4cd2 PH |
3013 | struct type *result_type; |
3014 | ||
14f9c5c9 AS |
3015 | type = desc_base_type (type); |
3016 | ||
1eea4ebd UW |
3017 | if (n < 0 || n > ada_array_arity (type)) |
3018 | error (_("invalid dimension number to '%s"), name); | |
14f9c5c9 | 3019 | |
4c4b4cd2 | 3020 | if (ada_is_simple_array_type (type)) |
14f9c5c9 AS |
3021 | { |
3022 | int i; | |
3023 | ||
3024 | for (i = 1; i < n; i += 1) | |
4c4b4cd2 | 3025 | type = TYPE_TARGET_TYPE (type); |
262452ec | 3026 | result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)); |
4c4b4cd2 PH |
3027 | /* FIXME: The stabs type r(0,0);bound;bound in an array type |
3028 | has a target type of TYPE_CODE_UNDEF. We compensate here, but | |
76a01679 | 3029 | perhaps stabsread.c would make more sense. */ |
1eea4ebd UW |
3030 | if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF) |
3031 | result_type = NULL; | |
14f9c5c9 | 3032 | } |
d2e4a39e | 3033 | else |
1eea4ebd UW |
3034 | { |
3035 | result_type = desc_index_type (desc_bounds_type (type), n); | |
3036 | if (result_type == NULL) | |
3037 | error (_("attempt to take bound of something that is not an array")); | |
3038 | } | |
3039 | ||
3040 | return result_type; | |
14f9c5c9 AS |
3041 | } |
3042 | ||
3043 | /* Given that arr is an array type, returns the lower bound of the | |
3044 | Nth index (numbering from 1) if WHICH is 0, and the upper bound if | |
4c4b4cd2 | 3045 | WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an |
1eea4ebd UW |
3046 | array-descriptor type. It works for other arrays with bounds supplied |
3047 | by run-time quantities other than discriminants. */ | |
14f9c5c9 | 3048 | |
abb68b3e | 3049 | static LONGEST |
fb5e3d5c | 3050 | ada_array_bound_from_type (struct type *arr_type, int n, int which) |
14f9c5c9 | 3051 | { |
8a48ac95 | 3052 | struct type *type, *index_type_desc, *index_type; |
1ce677a4 | 3053 | int i; |
262452ec JK |
3054 | |
3055 | gdb_assert (which == 0 || which == 1); | |
14f9c5c9 | 3056 | |
ad82864c JB |
3057 | if (ada_is_constrained_packed_array_type (arr_type)) |
3058 | arr_type = decode_constrained_packed_array_type (arr_type); | |
14f9c5c9 | 3059 | |
4c4b4cd2 | 3060 | if (arr_type == NULL || !ada_is_simple_array_type (arr_type)) |
1eea4ebd | 3061 | return (LONGEST) - which; |
14f9c5c9 AS |
3062 | |
3063 | if (TYPE_CODE (arr_type) == TYPE_CODE_PTR) | |
3064 | type = TYPE_TARGET_TYPE (arr_type); | |
3065 | else | |
3066 | type = arr_type; | |
3067 | ||
bafffb51 JB |
3068 | if (TYPE_FIXED_INSTANCE (type)) |
3069 | { | |
3070 | /* The array has already been fixed, so we do not need to | |
3071 | check the parallel ___XA type again. That encoding has | |
3072 | already been applied, so ignore it now. */ | |
3073 | index_type_desc = NULL; | |
3074 | } | |
3075 | else | |
3076 | { | |
3077 | index_type_desc = ada_find_parallel_type (type, "___XA"); | |
3078 | ada_fixup_array_indexes_type (index_type_desc); | |
3079 | } | |
3080 | ||
262452ec | 3081 | if (index_type_desc != NULL) |
28c85d6c JB |
3082 | index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1), |
3083 | NULL); | |
262452ec | 3084 | else |
8a48ac95 JB |
3085 | { |
3086 | struct type *elt_type = check_typedef (type); | |
3087 | ||
3088 | for (i = 1; i < n; i++) | |
3089 | elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type)); | |
3090 | ||
3091 | index_type = TYPE_INDEX_TYPE (elt_type); | |
3092 | } | |
262452ec | 3093 | |
43bbcdc2 PH |
3094 | return |
3095 | (LONGEST) (which == 0 | |
3096 | ? ada_discrete_type_low_bound (index_type) | |
3097 | : ada_discrete_type_high_bound (index_type)); | |
14f9c5c9 AS |
3098 | } |
3099 | ||
3100 | /* Given that arr is an array value, returns the lower bound of the | |
abb68b3e JB |
3101 | nth index (numbering from 1) if WHICH is 0, and the upper bound if |
3102 | WHICH is 1. This routine will also work for arrays with bounds | |
4c4b4cd2 | 3103 | supplied by run-time quantities other than discriminants. */ |
14f9c5c9 | 3104 | |
1eea4ebd | 3105 | static LONGEST |
4dc81987 | 3106 | ada_array_bound (struct value *arr, int n, int which) |
14f9c5c9 | 3107 | { |
eb479039 JB |
3108 | struct type *arr_type; |
3109 | ||
3110 | if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR) | |
3111 | arr = value_ind (arr); | |
3112 | arr_type = value_enclosing_type (arr); | |
14f9c5c9 | 3113 | |
ad82864c JB |
3114 | if (ada_is_constrained_packed_array_type (arr_type)) |
3115 | return ada_array_bound (decode_constrained_packed_array (arr), n, which); | |
4c4b4cd2 | 3116 | else if (ada_is_simple_array_type (arr_type)) |
1eea4ebd | 3117 | return ada_array_bound_from_type (arr_type, n, which); |
14f9c5c9 | 3118 | else |
1eea4ebd | 3119 | return value_as_long (desc_one_bound (desc_bounds (arr), n, which)); |
14f9c5c9 AS |
3120 | } |
3121 | ||
3122 | /* Given that arr is an array value, returns the length of the | |
3123 | nth index. This routine will also work for arrays with bounds | |
4c4b4cd2 PH |
3124 | supplied by run-time quantities other than discriminants. |
3125 | Does not work for arrays indexed by enumeration types with representation | |
3126 | clauses at the moment. */ | |
14f9c5c9 | 3127 | |
1eea4ebd | 3128 | static LONGEST |
d2e4a39e | 3129 | ada_array_length (struct value *arr, int n) |
14f9c5c9 | 3130 | { |
aa715135 JG |
3131 | struct type *arr_type, *index_type; |
3132 | int low, high; | |
eb479039 JB |
3133 | |
3134 | if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR) | |
3135 | arr = value_ind (arr); | |
3136 | arr_type = value_enclosing_type (arr); | |
14f9c5c9 | 3137 | |
ad82864c JB |
3138 | if (ada_is_constrained_packed_array_type (arr_type)) |
3139 | return ada_array_length (decode_constrained_packed_array (arr), n); | |
14f9c5c9 | 3140 | |
4c4b4cd2 | 3141 | if (ada_is_simple_array_type (arr_type)) |
aa715135 JG |
3142 | { |
3143 | low = ada_array_bound_from_type (arr_type, n, 0); | |
3144 | high = ada_array_bound_from_type (arr_type, n, 1); | |
3145 | } | |
14f9c5c9 | 3146 | else |
aa715135 JG |
3147 | { |
3148 | low = value_as_long (desc_one_bound (desc_bounds (arr), n, 0)); | |
3149 | high = value_as_long (desc_one_bound (desc_bounds (arr), n, 1)); | |
3150 | } | |
3151 | ||
f168693b | 3152 | arr_type = check_typedef (arr_type); |
aa715135 JG |
3153 | index_type = TYPE_INDEX_TYPE (arr_type); |
3154 | if (index_type != NULL) | |
3155 | { | |
3156 | struct type *base_type; | |
3157 | if (TYPE_CODE (index_type) == TYPE_CODE_RANGE) | |
3158 | base_type = TYPE_TARGET_TYPE (index_type); | |
3159 | else | |
3160 | base_type = index_type; | |
3161 | ||
3162 | low = pos_atr (value_from_longest (base_type, low)); | |
3163 | high = pos_atr (value_from_longest (base_type, high)); | |
3164 | } | |
3165 | return high - low + 1; | |
4c4b4cd2 PH |
3166 | } |
3167 | ||
3168 | /* An empty array whose type is that of ARR_TYPE (an array type), | |
3169 | with bounds LOW to LOW-1. */ | |
3170 | ||
3171 | static struct value * | |
3172 | empty_array (struct type *arr_type, int low) | |
3173 | { | |
b0dd7688 | 3174 | struct type *arr_type0 = ada_check_typedef (arr_type); |
0c9c3474 SA |
3175 | struct type *index_type |
3176 | = create_static_range_type | |
3177 | (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)), low, low - 1); | |
b0dd7688 | 3178 | struct type *elt_type = ada_array_element_type (arr_type0, 1); |
5b4ee69b | 3179 | |
0b5d8877 | 3180 | return allocate_value (create_array_type (NULL, elt_type, index_type)); |
14f9c5c9 | 3181 | } |
14f9c5c9 | 3182 | \f |
d2e4a39e | 3183 | |
4c4b4cd2 | 3184 | /* Name resolution */ |
14f9c5c9 | 3185 | |
4c4b4cd2 PH |
3186 | /* The "decoded" name for the user-definable Ada operator corresponding |
3187 | to OP. */ | |
14f9c5c9 | 3188 | |
d2e4a39e | 3189 | static const char * |
4c4b4cd2 | 3190 | ada_decoded_op_name (enum exp_opcode op) |
14f9c5c9 AS |
3191 | { |
3192 | int i; | |
3193 | ||
4c4b4cd2 | 3194 | for (i = 0; ada_opname_table[i].encoded != NULL; i += 1) |
14f9c5c9 AS |
3195 | { |
3196 | if (ada_opname_table[i].op == op) | |
4c4b4cd2 | 3197 | return ada_opname_table[i].decoded; |
14f9c5c9 | 3198 | } |
323e0a4a | 3199 | error (_("Could not find operator name for opcode")); |
14f9c5c9 AS |
3200 | } |
3201 | ||
3202 | ||
4c4b4cd2 PH |
3203 | /* Same as evaluate_type (*EXP), but resolves ambiguous symbol |
3204 | references (marked by OP_VAR_VALUE nodes in which the symbol has an | |
3205 | undefined namespace) and converts operators that are | |
3206 | user-defined into appropriate function calls. If CONTEXT_TYPE is | |
14f9c5c9 AS |
3207 | non-null, it provides a preferred result type [at the moment, only |
3208 | type void has any effect---causing procedures to be preferred over | |
3209 | functions in calls]. A null CONTEXT_TYPE indicates that a non-void | |
4c4b4cd2 | 3210 | return type is preferred. May change (expand) *EXP. */ |
14f9c5c9 | 3211 | |
4c4b4cd2 PH |
3212 | static void |
3213 | resolve (struct expression **expp, int void_context_p) | |
14f9c5c9 | 3214 | { |
30b15541 UW |
3215 | struct type *context_type = NULL; |
3216 | int pc = 0; | |
3217 | ||
3218 | if (void_context_p) | |
3219 | context_type = builtin_type ((*expp)->gdbarch)->builtin_void; | |
3220 | ||
3221 | resolve_subexp (expp, &pc, 1, context_type); | |
14f9c5c9 AS |
3222 | } |
3223 | ||
4c4b4cd2 PH |
3224 | /* Resolve the operator of the subexpression beginning at |
3225 | position *POS of *EXPP. "Resolving" consists of replacing | |
3226 | the symbols that have undefined namespaces in OP_VAR_VALUE nodes | |
3227 | with their resolutions, replacing built-in operators with | |
3228 | function calls to user-defined operators, where appropriate, and, | |
3229 | when DEPROCEDURE_P is non-zero, converting function-valued variables | |
3230 | into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions | |
3231 | are as in ada_resolve, above. */ | |
14f9c5c9 | 3232 | |
d2e4a39e | 3233 | static struct value * |
4c4b4cd2 | 3234 | resolve_subexp (struct expression **expp, int *pos, int deprocedure_p, |
76a01679 | 3235 | struct type *context_type) |
14f9c5c9 AS |
3236 | { |
3237 | int pc = *pos; | |
3238 | int i; | |
4c4b4cd2 | 3239 | struct expression *exp; /* Convenience: == *expp. */ |
14f9c5c9 | 3240 | enum exp_opcode op = (*expp)->elts[pc].opcode; |
4c4b4cd2 PH |
3241 | struct value **argvec; /* Vector of operand types (alloca'ed). */ |
3242 | int nargs; /* Number of operands. */ | |
52ce6436 | 3243 | int oplen; |
14f9c5c9 AS |
3244 | |
3245 | argvec = NULL; | |
3246 | nargs = 0; | |
3247 | exp = *expp; | |
3248 | ||
52ce6436 PH |
3249 | /* Pass one: resolve operands, saving their types and updating *pos, |
3250 | if needed. */ | |
14f9c5c9 AS |
3251 | switch (op) |
3252 | { | |
4c4b4cd2 PH |
3253 | case OP_FUNCALL: |
3254 | if (exp->elts[pc + 3].opcode == OP_VAR_VALUE | |
76a01679 JB |
3255 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
3256 | *pos += 7; | |
4c4b4cd2 PH |
3257 | else |
3258 | { | |
3259 | *pos += 3; | |
3260 | resolve_subexp (expp, pos, 0, NULL); | |
3261 | } | |
3262 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
14f9c5c9 AS |
3263 | break; |
3264 | ||
14f9c5c9 | 3265 | case UNOP_ADDR: |
4c4b4cd2 PH |
3266 | *pos += 1; |
3267 | resolve_subexp (expp, pos, 0, NULL); | |
3268 | break; | |
3269 | ||
52ce6436 PH |
3270 | case UNOP_QUAL: |
3271 | *pos += 3; | |
17466c1a | 3272 | resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type)); |
4c4b4cd2 PH |
3273 | break; |
3274 | ||
52ce6436 | 3275 | case OP_ATR_MODULUS: |
4c4b4cd2 PH |
3276 | case OP_ATR_SIZE: |
3277 | case OP_ATR_TAG: | |
4c4b4cd2 PH |
3278 | case OP_ATR_FIRST: |
3279 | case OP_ATR_LAST: | |
3280 | case OP_ATR_LENGTH: | |
3281 | case OP_ATR_POS: | |
3282 | case OP_ATR_VAL: | |
4c4b4cd2 PH |
3283 | case OP_ATR_MIN: |
3284 | case OP_ATR_MAX: | |
52ce6436 PH |
3285 | case TERNOP_IN_RANGE: |
3286 | case BINOP_IN_BOUNDS: | |
3287 | case UNOP_IN_RANGE: | |
3288 | case OP_AGGREGATE: | |
3289 | case OP_OTHERS: | |
3290 | case OP_CHOICES: | |
3291 | case OP_POSITIONAL: | |
3292 | case OP_DISCRETE_RANGE: | |
3293 | case OP_NAME: | |
3294 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
3295 | *pos += oplen; | |
14f9c5c9 AS |
3296 | break; |
3297 | ||
3298 | case BINOP_ASSIGN: | |
3299 | { | |
4c4b4cd2 PH |
3300 | struct value *arg1; |
3301 | ||
3302 | *pos += 1; | |
3303 | arg1 = resolve_subexp (expp, pos, 0, NULL); | |
3304 | if (arg1 == NULL) | |
3305 | resolve_subexp (expp, pos, 1, NULL); | |
3306 | else | |
df407dfe | 3307 | resolve_subexp (expp, pos, 1, value_type (arg1)); |
4c4b4cd2 | 3308 | break; |
14f9c5c9 AS |
3309 | } |
3310 | ||
4c4b4cd2 | 3311 | case UNOP_CAST: |
4c4b4cd2 PH |
3312 | *pos += 3; |
3313 | nargs = 1; | |
3314 | break; | |
14f9c5c9 | 3315 | |
4c4b4cd2 PH |
3316 | case BINOP_ADD: |
3317 | case BINOP_SUB: | |
3318 | case BINOP_MUL: | |
3319 | case BINOP_DIV: | |
3320 | case BINOP_REM: | |
3321 | case BINOP_MOD: | |
3322 | case BINOP_EXP: | |
3323 | case BINOP_CONCAT: | |
3324 | case BINOP_LOGICAL_AND: | |
3325 | case BINOP_LOGICAL_OR: | |
3326 | case BINOP_BITWISE_AND: | |
3327 | case BINOP_BITWISE_IOR: | |
3328 | case BINOP_BITWISE_XOR: | |
14f9c5c9 | 3329 | |
4c4b4cd2 PH |
3330 | case BINOP_EQUAL: |
3331 | case BINOP_NOTEQUAL: | |
3332 | case BINOP_LESS: | |
3333 | case BINOP_GTR: | |
3334 | case BINOP_LEQ: | |
3335 | case BINOP_GEQ: | |
14f9c5c9 | 3336 | |
4c4b4cd2 PH |
3337 | case BINOP_REPEAT: |
3338 | case BINOP_SUBSCRIPT: | |
3339 | case BINOP_COMMA: | |
40c8aaa9 JB |
3340 | *pos += 1; |
3341 | nargs = 2; | |
3342 | break; | |
14f9c5c9 | 3343 | |
4c4b4cd2 PH |
3344 | case UNOP_NEG: |
3345 | case UNOP_PLUS: | |
3346 | case UNOP_LOGICAL_NOT: | |
3347 | case UNOP_ABS: | |
3348 | case UNOP_IND: | |
3349 | *pos += 1; | |
3350 | nargs = 1; | |
3351 | break; | |
14f9c5c9 | 3352 | |
4c4b4cd2 PH |
3353 | case OP_LONG: |
3354 | case OP_DOUBLE: | |
3355 | case OP_VAR_VALUE: | |
3356 | *pos += 4; | |
3357 | break; | |
14f9c5c9 | 3358 | |
4c4b4cd2 PH |
3359 | case OP_TYPE: |
3360 | case OP_BOOL: | |
3361 | case OP_LAST: | |
4c4b4cd2 PH |
3362 | case OP_INTERNALVAR: |
3363 | *pos += 3; | |
3364 | break; | |
14f9c5c9 | 3365 | |
4c4b4cd2 PH |
3366 | case UNOP_MEMVAL: |
3367 | *pos += 3; | |
3368 | nargs = 1; | |
3369 | break; | |
3370 | ||
67f3407f DJ |
3371 | case OP_REGISTER: |
3372 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
3373 | break; | |
3374 | ||
4c4b4cd2 PH |
3375 | case STRUCTOP_STRUCT: |
3376 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
3377 | nargs = 1; | |
3378 | break; | |
3379 | ||
4c4b4cd2 | 3380 | case TERNOP_SLICE: |
4c4b4cd2 PH |
3381 | *pos += 1; |
3382 | nargs = 3; | |
3383 | break; | |
3384 | ||
52ce6436 | 3385 | case OP_STRING: |
14f9c5c9 | 3386 | break; |
4c4b4cd2 PH |
3387 | |
3388 | default: | |
323e0a4a | 3389 | error (_("Unexpected operator during name resolution")); |
14f9c5c9 AS |
3390 | } |
3391 | ||
8d749320 | 3392 | argvec = XALLOCAVEC (struct value *, nargs + 1); |
4c4b4cd2 PH |
3393 | for (i = 0; i < nargs; i += 1) |
3394 | argvec[i] = resolve_subexp (expp, pos, 1, NULL); | |
3395 | argvec[i] = NULL; | |
3396 | exp = *expp; | |
3397 | ||
3398 | /* Pass two: perform any resolution on principal operator. */ | |
14f9c5c9 AS |
3399 | switch (op) |
3400 | { | |
3401 | default: | |
3402 | break; | |
3403 | ||
14f9c5c9 | 3404 | case OP_VAR_VALUE: |
4c4b4cd2 | 3405 | if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN) |
76a01679 | 3406 | { |
d12307c1 | 3407 | struct block_symbol *candidates; |
76a01679 JB |
3408 | int n_candidates; |
3409 | ||
3410 | n_candidates = | |
3411 | ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME | |
3412 | (exp->elts[pc + 2].symbol), | |
3413 | exp->elts[pc + 1].block, VAR_DOMAIN, | |
4eeaa230 | 3414 | &candidates); |
76a01679 JB |
3415 | |
3416 | if (n_candidates > 1) | |
3417 | { | |
3418 | /* Types tend to get re-introduced locally, so if there | |
3419 | are any local symbols that are not types, first filter | |
3420 | out all types. */ | |
3421 | int j; | |
3422 | for (j = 0; j < n_candidates; j += 1) | |
d12307c1 | 3423 | switch (SYMBOL_CLASS (candidates[j].symbol)) |
76a01679 JB |
3424 | { |
3425 | case LOC_REGISTER: | |
3426 | case LOC_ARG: | |
3427 | case LOC_REF_ARG: | |
76a01679 JB |
3428 | case LOC_REGPARM_ADDR: |
3429 | case LOC_LOCAL: | |
76a01679 | 3430 | case LOC_COMPUTED: |
76a01679 JB |
3431 | goto FoundNonType; |
3432 | default: | |
3433 | break; | |
3434 | } | |
3435 | FoundNonType: | |
3436 | if (j < n_candidates) | |
3437 | { | |
3438 | j = 0; | |
3439 | while (j < n_candidates) | |
3440 | { | |
d12307c1 | 3441 | if (SYMBOL_CLASS (candidates[j].symbol) == LOC_TYPEDEF) |
76a01679 JB |
3442 | { |
3443 | candidates[j] = candidates[n_candidates - 1]; | |
3444 | n_candidates -= 1; | |
3445 | } | |
3446 | else | |
3447 | j += 1; | |
3448 | } | |
3449 | } | |
3450 | } | |
3451 | ||
3452 | if (n_candidates == 0) | |
323e0a4a | 3453 | error (_("No definition found for %s"), |
76a01679 JB |
3454 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3455 | else if (n_candidates == 1) | |
3456 | i = 0; | |
3457 | else if (deprocedure_p | |
3458 | && !is_nonfunction (candidates, n_candidates)) | |
3459 | { | |
06d5cf63 JB |
3460 | i = ada_resolve_function |
3461 | (candidates, n_candidates, NULL, 0, | |
3462 | SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol), | |
3463 | context_type); | |
76a01679 | 3464 | if (i < 0) |
323e0a4a | 3465 | error (_("Could not find a match for %s"), |
76a01679 JB |
3466 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3467 | } | |
3468 | else | |
3469 | { | |
323e0a4a | 3470 | printf_filtered (_("Multiple matches for %s\n"), |
76a01679 JB |
3471 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3472 | user_select_syms (candidates, n_candidates, 1); | |
3473 | i = 0; | |
3474 | } | |
3475 | ||
3476 | exp->elts[pc + 1].block = candidates[i].block; | |
d12307c1 | 3477 | exp->elts[pc + 2].symbol = candidates[i].symbol; |
1265e4aa JB |
3478 | if (innermost_block == NULL |
3479 | || contained_in (candidates[i].block, innermost_block)) | |
76a01679 JB |
3480 | innermost_block = candidates[i].block; |
3481 | } | |
3482 | ||
3483 | if (deprocedure_p | |
3484 | && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol)) | |
3485 | == TYPE_CODE_FUNC)) | |
3486 | { | |
3487 | replace_operator_with_call (expp, pc, 0, 0, | |
3488 | exp->elts[pc + 2].symbol, | |
3489 | exp->elts[pc + 1].block); | |
3490 | exp = *expp; | |
3491 | } | |
14f9c5c9 AS |
3492 | break; |
3493 | ||
3494 | case OP_FUNCALL: | |
3495 | { | |
4c4b4cd2 | 3496 | if (exp->elts[pc + 3].opcode == OP_VAR_VALUE |
76a01679 | 3497 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
4c4b4cd2 | 3498 | { |
d12307c1 | 3499 | struct block_symbol *candidates; |
4c4b4cd2 PH |
3500 | int n_candidates; |
3501 | ||
3502 | n_candidates = | |
76a01679 JB |
3503 | ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME |
3504 | (exp->elts[pc + 5].symbol), | |
3505 | exp->elts[pc + 4].block, VAR_DOMAIN, | |
4eeaa230 | 3506 | &candidates); |
4c4b4cd2 PH |
3507 | if (n_candidates == 1) |
3508 | i = 0; | |
3509 | else | |
3510 | { | |
06d5cf63 JB |
3511 | i = ada_resolve_function |
3512 | (candidates, n_candidates, | |
3513 | argvec, nargs, | |
3514 | SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol), | |
3515 | context_type); | |
4c4b4cd2 | 3516 | if (i < 0) |
323e0a4a | 3517 | error (_("Could not find a match for %s"), |
4c4b4cd2 PH |
3518 | SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol)); |
3519 | } | |
3520 | ||
3521 | exp->elts[pc + 4].block = candidates[i].block; | |
d12307c1 | 3522 | exp->elts[pc + 5].symbol = candidates[i].symbol; |
1265e4aa JB |
3523 | if (innermost_block == NULL |
3524 | || contained_in (candidates[i].block, innermost_block)) | |
4c4b4cd2 PH |
3525 | innermost_block = candidates[i].block; |
3526 | } | |
14f9c5c9 AS |
3527 | } |
3528 | break; | |
3529 | case BINOP_ADD: | |
3530 | case BINOP_SUB: | |
3531 | case BINOP_MUL: | |
3532 | case BINOP_DIV: | |
3533 | case BINOP_REM: | |
3534 | case BINOP_MOD: | |
3535 | case BINOP_CONCAT: | |
3536 | case BINOP_BITWISE_AND: | |
3537 | case BINOP_BITWISE_IOR: | |
3538 | case BINOP_BITWISE_XOR: | |
3539 | case BINOP_EQUAL: | |
3540 | case BINOP_NOTEQUAL: | |
3541 | case BINOP_LESS: | |
3542 | case BINOP_GTR: | |
3543 | case BINOP_LEQ: | |
3544 | case BINOP_GEQ: | |
3545 | case BINOP_EXP: | |
3546 | case UNOP_NEG: | |
3547 | case UNOP_PLUS: | |
3548 | case UNOP_LOGICAL_NOT: | |
3549 | case UNOP_ABS: | |
3550 | if (possible_user_operator_p (op, argvec)) | |
4c4b4cd2 | 3551 | { |
d12307c1 | 3552 | struct block_symbol *candidates; |
4c4b4cd2 PH |
3553 | int n_candidates; |
3554 | ||
3555 | n_candidates = | |
3556 | ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)), | |
3557 | (struct block *) NULL, VAR_DOMAIN, | |
4eeaa230 | 3558 | &candidates); |
4c4b4cd2 | 3559 | i = ada_resolve_function (candidates, n_candidates, argvec, nargs, |
76a01679 | 3560 | ada_decoded_op_name (op), NULL); |
4c4b4cd2 PH |
3561 | if (i < 0) |
3562 | break; | |
3563 | ||
d12307c1 PMR |
3564 | replace_operator_with_call (expp, pc, nargs, 1, |
3565 | candidates[i].symbol, | |
3566 | candidates[i].block); | |
4c4b4cd2 PH |
3567 | exp = *expp; |
3568 | } | |
14f9c5c9 | 3569 | break; |
4c4b4cd2 PH |
3570 | |
3571 | case OP_TYPE: | |
b3dbf008 | 3572 | case OP_REGISTER: |
4c4b4cd2 | 3573 | return NULL; |
14f9c5c9 AS |
3574 | } |
3575 | ||
3576 | *pos = pc; | |
3577 | return evaluate_subexp_type (exp, pos); | |
3578 | } | |
3579 | ||
3580 | /* Return non-zero if formal type FTYPE matches actual type ATYPE. If | |
4c4b4cd2 | 3581 | MAY_DEREF is non-zero, the formal may be a pointer and the actual |
5b3d5b7d | 3582 | a non-pointer. */ |
14f9c5c9 | 3583 | /* The term "match" here is rather loose. The match is heuristic and |
5b3d5b7d | 3584 | liberal. */ |
14f9c5c9 AS |
3585 | |
3586 | static int | |
4dc81987 | 3587 | ada_type_match (struct type *ftype, struct type *atype, int may_deref) |
14f9c5c9 | 3588 | { |
61ee279c PH |
3589 | ftype = ada_check_typedef (ftype); |
3590 | atype = ada_check_typedef (atype); | |
14f9c5c9 AS |
3591 | |
3592 | if (TYPE_CODE (ftype) == TYPE_CODE_REF) | |
3593 | ftype = TYPE_TARGET_TYPE (ftype); | |
3594 | if (TYPE_CODE (atype) == TYPE_CODE_REF) | |
3595 | atype = TYPE_TARGET_TYPE (atype); | |
3596 | ||
d2e4a39e | 3597 | switch (TYPE_CODE (ftype)) |
14f9c5c9 AS |
3598 | { |
3599 | default: | |
5b3d5b7d | 3600 | return TYPE_CODE (ftype) == TYPE_CODE (atype); |
14f9c5c9 AS |
3601 | case TYPE_CODE_PTR: |
3602 | if (TYPE_CODE (atype) == TYPE_CODE_PTR) | |
4c4b4cd2 PH |
3603 | return ada_type_match (TYPE_TARGET_TYPE (ftype), |
3604 | TYPE_TARGET_TYPE (atype), 0); | |
d2e4a39e | 3605 | else |
1265e4aa JB |
3606 | return (may_deref |
3607 | && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0)); | |
14f9c5c9 AS |
3608 | case TYPE_CODE_INT: |
3609 | case TYPE_CODE_ENUM: | |
3610 | case TYPE_CODE_RANGE: | |
3611 | switch (TYPE_CODE (atype)) | |
4c4b4cd2 PH |
3612 | { |
3613 | case TYPE_CODE_INT: | |
3614 | case TYPE_CODE_ENUM: | |
3615 | case TYPE_CODE_RANGE: | |
3616 | return 1; | |
3617 | default: | |
3618 | return 0; | |
3619 | } | |
14f9c5c9 AS |
3620 | |
3621 | case TYPE_CODE_ARRAY: | |
d2e4a39e | 3622 | return (TYPE_CODE (atype) == TYPE_CODE_ARRAY |
4c4b4cd2 | 3623 | || ada_is_array_descriptor_type (atype)); |
14f9c5c9 AS |
3624 | |
3625 | case TYPE_CODE_STRUCT: | |
4c4b4cd2 PH |
3626 | if (ada_is_array_descriptor_type (ftype)) |
3627 | return (TYPE_CODE (atype) == TYPE_CODE_ARRAY | |
3628 | || ada_is_array_descriptor_type (atype)); | |
14f9c5c9 | 3629 | else |
4c4b4cd2 PH |
3630 | return (TYPE_CODE (atype) == TYPE_CODE_STRUCT |
3631 | && !ada_is_array_descriptor_type (atype)); | |
14f9c5c9 AS |
3632 | |
3633 | case TYPE_CODE_UNION: | |
3634 | case TYPE_CODE_FLT: | |
3635 | return (TYPE_CODE (atype) == TYPE_CODE (ftype)); | |
3636 | } | |
3637 | } | |
3638 | ||
3639 | /* Return non-zero if the formals of FUNC "sufficiently match" the | |
3640 | vector of actual argument types ACTUALS of size N_ACTUALS. FUNC | |
3641 | may also be an enumeral, in which case it is treated as a 0- | |
4c4b4cd2 | 3642 | argument function. */ |
14f9c5c9 AS |
3643 | |
3644 | static int | |
d2e4a39e | 3645 | ada_args_match (struct symbol *func, struct value **actuals, int n_actuals) |
14f9c5c9 AS |
3646 | { |
3647 | int i; | |
d2e4a39e | 3648 | struct type *func_type = SYMBOL_TYPE (func); |
14f9c5c9 | 3649 | |
1265e4aa JB |
3650 | if (SYMBOL_CLASS (func) == LOC_CONST |
3651 | && TYPE_CODE (func_type) == TYPE_CODE_ENUM) | |
14f9c5c9 AS |
3652 | return (n_actuals == 0); |
3653 | else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC) | |
3654 | return 0; | |
3655 | ||
3656 | if (TYPE_NFIELDS (func_type) != n_actuals) | |
3657 | return 0; | |
3658 | ||
3659 | for (i = 0; i < n_actuals; i += 1) | |
3660 | { | |
4c4b4cd2 | 3661 | if (actuals[i] == NULL) |
76a01679 JB |
3662 | return 0; |
3663 | else | |
3664 | { | |
5b4ee69b MS |
3665 | struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, |
3666 | i)); | |
df407dfe | 3667 | struct type *atype = ada_check_typedef (value_type (actuals[i])); |
4c4b4cd2 | 3668 | |
76a01679 JB |
3669 | if (!ada_type_match (ftype, atype, 1)) |
3670 | return 0; | |
3671 | } | |
14f9c5c9 AS |
3672 | } |
3673 | return 1; | |
3674 | } | |
3675 | ||
3676 | /* False iff function type FUNC_TYPE definitely does not produce a value | |
3677 | compatible with type CONTEXT_TYPE. Conservatively returns 1 if | |
3678 | FUNC_TYPE is not a valid function type with a non-null return type | |
3679 | or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */ | |
3680 | ||
3681 | static int | |
d2e4a39e | 3682 | return_match (struct type *func_type, struct type *context_type) |
14f9c5c9 | 3683 | { |
d2e4a39e | 3684 | struct type *return_type; |
14f9c5c9 AS |
3685 | |
3686 | if (func_type == NULL) | |
3687 | return 1; | |
3688 | ||
4c4b4cd2 | 3689 | if (TYPE_CODE (func_type) == TYPE_CODE_FUNC) |
18af8284 | 3690 | return_type = get_base_type (TYPE_TARGET_TYPE (func_type)); |
4c4b4cd2 | 3691 | else |
18af8284 | 3692 | return_type = get_base_type (func_type); |
14f9c5c9 AS |
3693 | if (return_type == NULL) |
3694 | return 1; | |
3695 | ||
18af8284 | 3696 | context_type = get_base_type (context_type); |
14f9c5c9 AS |
3697 | |
3698 | if (TYPE_CODE (return_type) == TYPE_CODE_ENUM) | |
3699 | return context_type == NULL || return_type == context_type; | |
3700 | else if (context_type == NULL) | |
3701 | return TYPE_CODE (return_type) != TYPE_CODE_VOID; | |
3702 | else | |
3703 | return TYPE_CODE (return_type) == TYPE_CODE (context_type); | |
3704 | } | |
3705 | ||
3706 | ||
4c4b4cd2 | 3707 | /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the |
14f9c5c9 | 3708 | function (if any) that matches the types of the NARGS arguments in |
4c4b4cd2 PH |
3709 | ARGS. If CONTEXT_TYPE is non-null and there is at least one match |
3710 | that returns that type, then eliminate matches that don't. If | |
3711 | CONTEXT_TYPE is void and there is at least one match that does not | |
3712 | return void, eliminate all matches that do. | |
3713 | ||
14f9c5c9 AS |
3714 | Asks the user if there is more than one match remaining. Returns -1 |
3715 | if there is no such symbol or none is selected. NAME is used | |
4c4b4cd2 PH |
3716 | solely for messages. May re-arrange and modify SYMS in |
3717 | the process; the index returned is for the modified vector. */ | |
14f9c5c9 | 3718 | |
4c4b4cd2 | 3719 | static int |
d12307c1 | 3720 | ada_resolve_function (struct block_symbol syms[], |
4c4b4cd2 PH |
3721 | int nsyms, struct value **args, int nargs, |
3722 | const char *name, struct type *context_type) | |
14f9c5c9 | 3723 | { |
30b15541 | 3724 | int fallback; |
14f9c5c9 | 3725 | int k; |
4c4b4cd2 | 3726 | int m; /* Number of hits */ |
14f9c5c9 | 3727 | |
d2e4a39e | 3728 | m = 0; |
30b15541 UW |
3729 | /* In the first pass of the loop, we only accept functions matching |
3730 | context_type. If none are found, we add a second pass of the loop | |
3731 | where every function is accepted. */ | |
3732 | for (fallback = 0; m == 0 && fallback < 2; fallback++) | |
14f9c5c9 AS |
3733 | { |
3734 | for (k = 0; k < nsyms; k += 1) | |
4c4b4cd2 | 3735 | { |
d12307c1 | 3736 | struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].symbol)); |
4c4b4cd2 | 3737 | |
d12307c1 | 3738 | if (ada_args_match (syms[k].symbol, args, nargs) |
30b15541 | 3739 | && (fallback || return_match (type, context_type))) |
4c4b4cd2 PH |
3740 | { |
3741 | syms[m] = syms[k]; | |
3742 | m += 1; | |
3743 | } | |
3744 | } | |
14f9c5c9 AS |
3745 | } |
3746 | ||
dc5c8746 PMR |
3747 | /* If we got multiple matches, ask the user which one to use. Don't do this |
3748 | interactive thing during completion, though, as the purpose of the | |
3749 | completion is providing a list of all possible matches. Prompting the | |
3750 | user to filter it down would be completely unexpected in this case. */ | |
14f9c5c9 AS |
3751 | if (m == 0) |
3752 | return -1; | |
dc5c8746 | 3753 | else if (m > 1 && !parse_completion) |
14f9c5c9 | 3754 | { |
323e0a4a | 3755 | printf_filtered (_("Multiple matches for %s\n"), name); |
4c4b4cd2 | 3756 | user_select_syms (syms, m, 1); |
14f9c5c9 AS |
3757 | return 0; |
3758 | } | |
3759 | return 0; | |
3760 | } | |
3761 | ||
4c4b4cd2 PH |
3762 | /* Returns true (non-zero) iff decoded name N0 should appear before N1 |
3763 | in a listing of choices during disambiguation (see sort_choices, below). | |
3764 | The idea is that overloadings of a subprogram name from the | |
3765 | same package should sort in their source order. We settle for ordering | |
3766 | such symbols by their trailing number (__N or $N). */ | |
3767 | ||
14f9c5c9 | 3768 | static int |
0d5cff50 | 3769 | encoded_ordered_before (const char *N0, const char *N1) |
14f9c5c9 AS |
3770 | { |
3771 | if (N1 == NULL) | |
3772 | return 0; | |
3773 | else if (N0 == NULL) | |
3774 | return 1; | |
3775 | else | |
3776 | { | |
3777 | int k0, k1; | |
5b4ee69b | 3778 | |
d2e4a39e | 3779 | for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1) |
4c4b4cd2 | 3780 | ; |
d2e4a39e | 3781 | for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1) |
4c4b4cd2 | 3782 | ; |
d2e4a39e | 3783 | if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000' |
4c4b4cd2 PH |
3784 | && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000') |
3785 | { | |
3786 | int n0, n1; | |
5b4ee69b | 3787 | |
4c4b4cd2 PH |
3788 | n0 = k0; |
3789 | while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_') | |
3790 | n0 -= 1; | |
3791 | n1 = k1; | |
3792 | while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_') | |
3793 | n1 -= 1; | |
3794 | if (n0 == n1 && strncmp (N0, N1, n0) == 0) | |
3795 | return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1)); | |
3796 | } | |
14f9c5c9 AS |
3797 | return (strcmp (N0, N1) < 0); |
3798 | } | |
3799 | } | |
d2e4a39e | 3800 | |
4c4b4cd2 PH |
3801 | /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the |
3802 | encoded names. */ | |
3803 | ||
d2e4a39e | 3804 | static void |
d12307c1 | 3805 | sort_choices (struct block_symbol syms[], int nsyms) |
14f9c5c9 | 3806 | { |
4c4b4cd2 | 3807 | int i; |
5b4ee69b | 3808 | |
d2e4a39e | 3809 | for (i = 1; i < nsyms; i += 1) |
14f9c5c9 | 3810 | { |
d12307c1 | 3811 | struct block_symbol sym = syms[i]; |
14f9c5c9 AS |
3812 | int j; |
3813 | ||
d2e4a39e | 3814 | for (j = i - 1; j >= 0; j -= 1) |
4c4b4cd2 | 3815 | { |
d12307c1 PMR |
3816 | if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].symbol), |
3817 | SYMBOL_LINKAGE_NAME (sym.symbol))) | |
4c4b4cd2 PH |
3818 | break; |
3819 | syms[j + 1] = syms[j]; | |
3820 | } | |
d2e4a39e | 3821 | syms[j + 1] = sym; |
14f9c5c9 AS |
3822 | } |
3823 | } | |
3824 | ||
d72413e6 PMR |
3825 | /* Whether GDB should display formals and return types for functions in the |
3826 | overloads selection menu. */ | |
3827 | static int print_signatures = 1; | |
3828 | ||
3829 | /* Print the signature for SYM on STREAM according to the FLAGS options. For | |
3830 | all but functions, the signature is just the name of the symbol. For | |
3831 | functions, this is the name of the function, the list of types for formals | |
3832 | and the return type (if any). */ | |
3833 | ||
3834 | static void | |
3835 | ada_print_symbol_signature (struct ui_file *stream, struct symbol *sym, | |
3836 | const struct type_print_options *flags) | |
3837 | { | |
3838 | struct type *type = SYMBOL_TYPE (sym); | |
3839 | ||
3840 | fprintf_filtered (stream, "%s", SYMBOL_PRINT_NAME (sym)); | |
3841 | if (!print_signatures | |
3842 | || type == NULL | |
3843 | || TYPE_CODE (type) != TYPE_CODE_FUNC) | |
3844 | return; | |
3845 | ||
3846 | if (TYPE_NFIELDS (type) > 0) | |
3847 | { | |
3848 | int i; | |
3849 | ||
3850 | fprintf_filtered (stream, " ("); | |
3851 | for (i = 0; i < TYPE_NFIELDS (type); ++i) | |
3852 | { | |
3853 | if (i > 0) | |
3854 | fprintf_filtered (stream, "; "); | |
3855 | ada_print_type (TYPE_FIELD_TYPE (type, i), NULL, stream, -1, 0, | |
3856 | flags); | |
3857 | } | |
3858 | fprintf_filtered (stream, ")"); | |
3859 | } | |
3860 | if (TYPE_TARGET_TYPE (type) != NULL | |
3861 | && TYPE_CODE (TYPE_TARGET_TYPE (type)) != TYPE_CODE_VOID) | |
3862 | { | |
3863 | fprintf_filtered (stream, " return "); | |
3864 | ada_print_type (TYPE_TARGET_TYPE (type), NULL, stream, -1, 0, flags); | |
3865 | } | |
3866 | } | |
3867 | ||
4c4b4cd2 PH |
3868 | /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0 |
3869 | by asking the user (if necessary), returning the number selected, | |
3870 | and setting the first elements of SYMS items. Error if no symbols | |
3871 | selected. */ | |
14f9c5c9 AS |
3872 | |
3873 | /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought | |
4c4b4cd2 | 3874 | to be re-integrated one of these days. */ |
14f9c5c9 AS |
3875 | |
3876 | int | |
d12307c1 | 3877 | user_select_syms (struct block_symbol *syms, int nsyms, int max_results) |
14f9c5c9 AS |
3878 | { |
3879 | int i; | |
8d749320 | 3880 | int *chosen = XALLOCAVEC (int , nsyms); |
14f9c5c9 AS |
3881 | int n_chosen; |
3882 | int first_choice = (max_results == 1) ? 1 : 2; | |
717d2f5a | 3883 | const char *select_mode = multiple_symbols_select_mode (); |
14f9c5c9 AS |
3884 | |
3885 | if (max_results < 1) | |
323e0a4a | 3886 | error (_("Request to select 0 symbols!")); |
14f9c5c9 AS |
3887 | if (nsyms <= 1) |
3888 | return nsyms; | |
3889 | ||
717d2f5a JB |
3890 | if (select_mode == multiple_symbols_cancel) |
3891 | error (_("\ | |
3892 | canceled because the command is ambiguous\n\ | |
3893 | See set/show multiple-symbol.")); | |
3894 | ||
3895 | /* If select_mode is "all", then return all possible symbols. | |
3896 | Only do that if more than one symbol can be selected, of course. | |
3897 | Otherwise, display the menu as usual. */ | |
3898 | if (select_mode == multiple_symbols_all && max_results > 1) | |
3899 | return nsyms; | |
3900 | ||
323e0a4a | 3901 | printf_unfiltered (_("[0] cancel\n")); |
14f9c5c9 | 3902 | if (max_results > 1) |
323e0a4a | 3903 | printf_unfiltered (_("[1] all\n")); |
14f9c5c9 | 3904 | |
4c4b4cd2 | 3905 | sort_choices (syms, nsyms); |
14f9c5c9 AS |
3906 | |
3907 | for (i = 0; i < nsyms; i += 1) | |
3908 | { | |
d12307c1 | 3909 | if (syms[i].symbol == NULL) |
4c4b4cd2 PH |
3910 | continue; |
3911 | ||
d12307c1 | 3912 | if (SYMBOL_CLASS (syms[i].symbol) == LOC_BLOCK) |
4c4b4cd2 | 3913 | { |
76a01679 | 3914 | struct symtab_and_line sal = |
d12307c1 | 3915 | find_function_start_sal (syms[i].symbol, 1); |
5b4ee69b | 3916 | |
d72413e6 PMR |
3917 | printf_unfiltered ("[%d] ", i + first_choice); |
3918 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3919 | &type_print_raw_options); | |
323e0a4a | 3920 | if (sal.symtab == NULL) |
d72413e6 | 3921 | printf_unfiltered (_(" at <no source file available>:%d\n"), |
323e0a4a AC |
3922 | sal.line); |
3923 | else | |
d72413e6 | 3924 | printf_unfiltered (_(" at %s:%d\n"), |
05cba821 JK |
3925 | symtab_to_filename_for_display (sal.symtab), |
3926 | sal.line); | |
4c4b4cd2 PH |
3927 | continue; |
3928 | } | |
d2e4a39e | 3929 | else |
4c4b4cd2 PH |
3930 | { |
3931 | int is_enumeral = | |
d12307c1 PMR |
3932 | (SYMBOL_CLASS (syms[i].symbol) == LOC_CONST |
3933 | && SYMBOL_TYPE (syms[i].symbol) != NULL | |
3934 | && TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) == TYPE_CODE_ENUM); | |
1994afbf DE |
3935 | struct symtab *symtab = NULL; |
3936 | ||
d12307c1 PMR |
3937 | if (SYMBOL_OBJFILE_OWNED (syms[i].symbol)) |
3938 | symtab = symbol_symtab (syms[i].symbol); | |
4c4b4cd2 | 3939 | |
d12307c1 | 3940 | if (SYMBOL_LINE (syms[i].symbol) != 0 && symtab != NULL) |
d72413e6 PMR |
3941 | { |
3942 | printf_unfiltered ("[%d] ", i + first_choice); | |
3943 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3944 | &type_print_raw_options); | |
3945 | printf_unfiltered (_(" at %s:%d\n"), | |
3946 | symtab_to_filename_for_display (symtab), | |
3947 | SYMBOL_LINE (syms[i].symbol)); | |
3948 | } | |
76a01679 | 3949 | else if (is_enumeral |
d12307c1 | 3950 | && TYPE_NAME (SYMBOL_TYPE (syms[i].symbol)) != NULL) |
4c4b4cd2 | 3951 | { |
a3f17187 | 3952 | printf_unfiltered (("[%d] "), i + first_choice); |
d12307c1 | 3953 | ada_print_type (SYMBOL_TYPE (syms[i].symbol), NULL, |
79d43c61 | 3954 | gdb_stdout, -1, 0, &type_print_raw_options); |
323e0a4a | 3955 | printf_unfiltered (_("'(%s) (enumeral)\n"), |
d12307c1 | 3956 | SYMBOL_PRINT_NAME (syms[i].symbol)); |
4c4b4cd2 | 3957 | } |
d72413e6 PMR |
3958 | else |
3959 | { | |
3960 | printf_unfiltered ("[%d] ", i + first_choice); | |
3961 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3962 | &type_print_raw_options); | |
3963 | ||
3964 | if (symtab != NULL) | |
3965 | printf_unfiltered (is_enumeral | |
3966 | ? _(" in %s (enumeral)\n") | |
3967 | : _(" at %s:?\n"), | |
3968 | symtab_to_filename_for_display (symtab)); | |
3969 | else | |
3970 | printf_unfiltered (is_enumeral | |
3971 | ? _(" (enumeral)\n") | |
3972 | : _(" at ?\n")); | |
3973 | } | |
4c4b4cd2 | 3974 | } |
14f9c5c9 | 3975 | } |
d2e4a39e | 3976 | |
14f9c5c9 | 3977 | n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1, |
4c4b4cd2 | 3978 | "overload-choice"); |
14f9c5c9 AS |
3979 | |
3980 | for (i = 0; i < n_chosen; i += 1) | |
4c4b4cd2 | 3981 | syms[i] = syms[chosen[i]]; |
14f9c5c9 AS |
3982 | |
3983 | return n_chosen; | |
3984 | } | |
3985 | ||
3986 | /* Read and validate a set of numeric choices from the user in the | |
4c4b4cd2 | 3987 | range 0 .. N_CHOICES-1. Place the results in increasing |
14f9c5c9 AS |
3988 | order in CHOICES[0 .. N-1], and return N. |
3989 | ||
3990 | The user types choices as a sequence of numbers on one line | |
3991 | separated by blanks, encoding them as follows: | |
3992 | ||
4c4b4cd2 | 3993 | + A choice of 0 means to cancel the selection, throwing an error. |
14f9c5c9 AS |
3994 | + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1. |
3995 | + The user chooses k by typing k+IS_ALL_CHOICE+1. | |
3996 | ||
4c4b4cd2 | 3997 | The user is not allowed to choose more than MAX_RESULTS values. |
14f9c5c9 AS |
3998 | |
3999 | ANNOTATION_SUFFIX, if present, is used to annotate the input | |
4c4b4cd2 | 4000 | prompts (for use with the -f switch). */ |
14f9c5c9 AS |
4001 | |
4002 | int | |
d2e4a39e | 4003 | get_selections (int *choices, int n_choices, int max_results, |
4c4b4cd2 | 4004 | int is_all_choice, char *annotation_suffix) |
14f9c5c9 | 4005 | { |
d2e4a39e | 4006 | char *args; |
0bcd0149 | 4007 | char *prompt; |
14f9c5c9 AS |
4008 | int n_chosen; |
4009 | int first_choice = is_all_choice ? 2 : 1; | |
d2e4a39e | 4010 | |
14f9c5c9 AS |
4011 | prompt = getenv ("PS2"); |
4012 | if (prompt == NULL) | |
0bcd0149 | 4013 | prompt = "> "; |
14f9c5c9 | 4014 | |
0bcd0149 | 4015 | args = command_line_input (prompt, 0, annotation_suffix); |
d2e4a39e | 4016 | |
14f9c5c9 | 4017 | if (args == NULL) |
323e0a4a | 4018 | error_no_arg (_("one or more choice numbers")); |
14f9c5c9 AS |
4019 | |
4020 | n_chosen = 0; | |
76a01679 | 4021 | |
4c4b4cd2 PH |
4022 | /* Set choices[0 .. n_chosen-1] to the users' choices in ascending |
4023 | order, as given in args. Choices are validated. */ | |
14f9c5c9 AS |
4024 | while (1) |
4025 | { | |
d2e4a39e | 4026 | char *args2; |
14f9c5c9 AS |
4027 | int choice, j; |
4028 | ||
0fcd72ba | 4029 | args = skip_spaces (args); |
14f9c5c9 | 4030 | if (*args == '\0' && n_chosen == 0) |
323e0a4a | 4031 | error_no_arg (_("one or more choice numbers")); |
14f9c5c9 | 4032 | else if (*args == '\0') |
4c4b4cd2 | 4033 | break; |
14f9c5c9 AS |
4034 | |
4035 | choice = strtol (args, &args2, 10); | |
d2e4a39e | 4036 | if (args == args2 || choice < 0 |
4c4b4cd2 | 4037 | || choice > n_choices + first_choice - 1) |
323e0a4a | 4038 | error (_("Argument must be choice number")); |
14f9c5c9 AS |
4039 | args = args2; |
4040 | ||
d2e4a39e | 4041 | if (choice == 0) |
323e0a4a | 4042 | error (_("cancelled")); |
14f9c5c9 AS |
4043 | |
4044 | if (choice < first_choice) | |
4c4b4cd2 PH |
4045 | { |
4046 | n_chosen = n_choices; | |
4047 | for (j = 0; j < n_choices; j += 1) | |
4048 | choices[j] = j; | |
4049 | break; | |
4050 | } | |
14f9c5c9 AS |
4051 | choice -= first_choice; |
4052 | ||
d2e4a39e | 4053 | for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1) |
4c4b4cd2 PH |
4054 | { |
4055 | } | |
14f9c5c9 AS |
4056 | |
4057 | if (j < 0 || choice != choices[j]) | |
4c4b4cd2 PH |
4058 | { |
4059 | int k; | |
5b4ee69b | 4060 | |
4c4b4cd2 PH |
4061 | for (k = n_chosen - 1; k > j; k -= 1) |
4062 | choices[k + 1] = choices[k]; | |
4063 | choices[j + 1] = choice; | |
4064 | n_chosen += 1; | |
4065 | } | |
14f9c5c9 AS |
4066 | } |
4067 | ||
4068 | if (n_chosen > max_results) | |
323e0a4a | 4069 | error (_("Select no more than %d of the above"), max_results); |
d2e4a39e | 4070 | |
14f9c5c9 AS |
4071 | return n_chosen; |
4072 | } | |
4073 | ||
4c4b4cd2 PH |
4074 | /* Replace the operator of length OPLEN at position PC in *EXPP with a call |
4075 | on the function identified by SYM and BLOCK, and taking NARGS | |
4076 | arguments. Update *EXPP as needed to hold more space. */ | |
14f9c5c9 AS |
4077 | |
4078 | static void | |
d2e4a39e | 4079 | replace_operator_with_call (struct expression **expp, int pc, int nargs, |
4c4b4cd2 | 4080 | int oplen, struct symbol *sym, |
270140bd | 4081 | const struct block *block) |
14f9c5c9 AS |
4082 | { |
4083 | /* A new expression, with 6 more elements (3 for funcall, 4 for function | |
4c4b4cd2 | 4084 | symbol, -oplen for operator being replaced). */ |
d2e4a39e | 4085 | struct expression *newexp = (struct expression *) |
8c1a34e7 | 4086 | xzalloc (sizeof (struct expression) |
4c4b4cd2 | 4087 | + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen)); |
d2e4a39e | 4088 | struct expression *exp = *expp; |
14f9c5c9 AS |
4089 | |
4090 | newexp->nelts = exp->nelts + 7 - oplen; | |
4091 | newexp->language_defn = exp->language_defn; | |
3489610d | 4092 | newexp->gdbarch = exp->gdbarch; |
14f9c5c9 | 4093 | memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc)); |
d2e4a39e | 4094 | memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen, |
4c4b4cd2 | 4095 | EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen)); |
14f9c5c9 AS |
4096 | |
4097 | newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL; | |
4098 | newexp->elts[pc + 1].longconst = (LONGEST) nargs; | |
4099 | ||
4100 | newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE; | |
4101 | newexp->elts[pc + 4].block = block; | |
4102 | newexp->elts[pc + 5].symbol = sym; | |
4103 | ||
4104 | *expp = newexp; | |
aacb1f0a | 4105 | xfree (exp); |
d2e4a39e | 4106 | } |
14f9c5c9 AS |
4107 | |
4108 | /* Type-class predicates */ | |
4109 | ||
4c4b4cd2 PH |
4110 | /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type), |
4111 | or FLOAT). */ | |
14f9c5c9 AS |
4112 | |
4113 | static int | |
d2e4a39e | 4114 | numeric_type_p (struct type *type) |
14f9c5c9 AS |
4115 | { |
4116 | if (type == NULL) | |
4117 | return 0; | |
d2e4a39e AS |
4118 | else |
4119 | { | |
4120 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4121 | { |
4122 | case TYPE_CODE_INT: | |
4123 | case TYPE_CODE_FLT: | |
4124 | return 1; | |
4125 | case TYPE_CODE_RANGE: | |
4126 | return (type == TYPE_TARGET_TYPE (type) | |
4127 | || numeric_type_p (TYPE_TARGET_TYPE (type))); | |
4128 | default: | |
4129 | return 0; | |
4130 | } | |
d2e4a39e | 4131 | } |
14f9c5c9 AS |
4132 | } |
4133 | ||
4c4b4cd2 | 4134 | /* True iff TYPE is integral (an INT or RANGE of INTs). */ |
14f9c5c9 AS |
4135 | |
4136 | static int | |
d2e4a39e | 4137 | integer_type_p (struct type *type) |
14f9c5c9 AS |
4138 | { |
4139 | if (type == NULL) | |
4140 | return 0; | |
d2e4a39e AS |
4141 | else |
4142 | { | |
4143 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4144 | { |
4145 | case TYPE_CODE_INT: | |
4146 | return 1; | |
4147 | case TYPE_CODE_RANGE: | |
4148 | return (type == TYPE_TARGET_TYPE (type) | |
4149 | || integer_type_p (TYPE_TARGET_TYPE (type))); | |
4150 | default: | |
4151 | return 0; | |
4152 | } | |
d2e4a39e | 4153 | } |
14f9c5c9 AS |
4154 | } |
4155 | ||
4c4b4cd2 | 4156 | /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */ |
14f9c5c9 AS |
4157 | |
4158 | static int | |
d2e4a39e | 4159 | scalar_type_p (struct type *type) |
14f9c5c9 AS |
4160 | { |
4161 | if (type == NULL) | |
4162 | return 0; | |
d2e4a39e AS |
4163 | else |
4164 | { | |
4165 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4166 | { |
4167 | case TYPE_CODE_INT: | |
4168 | case TYPE_CODE_RANGE: | |
4169 | case TYPE_CODE_ENUM: | |
4170 | case TYPE_CODE_FLT: | |
4171 | return 1; | |
4172 | default: | |
4173 | return 0; | |
4174 | } | |
d2e4a39e | 4175 | } |
14f9c5c9 AS |
4176 | } |
4177 | ||
4c4b4cd2 | 4178 | /* True iff TYPE is discrete (INT, RANGE, ENUM). */ |
14f9c5c9 AS |
4179 | |
4180 | static int | |
d2e4a39e | 4181 | discrete_type_p (struct type *type) |
14f9c5c9 AS |
4182 | { |
4183 | if (type == NULL) | |
4184 | return 0; | |
d2e4a39e AS |
4185 | else |
4186 | { | |
4187 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4188 | { |
4189 | case TYPE_CODE_INT: | |
4190 | case TYPE_CODE_RANGE: | |
4191 | case TYPE_CODE_ENUM: | |
872f0337 | 4192 | case TYPE_CODE_BOOL: |
4c4b4cd2 PH |
4193 | return 1; |
4194 | default: | |
4195 | return 0; | |
4196 | } | |
d2e4a39e | 4197 | } |
14f9c5c9 AS |
4198 | } |
4199 | ||
4c4b4cd2 PH |
4200 | /* Returns non-zero if OP with operands in the vector ARGS could be |
4201 | a user-defined function. Errs on the side of pre-defined operators | |
4202 | (i.e., result 0). */ | |
14f9c5c9 AS |
4203 | |
4204 | static int | |
d2e4a39e | 4205 | possible_user_operator_p (enum exp_opcode op, struct value *args[]) |
14f9c5c9 | 4206 | { |
76a01679 | 4207 | struct type *type0 = |
df407dfe | 4208 | (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0])); |
d2e4a39e | 4209 | struct type *type1 = |
df407dfe | 4210 | (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1])); |
d2e4a39e | 4211 | |
4c4b4cd2 PH |
4212 | if (type0 == NULL) |
4213 | return 0; | |
4214 | ||
14f9c5c9 AS |
4215 | switch (op) |
4216 | { | |
4217 | default: | |
4218 | return 0; | |
4219 | ||
4220 | case BINOP_ADD: | |
4221 | case BINOP_SUB: | |
4222 | case BINOP_MUL: | |
4223 | case BINOP_DIV: | |
d2e4a39e | 4224 | return (!(numeric_type_p (type0) && numeric_type_p (type1))); |
14f9c5c9 AS |
4225 | |
4226 | case BINOP_REM: | |
4227 | case BINOP_MOD: | |
4228 | case BINOP_BITWISE_AND: | |
4229 | case BINOP_BITWISE_IOR: | |
4230 | case BINOP_BITWISE_XOR: | |
d2e4a39e | 4231 | return (!(integer_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
4232 | |
4233 | case BINOP_EQUAL: | |
4234 | case BINOP_NOTEQUAL: | |
4235 | case BINOP_LESS: | |
4236 | case BINOP_GTR: | |
4237 | case BINOP_LEQ: | |
4238 | case BINOP_GEQ: | |
d2e4a39e | 4239 | return (!(scalar_type_p (type0) && scalar_type_p (type1))); |
14f9c5c9 AS |
4240 | |
4241 | case BINOP_CONCAT: | |
ee90b9ab | 4242 | return !ada_is_array_type (type0) || !ada_is_array_type (type1); |
14f9c5c9 AS |
4243 | |
4244 | case BINOP_EXP: | |
d2e4a39e | 4245 | return (!(numeric_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
4246 | |
4247 | case UNOP_NEG: | |
4248 | case UNOP_PLUS: | |
4249 | case UNOP_LOGICAL_NOT: | |
d2e4a39e AS |
4250 | case UNOP_ABS: |
4251 | return (!numeric_type_p (type0)); | |
14f9c5c9 AS |
4252 | |
4253 | } | |
4254 | } | |
4255 | \f | |
4c4b4cd2 | 4256 | /* Renaming */ |
14f9c5c9 | 4257 | |
aeb5907d JB |
4258 | /* NOTES: |
4259 | ||
4260 | 1. In the following, we assume that a renaming type's name may | |
4261 | have an ___XD suffix. It would be nice if this went away at some | |
4262 | point. | |
4263 | 2. We handle both the (old) purely type-based representation of | |
4264 | renamings and the (new) variable-based encoding. At some point, | |
4265 | it is devoutly to be hoped that the former goes away | |
4266 | (FIXME: hilfinger-2007-07-09). | |
4267 | 3. Subprogram renamings are not implemented, although the XRS | |
4268 | suffix is recognized (FIXME: hilfinger-2007-07-09). */ | |
4269 | ||
4270 | /* If SYM encodes a renaming, | |
4271 | ||
4272 | <renaming> renames <renamed entity>, | |
4273 | ||
4274 | sets *LEN to the length of the renamed entity's name, | |
4275 | *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to | |
4276 | the string describing the subcomponent selected from the renamed | |
0963b4bd | 4277 | entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming |
aeb5907d JB |
4278 | (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR |
4279 | are undefined). Otherwise, returns a value indicating the category | |
4280 | of entity renamed: an object (ADA_OBJECT_RENAMING), exception | |
4281 | (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or | |
4282 | subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the | |
4283 | strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be | |
4284 | deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR | |
4285 | may be NULL, in which case they are not assigned. | |
4286 | ||
4287 | [Currently, however, GCC does not generate subprogram renamings.] */ | |
4288 | ||
4289 | enum ada_renaming_category | |
4290 | ada_parse_renaming (struct symbol *sym, | |
4291 | const char **renamed_entity, int *len, | |
4292 | const char **renaming_expr) | |
4293 | { | |
4294 | enum ada_renaming_category kind; | |
4295 | const char *info; | |
4296 | const char *suffix; | |
4297 | ||
4298 | if (sym == NULL) | |
4299 | return ADA_NOT_RENAMING; | |
4300 | switch (SYMBOL_CLASS (sym)) | |
14f9c5c9 | 4301 | { |
aeb5907d JB |
4302 | default: |
4303 | return ADA_NOT_RENAMING; | |
4304 | case LOC_TYPEDEF: | |
4305 | return parse_old_style_renaming (SYMBOL_TYPE (sym), | |
4306 | renamed_entity, len, renaming_expr); | |
4307 | case LOC_LOCAL: | |
4308 | case LOC_STATIC: | |
4309 | case LOC_COMPUTED: | |
4310 | case LOC_OPTIMIZED_OUT: | |
4311 | info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR"); | |
4312 | if (info == NULL) | |
4313 | return ADA_NOT_RENAMING; | |
4314 | switch (info[5]) | |
4315 | { | |
4316 | case '_': | |
4317 | kind = ADA_OBJECT_RENAMING; | |
4318 | info += 6; | |
4319 | break; | |
4320 | case 'E': | |
4321 | kind = ADA_EXCEPTION_RENAMING; | |
4322 | info += 7; | |
4323 | break; | |
4324 | case 'P': | |
4325 | kind = ADA_PACKAGE_RENAMING; | |
4326 | info += 7; | |
4327 | break; | |
4328 | case 'S': | |
4329 | kind = ADA_SUBPROGRAM_RENAMING; | |
4330 | info += 7; | |
4331 | break; | |
4332 | default: | |
4333 | return ADA_NOT_RENAMING; | |
4334 | } | |
14f9c5c9 | 4335 | } |
4c4b4cd2 | 4336 | |
aeb5907d JB |
4337 | if (renamed_entity != NULL) |
4338 | *renamed_entity = info; | |
4339 | suffix = strstr (info, "___XE"); | |
4340 | if (suffix == NULL || suffix == info) | |
4341 | return ADA_NOT_RENAMING; | |
4342 | if (len != NULL) | |
4343 | *len = strlen (info) - strlen (suffix); | |
4344 | suffix += 5; | |
4345 | if (renaming_expr != NULL) | |
4346 | *renaming_expr = suffix; | |
4347 | return kind; | |
4348 | } | |
4349 | ||
4350 | /* Assuming TYPE encodes a renaming according to the old encoding in | |
4351 | exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY, | |
4352 | *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns | |
4353 | ADA_NOT_RENAMING otherwise. */ | |
4354 | static enum ada_renaming_category | |
4355 | parse_old_style_renaming (struct type *type, | |
4356 | const char **renamed_entity, int *len, | |
4357 | const char **renaming_expr) | |
4358 | { | |
4359 | enum ada_renaming_category kind; | |
4360 | const char *name; | |
4361 | const char *info; | |
4362 | const char *suffix; | |
14f9c5c9 | 4363 | |
aeb5907d JB |
4364 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM |
4365 | || TYPE_NFIELDS (type) != 1) | |
4366 | return ADA_NOT_RENAMING; | |
14f9c5c9 | 4367 | |
aeb5907d JB |
4368 | name = type_name_no_tag (type); |
4369 | if (name == NULL) | |
4370 | return ADA_NOT_RENAMING; | |
4371 | ||
4372 | name = strstr (name, "___XR"); | |
4373 | if (name == NULL) | |
4374 | return ADA_NOT_RENAMING; | |
4375 | switch (name[5]) | |
4376 | { | |
4377 | case '\0': | |
4378 | case '_': | |
4379 | kind = ADA_OBJECT_RENAMING; | |
4380 | break; | |
4381 | case 'E': | |
4382 | kind = ADA_EXCEPTION_RENAMING; | |
4383 | break; | |
4384 | case 'P': | |
4385 | kind = ADA_PACKAGE_RENAMING; | |
4386 | break; | |
4387 | case 'S': | |
4388 | kind = ADA_SUBPROGRAM_RENAMING; | |
4389 | break; | |
4390 | default: | |
4391 | return ADA_NOT_RENAMING; | |
4392 | } | |
14f9c5c9 | 4393 | |
aeb5907d JB |
4394 | info = TYPE_FIELD_NAME (type, 0); |
4395 | if (info == NULL) | |
4396 | return ADA_NOT_RENAMING; | |
4397 | if (renamed_entity != NULL) | |
4398 | *renamed_entity = info; | |
4399 | suffix = strstr (info, "___XE"); | |
4400 | if (renaming_expr != NULL) | |
4401 | *renaming_expr = suffix + 5; | |
4402 | if (suffix == NULL || suffix == info) | |
4403 | return ADA_NOT_RENAMING; | |
4404 | if (len != NULL) | |
4405 | *len = suffix - info; | |
4406 | return kind; | |
a5ee536b JB |
4407 | } |
4408 | ||
4409 | /* Compute the value of the given RENAMING_SYM, which is expected to | |
4410 | be a symbol encoding a renaming expression. BLOCK is the block | |
4411 | used to evaluate the renaming. */ | |
52ce6436 | 4412 | |
a5ee536b JB |
4413 | static struct value * |
4414 | ada_read_renaming_var_value (struct symbol *renaming_sym, | |
3977b71f | 4415 | const struct block *block) |
a5ee536b | 4416 | { |
bbc13ae3 | 4417 | const char *sym_name; |
a5ee536b JB |
4418 | struct expression *expr; |
4419 | struct value *value; | |
4420 | struct cleanup *old_chain = NULL; | |
4421 | ||
bbc13ae3 | 4422 | sym_name = SYMBOL_LINKAGE_NAME (renaming_sym); |
1bb9788d | 4423 | expr = parse_exp_1 (&sym_name, 0, block, 0); |
bbc13ae3 | 4424 | old_chain = make_cleanup (free_current_contents, &expr); |
a5ee536b JB |
4425 | value = evaluate_expression (expr); |
4426 | ||
4427 | do_cleanups (old_chain); | |
4428 | return value; | |
4429 | } | |
14f9c5c9 | 4430 | \f |
d2e4a39e | 4431 | |
4c4b4cd2 | 4432 | /* Evaluation: Function Calls */ |
14f9c5c9 | 4433 | |
4c4b4cd2 | 4434 | /* Return an lvalue containing the value VAL. This is the identity on |
40bc484c JB |
4435 | lvalues, and otherwise has the side-effect of allocating memory |
4436 | in the inferior where a copy of the value contents is copied. */ | |
14f9c5c9 | 4437 | |
d2e4a39e | 4438 | static struct value * |
40bc484c | 4439 | ensure_lval (struct value *val) |
14f9c5c9 | 4440 | { |
40bc484c JB |
4441 | if (VALUE_LVAL (val) == not_lval |
4442 | || VALUE_LVAL (val) == lval_internalvar) | |
c3e5cd34 | 4443 | { |
df407dfe | 4444 | int len = TYPE_LENGTH (ada_check_typedef (value_type (val))); |
40bc484c JB |
4445 | const CORE_ADDR addr = |
4446 | value_as_long (value_allocate_space_in_inferior (len)); | |
c3e5cd34 | 4447 | |
40bc484c | 4448 | set_value_address (val, addr); |
a84a8a0d | 4449 | VALUE_LVAL (val) = lval_memory; |
40bc484c | 4450 | write_memory (addr, value_contents (val), len); |
c3e5cd34 | 4451 | } |
14f9c5c9 AS |
4452 | |
4453 | return val; | |
4454 | } | |
4455 | ||
4456 | /* Return the value ACTUAL, converted to be an appropriate value for a | |
4457 | formal of type FORMAL_TYPE. Use *SP as a stack pointer for | |
4458 | allocating any necessary descriptors (fat pointers), or copies of | |
4c4b4cd2 | 4459 | values not residing in memory, updating it as needed. */ |
14f9c5c9 | 4460 | |
a93c0eb6 | 4461 | struct value * |
40bc484c | 4462 | ada_convert_actual (struct value *actual, struct type *formal_type0) |
14f9c5c9 | 4463 | { |
df407dfe | 4464 | struct type *actual_type = ada_check_typedef (value_type (actual)); |
61ee279c | 4465 | struct type *formal_type = ada_check_typedef (formal_type0); |
d2e4a39e AS |
4466 | struct type *formal_target = |
4467 | TYPE_CODE (formal_type) == TYPE_CODE_PTR | |
61ee279c | 4468 | ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type; |
d2e4a39e AS |
4469 | struct type *actual_target = |
4470 | TYPE_CODE (actual_type) == TYPE_CODE_PTR | |
61ee279c | 4471 | ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type; |
14f9c5c9 | 4472 | |
4c4b4cd2 | 4473 | if (ada_is_array_descriptor_type (formal_target) |
14f9c5c9 | 4474 | && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY) |
40bc484c | 4475 | return make_array_descriptor (formal_type, actual); |
a84a8a0d JB |
4476 | else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR |
4477 | || TYPE_CODE (formal_type) == TYPE_CODE_REF) | |
14f9c5c9 | 4478 | { |
a84a8a0d | 4479 | struct value *result; |
5b4ee69b | 4480 | |
14f9c5c9 | 4481 | if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY |
4c4b4cd2 | 4482 | && ada_is_array_descriptor_type (actual_target)) |
a84a8a0d | 4483 | result = desc_data (actual); |
14f9c5c9 | 4484 | else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR) |
4c4b4cd2 PH |
4485 | { |
4486 | if (VALUE_LVAL (actual) != lval_memory) | |
4487 | { | |
4488 | struct value *val; | |
5b4ee69b | 4489 | |
df407dfe | 4490 | actual_type = ada_check_typedef (value_type (actual)); |
4c4b4cd2 | 4491 | val = allocate_value (actual_type); |
990a07ab | 4492 | memcpy ((char *) value_contents_raw (val), |
0fd88904 | 4493 | (char *) value_contents (actual), |
4c4b4cd2 | 4494 | TYPE_LENGTH (actual_type)); |
40bc484c | 4495 | actual = ensure_lval (val); |
4c4b4cd2 | 4496 | } |
a84a8a0d | 4497 | result = value_addr (actual); |
4c4b4cd2 | 4498 | } |
a84a8a0d JB |
4499 | else |
4500 | return actual; | |
b1af9e97 | 4501 | return value_cast_pointers (formal_type, result, 0); |
14f9c5c9 AS |
4502 | } |
4503 | else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR) | |
4504 | return ada_value_ind (actual); | |
8344af1e JB |
4505 | else if (ada_is_aligner_type (formal_type)) |
4506 | { | |
4507 | /* We need to turn this parameter into an aligner type | |
4508 | as well. */ | |
4509 | struct value *aligner = allocate_value (formal_type); | |
4510 | struct value *component = ada_value_struct_elt (aligner, "F", 0); | |
4511 | ||
4512 | value_assign_to_component (aligner, component, actual); | |
4513 | return aligner; | |
4514 | } | |
14f9c5c9 AS |
4515 | |
4516 | return actual; | |
4517 | } | |
4518 | ||
438c98a1 JB |
4519 | /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of |
4520 | type TYPE. This is usually an inefficient no-op except on some targets | |
4521 | (such as AVR) where the representation of a pointer and an address | |
4522 | differs. */ | |
4523 | ||
4524 | static CORE_ADDR | |
4525 | value_pointer (struct value *value, struct type *type) | |
4526 | { | |
4527 | struct gdbarch *gdbarch = get_type_arch (type); | |
4528 | unsigned len = TYPE_LENGTH (type); | |
224c3ddb | 4529 | gdb_byte *buf = (gdb_byte *) alloca (len); |
438c98a1 JB |
4530 | CORE_ADDR addr; |
4531 | ||
4532 | addr = value_address (value); | |
4533 | gdbarch_address_to_pointer (gdbarch, type, buf, addr); | |
4534 | addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch)); | |
4535 | return addr; | |
4536 | } | |
4537 | ||
14f9c5c9 | 4538 | |
4c4b4cd2 PH |
4539 | /* Push a descriptor of type TYPE for array value ARR on the stack at |
4540 | *SP, updating *SP to reflect the new descriptor. Return either | |
14f9c5c9 | 4541 | an lvalue representing the new descriptor, or (if TYPE is a pointer- |
4c4b4cd2 PH |
4542 | to-descriptor type rather than a descriptor type), a struct value * |
4543 | representing a pointer to this descriptor. */ | |
14f9c5c9 | 4544 | |
d2e4a39e | 4545 | static struct value * |
40bc484c | 4546 | make_array_descriptor (struct type *type, struct value *arr) |
14f9c5c9 | 4547 | { |
d2e4a39e AS |
4548 | struct type *bounds_type = desc_bounds_type (type); |
4549 | struct type *desc_type = desc_base_type (type); | |
4550 | struct value *descriptor = allocate_value (desc_type); | |
4551 | struct value *bounds = allocate_value (bounds_type); | |
14f9c5c9 | 4552 | int i; |
d2e4a39e | 4553 | |
0963b4bd MS |
4554 | for (i = ada_array_arity (ada_check_typedef (value_type (arr))); |
4555 | i > 0; i -= 1) | |
14f9c5c9 | 4556 | { |
19f220c3 JK |
4557 | modify_field (value_type (bounds), value_contents_writeable (bounds), |
4558 | ada_array_bound (arr, i, 0), | |
4559 | desc_bound_bitpos (bounds_type, i, 0), | |
4560 | desc_bound_bitsize (bounds_type, i, 0)); | |
4561 | modify_field (value_type (bounds), value_contents_writeable (bounds), | |
4562 | ada_array_bound (arr, i, 1), | |
4563 | desc_bound_bitpos (bounds_type, i, 1), | |
4564 | desc_bound_bitsize (bounds_type, i, 1)); | |
14f9c5c9 | 4565 | } |
d2e4a39e | 4566 | |
40bc484c | 4567 | bounds = ensure_lval (bounds); |
d2e4a39e | 4568 | |
19f220c3 JK |
4569 | modify_field (value_type (descriptor), |
4570 | value_contents_writeable (descriptor), | |
4571 | value_pointer (ensure_lval (arr), | |
4572 | TYPE_FIELD_TYPE (desc_type, 0)), | |
4573 | fat_pntr_data_bitpos (desc_type), | |
4574 | fat_pntr_data_bitsize (desc_type)); | |
4575 | ||
4576 | modify_field (value_type (descriptor), | |
4577 | value_contents_writeable (descriptor), | |
4578 | value_pointer (bounds, | |
4579 | TYPE_FIELD_TYPE (desc_type, 1)), | |
4580 | fat_pntr_bounds_bitpos (desc_type), | |
4581 | fat_pntr_bounds_bitsize (desc_type)); | |
14f9c5c9 | 4582 | |
40bc484c | 4583 | descriptor = ensure_lval (descriptor); |
14f9c5c9 AS |
4584 | |
4585 | if (TYPE_CODE (type) == TYPE_CODE_PTR) | |
4586 | return value_addr (descriptor); | |
4587 | else | |
4588 | return descriptor; | |
4589 | } | |
14f9c5c9 | 4590 | \f |
3d9434b5 JB |
4591 | /* Symbol Cache Module */ |
4592 | ||
3d9434b5 | 4593 | /* Performance measurements made as of 2010-01-15 indicate that |
ee01b665 | 4594 | this cache does bring some noticeable improvements. Depending |
3d9434b5 JB |
4595 | on the type of entity being printed, the cache can make it as much |
4596 | as an order of magnitude faster than without it. | |
4597 | ||
4598 | The descriptive type DWARF extension has significantly reduced | |
4599 | the need for this cache, at least when DWARF is being used. However, | |
4600 | even in this case, some expensive name-based symbol searches are still | |
4601 | sometimes necessary - to find an XVZ variable, mostly. */ | |
4602 | ||
ee01b665 | 4603 | /* Initialize the contents of SYM_CACHE. */ |
3d9434b5 | 4604 | |
ee01b665 JB |
4605 | static void |
4606 | ada_init_symbol_cache (struct ada_symbol_cache *sym_cache) | |
4607 | { | |
4608 | obstack_init (&sym_cache->cache_space); | |
4609 | memset (sym_cache->root, '\000', sizeof (sym_cache->root)); | |
4610 | } | |
3d9434b5 | 4611 | |
ee01b665 JB |
4612 | /* Free the memory used by SYM_CACHE. */ |
4613 | ||
4614 | static void | |
4615 | ada_free_symbol_cache (struct ada_symbol_cache *sym_cache) | |
3d9434b5 | 4616 | { |
ee01b665 JB |
4617 | obstack_free (&sym_cache->cache_space, NULL); |
4618 | xfree (sym_cache); | |
4619 | } | |
3d9434b5 | 4620 | |
ee01b665 JB |
4621 | /* Return the symbol cache associated to the given program space PSPACE. |
4622 | If not allocated for this PSPACE yet, allocate and initialize one. */ | |
3d9434b5 | 4623 | |
ee01b665 JB |
4624 | static struct ada_symbol_cache * |
4625 | ada_get_symbol_cache (struct program_space *pspace) | |
4626 | { | |
4627 | struct ada_pspace_data *pspace_data = get_ada_pspace_data (pspace); | |
ee01b665 | 4628 | |
66c168ae | 4629 | if (pspace_data->sym_cache == NULL) |
ee01b665 | 4630 | { |
66c168ae JB |
4631 | pspace_data->sym_cache = XCNEW (struct ada_symbol_cache); |
4632 | ada_init_symbol_cache (pspace_data->sym_cache); | |
ee01b665 JB |
4633 | } |
4634 | ||
66c168ae | 4635 | return pspace_data->sym_cache; |
ee01b665 | 4636 | } |
3d9434b5 JB |
4637 | |
4638 | /* Clear all entries from the symbol cache. */ | |
4639 | ||
4640 | static void | |
4641 | ada_clear_symbol_cache (void) | |
4642 | { | |
ee01b665 JB |
4643 | struct ada_symbol_cache *sym_cache |
4644 | = ada_get_symbol_cache (current_program_space); | |
4645 | ||
4646 | obstack_free (&sym_cache->cache_space, NULL); | |
4647 | ada_init_symbol_cache (sym_cache); | |
3d9434b5 JB |
4648 | } |
4649 | ||
fe978cb0 | 4650 | /* Search our cache for an entry matching NAME and DOMAIN. |
3d9434b5 JB |
4651 | Return it if found, or NULL otherwise. */ |
4652 | ||
4653 | static struct cache_entry ** | |
fe978cb0 | 4654 | find_entry (const char *name, domain_enum domain) |
3d9434b5 | 4655 | { |
ee01b665 JB |
4656 | struct ada_symbol_cache *sym_cache |
4657 | = ada_get_symbol_cache (current_program_space); | |
3d9434b5 JB |
4658 | int h = msymbol_hash (name) % HASH_SIZE; |
4659 | struct cache_entry **e; | |
4660 | ||
ee01b665 | 4661 | for (e = &sym_cache->root[h]; *e != NULL; e = &(*e)->next) |
3d9434b5 | 4662 | { |
fe978cb0 | 4663 | if (domain == (*e)->domain && strcmp (name, (*e)->name) == 0) |
3d9434b5 JB |
4664 | return e; |
4665 | } | |
4666 | return NULL; | |
4667 | } | |
4668 | ||
fe978cb0 | 4669 | /* Search the symbol cache for an entry matching NAME and DOMAIN. |
3d9434b5 JB |
4670 | Return 1 if found, 0 otherwise. |
4671 | ||
4672 | If an entry was found and SYM is not NULL, set *SYM to the entry's | |
4673 | SYM. Same principle for BLOCK if not NULL. */ | |
96d887e8 | 4674 | |
96d887e8 | 4675 | static int |
fe978cb0 | 4676 | lookup_cached_symbol (const char *name, domain_enum domain, |
f0c5f9b2 | 4677 | struct symbol **sym, const struct block **block) |
96d887e8 | 4678 | { |
fe978cb0 | 4679 | struct cache_entry **e = find_entry (name, domain); |
3d9434b5 JB |
4680 | |
4681 | if (e == NULL) | |
4682 | return 0; | |
4683 | if (sym != NULL) | |
4684 | *sym = (*e)->sym; | |
4685 | if (block != NULL) | |
4686 | *block = (*e)->block; | |
4687 | return 1; | |
96d887e8 PH |
4688 | } |
4689 | ||
3d9434b5 | 4690 | /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME |
fe978cb0 | 4691 | in domain DOMAIN, save this result in our symbol cache. */ |
3d9434b5 | 4692 | |
96d887e8 | 4693 | static void |
fe978cb0 | 4694 | cache_symbol (const char *name, domain_enum domain, struct symbol *sym, |
270140bd | 4695 | const struct block *block) |
96d887e8 | 4696 | { |
ee01b665 JB |
4697 | struct ada_symbol_cache *sym_cache |
4698 | = ada_get_symbol_cache (current_program_space); | |
3d9434b5 JB |
4699 | int h; |
4700 | char *copy; | |
4701 | struct cache_entry *e; | |
4702 | ||
1994afbf DE |
4703 | /* Symbols for builtin types don't have a block. |
4704 | For now don't cache such symbols. */ | |
4705 | if (sym != NULL && !SYMBOL_OBJFILE_OWNED (sym)) | |
4706 | return; | |
4707 | ||
3d9434b5 JB |
4708 | /* If the symbol is a local symbol, then do not cache it, as a search |
4709 | for that symbol depends on the context. To determine whether | |
4710 | the symbol is local or not, we check the block where we found it | |
4711 | against the global and static blocks of its associated symtab. */ | |
4712 | if (sym | |
08be3fe3 | 4713 | && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)), |
439247b6 | 4714 | GLOBAL_BLOCK) != block |
08be3fe3 | 4715 | && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)), |
439247b6 | 4716 | STATIC_BLOCK) != block) |
3d9434b5 JB |
4717 | return; |
4718 | ||
4719 | h = msymbol_hash (name) % HASH_SIZE; | |
ee01b665 JB |
4720 | e = (struct cache_entry *) obstack_alloc (&sym_cache->cache_space, |
4721 | sizeof (*e)); | |
4722 | e->next = sym_cache->root[h]; | |
4723 | sym_cache->root[h] = e; | |
224c3ddb SM |
4724 | e->name = copy |
4725 | = (char *) obstack_alloc (&sym_cache->cache_space, strlen (name) + 1); | |
3d9434b5 JB |
4726 | strcpy (copy, name); |
4727 | e->sym = sym; | |
fe978cb0 | 4728 | e->domain = domain; |
3d9434b5 | 4729 | e->block = block; |
96d887e8 | 4730 | } |
4c4b4cd2 PH |
4731 | \f |
4732 | /* Symbol Lookup */ | |
4733 | ||
c0431670 JB |
4734 | /* Return nonzero if wild matching should be used when searching for |
4735 | all symbols matching LOOKUP_NAME. | |
4736 | ||
4737 | LOOKUP_NAME is expected to be a symbol name after transformation | |
4738 | for Ada lookups (see ada_name_for_lookup). */ | |
4739 | ||
4740 | static int | |
4741 | should_use_wild_match (const char *lookup_name) | |
4742 | { | |
4743 | return (strstr (lookup_name, "__") == NULL); | |
4744 | } | |
4745 | ||
4c4b4cd2 PH |
4746 | /* Return the result of a standard (literal, C-like) lookup of NAME in |
4747 | given DOMAIN, visible from lexical block BLOCK. */ | |
4748 | ||
4749 | static struct symbol * | |
4750 | standard_lookup (const char *name, const struct block *block, | |
4751 | domain_enum domain) | |
4752 | { | |
acbd605d | 4753 | /* Initialize it just to avoid a GCC false warning. */ |
d12307c1 | 4754 | struct block_symbol sym = {NULL, NULL}; |
4c4b4cd2 | 4755 | |
d12307c1 PMR |
4756 | if (lookup_cached_symbol (name, domain, &sym.symbol, NULL)) |
4757 | return sym.symbol; | |
2570f2b7 | 4758 | sym = lookup_symbol_in_language (name, block, domain, language_c, 0); |
d12307c1 PMR |
4759 | cache_symbol (name, domain, sym.symbol, sym.block); |
4760 | return sym.symbol; | |
4c4b4cd2 PH |
4761 | } |
4762 | ||
4763 | ||
4764 | /* Non-zero iff there is at least one non-function/non-enumeral symbol | |
4765 | in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions, | |
4766 | since they contend in overloading in the same way. */ | |
4767 | static int | |
d12307c1 | 4768 | is_nonfunction (struct block_symbol syms[], int n) |
4c4b4cd2 PH |
4769 | { |
4770 | int i; | |
4771 | ||
4772 | for (i = 0; i < n; i += 1) | |
d12307c1 PMR |
4773 | if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_FUNC |
4774 | && (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM | |
4775 | || SYMBOL_CLASS (syms[i].symbol) != LOC_CONST)) | |
14f9c5c9 AS |
4776 | return 1; |
4777 | ||
4778 | return 0; | |
4779 | } | |
4780 | ||
4781 | /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent | |
4c4b4cd2 | 4782 | struct types. Otherwise, they may not. */ |
14f9c5c9 AS |
4783 | |
4784 | static int | |
d2e4a39e | 4785 | equiv_types (struct type *type0, struct type *type1) |
14f9c5c9 | 4786 | { |
d2e4a39e | 4787 | if (type0 == type1) |
14f9c5c9 | 4788 | return 1; |
d2e4a39e | 4789 | if (type0 == NULL || type1 == NULL |
14f9c5c9 AS |
4790 | || TYPE_CODE (type0) != TYPE_CODE (type1)) |
4791 | return 0; | |
d2e4a39e | 4792 | if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT |
14f9c5c9 AS |
4793 | || TYPE_CODE (type0) == TYPE_CODE_ENUM) |
4794 | && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL | |
4c4b4cd2 | 4795 | && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0) |
14f9c5c9 | 4796 | return 1; |
d2e4a39e | 4797 | |
14f9c5c9 AS |
4798 | return 0; |
4799 | } | |
4800 | ||
4801 | /* True iff SYM0 represents the same entity as SYM1, or one that is | |
4c4b4cd2 | 4802 | no more defined than that of SYM1. */ |
14f9c5c9 AS |
4803 | |
4804 | static int | |
d2e4a39e | 4805 | lesseq_defined_than (struct symbol *sym0, struct symbol *sym1) |
14f9c5c9 AS |
4806 | { |
4807 | if (sym0 == sym1) | |
4808 | return 1; | |
176620f1 | 4809 | if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1) |
14f9c5c9 AS |
4810 | || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1)) |
4811 | return 0; | |
4812 | ||
d2e4a39e | 4813 | switch (SYMBOL_CLASS (sym0)) |
14f9c5c9 AS |
4814 | { |
4815 | case LOC_UNDEF: | |
4816 | return 1; | |
4817 | case LOC_TYPEDEF: | |
4818 | { | |
4c4b4cd2 PH |
4819 | struct type *type0 = SYMBOL_TYPE (sym0); |
4820 | struct type *type1 = SYMBOL_TYPE (sym1); | |
0d5cff50 DE |
4821 | const char *name0 = SYMBOL_LINKAGE_NAME (sym0); |
4822 | const char *name1 = SYMBOL_LINKAGE_NAME (sym1); | |
4c4b4cd2 | 4823 | int len0 = strlen (name0); |
5b4ee69b | 4824 | |
4c4b4cd2 PH |
4825 | return |
4826 | TYPE_CODE (type0) == TYPE_CODE (type1) | |
4827 | && (equiv_types (type0, type1) | |
4828 | || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0 | |
61012eef | 4829 | && startswith (name1 + len0, "___XV"))); |
14f9c5c9 AS |
4830 | } |
4831 | case LOC_CONST: | |
4832 | return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1) | |
4c4b4cd2 | 4833 | && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1)); |
d2e4a39e AS |
4834 | default: |
4835 | return 0; | |
14f9c5c9 AS |
4836 | } |
4837 | } | |
4838 | ||
d12307c1 | 4839 | /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol |
4c4b4cd2 | 4840 | records in OBSTACKP. Do nothing if SYM is a duplicate. */ |
14f9c5c9 AS |
4841 | |
4842 | static void | |
76a01679 JB |
4843 | add_defn_to_vec (struct obstack *obstackp, |
4844 | struct symbol *sym, | |
f0c5f9b2 | 4845 | const struct block *block) |
14f9c5c9 AS |
4846 | { |
4847 | int i; | |
d12307c1 | 4848 | struct block_symbol *prevDefns = defns_collected (obstackp, 0); |
14f9c5c9 | 4849 | |
529cad9c PH |
4850 | /* Do not try to complete stub types, as the debugger is probably |
4851 | already scanning all symbols matching a certain name at the | |
4852 | time when this function is called. Trying to replace the stub | |
4853 | type by its associated full type will cause us to restart a scan | |
4854 | which may lead to an infinite recursion. Instead, the client | |
4855 | collecting the matching symbols will end up collecting several | |
4856 | matches, with at least one of them complete. It can then filter | |
4857 | out the stub ones if needed. */ | |
4858 | ||
4c4b4cd2 PH |
4859 | for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1) |
4860 | { | |
d12307c1 | 4861 | if (lesseq_defined_than (sym, prevDefns[i].symbol)) |
4c4b4cd2 | 4862 | return; |
d12307c1 | 4863 | else if (lesseq_defined_than (prevDefns[i].symbol, sym)) |
4c4b4cd2 | 4864 | { |
d12307c1 | 4865 | prevDefns[i].symbol = sym; |
4c4b4cd2 | 4866 | prevDefns[i].block = block; |
4c4b4cd2 | 4867 | return; |
76a01679 | 4868 | } |
4c4b4cd2 PH |
4869 | } |
4870 | ||
4871 | { | |
d12307c1 | 4872 | struct block_symbol info; |
4c4b4cd2 | 4873 | |
d12307c1 | 4874 | info.symbol = sym; |
4c4b4cd2 | 4875 | info.block = block; |
d12307c1 | 4876 | obstack_grow (obstackp, &info, sizeof (struct block_symbol)); |
4c4b4cd2 PH |
4877 | } |
4878 | } | |
4879 | ||
d12307c1 PMR |
4880 | /* Number of block_symbol structures currently collected in current vector in |
4881 | OBSTACKP. */ | |
4c4b4cd2 | 4882 | |
76a01679 JB |
4883 | static int |
4884 | num_defns_collected (struct obstack *obstackp) | |
4c4b4cd2 | 4885 | { |
d12307c1 | 4886 | return obstack_object_size (obstackp) / sizeof (struct block_symbol); |
4c4b4cd2 PH |
4887 | } |
4888 | ||
d12307c1 PMR |
4889 | /* Vector of block_symbol structures currently collected in current vector in |
4890 | OBSTACKP. If FINISH, close off the vector and return its final address. */ | |
4c4b4cd2 | 4891 | |
d12307c1 | 4892 | static struct block_symbol * |
4c4b4cd2 PH |
4893 | defns_collected (struct obstack *obstackp, int finish) |
4894 | { | |
4895 | if (finish) | |
224c3ddb | 4896 | return (struct block_symbol *) obstack_finish (obstackp); |
4c4b4cd2 | 4897 | else |
d12307c1 | 4898 | return (struct block_symbol *) obstack_base (obstackp); |
4c4b4cd2 PH |
4899 | } |
4900 | ||
7c7b6655 TT |
4901 | /* Return a bound minimal symbol matching NAME according to Ada |
4902 | decoding rules. Returns an invalid symbol if there is no such | |
4903 | minimal symbol. Names prefixed with "standard__" are handled | |
4904 | specially: "standard__" is first stripped off, and only static and | |
4905 | global symbols are searched. */ | |
4c4b4cd2 | 4906 | |
7c7b6655 | 4907 | struct bound_minimal_symbol |
96d887e8 | 4908 | ada_lookup_simple_minsym (const char *name) |
4c4b4cd2 | 4909 | { |
7c7b6655 | 4910 | struct bound_minimal_symbol result; |
4c4b4cd2 | 4911 | struct objfile *objfile; |
96d887e8 | 4912 | struct minimal_symbol *msymbol; |
dc4024cd | 4913 | const int wild_match_p = should_use_wild_match (name); |
4c4b4cd2 | 4914 | |
7c7b6655 TT |
4915 | memset (&result, 0, sizeof (result)); |
4916 | ||
c0431670 JB |
4917 | /* Special case: If the user specifies a symbol name inside package |
4918 | Standard, do a non-wild matching of the symbol name without | |
4919 | the "standard__" prefix. This was primarily introduced in order | |
4920 | to allow the user to specifically access the standard exceptions | |
4921 | using, for instance, Standard.Constraint_Error when Constraint_Error | |
4922 | is ambiguous (due to the user defining its own Constraint_Error | |
4923 | entity inside its program). */ | |
61012eef | 4924 | if (startswith (name, "standard__")) |
c0431670 | 4925 | name += sizeof ("standard__") - 1; |
4c4b4cd2 | 4926 | |
96d887e8 PH |
4927 | ALL_MSYMBOLS (objfile, msymbol) |
4928 | { | |
efd66ac6 | 4929 | if (match_name (MSYMBOL_LINKAGE_NAME (msymbol), name, wild_match_p) |
96d887e8 | 4930 | && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline) |
7c7b6655 TT |
4931 | { |
4932 | result.minsym = msymbol; | |
4933 | result.objfile = objfile; | |
4934 | break; | |
4935 | } | |
96d887e8 | 4936 | } |
4c4b4cd2 | 4937 | |
7c7b6655 | 4938 | return result; |
96d887e8 | 4939 | } |
4c4b4cd2 | 4940 | |
96d887e8 PH |
4941 | /* For all subprograms that statically enclose the subprogram of the |
4942 | selected frame, add symbols matching identifier NAME in DOMAIN | |
4943 | and their blocks to the list of data in OBSTACKP, as for | |
48b78332 JB |
4944 | ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME |
4945 | with a wildcard prefix. */ | |
4c4b4cd2 | 4946 | |
96d887e8 PH |
4947 | static void |
4948 | add_symbols_from_enclosing_procs (struct obstack *obstackp, | |
fe978cb0 | 4949 | const char *name, domain_enum domain, |
48b78332 | 4950 | int wild_match_p) |
96d887e8 | 4951 | { |
96d887e8 | 4952 | } |
14f9c5c9 | 4953 | |
96d887e8 PH |
4954 | /* True if TYPE is definitely an artificial type supplied to a symbol |
4955 | for which no debugging information was given in the symbol file. */ | |
14f9c5c9 | 4956 | |
96d887e8 PH |
4957 | static int |
4958 | is_nondebugging_type (struct type *type) | |
4959 | { | |
0d5cff50 | 4960 | const char *name = ada_type_name (type); |
5b4ee69b | 4961 | |
96d887e8 PH |
4962 | return (name != NULL && strcmp (name, "<variable, no debug info>") == 0); |
4963 | } | |
4c4b4cd2 | 4964 | |
8f17729f JB |
4965 | /* Return nonzero if TYPE1 and TYPE2 are two enumeration types |
4966 | that are deemed "identical" for practical purposes. | |
4967 | ||
4968 | This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM | |
4969 | types and that their number of enumerals is identical (in other | |
4970 | words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */ | |
4971 | ||
4972 | static int | |
4973 | ada_identical_enum_types_p (struct type *type1, struct type *type2) | |
4974 | { | |
4975 | int i; | |
4976 | ||
4977 | /* The heuristic we use here is fairly conservative. We consider | |
4978 | that 2 enumerate types are identical if they have the same | |
4979 | number of enumerals and that all enumerals have the same | |
4980 | underlying value and name. */ | |
4981 | ||
4982 | /* All enums in the type should have an identical underlying value. */ | |
4983 | for (i = 0; i < TYPE_NFIELDS (type1); i++) | |
14e75d8e | 4984 | if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i)) |
8f17729f JB |
4985 | return 0; |
4986 | ||
4987 | /* All enumerals should also have the same name (modulo any numerical | |
4988 | suffix). */ | |
4989 | for (i = 0; i < TYPE_NFIELDS (type1); i++) | |
4990 | { | |
0d5cff50 DE |
4991 | const char *name_1 = TYPE_FIELD_NAME (type1, i); |
4992 | const char *name_2 = TYPE_FIELD_NAME (type2, i); | |
8f17729f JB |
4993 | int len_1 = strlen (name_1); |
4994 | int len_2 = strlen (name_2); | |
4995 | ||
4996 | ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1); | |
4997 | ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2); | |
4998 | if (len_1 != len_2 | |
4999 | || strncmp (TYPE_FIELD_NAME (type1, i), | |
5000 | TYPE_FIELD_NAME (type2, i), | |
5001 | len_1) != 0) | |
5002 | return 0; | |
5003 | } | |
5004 | ||
5005 | return 1; | |
5006 | } | |
5007 | ||
5008 | /* Return nonzero if all the symbols in SYMS are all enumeral symbols | |
5009 | that are deemed "identical" for practical purposes. Sometimes, | |
5010 | enumerals are not strictly identical, but their types are so similar | |
5011 | that they can be considered identical. | |
5012 | ||
5013 | For instance, consider the following code: | |
5014 | ||
5015 | type Color is (Black, Red, Green, Blue, White); | |
5016 | type RGB_Color is new Color range Red .. Blue; | |
5017 | ||
5018 | Type RGB_Color is a subrange of an implicit type which is a copy | |
5019 | of type Color. If we call that implicit type RGB_ColorB ("B" is | |
5020 | for "Base Type"), then type RGB_ColorB is a copy of type Color. | |
5021 | As a result, when an expression references any of the enumeral | |
5022 | by name (Eg. "print green"), the expression is technically | |
5023 | ambiguous and the user should be asked to disambiguate. But | |
5024 | doing so would only hinder the user, since it wouldn't matter | |
5025 | what choice he makes, the outcome would always be the same. | |
5026 | So, for practical purposes, we consider them as the same. */ | |
5027 | ||
5028 | static int | |
d12307c1 | 5029 | symbols_are_identical_enums (struct block_symbol *syms, int nsyms) |
8f17729f JB |
5030 | { |
5031 | int i; | |
5032 | ||
5033 | /* Before performing a thorough comparison check of each type, | |
5034 | we perform a series of inexpensive checks. We expect that these | |
5035 | checks will quickly fail in the vast majority of cases, and thus | |
5036 | help prevent the unnecessary use of a more expensive comparison. | |
5037 | Said comparison also expects us to make some of these checks | |
5038 | (see ada_identical_enum_types_p). */ | |
5039 | ||
5040 | /* Quick check: All symbols should have an enum type. */ | |
5041 | for (i = 0; i < nsyms; i++) | |
d12307c1 | 5042 | if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM) |
8f17729f JB |
5043 | return 0; |
5044 | ||
5045 | /* Quick check: They should all have the same value. */ | |
5046 | for (i = 1; i < nsyms; i++) | |
d12307c1 | 5047 | if (SYMBOL_VALUE (syms[i].symbol) != SYMBOL_VALUE (syms[0].symbol)) |
8f17729f JB |
5048 | return 0; |
5049 | ||
5050 | /* Quick check: They should all have the same number of enumerals. */ | |
5051 | for (i = 1; i < nsyms; i++) | |
d12307c1 PMR |
5052 | if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].symbol)) |
5053 | != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].symbol))) | |
8f17729f JB |
5054 | return 0; |
5055 | ||
5056 | /* All the sanity checks passed, so we might have a set of | |
5057 | identical enumeration types. Perform a more complete | |
5058 | comparison of the type of each symbol. */ | |
5059 | for (i = 1; i < nsyms; i++) | |
d12307c1 PMR |
5060 | if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].symbol), |
5061 | SYMBOL_TYPE (syms[0].symbol))) | |
8f17729f JB |
5062 | return 0; |
5063 | ||
5064 | return 1; | |
5065 | } | |
5066 | ||
96d887e8 PH |
5067 | /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely |
5068 | duplicate other symbols in the list (The only case I know of where | |
5069 | this happens is when object files containing stabs-in-ecoff are | |
5070 | linked with files containing ordinary ecoff debugging symbols (or no | |
5071 | debugging symbols)). Modifies SYMS to squeeze out deleted entries. | |
5072 | Returns the number of items in the modified list. */ | |
4c4b4cd2 | 5073 | |
96d887e8 | 5074 | static int |
d12307c1 | 5075 | remove_extra_symbols (struct block_symbol *syms, int nsyms) |
96d887e8 PH |
5076 | { |
5077 | int i, j; | |
4c4b4cd2 | 5078 | |
8f17729f JB |
5079 | /* We should never be called with less than 2 symbols, as there |
5080 | cannot be any extra symbol in that case. But it's easy to | |
5081 | handle, since we have nothing to do in that case. */ | |
5082 | if (nsyms < 2) | |
5083 | return nsyms; | |
5084 | ||
96d887e8 PH |
5085 | i = 0; |
5086 | while (i < nsyms) | |
5087 | { | |
a35ddb44 | 5088 | int remove_p = 0; |
339c13b6 JB |
5089 | |
5090 | /* If two symbols have the same name and one of them is a stub type, | |
5091 | the get rid of the stub. */ | |
5092 | ||
d12307c1 PMR |
5093 | if (TYPE_STUB (SYMBOL_TYPE (syms[i].symbol)) |
5094 | && SYMBOL_LINKAGE_NAME (syms[i].symbol) != NULL) | |
339c13b6 JB |
5095 | { |
5096 | for (j = 0; j < nsyms; j++) | |
5097 | { | |
5098 | if (j != i | |
d12307c1 PMR |
5099 | && !TYPE_STUB (SYMBOL_TYPE (syms[j].symbol)) |
5100 | && SYMBOL_LINKAGE_NAME (syms[j].symbol) != NULL | |
5101 | && strcmp (SYMBOL_LINKAGE_NAME (syms[i].symbol), | |
5102 | SYMBOL_LINKAGE_NAME (syms[j].symbol)) == 0) | |
a35ddb44 | 5103 | remove_p = 1; |
339c13b6 JB |
5104 | } |
5105 | } | |
5106 | ||
5107 | /* Two symbols with the same name, same class and same address | |
5108 | should be identical. */ | |
5109 | ||
d12307c1 PMR |
5110 | else if (SYMBOL_LINKAGE_NAME (syms[i].symbol) != NULL |
5111 | && SYMBOL_CLASS (syms[i].symbol) == LOC_STATIC | |
5112 | && is_nondebugging_type (SYMBOL_TYPE (syms[i].symbol))) | |
96d887e8 PH |
5113 | { |
5114 | for (j = 0; j < nsyms; j += 1) | |
5115 | { | |
5116 | if (i != j | |
d12307c1 PMR |
5117 | && SYMBOL_LINKAGE_NAME (syms[j].symbol) != NULL |
5118 | && strcmp (SYMBOL_LINKAGE_NAME (syms[i].symbol), | |
5119 | SYMBOL_LINKAGE_NAME (syms[j].symbol)) == 0 | |
5120 | && SYMBOL_CLASS (syms[i].symbol) | |
5121 | == SYMBOL_CLASS (syms[j].symbol) | |
5122 | && SYMBOL_VALUE_ADDRESS (syms[i].symbol) | |
5123 | == SYMBOL_VALUE_ADDRESS (syms[j].symbol)) | |
a35ddb44 | 5124 | remove_p = 1; |
4c4b4cd2 | 5125 | } |
4c4b4cd2 | 5126 | } |
339c13b6 | 5127 | |
a35ddb44 | 5128 | if (remove_p) |
339c13b6 JB |
5129 | { |
5130 | for (j = i + 1; j < nsyms; j += 1) | |
5131 | syms[j - 1] = syms[j]; | |
5132 | nsyms -= 1; | |
5133 | } | |
5134 | ||
96d887e8 | 5135 | i += 1; |
14f9c5c9 | 5136 | } |
8f17729f JB |
5137 | |
5138 | /* If all the remaining symbols are identical enumerals, then | |
5139 | just keep the first one and discard the rest. | |
5140 | ||
5141 | Unlike what we did previously, we do not discard any entry | |
5142 | unless they are ALL identical. This is because the symbol | |
5143 | comparison is not a strict comparison, but rather a practical | |
5144 | comparison. If all symbols are considered identical, then | |
5145 | we can just go ahead and use the first one and discard the rest. | |
5146 | But if we cannot reduce the list to a single element, we have | |
5147 | to ask the user to disambiguate anyways. And if we have to | |
5148 | present a multiple-choice menu, it's less confusing if the list | |
5149 | isn't missing some choices that were identical and yet distinct. */ | |
5150 | if (symbols_are_identical_enums (syms, nsyms)) | |
5151 | nsyms = 1; | |
5152 | ||
96d887e8 | 5153 | return nsyms; |
14f9c5c9 AS |
5154 | } |
5155 | ||
96d887e8 PH |
5156 | /* Given a type that corresponds to a renaming entity, use the type name |
5157 | to extract the scope (package name or function name, fully qualified, | |
5158 | and following the GNAT encoding convention) where this renaming has been | |
5159 | defined. The string returned needs to be deallocated after use. */ | |
4c4b4cd2 | 5160 | |
96d887e8 PH |
5161 | static char * |
5162 | xget_renaming_scope (struct type *renaming_type) | |
14f9c5c9 | 5163 | { |
96d887e8 | 5164 | /* The renaming types adhere to the following convention: |
0963b4bd | 5165 | <scope>__<rename>___<XR extension>. |
96d887e8 PH |
5166 | So, to extract the scope, we search for the "___XR" extension, |
5167 | and then backtrack until we find the first "__". */ | |
76a01679 | 5168 | |
96d887e8 | 5169 | const char *name = type_name_no_tag (renaming_type); |
108d56a4 SM |
5170 | const char *suffix = strstr (name, "___XR"); |
5171 | const char *last; | |
96d887e8 PH |
5172 | int scope_len; |
5173 | char *scope; | |
14f9c5c9 | 5174 | |
96d887e8 PH |
5175 | /* Now, backtrack a bit until we find the first "__". Start looking |
5176 | at suffix - 3, as the <rename> part is at least one character long. */ | |
14f9c5c9 | 5177 | |
96d887e8 PH |
5178 | for (last = suffix - 3; last > name; last--) |
5179 | if (last[0] == '_' && last[1] == '_') | |
5180 | break; | |
76a01679 | 5181 | |
96d887e8 | 5182 | /* Make a copy of scope and return it. */ |
14f9c5c9 | 5183 | |
96d887e8 PH |
5184 | scope_len = last - name; |
5185 | scope = (char *) xmalloc ((scope_len + 1) * sizeof (char)); | |
14f9c5c9 | 5186 | |
96d887e8 PH |
5187 | strncpy (scope, name, scope_len); |
5188 | scope[scope_len] = '\0'; | |
4c4b4cd2 | 5189 | |
96d887e8 | 5190 | return scope; |
4c4b4cd2 PH |
5191 | } |
5192 | ||
96d887e8 | 5193 | /* Return nonzero if NAME corresponds to a package name. */ |
4c4b4cd2 | 5194 | |
96d887e8 PH |
5195 | static int |
5196 | is_package_name (const char *name) | |
4c4b4cd2 | 5197 | { |
96d887e8 PH |
5198 | /* Here, We take advantage of the fact that no symbols are generated |
5199 | for packages, while symbols are generated for each function. | |
5200 | So the condition for NAME represent a package becomes equivalent | |
5201 | to NAME not existing in our list of symbols. There is only one | |
5202 | small complication with library-level functions (see below). */ | |
4c4b4cd2 | 5203 | |
96d887e8 | 5204 | char *fun_name; |
76a01679 | 5205 | |
96d887e8 PH |
5206 | /* If it is a function that has not been defined at library level, |
5207 | then we should be able to look it up in the symbols. */ | |
5208 | if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL) | |
5209 | return 0; | |
14f9c5c9 | 5210 | |
96d887e8 PH |
5211 | /* Library-level function names start with "_ada_". See if function |
5212 | "_ada_" followed by NAME can be found. */ | |
14f9c5c9 | 5213 | |
96d887e8 | 5214 | /* Do a quick check that NAME does not contain "__", since library-level |
e1d5a0d2 | 5215 | functions names cannot contain "__" in them. */ |
96d887e8 PH |
5216 | if (strstr (name, "__") != NULL) |
5217 | return 0; | |
4c4b4cd2 | 5218 | |
b435e160 | 5219 | fun_name = xstrprintf ("_ada_%s", name); |
14f9c5c9 | 5220 | |
96d887e8 PH |
5221 | return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL); |
5222 | } | |
14f9c5c9 | 5223 | |
96d887e8 | 5224 | /* Return nonzero if SYM corresponds to a renaming entity that is |
aeb5907d | 5225 | not visible from FUNCTION_NAME. */ |
14f9c5c9 | 5226 | |
96d887e8 | 5227 | static int |
0d5cff50 | 5228 | old_renaming_is_invisible (const struct symbol *sym, const char *function_name) |
96d887e8 | 5229 | { |
aeb5907d | 5230 | char *scope; |
1509e573 | 5231 | struct cleanup *old_chain; |
aeb5907d JB |
5232 | |
5233 | if (SYMBOL_CLASS (sym) != LOC_TYPEDEF) | |
5234 | return 0; | |
5235 | ||
5236 | scope = xget_renaming_scope (SYMBOL_TYPE (sym)); | |
1509e573 | 5237 | old_chain = make_cleanup (xfree, scope); |
14f9c5c9 | 5238 | |
96d887e8 PH |
5239 | /* If the rename has been defined in a package, then it is visible. */ |
5240 | if (is_package_name (scope)) | |
1509e573 JB |
5241 | { |
5242 | do_cleanups (old_chain); | |
5243 | return 0; | |
5244 | } | |
14f9c5c9 | 5245 | |
96d887e8 PH |
5246 | /* Check that the rename is in the current function scope by checking |
5247 | that its name starts with SCOPE. */ | |
76a01679 | 5248 | |
96d887e8 PH |
5249 | /* If the function name starts with "_ada_", it means that it is |
5250 | a library-level function. Strip this prefix before doing the | |
5251 | comparison, as the encoding for the renaming does not contain | |
5252 | this prefix. */ | |
61012eef | 5253 | if (startswith (function_name, "_ada_")) |
96d887e8 | 5254 | function_name += 5; |
f26caa11 | 5255 | |
1509e573 | 5256 | { |
61012eef | 5257 | int is_invisible = !startswith (function_name, scope); |
1509e573 JB |
5258 | |
5259 | do_cleanups (old_chain); | |
5260 | return is_invisible; | |
5261 | } | |
f26caa11 PH |
5262 | } |
5263 | ||
aeb5907d JB |
5264 | /* Remove entries from SYMS that corresponds to a renaming entity that |
5265 | is not visible from the function associated with CURRENT_BLOCK or | |
5266 | that is superfluous due to the presence of more specific renaming | |
5267 | information. Places surviving symbols in the initial entries of | |
5268 | SYMS and returns the number of surviving symbols. | |
96d887e8 PH |
5269 | |
5270 | Rationale: | |
aeb5907d JB |
5271 | First, in cases where an object renaming is implemented as a |
5272 | reference variable, GNAT may produce both the actual reference | |
5273 | variable and the renaming encoding. In this case, we discard the | |
5274 | latter. | |
5275 | ||
5276 | Second, GNAT emits a type following a specified encoding for each renaming | |
96d887e8 PH |
5277 | entity. Unfortunately, STABS currently does not support the definition |
5278 | of types that are local to a given lexical block, so all renamings types | |
5279 | are emitted at library level. As a consequence, if an application | |
5280 | contains two renaming entities using the same name, and a user tries to | |
5281 | print the value of one of these entities, the result of the ada symbol | |
5282 | lookup will also contain the wrong renaming type. | |
f26caa11 | 5283 | |
96d887e8 PH |
5284 | This function partially covers for this limitation by attempting to |
5285 | remove from the SYMS list renaming symbols that should be visible | |
5286 | from CURRENT_BLOCK. However, there does not seem be a 100% reliable | |
5287 | method with the current information available. The implementation | |
5288 | below has a couple of limitations (FIXME: brobecker-2003-05-12): | |
5289 | ||
5290 | - When the user tries to print a rename in a function while there | |
5291 | is another rename entity defined in a package: Normally, the | |
5292 | rename in the function has precedence over the rename in the | |
5293 | package, so the latter should be removed from the list. This is | |
5294 | currently not the case. | |
5295 | ||
5296 | - This function will incorrectly remove valid renames if | |
5297 | the CURRENT_BLOCK corresponds to a function which symbol name | |
5298 | has been changed by an "Export" pragma. As a consequence, | |
5299 | the user will be unable to print such rename entities. */ | |
4c4b4cd2 | 5300 | |
14f9c5c9 | 5301 | static int |
d12307c1 | 5302 | remove_irrelevant_renamings (struct block_symbol *syms, |
aeb5907d | 5303 | int nsyms, const struct block *current_block) |
4c4b4cd2 PH |
5304 | { |
5305 | struct symbol *current_function; | |
0d5cff50 | 5306 | const char *current_function_name; |
4c4b4cd2 | 5307 | int i; |
aeb5907d JB |
5308 | int is_new_style_renaming; |
5309 | ||
5310 | /* If there is both a renaming foo___XR... encoded as a variable and | |
5311 | a simple variable foo in the same block, discard the latter. | |
0963b4bd | 5312 | First, zero out such symbols, then compress. */ |
aeb5907d JB |
5313 | is_new_style_renaming = 0; |
5314 | for (i = 0; i < nsyms; i += 1) | |
5315 | { | |
d12307c1 | 5316 | struct symbol *sym = syms[i].symbol; |
270140bd | 5317 | const struct block *block = syms[i].block; |
aeb5907d JB |
5318 | const char *name; |
5319 | const char *suffix; | |
5320 | ||
5321 | if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
5322 | continue; | |
5323 | name = SYMBOL_LINKAGE_NAME (sym); | |
5324 | suffix = strstr (name, "___XR"); | |
5325 | ||
5326 | if (suffix != NULL) | |
5327 | { | |
5328 | int name_len = suffix - name; | |
5329 | int j; | |
5b4ee69b | 5330 | |
aeb5907d JB |
5331 | is_new_style_renaming = 1; |
5332 | for (j = 0; j < nsyms; j += 1) | |
d12307c1 PMR |
5333 | if (i != j && syms[j].symbol != NULL |
5334 | && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].symbol), | |
aeb5907d JB |
5335 | name_len) == 0 |
5336 | && block == syms[j].block) | |
d12307c1 | 5337 | syms[j].symbol = NULL; |
aeb5907d JB |
5338 | } |
5339 | } | |
5340 | if (is_new_style_renaming) | |
5341 | { | |
5342 | int j, k; | |
5343 | ||
5344 | for (j = k = 0; j < nsyms; j += 1) | |
d12307c1 | 5345 | if (syms[j].symbol != NULL) |
aeb5907d JB |
5346 | { |
5347 | syms[k] = syms[j]; | |
5348 | k += 1; | |
5349 | } | |
5350 | return k; | |
5351 | } | |
4c4b4cd2 PH |
5352 | |
5353 | /* Extract the function name associated to CURRENT_BLOCK. | |
5354 | Abort if unable to do so. */ | |
76a01679 | 5355 | |
4c4b4cd2 PH |
5356 | if (current_block == NULL) |
5357 | return nsyms; | |
76a01679 | 5358 | |
7f0df278 | 5359 | current_function = block_linkage_function (current_block); |
4c4b4cd2 PH |
5360 | if (current_function == NULL) |
5361 | return nsyms; | |
5362 | ||
5363 | current_function_name = SYMBOL_LINKAGE_NAME (current_function); | |
5364 | if (current_function_name == NULL) | |
5365 | return nsyms; | |
5366 | ||
5367 | /* Check each of the symbols, and remove it from the list if it is | |
5368 | a type corresponding to a renaming that is out of the scope of | |
5369 | the current block. */ | |
5370 | ||
5371 | i = 0; | |
5372 | while (i < nsyms) | |
5373 | { | |
d12307c1 | 5374 | if (ada_parse_renaming (syms[i].symbol, NULL, NULL, NULL) |
aeb5907d | 5375 | == ADA_OBJECT_RENAMING |
d12307c1 | 5376 | && old_renaming_is_invisible (syms[i].symbol, current_function_name)) |
4c4b4cd2 PH |
5377 | { |
5378 | int j; | |
5b4ee69b | 5379 | |
aeb5907d | 5380 | for (j = i + 1; j < nsyms; j += 1) |
76a01679 | 5381 | syms[j - 1] = syms[j]; |
4c4b4cd2 PH |
5382 | nsyms -= 1; |
5383 | } | |
5384 | else | |
5385 | i += 1; | |
5386 | } | |
5387 | ||
5388 | return nsyms; | |
5389 | } | |
5390 | ||
339c13b6 JB |
5391 | /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks) |
5392 | whose name and domain match NAME and DOMAIN respectively. | |
5393 | If no match was found, then extend the search to "enclosing" | |
5394 | routines (in other words, if we're inside a nested function, | |
5395 | search the symbols defined inside the enclosing functions). | |
d0a8ab18 JB |
5396 | If WILD_MATCH_P is nonzero, perform the naming matching in |
5397 | "wild" mode (see function "wild_match" for more info). | |
339c13b6 JB |
5398 | |
5399 | Note: This function assumes that OBSTACKP has 0 (zero) element in it. */ | |
5400 | ||
5401 | static void | |
5402 | ada_add_local_symbols (struct obstack *obstackp, const char *name, | |
f0c5f9b2 | 5403 | const struct block *block, domain_enum domain, |
d0a8ab18 | 5404 | int wild_match_p) |
339c13b6 JB |
5405 | { |
5406 | int block_depth = 0; | |
5407 | ||
5408 | while (block != NULL) | |
5409 | { | |
5410 | block_depth += 1; | |
d0a8ab18 JB |
5411 | ada_add_block_symbols (obstackp, block, name, domain, NULL, |
5412 | wild_match_p); | |
339c13b6 JB |
5413 | |
5414 | /* If we found a non-function match, assume that's the one. */ | |
5415 | if (is_nonfunction (defns_collected (obstackp, 0), | |
5416 | num_defns_collected (obstackp))) | |
5417 | return; | |
5418 | ||
5419 | block = BLOCK_SUPERBLOCK (block); | |
5420 | } | |
5421 | ||
5422 | /* If no luck so far, try to find NAME as a local symbol in some lexically | |
5423 | enclosing subprogram. */ | |
5424 | if (num_defns_collected (obstackp) == 0 && block_depth > 2) | |
d0a8ab18 | 5425 | add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match_p); |
339c13b6 JB |
5426 | } |
5427 | ||
ccefe4c4 | 5428 | /* An object of this type is used as the user_data argument when |
40658b94 | 5429 | calling the map_matching_symbols method. */ |
ccefe4c4 | 5430 | |
40658b94 | 5431 | struct match_data |
ccefe4c4 | 5432 | { |
40658b94 | 5433 | struct objfile *objfile; |
ccefe4c4 | 5434 | struct obstack *obstackp; |
40658b94 PH |
5435 | struct symbol *arg_sym; |
5436 | int found_sym; | |
ccefe4c4 TT |
5437 | }; |
5438 | ||
22cee43f | 5439 | /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK, |
40658b94 PH |
5440 | to a list of symbols. DATA0 is a pointer to a struct match_data * |
5441 | containing the obstack that collects the symbol list, the file that SYM | |
5442 | must come from, a flag indicating whether a non-argument symbol has | |
5443 | been found in the current block, and the last argument symbol | |
5444 | passed in SYM within the current block (if any). When SYM is null, | |
5445 | marking the end of a block, the argument symbol is added if no | |
5446 | other has been found. */ | |
ccefe4c4 | 5447 | |
40658b94 PH |
5448 | static int |
5449 | aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0) | |
ccefe4c4 | 5450 | { |
40658b94 PH |
5451 | struct match_data *data = (struct match_data *) data0; |
5452 | ||
5453 | if (sym == NULL) | |
5454 | { | |
5455 | if (!data->found_sym && data->arg_sym != NULL) | |
5456 | add_defn_to_vec (data->obstackp, | |
5457 | fixup_symbol_section (data->arg_sym, data->objfile), | |
5458 | block); | |
5459 | data->found_sym = 0; | |
5460 | data->arg_sym = NULL; | |
5461 | } | |
5462 | else | |
5463 | { | |
5464 | if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED) | |
5465 | return 0; | |
5466 | else if (SYMBOL_IS_ARGUMENT (sym)) | |
5467 | data->arg_sym = sym; | |
5468 | else | |
5469 | { | |
5470 | data->found_sym = 1; | |
5471 | add_defn_to_vec (data->obstackp, | |
5472 | fixup_symbol_section (sym, data->objfile), | |
5473 | block); | |
5474 | } | |
5475 | } | |
5476 | return 0; | |
5477 | } | |
5478 | ||
22cee43f PMR |
5479 | /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are targetted |
5480 | by renamings matching NAME in BLOCK. Add these symbols to OBSTACKP. If | |
5481 | WILD_MATCH_P is nonzero, perform the naming matching in "wild" mode (see | |
5482 | function "wild_match" for more information). Return whether we found such | |
5483 | symbols. */ | |
5484 | ||
5485 | static int | |
5486 | ada_add_block_renamings (struct obstack *obstackp, | |
5487 | const struct block *block, | |
5488 | const char *name, | |
5489 | domain_enum domain, | |
5490 | int wild_match_p) | |
5491 | { | |
5492 | struct using_direct *renaming; | |
5493 | int defns_mark = num_defns_collected (obstackp); | |
5494 | ||
5495 | for (renaming = block_using (block); | |
5496 | renaming != NULL; | |
5497 | renaming = renaming->next) | |
5498 | { | |
5499 | const char *r_name; | |
5500 | int name_match; | |
5501 | ||
5502 | /* Avoid infinite recursions: skip this renaming if we are actually | |
5503 | already traversing it. | |
5504 | ||
5505 | Currently, symbol lookup in Ada don't use the namespace machinery from | |
5506 | C++/Fortran support: skip namespace imports that use them. */ | |
5507 | if (renaming->searched | |
5508 | || (renaming->import_src != NULL | |
5509 | && renaming->import_src[0] != '\0') | |
5510 | || (renaming->import_dest != NULL | |
5511 | && renaming->import_dest[0] != '\0')) | |
5512 | continue; | |
5513 | renaming->searched = 1; | |
5514 | ||
5515 | /* TODO: here, we perform another name-based symbol lookup, which can | |
5516 | pull its own multiple overloads. In theory, we should be able to do | |
5517 | better in this case since, in DWARF, DW_AT_import is a DIE reference, | |
5518 | not a simple name. But in order to do this, we would need to enhance | |
5519 | the DWARF reader to associate a symbol to this renaming, instead of a | |
5520 | name. So, for now, we do something simpler: re-use the C++/Fortran | |
5521 | namespace machinery. */ | |
5522 | r_name = (renaming->alias != NULL | |
5523 | ? renaming->alias | |
5524 | : renaming->declaration); | |
5525 | name_match | |
5526 | = wild_match_p ? wild_match (r_name, name) : strcmp (r_name, name); | |
5527 | if (name_match == 0) | |
5528 | ada_add_all_symbols (obstackp, block, renaming->declaration, domain, | |
5529 | 1, NULL); | |
5530 | renaming->searched = 0; | |
5531 | } | |
5532 | return num_defns_collected (obstackp) != defns_mark; | |
5533 | } | |
5534 | ||
db230ce3 JB |
5535 | /* Implements compare_names, but only applying the comparision using |
5536 | the given CASING. */ | |
5b4ee69b | 5537 | |
40658b94 | 5538 | static int |
db230ce3 JB |
5539 | compare_names_with_case (const char *string1, const char *string2, |
5540 | enum case_sensitivity casing) | |
40658b94 PH |
5541 | { |
5542 | while (*string1 != '\0' && *string2 != '\0') | |
5543 | { | |
db230ce3 JB |
5544 | char c1, c2; |
5545 | ||
40658b94 PH |
5546 | if (isspace (*string1) || isspace (*string2)) |
5547 | return strcmp_iw_ordered (string1, string2); | |
db230ce3 JB |
5548 | |
5549 | if (casing == case_sensitive_off) | |
5550 | { | |
5551 | c1 = tolower (*string1); | |
5552 | c2 = tolower (*string2); | |
5553 | } | |
5554 | else | |
5555 | { | |
5556 | c1 = *string1; | |
5557 | c2 = *string2; | |
5558 | } | |
5559 | if (c1 != c2) | |
40658b94 | 5560 | break; |
db230ce3 | 5561 | |
40658b94 PH |
5562 | string1 += 1; |
5563 | string2 += 1; | |
5564 | } | |
db230ce3 | 5565 | |
40658b94 PH |
5566 | switch (*string1) |
5567 | { | |
5568 | case '(': | |
5569 | return strcmp_iw_ordered (string1, string2); | |
5570 | case '_': | |
5571 | if (*string2 == '\0') | |
5572 | { | |
052874e8 | 5573 | if (is_name_suffix (string1)) |
40658b94 PH |
5574 | return 0; |
5575 | else | |
1a1d5513 | 5576 | return 1; |
40658b94 | 5577 | } |
dbb8534f | 5578 | /* FALLTHROUGH */ |
40658b94 PH |
5579 | default: |
5580 | if (*string2 == '(') | |
5581 | return strcmp_iw_ordered (string1, string2); | |
5582 | else | |
db230ce3 JB |
5583 | { |
5584 | if (casing == case_sensitive_off) | |
5585 | return tolower (*string1) - tolower (*string2); | |
5586 | else | |
5587 | return *string1 - *string2; | |
5588 | } | |
40658b94 | 5589 | } |
ccefe4c4 TT |
5590 | } |
5591 | ||
db230ce3 JB |
5592 | /* Compare STRING1 to STRING2, with results as for strcmp. |
5593 | Compatible with strcmp_iw_ordered in that... | |
5594 | ||
5595 | strcmp_iw_ordered (STRING1, STRING2) <= 0 | |
5596 | ||
5597 | ... implies... | |
5598 | ||
5599 | compare_names (STRING1, STRING2) <= 0 | |
5600 | ||
5601 | (they may differ as to what symbols compare equal). */ | |
5602 | ||
5603 | static int | |
5604 | compare_names (const char *string1, const char *string2) | |
5605 | { | |
5606 | int result; | |
5607 | ||
5608 | /* Similar to what strcmp_iw_ordered does, we need to perform | |
5609 | a case-insensitive comparison first, and only resort to | |
5610 | a second, case-sensitive, comparison if the first one was | |
5611 | not sufficient to differentiate the two strings. */ | |
5612 | ||
5613 | result = compare_names_with_case (string1, string2, case_sensitive_off); | |
5614 | if (result == 0) | |
5615 | result = compare_names_with_case (string1, string2, case_sensitive_on); | |
5616 | ||
5617 | return result; | |
5618 | } | |
5619 | ||
339c13b6 JB |
5620 | /* Add to OBSTACKP all non-local symbols whose name and domain match |
5621 | NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK | |
5622 | symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */ | |
5623 | ||
5624 | static void | |
40658b94 PH |
5625 | add_nonlocal_symbols (struct obstack *obstackp, const char *name, |
5626 | domain_enum domain, int global, | |
5627 | int is_wild_match) | |
339c13b6 JB |
5628 | { |
5629 | struct objfile *objfile; | |
22cee43f | 5630 | struct compunit_symtab *cu; |
40658b94 | 5631 | struct match_data data; |
339c13b6 | 5632 | |
6475f2fe | 5633 | memset (&data, 0, sizeof data); |
ccefe4c4 | 5634 | data.obstackp = obstackp; |
339c13b6 | 5635 | |
ccefe4c4 | 5636 | ALL_OBJFILES (objfile) |
40658b94 PH |
5637 | { |
5638 | data.objfile = objfile; | |
5639 | ||
5640 | if (is_wild_match) | |
4186eb54 KS |
5641 | objfile->sf->qf->map_matching_symbols (objfile, name, domain, global, |
5642 | aux_add_nonlocal_symbols, &data, | |
5643 | wild_match, NULL); | |
40658b94 | 5644 | else |
4186eb54 KS |
5645 | objfile->sf->qf->map_matching_symbols (objfile, name, domain, global, |
5646 | aux_add_nonlocal_symbols, &data, | |
5647 | full_match, compare_names); | |
22cee43f PMR |
5648 | |
5649 | ALL_OBJFILE_COMPUNITS (objfile, cu) | |
5650 | { | |
5651 | const struct block *global_block | |
5652 | = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu), GLOBAL_BLOCK); | |
5653 | ||
5654 | if (ada_add_block_renamings (obstackp, global_block , name, domain, | |
5655 | is_wild_match)) | |
5656 | data.found_sym = 1; | |
5657 | } | |
40658b94 PH |
5658 | } |
5659 | ||
5660 | if (num_defns_collected (obstackp) == 0 && global && !is_wild_match) | |
5661 | { | |
5662 | ALL_OBJFILES (objfile) | |
5663 | { | |
224c3ddb | 5664 | char *name1 = (char *) alloca (strlen (name) + sizeof ("_ada_")); |
40658b94 PH |
5665 | strcpy (name1, "_ada_"); |
5666 | strcpy (name1 + sizeof ("_ada_") - 1, name); | |
5667 | data.objfile = objfile; | |
ade7ed9e DE |
5668 | objfile->sf->qf->map_matching_symbols (objfile, name1, domain, |
5669 | global, | |
0963b4bd MS |
5670 | aux_add_nonlocal_symbols, |
5671 | &data, | |
40658b94 PH |
5672 | full_match, compare_names); |
5673 | } | |
5674 | } | |
339c13b6 JB |
5675 | } |
5676 | ||
22cee43f | 5677 | /* Find symbols in DOMAIN matching NAME, in BLOCK and, if FULL_SEARCH is |
4eeaa230 | 5678 | non-zero, enclosing scope and in global scopes, returning the number of |
22cee43f | 5679 | matches. Add these to OBSTACKP. |
4eeaa230 | 5680 | |
22cee43f PMR |
5681 | When FULL_SEARCH is non-zero, any non-function/non-enumeral |
5682 | symbol match within the nest of blocks whose innermost member is BLOCK, | |
4c4b4cd2 | 5683 | is the one match returned (no other matches in that or |
d9680e73 | 5684 | enclosing blocks is returned). If there are any matches in or |
22cee43f | 5685 | surrounding BLOCK, then these alone are returned. |
4eeaa230 | 5686 | |
9f88c959 | 5687 | Names prefixed with "standard__" are handled specially: "standard__" |
22cee43f | 5688 | is first stripped off, and only static and global symbols are searched. |
14f9c5c9 | 5689 | |
22cee43f PMR |
5690 | If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had |
5691 | to lookup global symbols. */ | |
5692 | ||
5693 | static void | |
5694 | ada_add_all_symbols (struct obstack *obstackp, | |
5695 | const struct block *block, | |
5696 | const char *name, | |
5697 | domain_enum domain, | |
5698 | int full_search, | |
5699 | int *made_global_lookup_p) | |
14f9c5c9 AS |
5700 | { |
5701 | struct symbol *sym; | |
22cee43f | 5702 | const int wild_match_p = should_use_wild_match (name); |
14f9c5c9 | 5703 | |
22cee43f PMR |
5704 | if (made_global_lookup_p) |
5705 | *made_global_lookup_p = 0; | |
339c13b6 JB |
5706 | |
5707 | /* Special case: If the user specifies a symbol name inside package | |
5708 | Standard, do a non-wild matching of the symbol name without | |
5709 | the "standard__" prefix. This was primarily introduced in order | |
5710 | to allow the user to specifically access the standard exceptions | |
5711 | using, for instance, Standard.Constraint_Error when Constraint_Error | |
5712 | is ambiguous (due to the user defining its own Constraint_Error | |
5713 | entity inside its program). */ | |
22cee43f | 5714 | if (startswith (name, "standard__")) |
4c4b4cd2 | 5715 | { |
4c4b4cd2 | 5716 | block = NULL; |
22cee43f | 5717 | name = name + sizeof ("standard__") - 1; |
4c4b4cd2 PH |
5718 | } |
5719 | ||
339c13b6 | 5720 | /* Check the non-global symbols. If we have ANY match, then we're done. */ |
14f9c5c9 | 5721 | |
4eeaa230 DE |
5722 | if (block != NULL) |
5723 | { | |
5724 | if (full_search) | |
22cee43f | 5725 | ada_add_local_symbols (obstackp, name, block, domain, wild_match_p); |
4eeaa230 DE |
5726 | else |
5727 | { | |
5728 | /* In the !full_search case we're are being called by | |
5729 | ada_iterate_over_symbols, and we don't want to search | |
5730 | superblocks. */ | |
22cee43f PMR |
5731 | ada_add_block_symbols (obstackp, block, name, domain, NULL, |
5732 | wild_match_p); | |
4eeaa230 | 5733 | } |
22cee43f PMR |
5734 | if (num_defns_collected (obstackp) > 0 || !full_search) |
5735 | return; | |
4eeaa230 | 5736 | } |
d2e4a39e | 5737 | |
339c13b6 JB |
5738 | /* No non-global symbols found. Check our cache to see if we have |
5739 | already performed this search before. If we have, then return | |
5740 | the same result. */ | |
5741 | ||
22cee43f | 5742 | if (lookup_cached_symbol (name, domain, &sym, &block)) |
4c4b4cd2 PH |
5743 | { |
5744 | if (sym != NULL) | |
22cee43f PMR |
5745 | add_defn_to_vec (obstackp, sym, block); |
5746 | return; | |
4c4b4cd2 | 5747 | } |
14f9c5c9 | 5748 | |
22cee43f PMR |
5749 | if (made_global_lookup_p) |
5750 | *made_global_lookup_p = 1; | |
b1eedac9 | 5751 | |
339c13b6 JB |
5752 | /* Search symbols from all global blocks. */ |
5753 | ||
22cee43f | 5754 | add_nonlocal_symbols (obstackp, name, domain, 1, wild_match_p); |
d2e4a39e | 5755 | |
4c4b4cd2 | 5756 | /* Now add symbols from all per-file blocks if we've gotten no hits |
339c13b6 | 5757 | (not strictly correct, but perhaps better than an error). */ |
d2e4a39e | 5758 | |
22cee43f PMR |
5759 | if (num_defns_collected (obstackp) == 0) |
5760 | add_nonlocal_symbols (obstackp, name, domain, 0, wild_match_p); | |
5761 | } | |
5762 | ||
5763 | /* Find symbols in DOMAIN matching NAME, in BLOCK and, if full_search is | |
5764 | non-zero, enclosing scope and in global scopes, returning the number of | |
5765 | matches. | |
5766 | Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples, | |
5767 | indicating the symbols found and the blocks and symbol tables (if | |
5768 | any) in which they were found. This vector is transient---good only to | |
5769 | the next call of ada_lookup_symbol_list. | |
5770 | ||
5771 | When full_search is non-zero, any non-function/non-enumeral | |
5772 | symbol match within the nest of blocks whose innermost member is BLOCK, | |
5773 | is the one match returned (no other matches in that or | |
5774 | enclosing blocks is returned). If there are any matches in or | |
5775 | surrounding BLOCK, then these alone are returned. | |
5776 | ||
5777 | Names prefixed with "standard__" are handled specially: "standard__" | |
5778 | is first stripped off, and only static and global symbols are searched. */ | |
5779 | ||
5780 | static int | |
5781 | ada_lookup_symbol_list_worker (const char *name, const struct block *block, | |
5782 | domain_enum domain, | |
5783 | struct block_symbol **results, | |
5784 | int full_search) | |
5785 | { | |
5786 | const int wild_match_p = should_use_wild_match (name); | |
5787 | int syms_from_global_search; | |
5788 | int ndefns; | |
5789 | ||
5790 | obstack_free (&symbol_list_obstack, NULL); | |
5791 | obstack_init (&symbol_list_obstack); | |
5792 | ada_add_all_symbols (&symbol_list_obstack, block, name, domain, | |
5793 | full_search, &syms_from_global_search); | |
14f9c5c9 | 5794 | |
4c4b4cd2 PH |
5795 | ndefns = num_defns_collected (&symbol_list_obstack); |
5796 | *results = defns_collected (&symbol_list_obstack, 1); | |
5797 | ||
5798 | ndefns = remove_extra_symbols (*results, ndefns); | |
5799 | ||
b1eedac9 | 5800 | if (ndefns == 0 && full_search && syms_from_global_search) |
22cee43f | 5801 | cache_symbol (name, domain, NULL, NULL); |
14f9c5c9 | 5802 | |
b1eedac9 | 5803 | if (ndefns == 1 && full_search && syms_from_global_search) |
22cee43f | 5804 | cache_symbol (name, domain, (*results)[0].symbol, (*results)[0].block); |
14f9c5c9 | 5805 | |
22cee43f | 5806 | ndefns = remove_irrelevant_renamings (*results, ndefns, block); |
14f9c5c9 AS |
5807 | return ndefns; |
5808 | } | |
5809 | ||
4eeaa230 DE |
5810 | /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and |
5811 | in global scopes, returning the number of matches, and setting *RESULTS | |
5812 | to a vector of (SYM,BLOCK) tuples. | |
5813 | See ada_lookup_symbol_list_worker for further details. */ | |
5814 | ||
5815 | int | |
5816 | ada_lookup_symbol_list (const char *name0, const struct block *block0, | |
d12307c1 | 5817 | domain_enum domain, struct block_symbol **results) |
4eeaa230 DE |
5818 | { |
5819 | return ada_lookup_symbol_list_worker (name0, block0, domain, results, 1); | |
5820 | } | |
5821 | ||
5822 | /* Implementation of the la_iterate_over_symbols method. */ | |
5823 | ||
5824 | static void | |
5825 | ada_iterate_over_symbols (const struct block *block, | |
5826 | const char *name, domain_enum domain, | |
5827 | symbol_found_callback_ftype *callback, | |
5828 | void *data) | |
5829 | { | |
5830 | int ndefs, i; | |
d12307c1 | 5831 | struct block_symbol *results; |
4eeaa230 DE |
5832 | |
5833 | ndefs = ada_lookup_symbol_list_worker (name, block, domain, &results, 0); | |
5834 | for (i = 0; i < ndefs; ++i) | |
5835 | { | |
d12307c1 | 5836 | if (! (*callback) (results[i].symbol, data)) |
4eeaa230 DE |
5837 | break; |
5838 | } | |
5839 | } | |
5840 | ||
f8eba3c6 TT |
5841 | /* If NAME is the name of an entity, return a string that should |
5842 | be used to look that entity up in Ada units. This string should | |
5843 | be deallocated after use using xfree. | |
5844 | ||
5845 | NAME can have any form that the "break" or "print" commands might | |
5846 | recognize. In other words, it does not have to be the "natural" | |
5847 | name, or the "encoded" name. */ | |
5848 | ||
5849 | char * | |
5850 | ada_name_for_lookup (const char *name) | |
5851 | { | |
5852 | char *canon; | |
5853 | int nlen = strlen (name); | |
5854 | ||
5855 | if (name[0] == '<' && name[nlen - 1] == '>') | |
5856 | { | |
224c3ddb | 5857 | canon = (char *) xmalloc (nlen - 1); |
f8eba3c6 TT |
5858 | memcpy (canon, name + 1, nlen - 2); |
5859 | canon[nlen - 2] = '\0'; | |
5860 | } | |
5861 | else | |
5862 | canon = xstrdup (ada_encode (ada_fold_name (name))); | |
5863 | return canon; | |
5864 | } | |
5865 | ||
4e5c77fe JB |
5866 | /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set |
5867 | to 1, but choosing the first symbol found if there are multiple | |
5868 | choices. | |
5869 | ||
5e2336be JB |
5870 | The result is stored in *INFO, which must be non-NULL. |
5871 | If no match is found, INFO->SYM is set to NULL. */ | |
4e5c77fe JB |
5872 | |
5873 | void | |
5874 | ada_lookup_encoded_symbol (const char *name, const struct block *block, | |
fe978cb0 | 5875 | domain_enum domain, |
d12307c1 | 5876 | struct block_symbol *info) |
14f9c5c9 | 5877 | { |
d12307c1 | 5878 | struct block_symbol *candidates; |
14f9c5c9 AS |
5879 | int n_candidates; |
5880 | ||
5e2336be | 5881 | gdb_assert (info != NULL); |
d12307c1 | 5882 | memset (info, 0, sizeof (struct block_symbol)); |
4e5c77fe | 5883 | |
fe978cb0 | 5884 | n_candidates = ada_lookup_symbol_list (name, block, domain, &candidates); |
14f9c5c9 | 5885 | if (n_candidates == 0) |
4e5c77fe | 5886 | return; |
4c4b4cd2 | 5887 | |
5e2336be | 5888 | *info = candidates[0]; |
d12307c1 | 5889 | info->symbol = fixup_symbol_section (info->symbol, NULL); |
4e5c77fe | 5890 | } |
aeb5907d JB |
5891 | |
5892 | /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing | |
5893 | scope and in global scopes, or NULL if none. NAME is folded and | |
5894 | encoded first. Otherwise, the result is as for ada_lookup_symbol_list, | |
0963b4bd | 5895 | choosing the first symbol if there are multiple choices. |
4e5c77fe JB |
5896 | If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */ |
5897 | ||
d12307c1 | 5898 | struct block_symbol |
aeb5907d | 5899 | ada_lookup_symbol (const char *name, const struct block *block0, |
fe978cb0 | 5900 | domain_enum domain, int *is_a_field_of_this) |
aeb5907d | 5901 | { |
d12307c1 | 5902 | struct block_symbol info; |
4e5c77fe | 5903 | |
aeb5907d JB |
5904 | if (is_a_field_of_this != NULL) |
5905 | *is_a_field_of_this = 0; | |
5906 | ||
4e5c77fe | 5907 | ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)), |
fe978cb0 | 5908 | block0, domain, &info); |
d12307c1 | 5909 | return info; |
4c4b4cd2 | 5910 | } |
14f9c5c9 | 5911 | |
d12307c1 | 5912 | static struct block_symbol |
f606139a DE |
5913 | ada_lookup_symbol_nonlocal (const struct language_defn *langdef, |
5914 | const char *name, | |
76a01679 | 5915 | const struct block *block, |
21b556f4 | 5916 | const domain_enum domain) |
4c4b4cd2 | 5917 | { |
d12307c1 | 5918 | struct block_symbol sym; |
04dccad0 JB |
5919 | |
5920 | sym = ada_lookup_symbol (name, block_static_block (block), domain, NULL); | |
d12307c1 | 5921 | if (sym.symbol != NULL) |
04dccad0 JB |
5922 | return sym; |
5923 | ||
5924 | /* If we haven't found a match at this point, try the primitive | |
5925 | types. In other languages, this search is performed before | |
5926 | searching for global symbols in order to short-circuit that | |
5927 | global-symbol search if it happens that the name corresponds | |
5928 | to a primitive type. But we cannot do the same in Ada, because | |
5929 | it is perfectly legitimate for a program to declare a type which | |
5930 | has the same name as a standard type. If looking up a type in | |
5931 | that situation, we have traditionally ignored the primitive type | |
5932 | in favor of user-defined types. This is why, unlike most other | |
5933 | languages, we search the primitive types this late and only after | |
5934 | having searched the global symbols without success. */ | |
5935 | ||
5936 | if (domain == VAR_DOMAIN) | |
5937 | { | |
5938 | struct gdbarch *gdbarch; | |
5939 | ||
5940 | if (block == NULL) | |
5941 | gdbarch = target_gdbarch (); | |
5942 | else | |
5943 | gdbarch = block_gdbarch (block); | |
d12307c1 PMR |
5944 | sym.symbol = language_lookup_primitive_type_as_symbol (langdef, gdbarch, name); |
5945 | if (sym.symbol != NULL) | |
04dccad0 JB |
5946 | return sym; |
5947 | } | |
5948 | ||
d12307c1 | 5949 | return (struct block_symbol) {NULL, NULL}; |
14f9c5c9 AS |
5950 | } |
5951 | ||
5952 | ||
4c4b4cd2 PH |
5953 | /* True iff STR is a possible encoded suffix of a normal Ada name |
5954 | that is to be ignored for matching purposes. Suffixes of parallel | |
5955 | names (e.g., XVE) are not included here. Currently, the possible suffixes | |
5823c3ef | 5956 | are given by any of the regular expressions: |
4c4b4cd2 | 5957 | |
babe1480 JB |
5958 | [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux] |
5959 | ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX] | |
9ac7f98e | 5960 | TKB [subprogram suffix for task bodies] |
babe1480 | 5961 | _E[0-9]+[bs]$ [protected object entry suffixes] |
61ee279c | 5962 | (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$ |
babe1480 JB |
5963 | |
5964 | Also, any leading "__[0-9]+" sequence is skipped before the suffix | |
5965 | match is performed. This sequence is used to differentiate homonyms, | |
5966 | is an optional part of a valid name suffix. */ | |
4c4b4cd2 | 5967 | |
14f9c5c9 | 5968 | static int |
d2e4a39e | 5969 | is_name_suffix (const char *str) |
14f9c5c9 AS |
5970 | { |
5971 | int k; | |
4c4b4cd2 PH |
5972 | const char *matching; |
5973 | const int len = strlen (str); | |
5974 | ||
babe1480 JB |
5975 | /* Skip optional leading __[0-9]+. */ |
5976 | ||
4c4b4cd2 PH |
5977 | if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2])) |
5978 | { | |
babe1480 JB |
5979 | str += 3; |
5980 | while (isdigit (str[0])) | |
5981 | str += 1; | |
4c4b4cd2 | 5982 | } |
babe1480 JB |
5983 | |
5984 | /* [.$][0-9]+ */ | |
4c4b4cd2 | 5985 | |
babe1480 | 5986 | if (str[0] == '.' || str[0] == '$') |
4c4b4cd2 | 5987 | { |
babe1480 | 5988 | matching = str + 1; |
4c4b4cd2 PH |
5989 | while (isdigit (matching[0])) |
5990 | matching += 1; | |
5991 | if (matching[0] == '\0') | |
5992 | return 1; | |
5993 | } | |
5994 | ||
5995 | /* ___[0-9]+ */ | |
babe1480 | 5996 | |
4c4b4cd2 PH |
5997 | if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_') |
5998 | { | |
5999 | matching = str + 3; | |
6000 | while (isdigit (matching[0])) | |
6001 | matching += 1; | |
6002 | if (matching[0] == '\0') | |
6003 | return 1; | |
6004 | } | |
6005 | ||
9ac7f98e JB |
6006 | /* "TKB" suffixes are used for subprograms implementing task bodies. */ |
6007 | ||
6008 | if (strcmp (str, "TKB") == 0) | |
6009 | return 1; | |
6010 | ||
529cad9c PH |
6011 | #if 0 |
6012 | /* FIXME: brobecker/2005-09-23: Protected Object subprograms end | |
0963b4bd MS |
6013 | with a N at the end. Unfortunately, the compiler uses the same |
6014 | convention for other internal types it creates. So treating | |
529cad9c | 6015 | all entity names that end with an "N" as a name suffix causes |
0963b4bd MS |
6016 | some regressions. For instance, consider the case of an enumerated |
6017 | type. To support the 'Image attribute, it creates an array whose | |
529cad9c PH |
6018 | name ends with N. |
6019 | Having a single character like this as a suffix carrying some | |
0963b4bd | 6020 | information is a bit risky. Perhaps we should change the encoding |
529cad9c PH |
6021 | to be something like "_N" instead. In the meantime, do not do |
6022 | the following check. */ | |
6023 | /* Protected Object Subprograms */ | |
6024 | if (len == 1 && str [0] == 'N') | |
6025 | return 1; | |
6026 | #endif | |
6027 | ||
6028 | /* _E[0-9]+[bs]$ */ | |
6029 | if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2])) | |
6030 | { | |
6031 | matching = str + 3; | |
6032 | while (isdigit (matching[0])) | |
6033 | matching += 1; | |
6034 | if ((matching[0] == 'b' || matching[0] == 's') | |
6035 | && matching [1] == '\0') | |
6036 | return 1; | |
6037 | } | |
6038 | ||
4c4b4cd2 PH |
6039 | /* ??? We should not modify STR directly, as we are doing below. This |
6040 | is fine in this case, but may become problematic later if we find | |
6041 | that this alternative did not work, and want to try matching | |
6042 | another one from the begining of STR. Since we modified it, we | |
6043 | won't be able to find the begining of the string anymore! */ | |
14f9c5c9 AS |
6044 | if (str[0] == 'X') |
6045 | { | |
6046 | str += 1; | |
d2e4a39e | 6047 | while (str[0] != '_' && str[0] != '\0') |
4c4b4cd2 PH |
6048 | { |
6049 | if (str[0] != 'n' && str[0] != 'b') | |
6050 | return 0; | |
6051 | str += 1; | |
6052 | } | |
14f9c5c9 | 6053 | } |
babe1480 | 6054 | |
14f9c5c9 AS |
6055 | if (str[0] == '\000') |
6056 | return 1; | |
babe1480 | 6057 | |
d2e4a39e | 6058 | if (str[0] == '_') |
14f9c5c9 AS |
6059 | { |
6060 | if (str[1] != '_' || str[2] == '\000') | |
4c4b4cd2 | 6061 | return 0; |
d2e4a39e | 6062 | if (str[2] == '_') |
4c4b4cd2 | 6063 | { |
61ee279c PH |
6064 | if (strcmp (str + 3, "JM") == 0) |
6065 | return 1; | |
6066 | /* FIXME: brobecker/2004-09-30: GNAT will soon stop using | |
6067 | the LJM suffix in favor of the JM one. But we will | |
6068 | still accept LJM as a valid suffix for a reasonable | |
6069 | amount of time, just to allow ourselves to debug programs | |
6070 | compiled using an older version of GNAT. */ | |
4c4b4cd2 PH |
6071 | if (strcmp (str + 3, "LJM") == 0) |
6072 | return 1; | |
6073 | if (str[3] != 'X') | |
6074 | return 0; | |
1265e4aa JB |
6075 | if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B' |
6076 | || str[4] == 'U' || str[4] == 'P') | |
4c4b4cd2 PH |
6077 | return 1; |
6078 | if (str[4] == 'R' && str[5] != 'T') | |
6079 | return 1; | |
6080 | return 0; | |
6081 | } | |
6082 | if (!isdigit (str[2])) | |
6083 | return 0; | |
6084 | for (k = 3; str[k] != '\0'; k += 1) | |
6085 | if (!isdigit (str[k]) && str[k] != '_') | |
6086 | return 0; | |
14f9c5c9 AS |
6087 | return 1; |
6088 | } | |
4c4b4cd2 | 6089 | if (str[0] == '$' && isdigit (str[1])) |
14f9c5c9 | 6090 | { |
4c4b4cd2 PH |
6091 | for (k = 2; str[k] != '\0'; k += 1) |
6092 | if (!isdigit (str[k]) && str[k] != '_') | |
6093 | return 0; | |
14f9c5c9 AS |
6094 | return 1; |
6095 | } | |
6096 | return 0; | |
6097 | } | |
d2e4a39e | 6098 | |
aeb5907d JB |
6099 | /* Return non-zero if the string starting at NAME and ending before |
6100 | NAME_END contains no capital letters. */ | |
529cad9c PH |
6101 | |
6102 | static int | |
6103 | is_valid_name_for_wild_match (const char *name0) | |
6104 | { | |
6105 | const char *decoded_name = ada_decode (name0); | |
6106 | int i; | |
6107 | ||
5823c3ef JB |
6108 | /* If the decoded name starts with an angle bracket, it means that |
6109 | NAME0 does not follow the GNAT encoding format. It should then | |
6110 | not be allowed as a possible wild match. */ | |
6111 | if (decoded_name[0] == '<') | |
6112 | return 0; | |
6113 | ||
529cad9c PH |
6114 | for (i=0; decoded_name[i] != '\0'; i++) |
6115 | if (isalpha (decoded_name[i]) && !islower (decoded_name[i])) | |
6116 | return 0; | |
6117 | ||
6118 | return 1; | |
6119 | } | |
6120 | ||
73589123 PH |
6121 | /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0 |
6122 | that could start a simple name. Assumes that *NAMEP points into | |
6123 | the string beginning at NAME0. */ | |
4c4b4cd2 | 6124 | |
14f9c5c9 | 6125 | static int |
73589123 | 6126 | advance_wild_match (const char **namep, const char *name0, int target0) |
14f9c5c9 | 6127 | { |
73589123 | 6128 | const char *name = *namep; |
5b4ee69b | 6129 | |
5823c3ef | 6130 | while (1) |
14f9c5c9 | 6131 | { |
aa27d0b3 | 6132 | int t0, t1; |
73589123 PH |
6133 | |
6134 | t0 = *name; | |
6135 | if (t0 == '_') | |
6136 | { | |
6137 | t1 = name[1]; | |
6138 | if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9')) | |
6139 | { | |
6140 | name += 1; | |
61012eef | 6141 | if (name == name0 + 5 && startswith (name0, "_ada")) |
73589123 PH |
6142 | break; |
6143 | else | |
6144 | name += 1; | |
6145 | } | |
aa27d0b3 JB |
6146 | else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z') |
6147 | || name[2] == target0)) | |
73589123 PH |
6148 | { |
6149 | name += 2; | |
6150 | break; | |
6151 | } | |
6152 | else | |
6153 | return 0; | |
6154 | } | |
6155 | else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9')) | |
6156 | name += 1; | |
6157 | else | |
5823c3ef | 6158 | return 0; |
73589123 PH |
6159 | } |
6160 | ||
6161 | *namep = name; | |
6162 | return 1; | |
6163 | } | |
6164 | ||
6165 | /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any | |
6166 | informational suffixes of NAME (i.e., for which is_name_suffix is | |
6167 | true). Assumes that PATN is a lower-cased Ada simple name. */ | |
6168 | ||
6169 | static int | |
6170 | wild_match (const char *name, const char *patn) | |
6171 | { | |
22e048c9 | 6172 | const char *p; |
73589123 PH |
6173 | const char *name0 = name; |
6174 | ||
6175 | while (1) | |
6176 | { | |
6177 | const char *match = name; | |
6178 | ||
6179 | if (*name == *patn) | |
6180 | { | |
6181 | for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1) | |
6182 | if (*p != *name) | |
6183 | break; | |
6184 | if (*p == '\0' && is_name_suffix (name)) | |
6185 | return match != name0 && !is_valid_name_for_wild_match (name0); | |
6186 | ||
6187 | if (name[-1] == '_') | |
6188 | name -= 1; | |
6189 | } | |
6190 | if (!advance_wild_match (&name, name0, *patn)) | |
6191 | return 1; | |
96d887e8 | 6192 | } |
96d887e8 PH |
6193 | } |
6194 | ||
40658b94 PH |
6195 | /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from |
6196 | informational suffix. */ | |
6197 | ||
c4d840bd PH |
6198 | static int |
6199 | full_match (const char *sym_name, const char *search_name) | |
6200 | { | |
40658b94 | 6201 | return !match_name (sym_name, search_name, 0); |
c4d840bd PH |
6202 | } |
6203 | ||
6204 | ||
96d887e8 PH |
6205 | /* Add symbols from BLOCK matching identifier NAME in DOMAIN to |
6206 | vector *defn_symbols, updating the list of symbols in OBSTACKP | |
0963b4bd | 6207 | (if necessary). If WILD, treat as NAME with a wildcard prefix. |
4eeaa230 | 6208 | OBJFILE is the section containing BLOCK. */ |
96d887e8 PH |
6209 | |
6210 | static void | |
6211 | ada_add_block_symbols (struct obstack *obstackp, | |
f0c5f9b2 | 6212 | const struct block *block, const char *name, |
96d887e8 | 6213 | domain_enum domain, struct objfile *objfile, |
2570f2b7 | 6214 | int wild) |
96d887e8 | 6215 | { |
8157b174 | 6216 | struct block_iterator iter; |
96d887e8 PH |
6217 | int name_len = strlen (name); |
6218 | /* A matching argument symbol, if any. */ | |
6219 | struct symbol *arg_sym; | |
6220 | /* Set true when we find a matching non-argument symbol. */ | |
6221 | int found_sym; | |
6222 | struct symbol *sym; | |
6223 | ||
6224 | arg_sym = NULL; | |
6225 | found_sym = 0; | |
6226 | if (wild) | |
6227 | { | |
8157b174 TT |
6228 | for (sym = block_iter_match_first (block, name, wild_match, &iter); |
6229 | sym != NULL; sym = block_iter_match_next (name, wild_match, &iter)) | |
76a01679 | 6230 | { |
4186eb54 KS |
6231 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
6232 | SYMBOL_DOMAIN (sym), domain) | |
73589123 | 6233 | && wild_match (SYMBOL_LINKAGE_NAME (sym), name) == 0) |
76a01679 | 6234 | { |
2a2d4dc3 AS |
6235 | if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED) |
6236 | continue; | |
6237 | else if (SYMBOL_IS_ARGUMENT (sym)) | |
6238 | arg_sym = sym; | |
6239 | else | |
6240 | { | |
76a01679 JB |
6241 | found_sym = 1; |
6242 | add_defn_to_vec (obstackp, | |
6243 | fixup_symbol_section (sym, objfile), | |
2570f2b7 | 6244 | block); |
76a01679 JB |
6245 | } |
6246 | } | |
6247 | } | |
96d887e8 PH |
6248 | } |
6249 | else | |
6250 | { | |
8157b174 TT |
6251 | for (sym = block_iter_match_first (block, name, full_match, &iter); |
6252 | sym != NULL; sym = block_iter_match_next (name, full_match, &iter)) | |
76a01679 | 6253 | { |
4186eb54 KS |
6254 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
6255 | SYMBOL_DOMAIN (sym), domain)) | |
76a01679 | 6256 | { |
c4d840bd PH |
6257 | if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED) |
6258 | { | |
6259 | if (SYMBOL_IS_ARGUMENT (sym)) | |
6260 | arg_sym = sym; | |
6261 | else | |
2a2d4dc3 | 6262 | { |
c4d840bd PH |
6263 | found_sym = 1; |
6264 | add_defn_to_vec (obstackp, | |
6265 | fixup_symbol_section (sym, objfile), | |
6266 | block); | |
2a2d4dc3 | 6267 | } |
c4d840bd | 6268 | } |
76a01679 JB |
6269 | } |
6270 | } | |
96d887e8 PH |
6271 | } |
6272 | ||
22cee43f PMR |
6273 | /* Handle renamings. */ |
6274 | ||
6275 | if (ada_add_block_renamings (obstackp, block, name, domain, wild)) | |
6276 | found_sym = 1; | |
6277 | ||
96d887e8 PH |
6278 | if (!found_sym && arg_sym != NULL) |
6279 | { | |
76a01679 JB |
6280 | add_defn_to_vec (obstackp, |
6281 | fixup_symbol_section (arg_sym, objfile), | |
2570f2b7 | 6282 | block); |
96d887e8 PH |
6283 | } |
6284 | ||
6285 | if (!wild) | |
6286 | { | |
6287 | arg_sym = NULL; | |
6288 | found_sym = 0; | |
6289 | ||
6290 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
76a01679 | 6291 | { |
4186eb54 KS |
6292 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
6293 | SYMBOL_DOMAIN (sym), domain)) | |
76a01679 JB |
6294 | { |
6295 | int cmp; | |
6296 | ||
6297 | cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0]; | |
6298 | if (cmp == 0) | |
6299 | { | |
61012eef | 6300 | cmp = !startswith (SYMBOL_LINKAGE_NAME (sym), "_ada_"); |
76a01679 JB |
6301 | if (cmp == 0) |
6302 | cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5, | |
6303 | name_len); | |
6304 | } | |
6305 | ||
6306 | if (cmp == 0 | |
6307 | && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5)) | |
6308 | { | |
2a2d4dc3 AS |
6309 | if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED) |
6310 | { | |
6311 | if (SYMBOL_IS_ARGUMENT (sym)) | |
6312 | arg_sym = sym; | |
6313 | else | |
6314 | { | |
6315 | found_sym = 1; | |
6316 | add_defn_to_vec (obstackp, | |
6317 | fixup_symbol_section (sym, objfile), | |
6318 | block); | |
6319 | } | |
6320 | } | |
76a01679 JB |
6321 | } |
6322 | } | |
76a01679 | 6323 | } |
96d887e8 PH |
6324 | |
6325 | /* NOTE: This really shouldn't be needed for _ada_ symbols. | |
6326 | They aren't parameters, right? */ | |
6327 | if (!found_sym && arg_sym != NULL) | |
6328 | { | |
6329 | add_defn_to_vec (obstackp, | |
76a01679 | 6330 | fixup_symbol_section (arg_sym, objfile), |
2570f2b7 | 6331 | block); |
96d887e8 PH |
6332 | } |
6333 | } | |
6334 | } | |
6335 | \f | |
41d27058 JB |
6336 | |
6337 | /* Symbol Completion */ | |
6338 | ||
6339 | /* If SYM_NAME is a completion candidate for TEXT, return this symbol | |
6340 | name in a form that's appropriate for the completion. The result | |
6341 | does not need to be deallocated, but is only good until the next call. | |
6342 | ||
6343 | TEXT_LEN is equal to the length of TEXT. | |
e701b3c0 | 6344 | Perform a wild match if WILD_MATCH_P is set. |
6ea35997 | 6345 | ENCODED_P should be set if TEXT represents the start of a symbol name |
41d27058 JB |
6346 | in its encoded form. */ |
6347 | ||
6348 | static const char * | |
6349 | symbol_completion_match (const char *sym_name, | |
6350 | const char *text, int text_len, | |
6ea35997 | 6351 | int wild_match_p, int encoded_p) |
41d27058 | 6352 | { |
41d27058 JB |
6353 | const int verbatim_match = (text[0] == '<'); |
6354 | int match = 0; | |
6355 | ||
6356 | if (verbatim_match) | |
6357 | { | |
6358 | /* Strip the leading angle bracket. */ | |
6359 | text = text + 1; | |
6360 | text_len--; | |
6361 | } | |
6362 | ||
6363 | /* First, test against the fully qualified name of the symbol. */ | |
6364 | ||
6365 | if (strncmp (sym_name, text, text_len) == 0) | |
6366 | match = 1; | |
6367 | ||
6ea35997 | 6368 | if (match && !encoded_p) |
41d27058 JB |
6369 | { |
6370 | /* One needed check before declaring a positive match is to verify | |
6371 | that iff we are doing a verbatim match, the decoded version | |
6372 | of the symbol name starts with '<'. Otherwise, this symbol name | |
6373 | is not a suitable completion. */ | |
6374 | const char *sym_name_copy = sym_name; | |
6375 | int has_angle_bracket; | |
6376 | ||
6377 | sym_name = ada_decode (sym_name); | |
6378 | has_angle_bracket = (sym_name[0] == '<'); | |
6379 | match = (has_angle_bracket == verbatim_match); | |
6380 | sym_name = sym_name_copy; | |
6381 | } | |
6382 | ||
6383 | if (match && !verbatim_match) | |
6384 | { | |
6385 | /* When doing non-verbatim match, another check that needs to | |
6386 | be done is to verify that the potentially matching symbol name | |
6387 | does not include capital letters, because the ada-mode would | |
6388 | not be able to understand these symbol names without the | |
6389 | angle bracket notation. */ | |
6390 | const char *tmp; | |
6391 | ||
6392 | for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++); | |
6393 | if (*tmp != '\0') | |
6394 | match = 0; | |
6395 | } | |
6396 | ||
6397 | /* Second: Try wild matching... */ | |
6398 | ||
e701b3c0 | 6399 | if (!match && wild_match_p) |
41d27058 JB |
6400 | { |
6401 | /* Since we are doing wild matching, this means that TEXT | |
6402 | may represent an unqualified symbol name. We therefore must | |
6403 | also compare TEXT against the unqualified name of the symbol. */ | |
6404 | sym_name = ada_unqualified_name (ada_decode (sym_name)); | |
6405 | ||
6406 | if (strncmp (sym_name, text, text_len) == 0) | |
6407 | match = 1; | |
6408 | } | |
6409 | ||
6410 | /* Finally: If we found a mach, prepare the result to return. */ | |
6411 | ||
6412 | if (!match) | |
6413 | return NULL; | |
6414 | ||
6415 | if (verbatim_match) | |
6416 | sym_name = add_angle_brackets (sym_name); | |
6417 | ||
6ea35997 | 6418 | if (!encoded_p) |
41d27058 JB |
6419 | sym_name = ada_decode (sym_name); |
6420 | ||
6421 | return sym_name; | |
6422 | } | |
6423 | ||
6424 | /* A companion function to ada_make_symbol_completion_list(). | |
6425 | Check if SYM_NAME represents a symbol which name would be suitable | |
6426 | to complete TEXT (TEXT_LEN is the length of TEXT), in which case | |
6427 | it is appended at the end of the given string vector SV. | |
6428 | ||
6429 | ORIG_TEXT is the string original string from the user command | |
6430 | that needs to be completed. WORD is the entire command on which | |
6431 | completion should be performed. These two parameters are used to | |
6432 | determine which part of the symbol name should be added to the | |
6433 | completion vector. | |
c0af1706 | 6434 | if WILD_MATCH_P is set, then wild matching is performed. |
cb8e9b97 | 6435 | ENCODED_P should be set if TEXT represents a symbol name in its |
41d27058 JB |
6436 | encoded formed (in which case the completion should also be |
6437 | encoded). */ | |
6438 | ||
6439 | static void | |
d6565258 | 6440 | symbol_completion_add (VEC(char_ptr) **sv, |
41d27058 JB |
6441 | const char *sym_name, |
6442 | const char *text, int text_len, | |
6443 | const char *orig_text, const char *word, | |
cb8e9b97 | 6444 | int wild_match_p, int encoded_p) |
41d27058 JB |
6445 | { |
6446 | const char *match = symbol_completion_match (sym_name, text, text_len, | |
cb8e9b97 | 6447 | wild_match_p, encoded_p); |
41d27058 JB |
6448 | char *completion; |
6449 | ||
6450 | if (match == NULL) | |
6451 | return; | |
6452 | ||
6453 | /* We found a match, so add the appropriate completion to the given | |
6454 | string vector. */ | |
6455 | ||
6456 | if (word == orig_text) | |
6457 | { | |
224c3ddb | 6458 | completion = (char *) xmalloc (strlen (match) + 5); |
41d27058 JB |
6459 | strcpy (completion, match); |
6460 | } | |
6461 | else if (word > orig_text) | |
6462 | { | |
6463 | /* Return some portion of sym_name. */ | |
224c3ddb | 6464 | completion = (char *) xmalloc (strlen (match) + 5); |
41d27058 JB |
6465 | strcpy (completion, match + (word - orig_text)); |
6466 | } | |
6467 | else | |
6468 | { | |
6469 | /* Return some of ORIG_TEXT plus sym_name. */ | |
224c3ddb | 6470 | completion = (char *) xmalloc (strlen (match) + (orig_text - word) + 5); |
41d27058 JB |
6471 | strncpy (completion, word, orig_text - word); |
6472 | completion[orig_text - word] = '\0'; | |
6473 | strcat (completion, match); | |
6474 | } | |
6475 | ||
d6565258 | 6476 | VEC_safe_push (char_ptr, *sv, completion); |
41d27058 JB |
6477 | } |
6478 | ||
ccefe4c4 | 6479 | /* An object of this type is passed as the user_data argument to the |
bb4142cf | 6480 | expand_symtabs_matching method. */ |
ccefe4c4 TT |
6481 | struct add_partial_datum |
6482 | { | |
6483 | VEC(char_ptr) **completions; | |
6f937416 | 6484 | const char *text; |
ccefe4c4 | 6485 | int text_len; |
6f937416 PA |
6486 | const char *text0; |
6487 | const char *word; | |
ccefe4c4 TT |
6488 | int wild_match; |
6489 | int encoded; | |
6490 | }; | |
6491 | ||
bb4142cf DE |
6492 | /* A callback for expand_symtabs_matching. */ |
6493 | ||
7b08b9eb | 6494 | static int |
bb4142cf | 6495 | ada_complete_symbol_matcher (const char *name, void *user_data) |
ccefe4c4 | 6496 | { |
9a3c8263 | 6497 | struct add_partial_datum *data = (struct add_partial_datum *) user_data; |
7b08b9eb JK |
6498 | |
6499 | return symbol_completion_match (name, data->text, data->text_len, | |
6500 | data->wild_match, data->encoded) != NULL; | |
ccefe4c4 TT |
6501 | } |
6502 | ||
49c4e619 TT |
6503 | /* Return a list of possible symbol names completing TEXT0. WORD is |
6504 | the entire command on which completion is made. */ | |
41d27058 | 6505 | |
49c4e619 | 6506 | static VEC (char_ptr) * |
6f937416 PA |
6507 | ada_make_symbol_completion_list (const char *text0, const char *word, |
6508 | enum type_code code) | |
41d27058 JB |
6509 | { |
6510 | char *text; | |
6511 | int text_len; | |
b1ed564a JB |
6512 | int wild_match_p; |
6513 | int encoded_p; | |
2ba95b9b | 6514 | VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128); |
41d27058 | 6515 | struct symbol *sym; |
43f3e411 | 6516 | struct compunit_symtab *s; |
41d27058 JB |
6517 | struct minimal_symbol *msymbol; |
6518 | struct objfile *objfile; | |
3977b71f | 6519 | const struct block *b, *surrounding_static_block = 0; |
41d27058 | 6520 | int i; |
8157b174 | 6521 | struct block_iterator iter; |
b8fea896 | 6522 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); |
41d27058 | 6523 | |
2f68a895 TT |
6524 | gdb_assert (code == TYPE_CODE_UNDEF); |
6525 | ||
41d27058 JB |
6526 | if (text0[0] == '<') |
6527 | { | |
6528 | text = xstrdup (text0); | |
6529 | make_cleanup (xfree, text); | |
6530 | text_len = strlen (text); | |
b1ed564a JB |
6531 | wild_match_p = 0; |
6532 | encoded_p = 1; | |
41d27058 JB |
6533 | } |
6534 | else | |
6535 | { | |
6536 | text = xstrdup (ada_encode (text0)); | |
6537 | make_cleanup (xfree, text); | |
6538 | text_len = strlen (text); | |
6539 | for (i = 0; i < text_len; i++) | |
6540 | text[i] = tolower (text[i]); | |
6541 | ||
b1ed564a | 6542 | encoded_p = (strstr (text0, "__") != NULL); |
41d27058 JB |
6543 | /* If the name contains a ".", then the user is entering a fully |
6544 | qualified entity name, and the match must not be done in wild | |
6545 | mode. Similarly, if the user wants to complete what looks like | |
6546 | an encoded name, the match must not be done in wild mode. */ | |
b1ed564a | 6547 | wild_match_p = (strchr (text0, '.') == NULL && !encoded_p); |
41d27058 JB |
6548 | } |
6549 | ||
6550 | /* First, look at the partial symtab symbols. */ | |
41d27058 | 6551 | { |
ccefe4c4 TT |
6552 | struct add_partial_datum data; |
6553 | ||
6554 | data.completions = &completions; | |
6555 | data.text = text; | |
6556 | data.text_len = text_len; | |
6557 | data.text0 = text0; | |
6558 | data.word = word; | |
b1ed564a JB |
6559 | data.wild_match = wild_match_p; |
6560 | data.encoded = encoded_p; | |
276d885b GB |
6561 | expand_symtabs_matching (NULL, ada_complete_symbol_matcher, NULL, |
6562 | ALL_DOMAIN, &data); | |
41d27058 JB |
6563 | } |
6564 | ||
6565 | /* At this point scan through the misc symbol vectors and add each | |
6566 | symbol you find to the list. Eventually we want to ignore | |
6567 | anything that isn't a text symbol (everything else will be | |
6568 | handled by the psymtab code above). */ | |
6569 | ||
6570 | ALL_MSYMBOLS (objfile, msymbol) | |
6571 | { | |
6572 | QUIT; | |
efd66ac6 | 6573 | symbol_completion_add (&completions, MSYMBOL_LINKAGE_NAME (msymbol), |
b1ed564a JB |
6574 | text, text_len, text0, word, wild_match_p, |
6575 | encoded_p); | |
41d27058 JB |
6576 | } |
6577 | ||
6578 | /* Search upwards from currently selected frame (so that we can | |
6579 | complete on local vars. */ | |
6580 | ||
6581 | for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b)) | |
6582 | { | |
6583 | if (!BLOCK_SUPERBLOCK (b)) | |
6584 | surrounding_static_block = b; /* For elmin of dups */ | |
6585 | ||
6586 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6587 | { | |
d6565258 | 6588 | symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym), |
41d27058 | 6589 | text, text_len, text0, word, |
b1ed564a | 6590 | wild_match_p, encoded_p); |
41d27058 JB |
6591 | } |
6592 | } | |
6593 | ||
6594 | /* Go through the symtabs and check the externs and statics for | |
43f3e411 | 6595 | symbols which match. */ |
41d27058 | 6596 | |
43f3e411 | 6597 | ALL_COMPUNITS (objfile, s) |
41d27058 JB |
6598 | { |
6599 | QUIT; | |
43f3e411 | 6600 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), GLOBAL_BLOCK); |
41d27058 JB |
6601 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
6602 | { | |
d6565258 | 6603 | symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym), |
41d27058 | 6604 | text, text_len, text0, word, |
b1ed564a | 6605 | wild_match_p, encoded_p); |
41d27058 JB |
6606 | } |
6607 | } | |
6608 | ||
43f3e411 | 6609 | ALL_COMPUNITS (objfile, s) |
41d27058 JB |
6610 | { |
6611 | QUIT; | |
43f3e411 | 6612 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), STATIC_BLOCK); |
41d27058 JB |
6613 | /* Don't do this block twice. */ |
6614 | if (b == surrounding_static_block) | |
6615 | continue; | |
6616 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6617 | { | |
d6565258 | 6618 | symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym), |
41d27058 | 6619 | text, text_len, text0, word, |
b1ed564a | 6620 | wild_match_p, encoded_p); |
41d27058 JB |
6621 | } |
6622 | } | |
6623 | ||
b8fea896 | 6624 | do_cleanups (old_chain); |
49c4e619 | 6625 | return completions; |
41d27058 JB |
6626 | } |
6627 | ||
963a6417 | 6628 | /* Field Access */ |
96d887e8 | 6629 | |
73fb9985 JB |
6630 | /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used |
6631 | for tagged types. */ | |
6632 | ||
6633 | static int | |
6634 | ada_is_dispatch_table_ptr_type (struct type *type) | |
6635 | { | |
0d5cff50 | 6636 | const char *name; |
73fb9985 JB |
6637 | |
6638 | if (TYPE_CODE (type) != TYPE_CODE_PTR) | |
6639 | return 0; | |
6640 | ||
6641 | name = TYPE_NAME (TYPE_TARGET_TYPE (type)); | |
6642 | if (name == NULL) | |
6643 | return 0; | |
6644 | ||
6645 | return (strcmp (name, "ada__tags__dispatch_table") == 0); | |
6646 | } | |
6647 | ||
ac4a2da4 JG |
6648 | /* Return non-zero if TYPE is an interface tag. */ |
6649 | ||
6650 | static int | |
6651 | ada_is_interface_tag (struct type *type) | |
6652 | { | |
6653 | const char *name = TYPE_NAME (type); | |
6654 | ||
6655 | if (name == NULL) | |
6656 | return 0; | |
6657 | ||
6658 | return (strcmp (name, "ada__tags__interface_tag") == 0); | |
6659 | } | |
6660 | ||
963a6417 PH |
6661 | /* True if field number FIELD_NUM in struct or union type TYPE is supposed |
6662 | to be invisible to users. */ | |
96d887e8 | 6663 | |
963a6417 PH |
6664 | int |
6665 | ada_is_ignored_field (struct type *type, int field_num) | |
96d887e8 | 6666 | { |
963a6417 PH |
6667 | if (field_num < 0 || field_num > TYPE_NFIELDS (type)) |
6668 | return 1; | |
ffde82bf | 6669 | |
73fb9985 JB |
6670 | /* Check the name of that field. */ |
6671 | { | |
6672 | const char *name = TYPE_FIELD_NAME (type, field_num); | |
6673 | ||
6674 | /* Anonymous field names should not be printed. | |
6675 | brobecker/2007-02-20: I don't think this can actually happen | |
6676 | but we don't want to print the value of annonymous fields anyway. */ | |
6677 | if (name == NULL) | |
6678 | return 1; | |
6679 | ||
ffde82bf JB |
6680 | /* Normally, fields whose name start with an underscore ("_") |
6681 | are fields that have been internally generated by the compiler, | |
6682 | and thus should not be printed. The "_parent" field is special, | |
6683 | however: This is a field internally generated by the compiler | |
6684 | for tagged types, and it contains the components inherited from | |
6685 | the parent type. This field should not be printed as is, but | |
6686 | should not be ignored either. */ | |
61012eef | 6687 | if (name[0] == '_' && !startswith (name, "_parent")) |
73fb9985 JB |
6688 | return 1; |
6689 | } | |
6690 | ||
ac4a2da4 JG |
6691 | /* If this is the dispatch table of a tagged type or an interface tag, |
6692 | then ignore. */ | |
73fb9985 | 6693 | if (ada_is_tagged_type (type, 1) |
ac4a2da4 JG |
6694 | && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)) |
6695 | || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num)))) | |
73fb9985 JB |
6696 | return 1; |
6697 | ||
6698 | /* Not a special field, so it should not be ignored. */ | |
6699 | return 0; | |
963a6417 | 6700 | } |
96d887e8 | 6701 | |
963a6417 | 6702 | /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a |
0963b4bd | 6703 | pointer or reference type whose ultimate target has a tag field. */ |
96d887e8 | 6704 | |
963a6417 PH |
6705 | int |
6706 | ada_is_tagged_type (struct type *type, int refok) | |
6707 | { | |
6708 | return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL); | |
6709 | } | |
96d887e8 | 6710 | |
963a6417 | 6711 | /* True iff TYPE represents the type of X'Tag */ |
96d887e8 | 6712 | |
963a6417 PH |
6713 | int |
6714 | ada_is_tag_type (struct type *type) | |
6715 | { | |
460efde1 JB |
6716 | type = ada_check_typedef (type); |
6717 | ||
963a6417 PH |
6718 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR) |
6719 | return 0; | |
6720 | else | |
96d887e8 | 6721 | { |
963a6417 | 6722 | const char *name = ada_type_name (TYPE_TARGET_TYPE (type)); |
5b4ee69b | 6723 | |
963a6417 PH |
6724 | return (name != NULL |
6725 | && strcmp (name, "ada__tags__dispatch_table") == 0); | |
96d887e8 | 6726 | } |
96d887e8 PH |
6727 | } |
6728 | ||
963a6417 | 6729 | /* The type of the tag on VAL. */ |
76a01679 | 6730 | |
963a6417 PH |
6731 | struct type * |
6732 | ada_tag_type (struct value *val) | |
96d887e8 | 6733 | { |
df407dfe | 6734 | return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL); |
963a6417 | 6735 | } |
96d887e8 | 6736 | |
b50d69b5 JG |
6737 | /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95, |
6738 | retired at Ada 05). */ | |
6739 | ||
6740 | static int | |
6741 | is_ada95_tag (struct value *tag) | |
6742 | { | |
6743 | return ada_value_struct_elt (tag, "tsd", 1) != NULL; | |
6744 | } | |
6745 | ||
963a6417 | 6746 | /* The value of the tag on VAL. */ |
96d887e8 | 6747 | |
963a6417 PH |
6748 | struct value * |
6749 | ada_value_tag (struct value *val) | |
6750 | { | |
03ee6b2e | 6751 | return ada_value_struct_elt (val, "_tag", 0); |
96d887e8 PH |
6752 | } |
6753 | ||
963a6417 PH |
6754 | /* The value of the tag on the object of type TYPE whose contents are |
6755 | saved at VALADDR, if it is non-null, or is at memory address | |
0963b4bd | 6756 | ADDRESS. */ |
96d887e8 | 6757 | |
963a6417 | 6758 | static struct value * |
10a2c479 | 6759 | value_tag_from_contents_and_address (struct type *type, |
fc1a4b47 | 6760 | const gdb_byte *valaddr, |
963a6417 | 6761 | CORE_ADDR address) |
96d887e8 | 6762 | { |
b5385fc0 | 6763 | int tag_byte_offset; |
963a6417 | 6764 | struct type *tag_type; |
5b4ee69b | 6765 | |
963a6417 | 6766 | if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset, |
52ce6436 | 6767 | NULL, NULL, NULL)) |
96d887e8 | 6768 | { |
fc1a4b47 | 6769 | const gdb_byte *valaddr1 = ((valaddr == NULL) |
10a2c479 AC |
6770 | ? NULL |
6771 | : valaddr + tag_byte_offset); | |
963a6417 | 6772 | CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset; |
96d887e8 | 6773 | |
963a6417 | 6774 | return value_from_contents_and_address (tag_type, valaddr1, address1); |
96d887e8 | 6775 | } |
963a6417 PH |
6776 | return NULL; |
6777 | } | |
96d887e8 | 6778 | |
963a6417 PH |
6779 | static struct type * |
6780 | type_from_tag (struct value *tag) | |
6781 | { | |
6782 | const char *type_name = ada_tag_name (tag); | |
5b4ee69b | 6783 | |
963a6417 PH |
6784 | if (type_name != NULL) |
6785 | return ada_find_any_type (ada_encode (type_name)); | |
6786 | return NULL; | |
6787 | } | |
96d887e8 | 6788 | |
b50d69b5 JG |
6789 | /* Given a value OBJ of a tagged type, return a value of this |
6790 | type at the base address of the object. The base address, as | |
6791 | defined in Ada.Tags, it is the address of the primary tag of | |
6792 | the object, and therefore where the field values of its full | |
6793 | view can be fetched. */ | |
6794 | ||
6795 | struct value * | |
6796 | ada_tag_value_at_base_address (struct value *obj) | |
6797 | { | |
b50d69b5 JG |
6798 | struct value *val; |
6799 | LONGEST offset_to_top = 0; | |
6800 | struct type *ptr_type, *obj_type; | |
6801 | struct value *tag; | |
6802 | CORE_ADDR base_address; | |
6803 | ||
6804 | obj_type = value_type (obj); | |
6805 | ||
6806 | /* It is the responsability of the caller to deref pointers. */ | |
6807 | ||
6808 | if (TYPE_CODE (obj_type) == TYPE_CODE_PTR | |
6809 | || TYPE_CODE (obj_type) == TYPE_CODE_REF) | |
6810 | return obj; | |
6811 | ||
6812 | tag = ada_value_tag (obj); | |
6813 | if (!tag) | |
6814 | return obj; | |
6815 | ||
6816 | /* Base addresses only appeared with Ada 05 and multiple inheritance. */ | |
6817 | ||
6818 | if (is_ada95_tag (tag)) | |
6819 | return obj; | |
6820 | ||
6821 | ptr_type = builtin_type (target_gdbarch ())->builtin_data_ptr; | |
6822 | ptr_type = lookup_pointer_type (ptr_type); | |
6823 | val = value_cast (ptr_type, tag); | |
6824 | if (!val) | |
6825 | return obj; | |
6826 | ||
6827 | /* It is perfectly possible that an exception be raised while | |
6828 | trying to determine the base address, just like for the tag; | |
6829 | see ada_tag_name for more details. We do not print the error | |
6830 | message for the same reason. */ | |
6831 | ||
492d29ea | 6832 | TRY |
b50d69b5 JG |
6833 | { |
6834 | offset_to_top = value_as_long (value_ind (value_ptradd (val, -2))); | |
6835 | } | |
6836 | ||
492d29ea PA |
6837 | CATCH (e, RETURN_MASK_ERROR) |
6838 | { | |
6839 | return obj; | |
6840 | } | |
6841 | END_CATCH | |
b50d69b5 JG |
6842 | |
6843 | /* If offset is null, nothing to do. */ | |
6844 | ||
6845 | if (offset_to_top == 0) | |
6846 | return obj; | |
6847 | ||
6848 | /* -1 is a special case in Ada.Tags; however, what should be done | |
6849 | is not quite clear from the documentation. So do nothing for | |
6850 | now. */ | |
6851 | ||
6852 | if (offset_to_top == -1) | |
6853 | return obj; | |
6854 | ||
6855 | base_address = value_address (obj) - offset_to_top; | |
6856 | tag = value_tag_from_contents_and_address (obj_type, NULL, base_address); | |
6857 | ||
6858 | /* Make sure that we have a proper tag at the new address. | |
6859 | Otherwise, offset_to_top is bogus (which can happen when | |
6860 | the object is not initialized yet). */ | |
6861 | ||
6862 | if (!tag) | |
6863 | return obj; | |
6864 | ||
6865 | obj_type = type_from_tag (tag); | |
6866 | ||
6867 | if (!obj_type) | |
6868 | return obj; | |
6869 | ||
6870 | return value_from_contents_and_address (obj_type, NULL, base_address); | |
6871 | } | |
6872 | ||
1b611343 JB |
6873 | /* Return the "ada__tags__type_specific_data" type. */ |
6874 | ||
6875 | static struct type * | |
6876 | ada_get_tsd_type (struct inferior *inf) | |
963a6417 | 6877 | { |
1b611343 | 6878 | struct ada_inferior_data *data = get_ada_inferior_data (inf); |
4c4b4cd2 | 6879 | |
1b611343 JB |
6880 | if (data->tsd_type == 0) |
6881 | data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data"); | |
6882 | return data->tsd_type; | |
6883 | } | |
529cad9c | 6884 | |
1b611343 JB |
6885 | /* Return the TSD (type-specific data) associated to the given TAG. |
6886 | TAG is assumed to be the tag of a tagged-type entity. | |
529cad9c | 6887 | |
1b611343 | 6888 | May return NULL if we are unable to get the TSD. */ |
4c4b4cd2 | 6889 | |
1b611343 JB |
6890 | static struct value * |
6891 | ada_get_tsd_from_tag (struct value *tag) | |
4c4b4cd2 | 6892 | { |
4c4b4cd2 | 6893 | struct value *val; |
1b611343 | 6894 | struct type *type; |
5b4ee69b | 6895 | |
1b611343 JB |
6896 | /* First option: The TSD is simply stored as a field of our TAG. |
6897 | Only older versions of GNAT would use this format, but we have | |
6898 | to test it first, because there are no visible markers for | |
6899 | the current approach except the absence of that field. */ | |
529cad9c | 6900 | |
1b611343 JB |
6901 | val = ada_value_struct_elt (tag, "tsd", 1); |
6902 | if (val) | |
6903 | return val; | |
e802dbe0 | 6904 | |
1b611343 JB |
6905 | /* Try the second representation for the dispatch table (in which |
6906 | there is no explicit 'tsd' field in the referent of the tag pointer, | |
6907 | and instead the tsd pointer is stored just before the dispatch | |
6908 | table. */ | |
e802dbe0 | 6909 | |
1b611343 JB |
6910 | type = ada_get_tsd_type (current_inferior()); |
6911 | if (type == NULL) | |
6912 | return NULL; | |
6913 | type = lookup_pointer_type (lookup_pointer_type (type)); | |
6914 | val = value_cast (type, tag); | |
6915 | if (val == NULL) | |
6916 | return NULL; | |
6917 | return value_ind (value_ptradd (val, -1)); | |
e802dbe0 JB |
6918 | } |
6919 | ||
1b611343 JB |
6920 | /* Given the TSD of a tag (type-specific data), return a string |
6921 | containing the name of the associated type. | |
6922 | ||
6923 | The returned value is good until the next call. May return NULL | |
6924 | if we are unable to determine the tag name. */ | |
6925 | ||
6926 | static char * | |
6927 | ada_tag_name_from_tsd (struct value *tsd) | |
529cad9c | 6928 | { |
529cad9c PH |
6929 | static char name[1024]; |
6930 | char *p; | |
1b611343 | 6931 | struct value *val; |
529cad9c | 6932 | |
1b611343 | 6933 | val = ada_value_struct_elt (tsd, "expanded_name", 1); |
4c4b4cd2 | 6934 | if (val == NULL) |
1b611343 | 6935 | return NULL; |
4c4b4cd2 PH |
6936 | read_memory_string (value_as_address (val), name, sizeof (name) - 1); |
6937 | for (p = name; *p != '\0'; p += 1) | |
6938 | if (isalpha (*p)) | |
6939 | *p = tolower (*p); | |
1b611343 | 6940 | return name; |
4c4b4cd2 PH |
6941 | } |
6942 | ||
6943 | /* The type name of the dynamic type denoted by the 'tag value TAG, as | |
1b611343 JB |
6944 | a C string. |
6945 | ||
6946 | Return NULL if the TAG is not an Ada tag, or if we were unable to | |
6947 | determine the name of that tag. The result is good until the next | |
6948 | call. */ | |
4c4b4cd2 PH |
6949 | |
6950 | const char * | |
6951 | ada_tag_name (struct value *tag) | |
6952 | { | |
1b611343 | 6953 | char *name = NULL; |
5b4ee69b | 6954 | |
df407dfe | 6955 | if (!ada_is_tag_type (value_type (tag))) |
4c4b4cd2 | 6956 | return NULL; |
1b611343 JB |
6957 | |
6958 | /* It is perfectly possible that an exception be raised while trying | |
6959 | to determine the TAG's name, even under normal circumstances: | |
6960 | The associated variable may be uninitialized or corrupted, for | |
6961 | instance. We do not let any exception propagate past this point. | |
6962 | instead we return NULL. | |
6963 | ||
6964 | We also do not print the error message either (which often is very | |
6965 | low-level (Eg: "Cannot read memory at 0x[...]"), but instead let | |
6966 | the caller print a more meaningful message if necessary. */ | |
492d29ea | 6967 | TRY |
1b611343 JB |
6968 | { |
6969 | struct value *tsd = ada_get_tsd_from_tag (tag); | |
6970 | ||
6971 | if (tsd != NULL) | |
6972 | name = ada_tag_name_from_tsd (tsd); | |
6973 | } | |
492d29ea PA |
6974 | CATCH (e, RETURN_MASK_ERROR) |
6975 | { | |
6976 | } | |
6977 | END_CATCH | |
1b611343 JB |
6978 | |
6979 | return name; | |
4c4b4cd2 PH |
6980 | } |
6981 | ||
6982 | /* The parent type of TYPE, or NULL if none. */ | |
14f9c5c9 | 6983 | |
d2e4a39e | 6984 | struct type * |
ebf56fd3 | 6985 | ada_parent_type (struct type *type) |
14f9c5c9 AS |
6986 | { |
6987 | int i; | |
6988 | ||
61ee279c | 6989 | type = ada_check_typedef (type); |
14f9c5c9 AS |
6990 | |
6991 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT) | |
6992 | return NULL; | |
6993 | ||
6994 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
6995 | if (ada_is_parent_field (type, i)) | |
0c1f74cf JB |
6996 | { |
6997 | struct type *parent_type = TYPE_FIELD_TYPE (type, i); | |
6998 | ||
6999 | /* If the _parent field is a pointer, then dereference it. */ | |
7000 | if (TYPE_CODE (parent_type) == TYPE_CODE_PTR) | |
7001 | parent_type = TYPE_TARGET_TYPE (parent_type); | |
7002 | /* If there is a parallel XVS type, get the actual base type. */ | |
7003 | parent_type = ada_get_base_type (parent_type); | |
7004 | ||
7005 | return ada_check_typedef (parent_type); | |
7006 | } | |
14f9c5c9 AS |
7007 | |
7008 | return NULL; | |
7009 | } | |
7010 | ||
4c4b4cd2 PH |
7011 | /* True iff field number FIELD_NUM of structure type TYPE contains the |
7012 | parent-type (inherited) fields of a derived type. Assumes TYPE is | |
7013 | a structure type with at least FIELD_NUM+1 fields. */ | |
14f9c5c9 AS |
7014 | |
7015 | int | |
ebf56fd3 | 7016 | ada_is_parent_field (struct type *type, int field_num) |
14f9c5c9 | 7017 | { |
61ee279c | 7018 | const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num); |
5b4ee69b | 7019 | |
4c4b4cd2 | 7020 | return (name != NULL |
61012eef GB |
7021 | && (startswith (name, "PARENT") |
7022 | || startswith (name, "_parent"))); | |
14f9c5c9 AS |
7023 | } |
7024 | ||
4c4b4cd2 | 7025 | /* True iff field number FIELD_NUM of structure type TYPE is a |
14f9c5c9 | 7026 | transparent wrapper field (which should be silently traversed when doing |
4c4b4cd2 | 7027 | field selection and flattened when printing). Assumes TYPE is a |
14f9c5c9 | 7028 | structure type with at least FIELD_NUM+1 fields. Such fields are always |
4c4b4cd2 | 7029 | structures. */ |
14f9c5c9 AS |
7030 | |
7031 | int | |
ebf56fd3 | 7032 | ada_is_wrapper_field (struct type *type, int field_num) |
14f9c5c9 | 7033 | { |
d2e4a39e | 7034 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5b4ee69b | 7035 | |
dddc0e16 JB |
7036 | if (name != NULL && strcmp (name, "RETVAL") == 0) |
7037 | { | |
7038 | /* This happens in functions with "out" or "in out" parameters | |
7039 | which are passed by copy. For such functions, GNAT describes | |
7040 | the function's return type as being a struct where the return | |
7041 | value is in a field called RETVAL, and where the other "out" | |
7042 | or "in out" parameters are fields of that struct. This is not | |
7043 | a wrapper. */ | |
7044 | return 0; | |
7045 | } | |
7046 | ||
d2e4a39e | 7047 | return (name != NULL |
61012eef | 7048 | && (startswith (name, "PARENT") |
4c4b4cd2 | 7049 | || strcmp (name, "REP") == 0 |
61012eef | 7050 | || startswith (name, "_parent") |
4c4b4cd2 | 7051 | || name[0] == 'S' || name[0] == 'R' || name[0] == 'O')); |
14f9c5c9 AS |
7052 | } |
7053 | ||
4c4b4cd2 PH |
7054 | /* True iff field number FIELD_NUM of structure or union type TYPE |
7055 | is a variant wrapper. Assumes TYPE is a structure type with at least | |
7056 | FIELD_NUM+1 fields. */ | |
14f9c5c9 AS |
7057 | |
7058 | int | |
ebf56fd3 | 7059 | ada_is_variant_part (struct type *type, int field_num) |
14f9c5c9 | 7060 | { |
d2e4a39e | 7061 | struct type *field_type = TYPE_FIELD_TYPE (type, field_num); |
5b4ee69b | 7062 | |
14f9c5c9 | 7063 | return (TYPE_CODE (field_type) == TYPE_CODE_UNION |
4c4b4cd2 | 7064 | || (is_dynamic_field (type, field_num) |
c3e5cd34 PH |
7065 | && (TYPE_CODE (TYPE_TARGET_TYPE (field_type)) |
7066 | == TYPE_CODE_UNION))); | |
14f9c5c9 AS |
7067 | } |
7068 | ||
7069 | /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part) | |
4c4b4cd2 | 7070 | whose discriminants are contained in the record type OUTER_TYPE, |
7c964f07 UW |
7071 | returns the type of the controlling discriminant for the variant. |
7072 | May return NULL if the type could not be found. */ | |
14f9c5c9 | 7073 | |
d2e4a39e | 7074 | struct type * |
ebf56fd3 | 7075 | ada_variant_discrim_type (struct type *var_type, struct type *outer_type) |
14f9c5c9 | 7076 | { |
d2e4a39e | 7077 | char *name = ada_variant_discrim_name (var_type); |
5b4ee69b | 7078 | |
7c964f07 | 7079 | return ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL); |
14f9c5c9 AS |
7080 | } |
7081 | ||
4c4b4cd2 | 7082 | /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a |
14f9c5c9 | 7083 | valid field number within it, returns 1 iff field FIELD_NUM of TYPE |
4c4b4cd2 | 7084 | represents a 'when others' clause; otherwise 0. */ |
14f9c5c9 AS |
7085 | |
7086 | int | |
ebf56fd3 | 7087 | ada_is_others_clause (struct type *type, int field_num) |
14f9c5c9 | 7088 | { |
d2e4a39e | 7089 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5b4ee69b | 7090 | |
14f9c5c9 AS |
7091 | return (name != NULL && name[0] == 'O'); |
7092 | } | |
7093 | ||
7094 | /* Assuming that TYPE0 is the type of the variant part of a record, | |
4c4b4cd2 PH |
7095 | returns the name of the discriminant controlling the variant. |
7096 | The value is valid until the next call to ada_variant_discrim_name. */ | |
14f9c5c9 | 7097 | |
d2e4a39e | 7098 | char * |
ebf56fd3 | 7099 | ada_variant_discrim_name (struct type *type0) |
14f9c5c9 | 7100 | { |
d2e4a39e | 7101 | static char *result = NULL; |
14f9c5c9 | 7102 | static size_t result_len = 0; |
d2e4a39e AS |
7103 | struct type *type; |
7104 | const char *name; | |
7105 | const char *discrim_end; | |
7106 | const char *discrim_start; | |
14f9c5c9 AS |
7107 | |
7108 | if (TYPE_CODE (type0) == TYPE_CODE_PTR) | |
7109 | type = TYPE_TARGET_TYPE (type0); | |
7110 | else | |
7111 | type = type0; | |
7112 | ||
7113 | name = ada_type_name (type); | |
7114 | ||
7115 | if (name == NULL || name[0] == '\000') | |
7116 | return ""; | |
7117 | ||
7118 | for (discrim_end = name + strlen (name) - 6; discrim_end != name; | |
7119 | discrim_end -= 1) | |
7120 | { | |
61012eef | 7121 | if (startswith (discrim_end, "___XVN")) |
4c4b4cd2 | 7122 | break; |
14f9c5c9 AS |
7123 | } |
7124 | if (discrim_end == name) | |
7125 | return ""; | |
7126 | ||
d2e4a39e | 7127 | for (discrim_start = discrim_end; discrim_start != name + 3; |
14f9c5c9 AS |
7128 | discrim_start -= 1) |
7129 | { | |
d2e4a39e | 7130 | if (discrim_start == name + 1) |
4c4b4cd2 | 7131 | return ""; |
76a01679 | 7132 | if ((discrim_start > name + 3 |
61012eef | 7133 | && startswith (discrim_start - 3, "___")) |
4c4b4cd2 PH |
7134 | || discrim_start[-1] == '.') |
7135 | break; | |
14f9c5c9 AS |
7136 | } |
7137 | ||
7138 | GROW_VECT (result, result_len, discrim_end - discrim_start + 1); | |
7139 | strncpy (result, discrim_start, discrim_end - discrim_start); | |
d2e4a39e | 7140 | result[discrim_end - discrim_start] = '\0'; |
14f9c5c9 AS |
7141 | return result; |
7142 | } | |
7143 | ||
4c4b4cd2 PH |
7144 | /* Scan STR for a subtype-encoded number, beginning at position K. |
7145 | Put the position of the character just past the number scanned in | |
7146 | *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL. | |
7147 | Return 1 if there was a valid number at the given position, and 0 | |
7148 | otherwise. A "subtype-encoded" number consists of the absolute value | |
7149 | in decimal, followed by the letter 'm' to indicate a negative number. | |
7150 | Assumes 0m does not occur. */ | |
14f9c5c9 AS |
7151 | |
7152 | int | |
d2e4a39e | 7153 | ada_scan_number (const char str[], int k, LONGEST * R, int *new_k) |
14f9c5c9 AS |
7154 | { |
7155 | ULONGEST RU; | |
7156 | ||
d2e4a39e | 7157 | if (!isdigit (str[k])) |
14f9c5c9 AS |
7158 | return 0; |
7159 | ||
4c4b4cd2 | 7160 | /* Do it the hard way so as not to make any assumption about |
14f9c5c9 | 7161 | the relationship of unsigned long (%lu scan format code) and |
4c4b4cd2 | 7162 | LONGEST. */ |
14f9c5c9 AS |
7163 | RU = 0; |
7164 | while (isdigit (str[k])) | |
7165 | { | |
d2e4a39e | 7166 | RU = RU * 10 + (str[k] - '0'); |
14f9c5c9 AS |
7167 | k += 1; |
7168 | } | |
7169 | ||
d2e4a39e | 7170 | if (str[k] == 'm') |
14f9c5c9 AS |
7171 | { |
7172 | if (R != NULL) | |
4c4b4cd2 | 7173 | *R = (-(LONGEST) (RU - 1)) - 1; |
14f9c5c9 AS |
7174 | k += 1; |
7175 | } | |
7176 | else if (R != NULL) | |
7177 | *R = (LONGEST) RU; | |
7178 | ||
4c4b4cd2 | 7179 | /* NOTE on the above: Technically, C does not say what the results of |
14f9c5c9 AS |
7180 | - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive |
7181 | number representable as a LONGEST (although either would probably work | |
7182 | in most implementations). When RU>0, the locution in the then branch | |
4c4b4cd2 | 7183 | above is always equivalent to the negative of RU. */ |
14f9c5c9 AS |
7184 | |
7185 | if (new_k != NULL) | |
7186 | *new_k = k; | |
7187 | return 1; | |
7188 | } | |
7189 | ||
4c4b4cd2 PH |
7190 | /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field), |
7191 | and FIELD_NUM is a valid field number within it, returns 1 iff VAL is | |
7192 | in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */ | |
14f9c5c9 | 7193 | |
d2e4a39e | 7194 | int |
ebf56fd3 | 7195 | ada_in_variant (LONGEST val, struct type *type, int field_num) |
14f9c5c9 | 7196 | { |
d2e4a39e | 7197 | const char *name = TYPE_FIELD_NAME (type, field_num); |
14f9c5c9 AS |
7198 | int p; |
7199 | ||
7200 | p = 0; | |
7201 | while (1) | |
7202 | { | |
d2e4a39e | 7203 | switch (name[p]) |
4c4b4cd2 PH |
7204 | { |
7205 | case '\0': | |
7206 | return 0; | |
7207 | case 'S': | |
7208 | { | |
7209 | LONGEST W; | |
5b4ee69b | 7210 | |
4c4b4cd2 PH |
7211 | if (!ada_scan_number (name, p + 1, &W, &p)) |
7212 | return 0; | |
7213 | if (val == W) | |
7214 | return 1; | |
7215 | break; | |
7216 | } | |
7217 | case 'R': | |
7218 | { | |
7219 | LONGEST L, U; | |
5b4ee69b | 7220 | |
4c4b4cd2 PH |
7221 | if (!ada_scan_number (name, p + 1, &L, &p) |
7222 | || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p)) | |
7223 | return 0; | |
7224 | if (val >= L && val <= U) | |
7225 | return 1; | |
7226 | break; | |
7227 | } | |
7228 | case 'O': | |
7229 | return 1; | |
7230 | default: | |
7231 | return 0; | |
7232 | } | |
7233 | } | |
7234 | } | |
7235 | ||
0963b4bd | 7236 | /* FIXME: Lots of redundancy below. Try to consolidate. */ |
4c4b4cd2 PH |
7237 | |
7238 | /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type | |
7239 | ARG_TYPE, extract and return the value of one of its (non-static) | |
7240 | fields. FIELDNO says which field. Differs from value_primitive_field | |
7241 | only in that it can handle packed values of arbitrary type. */ | |
14f9c5c9 | 7242 | |
4c4b4cd2 | 7243 | static struct value * |
d2e4a39e | 7244 | ada_value_primitive_field (struct value *arg1, int offset, int fieldno, |
4c4b4cd2 | 7245 | struct type *arg_type) |
14f9c5c9 | 7246 | { |
14f9c5c9 AS |
7247 | struct type *type; |
7248 | ||
61ee279c | 7249 | arg_type = ada_check_typedef (arg_type); |
14f9c5c9 AS |
7250 | type = TYPE_FIELD_TYPE (arg_type, fieldno); |
7251 | ||
4c4b4cd2 | 7252 | /* Handle packed fields. */ |
14f9c5c9 AS |
7253 | |
7254 | if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0) | |
7255 | { | |
7256 | int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno); | |
7257 | int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno); | |
d2e4a39e | 7258 | |
0fd88904 | 7259 | return ada_value_primitive_packed_val (arg1, value_contents (arg1), |
4c4b4cd2 PH |
7260 | offset + bit_pos / 8, |
7261 | bit_pos % 8, bit_size, type); | |
14f9c5c9 AS |
7262 | } |
7263 | else | |
7264 | return value_primitive_field (arg1, offset, fieldno, arg_type); | |
7265 | } | |
7266 | ||
52ce6436 PH |
7267 | /* Find field with name NAME in object of type TYPE. If found, |
7268 | set the following for each argument that is non-null: | |
7269 | - *FIELD_TYPE_P to the field's type; | |
7270 | - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within | |
7271 | an object of that type; | |
7272 | - *BIT_OFFSET_P to the bit offset modulo byte size of the field; | |
7273 | - *BIT_SIZE_P to its size in bits if the field is packed, and | |
7274 | 0 otherwise; | |
7275 | If INDEX_P is non-null, increment *INDEX_P by the number of source-visible | |
7276 | fields up to but not including the desired field, or by the total | |
7277 | number of fields if not found. A NULL value of NAME never | |
7278 | matches; the function just counts visible fields in this case. | |
7279 | ||
0963b4bd | 7280 | Returns 1 if found, 0 otherwise. */ |
52ce6436 | 7281 | |
4c4b4cd2 | 7282 | static int |
0d5cff50 | 7283 | find_struct_field (const char *name, struct type *type, int offset, |
76a01679 | 7284 | struct type **field_type_p, |
52ce6436 PH |
7285 | int *byte_offset_p, int *bit_offset_p, int *bit_size_p, |
7286 | int *index_p) | |
4c4b4cd2 PH |
7287 | { |
7288 | int i; | |
7289 | ||
61ee279c | 7290 | type = ada_check_typedef (type); |
76a01679 | 7291 | |
52ce6436 PH |
7292 | if (field_type_p != NULL) |
7293 | *field_type_p = NULL; | |
7294 | if (byte_offset_p != NULL) | |
d5d6fca5 | 7295 | *byte_offset_p = 0; |
52ce6436 PH |
7296 | if (bit_offset_p != NULL) |
7297 | *bit_offset_p = 0; | |
7298 | if (bit_size_p != NULL) | |
7299 | *bit_size_p = 0; | |
7300 | ||
7301 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
4c4b4cd2 PH |
7302 | { |
7303 | int bit_pos = TYPE_FIELD_BITPOS (type, i); | |
7304 | int fld_offset = offset + bit_pos / 8; | |
0d5cff50 | 7305 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
76a01679 | 7306 | |
4c4b4cd2 PH |
7307 | if (t_field_name == NULL) |
7308 | continue; | |
7309 | ||
52ce6436 | 7310 | else if (name != NULL && field_name_match (t_field_name, name)) |
76a01679 JB |
7311 | { |
7312 | int bit_size = TYPE_FIELD_BITSIZE (type, i); | |
5b4ee69b | 7313 | |
52ce6436 PH |
7314 | if (field_type_p != NULL) |
7315 | *field_type_p = TYPE_FIELD_TYPE (type, i); | |
7316 | if (byte_offset_p != NULL) | |
7317 | *byte_offset_p = fld_offset; | |
7318 | if (bit_offset_p != NULL) | |
7319 | *bit_offset_p = bit_pos % 8; | |
7320 | if (bit_size_p != NULL) | |
7321 | *bit_size_p = bit_size; | |
76a01679 JB |
7322 | return 1; |
7323 | } | |
4c4b4cd2 PH |
7324 | else if (ada_is_wrapper_field (type, i)) |
7325 | { | |
52ce6436 PH |
7326 | if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset, |
7327 | field_type_p, byte_offset_p, bit_offset_p, | |
7328 | bit_size_p, index_p)) | |
76a01679 JB |
7329 | return 1; |
7330 | } | |
4c4b4cd2 PH |
7331 | else if (ada_is_variant_part (type, i)) |
7332 | { | |
52ce6436 PH |
7333 | /* PNH: Wait. Do we ever execute this section, or is ARG always of |
7334 | fixed type?? */ | |
4c4b4cd2 | 7335 | int j; |
52ce6436 PH |
7336 | struct type *field_type |
7337 | = ada_check_typedef (TYPE_FIELD_TYPE (type, i)); | |
4c4b4cd2 | 7338 | |
52ce6436 | 7339 | for (j = 0; j < TYPE_NFIELDS (field_type); j += 1) |
4c4b4cd2 | 7340 | { |
76a01679 JB |
7341 | if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j), |
7342 | fld_offset | |
7343 | + TYPE_FIELD_BITPOS (field_type, j) / 8, | |
7344 | field_type_p, byte_offset_p, | |
52ce6436 | 7345 | bit_offset_p, bit_size_p, index_p)) |
76a01679 | 7346 | return 1; |
4c4b4cd2 PH |
7347 | } |
7348 | } | |
52ce6436 PH |
7349 | else if (index_p != NULL) |
7350 | *index_p += 1; | |
4c4b4cd2 PH |
7351 | } |
7352 | return 0; | |
7353 | } | |
7354 | ||
0963b4bd | 7355 | /* Number of user-visible fields in record type TYPE. */ |
4c4b4cd2 | 7356 | |
52ce6436 PH |
7357 | static int |
7358 | num_visible_fields (struct type *type) | |
7359 | { | |
7360 | int n; | |
5b4ee69b | 7361 | |
52ce6436 PH |
7362 | n = 0; |
7363 | find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n); | |
7364 | return n; | |
7365 | } | |
14f9c5c9 | 7366 | |
4c4b4cd2 | 7367 | /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes, |
14f9c5c9 AS |
7368 | and search in it assuming it has (class) type TYPE. |
7369 | If found, return value, else return NULL. | |
7370 | ||
4c4b4cd2 | 7371 | Searches recursively through wrapper fields (e.g., '_parent'). */ |
14f9c5c9 | 7372 | |
4c4b4cd2 | 7373 | static struct value * |
108d56a4 | 7374 | ada_search_struct_field (const char *name, struct value *arg, int offset, |
4c4b4cd2 | 7375 | struct type *type) |
14f9c5c9 AS |
7376 | { |
7377 | int i; | |
14f9c5c9 | 7378 | |
5b4ee69b | 7379 | type = ada_check_typedef (type); |
52ce6436 | 7380 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) |
14f9c5c9 | 7381 | { |
0d5cff50 | 7382 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
14f9c5c9 AS |
7383 | |
7384 | if (t_field_name == NULL) | |
4c4b4cd2 | 7385 | continue; |
14f9c5c9 AS |
7386 | |
7387 | else if (field_name_match (t_field_name, name)) | |
4c4b4cd2 | 7388 | return ada_value_primitive_field (arg, offset, i, type); |
14f9c5c9 AS |
7389 | |
7390 | else if (ada_is_wrapper_field (type, i)) | |
4c4b4cd2 | 7391 | { |
0963b4bd | 7392 | struct value *v = /* Do not let indent join lines here. */ |
06d5cf63 JB |
7393 | ada_search_struct_field (name, arg, |
7394 | offset + TYPE_FIELD_BITPOS (type, i) / 8, | |
7395 | TYPE_FIELD_TYPE (type, i)); | |
5b4ee69b | 7396 | |
4c4b4cd2 PH |
7397 | if (v != NULL) |
7398 | return v; | |
7399 | } | |
14f9c5c9 AS |
7400 | |
7401 | else if (ada_is_variant_part (type, i)) | |
4c4b4cd2 | 7402 | { |
0963b4bd | 7403 | /* PNH: Do we ever get here? See find_struct_field. */ |
4c4b4cd2 | 7404 | int j; |
5b4ee69b MS |
7405 | struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, |
7406 | i)); | |
4c4b4cd2 PH |
7407 | int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8; |
7408 | ||
52ce6436 | 7409 | for (j = 0; j < TYPE_NFIELDS (field_type); j += 1) |
4c4b4cd2 | 7410 | { |
0963b4bd MS |
7411 | struct value *v = ada_search_struct_field /* Force line |
7412 | break. */ | |
06d5cf63 JB |
7413 | (name, arg, |
7414 | var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8, | |
7415 | TYPE_FIELD_TYPE (field_type, j)); | |
5b4ee69b | 7416 | |
4c4b4cd2 PH |
7417 | if (v != NULL) |
7418 | return v; | |
7419 | } | |
7420 | } | |
14f9c5c9 AS |
7421 | } |
7422 | return NULL; | |
7423 | } | |
d2e4a39e | 7424 | |
52ce6436 PH |
7425 | static struct value *ada_index_struct_field_1 (int *, struct value *, |
7426 | int, struct type *); | |
7427 | ||
7428 | ||
7429 | /* Return field #INDEX in ARG, where the index is that returned by | |
7430 | * find_struct_field through its INDEX_P argument. Adjust the address | |
7431 | * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE. | |
0963b4bd | 7432 | * If found, return value, else return NULL. */ |
52ce6436 PH |
7433 | |
7434 | static struct value * | |
7435 | ada_index_struct_field (int index, struct value *arg, int offset, | |
7436 | struct type *type) | |
7437 | { | |
7438 | return ada_index_struct_field_1 (&index, arg, offset, type); | |
7439 | } | |
7440 | ||
7441 | ||
7442 | /* Auxiliary function for ada_index_struct_field. Like | |
7443 | * ada_index_struct_field, but takes index from *INDEX_P and modifies | |
0963b4bd | 7444 | * *INDEX_P. */ |
52ce6436 PH |
7445 | |
7446 | static struct value * | |
7447 | ada_index_struct_field_1 (int *index_p, struct value *arg, int offset, | |
7448 | struct type *type) | |
7449 | { | |
7450 | int i; | |
7451 | type = ada_check_typedef (type); | |
7452 | ||
7453 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
7454 | { | |
7455 | if (TYPE_FIELD_NAME (type, i) == NULL) | |
7456 | continue; | |
7457 | else if (ada_is_wrapper_field (type, i)) | |
7458 | { | |
0963b4bd | 7459 | struct value *v = /* Do not let indent join lines here. */ |
52ce6436 PH |
7460 | ada_index_struct_field_1 (index_p, arg, |
7461 | offset + TYPE_FIELD_BITPOS (type, i) / 8, | |
7462 | TYPE_FIELD_TYPE (type, i)); | |
5b4ee69b | 7463 | |
52ce6436 PH |
7464 | if (v != NULL) |
7465 | return v; | |
7466 | } | |
7467 | ||
7468 | else if (ada_is_variant_part (type, i)) | |
7469 | { | |
7470 | /* PNH: Do we ever get here? See ada_search_struct_field, | |
0963b4bd | 7471 | find_struct_field. */ |
52ce6436 PH |
7472 | error (_("Cannot assign this kind of variant record")); |
7473 | } | |
7474 | else if (*index_p == 0) | |
7475 | return ada_value_primitive_field (arg, offset, i, type); | |
7476 | else | |
7477 | *index_p -= 1; | |
7478 | } | |
7479 | return NULL; | |
7480 | } | |
7481 | ||
4c4b4cd2 PH |
7482 | /* Given ARG, a value of type (pointer or reference to a)* |
7483 | structure/union, extract the component named NAME from the ultimate | |
7484 | target structure/union and return it as a value with its | |
f5938064 | 7485 | appropriate type. |
14f9c5c9 | 7486 | |
4c4b4cd2 PH |
7487 | The routine searches for NAME among all members of the structure itself |
7488 | and (recursively) among all members of any wrapper members | |
14f9c5c9 AS |
7489 | (e.g., '_parent'). |
7490 | ||
03ee6b2e PH |
7491 | If NO_ERR, then simply return NULL in case of error, rather than |
7492 | calling error. */ | |
14f9c5c9 | 7493 | |
d2e4a39e | 7494 | struct value * |
03ee6b2e | 7495 | ada_value_struct_elt (struct value *arg, char *name, int no_err) |
14f9c5c9 | 7496 | { |
4c4b4cd2 | 7497 | struct type *t, *t1; |
d2e4a39e | 7498 | struct value *v; |
14f9c5c9 | 7499 | |
4c4b4cd2 | 7500 | v = NULL; |
df407dfe | 7501 | t1 = t = ada_check_typedef (value_type (arg)); |
4c4b4cd2 PH |
7502 | if (TYPE_CODE (t) == TYPE_CODE_REF) |
7503 | { | |
7504 | t1 = TYPE_TARGET_TYPE (t); | |
7505 | if (t1 == NULL) | |
03ee6b2e | 7506 | goto BadValue; |
61ee279c | 7507 | t1 = ada_check_typedef (t1); |
4c4b4cd2 | 7508 | if (TYPE_CODE (t1) == TYPE_CODE_PTR) |
76a01679 | 7509 | { |
994b9211 | 7510 | arg = coerce_ref (arg); |
76a01679 JB |
7511 | t = t1; |
7512 | } | |
4c4b4cd2 | 7513 | } |
14f9c5c9 | 7514 | |
4c4b4cd2 PH |
7515 | while (TYPE_CODE (t) == TYPE_CODE_PTR) |
7516 | { | |
7517 | t1 = TYPE_TARGET_TYPE (t); | |
7518 | if (t1 == NULL) | |
03ee6b2e | 7519 | goto BadValue; |
61ee279c | 7520 | t1 = ada_check_typedef (t1); |
4c4b4cd2 | 7521 | if (TYPE_CODE (t1) == TYPE_CODE_PTR) |
76a01679 JB |
7522 | { |
7523 | arg = value_ind (arg); | |
7524 | t = t1; | |
7525 | } | |
4c4b4cd2 | 7526 | else |
76a01679 | 7527 | break; |
4c4b4cd2 | 7528 | } |
14f9c5c9 | 7529 | |
4c4b4cd2 | 7530 | if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION) |
03ee6b2e | 7531 | goto BadValue; |
14f9c5c9 | 7532 | |
4c4b4cd2 PH |
7533 | if (t1 == t) |
7534 | v = ada_search_struct_field (name, arg, 0, t); | |
7535 | else | |
7536 | { | |
7537 | int bit_offset, bit_size, byte_offset; | |
7538 | struct type *field_type; | |
7539 | CORE_ADDR address; | |
7540 | ||
76a01679 | 7541 | if (TYPE_CODE (t) == TYPE_CODE_PTR) |
b50d69b5 | 7542 | address = value_address (ada_value_ind (arg)); |
4c4b4cd2 | 7543 | else |
b50d69b5 | 7544 | address = value_address (ada_coerce_ref (arg)); |
14f9c5c9 | 7545 | |
1ed6ede0 | 7546 | t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1); |
76a01679 JB |
7547 | if (find_struct_field (name, t1, 0, |
7548 | &field_type, &byte_offset, &bit_offset, | |
52ce6436 | 7549 | &bit_size, NULL)) |
76a01679 JB |
7550 | { |
7551 | if (bit_size != 0) | |
7552 | { | |
714e53ab PH |
7553 | if (TYPE_CODE (t) == TYPE_CODE_REF) |
7554 | arg = ada_coerce_ref (arg); | |
7555 | else | |
7556 | arg = ada_value_ind (arg); | |
76a01679 JB |
7557 | v = ada_value_primitive_packed_val (arg, NULL, byte_offset, |
7558 | bit_offset, bit_size, | |
7559 | field_type); | |
7560 | } | |
7561 | else | |
f5938064 | 7562 | v = value_at_lazy (field_type, address + byte_offset); |
76a01679 JB |
7563 | } |
7564 | } | |
7565 | ||
03ee6b2e PH |
7566 | if (v != NULL || no_err) |
7567 | return v; | |
7568 | else | |
323e0a4a | 7569 | error (_("There is no member named %s."), name); |
14f9c5c9 | 7570 | |
03ee6b2e PH |
7571 | BadValue: |
7572 | if (no_err) | |
7573 | return NULL; | |
7574 | else | |
0963b4bd MS |
7575 | error (_("Attempt to extract a component of " |
7576 | "a value that is not a record.")); | |
14f9c5c9 AS |
7577 | } |
7578 | ||
7579 | /* Given a type TYPE, look up the type of the component of type named NAME. | |
4c4b4cd2 PH |
7580 | If DISPP is non-null, add its byte displacement from the beginning of a |
7581 | structure (pointed to by a value) of type TYPE to *DISPP (does not | |
14f9c5c9 AS |
7582 | work for packed fields). |
7583 | ||
7584 | Matches any field whose name has NAME as a prefix, possibly | |
4c4b4cd2 | 7585 | followed by "___". |
14f9c5c9 | 7586 | |
0963b4bd | 7587 | TYPE can be either a struct or union. If REFOK, TYPE may also |
4c4b4cd2 PH |
7588 | be a (pointer or reference)+ to a struct or union, and the |
7589 | ultimate target type will be searched. | |
14f9c5c9 AS |
7590 | |
7591 | Looks recursively into variant clauses and parent types. | |
7592 | ||
4c4b4cd2 PH |
7593 | If NOERR is nonzero, return NULL if NAME is not suitably defined or |
7594 | TYPE is not a type of the right kind. */ | |
14f9c5c9 | 7595 | |
4c4b4cd2 | 7596 | static struct type * |
76a01679 JB |
7597 | ada_lookup_struct_elt_type (struct type *type, char *name, int refok, |
7598 | int noerr, int *dispp) | |
14f9c5c9 AS |
7599 | { |
7600 | int i; | |
7601 | ||
7602 | if (name == NULL) | |
7603 | goto BadName; | |
7604 | ||
76a01679 | 7605 | if (refok && type != NULL) |
4c4b4cd2 PH |
7606 | while (1) |
7607 | { | |
61ee279c | 7608 | type = ada_check_typedef (type); |
76a01679 JB |
7609 | if (TYPE_CODE (type) != TYPE_CODE_PTR |
7610 | && TYPE_CODE (type) != TYPE_CODE_REF) | |
7611 | break; | |
7612 | type = TYPE_TARGET_TYPE (type); | |
4c4b4cd2 | 7613 | } |
14f9c5c9 | 7614 | |
76a01679 | 7615 | if (type == NULL |
1265e4aa JB |
7616 | || (TYPE_CODE (type) != TYPE_CODE_STRUCT |
7617 | && TYPE_CODE (type) != TYPE_CODE_UNION)) | |
14f9c5c9 | 7618 | { |
4c4b4cd2 | 7619 | if (noerr) |
76a01679 | 7620 | return NULL; |
4c4b4cd2 | 7621 | else |
76a01679 JB |
7622 | { |
7623 | target_terminal_ours (); | |
7624 | gdb_flush (gdb_stdout); | |
323e0a4a AC |
7625 | if (type == NULL) |
7626 | error (_("Type (null) is not a structure or union type")); | |
7627 | else | |
7628 | { | |
7629 | /* XXX: type_sprint */ | |
7630 | fprintf_unfiltered (gdb_stderr, _("Type ")); | |
7631 | type_print (type, "", gdb_stderr, -1); | |
7632 | error (_(" is not a structure or union type")); | |
7633 | } | |
76a01679 | 7634 | } |
14f9c5c9 AS |
7635 | } |
7636 | ||
7637 | type = to_static_fixed_type (type); | |
7638 | ||
7639 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
7640 | { | |
0d5cff50 | 7641 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
14f9c5c9 AS |
7642 | struct type *t; |
7643 | int disp; | |
d2e4a39e | 7644 | |
14f9c5c9 | 7645 | if (t_field_name == NULL) |
4c4b4cd2 | 7646 | continue; |
14f9c5c9 AS |
7647 | |
7648 | else if (field_name_match (t_field_name, name)) | |
4c4b4cd2 PH |
7649 | { |
7650 | if (dispp != NULL) | |
7651 | *dispp += TYPE_FIELD_BITPOS (type, i) / 8; | |
460efde1 | 7652 | return TYPE_FIELD_TYPE (type, i); |
4c4b4cd2 | 7653 | } |
14f9c5c9 AS |
7654 | |
7655 | else if (ada_is_wrapper_field (type, i)) | |
4c4b4cd2 PH |
7656 | { |
7657 | disp = 0; | |
7658 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name, | |
7659 | 0, 1, &disp); | |
7660 | if (t != NULL) | |
7661 | { | |
7662 | if (dispp != NULL) | |
7663 | *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8; | |
7664 | return t; | |
7665 | } | |
7666 | } | |
14f9c5c9 AS |
7667 | |
7668 | else if (ada_is_variant_part (type, i)) | |
4c4b4cd2 PH |
7669 | { |
7670 | int j; | |
5b4ee69b MS |
7671 | struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, |
7672 | i)); | |
4c4b4cd2 PH |
7673 | |
7674 | for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1) | |
7675 | { | |
b1f33ddd JB |
7676 | /* FIXME pnh 2008/01/26: We check for a field that is |
7677 | NOT wrapped in a struct, since the compiler sometimes | |
7678 | generates these for unchecked variant types. Revisit | |
0963b4bd | 7679 | if the compiler changes this practice. */ |
0d5cff50 | 7680 | const char *v_field_name = TYPE_FIELD_NAME (field_type, j); |
4c4b4cd2 | 7681 | disp = 0; |
b1f33ddd JB |
7682 | if (v_field_name != NULL |
7683 | && field_name_match (v_field_name, name)) | |
460efde1 | 7684 | t = TYPE_FIELD_TYPE (field_type, j); |
b1f33ddd | 7685 | else |
0963b4bd MS |
7686 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, |
7687 | j), | |
b1f33ddd JB |
7688 | name, 0, 1, &disp); |
7689 | ||
4c4b4cd2 PH |
7690 | if (t != NULL) |
7691 | { | |
7692 | if (dispp != NULL) | |
7693 | *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8; | |
7694 | return t; | |
7695 | } | |
7696 | } | |
7697 | } | |
14f9c5c9 AS |
7698 | |
7699 | } | |
7700 | ||
7701 | BadName: | |
d2e4a39e | 7702 | if (!noerr) |
14f9c5c9 AS |
7703 | { |
7704 | target_terminal_ours (); | |
7705 | gdb_flush (gdb_stdout); | |
323e0a4a AC |
7706 | if (name == NULL) |
7707 | { | |
7708 | /* XXX: type_sprint */ | |
7709 | fprintf_unfiltered (gdb_stderr, _("Type ")); | |
7710 | type_print (type, "", gdb_stderr, -1); | |
7711 | error (_(" has no component named <null>")); | |
7712 | } | |
7713 | else | |
7714 | { | |
7715 | /* XXX: type_sprint */ | |
7716 | fprintf_unfiltered (gdb_stderr, _("Type ")); | |
7717 | type_print (type, "", gdb_stderr, -1); | |
7718 | error (_(" has no component named %s"), name); | |
7719 | } | |
14f9c5c9 AS |
7720 | } |
7721 | ||
7722 | return NULL; | |
7723 | } | |
7724 | ||
b1f33ddd JB |
7725 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), |
7726 | within a value of type OUTER_TYPE, return true iff VAR_TYPE | |
7727 | represents an unchecked union (that is, the variant part of a | |
0963b4bd | 7728 | record that is named in an Unchecked_Union pragma). */ |
b1f33ddd JB |
7729 | |
7730 | static int | |
7731 | is_unchecked_variant (struct type *var_type, struct type *outer_type) | |
7732 | { | |
7733 | char *discrim_name = ada_variant_discrim_name (var_type); | |
5b4ee69b | 7734 | |
b1f33ddd JB |
7735 | return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL) |
7736 | == NULL); | |
7737 | } | |
7738 | ||
7739 | ||
14f9c5c9 AS |
7740 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), |
7741 | within a value of type OUTER_TYPE that is stored in GDB at | |
4c4b4cd2 PH |
7742 | OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE, |
7743 | numbering from 0) is applicable. Returns -1 if none are. */ | |
14f9c5c9 | 7744 | |
d2e4a39e | 7745 | int |
ebf56fd3 | 7746 | ada_which_variant_applies (struct type *var_type, struct type *outer_type, |
fc1a4b47 | 7747 | const gdb_byte *outer_valaddr) |
14f9c5c9 AS |
7748 | { |
7749 | int others_clause; | |
7750 | int i; | |
d2e4a39e | 7751 | char *discrim_name = ada_variant_discrim_name (var_type); |
0c281816 JB |
7752 | struct value *outer; |
7753 | struct value *discrim; | |
14f9c5c9 AS |
7754 | LONGEST discrim_val; |
7755 | ||
012370f6 TT |
7756 | /* Using plain value_from_contents_and_address here causes problems |
7757 | because we will end up trying to resolve a type that is currently | |
7758 | being constructed. */ | |
7759 | outer = value_from_contents_and_address_unresolved (outer_type, | |
7760 | outer_valaddr, 0); | |
0c281816 JB |
7761 | discrim = ada_value_struct_elt (outer, discrim_name, 1); |
7762 | if (discrim == NULL) | |
14f9c5c9 | 7763 | return -1; |
0c281816 | 7764 | discrim_val = value_as_long (discrim); |
14f9c5c9 AS |
7765 | |
7766 | others_clause = -1; | |
7767 | for (i = 0; i < TYPE_NFIELDS (var_type); i += 1) | |
7768 | { | |
7769 | if (ada_is_others_clause (var_type, i)) | |
4c4b4cd2 | 7770 | others_clause = i; |
14f9c5c9 | 7771 | else if (ada_in_variant (discrim_val, var_type, i)) |
4c4b4cd2 | 7772 | return i; |
14f9c5c9 AS |
7773 | } |
7774 | ||
7775 | return others_clause; | |
7776 | } | |
d2e4a39e | 7777 | \f |
14f9c5c9 AS |
7778 | |
7779 | ||
4c4b4cd2 | 7780 | /* Dynamic-Sized Records */ |
14f9c5c9 AS |
7781 | |
7782 | /* Strategy: The type ostensibly attached to a value with dynamic size | |
7783 | (i.e., a size that is not statically recorded in the debugging | |
7784 | data) does not accurately reflect the size or layout of the value. | |
7785 | Our strategy is to convert these values to values with accurate, | |
4c4b4cd2 | 7786 | conventional types that are constructed on the fly. */ |
14f9c5c9 AS |
7787 | |
7788 | /* There is a subtle and tricky problem here. In general, we cannot | |
7789 | determine the size of dynamic records without its data. However, | |
7790 | the 'struct value' data structure, which GDB uses to represent | |
7791 | quantities in the inferior process (the target), requires the size | |
7792 | of the type at the time of its allocation in order to reserve space | |
7793 | for GDB's internal copy of the data. That's why the | |
7794 | 'to_fixed_xxx_type' routines take (target) addresses as parameters, | |
4c4b4cd2 | 7795 | rather than struct value*s. |
14f9c5c9 AS |
7796 | |
7797 | However, GDB's internal history variables ($1, $2, etc.) are | |
7798 | struct value*s containing internal copies of the data that are not, in | |
7799 | general, the same as the data at their corresponding addresses in | |
7800 | the target. Fortunately, the types we give to these values are all | |
7801 | conventional, fixed-size types (as per the strategy described | |
7802 | above), so that we don't usually have to perform the | |
7803 | 'to_fixed_xxx_type' conversions to look at their values. | |
7804 | Unfortunately, there is one exception: if one of the internal | |
7805 | history variables is an array whose elements are unconstrained | |
7806 | records, then we will need to create distinct fixed types for each | |
7807 | element selected. */ | |
7808 | ||
7809 | /* The upshot of all of this is that many routines take a (type, host | |
7810 | address, target address) triple as arguments to represent a value. | |
7811 | The host address, if non-null, is supposed to contain an internal | |
7812 | copy of the relevant data; otherwise, the program is to consult the | |
4c4b4cd2 | 7813 | target at the target address. */ |
14f9c5c9 AS |
7814 | |
7815 | /* Assuming that VAL0 represents a pointer value, the result of | |
7816 | dereferencing it. Differs from value_ind in its treatment of | |
4c4b4cd2 | 7817 | dynamic-sized types. */ |
14f9c5c9 | 7818 | |
d2e4a39e AS |
7819 | struct value * |
7820 | ada_value_ind (struct value *val0) | |
14f9c5c9 | 7821 | { |
c48db5ca | 7822 | struct value *val = value_ind (val0); |
5b4ee69b | 7823 | |
b50d69b5 JG |
7824 | if (ada_is_tagged_type (value_type (val), 0)) |
7825 | val = ada_tag_value_at_base_address (val); | |
7826 | ||
4c4b4cd2 | 7827 | return ada_to_fixed_value (val); |
14f9c5c9 AS |
7828 | } |
7829 | ||
7830 | /* The value resulting from dereferencing any "reference to" | |
4c4b4cd2 PH |
7831 | qualifiers on VAL0. */ |
7832 | ||
d2e4a39e AS |
7833 | static struct value * |
7834 | ada_coerce_ref (struct value *val0) | |
7835 | { | |
df407dfe | 7836 | if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF) |
d2e4a39e AS |
7837 | { |
7838 | struct value *val = val0; | |
5b4ee69b | 7839 | |
994b9211 | 7840 | val = coerce_ref (val); |
b50d69b5 JG |
7841 | |
7842 | if (ada_is_tagged_type (value_type (val), 0)) | |
7843 | val = ada_tag_value_at_base_address (val); | |
7844 | ||
4c4b4cd2 | 7845 | return ada_to_fixed_value (val); |
d2e4a39e AS |
7846 | } |
7847 | else | |
14f9c5c9 AS |
7848 | return val0; |
7849 | } | |
7850 | ||
7851 | /* Return OFF rounded upward if necessary to a multiple of | |
4c4b4cd2 | 7852 | ALIGNMENT (a power of 2). */ |
14f9c5c9 AS |
7853 | |
7854 | static unsigned int | |
ebf56fd3 | 7855 | align_value (unsigned int off, unsigned int alignment) |
14f9c5c9 AS |
7856 | { |
7857 | return (off + alignment - 1) & ~(alignment - 1); | |
7858 | } | |
7859 | ||
4c4b4cd2 | 7860 | /* Return the bit alignment required for field #F of template type TYPE. */ |
14f9c5c9 AS |
7861 | |
7862 | static unsigned int | |
ebf56fd3 | 7863 | field_alignment (struct type *type, int f) |
14f9c5c9 | 7864 | { |
d2e4a39e | 7865 | const char *name = TYPE_FIELD_NAME (type, f); |
64a1bf19 | 7866 | int len; |
14f9c5c9 AS |
7867 | int align_offset; |
7868 | ||
64a1bf19 JB |
7869 | /* The field name should never be null, unless the debugging information |
7870 | is somehow malformed. In this case, we assume the field does not | |
7871 | require any alignment. */ | |
7872 | if (name == NULL) | |
7873 | return 1; | |
7874 | ||
7875 | len = strlen (name); | |
7876 | ||
4c4b4cd2 PH |
7877 | if (!isdigit (name[len - 1])) |
7878 | return 1; | |
14f9c5c9 | 7879 | |
d2e4a39e | 7880 | if (isdigit (name[len - 2])) |
14f9c5c9 AS |
7881 | align_offset = len - 2; |
7882 | else | |
7883 | align_offset = len - 1; | |
7884 | ||
61012eef | 7885 | if (align_offset < 7 || !startswith (name + align_offset - 6, "___XV")) |
14f9c5c9 AS |
7886 | return TARGET_CHAR_BIT; |
7887 | ||
4c4b4cd2 PH |
7888 | return atoi (name + align_offset) * TARGET_CHAR_BIT; |
7889 | } | |
7890 | ||
852dff6c | 7891 | /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */ |
4c4b4cd2 | 7892 | |
852dff6c JB |
7893 | static struct symbol * |
7894 | ada_find_any_type_symbol (const char *name) | |
4c4b4cd2 PH |
7895 | { |
7896 | struct symbol *sym; | |
7897 | ||
7898 | sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN); | |
4186eb54 | 7899 | if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF) |
4c4b4cd2 PH |
7900 | return sym; |
7901 | ||
4186eb54 KS |
7902 | sym = standard_lookup (name, NULL, STRUCT_DOMAIN); |
7903 | return sym; | |
14f9c5c9 AS |
7904 | } |
7905 | ||
dddfab26 UW |
7906 | /* Find a type named NAME. Ignores ambiguity. This routine will look |
7907 | solely for types defined by debug info, it will not search the GDB | |
7908 | primitive types. */ | |
4c4b4cd2 | 7909 | |
852dff6c | 7910 | static struct type * |
ebf56fd3 | 7911 | ada_find_any_type (const char *name) |
14f9c5c9 | 7912 | { |
852dff6c | 7913 | struct symbol *sym = ada_find_any_type_symbol (name); |
14f9c5c9 | 7914 | |
14f9c5c9 | 7915 | if (sym != NULL) |
dddfab26 | 7916 | return SYMBOL_TYPE (sym); |
14f9c5c9 | 7917 | |
dddfab26 | 7918 | return NULL; |
14f9c5c9 AS |
7919 | } |
7920 | ||
739593e0 JB |
7921 | /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol |
7922 | associated with NAME_SYM's name. NAME_SYM may itself be a renaming | |
7923 | symbol, in which case it is returned. Otherwise, this looks for | |
7924 | symbols whose name is that of NAME_SYM suffixed with "___XR". | |
7925 | Return symbol if found, and NULL otherwise. */ | |
4c4b4cd2 PH |
7926 | |
7927 | struct symbol * | |
270140bd | 7928 | ada_find_renaming_symbol (struct symbol *name_sym, const struct block *block) |
aeb5907d | 7929 | { |
739593e0 | 7930 | const char *name = SYMBOL_LINKAGE_NAME (name_sym); |
aeb5907d JB |
7931 | struct symbol *sym; |
7932 | ||
739593e0 JB |
7933 | if (strstr (name, "___XR") != NULL) |
7934 | return name_sym; | |
7935 | ||
aeb5907d JB |
7936 | sym = find_old_style_renaming_symbol (name, block); |
7937 | ||
7938 | if (sym != NULL) | |
7939 | return sym; | |
7940 | ||
0963b4bd | 7941 | /* Not right yet. FIXME pnh 7/20/2007. */ |
852dff6c | 7942 | sym = ada_find_any_type_symbol (name); |
aeb5907d JB |
7943 | if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL) |
7944 | return sym; | |
7945 | else | |
7946 | return NULL; | |
7947 | } | |
7948 | ||
7949 | static struct symbol * | |
270140bd | 7950 | find_old_style_renaming_symbol (const char *name, const struct block *block) |
4c4b4cd2 | 7951 | { |
7f0df278 | 7952 | const struct symbol *function_sym = block_linkage_function (block); |
4c4b4cd2 PH |
7953 | char *rename; |
7954 | ||
7955 | if (function_sym != NULL) | |
7956 | { | |
7957 | /* If the symbol is defined inside a function, NAME is not fully | |
7958 | qualified. This means we need to prepend the function name | |
7959 | as well as adding the ``___XR'' suffix to build the name of | |
7960 | the associated renaming symbol. */ | |
0d5cff50 | 7961 | const char *function_name = SYMBOL_LINKAGE_NAME (function_sym); |
529cad9c PH |
7962 | /* Function names sometimes contain suffixes used |
7963 | for instance to qualify nested subprograms. When building | |
7964 | the XR type name, we need to make sure that this suffix is | |
7965 | not included. So do not include any suffix in the function | |
7966 | name length below. */ | |
69fadcdf | 7967 | int function_name_len = ada_name_prefix_len (function_name); |
76a01679 JB |
7968 | const int rename_len = function_name_len + 2 /* "__" */ |
7969 | + strlen (name) + 6 /* "___XR\0" */ ; | |
4c4b4cd2 | 7970 | |
529cad9c | 7971 | /* Strip the suffix if necessary. */ |
69fadcdf JB |
7972 | ada_remove_trailing_digits (function_name, &function_name_len); |
7973 | ada_remove_po_subprogram_suffix (function_name, &function_name_len); | |
7974 | ada_remove_Xbn_suffix (function_name, &function_name_len); | |
529cad9c | 7975 | |
4c4b4cd2 PH |
7976 | /* Library-level functions are a special case, as GNAT adds |
7977 | a ``_ada_'' prefix to the function name to avoid namespace | |
aeb5907d | 7978 | pollution. However, the renaming symbols themselves do not |
4c4b4cd2 PH |
7979 | have this prefix, so we need to skip this prefix if present. */ |
7980 | if (function_name_len > 5 /* "_ada_" */ | |
7981 | && strstr (function_name, "_ada_") == function_name) | |
69fadcdf JB |
7982 | { |
7983 | function_name += 5; | |
7984 | function_name_len -= 5; | |
7985 | } | |
4c4b4cd2 PH |
7986 | |
7987 | rename = (char *) alloca (rename_len * sizeof (char)); | |
69fadcdf JB |
7988 | strncpy (rename, function_name, function_name_len); |
7989 | xsnprintf (rename + function_name_len, rename_len - function_name_len, | |
7990 | "__%s___XR", name); | |
4c4b4cd2 PH |
7991 | } |
7992 | else | |
7993 | { | |
7994 | const int rename_len = strlen (name) + 6; | |
5b4ee69b | 7995 | |
4c4b4cd2 | 7996 | rename = (char *) alloca (rename_len * sizeof (char)); |
88c15c34 | 7997 | xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name); |
4c4b4cd2 PH |
7998 | } |
7999 | ||
852dff6c | 8000 | return ada_find_any_type_symbol (rename); |
4c4b4cd2 PH |
8001 | } |
8002 | ||
14f9c5c9 | 8003 | /* Because of GNAT encoding conventions, several GDB symbols may match a |
4c4b4cd2 | 8004 | given type name. If the type denoted by TYPE0 is to be preferred to |
14f9c5c9 | 8005 | that of TYPE1 for purposes of type printing, return non-zero; |
4c4b4cd2 PH |
8006 | otherwise return 0. */ |
8007 | ||
14f9c5c9 | 8008 | int |
d2e4a39e | 8009 | ada_prefer_type (struct type *type0, struct type *type1) |
14f9c5c9 AS |
8010 | { |
8011 | if (type1 == NULL) | |
8012 | return 1; | |
8013 | else if (type0 == NULL) | |
8014 | return 0; | |
8015 | else if (TYPE_CODE (type1) == TYPE_CODE_VOID) | |
8016 | return 1; | |
8017 | else if (TYPE_CODE (type0) == TYPE_CODE_VOID) | |
8018 | return 0; | |
4c4b4cd2 PH |
8019 | else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL) |
8020 | return 1; | |
ad82864c | 8021 | else if (ada_is_constrained_packed_array_type (type0)) |
14f9c5c9 | 8022 | return 1; |
4c4b4cd2 PH |
8023 | else if (ada_is_array_descriptor_type (type0) |
8024 | && !ada_is_array_descriptor_type (type1)) | |
14f9c5c9 | 8025 | return 1; |
aeb5907d JB |
8026 | else |
8027 | { | |
8028 | const char *type0_name = type_name_no_tag (type0); | |
8029 | const char *type1_name = type_name_no_tag (type1); | |
8030 | ||
8031 | if (type0_name != NULL && strstr (type0_name, "___XR") != NULL | |
8032 | && (type1_name == NULL || strstr (type1_name, "___XR") == NULL)) | |
8033 | return 1; | |
8034 | } | |
14f9c5c9 AS |
8035 | return 0; |
8036 | } | |
8037 | ||
8038 | /* The name of TYPE, which is either its TYPE_NAME, or, if that is | |
4c4b4cd2 PH |
8039 | null, its TYPE_TAG_NAME. Null if TYPE is null. */ |
8040 | ||
0d5cff50 | 8041 | const char * |
d2e4a39e | 8042 | ada_type_name (struct type *type) |
14f9c5c9 | 8043 | { |
d2e4a39e | 8044 | if (type == NULL) |
14f9c5c9 AS |
8045 | return NULL; |
8046 | else if (TYPE_NAME (type) != NULL) | |
8047 | return TYPE_NAME (type); | |
8048 | else | |
8049 | return TYPE_TAG_NAME (type); | |
8050 | } | |
8051 | ||
b4ba55a1 JB |
8052 | /* Search the list of "descriptive" types associated to TYPE for a type |
8053 | whose name is NAME. */ | |
8054 | ||
8055 | static struct type * | |
8056 | find_parallel_type_by_descriptive_type (struct type *type, const char *name) | |
8057 | { | |
931e5bc3 | 8058 | struct type *result, *tmp; |
b4ba55a1 | 8059 | |
c6044dd1 JB |
8060 | if (ada_ignore_descriptive_types_p) |
8061 | return NULL; | |
8062 | ||
b4ba55a1 JB |
8063 | /* If there no descriptive-type info, then there is no parallel type |
8064 | to be found. */ | |
8065 | if (!HAVE_GNAT_AUX_INFO (type)) | |
8066 | return NULL; | |
8067 | ||
8068 | result = TYPE_DESCRIPTIVE_TYPE (type); | |
8069 | while (result != NULL) | |
8070 | { | |
0d5cff50 | 8071 | const char *result_name = ada_type_name (result); |
b4ba55a1 JB |
8072 | |
8073 | if (result_name == NULL) | |
8074 | { | |
8075 | warning (_("unexpected null name on descriptive type")); | |
8076 | return NULL; | |
8077 | } | |
8078 | ||
8079 | /* If the names match, stop. */ | |
8080 | if (strcmp (result_name, name) == 0) | |
8081 | break; | |
8082 | ||
8083 | /* Otherwise, look at the next item on the list, if any. */ | |
8084 | if (HAVE_GNAT_AUX_INFO (result)) | |
931e5bc3 JG |
8085 | tmp = TYPE_DESCRIPTIVE_TYPE (result); |
8086 | else | |
8087 | tmp = NULL; | |
8088 | ||
8089 | /* If not found either, try after having resolved the typedef. */ | |
8090 | if (tmp != NULL) | |
8091 | result = tmp; | |
b4ba55a1 | 8092 | else |
931e5bc3 | 8093 | { |
f168693b | 8094 | result = check_typedef (result); |
931e5bc3 JG |
8095 | if (HAVE_GNAT_AUX_INFO (result)) |
8096 | result = TYPE_DESCRIPTIVE_TYPE (result); | |
8097 | else | |
8098 | result = NULL; | |
8099 | } | |
b4ba55a1 JB |
8100 | } |
8101 | ||
8102 | /* If we didn't find a match, see whether this is a packed array. With | |
8103 | older compilers, the descriptive type information is either absent or | |
8104 | irrelevant when it comes to packed arrays so the above lookup fails. | |
8105 | Fall back to using a parallel lookup by name in this case. */ | |
12ab9e09 | 8106 | if (result == NULL && ada_is_constrained_packed_array_type (type)) |
b4ba55a1 JB |
8107 | return ada_find_any_type (name); |
8108 | ||
8109 | return result; | |
8110 | } | |
8111 | ||
8112 | /* Find a parallel type to TYPE with the specified NAME, using the | |
8113 | descriptive type taken from the debugging information, if available, | |
8114 | and otherwise using the (slower) name-based method. */ | |
8115 | ||
8116 | static struct type * | |
8117 | ada_find_parallel_type_with_name (struct type *type, const char *name) | |
8118 | { | |
8119 | struct type *result = NULL; | |
8120 | ||
8121 | if (HAVE_GNAT_AUX_INFO (type)) | |
8122 | result = find_parallel_type_by_descriptive_type (type, name); | |
8123 | else | |
8124 | result = ada_find_any_type (name); | |
8125 | ||
8126 | return result; | |
8127 | } | |
8128 | ||
8129 | /* Same as above, but specify the name of the parallel type by appending | |
4c4b4cd2 | 8130 | SUFFIX to the name of TYPE. */ |
14f9c5c9 | 8131 | |
d2e4a39e | 8132 | struct type * |
ebf56fd3 | 8133 | ada_find_parallel_type (struct type *type, const char *suffix) |
14f9c5c9 | 8134 | { |
0d5cff50 | 8135 | char *name; |
fe978cb0 | 8136 | const char *type_name = ada_type_name (type); |
14f9c5c9 | 8137 | int len; |
d2e4a39e | 8138 | |
fe978cb0 | 8139 | if (type_name == NULL) |
14f9c5c9 AS |
8140 | return NULL; |
8141 | ||
fe978cb0 | 8142 | len = strlen (type_name); |
14f9c5c9 | 8143 | |
b4ba55a1 | 8144 | name = (char *) alloca (len + strlen (suffix) + 1); |
14f9c5c9 | 8145 | |
fe978cb0 | 8146 | strcpy (name, type_name); |
14f9c5c9 AS |
8147 | strcpy (name + len, suffix); |
8148 | ||
b4ba55a1 | 8149 | return ada_find_parallel_type_with_name (type, name); |
14f9c5c9 AS |
8150 | } |
8151 | ||
14f9c5c9 | 8152 | /* If TYPE is a variable-size record type, return the corresponding template |
4c4b4cd2 | 8153 | type describing its fields. Otherwise, return NULL. */ |
14f9c5c9 | 8154 | |
d2e4a39e AS |
8155 | static struct type * |
8156 | dynamic_template_type (struct type *type) | |
14f9c5c9 | 8157 | { |
61ee279c | 8158 | type = ada_check_typedef (type); |
14f9c5c9 AS |
8159 | |
8160 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT | |
d2e4a39e | 8161 | || ada_type_name (type) == NULL) |
14f9c5c9 | 8162 | return NULL; |
d2e4a39e | 8163 | else |
14f9c5c9 AS |
8164 | { |
8165 | int len = strlen (ada_type_name (type)); | |
5b4ee69b | 8166 | |
4c4b4cd2 PH |
8167 | if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0) |
8168 | return type; | |
14f9c5c9 | 8169 | else |
4c4b4cd2 | 8170 | return ada_find_parallel_type (type, "___XVE"); |
14f9c5c9 AS |
8171 | } |
8172 | } | |
8173 | ||
8174 | /* Assuming that TEMPL_TYPE is a union or struct type, returns | |
4c4b4cd2 | 8175 | non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */ |
14f9c5c9 | 8176 | |
d2e4a39e AS |
8177 | static int |
8178 | is_dynamic_field (struct type *templ_type, int field_num) | |
14f9c5c9 AS |
8179 | { |
8180 | const char *name = TYPE_FIELD_NAME (templ_type, field_num); | |
5b4ee69b | 8181 | |
d2e4a39e | 8182 | return name != NULL |
14f9c5c9 AS |
8183 | && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR |
8184 | && strstr (name, "___XVL") != NULL; | |
8185 | } | |
8186 | ||
4c4b4cd2 PH |
8187 | /* The index of the variant field of TYPE, or -1 if TYPE does not |
8188 | represent a variant record type. */ | |
14f9c5c9 | 8189 | |
d2e4a39e | 8190 | static int |
4c4b4cd2 | 8191 | variant_field_index (struct type *type) |
14f9c5c9 AS |
8192 | { |
8193 | int f; | |
8194 | ||
4c4b4cd2 PH |
8195 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT) |
8196 | return -1; | |
8197 | ||
8198 | for (f = 0; f < TYPE_NFIELDS (type); f += 1) | |
8199 | { | |
8200 | if (ada_is_variant_part (type, f)) | |
8201 | return f; | |
8202 | } | |
8203 | return -1; | |
14f9c5c9 AS |
8204 | } |
8205 | ||
4c4b4cd2 PH |
8206 | /* A record type with no fields. */ |
8207 | ||
d2e4a39e | 8208 | static struct type * |
fe978cb0 | 8209 | empty_record (struct type *templ) |
14f9c5c9 | 8210 | { |
fe978cb0 | 8211 | struct type *type = alloc_type_copy (templ); |
5b4ee69b | 8212 | |
14f9c5c9 AS |
8213 | TYPE_CODE (type) = TYPE_CODE_STRUCT; |
8214 | TYPE_NFIELDS (type) = 0; | |
8215 | TYPE_FIELDS (type) = NULL; | |
b1f33ddd | 8216 | INIT_CPLUS_SPECIFIC (type); |
14f9c5c9 AS |
8217 | TYPE_NAME (type) = "<empty>"; |
8218 | TYPE_TAG_NAME (type) = NULL; | |
14f9c5c9 AS |
8219 | TYPE_LENGTH (type) = 0; |
8220 | return type; | |
8221 | } | |
8222 | ||
8223 | /* An ordinary record type (with fixed-length fields) that describes | |
4c4b4cd2 PH |
8224 | the value of type TYPE at VALADDR or ADDRESS (see comments at |
8225 | the beginning of this section) VAL according to GNAT conventions. | |
8226 | DVAL0 should describe the (portion of a) record that contains any | |
df407dfe | 8227 | necessary discriminants. It should be NULL if value_type (VAL) is |
14f9c5c9 AS |
8228 | an outer-level type (i.e., as opposed to a branch of a variant.) A |
8229 | variant field (unless unchecked) is replaced by a particular branch | |
4c4b4cd2 | 8230 | of the variant. |
14f9c5c9 | 8231 | |
4c4b4cd2 PH |
8232 | If not KEEP_DYNAMIC_FIELDS, then all fields whose position or |
8233 | length are not statically known are discarded. As a consequence, | |
8234 | VALADDR, ADDRESS and DVAL0 are ignored. | |
8235 | ||
8236 | NOTE: Limitations: For now, we assume that dynamic fields and | |
8237 | variants occupy whole numbers of bytes. However, they need not be | |
8238 | byte-aligned. */ | |
8239 | ||
8240 | struct type * | |
10a2c479 | 8241 | ada_template_to_fixed_record_type_1 (struct type *type, |
fc1a4b47 | 8242 | const gdb_byte *valaddr, |
4c4b4cd2 PH |
8243 | CORE_ADDR address, struct value *dval0, |
8244 | int keep_dynamic_fields) | |
14f9c5c9 | 8245 | { |
d2e4a39e AS |
8246 | struct value *mark = value_mark (); |
8247 | struct value *dval; | |
8248 | struct type *rtype; | |
14f9c5c9 | 8249 | int nfields, bit_len; |
4c4b4cd2 | 8250 | int variant_field; |
14f9c5c9 | 8251 | long off; |
d94e4f4f | 8252 | int fld_bit_len; |
14f9c5c9 AS |
8253 | int f; |
8254 | ||
4c4b4cd2 PH |
8255 | /* Compute the number of fields in this record type that are going |
8256 | to be processed: unless keep_dynamic_fields, this includes only | |
8257 | fields whose position and length are static will be processed. */ | |
8258 | if (keep_dynamic_fields) | |
8259 | nfields = TYPE_NFIELDS (type); | |
8260 | else | |
8261 | { | |
8262 | nfields = 0; | |
76a01679 | 8263 | while (nfields < TYPE_NFIELDS (type) |
4c4b4cd2 PH |
8264 | && !ada_is_variant_part (type, nfields) |
8265 | && !is_dynamic_field (type, nfields)) | |
8266 | nfields++; | |
8267 | } | |
8268 | ||
e9bb382b | 8269 | rtype = alloc_type_copy (type); |
14f9c5c9 AS |
8270 | TYPE_CODE (rtype) = TYPE_CODE_STRUCT; |
8271 | INIT_CPLUS_SPECIFIC (rtype); | |
8272 | TYPE_NFIELDS (rtype) = nfields; | |
d2e4a39e | 8273 | TYPE_FIELDS (rtype) = (struct field *) |
14f9c5c9 AS |
8274 | TYPE_ALLOC (rtype, nfields * sizeof (struct field)); |
8275 | memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields); | |
8276 | TYPE_NAME (rtype) = ada_type_name (type); | |
8277 | TYPE_TAG_NAME (rtype) = NULL; | |
876cecd0 | 8278 | TYPE_FIXED_INSTANCE (rtype) = 1; |
14f9c5c9 | 8279 | |
d2e4a39e AS |
8280 | off = 0; |
8281 | bit_len = 0; | |
4c4b4cd2 PH |
8282 | variant_field = -1; |
8283 | ||
14f9c5c9 AS |
8284 | for (f = 0; f < nfields; f += 1) |
8285 | { | |
6c038f32 PH |
8286 | off = align_value (off, field_alignment (type, f)) |
8287 | + TYPE_FIELD_BITPOS (type, f); | |
945b3a32 | 8288 | SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off); |
d2e4a39e | 8289 | TYPE_FIELD_BITSIZE (rtype, f) = 0; |
14f9c5c9 | 8290 | |
d2e4a39e | 8291 | if (ada_is_variant_part (type, f)) |
4c4b4cd2 PH |
8292 | { |
8293 | variant_field = f; | |
d94e4f4f | 8294 | fld_bit_len = 0; |
4c4b4cd2 | 8295 | } |
14f9c5c9 | 8296 | else if (is_dynamic_field (type, f)) |
4c4b4cd2 | 8297 | { |
284614f0 JB |
8298 | const gdb_byte *field_valaddr = valaddr; |
8299 | CORE_ADDR field_address = address; | |
8300 | struct type *field_type = | |
8301 | TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f)); | |
8302 | ||
4c4b4cd2 | 8303 | if (dval0 == NULL) |
b5304971 JG |
8304 | { |
8305 | /* rtype's length is computed based on the run-time | |
8306 | value of discriminants. If the discriminants are not | |
8307 | initialized, the type size may be completely bogus and | |
0963b4bd | 8308 | GDB may fail to allocate a value for it. So check the |
b5304971 | 8309 | size first before creating the value. */ |
c1b5a1a6 | 8310 | ada_ensure_varsize_limit (rtype); |
012370f6 TT |
8311 | /* Using plain value_from_contents_and_address here |
8312 | causes problems because we will end up trying to | |
8313 | resolve a type that is currently being | |
8314 | constructed. */ | |
8315 | dval = value_from_contents_and_address_unresolved (rtype, | |
8316 | valaddr, | |
8317 | address); | |
9f1f738a | 8318 | rtype = value_type (dval); |
b5304971 | 8319 | } |
4c4b4cd2 PH |
8320 | else |
8321 | dval = dval0; | |
8322 | ||
284614f0 JB |
8323 | /* If the type referenced by this field is an aligner type, we need |
8324 | to unwrap that aligner type, because its size might not be set. | |
8325 | Keeping the aligner type would cause us to compute the wrong | |
8326 | size for this field, impacting the offset of the all the fields | |
8327 | that follow this one. */ | |
8328 | if (ada_is_aligner_type (field_type)) | |
8329 | { | |
8330 | long field_offset = TYPE_FIELD_BITPOS (field_type, f); | |
8331 | ||
8332 | field_valaddr = cond_offset_host (field_valaddr, field_offset); | |
8333 | field_address = cond_offset_target (field_address, field_offset); | |
8334 | field_type = ada_aligned_type (field_type); | |
8335 | } | |
8336 | ||
8337 | field_valaddr = cond_offset_host (field_valaddr, | |
8338 | off / TARGET_CHAR_BIT); | |
8339 | field_address = cond_offset_target (field_address, | |
8340 | off / TARGET_CHAR_BIT); | |
8341 | ||
8342 | /* Get the fixed type of the field. Note that, in this case, | |
8343 | we do not want to get the real type out of the tag: if | |
8344 | the current field is the parent part of a tagged record, | |
8345 | we will get the tag of the object. Clearly wrong: the real | |
8346 | type of the parent is not the real type of the child. We | |
8347 | would end up in an infinite loop. */ | |
8348 | field_type = ada_get_base_type (field_type); | |
8349 | field_type = ada_to_fixed_type (field_type, field_valaddr, | |
8350 | field_address, dval, 0); | |
27f2a97b JB |
8351 | /* If the field size is already larger than the maximum |
8352 | object size, then the record itself will necessarily | |
8353 | be larger than the maximum object size. We need to make | |
8354 | this check now, because the size might be so ridiculously | |
8355 | large (due to an uninitialized variable in the inferior) | |
8356 | that it would cause an overflow when adding it to the | |
8357 | record size. */ | |
c1b5a1a6 | 8358 | ada_ensure_varsize_limit (field_type); |
284614f0 JB |
8359 | |
8360 | TYPE_FIELD_TYPE (rtype, f) = field_type; | |
4c4b4cd2 | 8361 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
27f2a97b JB |
8362 | /* The multiplication can potentially overflow. But because |
8363 | the field length has been size-checked just above, and | |
8364 | assuming that the maximum size is a reasonable value, | |
8365 | an overflow should not happen in practice. So rather than | |
8366 | adding overflow recovery code to this already complex code, | |
8367 | we just assume that it's not going to happen. */ | |
d94e4f4f | 8368 | fld_bit_len = |
4c4b4cd2 PH |
8369 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT; |
8370 | } | |
14f9c5c9 | 8371 | else |
4c4b4cd2 | 8372 | { |
5ded5331 JB |
8373 | /* Note: If this field's type is a typedef, it is important |
8374 | to preserve the typedef layer. | |
8375 | ||
8376 | Otherwise, we might be transforming a typedef to a fat | |
8377 | pointer (encoding a pointer to an unconstrained array), | |
8378 | into a basic fat pointer (encoding an unconstrained | |
8379 | array). As both types are implemented using the same | |
8380 | structure, the typedef is the only clue which allows us | |
8381 | to distinguish between the two options. Stripping it | |
8382 | would prevent us from printing this field appropriately. */ | |
8383 | TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f); | |
4c4b4cd2 PH |
8384 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
8385 | if (TYPE_FIELD_BITSIZE (type, f) > 0) | |
d94e4f4f | 8386 | fld_bit_len = |
4c4b4cd2 PH |
8387 | TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f); |
8388 | else | |
5ded5331 JB |
8389 | { |
8390 | struct type *field_type = TYPE_FIELD_TYPE (type, f); | |
8391 | ||
8392 | /* We need to be careful of typedefs when computing | |
8393 | the length of our field. If this is a typedef, | |
8394 | get the length of the target type, not the length | |
8395 | of the typedef. */ | |
8396 | if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF) | |
8397 | field_type = ada_typedef_target_type (field_type); | |
8398 | ||
8399 | fld_bit_len = | |
8400 | TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT; | |
8401 | } | |
4c4b4cd2 | 8402 | } |
14f9c5c9 | 8403 | if (off + fld_bit_len > bit_len) |
4c4b4cd2 | 8404 | bit_len = off + fld_bit_len; |
d94e4f4f | 8405 | off += fld_bit_len; |
4c4b4cd2 PH |
8406 | TYPE_LENGTH (rtype) = |
8407 | align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT; | |
14f9c5c9 | 8408 | } |
4c4b4cd2 PH |
8409 | |
8410 | /* We handle the variant part, if any, at the end because of certain | |
b1f33ddd | 8411 | odd cases in which it is re-ordered so as NOT to be the last field of |
4c4b4cd2 PH |
8412 | the record. This can happen in the presence of representation |
8413 | clauses. */ | |
8414 | if (variant_field >= 0) | |
8415 | { | |
8416 | struct type *branch_type; | |
8417 | ||
8418 | off = TYPE_FIELD_BITPOS (rtype, variant_field); | |
8419 | ||
8420 | if (dval0 == NULL) | |
9f1f738a | 8421 | { |
012370f6 TT |
8422 | /* Using plain value_from_contents_and_address here causes |
8423 | problems because we will end up trying to resolve a type | |
8424 | that is currently being constructed. */ | |
8425 | dval = value_from_contents_and_address_unresolved (rtype, valaddr, | |
8426 | address); | |
9f1f738a SA |
8427 | rtype = value_type (dval); |
8428 | } | |
4c4b4cd2 PH |
8429 | else |
8430 | dval = dval0; | |
8431 | ||
8432 | branch_type = | |
8433 | to_fixed_variant_branch_type | |
8434 | (TYPE_FIELD_TYPE (type, variant_field), | |
8435 | cond_offset_host (valaddr, off / TARGET_CHAR_BIT), | |
8436 | cond_offset_target (address, off / TARGET_CHAR_BIT), dval); | |
8437 | if (branch_type == NULL) | |
8438 | { | |
8439 | for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1) | |
8440 | TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f]; | |
8441 | TYPE_NFIELDS (rtype) -= 1; | |
8442 | } | |
8443 | else | |
8444 | { | |
8445 | TYPE_FIELD_TYPE (rtype, variant_field) = branch_type; | |
8446 | TYPE_FIELD_NAME (rtype, variant_field) = "S"; | |
8447 | fld_bit_len = | |
8448 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) * | |
8449 | TARGET_CHAR_BIT; | |
8450 | if (off + fld_bit_len > bit_len) | |
8451 | bit_len = off + fld_bit_len; | |
8452 | TYPE_LENGTH (rtype) = | |
8453 | align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT; | |
8454 | } | |
8455 | } | |
8456 | ||
714e53ab PH |
8457 | /* According to exp_dbug.ads, the size of TYPE for variable-size records |
8458 | should contain the alignment of that record, which should be a strictly | |
8459 | positive value. If null or negative, then something is wrong, most | |
8460 | probably in the debug info. In that case, we don't round up the size | |
0963b4bd | 8461 | of the resulting type. If this record is not part of another structure, |
714e53ab PH |
8462 | the current RTYPE length might be good enough for our purposes. */ |
8463 | if (TYPE_LENGTH (type) <= 0) | |
8464 | { | |
323e0a4a AC |
8465 | if (TYPE_NAME (rtype)) |
8466 | warning (_("Invalid type size for `%s' detected: %d."), | |
8467 | TYPE_NAME (rtype), TYPE_LENGTH (type)); | |
8468 | else | |
8469 | warning (_("Invalid type size for <unnamed> detected: %d."), | |
8470 | TYPE_LENGTH (type)); | |
714e53ab PH |
8471 | } |
8472 | else | |
8473 | { | |
8474 | TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype), | |
8475 | TYPE_LENGTH (type)); | |
8476 | } | |
14f9c5c9 AS |
8477 | |
8478 | value_free_to_mark (mark); | |
d2e4a39e | 8479 | if (TYPE_LENGTH (rtype) > varsize_limit) |
323e0a4a | 8480 | error (_("record type with dynamic size is larger than varsize-limit")); |
14f9c5c9 AS |
8481 | return rtype; |
8482 | } | |
8483 | ||
4c4b4cd2 PH |
8484 | /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS |
8485 | of 1. */ | |
14f9c5c9 | 8486 | |
d2e4a39e | 8487 | static struct type * |
fc1a4b47 | 8488 | template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr, |
4c4b4cd2 PH |
8489 | CORE_ADDR address, struct value *dval0) |
8490 | { | |
8491 | return ada_template_to_fixed_record_type_1 (type, valaddr, | |
8492 | address, dval0, 1); | |
8493 | } | |
8494 | ||
8495 | /* An ordinary record type in which ___XVL-convention fields and | |
8496 | ___XVU- and ___XVN-convention field types in TYPE0 are replaced with | |
8497 | static approximations, containing all possible fields. Uses | |
8498 | no runtime values. Useless for use in values, but that's OK, | |
8499 | since the results are used only for type determinations. Works on both | |
8500 | structs and unions. Representation note: to save space, we memorize | |
8501 | the result of this function in the TYPE_TARGET_TYPE of the | |
8502 | template type. */ | |
8503 | ||
8504 | static struct type * | |
8505 | template_to_static_fixed_type (struct type *type0) | |
14f9c5c9 AS |
8506 | { |
8507 | struct type *type; | |
8508 | int nfields; | |
8509 | int f; | |
8510 | ||
9e195661 PMR |
8511 | /* No need no do anything if the input type is already fixed. */ |
8512 | if (TYPE_FIXED_INSTANCE (type0)) | |
8513 | return type0; | |
8514 | ||
8515 | /* Likewise if we already have computed the static approximation. */ | |
4c4b4cd2 PH |
8516 | if (TYPE_TARGET_TYPE (type0) != NULL) |
8517 | return TYPE_TARGET_TYPE (type0); | |
8518 | ||
9e195661 | 8519 | /* Don't clone TYPE0 until we are sure we are going to need a copy. */ |
4c4b4cd2 | 8520 | type = type0; |
9e195661 PMR |
8521 | nfields = TYPE_NFIELDS (type0); |
8522 | ||
8523 | /* Whether or not we cloned TYPE0, cache the result so that we don't do | |
8524 | recompute all over next time. */ | |
8525 | TYPE_TARGET_TYPE (type0) = type; | |
14f9c5c9 AS |
8526 | |
8527 | for (f = 0; f < nfields; f += 1) | |
8528 | { | |
460efde1 | 8529 | struct type *field_type = TYPE_FIELD_TYPE (type0, f); |
4c4b4cd2 | 8530 | struct type *new_type; |
14f9c5c9 | 8531 | |
4c4b4cd2 | 8532 | if (is_dynamic_field (type0, f)) |
460efde1 JB |
8533 | { |
8534 | field_type = ada_check_typedef (field_type); | |
8535 | new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type)); | |
8536 | } | |
14f9c5c9 | 8537 | else |
f192137b | 8538 | new_type = static_unwrap_type (field_type); |
9e195661 PMR |
8539 | |
8540 | if (new_type != field_type) | |
8541 | { | |
8542 | /* Clone TYPE0 only the first time we get a new field type. */ | |
8543 | if (type == type0) | |
8544 | { | |
8545 | TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0); | |
8546 | TYPE_CODE (type) = TYPE_CODE (type0); | |
8547 | INIT_CPLUS_SPECIFIC (type); | |
8548 | TYPE_NFIELDS (type) = nfields; | |
8549 | TYPE_FIELDS (type) = (struct field *) | |
8550 | TYPE_ALLOC (type, nfields * sizeof (struct field)); | |
8551 | memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0), | |
8552 | sizeof (struct field) * nfields); | |
8553 | TYPE_NAME (type) = ada_type_name (type0); | |
8554 | TYPE_TAG_NAME (type) = NULL; | |
8555 | TYPE_FIXED_INSTANCE (type) = 1; | |
8556 | TYPE_LENGTH (type) = 0; | |
8557 | } | |
8558 | TYPE_FIELD_TYPE (type, f) = new_type; | |
8559 | TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f); | |
8560 | } | |
14f9c5c9 | 8561 | } |
9e195661 | 8562 | |
14f9c5c9 AS |
8563 | return type; |
8564 | } | |
8565 | ||
4c4b4cd2 | 8566 | /* Given an object of type TYPE whose contents are at VALADDR and |
5823c3ef JB |
8567 | whose address in memory is ADDRESS, returns a revision of TYPE, |
8568 | which should be a non-dynamic-sized record, in which the variant | |
8569 | part, if any, is replaced with the appropriate branch. Looks | |
4c4b4cd2 PH |
8570 | for discriminant values in DVAL0, which can be NULL if the record |
8571 | contains the necessary discriminant values. */ | |
8572 | ||
d2e4a39e | 8573 | static struct type * |
fc1a4b47 | 8574 | to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr, |
4c4b4cd2 | 8575 | CORE_ADDR address, struct value *dval0) |
14f9c5c9 | 8576 | { |
d2e4a39e | 8577 | struct value *mark = value_mark (); |
4c4b4cd2 | 8578 | struct value *dval; |
d2e4a39e | 8579 | struct type *rtype; |
14f9c5c9 AS |
8580 | struct type *branch_type; |
8581 | int nfields = TYPE_NFIELDS (type); | |
4c4b4cd2 | 8582 | int variant_field = variant_field_index (type); |
14f9c5c9 | 8583 | |
4c4b4cd2 | 8584 | if (variant_field == -1) |
14f9c5c9 AS |
8585 | return type; |
8586 | ||
4c4b4cd2 | 8587 | if (dval0 == NULL) |
9f1f738a SA |
8588 | { |
8589 | dval = value_from_contents_and_address (type, valaddr, address); | |
8590 | type = value_type (dval); | |
8591 | } | |
4c4b4cd2 PH |
8592 | else |
8593 | dval = dval0; | |
8594 | ||
e9bb382b | 8595 | rtype = alloc_type_copy (type); |
14f9c5c9 | 8596 | TYPE_CODE (rtype) = TYPE_CODE_STRUCT; |
4c4b4cd2 PH |
8597 | INIT_CPLUS_SPECIFIC (rtype); |
8598 | TYPE_NFIELDS (rtype) = nfields; | |
d2e4a39e AS |
8599 | TYPE_FIELDS (rtype) = |
8600 | (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field)); | |
8601 | memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type), | |
4c4b4cd2 | 8602 | sizeof (struct field) * nfields); |
14f9c5c9 AS |
8603 | TYPE_NAME (rtype) = ada_type_name (type); |
8604 | TYPE_TAG_NAME (rtype) = NULL; | |
876cecd0 | 8605 | TYPE_FIXED_INSTANCE (rtype) = 1; |
14f9c5c9 AS |
8606 | TYPE_LENGTH (rtype) = TYPE_LENGTH (type); |
8607 | ||
4c4b4cd2 PH |
8608 | branch_type = to_fixed_variant_branch_type |
8609 | (TYPE_FIELD_TYPE (type, variant_field), | |
d2e4a39e | 8610 | cond_offset_host (valaddr, |
4c4b4cd2 PH |
8611 | TYPE_FIELD_BITPOS (type, variant_field) |
8612 | / TARGET_CHAR_BIT), | |
d2e4a39e | 8613 | cond_offset_target (address, |
4c4b4cd2 PH |
8614 | TYPE_FIELD_BITPOS (type, variant_field) |
8615 | / TARGET_CHAR_BIT), dval); | |
d2e4a39e | 8616 | if (branch_type == NULL) |
14f9c5c9 | 8617 | { |
4c4b4cd2 | 8618 | int f; |
5b4ee69b | 8619 | |
4c4b4cd2 PH |
8620 | for (f = variant_field + 1; f < nfields; f += 1) |
8621 | TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f]; | |
14f9c5c9 | 8622 | TYPE_NFIELDS (rtype) -= 1; |
14f9c5c9 AS |
8623 | } |
8624 | else | |
8625 | { | |
4c4b4cd2 PH |
8626 | TYPE_FIELD_TYPE (rtype, variant_field) = branch_type; |
8627 | TYPE_FIELD_NAME (rtype, variant_field) = "S"; | |
8628 | TYPE_FIELD_BITSIZE (rtype, variant_field) = 0; | |
14f9c5c9 | 8629 | TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type); |
14f9c5c9 | 8630 | } |
4c4b4cd2 | 8631 | TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field)); |
d2e4a39e | 8632 | |
4c4b4cd2 | 8633 | value_free_to_mark (mark); |
14f9c5c9 AS |
8634 | return rtype; |
8635 | } | |
8636 | ||
8637 | /* An ordinary record type (with fixed-length fields) that describes | |
8638 | the value at (TYPE0, VALADDR, ADDRESS) [see explanation at | |
8639 | beginning of this section]. Any necessary discriminants' values | |
4c4b4cd2 PH |
8640 | should be in DVAL, a record value; it may be NULL if the object |
8641 | at ADDR itself contains any necessary discriminant values. | |
8642 | Additionally, VALADDR and ADDRESS may also be NULL if no discriminant | |
8643 | values from the record are needed. Except in the case that DVAL, | |
8644 | VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless | |
8645 | unchecked) is replaced by a particular branch of the variant. | |
8646 | ||
8647 | NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0 | |
8648 | is questionable and may be removed. It can arise during the | |
8649 | processing of an unconstrained-array-of-record type where all the | |
8650 | variant branches have exactly the same size. This is because in | |
8651 | such cases, the compiler does not bother to use the XVS convention | |
8652 | when encoding the record. I am currently dubious of this | |
8653 | shortcut and suspect the compiler should be altered. FIXME. */ | |
14f9c5c9 | 8654 | |
d2e4a39e | 8655 | static struct type * |
fc1a4b47 | 8656 | to_fixed_record_type (struct type *type0, const gdb_byte *valaddr, |
4c4b4cd2 | 8657 | CORE_ADDR address, struct value *dval) |
14f9c5c9 | 8658 | { |
d2e4a39e | 8659 | struct type *templ_type; |
14f9c5c9 | 8660 | |
876cecd0 | 8661 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 PH |
8662 | return type0; |
8663 | ||
d2e4a39e | 8664 | templ_type = dynamic_template_type (type0); |
14f9c5c9 AS |
8665 | |
8666 | if (templ_type != NULL) | |
8667 | return template_to_fixed_record_type (templ_type, valaddr, address, dval); | |
4c4b4cd2 PH |
8668 | else if (variant_field_index (type0) >= 0) |
8669 | { | |
8670 | if (dval == NULL && valaddr == NULL && address == 0) | |
8671 | return type0; | |
8672 | return to_record_with_fixed_variant_part (type0, valaddr, address, | |
8673 | dval); | |
8674 | } | |
14f9c5c9 AS |
8675 | else |
8676 | { | |
876cecd0 | 8677 | TYPE_FIXED_INSTANCE (type0) = 1; |
14f9c5c9 AS |
8678 | return type0; |
8679 | } | |
8680 | ||
8681 | } | |
8682 | ||
8683 | /* An ordinary record type (with fixed-length fields) that describes | |
8684 | the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a | |
8685 | union type. Any necessary discriminants' values should be in DVAL, | |
8686 | a record value. That is, this routine selects the appropriate | |
8687 | branch of the union at ADDR according to the discriminant value | |
b1f33ddd | 8688 | indicated in the union's type name. Returns VAR_TYPE0 itself if |
0963b4bd | 8689 | it represents a variant subject to a pragma Unchecked_Union. */ |
14f9c5c9 | 8690 | |
d2e4a39e | 8691 | static struct type * |
fc1a4b47 | 8692 | to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr, |
4c4b4cd2 | 8693 | CORE_ADDR address, struct value *dval) |
14f9c5c9 AS |
8694 | { |
8695 | int which; | |
d2e4a39e AS |
8696 | struct type *templ_type; |
8697 | struct type *var_type; | |
14f9c5c9 AS |
8698 | |
8699 | if (TYPE_CODE (var_type0) == TYPE_CODE_PTR) | |
8700 | var_type = TYPE_TARGET_TYPE (var_type0); | |
d2e4a39e | 8701 | else |
14f9c5c9 AS |
8702 | var_type = var_type0; |
8703 | ||
8704 | templ_type = ada_find_parallel_type (var_type, "___XVU"); | |
8705 | ||
8706 | if (templ_type != NULL) | |
8707 | var_type = templ_type; | |
8708 | ||
b1f33ddd JB |
8709 | if (is_unchecked_variant (var_type, value_type (dval))) |
8710 | return var_type0; | |
d2e4a39e AS |
8711 | which = |
8712 | ada_which_variant_applies (var_type, | |
0fd88904 | 8713 | value_type (dval), value_contents (dval)); |
14f9c5c9 AS |
8714 | |
8715 | if (which < 0) | |
e9bb382b | 8716 | return empty_record (var_type); |
14f9c5c9 | 8717 | else if (is_dynamic_field (var_type, which)) |
4c4b4cd2 | 8718 | return to_fixed_record_type |
d2e4a39e AS |
8719 | (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)), |
8720 | valaddr, address, dval); | |
4c4b4cd2 | 8721 | else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0) |
d2e4a39e AS |
8722 | return |
8723 | to_fixed_record_type | |
8724 | (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval); | |
14f9c5c9 AS |
8725 | else |
8726 | return TYPE_FIELD_TYPE (var_type, which); | |
8727 | } | |
8728 | ||
8908fca5 JB |
8729 | /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if |
8730 | ENCODING_TYPE, a type following the GNAT conventions for discrete | |
8731 | type encodings, only carries redundant information. */ | |
8732 | ||
8733 | static int | |
8734 | ada_is_redundant_range_encoding (struct type *range_type, | |
8735 | struct type *encoding_type) | |
8736 | { | |
8737 | struct type *fixed_range_type; | |
108d56a4 | 8738 | const char *bounds_str; |
8908fca5 JB |
8739 | int n; |
8740 | LONGEST lo, hi; | |
8741 | ||
8742 | gdb_assert (TYPE_CODE (range_type) == TYPE_CODE_RANGE); | |
8743 | ||
005e2509 JB |
8744 | if (TYPE_CODE (get_base_type (range_type)) |
8745 | != TYPE_CODE (get_base_type (encoding_type))) | |
8746 | { | |
8747 | /* The compiler probably used a simple base type to describe | |
8748 | the range type instead of the range's actual base type, | |
8749 | expecting us to get the real base type from the encoding | |
8750 | anyway. In this situation, the encoding cannot be ignored | |
8751 | as redundant. */ | |
8752 | return 0; | |
8753 | } | |
8754 | ||
8908fca5 JB |
8755 | if (is_dynamic_type (range_type)) |
8756 | return 0; | |
8757 | ||
8758 | if (TYPE_NAME (encoding_type) == NULL) | |
8759 | return 0; | |
8760 | ||
8761 | bounds_str = strstr (TYPE_NAME (encoding_type), "___XDLU_"); | |
8762 | if (bounds_str == NULL) | |
8763 | return 0; | |
8764 | ||
8765 | n = 8; /* Skip "___XDLU_". */ | |
8766 | if (!ada_scan_number (bounds_str, n, &lo, &n)) | |
8767 | return 0; | |
8768 | if (TYPE_LOW_BOUND (range_type) != lo) | |
8769 | return 0; | |
8770 | ||
8771 | n += 2; /* Skip the "__" separator between the two bounds. */ | |
8772 | if (!ada_scan_number (bounds_str, n, &hi, &n)) | |
8773 | return 0; | |
8774 | if (TYPE_HIGH_BOUND (range_type) != hi) | |
8775 | return 0; | |
8776 | ||
8777 | return 1; | |
8778 | } | |
8779 | ||
8780 | /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE, | |
8781 | a type following the GNAT encoding for describing array type | |
8782 | indices, only carries redundant information. */ | |
8783 | ||
8784 | static int | |
8785 | ada_is_redundant_index_type_desc (struct type *array_type, | |
8786 | struct type *desc_type) | |
8787 | { | |
8788 | struct type *this_layer = check_typedef (array_type); | |
8789 | int i; | |
8790 | ||
8791 | for (i = 0; i < TYPE_NFIELDS (desc_type); i++) | |
8792 | { | |
8793 | if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer), | |
8794 | TYPE_FIELD_TYPE (desc_type, i))) | |
8795 | return 0; | |
8796 | this_layer = check_typedef (TYPE_TARGET_TYPE (this_layer)); | |
8797 | } | |
8798 | ||
8799 | return 1; | |
8800 | } | |
8801 | ||
14f9c5c9 AS |
8802 | /* Assuming that TYPE0 is an array type describing the type of a value |
8803 | at ADDR, and that DVAL describes a record containing any | |
8804 | discriminants used in TYPE0, returns a type for the value that | |
8805 | contains no dynamic components (that is, no components whose sizes | |
8806 | are determined by run-time quantities). Unless IGNORE_TOO_BIG is | |
8807 | true, gives an error message if the resulting type's size is over | |
4c4b4cd2 | 8808 | varsize_limit. */ |
14f9c5c9 | 8809 | |
d2e4a39e AS |
8810 | static struct type * |
8811 | to_fixed_array_type (struct type *type0, struct value *dval, | |
4c4b4cd2 | 8812 | int ignore_too_big) |
14f9c5c9 | 8813 | { |
d2e4a39e AS |
8814 | struct type *index_type_desc; |
8815 | struct type *result; | |
ad82864c | 8816 | int constrained_packed_array_p; |
931e5bc3 | 8817 | static const char *xa_suffix = "___XA"; |
14f9c5c9 | 8818 | |
b0dd7688 | 8819 | type0 = ada_check_typedef (type0); |
284614f0 | 8820 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 | 8821 | return type0; |
14f9c5c9 | 8822 | |
ad82864c JB |
8823 | constrained_packed_array_p = ada_is_constrained_packed_array_type (type0); |
8824 | if (constrained_packed_array_p) | |
8825 | type0 = decode_constrained_packed_array_type (type0); | |
284614f0 | 8826 | |
931e5bc3 JG |
8827 | index_type_desc = ada_find_parallel_type (type0, xa_suffix); |
8828 | ||
8829 | /* As mentioned in exp_dbug.ads, for non bit-packed arrays an | |
8830 | encoding suffixed with 'P' may still be generated. If so, | |
8831 | it should be used to find the XA type. */ | |
8832 | ||
8833 | if (index_type_desc == NULL) | |
8834 | { | |
1da0522e | 8835 | const char *type_name = ada_type_name (type0); |
931e5bc3 | 8836 | |
1da0522e | 8837 | if (type_name != NULL) |
931e5bc3 | 8838 | { |
1da0522e | 8839 | const int len = strlen (type_name); |
931e5bc3 JG |
8840 | char *name = (char *) alloca (len + strlen (xa_suffix)); |
8841 | ||
1da0522e | 8842 | if (type_name[len - 1] == 'P') |
931e5bc3 | 8843 | { |
1da0522e | 8844 | strcpy (name, type_name); |
931e5bc3 JG |
8845 | strcpy (name + len - 1, xa_suffix); |
8846 | index_type_desc = ada_find_parallel_type_with_name (type0, name); | |
8847 | } | |
8848 | } | |
8849 | } | |
8850 | ||
28c85d6c | 8851 | ada_fixup_array_indexes_type (index_type_desc); |
8908fca5 JB |
8852 | if (index_type_desc != NULL |
8853 | && ada_is_redundant_index_type_desc (type0, index_type_desc)) | |
8854 | { | |
8855 | /* Ignore this ___XA parallel type, as it does not bring any | |
8856 | useful information. This allows us to avoid creating fixed | |
8857 | versions of the array's index types, which would be identical | |
8858 | to the original ones. This, in turn, can also help avoid | |
8859 | the creation of fixed versions of the array itself. */ | |
8860 | index_type_desc = NULL; | |
8861 | } | |
8862 | ||
14f9c5c9 AS |
8863 | if (index_type_desc == NULL) |
8864 | { | |
61ee279c | 8865 | struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0)); |
5b4ee69b | 8866 | |
14f9c5c9 | 8867 | /* NOTE: elt_type---the fixed version of elt_type0---should never |
4c4b4cd2 PH |
8868 | depend on the contents of the array in properly constructed |
8869 | debugging data. */ | |
529cad9c PH |
8870 | /* Create a fixed version of the array element type. |
8871 | We're not providing the address of an element here, | |
e1d5a0d2 | 8872 | and thus the actual object value cannot be inspected to do |
529cad9c PH |
8873 | the conversion. This should not be a problem, since arrays of |
8874 | unconstrained objects are not allowed. In particular, all | |
8875 | the elements of an array of a tagged type should all be of | |
8876 | the same type specified in the debugging info. No need to | |
8877 | consult the object tag. */ | |
1ed6ede0 | 8878 | struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1); |
14f9c5c9 | 8879 | |
284614f0 JB |
8880 | /* Make sure we always create a new array type when dealing with |
8881 | packed array types, since we're going to fix-up the array | |
8882 | type length and element bitsize a little further down. */ | |
ad82864c | 8883 | if (elt_type0 == elt_type && !constrained_packed_array_p) |
4c4b4cd2 | 8884 | result = type0; |
14f9c5c9 | 8885 | else |
e9bb382b | 8886 | result = create_array_type (alloc_type_copy (type0), |
4c4b4cd2 | 8887 | elt_type, TYPE_INDEX_TYPE (type0)); |
14f9c5c9 AS |
8888 | } |
8889 | else | |
8890 | { | |
8891 | int i; | |
8892 | struct type *elt_type0; | |
8893 | ||
8894 | elt_type0 = type0; | |
8895 | for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1) | |
4c4b4cd2 | 8896 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); |
14f9c5c9 AS |
8897 | |
8898 | /* NOTE: result---the fixed version of elt_type0---should never | |
4c4b4cd2 PH |
8899 | depend on the contents of the array in properly constructed |
8900 | debugging data. */ | |
529cad9c PH |
8901 | /* Create a fixed version of the array element type. |
8902 | We're not providing the address of an element here, | |
e1d5a0d2 | 8903 | and thus the actual object value cannot be inspected to do |
529cad9c PH |
8904 | the conversion. This should not be a problem, since arrays of |
8905 | unconstrained objects are not allowed. In particular, all | |
8906 | the elements of an array of a tagged type should all be of | |
8907 | the same type specified in the debugging info. No need to | |
8908 | consult the object tag. */ | |
1ed6ede0 JB |
8909 | result = |
8910 | ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1); | |
1ce677a4 UW |
8911 | |
8912 | elt_type0 = type0; | |
14f9c5c9 | 8913 | for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1) |
4c4b4cd2 PH |
8914 | { |
8915 | struct type *range_type = | |
28c85d6c | 8916 | to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval); |
5b4ee69b | 8917 | |
e9bb382b | 8918 | result = create_array_type (alloc_type_copy (elt_type0), |
4c4b4cd2 | 8919 | result, range_type); |
1ce677a4 | 8920 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); |
4c4b4cd2 | 8921 | } |
d2e4a39e | 8922 | if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit) |
323e0a4a | 8923 | error (_("array type with dynamic size is larger than varsize-limit")); |
14f9c5c9 AS |
8924 | } |
8925 | ||
2e6fda7d JB |
8926 | /* We want to preserve the type name. This can be useful when |
8927 | trying to get the type name of a value that has already been | |
8928 | printed (for instance, if the user did "print VAR; whatis $". */ | |
8929 | TYPE_NAME (result) = TYPE_NAME (type0); | |
8930 | ||
ad82864c | 8931 | if (constrained_packed_array_p) |
284614f0 JB |
8932 | { |
8933 | /* So far, the resulting type has been created as if the original | |
8934 | type was a regular (non-packed) array type. As a result, the | |
8935 | bitsize of the array elements needs to be set again, and the array | |
8936 | length needs to be recomputed based on that bitsize. */ | |
8937 | int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result)); | |
8938 | int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0); | |
8939 | ||
8940 | TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0); | |
8941 | TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT; | |
8942 | if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize) | |
8943 | TYPE_LENGTH (result)++; | |
8944 | } | |
8945 | ||
876cecd0 | 8946 | TYPE_FIXED_INSTANCE (result) = 1; |
14f9c5c9 | 8947 | return result; |
d2e4a39e | 8948 | } |
14f9c5c9 AS |
8949 | |
8950 | ||
8951 | /* A standard type (containing no dynamically sized components) | |
8952 | corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS) | |
8953 | DVAL describes a record containing any discriminants used in TYPE0, | |
4c4b4cd2 | 8954 | and may be NULL if there are none, or if the object of type TYPE at |
529cad9c PH |
8955 | ADDRESS or in VALADDR contains these discriminants. |
8956 | ||
1ed6ede0 JB |
8957 | If CHECK_TAG is not null, in the case of tagged types, this function |
8958 | attempts to locate the object's tag and use it to compute the actual | |
8959 | type. However, when ADDRESS is null, we cannot use it to determine the | |
8960 | location of the tag, and therefore compute the tagged type's actual type. | |
8961 | So we return the tagged type without consulting the tag. */ | |
529cad9c | 8962 | |
f192137b JB |
8963 | static struct type * |
8964 | ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr, | |
1ed6ede0 | 8965 | CORE_ADDR address, struct value *dval, int check_tag) |
14f9c5c9 | 8966 | { |
61ee279c | 8967 | type = ada_check_typedef (type); |
d2e4a39e AS |
8968 | switch (TYPE_CODE (type)) |
8969 | { | |
8970 | default: | |
14f9c5c9 | 8971 | return type; |
d2e4a39e | 8972 | case TYPE_CODE_STRUCT: |
4c4b4cd2 | 8973 | { |
76a01679 | 8974 | struct type *static_type = to_static_fixed_type (type); |
1ed6ede0 JB |
8975 | struct type *fixed_record_type = |
8976 | to_fixed_record_type (type, valaddr, address, NULL); | |
5b4ee69b | 8977 | |
529cad9c PH |
8978 | /* If STATIC_TYPE is a tagged type and we know the object's address, |
8979 | then we can determine its tag, and compute the object's actual | |
0963b4bd | 8980 | type from there. Note that we have to use the fixed record |
1ed6ede0 JB |
8981 | type (the parent part of the record may have dynamic fields |
8982 | and the way the location of _tag is expressed may depend on | |
8983 | them). */ | |
529cad9c | 8984 | |
1ed6ede0 | 8985 | if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0)) |
76a01679 | 8986 | { |
b50d69b5 JG |
8987 | struct value *tag = |
8988 | value_tag_from_contents_and_address | |
8989 | (fixed_record_type, | |
8990 | valaddr, | |
8991 | address); | |
8992 | struct type *real_type = type_from_tag (tag); | |
8993 | struct value *obj = | |
8994 | value_from_contents_and_address (fixed_record_type, | |
8995 | valaddr, | |
8996 | address); | |
9f1f738a | 8997 | fixed_record_type = value_type (obj); |
76a01679 | 8998 | if (real_type != NULL) |
b50d69b5 JG |
8999 | return to_fixed_record_type |
9000 | (real_type, NULL, | |
9001 | value_address (ada_tag_value_at_base_address (obj)), NULL); | |
76a01679 | 9002 | } |
4af88198 JB |
9003 | |
9004 | /* Check to see if there is a parallel ___XVZ variable. | |
9005 | If there is, then it provides the actual size of our type. */ | |
9006 | else if (ada_type_name (fixed_record_type) != NULL) | |
9007 | { | |
0d5cff50 | 9008 | const char *name = ada_type_name (fixed_record_type); |
224c3ddb SM |
9009 | char *xvz_name |
9010 | = (char *) alloca (strlen (name) + 7 /* "___XVZ\0" */); | |
4af88198 JB |
9011 | int xvz_found = 0; |
9012 | LONGEST size; | |
9013 | ||
88c15c34 | 9014 | xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name); |
4af88198 JB |
9015 | size = get_int_var_value (xvz_name, &xvz_found); |
9016 | if (xvz_found && TYPE_LENGTH (fixed_record_type) != size) | |
9017 | { | |
9018 | fixed_record_type = copy_type (fixed_record_type); | |
9019 | TYPE_LENGTH (fixed_record_type) = size; | |
9020 | ||
9021 | /* The FIXED_RECORD_TYPE may have be a stub. We have | |
9022 | observed this when the debugging info is STABS, and | |
9023 | apparently it is something that is hard to fix. | |
9024 | ||
9025 | In practice, we don't need the actual type definition | |
9026 | at all, because the presence of the XVZ variable allows us | |
9027 | to assume that there must be a XVS type as well, which we | |
9028 | should be able to use later, when we need the actual type | |
9029 | definition. | |
9030 | ||
9031 | In the meantime, pretend that the "fixed" type we are | |
9032 | returning is NOT a stub, because this can cause trouble | |
9033 | when using this type to create new types targeting it. | |
9034 | Indeed, the associated creation routines often check | |
9035 | whether the target type is a stub and will try to replace | |
0963b4bd | 9036 | it, thus using a type with the wrong size. This, in turn, |
4af88198 JB |
9037 | might cause the new type to have the wrong size too. |
9038 | Consider the case of an array, for instance, where the size | |
9039 | of the array is computed from the number of elements in | |
9040 | our array multiplied by the size of its element. */ | |
9041 | TYPE_STUB (fixed_record_type) = 0; | |
9042 | } | |
9043 | } | |
1ed6ede0 | 9044 | return fixed_record_type; |
4c4b4cd2 | 9045 | } |
d2e4a39e | 9046 | case TYPE_CODE_ARRAY: |
4c4b4cd2 | 9047 | return to_fixed_array_type (type, dval, 1); |
d2e4a39e AS |
9048 | case TYPE_CODE_UNION: |
9049 | if (dval == NULL) | |
4c4b4cd2 | 9050 | return type; |
d2e4a39e | 9051 | else |
4c4b4cd2 | 9052 | return to_fixed_variant_branch_type (type, valaddr, address, dval); |
d2e4a39e | 9053 | } |
14f9c5c9 AS |
9054 | } |
9055 | ||
f192137b JB |
9056 | /* The same as ada_to_fixed_type_1, except that it preserves the type |
9057 | if it is a TYPE_CODE_TYPEDEF of a type that is already fixed. | |
96dbd2c1 JB |
9058 | |
9059 | The typedef layer needs be preserved in order to differentiate between | |
9060 | arrays and array pointers when both types are implemented using the same | |
9061 | fat pointer. In the array pointer case, the pointer is encoded as | |
9062 | a typedef of the pointer type. For instance, considering: | |
9063 | ||
9064 | type String_Access is access String; | |
9065 | S1 : String_Access := null; | |
9066 | ||
9067 | To the debugger, S1 is defined as a typedef of type String. But | |
9068 | to the user, it is a pointer. So if the user tries to print S1, | |
9069 | we should not dereference the array, but print the array address | |
9070 | instead. | |
9071 | ||
9072 | If we didn't preserve the typedef layer, we would lose the fact that | |
9073 | the type is to be presented as a pointer (needs de-reference before | |
9074 | being printed). And we would also use the source-level type name. */ | |
f192137b JB |
9075 | |
9076 | struct type * | |
9077 | ada_to_fixed_type (struct type *type, const gdb_byte *valaddr, | |
9078 | CORE_ADDR address, struct value *dval, int check_tag) | |
9079 | ||
9080 | { | |
9081 | struct type *fixed_type = | |
9082 | ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag); | |
9083 | ||
96dbd2c1 JB |
9084 | /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE, |
9085 | then preserve the typedef layer. | |
9086 | ||
9087 | Implementation note: We can only check the main-type portion of | |
9088 | the TYPE and FIXED_TYPE, because eliminating the typedef layer | |
9089 | from TYPE now returns a type that has the same instance flags | |
9090 | as TYPE. For instance, if TYPE is a "typedef const", and its | |
9091 | target type is a "struct", then the typedef elimination will return | |
9092 | a "const" version of the target type. See check_typedef for more | |
9093 | details about how the typedef layer elimination is done. | |
9094 | ||
9095 | brobecker/2010-11-19: It seems to me that the only case where it is | |
9096 | useful to preserve the typedef layer is when dealing with fat pointers. | |
9097 | Perhaps, we could add a check for that and preserve the typedef layer | |
9098 | only in that situation. But this seems unecessary so far, probably | |
9099 | because we call check_typedef/ada_check_typedef pretty much everywhere. | |
9100 | */ | |
f192137b | 9101 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF |
720d1a40 | 9102 | && (TYPE_MAIN_TYPE (ada_typedef_target_type (type)) |
96dbd2c1 | 9103 | == TYPE_MAIN_TYPE (fixed_type))) |
f192137b JB |
9104 | return type; |
9105 | ||
9106 | return fixed_type; | |
9107 | } | |
9108 | ||
14f9c5c9 | 9109 | /* A standard (static-sized) type corresponding as well as possible to |
4c4b4cd2 | 9110 | TYPE0, but based on no runtime data. */ |
14f9c5c9 | 9111 | |
d2e4a39e AS |
9112 | static struct type * |
9113 | to_static_fixed_type (struct type *type0) | |
14f9c5c9 | 9114 | { |
d2e4a39e | 9115 | struct type *type; |
14f9c5c9 AS |
9116 | |
9117 | if (type0 == NULL) | |
9118 | return NULL; | |
9119 | ||
876cecd0 | 9120 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 PH |
9121 | return type0; |
9122 | ||
61ee279c | 9123 | type0 = ada_check_typedef (type0); |
d2e4a39e | 9124 | |
14f9c5c9 AS |
9125 | switch (TYPE_CODE (type0)) |
9126 | { | |
9127 | default: | |
9128 | return type0; | |
9129 | case TYPE_CODE_STRUCT: | |
9130 | type = dynamic_template_type (type0); | |
d2e4a39e | 9131 | if (type != NULL) |
4c4b4cd2 PH |
9132 | return template_to_static_fixed_type (type); |
9133 | else | |
9134 | return template_to_static_fixed_type (type0); | |
14f9c5c9 AS |
9135 | case TYPE_CODE_UNION: |
9136 | type = ada_find_parallel_type (type0, "___XVU"); | |
9137 | if (type != NULL) | |
4c4b4cd2 PH |
9138 | return template_to_static_fixed_type (type); |
9139 | else | |
9140 | return template_to_static_fixed_type (type0); | |
14f9c5c9 AS |
9141 | } |
9142 | } | |
9143 | ||
4c4b4cd2 PH |
9144 | /* A static approximation of TYPE with all type wrappers removed. */ |
9145 | ||
d2e4a39e AS |
9146 | static struct type * |
9147 | static_unwrap_type (struct type *type) | |
14f9c5c9 AS |
9148 | { |
9149 | if (ada_is_aligner_type (type)) | |
9150 | { | |
61ee279c | 9151 | struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0); |
14f9c5c9 | 9152 | if (ada_type_name (type1) == NULL) |
4c4b4cd2 | 9153 | TYPE_NAME (type1) = ada_type_name (type); |
14f9c5c9 AS |
9154 | |
9155 | return static_unwrap_type (type1); | |
9156 | } | |
d2e4a39e | 9157 | else |
14f9c5c9 | 9158 | { |
d2e4a39e | 9159 | struct type *raw_real_type = ada_get_base_type (type); |
5b4ee69b | 9160 | |
d2e4a39e | 9161 | if (raw_real_type == type) |
4c4b4cd2 | 9162 | return type; |
14f9c5c9 | 9163 | else |
4c4b4cd2 | 9164 | return to_static_fixed_type (raw_real_type); |
14f9c5c9 AS |
9165 | } |
9166 | } | |
9167 | ||
9168 | /* In some cases, incomplete and private types require | |
4c4b4cd2 | 9169 | cross-references that are not resolved as records (for example, |
14f9c5c9 AS |
9170 | type Foo; |
9171 | type FooP is access Foo; | |
9172 | V: FooP; | |
9173 | type Foo is array ...; | |
4c4b4cd2 | 9174 | ). In these cases, since there is no mechanism for producing |
14f9c5c9 AS |
9175 | cross-references to such types, we instead substitute for FooP a |
9176 | stub enumeration type that is nowhere resolved, and whose tag is | |
4c4b4cd2 | 9177 | the name of the actual type. Call these types "non-record stubs". */ |
14f9c5c9 AS |
9178 | |
9179 | /* A type equivalent to TYPE that is not a non-record stub, if one | |
4c4b4cd2 PH |
9180 | exists, otherwise TYPE. */ |
9181 | ||
d2e4a39e | 9182 | struct type * |
61ee279c | 9183 | ada_check_typedef (struct type *type) |
14f9c5c9 | 9184 | { |
727e3d2e JB |
9185 | if (type == NULL) |
9186 | return NULL; | |
9187 | ||
720d1a40 JB |
9188 | /* If our type is a typedef type of a fat pointer, then we're done. |
9189 | We don't want to strip the TYPE_CODE_TYPDEF layer, because this is | |
9190 | what allows us to distinguish between fat pointers that represent | |
9191 | array types, and fat pointers that represent array access types | |
9192 | (in both cases, the compiler implements them as fat pointers). */ | |
9193 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF | |
9194 | && is_thick_pntr (ada_typedef_target_type (type))) | |
9195 | return type; | |
9196 | ||
f168693b | 9197 | type = check_typedef (type); |
14f9c5c9 | 9198 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM |
529cad9c | 9199 | || !TYPE_STUB (type) |
14f9c5c9 AS |
9200 | || TYPE_TAG_NAME (type) == NULL) |
9201 | return type; | |
d2e4a39e | 9202 | else |
14f9c5c9 | 9203 | { |
0d5cff50 | 9204 | const char *name = TYPE_TAG_NAME (type); |
d2e4a39e | 9205 | struct type *type1 = ada_find_any_type (name); |
5b4ee69b | 9206 | |
05e522ef JB |
9207 | if (type1 == NULL) |
9208 | return type; | |
9209 | ||
9210 | /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with | |
9211 | stubs pointing to arrays, as we don't create symbols for array | |
3a867c22 JB |
9212 | types, only for the typedef-to-array types). If that's the case, |
9213 | strip the typedef layer. */ | |
9214 | if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF) | |
9215 | type1 = ada_check_typedef (type1); | |
9216 | ||
9217 | return type1; | |
14f9c5c9 AS |
9218 | } |
9219 | } | |
9220 | ||
9221 | /* A value representing the data at VALADDR/ADDRESS as described by | |
9222 | type TYPE0, but with a standard (static-sized) type that correctly | |
9223 | describes it. If VAL0 is not NULL and TYPE0 already is a standard | |
9224 | type, then return VAL0 [this feature is simply to avoid redundant | |
4c4b4cd2 | 9225 | creation of struct values]. */ |
14f9c5c9 | 9226 | |
4c4b4cd2 PH |
9227 | static struct value * |
9228 | ada_to_fixed_value_create (struct type *type0, CORE_ADDR address, | |
9229 | struct value *val0) | |
14f9c5c9 | 9230 | { |
1ed6ede0 | 9231 | struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1); |
5b4ee69b | 9232 | |
14f9c5c9 AS |
9233 | if (type == type0 && val0 != NULL) |
9234 | return val0; | |
d2e4a39e | 9235 | else |
4c4b4cd2 PH |
9236 | return value_from_contents_and_address (type, 0, address); |
9237 | } | |
9238 | ||
9239 | /* A value representing VAL, but with a standard (static-sized) type | |
9240 | that correctly describes it. Does not necessarily create a new | |
9241 | value. */ | |
9242 | ||
0c3acc09 | 9243 | struct value * |
4c4b4cd2 PH |
9244 | ada_to_fixed_value (struct value *val) |
9245 | { | |
c48db5ca JB |
9246 | val = unwrap_value (val); |
9247 | val = ada_to_fixed_value_create (value_type (val), | |
9248 | value_address (val), | |
9249 | val); | |
9250 | return val; | |
14f9c5c9 | 9251 | } |
d2e4a39e | 9252 | \f |
14f9c5c9 | 9253 | |
14f9c5c9 AS |
9254 | /* Attributes */ |
9255 | ||
4c4b4cd2 PH |
9256 | /* Table mapping attribute numbers to names. |
9257 | NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */ | |
14f9c5c9 | 9258 | |
d2e4a39e | 9259 | static const char *attribute_names[] = { |
14f9c5c9 AS |
9260 | "<?>", |
9261 | ||
d2e4a39e | 9262 | "first", |
14f9c5c9 AS |
9263 | "last", |
9264 | "length", | |
9265 | "image", | |
14f9c5c9 AS |
9266 | "max", |
9267 | "min", | |
4c4b4cd2 PH |
9268 | "modulus", |
9269 | "pos", | |
9270 | "size", | |
9271 | "tag", | |
14f9c5c9 | 9272 | "val", |
14f9c5c9 AS |
9273 | 0 |
9274 | }; | |
9275 | ||
d2e4a39e | 9276 | const char * |
4c4b4cd2 | 9277 | ada_attribute_name (enum exp_opcode n) |
14f9c5c9 | 9278 | { |
4c4b4cd2 PH |
9279 | if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL) |
9280 | return attribute_names[n - OP_ATR_FIRST + 1]; | |
14f9c5c9 AS |
9281 | else |
9282 | return attribute_names[0]; | |
9283 | } | |
9284 | ||
4c4b4cd2 | 9285 | /* Evaluate the 'POS attribute applied to ARG. */ |
14f9c5c9 | 9286 | |
4c4b4cd2 PH |
9287 | static LONGEST |
9288 | pos_atr (struct value *arg) | |
14f9c5c9 | 9289 | { |
24209737 PH |
9290 | struct value *val = coerce_ref (arg); |
9291 | struct type *type = value_type (val); | |
aa715135 | 9292 | LONGEST result; |
14f9c5c9 | 9293 | |
d2e4a39e | 9294 | if (!discrete_type_p (type)) |
323e0a4a | 9295 | error (_("'POS only defined on discrete types")); |
14f9c5c9 | 9296 | |
aa715135 JG |
9297 | if (!discrete_position (type, value_as_long (val), &result)) |
9298 | error (_("enumeration value is invalid: can't find 'POS")); | |
14f9c5c9 | 9299 | |
aa715135 | 9300 | return result; |
4c4b4cd2 PH |
9301 | } |
9302 | ||
9303 | static struct value * | |
3cb382c9 | 9304 | value_pos_atr (struct type *type, struct value *arg) |
4c4b4cd2 | 9305 | { |
3cb382c9 | 9306 | return value_from_longest (type, pos_atr (arg)); |
14f9c5c9 AS |
9307 | } |
9308 | ||
4c4b4cd2 | 9309 | /* Evaluate the TYPE'VAL attribute applied to ARG. */ |
14f9c5c9 | 9310 | |
d2e4a39e AS |
9311 | static struct value * |
9312 | value_val_atr (struct type *type, struct value *arg) | |
14f9c5c9 | 9313 | { |
d2e4a39e | 9314 | if (!discrete_type_p (type)) |
323e0a4a | 9315 | error (_("'VAL only defined on discrete types")); |
df407dfe | 9316 | if (!integer_type_p (value_type (arg))) |
323e0a4a | 9317 | error (_("'VAL requires integral argument")); |
14f9c5c9 AS |
9318 | |
9319 | if (TYPE_CODE (type) == TYPE_CODE_ENUM) | |
9320 | { | |
9321 | long pos = value_as_long (arg); | |
5b4ee69b | 9322 | |
14f9c5c9 | 9323 | if (pos < 0 || pos >= TYPE_NFIELDS (type)) |
323e0a4a | 9324 | error (_("argument to 'VAL out of range")); |
14e75d8e | 9325 | return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos)); |
14f9c5c9 AS |
9326 | } |
9327 | else | |
9328 | return value_from_longest (type, value_as_long (arg)); | |
9329 | } | |
14f9c5c9 | 9330 | \f |
d2e4a39e | 9331 | |
4c4b4cd2 | 9332 | /* Evaluation */ |
14f9c5c9 | 9333 | |
4c4b4cd2 PH |
9334 | /* True if TYPE appears to be an Ada character type. |
9335 | [At the moment, this is true only for Character and Wide_Character; | |
9336 | It is a heuristic test that could stand improvement]. */ | |
14f9c5c9 | 9337 | |
d2e4a39e AS |
9338 | int |
9339 | ada_is_character_type (struct type *type) | |
14f9c5c9 | 9340 | { |
7b9f71f2 JB |
9341 | const char *name; |
9342 | ||
9343 | /* If the type code says it's a character, then assume it really is, | |
9344 | and don't check any further. */ | |
9345 | if (TYPE_CODE (type) == TYPE_CODE_CHAR) | |
9346 | return 1; | |
9347 | ||
9348 | /* Otherwise, assume it's a character type iff it is a discrete type | |
9349 | with a known character type name. */ | |
9350 | name = ada_type_name (type); | |
9351 | return (name != NULL | |
9352 | && (TYPE_CODE (type) == TYPE_CODE_INT | |
9353 | || TYPE_CODE (type) == TYPE_CODE_RANGE) | |
9354 | && (strcmp (name, "character") == 0 | |
9355 | || strcmp (name, "wide_character") == 0 | |
5a517ebd | 9356 | || strcmp (name, "wide_wide_character") == 0 |
7b9f71f2 | 9357 | || strcmp (name, "unsigned char") == 0)); |
14f9c5c9 AS |
9358 | } |
9359 | ||
4c4b4cd2 | 9360 | /* True if TYPE appears to be an Ada string type. */ |
14f9c5c9 AS |
9361 | |
9362 | int | |
ebf56fd3 | 9363 | ada_is_string_type (struct type *type) |
14f9c5c9 | 9364 | { |
61ee279c | 9365 | type = ada_check_typedef (type); |
d2e4a39e | 9366 | if (type != NULL |
14f9c5c9 | 9367 | && TYPE_CODE (type) != TYPE_CODE_PTR |
76a01679 JB |
9368 | && (ada_is_simple_array_type (type) |
9369 | || ada_is_array_descriptor_type (type)) | |
14f9c5c9 AS |
9370 | && ada_array_arity (type) == 1) |
9371 | { | |
9372 | struct type *elttype = ada_array_element_type (type, 1); | |
9373 | ||
9374 | return ada_is_character_type (elttype); | |
9375 | } | |
d2e4a39e | 9376 | else |
14f9c5c9 AS |
9377 | return 0; |
9378 | } | |
9379 | ||
5bf03f13 JB |
9380 | /* The compiler sometimes provides a parallel XVS type for a given |
9381 | PAD type. Normally, it is safe to follow the PAD type directly, | |
9382 | but older versions of the compiler have a bug that causes the offset | |
9383 | of its "F" field to be wrong. Following that field in that case | |
9384 | would lead to incorrect results, but this can be worked around | |
9385 | by ignoring the PAD type and using the associated XVS type instead. | |
9386 | ||
9387 | Set to True if the debugger should trust the contents of PAD types. | |
9388 | Otherwise, ignore the PAD type if there is a parallel XVS type. */ | |
9389 | static int trust_pad_over_xvs = 1; | |
14f9c5c9 AS |
9390 | |
9391 | /* True if TYPE is a struct type introduced by the compiler to force the | |
9392 | alignment of a value. Such types have a single field with a | |
4c4b4cd2 | 9393 | distinctive name. */ |
14f9c5c9 AS |
9394 | |
9395 | int | |
ebf56fd3 | 9396 | ada_is_aligner_type (struct type *type) |
14f9c5c9 | 9397 | { |
61ee279c | 9398 | type = ada_check_typedef (type); |
714e53ab | 9399 | |
5bf03f13 | 9400 | if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL) |
714e53ab PH |
9401 | return 0; |
9402 | ||
14f9c5c9 | 9403 | return (TYPE_CODE (type) == TYPE_CODE_STRUCT |
4c4b4cd2 PH |
9404 | && TYPE_NFIELDS (type) == 1 |
9405 | && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0); | |
14f9c5c9 AS |
9406 | } |
9407 | ||
9408 | /* If there is an ___XVS-convention type parallel to SUBTYPE, return | |
4c4b4cd2 | 9409 | the parallel type. */ |
14f9c5c9 | 9410 | |
d2e4a39e AS |
9411 | struct type * |
9412 | ada_get_base_type (struct type *raw_type) | |
14f9c5c9 | 9413 | { |
d2e4a39e AS |
9414 | struct type *real_type_namer; |
9415 | struct type *raw_real_type; | |
14f9c5c9 AS |
9416 | |
9417 | if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT) | |
9418 | return raw_type; | |
9419 | ||
284614f0 JB |
9420 | if (ada_is_aligner_type (raw_type)) |
9421 | /* The encoding specifies that we should always use the aligner type. | |
9422 | So, even if this aligner type has an associated XVS type, we should | |
9423 | simply ignore it. | |
9424 | ||
9425 | According to the compiler gurus, an XVS type parallel to an aligner | |
9426 | type may exist because of a stabs limitation. In stabs, aligner | |
9427 | types are empty because the field has a variable-sized type, and | |
9428 | thus cannot actually be used as an aligner type. As a result, | |
9429 | we need the associated parallel XVS type to decode the type. | |
9430 | Since the policy in the compiler is to not change the internal | |
9431 | representation based on the debugging info format, we sometimes | |
9432 | end up having a redundant XVS type parallel to the aligner type. */ | |
9433 | return raw_type; | |
9434 | ||
14f9c5c9 | 9435 | real_type_namer = ada_find_parallel_type (raw_type, "___XVS"); |
d2e4a39e | 9436 | if (real_type_namer == NULL |
14f9c5c9 AS |
9437 | || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT |
9438 | || TYPE_NFIELDS (real_type_namer) != 1) | |
9439 | return raw_type; | |
9440 | ||
f80d3ff2 JB |
9441 | if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF) |
9442 | { | |
9443 | /* This is an older encoding form where the base type needs to be | |
9444 | looked up by name. We prefer the newer enconding because it is | |
9445 | more efficient. */ | |
9446 | raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0)); | |
9447 | if (raw_real_type == NULL) | |
9448 | return raw_type; | |
9449 | else | |
9450 | return raw_real_type; | |
9451 | } | |
9452 | ||
9453 | /* The field in our XVS type is a reference to the base type. */ | |
9454 | return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0)); | |
d2e4a39e | 9455 | } |
14f9c5c9 | 9456 | |
4c4b4cd2 | 9457 | /* The type of value designated by TYPE, with all aligners removed. */ |
14f9c5c9 | 9458 | |
d2e4a39e AS |
9459 | struct type * |
9460 | ada_aligned_type (struct type *type) | |
14f9c5c9 AS |
9461 | { |
9462 | if (ada_is_aligner_type (type)) | |
9463 | return ada_aligned_type (TYPE_FIELD_TYPE (type, 0)); | |
9464 | else | |
9465 | return ada_get_base_type (type); | |
9466 | } | |
9467 | ||
9468 | ||
9469 | /* The address of the aligned value in an object at address VALADDR | |
4c4b4cd2 | 9470 | having type TYPE. Assumes ada_is_aligner_type (TYPE). */ |
14f9c5c9 | 9471 | |
fc1a4b47 AC |
9472 | const gdb_byte * |
9473 | ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr) | |
14f9c5c9 | 9474 | { |
d2e4a39e | 9475 | if (ada_is_aligner_type (type)) |
14f9c5c9 | 9476 | return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0), |
4c4b4cd2 PH |
9477 | valaddr + |
9478 | TYPE_FIELD_BITPOS (type, | |
9479 | 0) / TARGET_CHAR_BIT); | |
14f9c5c9 AS |
9480 | else |
9481 | return valaddr; | |
9482 | } | |
9483 | ||
4c4b4cd2 PH |
9484 | |
9485 | ||
14f9c5c9 | 9486 | /* The printed representation of an enumeration literal with encoded |
4c4b4cd2 | 9487 | name NAME. The value is good to the next call of ada_enum_name. */ |
d2e4a39e AS |
9488 | const char * |
9489 | ada_enum_name (const char *name) | |
14f9c5c9 | 9490 | { |
4c4b4cd2 PH |
9491 | static char *result; |
9492 | static size_t result_len = 0; | |
e6a959d6 | 9493 | const char *tmp; |
14f9c5c9 | 9494 | |
4c4b4cd2 PH |
9495 | /* First, unqualify the enumeration name: |
9496 | 1. Search for the last '.' character. If we find one, then skip | |
177b42fe | 9497 | all the preceding characters, the unqualified name starts |
76a01679 | 9498 | right after that dot. |
4c4b4cd2 | 9499 | 2. Otherwise, we may be debugging on a target where the compiler |
76a01679 JB |
9500 | translates dots into "__". Search forward for double underscores, |
9501 | but stop searching when we hit an overloading suffix, which is | |
9502 | of the form "__" followed by digits. */ | |
4c4b4cd2 | 9503 | |
c3e5cd34 PH |
9504 | tmp = strrchr (name, '.'); |
9505 | if (tmp != NULL) | |
4c4b4cd2 PH |
9506 | name = tmp + 1; |
9507 | else | |
14f9c5c9 | 9508 | { |
4c4b4cd2 PH |
9509 | while ((tmp = strstr (name, "__")) != NULL) |
9510 | { | |
9511 | if (isdigit (tmp[2])) | |
9512 | break; | |
9513 | else | |
9514 | name = tmp + 2; | |
9515 | } | |
14f9c5c9 AS |
9516 | } |
9517 | ||
9518 | if (name[0] == 'Q') | |
9519 | { | |
14f9c5c9 | 9520 | int v; |
5b4ee69b | 9521 | |
14f9c5c9 | 9522 | if (name[1] == 'U' || name[1] == 'W') |
4c4b4cd2 PH |
9523 | { |
9524 | if (sscanf (name + 2, "%x", &v) != 1) | |
9525 | return name; | |
9526 | } | |
14f9c5c9 | 9527 | else |
4c4b4cd2 | 9528 | return name; |
14f9c5c9 | 9529 | |
4c4b4cd2 | 9530 | GROW_VECT (result, result_len, 16); |
14f9c5c9 | 9531 | if (isascii (v) && isprint (v)) |
88c15c34 | 9532 | xsnprintf (result, result_len, "'%c'", v); |
14f9c5c9 | 9533 | else if (name[1] == 'U') |
88c15c34 | 9534 | xsnprintf (result, result_len, "[\"%02x\"]", v); |
14f9c5c9 | 9535 | else |
88c15c34 | 9536 | xsnprintf (result, result_len, "[\"%04x\"]", v); |
14f9c5c9 AS |
9537 | |
9538 | return result; | |
9539 | } | |
d2e4a39e | 9540 | else |
4c4b4cd2 | 9541 | { |
c3e5cd34 PH |
9542 | tmp = strstr (name, "__"); |
9543 | if (tmp == NULL) | |
9544 | tmp = strstr (name, "$"); | |
9545 | if (tmp != NULL) | |
4c4b4cd2 PH |
9546 | { |
9547 | GROW_VECT (result, result_len, tmp - name + 1); | |
9548 | strncpy (result, name, tmp - name); | |
9549 | result[tmp - name] = '\0'; | |
9550 | return result; | |
9551 | } | |
9552 | ||
9553 | return name; | |
9554 | } | |
14f9c5c9 AS |
9555 | } |
9556 | ||
14f9c5c9 AS |
9557 | /* Evaluate the subexpression of EXP starting at *POS as for |
9558 | evaluate_type, updating *POS to point just past the evaluated | |
4c4b4cd2 | 9559 | expression. */ |
14f9c5c9 | 9560 | |
d2e4a39e AS |
9561 | static struct value * |
9562 | evaluate_subexp_type (struct expression *exp, int *pos) | |
14f9c5c9 | 9563 | { |
4b27a620 | 9564 | return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); |
14f9c5c9 AS |
9565 | } |
9566 | ||
9567 | /* If VAL is wrapped in an aligner or subtype wrapper, return the | |
4c4b4cd2 | 9568 | value it wraps. */ |
14f9c5c9 | 9569 | |
d2e4a39e AS |
9570 | static struct value * |
9571 | unwrap_value (struct value *val) | |
14f9c5c9 | 9572 | { |
df407dfe | 9573 | struct type *type = ada_check_typedef (value_type (val)); |
5b4ee69b | 9574 | |
14f9c5c9 AS |
9575 | if (ada_is_aligner_type (type)) |
9576 | { | |
de4d072f | 9577 | struct value *v = ada_value_struct_elt (val, "F", 0); |
df407dfe | 9578 | struct type *val_type = ada_check_typedef (value_type (v)); |
5b4ee69b | 9579 | |
14f9c5c9 | 9580 | if (ada_type_name (val_type) == NULL) |
4c4b4cd2 | 9581 | TYPE_NAME (val_type) = ada_type_name (type); |
14f9c5c9 AS |
9582 | |
9583 | return unwrap_value (v); | |
9584 | } | |
d2e4a39e | 9585 | else |
14f9c5c9 | 9586 | { |
d2e4a39e | 9587 | struct type *raw_real_type = |
61ee279c | 9588 | ada_check_typedef (ada_get_base_type (type)); |
d2e4a39e | 9589 | |
5bf03f13 JB |
9590 | /* If there is no parallel XVS or XVE type, then the value is |
9591 | already unwrapped. Return it without further modification. */ | |
9592 | if ((type == raw_real_type) | |
9593 | && ada_find_parallel_type (type, "___XVE") == NULL) | |
9594 | return val; | |
14f9c5c9 | 9595 | |
d2e4a39e | 9596 | return |
4c4b4cd2 PH |
9597 | coerce_unspec_val_to_type |
9598 | (val, ada_to_fixed_type (raw_real_type, 0, | |
42ae5230 | 9599 | value_address (val), |
1ed6ede0 | 9600 | NULL, 1)); |
14f9c5c9 AS |
9601 | } |
9602 | } | |
d2e4a39e AS |
9603 | |
9604 | static struct value * | |
9605 | cast_to_fixed (struct type *type, struct value *arg) | |
14f9c5c9 AS |
9606 | { |
9607 | LONGEST val; | |
9608 | ||
df407dfe | 9609 | if (type == value_type (arg)) |
14f9c5c9 | 9610 | return arg; |
df407dfe | 9611 | else if (ada_is_fixed_point_type (value_type (arg))) |
d2e4a39e | 9612 | val = ada_float_to_fixed (type, |
df407dfe | 9613 | ada_fixed_to_float (value_type (arg), |
4c4b4cd2 | 9614 | value_as_long (arg))); |
d2e4a39e | 9615 | else |
14f9c5c9 | 9616 | { |
a53b7a21 | 9617 | DOUBLEST argd = value_as_double (arg); |
5b4ee69b | 9618 | |
14f9c5c9 AS |
9619 | val = ada_float_to_fixed (type, argd); |
9620 | } | |
9621 | ||
9622 | return value_from_longest (type, val); | |
9623 | } | |
9624 | ||
d2e4a39e | 9625 | static struct value * |
a53b7a21 | 9626 | cast_from_fixed (struct type *type, struct value *arg) |
14f9c5c9 | 9627 | { |
df407dfe | 9628 | DOUBLEST val = ada_fixed_to_float (value_type (arg), |
4c4b4cd2 | 9629 | value_as_long (arg)); |
5b4ee69b | 9630 | |
a53b7a21 | 9631 | return value_from_double (type, val); |
14f9c5c9 AS |
9632 | } |
9633 | ||
d99dcf51 JB |
9634 | /* Given two array types T1 and T2, return nonzero iff both arrays |
9635 | contain the same number of elements. */ | |
9636 | ||
9637 | static int | |
9638 | ada_same_array_size_p (struct type *t1, struct type *t2) | |
9639 | { | |
9640 | LONGEST lo1, hi1, lo2, hi2; | |
9641 | ||
9642 | /* Get the array bounds in order to verify that the size of | |
9643 | the two arrays match. */ | |
9644 | if (!get_array_bounds (t1, &lo1, &hi1) | |
9645 | || !get_array_bounds (t2, &lo2, &hi2)) | |
9646 | error (_("unable to determine array bounds")); | |
9647 | ||
9648 | /* To make things easier for size comparison, normalize a bit | |
9649 | the case of empty arrays by making sure that the difference | |
9650 | between upper bound and lower bound is always -1. */ | |
9651 | if (lo1 > hi1) | |
9652 | hi1 = lo1 - 1; | |
9653 | if (lo2 > hi2) | |
9654 | hi2 = lo2 - 1; | |
9655 | ||
9656 | return (hi1 - lo1 == hi2 - lo2); | |
9657 | } | |
9658 | ||
9659 | /* Assuming that VAL is an array of integrals, and TYPE represents | |
9660 | an array with the same number of elements, but with wider integral | |
9661 | elements, return an array "casted" to TYPE. In practice, this | |
9662 | means that the returned array is built by casting each element | |
9663 | of the original array into TYPE's (wider) element type. */ | |
9664 | ||
9665 | static struct value * | |
9666 | ada_promote_array_of_integrals (struct type *type, struct value *val) | |
9667 | { | |
9668 | struct type *elt_type = TYPE_TARGET_TYPE (type); | |
9669 | LONGEST lo, hi; | |
9670 | struct value *res; | |
9671 | LONGEST i; | |
9672 | ||
9673 | /* Verify that both val and type are arrays of scalars, and | |
9674 | that the size of val's elements is smaller than the size | |
9675 | of type's element. */ | |
9676 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY); | |
9677 | gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type))); | |
9678 | gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY); | |
9679 | gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val)))); | |
9680 | gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type)) | |
9681 | > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val)))); | |
9682 | ||
9683 | if (!get_array_bounds (type, &lo, &hi)) | |
9684 | error (_("unable to determine array bounds")); | |
9685 | ||
9686 | res = allocate_value (type); | |
9687 | ||
9688 | /* Promote each array element. */ | |
9689 | for (i = 0; i < hi - lo + 1; i++) | |
9690 | { | |
9691 | struct value *elt = value_cast (elt_type, value_subscript (val, lo + i)); | |
9692 | ||
9693 | memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)), | |
9694 | value_contents_all (elt), TYPE_LENGTH (elt_type)); | |
9695 | } | |
9696 | ||
9697 | return res; | |
9698 | } | |
9699 | ||
4c4b4cd2 PH |
9700 | /* Coerce VAL as necessary for assignment to an lval of type TYPE, and |
9701 | return the converted value. */ | |
9702 | ||
d2e4a39e AS |
9703 | static struct value * |
9704 | coerce_for_assign (struct type *type, struct value *val) | |
14f9c5c9 | 9705 | { |
df407dfe | 9706 | struct type *type2 = value_type (val); |
5b4ee69b | 9707 | |
14f9c5c9 AS |
9708 | if (type == type2) |
9709 | return val; | |
9710 | ||
61ee279c PH |
9711 | type2 = ada_check_typedef (type2); |
9712 | type = ada_check_typedef (type); | |
14f9c5c9 | 9713 | |
d2e4a39e AS |
9714 | if (TYPE_CODE (type2) == TYPE_CODE_PTR |
9715 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
14f9c5c9 AS |
9716 | { |
9717 | val = ada_value_ind (val); | |
df407dfe | 9718 | type2 = value_type (val); |
14f9c5c9 AS |
9719 | } |
9720 | ||
d2e4a39e | 9721 | if (TYPE_CODE (type2) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
9722 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) |
9723 | { | |
d99dcf51 JB |
9724 | if (!ada_same_array_size_p (type, type2)) |
9725 | error (_("cannot assign arrays of different length")); | |
9726 | ||
9727 | if (is_integral_type (TYPE_TARGET_TYPE (type)) | |
9728 | && is_integral_type (TYPE_TARGET_TYPE (type2)) | |
9729 | && TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
9730 | < TYPE_LENGTH (TYPE_TARGET_TYPE (type))) | |
9731 | { | |
9732 | /* Allow implicit promotion of the array elements to | |
9733 | a wider type. */ | |
9734 | return ada_promote_array_of_integrals (type, val); | |
9735 | } | |
9736 | ||
9737 | if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
9738 | != TYPE_LENGTH (TYPE_TARGET_TYPE (type))) | |
323e0a4a | 9739 | error (_("Incompatible types in assignment")); |
04624583 | 9740 | deprecated_set_value_type (val, type); |
14f9c5c9 | 9741 | } |
d2e4a39e | 9742 | return val; |
14f9c5c9 AS |
9743 | } |
9744 | ||
4c4b4cd2 PH |
9745 | static struct value * |
9746 | ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op) | |
9747 | { | |
9748 | struct value *val; | |
9749 | struct type *type1, *type2; | |
9750 | LONGEST v, v1, v2; | |
9751 | ||
994b9211 AC |
9752 | arg1 = coerce_ref (arg1); |
9753 | arg2 = coerce_ref (arg2); | |
18af8284 JB |
9754 | type1 = get_base_type (ada_check_typedef (value_type (arg1))); |
9755 | type2 = get_base_type (ada_check_typedef (value_type (arg2))); | |
4c4b4cd2 | 9756 | |
76a01679 JB |
9757 | if (TYPE_CODE (type1) != TYPE_CODE_INT |
9758 | || TYPE_CODE (type2) != TYPE_CODE_INT) | |
4c4b4cd2 PH |
9759 | return value_binop (arg1, arg2, op); |
9760 | ||
76a01679 | 9761 | switch (op) |
4c4b4cd2 PH |
9762 | { |
9763 | case BINOP_MOD: | |
9764 | case BINOP_DIV: | |
9765 | case BINOP_REM: | |
9766 | break; | |
9767 | default: | |
9768 | return value_binop (arg1, arg2, op); | |
9769 | } | |
9770 | ||
9771 | v2 = value_as_long (arg2); | |
9772 | if (v2 == 0) | |
323e0a4a | 9773 | error (_("second operand of %s must not be zero."), op_string (op)); |
4c4b4cd2 PH |
9774 | |
9775 | if (TYPE_UNSIGNED (type1) || op == BINOP_MOD) | |
9776 | return value_binop (arg1, arg2, op); | |
9777 | ||
9778 | v1 = value_as_long (arg1); | |
9779 | switch (op) | |
9780 | { | |
9781 | case BINOP_DIV: | |
9782 | v = v1 / v2; | |
76a01679 JB |
9783 | if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0) |
9784 | v += v > 0 ? -1 : 1; | |
4c4b4cd2 PH |
9785 | break; |
9786 | case BINOP_REM: | |
9787 | v = v1 % v2; | |
76a01679 JB |
9788 | if (v * v1 < 0) |
9789 | v -= v2; | |
4c4b4cd2 PH |
9790 | break; |
9791 | default: | |
9792 | /* Should not reach this point. */ | |
9793 | v = 0; | |
9794 | } | |
9795 | ||
9796 | val = allocate_value (type1); | |
990a07ab | 9797 | store_unsigned_integer (value_contents_raw (val), |
e17a4113 UW |
9798 | TYPE_LENGTH (value_type (val)), |
9799 | gdbarch_byte_order (get_type_arch (type1)), v); | |
4c4b4cd2 PH |
9800 | return val; |
9801 | } | |
9802 | ||
9803 | static int | |
9804 | ada_value_equal (struct value *arg1, struct value *arg2) | |
9805 | { | |
df407dfe AC |
9806 | if (ada_is_direct_array_type (value_type (arg1)) |
9807 | || ada_is_direct_array_type (value_type (arg2))) | |
4c4b4cd2 | 9808 | { |
f58b38bf JB |
9809 | /* Automatically dereference any array reference before |
9810 | we attempt to perform the comparison. */ | |
9811 | arg1 = ada_coerce_ref (arg1); | |
9812 | arg2 = ada_coerce_ref (arg2); | |
9813 | ||
4c4b4cd2 PH |
9814 | arg1 = ada_coerce_to_simple_array (arg1); |
9815 | arg2 = ada_coerce_to_simple_array (arg2); | |
df407dfe AC |
9816 | if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY |
9817 | || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY) | |
323e0a4a | 9818 | error (_("Attempt to compare array with non-array")); |
4c4b4cd2 | 9819 | /* FIXME: The following works only for types whose |
76a01679 JB |
9820 | representations use all bits (no padding or undefined bits) |
9821 | and do not have user-defined equality. */ | |
9822 | return | |
df407dfe | 9823 | TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2)) |
0fd88904 | 9824 | && memcmp (value_contents (arg1), value_contents (arg2), |
df407dfe | 9825 | TYPE_LENGTH (value_type (arg1))) == 0; |
4c4b4cd2 PH |
9826 | } |
9827 | return value_equal (arg1, arg2); | |
9828 | } | |
9829 | ||
52ce6436 PH |
9830 | /* Total number of component associations in the aggregate starting at |
9831 | index PC in EXP. Assumes that index PC is the start of an | |
0963b4bd | 9832 | OP_AGGREGATE. */ |
52ce6436 PH |
9833 | |
9834 | static int | |
9835 | num_component_specs (struct expression *exp, int pc) | |
9836 | { | |
9837 | int n, m, i; | |
5b4ee69b | 9838 | |
52ce6436 PH |
9839 | m = exp->elts[pc + 1].longconst; |
9840 | pc += 3; | |
9841 | n = 0; | |
9842 | for (i = 0; i < m; i += 1) | |
9843 | { | |
9844 | switch (exp->elts[pc].opcode) | |
9845 | { | |
9846 | default: | |
9847 | n += 1; | |
9848 | break; | |
9849 | case OP_CHOICES: | |
9850 | n += exp->elts[pc + 1].longconst; | |
9851 | break; | |
9852 | } | |
9853 | ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP); | |
9854 | } | |
9855 | return n; | |
9856 | } | |
9857 | ||
9858 | /* Assign the result of evaluating EXP starting at *POS to the INDEXth | |
9859 | component of LHS (a simple array or a record), updating *POS past | |
9860 | the expression, assuming that LHS is contained in CONTAINER. Does | |
9861 | not modify the inferior's memory, nor does it modify LHS (unless | |
9862 | LHS == CONTAINER). */ | |
9863 | ||
9864 | static void | |
9865 | assign_component (struct value *container, struct value *lhs, LONGEST index, | |
9866 | struct expression *exp, int *pos) | |
9867 | { | |
9868 | struct value *mark = value_mark (); | |
9869 | struct value *elt; | |
5b4ee69b | 9870 | |
52ce6436 PH |
9871 | if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY) |
9872 | { | |
22601c15 UW |
9873 | struct type *index_type = builtin_type (exp->gdbarch)->builtin_int; |
9874 | struct value *index_val = value_from_longest (index_type, index); | |
5b4ee69b | 9875 | |
52ce6436 PH |
9876 | elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val)); |
9877 | } | |
9878 | else | |
9879 | { | |
9880 | elt = ada_index_struct_field (index, lhs, 0, value_type (lhs)); | |
c48db5ca | 9881 | elt = ada_to_fixed_value (elt); |
52ce6436 PH |
9882 | } |
9883 | ||
9884 | if (exp->elts[*pos].opcode == OP_AGGREGATE) | |
9885 | assign_aggregate (container, elt, exp, pos, EVAL_NORMAL); | |
9886 | else | |
9887 | value_assign_to_component (container, elt, | |
9888 | ada_evaluate_subexp (NULL, exp, pos, | |
9889 | EVAL_NORMAL)); | |
9890 | ||
9891 | value_free_to_mark (mark); | |
9892 | } | |
9893 | ||
9894 | /* Assuming that LHS represents an lvalue having a record or array | |
9895 | type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment | |
9896 | of that aggregate's value to LHS, advancing *POS past the | |
9897 | aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an | |
9898 | lvalue containing LHS (possibly LHS itself). Does not modify | |
9899 | the inferior's memory, nor does it modify the contents of | |
0963b4bd | 9900 | LHS (unless == CONTAINER). Returns the modified CONTAINER. */ |
52ce6436 PH |
9901 | |
9902 | static struct value * | |
9903 | assign_aggregate (struct value *container, | |
9904 | struct value *lhs, struct expression *exp, | |
9905 | int *pos, enum noside noside) | |
9906 | { | |
9907 | struct type *lhs_type; | |
9908 | int n = exp->elts[*pos+1].longconst; | |
9909 | LONGEST low_index, high_index; | |
9910 | int num_specs; | |
9911 | LONGEST *indices; | |
9912 | int max_indices, num_indices; | |
52ce6436 | 9913 | int i; |
52ce6436 PH |
9914 | |
9915 | *pos += 3; | |
9916 | if (noside != EVAL_NORMAL) | |
9917 | { | |
52ce6436 PH |
9918 | for (i = 0; i < n; i += 1) |
9919 | ada_evaluate_subexp (NULL, exp, pos, noside); | |
9920 | return container; | |
9921 | } | |
9922 | ||
9923 | container = ada_coerce_ref (container); | |
9924 | if (ada_is_direct_array_type (value_type (container))) | |
9925 | container = ada_coerce_to_simple_array (container); | |
9926 | lhs = ada_coerce_ref (lhs); | |
9927 | if (!deprecated_value_modifiable (lhs)) | |
9928 | error (_("Left operand of assignment is not a modifiable lvalue.")); | |
9929 | ||
9930 | lhs_type = value_type (lhs); | |
9931 | if (ada_is_direct_array_type (lhs_type)) | |
9932 | { | |
9933 | lhs = ada_coerce_to_simple_array (lhs); | |
9934 | lhs_type = value_type (lhs); | |
9935 | low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type); | |
9936 | high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type); | |
52ce6436 PH |
9937 | } |
9938 | else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT) | |
9939 | { | |
9940 | low_index = 0; | |
9941 | high_index = num_visible_fields (lhs_type) - 1; | |
52ce6436 PH |
9942 | } |
9943 | else | |
9944 | error (_("Left-hand side must be array or record.")); | |
9945 | ||
9946 | num_specs = num_component_specs (exp, *pos - 3); | |
9947 | max_indices = 4 * num_specs + 4; | |
8d749320 | 9948 | indices = XALLOCAVEC (LONGEST, max_indices); |
52ce6436 PH |
9949 | indices[0] = indices[1] = low_index - 1; |
9950 | indices[2] = indices[3] = high_index + 1; | |
9951 | num_indices = 4; | |
9952 | ||
9953 | for (i = 0; i < n; i += 1) | |
9954 | { | |
9955 | switch (exp->elts[*pos].opcode) | |
9956 | { | |
1fbf5ada JB |
9957 | case OP_CHOICES: |
9958 | aggregate_assign_from_choices (container, lhs, exp, pos, indices, | |
9959 | &num_indices, max_indices, | |
9960 | low_index, high_index); | |
9961 | break; | |
9962 | case OP_POSITIONAL: | |
9963 | aggregate_assign_positional (container, lhs, exp, pos, indices, | |
52ce6436 PH |
9964 | &num_indices, max_indices, |
9965 | low_index, high_index); | |
1fbf5ada JB |
9966 | break; |
9967 | case OP_OTHERS: | |
9968 | if (i != n-1) | |
9969 | error (_("Misplaced 'others' clause")); | |
9970 | aggregate_assign_others (container, lhs, exp, pos, indices, | |
9971 | num_indices, low_index, high_index); | |
9972 | break; | |
9973 | default: | |
9974 | error (_("Internal error: bad aggregate clause")); | |
52ce6436 PH |
9975 | } |
9976 | } | |
9977 | ||
9978 | return container; | |
9979 | } | |
9980 | ||
9981 | /* Assign into the component of LHS indexed by the OP_POSITIONAL | |
9982 | construct at *POS, updating *POS past the construct, given that | |
9983 | the positions are relative to lower bound LOW, where HIGH is the | |
9984 | upper bound. Record the position in INDICES[0 .. MAX_INDICES-1] | |
9985 | updating *NUM_INDICES as needed. CONTAINER is as for | |
0963b4bd | 9986 | assign_aggregate. */ |
52ce6436 PH |
9987 | static void |
9988 | aggregate_assign_positional (struct value *container, | |
9989 | struct value *lhs, struct expression *exp, | |
9990 | int *pos, LONGEST *indices, int *num_indices, | |
9991 | int max_indices, LONGEST low, LONGEST high) | |
9992 | { | |
9993 | LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low; | |
9994 | ||
9995 | if (ind - 1 == high) | |
e1d5a0d2 | 9996 | warning (_("Extra components in aggregate ignored.")); |
52ce6436 PH |
9997 | if (ind <= high) |
9998 | { | |
9999 | add_component_interval (ind, ind, indices, num_indices, max_indices); | |
10000 | *pos += 3; | |
10001 | assign_component (container, lhs, ind, exp, pos); | |
10002 | } | |
10003 | else | |
10004 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
10005 | } | |
10006 | ||
10007 | /* Assign into the components of LHS indexed by the OP_CHOICES | |
10008 | construct at *POS, updating *POS past the construct, given that | |
10009 | the allowable indices are LOW..HIGH. Record the indices assigned | |
10010 | to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as | |
0963b4bd | 10011 | needed. CONTAINER is as for assign_aggregate. */ |
52ce6436 PH |
10012 | static void |
10013 | aggregate_assign_from_choices (struct value *container, | |
10014 | struct value *lhs, struct expression *exp, | |
10015 | int *pos, LONGEST *indices, int *num_indices, | |
10016 | int max_indices, LONGEST low, LONGEST high) | |
10017 | { | |
10018 | int j; | |
10019 | int n_choices = longest_to_int (exp->elts[*pos+1].longconst); | |
10020 | int choice_pos, expr_pc; | |
10021 | int is_array = ada_is_direct_array_type (value_type (lhs)); | |
10022 | ||
10023 | choice_pos = *pos += 3; | |
10024 | ||
10025 | for (j = 0; j < n_choices; j += 1) | |
10026 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
10027 | expr_pc = *pos; | |
10028 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
10029 | ||
10030 | for (j = 0; j < n_choices; j += 1) | |
10031 | { | |
10032 | LONGEST lower, upper; | |
10033 | enum exp_opcode op = exp->elts[choice_pos].opcode; | |
5b4ee69b | 10034 | |
52ce6436 PH |
10035 | if (op == OP_DISCRETE_RANGE) |
10036 | { | |
10037 | choice_pos += 1; | |
10038 | lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos, | |
10039 | EVAL_NORMAL)); | |
10040 | upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos, | |
10041 | EVAL_NORMAL)); | |
10042 | } | |
10043 | else if (is_array) | |
10044 | { | |
10045 | lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos, | |
10046 | EVAL_NORMAL)); | |
10047 | upper = lower; | |
10048 | } | |
10049 | else | |
10050 | { | |
10051 | int ind; | |
0d5cff50 | 10052 | const char *name; |
5b4ee69b | 10053 | |
52ce6436 PH |
10054 | switch (op) |
10055 | { | |
10056 | case OP_NAME: | |
10057 | name = &exp->elts[choice_pos + 2].string; | |
10058 | break; | |
10059 | case OP_VAR_VALUE: | |
10060 | name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol); | |
10061 | break; | |
10062 | default: | |
10063 | error (_("Invalid record component association.")); | |
10064 | } | |
10065 | ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP); | |
10066 | ind = 0; | |
10067 | if (! find_struct_field (name, value_type (lhs), 0, | |
10068 | NULL, NULL, NULL, NULL, &ind)) | |
10069 | error (_("Unknown component name: %s."), name); | |
10070 | lower = upper = ind; | |
10071 | } | |
10072 | ||
10073 | if (lower <= upper && (lower < low || upper > high)) | |
10074 | error (_("Index in component association out of bounds.")); | |
10075 | ||
10076 | add_component_interval (lower, upper, indices, num_indices, | |
10077 | max_indices); | |
10078 | while (lower <= upper) | |
10079 | { | |
10080 | int pos1; | |
5b4ee69b | 10081 | |
52ce6436 PH |
10082 | pos1 = expr_pc; |
10083 | assign_component (container, lhs, lower, exp, &pos1); | |
10084 | lower += 1; | |
10085 | } | |
10086 | } | |
10087 | } | |
10088 | ||
10089 | /* Assign the value of the expression in the OP_OTHERS construct in | |
10090 | EXP at *POS into the components of LHS indexed from LOW .. HIGH that | |
10091 | have not been previously assigned. The index intervals already assigned | |
10092 | are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the | |
0963b4bd | 10093 | OP_OTHERS clause. CONTAINER is as for assign_aggregate. */ |
52ce6436 PH |
10094 | static void |
10095 | aggregate_assign_others (struct value *container, | |
10096 | struct value *lhs, struct expression *exp, | |
10097 | int *pos, LONGEST *indices, int num_indices, | |
10098 | LONGEST low, LONGEST high) | |
10099 | { | |
10100 | int i; | |
5ce64950 | 10101 | int expr_pc = *pos + 1; |
52ce6436 PH |
10102 | |
10103 | for (i = 0; i < num_indices - 2; i += 2) | |
10104 | { | |
10105 | LONGEST ind; | |
5b4ee69b | 10106 | |
52ce6436 PH |
10107 | for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1) |
10108 | { | |
5ce64950 | 10109 | int localpos; |
5b4ee69b | 10110 | |
5ce64950 MS |
10111 | localpos = expr_pc; |
10112 | assign_component (container, lhs, ind, exp, &localpos); | |
52ce6436 PH |
10113 | } |
10114 | } | |
10115 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
10116 | } | |
10117 | ||
10118 | /* Add the interval [LOW .. HIGH] to the sorted set of intervals | |
10119 | [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ], | |
10120 | modifying *SIZE as needed. It is an error if *SIZE exceeds | |
10121 | MAX_SIZE. The resulting intervals do not overlap. */ | |
10122 | static void | |
10123 | add_component_interval (LONGEST low, LONGEST high, | |
10124 | LONGEST* indices, int *size, int max_size) | |
10125 | { | |
10126 | int i, j; | |
5b4ee69b | 10127 | |
52ce6436 PH |
10128 | for (i = 0; i < *size; i += 2) { |
10129 | if (high >= indices[i] && low <= indices[i + 1]) | |
10130 | { | |
10131 | int kh; | |
5b4ee69b | 10132 | |
52ce6436 PH |
10133 | for (kh = i + 2; kh < *size; kh += 2) |
10134 | if (high < indices[kh]) | |
10135 | break; | |
10136 | if (low < indices[i]) | |
10137 | indices[i] = low; | |
10138 | indices[i + 1] = indices[kh - 1]; | |
10139 | if (high > indices[i + 1]) | |
10140 | indices[i + 1] = high; | |
10141 | memcpy (indices + i + 2, indices + kh, *size - kh); | |
10142 | *size -= kh - i - 2; | |
10143 | return; | |
10144 | } | |
10145 | else if (high < indices[i]) | |
10146 | break; | |
10147 | } | |
10148 | ||
10149 | if (*size == max_size) | |
10150 | error (_("Internal error: miscounted aggregate components.")); | |
10151 | *size += 2; | |
10152 | for (j = *size-1; j >= i+2; j -= 1) | |
10153 | indices[j] = indices[j - 2]; | |
10154 | indices[i] = low; | |
10155 | indices[i + 1] = high; | |
10156 | } | |
10157 | ||
6e48bd2c JB |
10158 | /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2 |
10159 | is different. */ | |
10160 | ||
10161 | static struct value * | |
10162 | ada_value_cast (struct type *type, struct value *arg2, enum noside noside) | |
10163 | { | |
10164 | if (type == ada_check_typedef (value_type (arg2))) | |
10165 | return arg2; | |
10166 | ||
10167 | if (ada_is_fixed_point_type (type)) | |
10168 | return (cast_to_fixed (type, arg2)); | |
10169 | ||
10170 | if (ada_is_fixed_point_type (value_type (arg2))) | |
a53b7a21 | 10171 | return cast_from_fixed (type, arg2); |
6e48bd2c JB |
10172 | |
10173 | return value_cast (type, arg2); | |
10174 | } | |
10175 | ||
284614f0 JB |
10176 | /* Evaluating Ada expressions, and printing their result. |
10177 | ------------------------------------------------------ | |
10178 | ||
21649b50 JB |
10179 | 1. Introduction: |
10180 | ---------------- | |
10181 | ||
284614f0 JB |
10182 | We usually evaluate an Ada expression in order to print its value. |
10183 | We also evaluate an expression in order to print its type, which | |
10184 | happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation, | |
10185 | but we'll focus mostly on the EVAL_NORMAL phase. In practice, the | |
10186 | EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of | |
10187 | the evaluation compared to the EVAL_NORMAL, but is otherwise very | |
10188 | similar. | |
10189 | ||
10190 | Evaluating expressions is a little more complicated for Ada entities | |
10191 | than it is for entities in languages such as C. The main reason for | |
10192 | this is that Ada provides types whose definition might be dynamic. | |
10193 | One example of such types is variant records. Or another example | |
10194 | would be an array whose bounds can only be known at run time. | |
10195 | ||
10196 | The following description is a general guide as to what should be | |
10197 | done (and what should NOT be done) in order to evaluate an expression | |
10198 | involving such types, and when. This does not cover how the semantic | |
10199 | information is encoded by GNAT as this is covered separatly. For the | |
10200 | document used as the reference for the GNAT encoding, see exp_dbug.ads | |
10201 | in the GNAT sources. | |
10202 | ||
10203 | Ideally, we should embed each part of this description next to its | |
10204 | associated code. Unfortunately, the amount of code is so vast right | |
10205 | now that it's hard to see whether the code handling a particular | |
10206 | situation might be duplicated or not. One day, when the code is | |
10207 | cleaned up, this guide might become redundant with the comments | |
10208 | inserted in the code, and we might want to remove it. | |
10209 | ||
21649b50 JB |
10210 | 2. ``Fixing'' an Entity, the Simple Case: |
10211 | ----------------------------------------- | |
10212 | ||
284614f0 JB |
10213 | When evaluating Ada expressions, the tricky issue is that they may |
10214 | reference entities whose type contents and size are not statically | |
10215 | known. Consider for instance a variant record: | |
10216 | ||
10217 | type Rec (Empty : Boolean := True) is record | |
10218 | case Empty is | |
10219 | when True => null; | |
10220 | when False => Value : Integer; | |
10221 | end case; | |
10222 | end record; | |
10223 | Yes : Rec := (Empty => False, Value => 1); | |
10224 | No : Rec := (empty => True); | |
10225 | ||
10226 | The size and contents of that record depends on the value of the | |
10227 | descriminant (Rec.Empty). At this point, neither the debugging | |
10228 | information nor the associated type structure in GDB are able to | |
10229 | express such dynamic types. So what the debugger does is to create | |
10230 | "fixed" versions of the type that applies to the specific object. | |
10231 | We also informally refer to this opperation as "fixing" an object, | |
10232 | which means creating its associated fixed type. | |
10233 | ||
10234 | Example: when printing the value of variable "Yes" above, its fixed | |
10235 | type would look like this: | |
10236 | ||
10237 | type Rec is record | |
10238 | Empty : Boolean; | |
10239 | Value : Integer; | |
10240 | end record; | |
10241 | ||
10242 | On the other hand, if we printed the value of "No", its fixed type | |
10243 | would become: | |
10244 | ||
10245 | type Rec is record | |
10246 | Empty : Boolean; | |
10247 | end record; | |
10248 | ||
10249 | Things become a little more complicated when trying to fix an entity | |
10250 | with a dynamic type that directly contains another dynamic type, | |
10251 | such as an array of variant records, for instance. There are | |
10252 | two possible cases: Arrays, and records. | |
10253 | ||
21649b50 JB |
10254 | 3. ``Fixing'' Arrays: |
10255 | --------------------- | |
10256 | ||
10257 | The type structure in GDB describes an array in terms of its bounds, | |
10258 | and the type of its elements. By design, all elements in the array | |
10259 | have the same type and we cannot represent an array of variant elements | |
10260 | using the current type structure in GDB. When fixing an array, | |
10261 | we cannot fix the array element, as we would potentially need one | |
10262 | fixed type per element of the array. As a result, the best we can do | |
10263 | when fixing an array is to produce an array whose bounds and size | |
10264 | are correct (allowing us to read it from memory), but without having | |
10265 | touched its element type. Fixing each element will be done later, | |
10266 | when (if) necessary. | |
10267 | ||
10268 | Arrays are a little simpler to handle than records, because the same | |
10269 | amount of memory is allocated for each element of the array, even if | |
1b536f04 | 10270 | the amount of space actually used by each element differs from element |
21649b50 | 10271 | to element. Consider for instance the following array of type Rec: |
284614f0 JB |
10272 | |
10273 | type Rec_Array is array (1 .. 2) of Rec; | |
10274 | ||
1b536f04 JB |
10275 | The actual amount of memory occupied by each element might be different |
10276 | from element to element, depending on the value of their discriminant. | |
21649b50 | 10277 | But the amount of space reserved for each element in the array remains |
1b536f04 | 10278 | fixed regardless. So we simply need to compute that size using |
21649b50 JB |
10279 | the debugging information available, from which we can then determine |
10280 | the array size (we multiply the number of elements of the array by | |
10281 | the size of each element). | |
10282 | ||
10283 | The simplest case is when we have an array of a constrained element | |
10284 | type. For instance, consider the following type declarations: | |
10285 | ||
10286 | type Bounded_String (Max_Size : Integer) is | |
10287 | Length : Integer; | |
10288 | Buffer : String (1 .. Max_Size); | |
10289 | end record; | |
10290 | type Bounded_String_Array is array (1 ..2) of Bounded_String (80); | |
10291 | ||
10292 | In this case, the compiler describes the array as an array of | |
10293 | variable-size elements (identified by its XVS suffix) for which | |
10294 | the size can be read in the parallel XVZ variable. | |
10295 | ||
10296 | In the case of an array of an unconstrained element type, the compiler | |
10297 | wraps the array element inside a private PAD type. This type should not | |
10298 | be shown to the user, and must be "unwrap"'ed before printing. Note | |
284614f0 JB |
10299 | that we also use the adjective "aligner" in our code to designate |
10300 | these wrapper types. | |
10301 | ||
1b536f04 | 10302 | In some cases, the size allocated for each element is statically |
21649b50 JB |
10303 | known. In that case, the PAD type already has the correct size, |
10304 | and the array element should remain unfixed. | |
10305 | ||
10306 | But there are cases when this size is not statically known. | |
10307 | For instance, assuming that "Five" is an integer variable: | |
284614f0 JB |
10308 | |
10309 | type Dynamic is array (1 .. Five) of Integer; | |
10310 | type Wrapper (Has_Length : Boolean := False) is record | |
10311 | Data : Dynamic; | |
10312 | case Has_Length is | |
10313 | when True => Length : Integer; | |
10314 | when False => null; | |
10315 | end case; | |
10316 | end record; | |
10317 | type Wrapper_Array is array (1 .. 2) of Wrapper; | |
10318 | ||
10319 | Hello : Wrapper_Array := (others => (Has_Length => True, | |
10320 | Data => (others => 17), | |
10321 | Length => 1)); | |
10322 | ||
10323 | ||
10324 | The debugging info would describe variable Hello as being an | |
10325 | array of a PAD type. The size of that PAD type is not statically | |
10326 | known, but can be determined using a parallel XVZ variable. | |
10327 | In that case, a copy of the PAD type with the correct size should | |
10328 | be used for the fixed array. | |
10329 | ||
21649b50 JB |
10330 | 3. ``Fixing'' record type objects: |
10331 | ---------------------------------- | |
10332 | ||
10333 | Things are slightly different from arrays in the case of dynamic | |
284614f0 JB |
10334 | record types. In this case, in order to compute the associated |
10335 | fixed type, we need to determine the size and offset of each of | |
10336 | its components. This, in turn, requires us to compute the fixed | |
10337 | type of each of these components. | |
10338 | ||
10339 | Consider for instance the example: | |
10340 | ||
10341 | type Bounded_String (Max_Size : Natural) is record | |
10342 | Str : String (1 .. Max_Size); | |
10343 | Length : Natural; | |
10344 | end record; | |
10345 | My_String : Bounded_String (Max_Size => 10); | |
10346 | ||
10347 | In that case, the position of field "Length" depends on the size | |
10348 | of field Str, which itself depends on the value of the Max_Size | |
21649b50 | 10349 | discriminant. In order to fix the type of variable My_String, |
284614f0 JB |
10350 | we need to fix the type of field Str. Therefore, fixing a variant |
10351 | record requires us to fix each of its components. | |
10352 | ||
10353 | However, if a component does not have a dynamic size, the component | |
10354 | should not be fixed. In particular, fields that use a PAD type | |
10355 | should not fixed. Here is an example where this might happen | |
10356 | (assuming type Rec above): | |
10357 | ||
10358 | type Container (Big : Boolean) is record | |
10359 | First : Rec; | |
10360 | After : Integer; | |
10361 | case Big is | |
10362 | when True => Another : Integer; | |
10363 | when False => null; | |
10364 | end case; | |
10365 | end record; | |
10366 | My_Container : Container := (Big => False, | |
10367 | First => (Empty => True), | |
10368 | After => 42); | |
10369 | ||
10370 | In that example, the compiler creates a PAD type for component First, | |
10371 | whose size is constant, and then positions the component After just | |
10372 | right after it. The offset of component After is therefore constant | |
10373 | in this case. | |
10374 | ||
10375 | The debugger computes the position of each field based on an algorithm | |
10376 | that uses, among other things, the actual position and size of the field | |
21649b50 JB |
10377 | preceding it. Let's now imagine that the user is trying to print |
10378 | the value of My_Container. If the type fixing was recursive, we would | |
284614f0 JB |
10379 | end up computing the offset of field After based on the size of the |
10380 | fixed version of field First. And since in our example First has | |
10381 | only one actual field, the size of the fixed type is actually smaller | |
10382 | than the amount of space allocated to that field, and thus we would | |
10383 | compute the wrong offset of field After. | |
10384 | ||
21649b50 JB |
10385 | To make things more complicated, we need to watch out for dynamic |
10386 | components of variant records (identified by the ___XVL suffix in | |
10387 | the component name). Even if the target type is a PAD type, the size | |
10388 | of that type might not be statically known. So the PAD type needs | |
10389 | to be unwrapped and the resulting type needs to be fixed. Otherwise, | |
10390 | we might end up with the wrong size for our component. This can be | |
10391 | observed with the following type declarations: | |
284614f0 JB |
10392 | |
10393 | type Octal is new Integer range 0 .. 7; | |
10394 | type Octal_Array is array (Positive range <>) of Octal; | |
10395 | pragma Pack (Octal_Array); | |
10396 | ||
10397 | type Octal_Buffer (Size : Positive) is record | |
10398 | Buffer : Octal_Array (1 .. Size); | |
10399 | Length : Integer; | |
10400 | end record; | |
10401 | ||
10402 | In that case, Buffer is a PAD type whose size is unset and needs | |
10403 | to be computed by fixing the unwrapped type. | |
10404 | ||
21649b50 JB |
10405 | 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity: |
10406 | ---------------------------------------------------------- | |
10407 | ||
10408 | Lastly, when should the sub-elements of an entity that remained unfixed | |
284614f0 JB |
10409 | thus far, be actually fixed? |
10410 | ||
10411 | The answer is: Only when referencing that element. For instance | |
10412 | when selecting one component of a record, this specific component | |
10413 | should be fixed at that point in time. Or when printing the value | |
10414 | of a record, each component should be fixed before its value gets | |
10415 | printed. Similarly for arrays, the element of the array should be | |
10416 | fixed when printing each element of the array, or when extracting | |
10417 | one element out of that array. On the other hand, fixing should | |
10418 | not be performed on the elements when taking a slice of an array! | |
10419 | ||
10420 | Note that one of the side-effects of miscomputing the offset and | |
10421 | size of each field is that we end up also miscomputing the size | |
10422 | of the containing type. This can have adverse results when computing | |
10423 | the value of an entity. GDB fetches the value of an entity based | |
10424 | on the size of its type, and thus a wrong size causes GDB to fetch | |
10425 | the wrong amount of memory. In the case where the computed size is | |
10426 | too small, GDB fetches too little data to print the value of our | |
10427 | entiry. Results in this case as unpredicatble, as we usually read | |
10428 | past the buffer containing the data =:-o. */ | |
10429 | ||
10430 | /* Implement the evaluate_exp routine in the exp_descriptor structure | |
10431 | for the Ada language. */ | |
10432 | ||
52ce6436 | 10433 | static struct value * |
ebf56fd3 | 10434 | ada_evaluate_subexp (struct type *expect_type, struct expression *exp, |
4c4b4cd2 | 10435 | int *pos, enum noside noside) |
14f9c5c9 AS |
10436 | { |
10437 | enum exp_opcode op; | |
b5385fc0 | 10438 | int tem; |
14f9c5c9 | 10439 | int pc; |
5ec18f2b | 10440 | int preeval_pos; |
14f9c5c9 AS |
10441 | struct value *arg1 = NULL, *arg2 = NULL, *arg3; |
10442 | struct type *type; | |
52ce6436 | 10443 | int nargs, oplen; |
d2e4a39e | 10444 | struct value **argvec; |
14f9c5c9 | 10445 | |
d2e4a39e AS |
10446 | pc = *pos; |
10447 | *pos += 1; | |
14f9c5c9 AS |
10448 | op = exp->elts[pc].opcode; |
10449 | ||
d2e4a39e | 10450 | switch (op) |
14f9c5c9 AS |
10451 | { |
10452 | default: | |
10453 | *pos -= 1; | |
6e48bd2c | 10454 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); |
ca1f964d JG |
10455 | |
10456 | if (noside == EVAL_NORMAL) | |
10457 | arg1 = unwrap_value (arg1); | |
6e48bd2c JB |
10458 | |
10459 | /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided, | |
10460 | then we need to perform the conversion manually, because | |
10461 | evaluate_subexp_standard doesn't do it. This conversion is | |
10462 | necessary in Ada because the different kinds of float/fixed | |
10463 | types in Ada have different representations. | |
10464 | ||
10465 | Similarly, we need to perform the conversion from OP_LONG | |
10466 | ourselves. */ | |
10467 | if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL) | |
10468 | arg1 = ada_value_cast (expect_type, arg1, noside); | |
10469 | ||
10470 | return arg1; | |
4c4b4cd2 PH |
10471 | |
10472 | case OP_STRING: | |
10473 | { | |
76a01679 | 10474 | struct value *result; |
5b4ee69b | 10475 | |
76a01679 JB |
10476 | *pos -= 1; |
10477 | result = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10478 | /* The result type will have code OP_STRING, bashed there from | |
10479 | OP_ARRAY. Bash it back. */ | |
df407dfe AC |
10480 | if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING) |
10481 | TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY; | |
76a01679 | 10482 | return result; |
4c4b4cd2 | 10483 | } |
14f9c5c9 AS |
10484 | |
10485 | case UNOP_CAST: | |
10486 | (*pos) += 2; | |
10487 | type = exp->elts[pc + 1].type; | |
10488 | arg1 = evaluate_subexp (type, exp, pos, noside); | |
10489 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10490 | goto nosideret; |
6e48bd2c | 10491 | arg1 = ada_value_cast (type, arg1, noside); |
14f9c5c9 AS |
10492 | return arg1; |
10493 | ||
4c4b4cd2 PH |
10494 | case UNOP_QUAL: |
10495 | (*pos) += 2; | |
10496 | type = exp->elts[pc + 1].type; | |
10497 | return ada_evaluate_subexp (type, exp, pos, noside); | |
10498 | ||
14f9c5c9 AS |
10499 | case BINOP_ASSIGN: |
10500 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
52ce6436 PH |
10501 | if (exp->elts[*pos].opcode == OP_AGGREGATE) |
10502 | { | |
10503 | arg1 = assign_aggregate (arg1, arg1, exp, pos, noside); | |
10504 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
10505 | return arg1; | |
10506 | return ada_value_assign (arg1, arg1); | |
10507 | } | |
003f3813 JB |
10508 | /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1, |
10509 | except if the lhs of our assignment is a convenience variable. | |
10510 | In the case of assigning to a convenience variable, the lhs | |
10511 | should be exactly the result of the evaluation of the rhs. */ | |
10512 | type = value_type (arg1); | |
10513 | if (VALUE_LVAL (arg1) == lval_internalvar) | |
10514 | type = NULL; | |
10515 | arg2 = evaluate_subexp (type, exp, pos, noside); | |
14f9c5c9 | 10516 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) |
4c4b4cd2 | 10517 | return arg1; |
df407dfe AC |
10518 | if (ada_is_fixed_point_type (value_type (arg1))) |
10519 | arg2 = cast_to_fixed (value_type (arg1), arg2); | |
10520 | else if (ada_is_fixed_point_type (value_type (arg2))) | |
76a01679 | 10521 | error |
323e0a4a | 10522 | (_("Fixed-point values must be assigned to fixed-point variables")); |
d2e4a39e | 10523 | else |
df407dfe | 10524 | arg2 = coerce_for_assign (value_type (arg1), arg2); |
4c4b4cd2 | 10525 | return ada_value_assign (arg1, arg2); |
14f9c5c9 AS |
10526 | |
10527 | case BINOP_ADD: | |
10528 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10529 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10530 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10531 | goto nosideret; |
2ac8a782 JB |
10532 | if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR) |
10533 | return (value_from_longest | |
10534 | (value_type (arg1), | |
10535 | value_as_long (arg1) + value_as_long (arg2))); | |
c40cc657 JB |
10536 | if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR) |
10537 | return (value_from_longest | |
10538 | (value_type (arg2), | |
10539 | value_as_long (arg1) + value_as_long (arg2))); | |
df407dfe AC |
10540 | if ((ada_is_fixed_point_type (value_type (arg1)) |
10541 | || ada_is_fixed_point_type (value_type (arg2))) | |
10542 | && value_type (arg1) != value_type (arg2)) | |
323e0a4a | 10543 | error (_("Operands of fixed-point addition must have the same type")); |
b7789565 JB |
10544 | /* Do the addition, and cast the result to the type of the first |
10545 | argument. We cannot cast the result to a reference type, so if | |
10546 | ARG1 is a reference type, find its underlying type. */ | |
10547 | type = value_type (arg1); | |
10548 | while (TYPE_CODE (type) == TYPE_CODE_REF) | |
10549 | type = TYPE_TARGET_TYPE (type); | |
f44316fa | 10550 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
89eef114 | 10551 | return value_cast (type, value_binop (arg1, arg2, BINOP_ADD)); |
14f9c5c9 AS |
10552 | |
10553 | case BINOP_SUB: | |
10554 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10555 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10556 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10557 | goto nosideret; |
2ac8a782 JB |
10558 | if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR) |
10559 | return (value_from_longest | |
10560 | (value_type (arg1), | |
10561 | value_as_long (arg1) - value_as_long (arg2))); | |
c40cc657 JB |
10562 | if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR) |
10563 | return (value_from_longest | |
10564 | (value_type (arg2), | |
10565 | value_as_long (arg1) - value_as_long (arg2))); | |
df407dfe AC |
10566 | if ((ada_is_fixed_point_type (value_type (arg1)) |
10567 | || ada_is_fixed_point_type (value_type (arg2))) | |
10568 | && value_type (arg1) != value_type (arg2)) | |
0963b4bd MS |
10569 | error (_("Operands of fixed-point subtraction " |
10570 | "must have the same type")); | |
b7789565 JB |
10571 | /* Do the substraction, and cast the result to the type of the first |
10572 | argument. We cannot cast the result to a reference type, so if | |
10573 | ARG1 is a reference type, find its underlying type. */ | |
10574 | type = value_type (arg1); | |
10575 | while (TYPE_CODE (type) == TYPE_CODE_REF) | |
10576 | type = TYPE_TARGET_TYPE (type); | |
f44316fa | 10577 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
89eef114 | 10578 | return value_cast (type, value_binop (arg1, arg2, BINOP_SUB)); |
14f9c5c9 AS |
10579 | |
10580 | case BINOP_MUL: | |
10581 | case BINOP_DIV: | |
e1578042 JB |
10582 | case BINOP_REM: |
10583 | case BINOP_MOD: | |
14f9c5c9 AS |
10584 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
10585 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10586 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10587 | goto nosideret; |
e1578042 | 10588 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
9c2be529 JB |
10589 | { |
10590 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
10591 | return value_zero (value_type (arg1), not_lval); | |
10592 | } | |
14f9c5c9 | 10593 | else |
4c4b4cd2 | 10594 | { |
a53b7a21 | 10595 | type = builtin_type (exp->gdbarch)->builtin_double; |
df407dfe | 10596 | if (ada_is_fixed_point_type (value_type (arg1))) |
a53b7a21 | 10597 | arg1 = cast_from_fixed (type, arg1); |
df407dfe | 10598 | if (ada_is_fixed_point_type (value_type (arg2))) |
a53b7a21 | 10599 | arg2 = cast_from_fixed (type, arg2); |
f44316fa | 10600 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
4c4b4cd2 PH |
10601 | return ada_value_binop (arg1, arg2, op); |
10602 | } | |
10603 | ||
4c4b4cd2 PH |
10604 | case BINOP_EQUAL: |
10605 | case BINOP_NOTEQUAL: | |
14f9c5c9 | 10606 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
df407dfe | 10607 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
14f9c5c9 | 10608 | if (noside == EVAL_SKIP) |
76a01679 | 10609 | goto nosideret; |
4c4b4cd2 | 10610 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 10611 | tem = 0; |
4c4b4cd2 | 10612 | else |
f44316fa UW |
10613 | { |
10614 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
10615 | tem = ada_value_equal (arg1, arg2); | |
10616 | } | |
4c4b4cd2 | 10617 | if (op == BINOP_NOTEQUAL) |
76a01679 | 10618 | tem = !tem; |
fbb06eb1 UW |
10619 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10620 | return value_from_longest (type, (LONGEST) tem); | |
4c4b4cd2 PH |
10621 | |
10622 | case UNOP_NEG: | |
10623 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10624 | if (noside == EVAL_SKIP) | |
10625 | goto nosideret; | |
df407dfe AC |
10626 | else if (ada_is_fixed_point_type (value_type (arg1))) |
10627 | return value_cast (value_type (arg1), value_neg (arg1)); | |
14f9c5c9 | 10628 | else |
f44316fa UW |
10629 | { |
10630 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
10631 | return value_neg (arg1); | |
10632 | } | |
4c4b4cd2 | 10633 | |
2330c6c6 JB |
10634 | case BINOP_LOGICAL_AND: |
10635 | case BINOP_LOGICAL_OR: | |
10636 | case UNOP_LOGICAL_NOT: | |
000d5124 JB |
10637 | { |
10638 | struct value *val; | |
10639 | ||
10640 | *pos -= 1; | |
10641 | val = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
fbb06eb1 UW |
10642 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10643 | return value_cast (type, val); | |
000d5124 | 10644 | } |
2330c6c6 JB |
10645 | |
10646 | case BINOP_BITWISE_AND: | |
10647 | case BINOP_BITWISE_IOR: | |
10648 | case BINOP_BITWISE_XOR: | |
000d5124 JB |
10649 | { |
10650 | struct value *val; | |
10651 | ||
10652 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
10653 | *pos = pc; | |
10654 | val = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10655 | ||
10656 | return value_cast (value_type (arg1), val); | |
10657 | } | |
2330c6c6 | 10658 | |
14f9c5c9 AS |
10659 | case OP_VAR_VALUE: |
10660 | *pos -= 1; | |
6799def4 | 10661 | |
14f9c5c9 | 10662 | if (noside == EVAL_SKIP) |
4c4b4cd2 PH |
10663 | { |
10664 | *pos += 4; | |
10665 | goto nosideret; | |
10666 | } | |
da5c522f JB |
10667 | |
10668 | if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN) | |
76a01679 JB |
10669 | /* Only encountered when an unresolved symbol occurs in a |
10670 | context other than a function call, in which case, it is | |
52ce6436 | 10671 | invalid. */ |
323e0a4a | 10672 | error (_("Unexpected unresolved symbol, %s, during evaluation"), |
4c4b4cd2 | 10673 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
da5c522f JB |
10674 | |
10675 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
4c4b4cd2 | 10676 | { |
0c1f74cf | 10677 | type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol)); |
31dbc1c5 JB |
10678 | /* Check to see if this is a tagged type. We also need to handle |
10679 | the case where the type is a reference to a tagged type, but | |
10680 | we have to be careful to exclude pointers to tagged types. | |
10681 | The latter should be shown as usual (as a pointer), whereas | |
10682 | a reference should mostly be transparent to the user. */ | |
10683 | if (ada_is_tagged_type (type, 0) | |
023db19c | 10684 | || (TYPE_CODE (type) == TYPE_CODE_REF |
31dbc1c5 | 10685 | && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0))) |
0d72a7c3 JB |
10686 | { |
10687 | /* Tagged types are a little special in the fact that the real | |
10688 | type is dynamic and can only be determined by inspecting the | |
10689 | object's tag. This means that we need to get the object's | |
10690 | value first (EVAL_NORMAL) and then extract the actual object | |
10691 | type from its tag. | |
10692 | ||
10693 | Note that we cannot skip the final step where we extract | |
10694 | the object type from its tag, because the EVAL_NORMAL phase | |
10695 | results in dynamic components being resolved into fixed ones. | |
10696 | This can cause problems when trying to print the type | |
10697 | description of tagged types whose parent has a dynamic size: | |
10698 | We use the type name of the "_parent" component in order | |
10699 | to print the name of the ancestor type in the type description. | |
10700 | If that component had a dynamic size, the resolution into | |
10701 | a fixed type would result in the loss of that type name, | |
10702 | thus preventing us from printing the name of the ancestor | |
10703 | type in the type description. */ | |
10704 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL); | |
10705 | ||
10706 | if (TYPE_CODE (type) != TYPE_CODE_REF) | |
10707 | { | |
10708 | struct type *actual_type; | |
10709 | ||
10710 | actual_type = type_from_tag (ada_value_tag (arg1)); | |
10711 | if (actual_type == NULL) | |
10712 | /* If, for some reason, we were unable to determine | |
10713 | the actual type from the tag, then use the static | |
10714 | approximation that we just computed as a fallback. | |
10715 | This can happen if the debugging information is | |
10716 | incomplete, for instance. */ | |
10717 | actual_type = type; | |
10718 | return value_zero (actual_type, not_lval); | |
10719 | } | |
10720 | else | |
10721 | { | |
10722 | /* In the case of a ref, ada_coerce_ref takes care | |
10723 | of determining the actual type. But the evaluation | |
10724 | should return a ref as it should be valid to ask | |
10725 | for its address; so rebuild a ref after coerce. */ | |
10726 | arg1 = ada_coerce_ref (arg1); | |
10727 | return value_ref (arg1); | |
10728 | } | |
10729 | } | |
0c1f74cf | 10730 | |
84754697 JB |
10731 | /* Records and unions for which GNAT encodings have been |
10732 | generated need to be statically fixed as well. | |
10733 | Otherwise, non-static fixing produces a type where | |
10734 | all dynamic properties are removed, which prevents "ptype" | |
10735 | from being able to completely describe the type. | |
10736 | For instance, a case statement in a variant record would be | |
10737 | replaced by the relevant components based on the actual | |
10738 | value of the discriminants. */ | |
10739 | if ((TYPE_CODE (type) == TYPE_CODE_STRUCT | |
10740 | && dynamic_template_type (type) != NULL) | |
10741 | || (TYPE_CODE (type) == TYPE_CODE_UNION | |
10742 | && ada_find_parallel_type (type, "___XVU") != NULL)) | |
10743 | { | |
10744 | *pos += 4; | |
10745 | return value_zero (to_static_fixed_type (type), not_lval); | |
10746 | } | |
4c4b4cd2 | 10747 | } |
da5c522f JB |
10748 | |
10749 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10750 | return ada_to_fixed_value (arg1); | |
4c4b4cd2 PH |
10751 | |
10752 | case OP_FUNCALL: | |
10753 | (*pos) += 2; | |
10754 | ||
10755 | /* Allocate arg vector, including space for the function to be | |
10756 | called in argvec[0] and a terminating NULL. */ | |
10757 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
8d749320 | 10758 | argvec = XALLOCAVEC (struct value *, nargs + 2); |
4c4b4cd2 PH |
10759 | |
10760 | if (exp->elts[*pos].opcode == OP_VAR_VALUE | |
76a01679 | 10761 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
323e0a4a | 10762 | error (_("Unexpected unresolved symbol, %s, during evaluation"), |
4c4b4cd2 PH |
10763 | SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol)); |
10764 | else | |
10765 | { | |
10766 | for (tem = 0; tem <= nargs; tem += 1) | |
10767 | argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10768 | argvec[tem] = 0; | |
10769 | ||
10770 | if (noside == EVAL_SKIP) | |
10771 | goto nosideret; | |
10772 | } | |
10773 | ||
ad82864c JB |
10774 | if (ada_is_constrained_packed_array_type |
10775 | (desc_base_type (value_type (argvec[0])))) | |
4c4b4cd2 | 10776 | argvec[0] = ada_coerce_to_simple_array (argvec[0]); |
284614f0 JB |
10777 | else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY |
10778 | && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0) | |
10779 | /* This is a packed array that has already been fixed, and | |
10780 | therefore already coerced to a simple array. Nothing further | |
10781 | to do. */ | |
10782 | ; | |
e6c2c623 PMR |
10783 | else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF) |
10784 | { | |
10785 | /* Make sure we dereference references so that all the code below | |
10786 | feels like it's really handling the referenced value. Wrapping | |
10787 | types (for alignment) may be there, so make sure we strip them as | |
10788 | well. */ | |
10789 | argvec[0] = ada_to_fixed_value (coerce_ref (argvec[0])); | |
10790 | } | |
10791 | else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY | |
10792 | && VALUE_LVAL (argvec[0]) == lval_memory) | |
10793 | argvec[0] = value_addr (argvec[0]); | |
4c4b4cd2 | 10794 | |
df407dfe | 10795 | type = ada_check_typedef (value_type (argvec[0])); |
720d1a40 JB |
10796 | |
10797 | /* Ada allows us to implicitly dereference arrays when subscripting | |
8f465ea7 JB |
10798 | them. So, if this is an array typedef (encoding use for array |
10799 | access types encoded as fat pointers), strip it now. */ | |
720d1a40 JB |
10800 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) |
10801 | type = ada_typedef_target_type (type); | |
10802 | ||
4c4b4cd2 PH |
10803 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
10804 | { | |
61ee279c | 10805 | switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))) |
4c4b4cd2 PH |
10806 | { |
10807 | case TYPE_CODE_FUNC: | |
61ee279c | 10808 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
4c4b4cd2 PH |
10809 | break; |
10810 | case TYPE_CODE_ARRAY: | |
10811 | break; | |
10812 | case TYPE_CODE_STRUCT: | |
10813 | if (noside != EVAL_AVOID_SIDE_EFFECTS) | |
10814 | argvec[0] = ada_value_ind (argvec[0]); | |
61ee279c | 10815 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
4c4b4cd2 PH |
10816 | break; |
10817 | default: | |
323e0a4a | 10818 | error (_("cannot subscript or call something of type `%s'"), |
df407dfe | 10819 | ada_type_name (value_type (argvec[0]))); |
4c4b4cd2 PH |
10820 | break; |
10821 | } | |
10822 | } | |
10823 | ||
10824 | switch (TYPE_CODE (type)) | |
10825 | { | |
10826 | case TYPE_CODE_FUNC: | |
10827 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
c8ea1972 PH |
10828 | { |
10829 | struct type *rtype = TYPE_TARGET_TYPE (type); | |
10830 | ||
10831 | if (TYPE_GNU_IFUNC (type)) | |
10832 | return allocate_value (TYPE_TARGET_TYPE (rtype)); | |
10833 | return allocate_value (rtype); | |
10834 | } | |
4c4b4cd2 | 10835 | return call_function_by_hand (argvec[0], nargs, argvec + 1); |
c8ea1972 PH |
10836 | case TYPE_CODE_INTERNAL_FUNCTION: |
10837 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10838 | /* We don't know anything about what the internal | |
10839 | function might return, but we have to return | |
10840 | something. */ | |
10841 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
10842 | not_lval); | |
10843 | else | |
10844 | return call_internal_function (exp->gdbarch, exp->language_defn, | |
10845 | argvec[0], nargs, argvec + 1); | |
10846 | ||
4c4b4cd2 PH |
10847 | case TYPE_CODE_STRUCT: |
10848 | { | |
10849 | int arity; | |
10850 | ||
4c4b4cd2 PH |
10851 | arity = ada_array_arity (type); |
10852 | type = ada_array_element_type (type, nargs); | |
10853 | if (type == NULL) | |
323e0a4a | 10854 | error (_("cannot subscript or call a record")); |
4c4b4cd2 | 10855 | if (arity != nargs) |
323e0a4a | 10856 | error (_("wrong number of subscripts; expecting %d"), arity); |
4c4b4cd2 | 10857 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
0a07e705 | 10858 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10859 | return |
10860 | unwrap_value (ada_value_subscript | |
10861 | (argvec[0], nargs, argvec + 1)); | |
10862 | } | |
10863 | case TYPE_CODE_ARRAY: | |
10864 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10865 | { | |
10866 | type = ada_array_element_type (type, nargs); | |
10867 | if (type == NULL) | |
323e0a4a | 10868 | error (_("element type of array unknown")); |
4c4b4cd2 | 10869 | else |
0a07e705 | 10870 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10871 | } |
10872 | return | |
10873 | unwrap_value (ada_value_subscript | |
10874 | (ada_coerce_to_simple_array (argvec[0]), | |
10875 | nargs, argvec + 1)); | |
10876 | case TYPE_CODE_PTR: /* Pointer to array */ | |
4c4b4cd2 PH |
10877 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
10878 | { | |
deede10c | 10879 | type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1); |
4c4b4cd2 PH |
10880 | type = ada_array_element_type (type, nargs); |
10881 | if (type == NULL) | |
323e0a4a | 10882 | error (_("element type of array unknown")); |
4c4b4cd2 | 10883 | else |
0a07e705 | 10884 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10885 | } |
10886 | return | |
deede10c JB |
10887 | unwrap_value (ada_value_ptr_subscript (argvec[0], |
10888 | nargs, argvec + 1)); | |
4c4b4cd2 PH |
10889 | |
10890 | default: | |
e1d5a0d2 PH |
10891 | error (_("Attempt to index or call something other than an " |
10892 | "array or function")); | |
4c4b4cd2 PH |
10893 | } |
10894 | ||
10895 | case TERNOP_SLICE: | |
10896 | { | |
10897 | struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10898 | struct value *low_bound_val = | |
10899 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
714e53ab PH |
10900 | struct value *high_bound_val = |
10901 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10902 | LONGEST low_bound; | |
10903 | LONGEST high_bound; | |
5b4ee69b | 10904 | |
994b9211 AC |
10905 | low_bound_val = coerce_ref (low_bound_val); |
10906 | high_bound_val = coerce_ref (high_bound_val); | |
aa715135 JG |
10907 | low_bound = value_as_long (low_bound_val); |
10908 | high_bound = value_as_long (high_bound_val); | |
963a6417 | 10909 | |
4c4b4cd2 PH |
10910 | if (noside == EVAL_SKIP) |
10911 | goto nosideret; | |
10912 | ||
4c4b4cd2 PH |
10913 | /* If this is a reference to an aligner type, then remove all |
10914 | the aligners. */ | |
df407dfe AC |
10915 | if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF |
10916 | && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array)))) | |
10917 | TYPE_TARGET_TYPE (value_type (array)) = | |
10918 | ada_aligned_type (TYPE_TARGET_TYPE (value_type (array))); | |
4c4b4cd2 | 10919 | |
ad82864c | 10920 | if (ada_is_constrained_packed_array_type (value_type (array))) |
323e0a4a | 10921 | error (_("cannot slice a packed array")); |
4c4b4cd2 PH |
10922 | |
10923 | /* If this is a reference to an array or an array lvalue, | |
10924 | convert to a pointer. */ | |
df407dfe AC |
10925 | if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF |
10926 | || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY | |
4c4b4cd2 PH |
10927 | && VALUE_LVAL (array) == lval_memory)) |
10928 | array = value_addr (array); | |
10929 | ||
1265e4aa | 10930 | if (noside == EVAL_AVOID_SIDE_EFFECTS |
61ee279c | 10931 | && ada_is_array_descriptor_type (ada_check_typedef |
df407dfe | 10932 | (value_type (array)))) |
0b5d8877 | 10933 | return empty_array (ada_type_of_array (array, 0), low_bound); |
4c4b4cd2 PH |
10934 | |
10935 | array = ada_coerce_to_simple_array_ptr (array); | |
10936 | ||
714e53ab PH |
10937 | /* If we have more than one level of pointer indirection, |
10938 | dereference the value until we get only one level. */ | |
df407dfe AC |
10939 | while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR |
10940 | && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array))) | |
714e53ab PH |
10941 | == TYPE_CODE_PTR)) |
10942 | array = value_ind (array); | |
10943 | ||
10944 | /* Make sure we really do have an array type before going further, | |
10945 | to avoid a SEGV when trying to get the index type or the target | |
10946 | type later down the road if the debug info generated by | |
10947 | the compiler is incorrect or incomplete. */ | |
df407dfe | 10948 | if (!ada_is_simple_array_type (value_type (array))) |
323e0a4a | 10949 | error (_("cannot take slice of non-array")); |
714e53ab | 10950 | |
828292f2 JB |
10951 | if (TYPE_CODE (ada_check_typedef (value_type (array))) |
10952 | == TYPE_CODE_PTR) | |
4c4b4cd2 | 10953 | { |
828292f2 JB |
10954 | struct type *type0 = ada_check_typedef (value_type (array)); |
10955 | ||
0b5d8877 | 10956 | if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS) |
828292f2 | 10957 | return empty_array (TYPE_TARGET_TYPE (type0), low_bound); |
4c4b4cd2 PH |
10958 | else |
10959 | { | |
10960 | struct type *arr_type0 = | |
828292f2 | 10961 | to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1); |
5b4ee69b | 10962 | |
f5938064 JG |
10963 | return ada_value_slice_from_ptr (array, arr_type0, |
10964 | longest_to_int (low_bound), | |
10965 | longest_to_int (high_bound)); | |
4c4b4cd2 PH |
10966 | } |
10967 | } | |
10968 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10969 | return array; | |
10970 | else if (high_bound < low_bound) | |
df407dfe | 10971 | return empty_array (value_type (array), low_bound); |
4c4b4cd2 | 10972 | else |
529cad9c PH |
10973 | return ada_value_slice (array, longest_to_int (low_bound), |
10974 | longest_to_int (high_bound)); | |
4c4b4cd2 | 10975 | } |
14f9c5c9 | 10976 | |
4c4b4cd2 PH |
10977 | case UNOP_IN_RANGE: |
10978 | (*pos) += 2; | |
10979 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
8008e265 | 10980 | type = check_typedef (exp->elts[pc + 1].type); |
14f9c5c9 | 10981 | |
14f9c5c9 | 10982 | if (noside == EVAL_SKIP) |
4c4b4cd2 | 10983 | goto nosideret; |
14f9c5c9 | 10984 | |
4c4b4cd2 PH |
10985 | switch (TYPE_CODE (type)) |
10986 | { | |
10987 | default: | |
e1d5a0d2 PH |
10988 | lim_warning (_("Membership test incompletely implemented; " |
10989 | "always returns true")); | |
fbb06eb1 UW |
10990 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10991 | return value_from_longest (type, (LONGEST) 1); | |
4c4b4cd2 PH |
10992 | |
10993 | case TYPE_CODE_RANGE: | |
030b4912 UW |
10994 | arg2 = value_from_longest (type, TYPE_LOW_BOUND (type)); |
10995 | arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type)); | |
f44316fa UW |
10996 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
10997 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 UW |
10998 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10999 | return | |
11000 | value_from_longest (type, | |
4c4b4cd2 PH |
11001 | (value_less (arg1, arg3) |
11002 | || value_equal (arg1, arg3)) | |
11003 | && (value_less (arg2, arg1) | |
11004 | || value_equal (arg2, arg1))); | |
11005 | } | |
11006 | ||
11007 | case BINOP_IN_BOUNDS: | |
14f9c5c9 | 11008 | (*pos) += 2; |
4c4b4cd2 PH |
11009 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11010 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
14f9c5c9 | 11011 | |
4c4b4cd2 PH |
11012 | if (noside == EVAL_SKIP) |
11013 | goto nosideret; | |
14f9c5c9 | 11014 | |
4c4b4cd2 | 11015 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
fbb06eb1 UW |
11016 | { |
11017 | type = language_bool_type (exp->language_defn, exp->gdbarch); | |
11018 | return value_zero (type, not_lval); | |
11019 | } | |
14f9c5c9 | 11020 | |
4c4b4cd2 | 11021 | tem = longest_to_int (exp->elts[pc + 1].longconst); |
14f9c5c9 | 11022 | |
1eea4ebd UW |
11023 | type = ada_index_type (value_type (arg2), tem, "range"); |
11024 | if (!type) | |
11025 | type = value_type (arg1); | |
14f9c5c9 | 11026 | |
1eea4ebd UW |
11027 | arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1)); |
11028 | arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0)); | |
d2e4a39e | 11029 | |
f44316fa UW |
11030 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
11031 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 | 11032 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
4c4b4cd2 | 11033 | return |
fbb06eb1 | 11034 | value_from_longest (type, |
4c4b4cd2 PH |
11035 | (value_less (arg1, arg3) |
11036 | || value_equal (arg1, arg3)) | |
11037 | && (value_less (arg2, arg1) | |
11038 | || value_equal (arg2, arg1))); | |
11039 | ||
11040 | case TERNOP_IN_RANGE: | |
11041 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11042 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11043 | arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11044 | ||
11045 | if (noside == EVAL_SKIP) | |
11046 | goto nosideret; | |
11047 | ||
f44316fa UW |
11048 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
11049 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 | 11050 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
4c4b4cd2 | 11051 | return |
fbb06eb1 | 11052 | value_from_longest (type, |
4c4b4cd2 PH |
11053 | (value_less (arg1, arg3) |
11054 | || value_equal (arg1, arg3)) | |
11055 | && (value_less (arg2, arg1) | |
11056 | || value_equal (arg2, arg1))); | |
11057 | ||
11058 | case OP_ATR_FIRST: | |
11059 | case OP_ATR_LAST: | |
11060 | case OP_ATR_LENGTH: | |
11061 | { | |
76a01679 | 11062 | struct type *type_arg; |
5b4ee69b | 11063 | |
76a01679 JB |
11064 | if (exp->elts[*pos].opcode == OP_TYPE) |
11065 | { | |
11066 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
11067 | arg1 = NULL; | |
5bc23cb3 | 11068 | type_arg = check_typedef (exp->elts[pc + 2].type); |
76a01679 JB |
11069 | } |
11070 | else | |
11071 | { | |
11072 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11073 | type_arg = NULL; | |
11074 | } | |
11075 | ||
11076 | if (exp->elts[*pos].opcode != OP_LONG) | |
323e0a4a | 11077 | error (_("Invalid operand to '%s"), ada_attribute_name (op)); |
76a01679 JB |
11078 | tem = longest_to_int (exp->elts[*pos + 2].longconst); |
11079 | *pos += 4; | |
11080 | ||
11081 | if (noside == EVAL_SKIP) | |
11082 | goto nosideret; | |
11083 | ||
11084 | if (type_arg == NULL) | |
11085 | { | |
11086 | arg1 = ada_coerce_ref (arg1); | |
11087 | ||
ad82864c | 11088 | if (ada_is_constrained_packed_array_type (value_type (arg1))) |
76a01679 JB |
11089 | arg1 = ada_coerce_to_simple_array (arg1); |
11090 | ||
aa4fb036 | 11091 | if (op == OP_ATR_LENGTH) |
1eea4ebd | 11092 | type = builtin_type (exp->gdbarch)->builtin_int; |
aa4fb036 JB |
11093 | else |
11094 | { | |
11095 | type = ada_index_type (value_type (arg1), tem, | |
11096 | ada_attribute_name (op)); | |
11097 | if (type == NULL) | |
11098 | type = builtin_type (exp->gdbarch)->builtin_int; | |
11099 | } | |
76a01679 JB |
11100 | |
11101 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
1eea4ebd | 11102 | return allocate_value (type); |
76a01679 JB |
11103 | |
11104 | switch (op) | |
11105 | { | |
11106 | default: /* Should never happen. */ | |
323e0a4a | 11107 | error (_("unexpected attribute encountered")); |
76a01679 | 11108 | case OP_ATR_FIRST: |
1eea4ebd UW |
11109 | return value_from_longest |
11110 | (type, ada_array_bound (arg1, tem, 0)); | |
76a01679 | 11111 | case OP_ATR_LAST: |
1eea4ebd UW |
11112 | return value_from_longest |
11113 | (type, ada_array_bound (arg1, tem, 1)); | |
76a01679 | 11114 | case OP_ATR_LENGTH: |
1eea4ebd UW |
11115 | return value_from_longest |
11116 | (type, ada_array_length (arg1, tem)); | |
76a01679 JB |
11117 | } |
11118 | } | |
11119 | else if (discrete_type_p (type_arg)) | |
11120 | { | |
11121 | struct type *range_type; | |
0d5cff50 | 11122 | const char *name = ada_type_name (type_arg); |
5b4ee69b | 11123 | |
76a01679 JB |
11124 | range_type = NULL; |
11125 | if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM) | |
28c85d6c | 11126 | range_type = to_fixed_range_type (type_arg, NULL); |
76a01679 JB |
11127 | if (range_type == NULL) |
11128 | range_type = type_arg; | |
11129 | switch (op) | |
11130 | { | |
11131 | default: | |
323e0a4a | 11132 | error (_("unexpected attribute encountered")); |
76a01679 | 11133 | case OP_ATR_FIRST: |
690cc4eb | 11134 | return value_from_longest |
43bbcdc2 | 11135 | (range_type, ada_discrete_type_low_bound (range_type)); |
76a01679 | 11136 | case OP_ATR_LAST: |
690cc4eb | 11137 | return value_from_longest |
43bbcdc2 | 11138 | (range_type, ada_discrete_type_high_bound (range_type)); |
76a01679 | 11139 | case OP_ATR_LENGTH: |
323e0a4a | 11140 | error (_("the 'length attribute applies only to array types")); |
76a01679 JB |
11141 | } |
11142 | } | |
11143 | else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT) | |
323e0a4a | 11144 | error (_("unimplemented type attribute")); |
76a01679 JB |
11145 | else |
11146 | { | |
11147 | LONGEST low, high; | |
11148 | ||
ad82864c JB |
11149 | if (ada_is_constrained_packed_array_type (type_arg)) |
11150 | type_arg = decode_constrained_packed_array_type (type_arg); | |
76a01679 | 11151 | |
aa4fb036 | 11152 | if (op == OP_ATR_LENGTH) |
1eea4ebd | 11153 | type = builtin_type (exp->gdbarch)->builtin_int; |
aa4fb036 JB |
11154 | else |
11155 | { | |
11156 | type = ada_index_type (type_arg, tem, ada_attribute_name (op)); | |
11157 | if (type == NULL) | |
11158 | type = builtin_type (exp->gdbarch)->builtin_int; | |
11159 | } | |
1eea4ebd | 11160 | |
76a01679 JB |
11161 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
11162 | return allocate_value (type); | |
11163 | ||
11164 | switch (op) | |
11165 | { | |
11166 | default: | |
323e0a4a | 11167 | error (_("unexpected attribute encountered")); |
76a01679 | 11168 | case OP_ATR_FIRST: |
1eea4ebd | 11169 | low = ada_array_bound_from_type (type_arg, tem, 0); |
76a01679 JB |
11170 | return value_from_longest (type, low); |
11171 | case OP_ATR_LAST: | |
1eea4ebd | 11172 | high = ada_array_bound_from_type (type_arg, tem, 1); |
76a01679 JB |
11173 | return value_from_longest (type, high); |
11174 | case OP_ATR_LENGTH: | |
1eea4ebd UW |
11175 | low = ada_array_bound_from_type (type_arg, tem, 0); |
11176 | high = ada_array_bound_from_type (type_arg, tem, 1); | |
76a01679 JB |
11177 | return value_from_longest (type, high - low + 1); |
11178 | } | |
11179 | } | |
14f9c5c9 AS |
11180 | } |
11181 | ||
4c4b4cd2 PH |
11182 | case OP_ATR_TAG: |
11183 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11184 | if (noside == EVAL_SKIP) | |
76a01679 | 11185 | goto nosideret; |
4c4b4cd2 PH |
11186 | |
11187 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
76a01679 | 11188 | return value_zero (ada_tag_type (arg1), not_lval); |
4c4b4cd2 PH |
11189 | |
11190 | return ada_value_tag (arg1); | |
11191 | ||
11192 | case OP_ATR_MIN: | |
11193 | case OP_ATR_MAX: | |
11194 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 AS |
11195 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11196 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11197 | if (noside == EVAL_SKIP) | |
76a01679 | 11198 | goto nosideret; |
d2e4a39e | 11199 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
df407dfe | 11200 | return value_zero (value_type (arg1), not_lval); |
14f9c5c9 | 11201 | else |
f44316fa UW |
11202 | { |
11203 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
11204 | return value_binop (arg1, arg2, | |
11205 | op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX); | |
11206 | } | |
14f9c5c9 | 11207 | |
4c4b4cd2 PH |
11208 | case OP_ATR_MODULUS: |
11209 | { | |
31dedfee | 11210 | struct type *type_arg = check_typedef (exp->elts[pc + 2].type); |
4c4b4cd2 | 11211 | |
5b4ee69b | 11212 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); |
76a01679 JB |
11213 | if (noside == EVAL_SKIP) |
11214 | goto nosideret; | |
4c4b4cd2 | 11215 | |
76a01679 | 11216 | if (!ada_is_modular_type (type_arg)) |
323e0a4a | 11217 | error (_("'modulus must be applied to modular type")); |
4c4b4cd2 | 11218 | |
76a01679 JB |
11219 | return value_from_longest (TYPE_TARGET_TYPE (type_arg), |
11220 | ada_modulus (type_arg)); | |
4c4b4cd2 PH |
11221 | } |
11222 | ||
11223 | ||
11224 | case OP_ATR_POS: | |
11225 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 AS |
11226 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11227 | if (noside == EVAL_SKIP) | |
76a01679 | 11228 | goto nosideret; |
3cb382c9 UW |
11229 | type = builtin_type (exp->gdbarch)->builtin_int; |
11230 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
11231 | return value_zero (type, not_lval); | |
14f9c5c9 | 11232 | else |
3cb382c9 | 11233 | return value_pos_atr (type, arg1); |
14f9c5c9 | 11234 | |
4c4b4cd2 PH |
11235 | case OP_ATR_SIZE: |
11236 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
8c1c099f JB |
11237 | type = value_type (arg1); |
11238 | ||
11239 | /* If the argument is a reference, then dereference its type, since | |
11240 | the user is really asking for the size of the actual object, | |
11241 | not the size of the pointer. */ | |
11242 | if (TYPE_CODE (type) == TYPE_CODE_REF) | |
11243 | type = TYPE_TARGET_TYPE (type); | |
11244 | ||
4c4b4cd2 | 11245 | if (noside == EVAL_SKIP) |
76a01679 | 11246 | goto nosideret; |
4c4b4cd2 | 11247 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
22601c15 | 11248 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval); |
4c4b4cd2 | 11249 | else |
22601c15 | 11250 | return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, |
8c1c099f | 11251 | TARGET_CHAR_BIT * TYPE_LENGTH (type)); |
4c4b4cd2 PH |
11252 | |
11253 | case OP_ATR_VAL: | |
11254 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 | 11255 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
4c4b4cd2 | 11256 | type = exp->elts[pc + 2].type; |
14f9c5c9 | 11257 | if (noside == EVAL_SKIP) |
76a01679 | 11258 | goto nosideret; |
4c4b4cd2 | 11259 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 11260 | return value_zero (type, not_lval); |
4c4b4cd2 | 11261 | else |
76a01679 | 11262 | return value_val_atr (type, arg1); |
4c4b4cd2 PH |
11263 | |
11264 | case BINOP_EXP: | |
11265 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11266 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11267 | if (noside == EVAL_SKIP) | |
11268 | goto nosideret; | |
11269 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
df407dfe | 11270 | return value_zero (value_type (arg1), not_lval); |
4c4b4cd2 | 11271 | else |
f44316fa UW |
11272 | { |
11273 | /* For integer exponentiation operations, | |
11274 | only promote the first argument. */ | |
11275 | if (is_integral_type (value_type (arg2))) | |
11276 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
11277 | else | |
11278 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
11279 | ||
11280 | return value_binop (arg1, arg2, op); | |
11281 | } | |
4c4b4cd2 PH |
11282 | |
11283 | case UNOP_PLUS: | |
11284 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11285 | if (noside == EVAL_SKIP) | |
11286 | goto nosideret; | |
11287 | else | |
11288 | return arg1; | |
11289 | ||
11290 | case UNOP_ABS: | |
11291 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11292 | if (noside == EVAL_SKIP) | |
11293 | goto nosideret; | |
f44316fa | 11294 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); |
df407dfe | 11295 | if (value_less (arg1, value_zero (value_type (arg1), not_lval))) |
4c4b4cd2 | 11296 | return value_neg (arg1); |
14f9c5c9 | 11297 | else |
4c4b4cd2 | 11298 | return arg1; |
14f9c5c9 AS |
11299 | |
11300 | case UNOP_IND: | |
5ec18f2b | 11301 | preeval_pos = *pos; |
6b0d7253 | 11302 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
14f9c5c9 | 11303 | if (noside == EVAL_SKIP) |
4c4b4cd2 | 11304 | goto nosideret; |
df407dfe | 11305 | type = ada_check_typedef (value_type (arg1)); |
14f9c5c9 | 11306 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
4c4b4cd2 PH |
11307 | { |
11308 | if (ada_is_array_descriptor_type (type)) | |
11309 | /* GDB allows dereferencing GNAT array descriptors. */ | |
11310 | { | |
11311 | struct type *arrType = ada_type_of_array (arg1, 0); | |
5b4ee69b | 11312 | |
4c4b4cd2 | 11313 | if (arrType == NULL) |
323e0a4a | 11314 | error (_("Attempt to dereference null array pointer.")); |
00a4c844 | 11315 | return value_at_lazy (arrType, 0); |
4c4b4cd2 PH |
11316 | } |
11317 | else if (TYPE_CODE (type) == TYPE_CODE_PTR | |
11318 | || TYPE_CODE (type) == TYPE_CODE_REF | |
11319 | /* In C you can dereference an array to get the 1st elt. */ | |
11320 | || TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
714e53ab | 11321 | { |
5ec18f2b JG |
11322 | /* As mentioned in the OP_VAR_VALUE case, tagged types can |
11323 | only be determined by inspecting the object's tag. | |
11324 | This means that we need to evaluate completely the | |
11325 | expression in order to get its type. */ | |
11326 | ||
023db19c JB |
11327 | if ((TYPE_CODE (type) == TYPE_CODE_REF |
11328 | || TYPE_CODE (type) == TYPE_CODE_PTR) | |
5ec18f2b JG |
11329 | && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)) |
11330 | { | |
11331 | arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos, | |
11332 | EVAL_NORMAL); | |
11333 | type = value_type (ada_value_ind (arg1)); | |
11334 | } | |
11335 | else | |
11336 | { | |
11337 | type = to_static_fixed_type | |
11338 | (ada_aligned_type | |
11339 | (ada_check_typedef (TYPE_TARGET_TYPE (type)))); | |
11340 | } | |
c1b5a1a6 | 11341 | ada_ensure_varsize_limit (type); |
714e53ab PH |
11342 | return value_zero (type, lval_memory); |
11343 | } | |
4c4b4cd2 | 11344 | else if (TYPE_CODE (type) == TYPE_CODE_INT) |
6b0d7253 JB |
11345 | { |
11346 | /* GDB allows dereferencing an int. */ | |
11347 | if (expect_type == NULL) | |
11348 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
11349 | lval_memory); | |
11350 | else | |
11351 | { | |
11352 | expect_type = | |
11353 | to_static_fixed_type (ada_aligned_type (expect_type)); | |
11354 | return value_zero (expect_type, lval_memory); | |
11355 | } | |
11356 | } | |
4c4b4cd2 | 11357 | else |
323e0a4a | 11358 | error (_("Attempt to take contents of a non-pointer value.")); |
4c4b4cd2 | 11359 | } |
0963b4bd | 11360 | arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */ |
df407dfe | 11361 | type = ada_check_typedef (value_type (arg1)); |
d2e4a39e | 11362 | |
96967637 JB |
11363 | if (TYPE_CODE (type) == TYPE_CODE_INT) |
11364 | /* GDB allows dereferencing an int. If we were given | |
11365 | the expect_type, then use that as the target type. | |
11366 | Otherwise, assume that the target type is an int. */ | |
11367 | { | |
11368 | if (expect_type != NULL) | |
11369 | return ada_value_ind (value_cast (lookup_pointer_type (expect_type), | |
11370 | arg1)); | |
11371 | else | |
11372 | return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int, | |
11373 | (CORE_ADDR) value_as_address (arg1)); | |
11374 | } | |
6b0d7253 | 11375 | |
4c4b4cd2 PH |
11376 | if (ada_is_array_descriptor_type (type)) |
11377 | /* GDB allows dereferencing GNAT array descriptors. */ | |
11378 | return ada_coerce_to_simple_array (arg1); | |
14f9c5c9 | 11379 | else |
4c4b4cd2 | 11380 | return ada_value_ind (arg1); |
14f9c5c9 AS |
11381 | |
11382 | case STRUCTOP_STRUCT: | |
11383 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
11384 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
5ec18f2b | 11385 | preeval_pos = *pos; |
14f9c5c9 AS |
11386 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11387 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 11388 | goto nosideret; |
14f9c5c9 | 11389 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 11390 | { |
df407dfe | 11391 | struct type *type1 = value_type (arg1); |
5b4ee69b | 11392 | |
76a01679 JB |
11393 | if (ada_is_tagged_type (type1, 1)) |
11394 | { | |
11395 | type = ada_lookup_struct_elt_type (type1, | |
11396 | &exp->elts[pc + 2].string, | |
11397 | 1, 1, NULL); | |
5ec18f2b JG |
11398 | |
11399 | /* If the field is not found, check if it exists in the | |
11400 | extension of this object's type. This means that we | |
11401 | need to evaluate completely the expression. */ | |
11402 | ||
76a01679 | 11403 | if (type == NULL) |
5ec18f2b JG |
11404 | { |
11405 | arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos, | |
11406 | EVAL_NORMAL); | |
11407 | arg1 = ada_value_struct_elt (arg1, | |
11408 | &exp->elts[pc + 2].string, | |
11409 | 0); | |
11410 | arg1 = unwrap_value (arg1); | |
11411 | type = value_type (ada_to_fixed_value (arg1)); | |
11412 | } | |
76a01679 JB |
11413 | } |
11414 | else | |
11415 | type = | |
11416 | ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1, | |
11417 | 0, NULL); | |
11418 | ||
11419 | return value_zero (ada_aligned_type (type), lval_memory); | |
11420 | } | |
14f9c5c9 | 11421 | else |
a579cd9a MW |
11422 | { |
11423 | arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0); | |
11424 | arg1 = unwrap_value (arg1); | |
11425 | return ada_to_fixed_value (arg1); | |
11426 | } | |
284614f0 | 11427 | |
14f9c5c9 | 11428 | case OP_TYPE: |
4c4b4cd2 PH |
11429 | /* The value is not supposed to be used. This is here to make it |
11430 | easier to accommodate expressions that contain types. */ | |
14f9c5c9 AS |
11431 | (*pos) += 2; |
11432 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 11433 | goto nosideret; |
14f9c5c9 | 11434 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
a6cfbe68 | 11435 | return allocate_value (exp->elts[pc + 1].type); |
14f9c5c9 | 11436 | else |
323e0a4a | 11437 | error (_("Attempt to use a type name as an expression")); |
52ce6436 PH |
11438 | |
11439 | case OP_AGGREGATE: | |
11440 | case OP_CHOICES: | |
11441 | case OP_OTHERS: | |
11442 | case OP_DISCRETE_RANGE: | |
11443 | case OP_POSITIONAL: | |
11444 | case OP_NAME: | |
11445 | if (noside == EVAL_NORMAL) | |
11446 | switch (op) | |
11447 | { | |
11448 | case OP_NAME: | |
11449 | error (_("Undefined name, ambiguous name, or renaming used in " | |
e1d5a0d2 | 11450 | "component association: %s."), &exp->elts[pc+2].string); |
52ce6436 PH |
11451 | case OP_AGGREGATE: |
11452 | error (_("Aggregates only allowed on the right of an assignment")); | |
11453 | default: | |
0963b4bd MS |
11454 | internal_error (__FILE__, __LINE__, |
11455 | _("aggregate apparently mangled")); | |
52ce6436 PH |
11456 | } |
11457 | ||
11458 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
11459 | *pos += oplen - 1; | |
11460 | for (tem = 0; tem < nargs; tem += 1) | |
11461 | ada_evaluate_subexp (NULL, exp, pos, noside); | |
11462 | goto nosideret; | |
14f9c5c9 AS |
11463 | } |
11464 | ||
11465 | nosideret: | |
22601c15 | 11466 | return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1); |
14f9c5c9 | 11467 | } |
14f9c5c9 | 11468 | \f |
d2e4a39e | 11469 | |
4c4b4cd2 | 11470 | /* Fixed point */ |
14f9c5c9 AS |
11471 | |
11472 | /* If TYPE encodes an Ada fixed-point type, return the suffix of the | |
11473 | type name that encodes the 'small and 'delta information. | |
4c4b4cd2 | 11474 | Otherwise, return NULL. */ |
14f9c5c9 | 11475 | |
d2e4a39e | 11476 | static const char * |
ebf56fd3 | 11477 | fixed_type_info (struct type *type) |
14f9c5c9 | 11478 | { |
d2e4a39e | 11479 | const char *name = ada_type_name (type); |
14f9c5c9 AS |
11480 | enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type); |
11481 | ||
d2e4a39e AS |
11482 | if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL) |
11483 | { | |
14f9c5c9 | 11484 | const char *tail = strstr (name, "___XF_"); |
5b4ee69b | 11485 | |
14f9c5c9 | 11486 | if (tail == NULL) |
4c4b4cd2 | 11487 | return NULL; |
d2e4a39e | 11488 | else |
4c4b4cd2 | 11489 | return tail + 5; |
14f9c5c9 AS |
11490 | } |
11491 | else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type) | |
11492 | return fixed_type_info (TYPE_TARGET_TYPE (type)); | |
11493 | else | |
11494 | return NULL; | |
11495 | } | |
11496 | ||
4c4b4cd2 | 11497 | /* Returns non-zero iff TYPE represents an Ada fixed-point type. */ |
14f9c5c9 AS |
11498 | |
11499 | int | |
ebf56fd3 | 11500 | ada_is_fixed_point_type (struct type *type) |
14f9c5c9 AS |
11501 | { |
11502 | return fixed_type_info (type) != NULL; | |
11503 | } | |
11504 | ||
4c4b4cd2 PH |
11505 | /* Return non-zero iff TYPE represents a System.Address type. */ |
11506 | ||
11507 | int | |
11508 | ada_is_system_address_type (struct type *type) | |
11509 | { | |
11510 | return (TYPE_NAME (type) | |
11511 | && strcmp (TYPE_NAME (type), "system__address") == 0); | |
11512 | } | |
11513 | ||
14f9c5c9 AS |
11514 | /* Assuming that TYPE is the representation of an Ada fixed-point |
11515 | type, return its delta, or -1 if the type is malformed and the | |
4c4b4cd2 | 11516 | delta cannot be determined. */ |
14f9c5c9 AS |
11517 | |
11518 | DOUBLEST | |
ebf56fd3 | 11519 | ada_delta (struct type *type) |
14f9c5c9 AS |
11520 | { |
11521 | const char *encoding = fixed_type_info (type); | |
facc390f | 11522 | DOUBLEST num, den; |
14f9c5c9 | 11523 | |
facc390f JB |
11524 | /* Strictly speaking, num and den are encoded as integer. However, |
11525 | they may not fit into a long, and they will have to be converted | |
11526 | to DOUBLEST anyway. So scan them as DOUBLEST. */ | |
11527 | if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT, | |
11528 | &num, &den) < 2) | |
14f9c5c9 | 11529 | return -1.0; |
d2e4a39e | 11530 | else |
facc390f | 11531 | return num / den; |
14f9c5c9 AS |
11532 | } |
11533 | ||
11534 | /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling | |
4c4b4cd2 | 11535 | factor ('SMALL value) associated with the type. */ |
14f9c5c9 AS |
11536 | |
11537 | static DOUBLEST | |
ebf56fd3 | 11538 | scaling_factor (struct type *type) |
14f9c5c9 AS |
11539 | { |
11540 | const char *encoding = fixed_type_info (type); | |
facc390f | 11541 | DOUBLEST num0, den0, num1, den1; |
14f9c5c9 | 11542 | int n; |
d2e4a39e | 11543 | |
facc390f JB |
11544 | /* Strictly speaking, num's and den's are encoded as integer. However, |
11545 | they may not fit into a long, and they will have to be converted | |
11546 | to DOUBLEST anyway. So scan them as DOUBLEST. */ | |
11547 | n = sscanf (encoding, | |
11548 | "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT | |
11549 | "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT, | |
11550 | &num0, &den0, &num1, &den1); | |
14f9c5c9 AS |
11551 | |
11552 | if (n < 2) | |
11553 | return 1.0; | |
11554 | else if (n == 4) | |
facc390f | 11555 | return num1 / den1; |
d2e4a39e | 11556 | else |
facc390f | 11557 | return num0 / den0; |
14f9c5c9 AS |
11558 | } |
11559 | ||
11560 | ||
11561 | /* Assuming that X is the representation of a value of fixed-point | |
4c4b4cd2 | 11562 | type TYPE, return its floating-point equivalent. */ |
14f9c5c9 AS |
11563 | |
11564 | DOUBLEST | |
ebf56fd3 | 11565 | ada_fixed_to_float (struct type *type, LONGEST x) |
14f9c5c9 | 11566 | { |
d2e4a39e | 11567 | return (DOUBLEST) x *scaling_factor (type); |
14f9c5c9 AS |
11568 | } |
11569 | ||
4c4b4cd2 PH |
11570 | /* The representation of a fixed-point value of type TYPE |
11571 | corresponding to the value X. */ | |
14f9c5c9 AS |
11572 | |
11573 | LONGEST | |
ebf56fd3 | 11574 | ada_float_to_fixed (struct type *type, DOUBLEST x) |
14f9c5c9 AS |
11575 | { |
11576 | return (LONGEST) (x / scaling_factor (type) + 0.5); | |
11577 | } | |
11578 | ||
14f9c5c9 | 11579 | \f |
d2e4a39e | 11580 | |
4c4b4cd2 | 11581 | /* Range types */ |
14f9c5c9 AS |
11582 | |
11583 | /* Scan STR beginning at position K for a discriminant name, and | |
11584 | return the value of that discriminant field of DVAL in *PX. If | |
11585 | PNEW_K is not null, put the position of the character beyond the | |
11586 | name scanned in *PNEW_K. Return 1 if successful; return 0 and do | |
4c4b4cd2 | 11587 | not alter *PX and *PNEW_K if unsuccessful. */ |
14f9c5c9 AS |
11588 | |
11589 | static int | |
108d56a4 | 11590 | scan_discrim_bound (const char *str, int k, struct value *dval, LONGEST * px, |
76a01679 | 11591 | int *pnew_k) |
14f9c5c9 AS |
11592 | { |
11593 | static char *bound_buffer = NULL; | |
11594 | static size_t bound_buffer_len = 0; | |
5da1a4d3 | 11595 | const char *pstart, *pend, *bound; |
d2e4a39e | 11596 | struct value *bound_val; |
14f9c5c9 AS |
11597 | |
11598 | if (dval == NULL || str == NULL || str[k] == '\0') | |
11599 | return 0; | |
11600 | ||
5da1a4d3 SM |
11601 | pstart = str + k; |
11602 | pend = strstr (pstart, "__"); | |
14f9c5c9 AS |
11603 | if (pend == NULL) |
11604 | { | |
5da1a4d3 | 11605 | bound = pstart; |
14f9c5c9 AS |
11606 | k += strlen (bound); |
11607 | } | |
d2e4a39e | 11608 | else |
14f9c5c9 | 11609 | { |
5da1a4d3 SM |
11610 | int len = pend - pstart; |
11611 | ||
11612 | /* Strip __ and beyond. */ | |
11613 | GROW_VECT (bound_buffer, bound_buffer_len, len + 1); | |
11614 | strncpy (bound_buffer, pstart, len); | |
11615 | bound_buffer[len] = '\0'; | |
11616 | ||
14f9c5c9 | 11617 | bound = bound_buffer; |
d2e4a39e | 11618 | k = pend - str; |
14f9c5c9 | 11619 | } |
d2e4a39e | 11620 | |
df407dfe | 11621 | bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval)); |
14f9c5c9 AS |
11622 | if (bound_val == NULL) |
11623 | return 0; | |
11624 | ||
11625 | *px = value_as_long (bound_val); | |
11626 | if (pnew_k != NULL) | |
11627 | *pnew_k = k; | |
11628 | return 1; | |
11629 | } | |
11630 | ||
11631 | /* Value of variable named NAME in the current environment. If | |
11632 | no such variable found, then if ERR_MSG is null, returns 0, and | |
4c4b4cd2 PH |
11633 | otherwise causes an error with message ERR_MSG. */ |
11634 | ||
d2e4a39e AS |
11635 | static struct value * |
11636 | get_var_value (char *name, char *err_msg) | |
14f9c5c9 | 11637 | { |
d12307c1 | 11638 | struct block_symbol *syms; |
14f9c5c9 AS |
11639 | int nsyms; |
11640 | ||
4c4b4cd2 | 11641 | nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN, |
4eeaa230 | 11642 | &syms); |
14f9c5c9 AS |
11643 | |
11644 | if (nsyms != 1) | |
11645 | { | |
11646 | if (err_msg == NULL) | |
4c4b4cd2 | 11647 | return 0; |
14f9c5c9 | 11648 | else |
8a3fe4f8 | 11649 | error (("%s"), err_msg); |
14f9c5c9 AS |
11650 | } |
11651 | ||
d12307c1 | 11652 | return value_of_variable (syms[0].symbol, syms[0].block); |
14f9c5c9 | 11653 | } |
d2e4a39e | 11654 | |
14f9c5c9 | 11655 | /* Value of integer variable named NAME in the current environment. If |
4c4b4cd2 PH |
11656 | no such variable found, returns 0, and sets *FLAG to 0. If |
11657 | successful, sets *FLAG to 1. */ | |
11658 | ||
14f9c5c9 | 11659 | LONGEST |
4c4b4cd2 | 11660 | get_int_var_value (char *name, int *flag) |
14f9c5c9 | 11661 | { |
4c4b4cd2 | 11662 | struct value *var_val = get_var_value (name, 0); |
d2e4a39e | 11663 | |
14f9c5c9 AS |
11664 | if (var_val == 0) |
11665 | { | |
11666 | if (flag != NULL) | |
4c4b4cd2 | 11667 | *flag = 0; |
14f9c5c9 AS |
11668 | return 0; |
11669 | } | |
11670 | else | |
11671 | { | |
11672 | if (flag != NULL) | |
4c4b4cd2 | 11673 | *flag = 1; |
14f9c5c9 AS |
11674 | return value_as_long (var_val); |
11675 | } | |
11676 | } | |
d2e4a39e | 11677 | |
14f9c5c9 AS |
11678 | |
11679 | /* Return a range type whose base type is that of the range type named | |
11680 | NAME in the current environment, and whose bounds are calculated | |
4c4b4cd2 | 11681 | from NAME according to the GNAT range encoding conventions. |
1ce677a4 UW |
11682 | Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the |
11683 | corresponding range type from debug information; fall back to using it | |
11684 | if symbol lookup fails. If a new type must be created, allocate it | |
11685 | like ORIG_TYPE was. The bounds information, in general, is encoded | |
11686 | in NAME, the base type given in the named range type. */ | |
14f9c5c9 | 11687 | |
d2e4a39e | 11688 | static struct type * |
28c85d6c | 11689 | to_fixed_range_type (struct type *raw_type, struct value *dval) |
14f9c5c9 | 11690 | { |
0d5cff50 | 11691 | const char *name; |
14f9c5c9 | 11692 | struct type *base_type; |
108d56a4 | 11693 | const char *subtype_info; |
14f9c5c9 | 11694 | |
28c85d6c JB |
11695 | gdb_assert (raw_type != NULL); |
11696 | gdb_assert (TYPE_NAME (raw_type) != NULL); | |
dddfab26 | 11697 | |
1ce677a4 | 11698 | if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE) |
14f9c5c9 AS |
11699 | base_type = TYPE_TARGET_TYPE (raw_type); |
11700 | else | |
11701 | base_type = raw_type; | |
11702 | ||
28c85d6c | 11703 | name = TYPE_NAME (raw_type); |
14f9c5c9 AS |
11704 | subtype_info = strstr (name, "___XD"); |
11705 | if (subtype_info == NULL) | |
690cc4eb | 11706 | { |
43bbcdc2 PH |
11707 | LONGEST L = ada_discrete_type_low_bound (raw_type); |
11708 | LONGEST U = ada_discrete_type_high_bound (raw_type); | |
5b4ee69b | 11709 | |
690cc4eb PH |
11710 | if (L < INT_MIN || U > INT_MAX) |
11711 | return raw_type; | |
11712 | else | |
0c9c3474 SA |
11713 | return create_static_range_type (alloc_type_copy (raw_type), raw_type, |
11714 | L, U); | |
690cc4eb | 11715 | } |
14f9c5c9 AS |
11716 | else |
11717 | { | |
11718 | static char *name_buf = NULL; | |
11719 | static size_t name_len = 0; | |
11720 | int prefix_len = subtype_info - name; | |
11721 | LONGEST L, U; | |
11722 | struct type *type; | |
108d56a4 | 11723 | const char *bounds_str; |
14f9c5c9 AS |
11724 | int n; |
11725 | ||
11726 | GROW_VECT (name_buf, name_len, prefix_len + 5); | |
11727 | strncpy (name_buf, name, prefix_len); | |
11728 | name_buf[prefix_len] = '\0'; | |
11729 | ||
11730 | subtype_info += 5; | |
11731 | bounds_str = strchr (subtype_info, '_'); | |
11732 | n = 1; | |
11733 | ||
d2e4a39e | 11734 | if (*subtype_info == 'L') |
4c4b4cd2 PH |
11735 | { |
11736 | if (!ada_scan_number (bounds_str, n, &L, &n) | |
11737 | && !scan_discrim_bound (bounds_str, n, dval, &L, &n)) | |
11738 | return raw_type; | |
11739 | if (bounds_str[n] == '_') | |
11740 | n += 2; | |
0963b4bd | 11741 | else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */ |
4c4b4cd2 PH |
11742 | n += 1; |
11743 | subtype_info += 1; | |
11744 | } | |
d2e4a39e | 11745 | else |
4c4b4cd2 PH |
11746 | { |
11747 | int ok; | |
5b4ee69b | 11748 | |
4c4b4cd2 PH |
11749 | strcpy (name_buf + prefix_len, "___L"); |
11750 | L = get_int_var_value (name_buf, &ok); | |
11751 | if (!ok) | |
11752 | { | |
323e0a4a | 11753 | lim_warning (_("Unknown lower bound, using 1.")); |
4c4b4cd2 PH |
11754 | L = 1; |
11755 | } | |
11756 | } | |
14f9c5c9 | 11757 | |
d2e4a39e | 11758 | if (*subtype_info == 'U') |
4c4b4cd2 PH |
11759 | { |
11760 | if (!ada_scan_number (bounds_str, n, &U, &n) | |
11761 | && !scan_discrim_bound (bounds_str, n, dval, &U, &n)) | |
11762 | return raw_type; | |
11763 | } | |
d2e4a39e | 11764 | else |
4c4b4cd2 PH |
11765 | { |
11766 | int ok; | |
5b4ee69b | 11767 | |
4c4b4cd2 PH |
11768 | strcpy (name_buf + prefix_len, "___U"); |
11769 | U = get_int_var_value (name_buf, &ok); | |
11770 | if (!ok) | |
11771 | { | |
323e0a4a | 11772 | lim_warning (_("Unknown upper bound, using %ld."), (long) L); |
4c4b4cd2 PH |
11773 | U = L; |
11774 | } | |
11775 | } | |
14f9c5c9 | 11776 | |
0c9c3474 SA |
11777 | type = create_static_range_type (alloc_type_copy (raw_type), |
11778 | base_type, L, U); | |
d2e4a39e | 11779 | TYPE_NAME (type) = name; |
14f9c5c9 AS |
11780 | return type; |
11781 | } | |
11782 | } | |
11783 | ||
4c4b4cd2 PH |
11784 | /* True iff NAME is the name of a range type. */ |
11785 | ||
14f9c5c9 | 11786 | int |
d2e4a39e | 11787 | ada_is_range_type_name (const char *name) |
14f9c5c9 AS |
11788 | { |
11789 | return (name != NULL && strstr (name, "___XD")); | |
d2e4a39e | 11790 | } |
14f9c5c9 | 11791 | \f |
d2e4a39e | 11792 | |
4c4b4cd2 PH |
11793 | /* Modular types */ |
11794 | ||
11795 | /* True iff TYPE is an Ada modular type. */ | |
14f9c5c9 | 11796 | |
14f9c5c9 | 11797 | int |
d2e4a39e | 11798 | ada_is_modular_type (struct type *type) |
14f9c5c9 | 11799 | { |
18af8284 | 11800 | struct type *subranged_type = get_base_type (type); |
14f9c5c9 AS |
11801 | |
11802 | return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE | |
690cc4eb | 11803 | && TYPE_CODE (subranged_type) == TYPE_CODE_INT |
4c4b4cd2 | 11804 | && TYPE_UNSIGNED (subranged_type)); |
14f9c5c9 AS |
11805 | } |
11806 | ||
4c4b4cd2 PH |
11807 | /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */ |
11808 | ||
61ee279c | 11809 | ULONGEST |
0056e4d5 | 11810 | ada_modulus (struct type *type) |
14f9c5c9 | 11811 | { |
43bbcdc2 | 11812 | return (ULONGEST) TYPE_HIGH_BOUND (type) + 1; |
14f9c5c9 | 11813 | } |
d2e4a39e | 11814 | \f |
f7f9143b JB |
11815 | |
11816 | /* Ada exception catchpoint support: | |
11817 | --------------------------------- | |
11818 | ||
11819 | We support 3 kinds of exception catchpoints: | |
11820 | . catchpoints on Ada exceptions | |
11821 | . catchpoints on unhandled Ada exceptions | |
11822 | . catchpoints on failed assertions | |
11823 | ||
11824 | Exceptions raised during failed assertions, or unhandled exceptions | |
11825 | could perfectly be caught with the general catchpoint on Ada exceptions. | |
11826 | However, we can easily differentiate these two special cases, and having | |
11827 | the option to distinguish these two cases from the rest can be useful | |
11828 | to zero-in on certain situations. | |
11829 | ||
11830 | Exception catchpoints are a specialized form of breakpoint, | |
11831 | since they rely on inserting breakpoints inside known routines | |
11832 | of the GNAT runtime. The implementation therefore uses a standard | |
11833 | breakpoint structure of the BP_BREAKPOINT type, but with its own set | |
11834 | of breakpoint_ops. | |
11835 | ||
0259addd JB |
11836 | Support in the runtime for exception catchpoints have been changed |
11837 | a few times already, and these changes affect the implementation | |
11838 | of these catchpoints. In order to be able to support several | |
11839 | variants of the runtime, we use a sniffer that will determine | |
28010a5d | 11840 | the runtime variant used by the program being debugged. */ |
f7f9143b | 11841 | |
82eacd52 JB |
11842 | /* Ada's standard exceptions. |
11843 | ||
11844 | The Ada 83 standard also defined Numeric_Error. But there so many | |
11845 | situations where it was unclear from the Ada 83 Reference Manual | |
11846 | (RM) whether Constraint_Error or Numeric_Error should be raised, | |
11847 | that the ARG (Ada Rapporteur Group) eventually issued a Binding | |
11848 | Interpretation saying that anytime the RM says that Numeric_Error | |
11849 | should be raised, the implementation may raise Constraint_Error. | |
11850 | Ada 95 went one step further and pretty much removed Numeric_Error | |
11851 | from the list of standard exceptions (it made it a renaming of | |
11852 | Constraint_Error, to help preserve compatibility when compiling | |
11853 | an Ada83 compiler). As such, we do not include Numeric_Error from | |
11854 | this list of standard exceptions. */ | |
3d0b0fa3 JB |
11855 | |
11856 | static char *standard_exc[] = { | |
11857 | "constraint_error", | |
11858 | "program_error", | |
11859 | "storage_error", | |
11860 | "tasking_error" | |
11861 | }; | |
11862 | ||
0259addd JB |
11863 | typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void); |
11864 | ||
11865 | /* A structure that describes how to support exception catchpoints | |
11866 | for a given executable. */ | |
11867 | ||
11868 | struct exception_support_info | |
11869 | { | |
11870 | /* The name of the symbol to break on in order to insert | |
11871 | a catchpoint on exceptions. */ | |
11872 | const char *catch_exception_sym; | |
11873 | ||
11874 | /* The name of the symbol to break on in order to insert | |
11875 | a catchpoint on unhandled exceptions. */ | |
11876 | const char *catch_exception_unhandled_sym; | |
11877 | ||
11878 | /* The name of the symbol to break on in order to insert | |
11879 | a catchpoint on failed assertions. */ | |
11880 | const char *catch_assert_sym; | |
11881 | ||
11882 | /* Assuming that the inferior just triggered an unhandled exception | |
11883 | catchpoint, this function is responsible for returning the address | |
11884 | in inferior memory where the name of that exception is stored. | |
11885 | Return zero if the address could not be computed. */ | |
11886 | ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr; | |
11887 | }; | |
11888 | ||
11889 | static CORE_ADDR ada_unhandled_exception_name_addr (void); | |
11890 | static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void); | |
11891 | ||
11892 | /* The following exception support info structure describes how to | |
11893 | implement exception catchpoints with the latest version of the | |
11894 | Ada runtime (as of 2007-03-06). */ | |
11895 | ||
11896 | static const struct exception_support_info default_exception_support_info = | |
11897 | { | |
11898 | "__gnat_debug_raise_exception", /* catch_exception_sym */ | |
11899 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
11900 | "__gnat_debug_raise_assert_failure", /* catch_assert_sym */ | |
11901 | ada_unhandled_exception_name_addr | |
11902 | }; | |
11903 | ||
11904 | /* The following exception support info structure describes how to | |
11905 | implement exception catchpoints with a slightly older version | |
11906 | of the Ada runtime. */ | |
11907 | ||
11908 | static const struct exception_support_info exception_support_info_fallback = | |
11909 | { | |
11910 | "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */ | |
11911 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
11912 | "system__assertions__raise_assert_failure", /* catch_assert_sym */ | |
11913 | ada_unhandled_exception_name_addr_from_raise | |
11914 | }; | |
11915 | ||
f17011e0 JB |
11916 | /* Return nonzero if we can detect the exception support routines |
11917 | described in EINFO. | |
11918 | ||
11919 | This function errors out if an abnormal situation is detected | |
11920 | (for instance, if we find the exception support routines, but | |
11921 | that support is found to be incomplete). */ | |
11922 | ||
11923 | static int | |
11924 | ada_has_this_exception_support (const struct exception_support_info *einfo) | |
11925 | { | |
11926 | struct symbol *sym; | |
11927 | ||
11928 | /* The symbol we're looking up is provided by a unit in the GNAT runtime | |
11929 | that should be compiled with debugging information. As a result, we | |
11930 | expect to find that symbol in the symtabs. */ | |
11931 | ||
11932 | sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN); | |
11933 | if (sym == NULL) | |
a6af7abe JB |
11934 | { |
11935 | /* Perhaps we did not find our symbol because the Ada runtime was | |
11936 | compiled without debugging info, or simply stripped of it. | |
11937 | It happens on some GNU/Linux distributions for instance, where | |
11938 | users have to install a separate debug package in order to get | |
11939 | the runtime's debugging info. In that situation, let the user | |
11940 | know why we cannot insert an Ada exception catchpoint. | |
11941 | ||
11942 | Note: Just for the purpose of inserting our Ada exception | |
11943 | catchpoint, we could rely purely on the associated minimal symbol. | |
11944 | But we would be operating in degraded mode anyway, since we are | |
11945 | still lacking the debugging info needed later on to extract | |
11946 | the name of the exception being raised (this name is printed in | |
11947 | the catchpoint message, and is also used when trying to catch | |
11948 | a specific exception). We do not handle this case for now. */ | |
3b7344d5 | 11949 | struct bound_minimal_symbol msym |
1c8e84b0 JB |
11950 | = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL); |
11951 | ||
3b7344d5 | 11952 | if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline) |
a6af7abe JB |
11953 | error (_("Your Ada runtime appears to be missing some debugging " |
11954 | "information.\nCannot insert Ada exception catchpoint " | |
11955 | "in this configuration.")); | |
11956 | ||
11957 | return 0; | |
11958 | } | |
f17011e0 JB |
11959 | |
11960 | /* Make sure that the symbol we found corresponds to a function. */ | |
11961 | ||
11962 | if (SYMBOL_CLASS (sym) != LOC_BLOCK) | |
11963 | error (_("Symbol \"%s\" is not a function (class = %d)"), | |
11964 | SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym)); | |
11965 | ||
11966 | return 1; | |
11967 | } | |
11968 | ||
0259addd JB |
11969 | /* Inspect the Ada runtime and determine which exception info structure |
11970 | should be used to provide support for exception catchpoints. | |
11971 | ||
3eecfa55 JB |
11972 | This function will always set the per-inferior exception_info, |
11973 | or raise an error. */ | |
0259addd JB |
11974 | |
11975 | static void | |
11976 | ada_exception_support_info_sniffer (void) | |
11977 | { | |
3eecfa55 | 11978 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
0259addd JB |
11979 | |
11980 | /* If the exception info is already known, then no need to recompute it. */ | |
3eecfa55 | 11981 | if (data->exception_info != NULL) |
0259addd JB |
11982 | return; |
11983 | ||
11984 | /* Check the latest (default) exception support info. */ | |
f17011e0 | 11985 | if (ada_has_this_exception_support (&default_exception_support_info)) |
0259addd | 11986 | { |
3eecfa55 | 11987 | data->exception_info = &default_exception_support_info; |
0259addd JB |
11988 | return; |
11989 | } | |
11990 | ||
11991 | /* Try our fallback exception suport info. */ | |
f17011e0 | 11992 | if (ada_has_this_exception_support (&exception_support_info_fallback)) |
0259addd | 11993 | { |
3eecfa55 | 11994 | data->exception_info = &exception_support_info_fallback; |
0259addd JB |
11995 | return; |
11996 | } | |
11997 | ||
11998 | /* Sometimes, it is normal for us to not be able to find the routine | |
11999 | we are looking for. This happens when the program is linked with | |
12000 | the shared version of the GNAT runtime, and the program has not been | |
12001 | started yet. Inform the user of these two possible causes if | |
12002 | applicable. */ | |
12003 | ||
ccefe4c4 | 12004 | if (ada_update_initial_language (language_unknown) != language_ada) |
0259addd JB |
12005 | error (_("Unable to insert catchpoint. Is this an Ada main program?")); |
12006 | ||
12007 | /* If the symbol does not exist, then check that the program is | |
12008 | already started, to make sure that shared libraries have been | |
12009 | loaded. If it is not started, this may mean that the symbol is | |
12010 | in a shared library. */ | |
12011 | ||
12012 | if (ptid_get_pid (inferior_ptid) == 0) | |
12013 | error (_("Unable to insert catchpoint. Try to start the program first.")); | |
12014 | ||
12015 | /* At this point, we know that we are debugging an Ada program and | |
12016 | that the inferior has been started, but we still are not able to | |
0963b4bd | 12017 | find the run-time symbols. That can mean that we are in |
0259addd JB |
12018 | configurable run time mode, or that a-except as been optimized |
12019 | out by the linker... In any case, at this point it is not worth | |
12020 | supporting this feature. */ | |
12021 | ||
7dda8cff | 12022 | error (_("Cannot insert Ada exception catchpoints in this configuration.")); |
0259addd JB |
12023 | } |
12024 | ||
f7f9143b JB |
12025 | /* True iff FRAME is very likely to be that of a function that is |
12026 | part of the runtime system. This is all very heuristic, but is | |
12027 | intended to be used as advice as to what frames are uninteresting | |
12028 | to most users. */ | |
12029 | ||
12030 | static int | |
12031 | is_known_support_routine (struct frame_info *frame) | |
12032 | { | |
4ed6b5be | 12033 | struct symtab_and_line sal; |
55b87a52 | 12034 | char *func_name; |
692465f1 | 12035 | enum language func_lang; |
f7f9143b | 12036 | int i; |
f35a17b5 | 12037 | const char *fullname; |
f7f9143b | 12038 | |
4ed6b5be JB |
12039 | /* If this code does not have any debugging information (no symtab), |
12040 | This cannot be any user code. */ | |
f7f9143b | 12041 | |
4ed6b5be | 12042 | find_frame_sal (frame, &sal); |
f7f9143b JB |
12043 | if (sal.symtab == NULL) |
12044 | return 1; | |
12045 | ||
4ed6b5be JB |
12046 | /* If there is a symtab, but the associated source file cannot be |
12047 | located, then assume this is not user code: Selecting a frame | |
12048 | for which we cannot display the code would not be very helpful | |
12049 | for the user. This should also take care of case such as VxWorks | |
12050 | where the kernel has some debugging info provided for a few units. */ | |
f7f9143b | 12051 | |
f35a17b5 JK |
12052 | fullname = symtab_to_fullname (sal.symtab); |
12053 | if (access (fullname, R_OK) != 0) | |
f7f9143b JB |
12054 | return 1; |
12055 | ||
4ed6b5be JB |
12056 | /* Check the unit filename againt the Ada runtime file naming. |
12057 | We also check the name of the objfile against the name of some | |
12058 | known system libraries that sometimes come with debugging info | |
12059 | too. */ | |
12060 | ||
f7f9143b JB |
12061 | for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1) |
12062 | { | |
12063 | re_comp (known_runtime_file_name_patterns[i]); | |
f69c91ad | 12064 | if (re_exec (lbasename (sal.symtab->filename))) |
f7f9143b | 12065 | return 1; |
eb822aa6 DE |
12066 | if (SYMTAB_OBJFILE (sal.symtab) != NULL |
12067 | && re_exec (objfile_name (SYMTAB_OBJFILE (sal.symtab)))) | |
4ed6b5be | 12068 | return 1; |
f7f9143b JB |
12069 | } |
12070 | ||
4ed6b5be | 12071 | /* Check whether the function is a GNAT-generated entity. */ |
f7f9143b | 12072 | |
e9e07ba6 | 12073 | find_frame_funname (frame, &func_name, &func_lang, NULL); |
f7f9143b JB |
12074 | if (func_name == NULL) |
12075 | return 1; | |
12076 | ||
12077 | for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1) | |
12078 | { | |
12079 | re_comp (known_auxiliary_function_name_patterns[i]); | |
12080 | if (re_exec (func_name)) | |
55b87a52 KS |
12081 | { |
12082 | xfree (func_name); | |
12083 | return 1; | |
12084 | } | |
f7f9143b JB |
12085 | } |
12086 | ||
55b87a52 | 12087 | xfree (func_name); |
f7f9143b JB |
12088 | return 0; |
12089 | } | |
12090 | ||
12091 | /* Find the first frame that contains debugging information and that is not | |
12092 | part of the Ada run-time, starting from FI and moving upward. */ | |
12093 | ||
0ef643c8 | 12094 | void |
f7f9143b JB |
12095 | ada_find_printable_frame (struct frame_info *fi) |
12096 | { | |
12097 | for (; fi != NULL; fi = get_prev_frame (fi)) | |
12098 | { | |
12099 | if (!is_known_support_routine (fi)) | |
12100 | { | |
12101 | select_frame (fi); | |
12102 | break; | |
12103 | } | |
12104 | } | |
12105 | ||
12106 | } | |
12107 | ||
12108 | /* Assuming that the inferior just triggered an unhandled exception | |
12109 | catchpoint, return the address in inferior memory where the name | |
12110 | of the exception is stored. | |
12111 | ||
12112 | Return zero if the address could not be computed. */ | |
12113 | ||
12114 | static CORE_ADDR | |
12115 | ada_unhandled_exception_name_addr (void) | |
0259addd JB |
12116 | { |
12117 | return parse_and_eval_address ("e.full_name"); | |
12118 | } | |
12119 | ||
12120 | /* Same as ada_unhandled_exception_name_addr, except that this function | |
12121 | should be used when the inferior uses an older version of the runtime, | |
12122 | where the exception name needs to be extracted from a specific frame | |
12123 | several frames up in the callstack. */ | |
12124 | ||
12125 | static CORE_ADDR | |
12126 | ada_unhandled_exception_name_addr_from_raise (void) | |
f7f9143b JB |
12127 | { |
12128 | int frame_level; | |
12129 | struct frame_info *fi; | |
3eecfa55 | 12130 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
55b87a52 | 12131 | struct cleanup *old_chain; |
f7f9143b JB |
12132 | |
12133 | /* To determine the name of this exception, we need to select | |
12134 | the frame corresponding to RAISE_SYM_NAME. This frame is | |
12135 | at least 3 levels up, so we simply skip the first 3 frames | |
12136 | without checking the name of their associated function. */ | |
12137 | fi = get_current_frame (); | |
12138 | for (frame_level = 0; frame_level < 3; frame_level += 1) | |
12139 | if (fi != NULL) | |
12140 | fi = get_prev_frame (fi); | |
12141 | ||
55b87a52 | 12142 | old_chain = make_cleanup (null_cleanup, NULL); |
f7f9143b JB |
12143 | while (fi != NULL) |
12144 | { | |
55b87a52 | 12145 | char *func_name; |
692465f1 JB |
12146 | enum language func_lang; |
12147 | ||
e9e07ba6 | 12148 | find_frame_funname (fi, &func_name, &func_lang, NULL); |
55b87a52 KS |
12149 | if (func_name != NULL) |
12150 | { | |
12151 | make_cleanup (xfree, func_name); | |
12152 | ||
12153 | if (strcmp (func_name, | |
12154 | data->exception_info->catch_exception_sym) == 0) | |
12155 | break; /* We found the frame we were looking for... */ | |
12156 | fi = get_prev_frame (fi); | |
12157 | } | |
f7f9143b | 12158 | } |
55b87a52 | 12159 | do_cleanups (old_chain); |
f7f9143b JB |
12160 | |
12161 | if (fi == NULL) | |
12162 | return 0; | |
12163 | ||
12164 | select_frame (fi); | |
12165 | return parse_and_eval_address ("id.full_name"); | |
12166 | } | |
12167 | ||
12168 | /* Assuming the inferior just triggered an Ada exception catchpoint | |
12169 | (of any type), return the address in inferior memory where the name | |
12170 | of the exception is stored, if applicable. | |
12171 | ||
12172 | Return zero if the address could not be computed, or if not relevant. */ | |
12173 | ||
12174 | static CORE_ADDR | |
761269c8 | 12175 | ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12176 | struct breakpoint *b) |
12177 | { | |
3eecfa55 JB |
12178 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
12179 | ||
f7f9143b JB |
12180 | switch (ex) |
12181 | { | |
761269c8 | 12182 | case ada_catch_exception: |
f7f9143b JB |
12183 | return (parse_and_eval_address ("e.full_name")); |
12184 | break; | |
12185 | ||
761269c8 | 12186 | case ada_catch_exception_unhandled: |
3eecfa55 | 12187 | return data->exception_info->unhandled_exception_name_addr (); |
f7f9143b JB |
12188 | break; |
12189 | ||
761269c8 | 12190 | case ada_catch_assert: |
f7f9143b JB |
12191 | return 0; /* Exception name is not relevant in this case. */ |
12192 | break; | |
12193 | ||
12194 | default: | |
12195 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12196 | break; | |
12197 | } | |
12198 | ||
12199 | return 0; /* Should never be reached. */ | |
12200 | } | |
12201 | ||
12202 | /* Same as ada_exception_name_addr_1, except that it intercepts and contains | |
12203 | any error that ada_exception_name_addr_1 might cause to be thrown. | |
12204 | When an error is intercepted, a warning with the error message is printed, | |
12205 | and zero is returned. */ | |
12206 | ||
12207 | static CORE_ADDR | |
761269c8 | 12208 | ada_exception_name_addr (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12209 | struct breakpoint *b) |
12210 | { | |
f7f9143b JB |
12211 | CORE_ADDR result = 0; |
12212 | ||
492d29ea | 12213 | TRY |
f7f9143b JB |
12214 | { |
12215 | result = ada_exception_name_addr_1 (ex, b); | |
12216 | } | |
12217 | ||
492d29ea | 12218 | CATCH (e, RETURN_MASK_ERROR) |
f7f9143b JB |
12219 | { |
12220 | warning (_("failed to get exception name: %s"), e.message); | |
12221 | return 0; | |
12222 | } | |
492d29ea | 12223 | END_CATCH |
f7f9143b JB |
12224 | |
12225 | return result; | |
12226 | } | |
12227 | ||
28010a5d PA |
12228 | static char *ada_exception_catchpoint_cond_string (const char *excep_string); |
12229 | ||
12230 | /* Ada catchpoints. | |
12231 | ||
12232 | In the case of catchpoints on Ada exceptions, the catchpoint will | |
12233 | stop the target on every exception the program throws. When a user | |
12234 | specifies the name of a specific exception, we translate this | |
12235 | request into a condition expression (in text form), and then parse | |
12236 | it into an expression stored in each of the catchpoint's locations. | |
12237 | We then use this condition to check whether the exception that was | |
12238 | raised is the one the user is interested in. If not, then the | |
12239 | target is resumed again. We store the name of the requested | |
12240 | exception, in order to be able to re-set the condition expression | |
12241 | when symbols change. */ | |
12242 | ||
12243 | /* An instance of this type is used to represent an Ada catchpoint | |
12244 | breakpoint location. It includes a "struct bp_location" as a kind | |
12245 | of base class; users downcast to "struct bp_location *" when | |
12246 | needed. */ | |
12247 | ||
12248 | struct ada_catchpoint_location | |
12249 | { | |
12250 | /* The base class. */ | |
12251 | struct bp_location base; | |
12252 | ||
12253 | /* The condition that checks whether the exception that was raised | |
12254 | is the specific exception the user specified on catchpoint | |
12255 | creation. */ | |
12256 | struct expression *excep_cond_expr; | |
12257 | }; | |
12258 | ||
12259 | /* Implement the DTOR method in the bp_location_ops structure for all | |
12260 | Ada exception catchpoint kinds. */ | |
12261 | ||
12262 | static void | |
12263 | ada_catchpoint_location_dtor (struct bp_location *bl) | |
12264 | { | |
12265 | struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl; | |
12266 | ||
12267 | xfree (al->excep_cond_expr); | |
12268 | } | |
12269 | ||
12270 | /* The vtable to be used in Ada catchpoint locations. */ | |
12271 | ||
12272 | static const struct bp_location_ops ada_catchpoint_location_ops = | |
12273 | { | |
12274 | ada_catchpoint_location_dtor | |
12275 | }; | |
12276 | ||
12277 | /* An instance of this type is used to represent an Ada catchpoint. | |
12278 | It includes a "struct breakpoint" as a kind of base class; users | |
12279 | downcast to "struct breakpoint *" when needed. */ | |
12280 | ||
12281 | struct ada_catchpoint | |
12282 | { | |
12283 | /* The base class. */ | |
12284 | struct breakpoint base; | |
12285 | ||
12286 | /* The name of the specific exception the user specified. */ | |
12287 | char *excep_string; | |
12288 | }; | |
12289 | ||
12290 | /* Parse the exception condition string in the context of each of the | |
12291 | catchpoint's locations, and store them for later evaluation. */ | |
12292 | ||
12293 | static void | |
12294 | create_excep_cond_exprs (struct ada_catchpoint *c) | |
12295 | { | |
12296 | struct cleanup *old_chain; | |
12297 | struct bp_location *bl; | |
12298 | char *cond_string; | |
12299 | ||
12300 | /* Nothing to do if there's no specific exception to catch. */ | |
12301 | if (c->excep_string == NULL) | |
12302 | return; | |
12303 | ||
12304 | /* Same if there are no locations... */ | |
12305 | if (c->base.loc == NULL) | |
12306 | return; | |
12307 | ||
12308 | /* Compute the condition expression in text form, from the specific | |
12309 | expection we want to catch. */ | |
12310 | cond_string = ada_exception_catchpoint_cond_string (c->excep_string); | |
12311 | old_chain = make_cleanup (xfree, cond_string); | |
12312 | ||
12313 | /* Iterate over all the catchpoint's locations, and parse an | |
12314 | expression for each. */ | |
12315 | for (bl = c->base.loc; bl != NULL; bl = bl->next) | |
12316 | { | |
12317 | struct ada_catchpoint_location *ada_loc | |
12318 | = (struct ada_catchpoint_location *) bl; | |
12319 | struct expression *exp = NULL; | |
12320 | ||
12321 | if (!bl->shlib_disabled) | |
12322 | { | |
bbc13ae3 | 12323 | const char *s; |
28010a5d PA |
12324 | |
12325 | s = cond_string; | |
492d29ea | 12326 | TRY |
28010a5d | 12327 | { |
1bb9788d TT |
12328 | exp = parse_exp_1 (&s, bl->address, |
12329 | block_for_pc (bl->address), 0); | |
28010a5d | 12330 | } |
492d29ea | 12331 | CATCH (e, RETURN_MASK_ERROR) |
849f2b52 JB |
12332 | { |
12333 | warning (_("failed to reevaluate internal exception condition " | |
12334 | "for catchpoint %d: %s"), | |
12335 | c->base.number, e.message); | |
12336 | /* There is a bug in GCC on sparc-solaris when building with | |
12337 | optimization which causes EXP to change unexpectedly | |
12338 | (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982). | |
12339 | The problem should be fixed starting with GCC 4.9. | |
12340 | In the meantime, work around it by forcing EXP back | |
12341 | to NULL. */ | |
12342 | exp = NULL; | |
12343 | } | |
492d29ea | 12344 | END_CATCH |
28010a5d PA |
12345 | } |
12346 | ||
12347 | ada_loc->excep_cond_expr = exp; | |
12348 | } | |
12349 | ||
12350 | do_cleanups (old_chain); | |
12351 | } | |
12352 | ||
12353 | /* Implement the DTOR method in the breakpoint_ops structure for all | |
12354 | exception catchpoint kinds. */ | |
12355 | ||
12356 | static void | |
761269c8 | 12357 | dtor_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b) |
28010a5d PA |
12358 | { |
12359 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; | |
12360 | ||
12361 | xfree (c->excep_string); | |
348d480f | 12362 | |
2060206e | 12363 | bkpt_breakpoint_ops.dtor (b); |
28010a5d PA |
12364 | } |
12365 | ||
12366 | /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops | |
12367 | structure for all exception catchpoint kinds. */ | |
12368 | ||
12369 | static struct bp_location * | |
761269c8 | 12370 | allocate_location_exception (enum ada_exception_catchpoint_kind ex, |
28010a5d PA |
12371 | struct breakpoint *self) |
12372 | { | |
12373 | struct ada_catchpoint_location *loc; | |
12374 | ||
12375 | loc = XNEW (struct ada_catchpoint_location); | |
12376 | init_bp_location (&loc->base, &ada_catchpoint_location_ops, self); | |
12377 | loc->excep_cond_expr = NULL; | |
12378 | return &loc->base; | |
12379 | } | |
12380 | ||
12381 | /* Implement the RE_SET method in the breakpoint_ops structure for all | |
12382 | exception catchpoint kinds. */ | |
12383 | ||
12384 | static void | |
761269c8 | 12385 | re_set_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b) |
28010a5d PA |
12386 | { |
12387 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; | |
12388 | ||
12389 | /* Call the base class's method. This updates the catchpoint's | |
12390 | locations. */ | |
2060206e | 12391 | bkpt_breakpoint_ops.re_set (b); |
28010a5d PA |
12392 | |
12393 | /* Reparse the exception conditional expressions. One for each | |
12394 | location. */ | |
12395 | create_excep_cond_exprs (c); | |
12396 | } | |
12397 | ||
12398 | /* Returns true if we should stop for this breakpoint hit. If the | |
12399 | user specified a specific exception, we only want to cause a stop | |
12400 | if the program thrown that exception. */ | |
12401 | ||
12402 | static int | |
12403 | should_stop_exception (const struct bp_location *bl) | |
12404 | { | |
12405 | struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner; | |
12406 | const struct ada_catchpoint_location *ada_loc | |
12407 | = (const struct ada_catchpoint_location *) bl; | |
28010a5d PA |
12408 | int stop; |
12409 | ||
12410 | /* With no specific exception, should always stop. */ | |
12411 | if (c->excep_string == NULL) | |
12412 | return 1; | |
12413 | ||
12414 | if (ada_loc->excep_cond_expr == NULL) | |
12415 | { | |
12416 | /* We will have a NULL expression if back when we were creating | |
12417 | the expressions, this location's had failed to parse. */ | |
12418 | return 1; | |
12419 | } | |
12420 | ||
12421 | stop = 1; | |
492d29ea | 12422 | TRY |
28010a5d PA |
12423 | { |
12424 | struct value *mark; | |
12425 | ||
12426 | mark = value_mark (); | |
12427 | stop = value_true (evaluate_expression (ada_loc->excep_cond_expr)); | |
12428 | value_free_to_mark (mark); | |
12429 | } | |
492d29ea PA |
12430 | CATCH (ex, RETURN_MASK_ALL) |
12431 | { | |
12432 | exception_fprintf (gdb_stderr, ex, | |
12433 | _("Error in testing exception condition:\n")); | |
12434 | } | |
12435 | END_CATCH | |
12436 | ||
28010a5d PA |
12437 | return stop; |
12438 | } | |
12439 | ||
12440 | /* Implement the CHECK_STATUS method in the breakpoint_ops structure | |
12441 | for all exception catchpoint kinds. */ | |
12442 | ||
12443 | static void | |
761269c8 | 12444 | check_status_exception (enum ada_exception_catchpoint_kind ex, bpstat bs) |
28010a5d PA |
12445 | { |
12446 | bs->stop = should_stop_exception (bs->bp_location_at); | |
12447 | } | |
12448 | ||
f7f9143b JB |
12449 | /* Implement the PRINT_IT method in the breakpoint_ops structure |
12450 | for all exception catchpoint kinds. */ | |
12451 | ||
12452 | static enum print_stop_action | |
761269c8 | 12453 | print_it_exception (enum ada_exception_catchpoint_kind ex, bpstat bs) |
f7f9143b | 12454 | { |
79a45e25 | 12455 | struct ui_out *uiout = current_uiout; |
348d480f PA |
12456 | struct breakpoint *b = bs->breakpoint_at; |
12457 | ||
956a9fb9 | 12458 | annotate_catchpoint (b->number); |
f7f9143b | 12459 | |
956a9fb9 | 12460 | if (ui_out_is_mi_like_p (uiout)) |
f7f9143b | 12461 | { |
956a9fb9 JB |
12462 | ui_out_field_string (uiout, "reason", |
12463 | async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT)); | |
12464 | ui_out_field_string (uiout, "disp", bpdisp_text (b->disposition)); | |
f7f9143b JB |
12465 | } |
12466 | ||
00eb2c4a JB |
12467 | ui_out_text (uiout, |
12468 | b->disposition == disp_del ? "\nTemporary catchpoint " | |
12469 | : "\nCatchpoint "); | |
956a9fb9 JB |
12470 | ui_out_field_int (uiout, "bkptno", b->number); |
12471 | ui_out_text (uiout, ", "); | |
f7f9143b | 12472 | |
f7f9143b JB |
12473 | switch (ex) |
12474 | { | |
761269c8 JB |
12475 | case ada_catch_exception: |
12476 | case ada_catch_exception_unhandled: | |
956a9fb9 JB |
12477 | { |
12478 | const CORE_ADDR addr = ada_exception_name_addr (ex, b); | |
12479 | char exception_name[256]; | |
12480 | ||
12481 | if (addr != 0) | |
12482 | { | |
c714b426 PA |
12483 | read_memory (addr, (gdb_byte *) exception_name, |
12484 | sizeof (exception_name) - 1); | |
956a9fb9 JB |
12485 | exception_name [sizeof (exception_name) - 1] = '\0'; |
12486 | } | |
12487 | else | |
12488 | { | |
12489 | /* For some reason, we were unable to read the exception | |
12490 | name. This could happen if the Runtime was compiled | |
12491 | without debugging info, for instance. In that case, | |
12492 | just replace the exception name by the generic string | |
12493 | "exception" - it will read as "an exception" in the | |
12494 | notification we are about to print. */ | |
967cff16 | 12495 | memcpy (exception_name, "exception", sizeof ("exception")); |
956a9fb9 JB |
12496 | } |
12497 | /* In the case of unhandled exception breakpoints, we print | |
12498 | the exception name as "unhandled EXCEPTION_NAME", to make | |
12499 | it clearer to the user which kind of catchpoint just got | |
12500 | hit. We used ui_out_text to make sure that this extra | |
12501 | info does not pollute the exception name in the MI case. */ | |
761269c8 | 12502 | if (ex == ada_catch_exception_unhandled) |
956a9fb9 JB |
12503 | ui_out_text (uiout, "unhandled "); |
12504 | ui_out_field_string (uiout, "exception-name", exception_name); | |
12505 | } | |
12506 | break; | |
761269c8 | 12507 | case ada_catch_assert: |
956a9fb9 JB |
12508 | /* In this case, the name of the exception is not really |
12509 | important. Just print "failed assertion" to make it clearer | |
12510 | that his program just hit an assertion-failure catchpoint. | |
12511 | We used ui_out_text because this info does not belong in | |
12512 | the MI output. */ | |
12513 | ui_out_text (uiout, "failed assertion"); | |
12514 | break; | |
f7f9143b | 12515 | } |
956a9fb9 JB |
12516 | ui_out_text (uiout, " at "); |
12517 | ada_find_printable_frame (get_current_frame ()); | |
f7f9143b JB |
12518 | |
12519 | return PRINT_SRC_AND_LOC; | |
12520 | } | |
12521 | ||
12522 | /* Implement the PRINT_ONE method in the breakpoint_ops structure | |
12523 | for all exception catchpoint kinds. */ | |
12524 | ||
12525 | static void | |
761269c8 | 12526 | print_one_exception (enum ada_exception_catchpoint_kind ex, |
a6d9a66e | 12527 | struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12528 | { |
79a45e25 | 12529 | struct ui_out *uiout = current_uiout; |
28010a5d | 12530 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
79a45b7d TT |
12531 | struct value_print_options opts; |
12532 | ||
12533 | get_user_print_options (&opts); | |
12534 | if (opts.addressprint) | |
f7f9143b JB |
12535 | { |
12536 | annotate_field (4); | |
5af949e3 | 12537 | ui_out_field_core_addr (uiout, "addr", b->loc->gdbarch, b->loc->address); |
f7f9143b JB |
12538 | } |
12539 | ||
12540 | annotate_field (5); | |
a6d9a66e | 12541 | *last_loc = b->loc; |
f7f9143b JB |
12542 | switch (ex) |
12543 | { | |
761269c8 | 12544 | case ada_catch_exception: |
28010a5d | 12545 | if (c->excep_string != NULL) |
f7f9143b | 12546 | { |
28010a5d PA |
12547 | char *msg = xstrprintf (_("`%s' Ada exception"), c->excep_string); |
12548 | ||
f7f9143b JB |
12549 | ui_out_field_string (uiout, "what", msg); |
12550 | xfree (msg); | |
12551 | } | |
12552 | else | |
12553 | ui_out_field_string (uiout, "what", "all Ada exceptions"); | |
12554 | ||
12555 | break; | |
12556 | ||
761269c8 | 12557 | case ada_catch_exception_unhandled: |
f7f9143b JB |
12558 | ui_out_field_string (uiout, "what", "unhandled Ada exceptions"); |
12559 | break; | |
12560 | ||
761269c8 | 12561 | case ada_catch_assert: |
f7f9143b JB |
12562 | ui_out_field_string (uiout, "what", "failed Ada assertions"); |
12563 | break; | |
12564 | ||
12565 | default: | |
12566 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12567 | break; | |
12568 | } | |
12569 | } | |
12570 | ||
12571 | /* Implement the PRINT_MENTION method in the breakpoint_ops structure | |
12572 | for all exception catchpoint kinds. */ | |
12573 | ||
12574 | static void | |
761269c8 | 12575 | print_mention_exception (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12576 | struct breakpoint *b) |
12577 | { | |
28010a5d | 12578 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
79a45e25 | 12579 | struct ui_out *uiout = current_uiout; |
28010a5d | 12580 | |
00eb2c4a JB |
12581 | ui_out_text (uiout, b->disposition == disp_del ? _("Temporary catchpoint ") |
12582 | : _("Catchpoint ")); | |
12583 | ui_out_field_int (uiout, "bkptno", b->number); | |
12584 | ui_out_text (uiout, ": "); | |
12585 | ||
f7f9143b JB |
12586 | switch (ex) |
12587 | { | |
761269c8 | 12588 | case ada_catch_exception: |
28010a5d | 12589 | if (c->excep_string != NULL) |
00eb2c4a JB |
12590 | { |
12591 | char *info = xstrprintf (_("`%s' Ada exception"), c->excep_string); | |
12592 | struct cleanup *old_chain = make_cleanup (xfree, info); | |
12593 | ||
12594 | ui_out_text (uiout, info); | |
12595 | do_cleanups (old_chain); | |
12596 | } | |
f7f9143b | 12597 | else |
00eb2c4a | 12598 | ui_out_text (uiout, _("all Ada exceptions")); |
f7f9143b JB |
12599 | break; |
12600 | ||
761269c8 | 12601 | case ada_catch_exception_unhandled: |
00eb2c4a | 12602 | ui_out_text (uiout, _("unhandled Ada exceptions")); |
f7f9143b JB |
12603 | break; |
12604 | ||
761269c8 | 12605 | case ada_catch_assert: |
00eb2c4a | 12606 | ui_out_text (uiout, _("failed Ada assertions")); |
f7f9143b JB |
12607 | break; |
12608 | ||
12609 | default: | |
12610 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12611 | break; | |
12612 | } | |
12613 | } | |
12614 | ||
6149aea9 PA |
12615 | /* Implement the PRINT_RECREATE method in the breakpoint_ops structure |
12616 | for all exception catchpoint kinds. */ | |
12617 | ||
12618 | static void | |
761269c8 | 12619 | print_recreate_exception (enum ada_exception_catchpoint_kind ex, |
6149aea9 PA |
12620 | struct breakpoint *b, struct ui_file *fp) |
12621 | { | |
28010a5d PA |
12622 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
12623 | ||
6149aea9 PA |
12624 | switch (ex) |
12625 | { | |
761269c8 | 12626 | case ada_catch_exception: |
6149aea9 | 12627 | fprintf_filtered (fp, "catch exception"); |
28010a5d PA |
12628 | if (c->excep_string != NULL) |
12629 | fprintf_filtered (fp, " %s", c->excep_string); | |
6149aea9 PA |
12630 | break; |
12631 | ||
761269c8 | 12632 | case ada_catch_exception_unhandled: |
78076abc | 12633 | fprintf_filtered (fp, "catch exception unhandled"); |
6149aea9 PA |
12634 | break; |
12635 | ||
761269c8 | 12636 | case ada_catch_assert: |
6149aea9 PA |
12637 | fprintf_filtered (fp, "catch assert"); |
12638 | break; | |
12639 | ||
12640 | default: | |
12641 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12642 | } | |
d9b3f62e | 12643 | print_recreate_thread (b, fp); |
6149aea9 PA |
12644 | } |
12645 | ||
f7f9143b JB |
12646 | /* Virtual table for "catch exception" breakpoints. */ |
12647 | ||
28010a5d PA |
12648 | static void |
12649 | dtor_catch_exception (struct breakpoint *b) | |
12650 | { | |
761269c8 | 12651 | dtor_exception (ada_catch_exception, b); |
28010a5d PA |
12652 | } |
12653 | ||
12654 | static struct bp_location * | |
12655 | allocate_location_catch_exception (struct breakpoint *self) | |
12656 | { | |
761269c8 | 12657 | return allocate_location_exception (ada_catch_exception, self); |
28010a5d PA |
12658 | } |
12659 | ||
12660 | static void | |
12661 | re_set_catch_exception (struct breakpoint *b) | |
12662 | { | |
761269c8 | 12663 | re_set_exception (ada_catch_exception, b); |
28010a5d PA |
12664 | } |
12665 | ||
12666 | static void | |
12667 | check_status_catch_exception (bpstat bs) | |
12668 | { | |
761269c8 | 12669 | check_status_exception (ada_catch_exception, bs); |
28010a5d PA |
12670 | } |
12671 | ||
f7f9143b | 12672 | static enum print_stop_action |
348d480f | 12673 | print_it_catch_exception (bpstat bs) |
f7f9143b | 12674 | { |
761269c8 | 12675 | return print_it_exception (ada_catch_exception, bs); |
f7f9143b JB |
12676 | } |
12677 | ||
12678 | static void | |
a6d9a66e | 12679 | print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12680 | { |
761269c8 | 12681 | print_one_exception (ada_catch_exception, b, last_loc); |
f7f9143b JB |
12682 | } |
12683 | ||
12684 | static void | |
12685 | print_mention_catch_exception (struct breakpoint *b) | |
12686 | { | |
761269c8 | 12687 | print_mention_exception (ada_catch_exception, b); |
f7f9143b JB |
12688 | } |
12689 | ||
6149aea9 PA |
12690 | static void |
12691 | print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp) | |
12692 | { | |
761269c8 | 12693 | print_recreate_exception (ada_catch_exception, b, fp); |
6149aea9 PA |
12694 | } |
12695 | ||
2060206e | 12696 | static struct breakpoint_ops catch_exception_breakpoint_ops; |
f7f9143b JB |
12697 | |
12698 | /* Virtual table for "catch exception unhandled" breakpoints. */ | |
12699 | ||
28010a5d PA |
12700 | static void |
12701 | dtor_catch_exception_unhandled (struct breakpoint *b) | |
12702 | { | |
761269c8 | 12703 | dtor_exception (ada_catch_exception_unhandled, b); |
28010a5d PA |
12704 | } |
12705 | ||
12706 | static struct bp_location * | |
12707 | allocate_location_catch_exception_unhandled (struct breakpoint *self) | |
12708 | { | |
761269c8 | 12709 | return allocate_location_exception (ada_catch_exception_unhandled, self); |
28010a5d PA |
12710 | } |
12711 | ||
12712 | static void | |
12713 | re_set_catch_exception_unhandled (struct breakpoint *b) | |
12714 | { | |
761269c8 | 12715 | re_set_exception (ada_catch_exception_unhandled, b); |
28010a5d PA |
12716 | } |
12717 | ||
12718 | static void | |
12719 | check_status_catch_exception_unhandled (bpstat bs) | |
12720 | { | |
761269c8 | 12721 | check_status_exception (ada_catch_exception_unhandled, bs); |
28010a5d PA |
12722 | } |
12723 | ||
f7f9143b | 12724 | static enum print_stop_action |
348d480f | 12725 | print_it_catch_exception_unhandled (bpstat bs) |
f7f9143b | 12726 | { |
761269c8 | 12727 | return print_it_exception (ada_catch_exception_unhandled, bs); |
f7f9143b JB |
12728 | } |
12729 | ||
12730 | static void | |
a6d9a66e UW |
12731 | print_one_catch_exception_unhandled (struct breakpoint *b, |
12732 | struct bp_location **last_loc) | |
f7f9143b | 12733 | { |
761269c8 | 12734 | print_one_exception (ada_catch_exception_unhandled, b, last_loc); |
f7f9143b JB |
12735 | } |
12736 | ||
12737 | static void | |
12738 | print_mention_catch_exception_unhandled (struct breakpoint *b) | |
12739 | { | |
761269c8 | 12740 | print_mention_exception (ada_catch_exception_unhandled, b); |
f7f9143b JB |
12741 | } |
12742 | ||
6149aea9 PA |
12743 | static void |
12744 | print_recreate_catch_exception_unhandled (struct breakpoint *b, | |
12745 | struct ui_file *fp) | |
12746 | { | |
761269c8 | 12747 | print_recreate_exception (ada_catch_exception_unhandled, b, fp); |
6149aea9 PA |
12748 | } |
12749 | ||
2060206e | 12750 | static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops; |
f7f9143b JB |
12751 | |
12752 | /* Virtual table for "catch assert" breakpoints. */ | |
12753 | ||
28010a5d PA |
12754 | static void |
12755 | dtor_catch_assert (struct breakpoint *b) | |
12756 | { | |
761269c8 | 12757 | dtor_exception (ada_catch_assert, b); |
28010a5d PA |
12758 | } |
12759 | ||
12760 | static struct bp_location * | |
12761 | allocate_location_catch_assert (struct breakpoint *self) | |
12762 | { | |
761269c8 | 12763 | return allocate_location_exception (ada_catch_assert, self); |
28010a5d PA |
12764 | } |
12765 | ||
12766 | static void | |
12767 | re_set_catch_assert (struct breakpoint *b) | |
12768 | { | |
761269c8 | 12769 | re_set_exception (ada_catch_assert, b); |
28010a5d PA |
12770 | } |
12771 | ||
12772 | static void | |
12773 | check_status_catch_assert (bpstat bs) | |
12774 | { | |
761269c8 | 12775 | check_status_exception (ada_catch_assert, bs); |
28010a5d PA |
12776 | } |
12777 | ||
f7f9143b | 12778 | static enum print_stop_action |
348d480f | 12779 | print_it_catch_assert (bpstat bs) |
f7f9143b | 12780 | { |
761269c8 | 12781 | return print_it_exception (ada_catch_assert, bs); |
f7f9143b JB |
12782 | } |
12783 | ||
12784 | static void | |
a6d9a66e | 12785 | print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12786 | { |
761269c8 | 12787 | print_one_exception (ada_catch_assert, b, last_loc); |
f7f9143b JB |
12788 | } |
12789 | ||
12790 | static void | |
12791 | print_mention_catch_assert (struct breakpoint *b) | |
12792 | { | |
761269c8 | 12793 | print_mention_exception (ada_catch_assert, b); |
f7f9143b JB |
12794 | } |
12795 | ||
6149aea9 PA |
12796 | static void |
12797 | print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp) | |
12798 | { | |
761269c8 | 12799 | print_recreate_exception (ada_catch_assert, b, fp); |
6149aea9 PA |
12800 | } |
12801 | ||
2060206e | 12802 | static struct breakpoint_ops catch_assert_breakpoint_ops; |
f7f9143b | 12803 | |
f7f9143b JB |
12804 | /* Return a newly allocated copy of the first space-separated token |
12805 | in ARGSP, and then adjust ARGSP to point immediately after that | |
12806 | token. | |
12807 | ||
12808 | Return NULL if ARGPS does not contain any more tokens. */ | |
12809 | ||
12810 | static char * | |
12811 | ada_get_next_arg (char **argsp) | |
12812 | { | |
12813 | char *args = *argsp; | |
12814 | char *end; | |
12815 | char *result; | |
12816 | ||
0fcd72ba | 12817 | args = skip_spaces (args); |
f7f9143b JB |
12818 | if (args[0] == '\0') |
12819 | return NULL; /* No more arguments. */ | |
12820 | ||
12821 | /* Find the end of the current argument. */ | |
12822 | ||
0fcd72ba | 12823 | end = skip_to_space (args); |
f7f9143b JB |
12824 | |
12825 | /* Adjust ARGSP to point to the start of the next argument. */ | |
12826 | ||
12827 | *argsp = end; | |
12828 | ||
12829 | /* Make a copy of the current argument and return it. */ | |
12830 | ||
224c3ddb | 12831 | result = (char *) xmalloc (end - args + 1); |
f7f9143b JB |
12832 | strncpy (result, args, end - args); |
12833 | result[end - args] = '\0'; | |
12834 | ||
12835 | return result; | |
12836 | } | |
12837 | ||
12838 | /* Split the arguments specified in a "catch exception" command. | |
12839 | Set EX to the appropriate catchpoint type. | |
28010a5d | 12840 | Set EXCEP_STRING to the name of the specific exception if |
5845583d JB |
12841 | specified by the user. |
12842 | If a condition is found at the end of the arguments, the condition | |
12843 | expression is stored in COND_STRING (memory must be deallocated | |
12844 | after use). Otherwise COND_STRING is set to NULL. */ | |
f7f9143b JB |
12845 | |
12846 | static void | |
12847 | catch_ada_exception_command_split (char *args, | |
761269c8 | 12848 | enum ada_exception_catchpoint_kind *ex, |
5845583d JB |
12849 | char **excep_string, |
12850 | char **cond_string) | |
f7f9143b JB |
12851 | { |
12852 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); | |
12853 | char *exception_name; | |
5845583d | 12854 | char *cond = NULL; |
f7f9143b JB |
12855 | |
12856 | exception_name = ada_get_next_arg (&args); | |
5845583d JB |
12857 | if (exception_name != NULL && strcmp (exception_name, "if") == 0) |
12858 | { | |
12859 | /* This is not an exception name; this is the start of a condition | |
12860 | expression for a catchpoint on all exceptions. So, "un-get" | |
12861 | this token, and set exception_name to NULL. */ | |
12862 | xfree (exception_name); | |
12863 | exception_name = NULL; | |
12864 | args -= 2; | |
12865 | } | |
f7f9143b JB |
12866 | make_cleanup (xfree, exception_name); |
12867 | ||
5845583d | 12868 | /* Check to see if we have a condition. */ |
f7f9143b | 12869 | |
0fcd72ba | 12870 | args = skip_spaces (args); |
61012eef | 12871 | if (startswith (args, "if") |
5845583d JB |
12872 | && (isspace (args[2]) || args[2] == '\0')) |
12873 | { | |
12874 | args += 2; | |
12875 | args = skip_spaces (args); | |
12876 | ||
12877 | if (args[0] == '\0') | |
12878 | error (_("Condition missing after `if' keyword")); | |
12879 | cond = xstrdup (args); | |
12880 | make_cleanup (xfree, cond); | |
12881 | ||
12882 | args += strlen (args); | |
12883 | } | |
12884 | ||
12885 | /* Check that we do not have any more arguments. Anything else | |
12886 | is unexpected. */ | |
f7f9143b JB |
12887 | |
12888 | if (args[0] != '\0') | |
12889 | error (_("Junk at end of expression")); | |
12890 | ||
12891 | discard_cleanups (old_chain); | |
12892 | ||
12893 | if (exception_name == NULL) | |
12894 | { | |
12895 | /* Catch all exceptions. */ | |
761269c8 | 12896 | *ex = ada_catch_exception; |
28010a5d | 12897 | *excep_string = NULL; |
f7f9143b JB |
12898 | } |
12899 | else if (strcmp (exception_name, "unhandled") == 0) | |
12900 | { | |
12901 | /* Catch unhandled exceptions. */ | |
761269c8 | 12902 | *ex = ada_catch_exception_unhandled; |
28010a5d | 12903 | *excep_string = NULL; |
f7f9143b JB |
12904 | } |
12905 | else | |
12906 | { | |
12907 | /* Catch a specific exception. */ | |
761269c8 | 12908 | *ex = ada_catch_exception; |
28010a5d | 12909 | *excep_string = exception_name; |
f7f9143b | 12910 | } |
5845583d | 12911 | *cond_string = cond; |
f7f9143b JB |
12912 | } |
12913 | ||
12914 | /* Return the name of the symbol on which we should break in order to | |
12915 | implement a catchpoint of the EX kind. */ | |
12916 | ||
12917 | static const char * | |
761269c8 | 12918 | ada_exception_sym_name (enum ada_exception_catchpoint_kind ex) |
f7f9143b | 12919 | { |
3eecfa55 JB |
12920 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
12921 | ||
12922 | gdb_assert (data->exception_info != NULL); | |
0259addd | 12923 | |
f7f9143b JB |
12924 | switch (ex) |
12925 | { | |
761269c8 | 12926 | case ada_catch_exception: |
3eecfa55 | 12927 | return (data->exception_info->catch_exception_sym); |
f7f9143b | 12928 | break; |
761269c8 | 12929 | case ada_catch_exception_unhandled: |
3eecfa55 | 12930 | return (data->exception_info->catch_exception_unhandled_sym); |
f7f9143b | 12931 | break; |
761269c8 | 12932 | case ada_catch_assert: |
3eecfa55 | 12933 | return (data->exception_info->catch_assert_sym); |
f7f9143b JB |
12934 | break; |
12935 | default: | |
12936 | internal_error (__FILE__, __LINE__, | |
12937 | _("unexpected catchpoint kind (%d)"), ex); | |
12938 | } | |
12939 | } | |
12940 | ||
12941 | /* Return the breakpoint ops "virtual table" used for catchpoints | |
12942 | of the EX kind. */ | |
12943 | ||
c0a91b2b | 12944 | static const struct breakpoint_ops * |
761269c8 | 12945 | ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex) |
f7f9143b JB |
12946 | { |
12947 | switch (ex) | |
12948 | { | |
761269c8 | 12949 | case ada_catch_exception: |
f7f9143b JB |
12950 | return (&catch_exception_breakpoint_ops); |
12951 | break; | |
761269c8 | 12952 | case ada_catch_exception_unhandled: |
f7f9143b JB |
12953 | return (&catch_exception_unhandled_breakpoint_ops); |
12954 | break; | |
761269c8 | 12955 | case ada_catch_assert: |
f7f9143b JB |
12956 | return (&catch_assert_breakpoint_ops); |
12957 | break; | |
12958 | default: | |
12959 | internal_error (__FILE__, __LINE__, | |
12960 | _("unexpected catchpoint kind (%d)"), ex); | |
12961 | } | |
12962 | } | |
12963 | ||
12964 | /* Return the condition that will be used to match the current exception | |
12965 | being raised with the exception that the user wants to catch. This | |
12966 | assumes that this condition is used when the inferior just triggered | |
12967 | an exception catchpoint. | |
12968 | ||
12969 | The string returned is a newly allocated string that needs to be | |
12970 | deallocated later. */ | |
12971 | ||
12972 | static char * | |
28010a5d | 12973 | ada_exception_catchpoint_cond_string (const char *excep_string) |
f7f9143b | 12974 | { |
3d0b0fa3 JB |
12975 | int i; |
12976 | ||
0963b4bd | 12977 | /* The standard exceptions are a special case. They are defined in |
3d0b0fa3 | 12978 | runtime units that have been compiled without debugging info; if |
28010a5d | 12979 | EXCEP_STRING is the not-fully-qualified name of a standard |
3d0b0fa3 JB |
12980 | exception (e.g. "constraint_error") then, during the evaluation |
12981 | of the condition expression, the symbol lookup on this name would | |
0963b4bd | 12982 | *not* return this standard exception. The catchpoint condition |
3d0b0fa3 JB |
12983 | may then be set only on user-defined exceptions which have the |
12984 | same not-fully-qualified name (e.g. my_package.constraint_error). | |
12985 | ||
12986 | To avoid this unexcepted behavior, these standard exceptions are | |
0963b4bd | 12987 | systematically prefixed by "standard". This means that "catch |
3d0b0fa3 JB |
12988 | exception constraint_error" is rewritten into "catch exception |
12989 | standard.constraint_error". | |
12990 | ||
12991 | If an exception named contraint_error is defined in another package of | |
12992 | the inferior program, then the only way to specify this exception as a | |
12993 | breakpoint condition is to use its fully-qualified named: | |
12994 | e.g. my_package.constraint_error. */ | |
12995 | ||
12996 | for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++) | |
12997 | { | |
28010a5d | 12998 | if (strcmp (standard_exc [i], excep_string) == 0) |
3d0b0fa3 JB |
12999 | { |
13000 | return xstrprintf ("long_integer (e) = long_integer (&standard.%s)", | |
28010a5d | 13001 | excep_string); |
3d0b0fa3 JB |
13002 | } |
13003 | } | |
28010a5d | 13004 | return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string); |
f7f9143b JB |
13005 | } |
13006 | ||
13007 | /* Return the symtab_and_line that should be used to insert an exception | |
13008 | catchpoint of the TYPE kind. | |
13009 | ||
28010a5d PA |
13010 | EXCEP_STRING should contain the name of a specific exception that |
13011 | the catchpoint should catch, or NULL otherwise. | |
f7f9143b | 13012 | |
28010a5d PA |
13013 | ADDR_STRING returns the name of the function where the real |
13014 | breakpoint that implements the catchpoints is set, depending on the | |
13015 | type of catchpoint we need to create. */ | |
f7f9143b JB |
13016 | |
13017 | static struct symtab_and_line | |
761269c8 | 13018 | ada_exception_sal (enum ada_exception_catchpoint_kind ex, char *excep_string, |
c0a91b2b | 13019 | char **addr_string, const struct breakpoint_ops **ops) |
f7f9143b JB |
13020 | { |
13021 | const char *sym_name; | |
13022 | struct symbol *sym; | |
f7f9143b | 13023 | |
0259addd JB |
13024 | /* First, find out which exception support info to use. */ |
13025 | ada_exception_support_info_sniffer (); | |
13026 | ||
13027 | /* Then lookup the function on which we will break in order to catch | |
f7f9143b | 13028 | the Ada exceptions requested by the user. */ |
f7f9143b JB |
13029 | sym_name = ada_exception_sym_name (ex); |
13030 | sym = standard_lookup (sym_name, NULL, VAR_DOMAIN); | |
13031 | ||
f17011e0 JB |
13032 | /* We can assume that SYM is not NULL at this stage. If the symbol |
13033 | did not exist, ada_exception_support_info_sniffer would have | |
13034 | raised an exception. | |
f7f9143b | 13035 | |
f17011e0 JB |
13036 | Also, ada_exception_support_info_sniffer should have already |
13037 | verified that SYM is a function symbol. */ | |
13038 | gdb_assert (sym != NULL); | |
13039 | gdb_assert (SYMBOL_CLASS (sym) == LOC_BLOCK); | |
f7f9143b JB |
13040 | |
13041 | /* Set ADDR_STRING. */ | |
f7f9143b JB |
13042 | *addr_string = xstrdup (sym_name); |
13043 | ||
f7f9143b | 13044 | /* Set OPS. */ |
4b9eee8c | 13045 | *ops = ada_exception_breakpoint_ops (ex); |
f7f9143b | 13046 | |
f17011e0 | 13047 | return find_function_start_sal (sym, 1); |
f7f9143b JB |
13048 | } |
13049 | ||
b4a5b78b | 13050 | /* Create an Ada exception catchpoint. |
f7f9143b | 13051 | |
b4a5b78b | 13052 | EX_KIND is the kind of exception catchpoint to be created. |
5845583d | 13053 | |
2df4d1d5 JB |
13054 | If EXCEPT_STRING is NULL, this catchpoint is expected to trigger |
13055 | for all exceptions. Otherwise, EXCEPT_STRING indicates the name | |
13056 | of the exception to which this catchpoint applies. When not NULL, | |
13057 | the string must be allocated on the heap, and its deallocation | |
13058 | is no longer the responsibility of the caller. | |
13059 | ||
13060 | COND_STRING, if not NULL, is the catchpoint condition. This string | |
13061 | must be allocated on the heap, and its deallocation is no longer | |
13062 | the responsibility of the caller. | |
f7f9143b | 13063 | |
b4a5b78b JB |
13064 | TEMPFLAG, if nonzero, means that the underlying breakpoint |
13065 | should be temporary. | |
28010a5d | 13066 | |
b4a5b78b | 13067 | FROM_TTY is the usual argument passed to all commands implementations. */ |
28010a5d | 13068 | |
349774ef | 13069 | void |
28010a5d | 13070 | create_ada_exception_catchpoint (struct gdbarch *gdbarch, |
761269c8 | 13071 | enum ada_exception_catchpoint_kind ex_kind, |
28010a5d | 13072 | char *excep_string, |
5845583d | 13073 | char *cond_string, |
28010a5d | 13074 | int tempflag, |
349774ef | 13075 | int disabled, |
28010a5d PA |
13076 | int from_tty) |
13077 | { | |
13078 | struct ada_catchpoint *c; | |
b4a5b78b JB |
13079 | char *addr_string = NULL; |
13080 | const struct breakpoint_ops *ops = NULL; | |
13081 | struct symtab_and_line sal | |
13082 | = ada_exception_sal (ex_kind, excep_string, &addr_string, &ops); | |
28010a5d PA |
13083 | |
13084 | c = XNEW (struct ada_catchpoint); | |
13085 | init_ada_exception_breakpoint (&c->base, gdbarch, sal, addr_string, | |
349774ef | 13086 | ops, tempflag, disabled, from_tty); |
28010a5d PA |
13087 | c->excep_string = excep_string; |
13088 | create_excep_cond_exprs (c); | |
5845583d JB |
13089 | if (cond_string != NULL) |
13090 | set_breakpoint_condition (&c->base, cond_string, from_tty); | |
3ea46bff | 13091 | install_breakpoint (0, &c->base, 1); |
f7f9143b JB |
13092 | } |
13093 | ||
9ac4176b PA |
13094 | /* Implement the "catch exception" command. */ |
13095 | ||
13096 | static void | |
13097 | catch_ada_exception_command (char *arg, int from_tty, | |
13098 | struct cmd_list_element *command) | |
13099 | { | |
13100 | struct gdbarch *gdbarch = get_current_arch (); | |
13101 | int tempflag; | |
761269c8 | 13102 | enum ada_exception_catchpoint_kind ex_kind; |
28010a5d | 13103 | char *excep_string = NULL; |
5845583d | 13104 | char *cond_string = NULL; |
9ac4176b PA |
13105 | |
13106 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
13107 | ||
13108 | if (!arg) | |
13109 | arg = ""; | |
b4a5b78b JB |
13110 | catch_ada_exception_command_split (arg, &ex_kind, &excep_string, |
13111 | &cond_string); | |
13112 | create_ada_exception_catchpoint (gdbarch, ex_kind, | |
13113 | excep_string, cond_string, | |
349774ef JB |
13114 | tempflag, 1 /* enabled */, |
13115 | from_tty); | |
9ac4176b PA |
13116 | } |
13117 | ||
b4a5b78b | 13118 | /* Split the arguments specified in a "catch assert" command. |
5845583d | 13119 | |
b4a5b78b JB |
13120 | ARGS contains the command's arguments (or the empty string if |
13121 | no arguments were passed). | |
5845583d JB |
13122 | |
13123 | If ARGS contains a condition, set COND_STRING to that condition | |
b4a5b78b | 13124 | (the memory needs to be deallocated after use). */ |
5845583d | 13125 | |
b4a5b78b JB |
13126 | static void |
13127 | catch_ada_assert_command_split (char *args, char **cond_string) | |
f7f9143b | 13128 | { |
5845583d | 13129 | args = skip_spaces (args); |
f7f9143b | 13130 | |
5845583d | 13131 | /* Check whether a condition was provided. */ |
61012eef | 13132 | if (startswith (args, "if") |
5845583d | 13133 | && (isspace (args[2]) || args[2] == '\0')) |
f7f9143b | 13134 | { |
5845583d | 13135 | args += 2; |
0fcd72ba | 13136 | args = skip_spaces (args); |
5845583d JB |
13137 | if (args[0] == '\0') |
13138 | error (_("condition missing after `if' keyword")); | |
13139 | *cond_string = xstrdup (args); | |
f7f9143b JB |
13140 | } |
13141 | ||
5845583d JB |
13142 | /* Otherwise, there should be no other argument at the end of |
13143 | the command. */ | |
13144 | else if (args[0] != '\0') | |
13145 | error (_("Junk at end of arguments.")); | |
f7f9143b JB |
13146 | } |
13147 | ||
9ac4176b PA |
13148 | /* Implement the "catch assert" command. */ |
13149 | ||
13150 | static void | |
13151 | catch_assert_command (char *arg, int from_tty, | |
13152 | struct cmd_list_element *command) | |
13153 | { | |
13154 | struct gdbarch *gdbarch = get_current_arch (); | |
13155 | int tempflag; | |
5845583d | 13156 | char *cond_string = NULL; |
9ac4176b PA |
13157 | |
13158 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
13159 | ||
13160 | if (!arg) | |
13161 | arg = ""; | |
b4a5b78b | 13162 | catch_ada_assert_command_split (arg, &cond_string); |
761269c8 | 13163 | create_ada_exception_catchpoint (gdbarch, ada_catch_assert, |
b4a5b78b | 13164 | NULL, cond_string, |
349774ef JB |
13165 | tempflag, 1 /* enabled */, |
13166 | from_tty); | |
9ac4176b | 13167 | } |
778865d3 JB |
13168 | |
13169 | /* Return non-zero if the symbol SYM is an Ada exception object. */ | |
13170 | ||
13171 | static int | |
13172 | ada_is_exception_sym (struct symbol *sym) | |
13173 | { | |
13174 | const char *type_name = type_name_no_tag (SYMBOL_TYPE (sym)); | |
13175 | ||
13176 | return (SYMBOL_CLASS (sym) != LOC_TYPEDEF | |
13177 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
13178 | && SYMBOL_CLASS (sym) != LOC_CONST | |
13179 | && SYMBOL_CLASS (sym) != LOC_UNRESOLVED | |
13180 | && type_name != NULL && strcmp (type_name, "exception") == 0); | |
13181 | } | |
13182 | ||
13183 | /* Given a global symbol SYM, return non-zero iff SYM is a non-standard | |
13184 | Ada exception object. This matches all exceptions except the ones | |
13185 | defined by the Ada language. */ | |
13186 | ||
13187 | static int | |
13188 | ada_is_non_standard_exception_sym (struct symbol *sym) | |
13189 | { | |
13190 | int i; | |
13191 | ||
13192 | if (!ada_is_exception_sym (sym)) | |
13193 | return 0; | |
13194 | ||
13195 | for (i = 0; i < ARRAY_SIZE (standard_exc); i++) | |
13196 | if (strcmp (SYMBOL_LINKAGE_NAME (sym), standard_exc[i]) == 0) | |
13197 | return 0; /* A standard exception. */ | |
13198 | ||
13199 | /* Numeric_Error is also a standard exception, so exclude it. | |
13200 | See the STANDARD_EXC description for more details as to why | |
13201 | this exception is not listed in that array. */ | |
13202 | if (strcmp (SYMBOL_LINKAGE_NAME (sym), "numeric_error") == 0) | |
13203 | return 0; | |
13204 | ||
13205 | return 1; | |
13206 | } | |
13207 | ||
13208 | /* A helper function for qsort, comparing two struct ada_exc_info | |
13209 | objects. | |
13210 | ||
13211 | The comparison is determined first by exception name, and then | |
13212 | by exception address. */ | |
13213 | ||
13214 | static int | |
13215 | compare_ada_exception_info (const void *a, const void *b) | |
13216 | { | |
13217 | const struct ada_exc_info *exc_a = (struct ada_exc_info *) a; | |
13218 | const struct ada_exc_info *exc_b = (struct ada_exc_info *) b; | |
13219 | int result; | |
13220 | ||
13221 | result = strcmp (exc_a->name, exc_b->name); | |
13222 | if (result != 0) | |
13223 | return result; | |
13224 | ||
13225 | if (exc_a->addr < exc_b->addr) | |
13226 | return -1; | |
13227 | if (exc_a->addr > exc_b->addr) | |
13228 | return 1; | |
13229 | ||
13230 | return 0; | |
13231 | } | |
13232 | ||
13233 | /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison | |
13234 | routine, but keeping the first SKIP elements untouched. | |
13235 | ||
13236 | All duplicates are also removed. */ | |
13237 | ||
13238 | static void | |
13239 | sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info) **exceptions, | |
13240 | int skip) | |
13241 | { | |
13242 | struct ada_exc_info *to_sort | |
13243 | = VEC_address (ada_exc_info, *exceptions) + skip; | |
13244 | int to_sort_len | |
13245 | = VEC_length (ada_exc_info, *exceptions) - skip; | |
13246 | int i, j; | |
13247 | ||
13248 | qsort (to_sort, to_sort_len, sizeof (struct ada_exc_info), | |
13249 | compare_ada_exception_info); | |
13250 | ||
13251 | for (i = 1, j = 1; i < to_sort_len; i++) | |
13252 | if (compare_ada_exception_info (&to_sort[i], &to_sort[j - 1]) != 0) | |
13253 | to_sort[j++] = to_sort[i]; | |
13254 | to_sort_len = j; | |
13255 | VEC_truncate(ada_exc_info, *exceptions, skip + to_sort_len); | |
13256 | } | |
13257 | ||
13258 | /* A function intended as the "name_matcher" callback in the struct | |
13259 | quick_symbol_functions' expand_symtabs_matching method. | |
13260 | ||
13261 | SEARCH_NAME is the symbol's search name. | |
13262 | ||
13263 | If USER_DATA is not NULL, it is a pointer to a regext_t object | |
13264 | used to match the symbol (by natural name). Otherwise, when USER_DATA | |
13265 | is null, no filtering is performed, and all symbols are a positive | |
13266 | match. */ | |
13267 | ||
13268 | static int | |
13269 | ada_exc_search_name_matches (const char *search_name, void *user_data) | |
13270 | { | |
9a3c8263 | 13271 | regex_t *preg = (regex_t *) user_data; |
778865d3 JB |
13272 | |
13273 | if (preg == NULL) | |
13274 | return 1; | |
13275 | ||
13276 | /* In Ada, the symbol "search name" is a linkage name, whereas | |
13277 | the regular expression used to do the matching refers to | |
13278 | the natural name. So match against the decoded name. */ | |
13279 | return (regexec (preg, ada_decode (search_name), 0, NULL, 0) == 0); | |
13280 | } | |
13281 | ||
13282 | /* Add all exceptions defined by the Ada standard whose name match | |
13283 | a regular expression. | |
13284 | ||
13285 | If PREG is not NULL, then this regexp_t object is used to | |
13286 | perform the symbol name matching. Otherwise, no name-based | |
13287 | filtering is performed. | |
13288 | ||
13289 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13290 | gets pushed. */ | |
13291 | ||
13292 | static void | |
13293 | ada_add_standard_exceptions (regex_t *preg, VEC(ada_exc_info) **exceptions) | |
13294 | { | |
13295 | int i; | |
13296 | ||
13297 | for (i = 0; i < ARRAY_SIZE (standard_exc); i++) | |
13298 | { | |
13299 | if (preg == NULL | |
13300 | || regexec (preg, standard_exc[i], 0, NULL, 0) == 0) | |
13301 | { | |
13302 | struct bound_minimal_symbol msymbol | |
13303 | = ada_lookup_simple_minsym (standard_exc[i]); | |
13304 | ||
13305 | if (msymbol.minsym != NULL) | |
13306 | { | |
13307 | struct ada_exc_info info | |
77e371c0 | 13308 | = {standard_exc[i], BMSYMBOL_VALUE_ADDRESS (msymbol)}; |
778865d3 JB |
13309 | |
13310 | VEC_safe_push (ada_exc_info, *exceptions, &info); | |
13311 | } | |
13312 | } | |
13313 | } | |
13314 | } | |
13315 | ||
13316 | /* Add all Ada exceptions defined locally and accessible from the given | |
13317 | FRAME. | |
13318 | ||
13319 | If PREG is not NULL, then this regexp_t object is used to | |
13320 | perform the symbol name matching. Otherwise, no name-based | |
13321 | filtering is performed. | |
13322 | ||
13323 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13324 | gets pushed. */ | |
13325 | ||
13326 | static void | |
13327 | ada_add_exceptions_from_frame (regex_t *preg, struct frame_info *frame, | |
13328 | VEC(ada_exc_info) **exceptions) | |
13329 | { | |
3977b71f | 13330 | const struct block *block = get_frame_block (frame, 0); |
778865d3 JB |
13331 | |
13332 | while (block != 0) | |
13333 | { | |
13334 | struct block_iterator iter; | |
13335 | struct symbol *sym; | |
13336 | ||
13337 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
13338 | { | |
13339 | switch (SYMBOL_CLASS (sym)) | |
13340 | { | |
13341 | case LOC_TYPEDEF: | |
13342 | case LOC_BLOCK: | |
13343 | case LOC_CONST: | |
13344 | break; | |
13345 | default: | |
13346 | if (ada_is_exception_sym (sym)) | |
13347 | { | |
13348 | struct ada_exc_info info = {SYMBOL_PRINT_NAME (sym), | |
13349 | SYMBOL_VALUE_ADDRESS (sym)}; | |
13350 | ||
13351 | VEC_safe_push (ada_exc_info, *exceptions, &info); | |
13352 | } | |
13353 | } | |
13354 | } | |
13355 | if (BLOCK_FUNCTION (block) != NULL) | |
13356 | break; | |
13357 | block = BLOCK_SUPERBLOCK (block); | |
13358 | } | |
13359 | } | |
13360 | ||
13361 | /* Add all exceptions defined globally whose name name match | |
13362 | a regular expression, excluding standard exceptions. | |
13363 | ||
13364 | The reason we exclude standard exceptions is that they need | |
13365 | to be handled separately: Standard exceptions are defined inside | |
13366 | a runtime unit which is normally not compiled with debugging info, | |
13367 | and thus usually do not show up in our symbol search. However, | |
13368 | if the unit was in fact built with debugging info, we need to | |
13369 | exclude them because they would duplicate the entry we found | |
13370 | during the special loop that specifically searches for those | |
13371 | standard exceptions. | |
13372 | ||
13373 | If PREG is not NULL, then this regexp_t object is used to | |
13374 | perform the symbol name matching. Otherwise, no name-based | |
13375 | filtering is performed. | |
13376 | ||
13377 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13378 | gets pushed. */ | |
13379 | ||
13380 | static void | |
13381 | ada_add_global_exceptions (regex_t *preg, VEC(ada_exc_info) **exceptions) | |
13382 | { | |
13383 | struct objfile *objfile; | |
43f3e411 | 13384 | struct compunit_symtab *s; |
778865d3 | 13385 | |
276d885b | 13386 | expand_symtabs_matching (NULL, ada_exc_search_name_matches, NULL, |
bb4142cf | 13387 | VARIABLES_DOMAIN, preg); |
778865d3 | 13388 | |
43f3e411 | 13389 | ALL_COMPUNITS (objfile, s) |
778865d3 | 13390 | { |
43f3e411 | 13391 | const struct blockvector *bv = COMPUNIT_BLOCKVECTOR (s); |
778865d3 JB |
13392 | int i; |
13393 | ||
13394 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) | |
13395 | { | |
13396 | struct block *b = BLOCKVECTOR_BLOCK (bv, i); | |
13397 | struct block_iterator iter; | |
13398 | struct symbol *sym; | |
13399 | ||
13400 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
13401 | if (ada_is_non_standard_exception_sym (sym) | |
13402 | && (preg == NULL | |
13403 | || regexec (preg, SYMBOL_NATURAL_NAME (sym), | |
13404 | 0, NULL, 0) == 0)) | |
13405 | { | |
13406 | struct ada_exc_info info | |
13407 | = {SYMBOL_PRINT_NAME (sym), SYMBOL_VALUE_ADDRESS (sym)}; | |
13408 | ||
13409 | VEC_safe_push (ada_exc_info, *exceptions, &info); | |
13410 | } | |
13411 | } | |
13412 | } | |
13413 | } | |
13414 | ||
13415 | /* Implements ada_exceptions_list with the regular expression passed | |
13416 | as a regex_t, rather than a string. | |
13417 | ||
13418 | If not NULL, PREG is used to filter out exceptions whose names | |
13419 | do not match. Otherwise, all exceptions are listed. */ | |
13420 | ||
13421 | static VEC(ada_exc_info) * | |
13422 | ada_exceptions_list_1 (regex_t *preg) | |
13423 | { | |
13424 | VEC(ada_exc_info) *result = NULL; | |
13425 | struct cleanup *old_chain | |
13426 | = make_cleanup (VEC_cleanup (ada_exc_info), &result); | |
13427 | int prev_len; | |
13428 | ||
13429 | /* First, list the known standard exceptions. These exceptions | |
13430 | need to be handled separately, as they are usually defined in | |
13431 | runtime units that have been compiled without debugging info. */ | |
13432 | ||
13433 | ada_add_standard_exceptions (preg, &result); | |
13434 | ||
13435 | /* Next, find all exceptions whose scope is local and accessible | |
13436 | from the currently selected frame. */ | |
13437 | ||
13438 | if (has_stack_frames ()) | |
13439 | { | |
13440 | prev_len = VEC_length (ada_exc_info, result); | |
13441 | ada_add_exceptions_from_frame (preg, get_selected_frame (NULL), | |
13442 | &result); | |
13443 | if (VEC_length (ada_exc_info, result) > prev_len) | |
13444 | sort_remove_dups_ada_exceptions_list (&result, prev_len); | |
13445 | } | |
13446 | ||
13447 | /* Add all exceptions whose scope is global. */ | |
13448 | ||
13449 | prev_len = VEC_length (ada_exc_info, result); | |
13450 | ada_add_global_exceptions (preg, &result); | |
13451 | if (VEC_length (ada_exc_info, result) > prev_len) | |
13452 | sort_remove_dups_ada_exceptions_list (&result, prev_len); | |
13453 | ||
13454 | discard_cleanups (old_chain); | |
13455 | return result; | |
13456 | } | |
13457 | ||
13458 | /* Return a vector of ada_exc_info. | |
13459 | ||
13460 | If REGEXP is NULL, all exceptions are included in the result. | |
13461 | Otherwise, it should contain a valid regular expression, | |
13462 | and only the exceptions whose names match that regular expression | |
13463 | are included in the result. | |
13464 | ||
13465 | The exceptions are sorted in the following order: | |
13466 | - Standard exceptions (defined by the Ada language), in | |
13467 | alphabetical order; | |
13468 | - Exceptions only visible from the current frame, in | |
13469 | alphabetical order; | |
13470 | - Exceptions whose scope is global, in alphabetical order. */ | |
13471 | ||
13472 | VEC(ada_exc_info) * | |
13473 | ada_exceptions_list (const char *regexp) | |
13474 | { | |
13475 | VEC(ada_exc_info) *result = NULL; | |
13476 | struct cleanup *old_chain = NULL; | |
13477 | regex_t reg; | |
13478 | ||
13479 | if (regexp != NULL) | |
13480 | old_chain = compile_rx_or_error (®, regexp, | |
13481 | _("invalid regular expression")); | |
13482 | ||
13483 | result = ada_exceptions_list_1 (regexp != NULL ? ® : NULL); | |
13484 | ||
13485 | if (old_chain != NULL) | |
13486 | do_cleanups (old_chain); | |
13487 | return result; | |
13488 | } | |
13489 | ||
13490 | /* Implement the "info exceptions" command. */ | |
13491 | ||
13492 | static void | |
13493 | info_exceptions_command (char *regexp, int from_tty) | |
13494 | { | |
13495 | VEC(ada_exc_info) *exceptions; | |
13496 | struct cleanup *cleanup; | |
13497 | struct gdbarch *gdbarch = get_current_arch (); | |
13498 | int ix; | |
13499 | struct ada_exc_info *info; | |
13500 | ||
13501 | exceptions = ada_exceptions_list (regexp); | |
13502 | cleanup = make_cleanup (VEC_cleanup (ada_exc_info), &exceptions); | |
13503 | ||
13504 | if (regexp != NULL) | |
13505 | printf_filtered | |
13506 | (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp); | |
13507 | else | |
13508 | printf_filtered (_("All defined Ada exceptions:\n")); | |
13509 | ||
13510 | for (ix = 0; VEC_iterate(ada_exc_info, exceptions, ix, info); ix++) | |
13511 | printf_filtered ("%s: %s\n", info->name, paddress (gdbarch, info->addr)); | |
13512 | ||
13513 | do_cleanups (cleanup); | |
13514 | } | |
13515 | ||
4c4b4cd2 PH |
13516 | /* Operators */ |
13517 | /* Information about operators given special treatment in functions | |
13518 | below. */ | |
13519 | /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */ | |
13520 | ||
13521 | #define ADA_OPERATORS \ | |
13522 | OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \ | |
13523 | OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \ | |
13524 | OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \ | |
13525 | OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \ | |
13526 | OP_DEFN (OP_ATR_LAST, 1, 2, 0) \ | |
13527 | OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \ | |
13528 | OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \ | |
13529 | OP_DEFN (OP_ATR_MAX, 1, 3, 0) \ | |
13530 | OP_DEFN (OP_ATR_MIN, 1, 3, 0) \ | |
13531 | OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \ | |
13532 | OP_DEFN (OP_ATR_POS, 1, 2, 0) \ | |
13533 | OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \ | |
13534 | OP_DEFN (OP_ATR_TAG, 1, 1, 0) \ | |
13535 | OP_DEFN (OP_ATR_VAL, 1, 2, 0) \ | |
13536 | OP_DEFN (UNOP_QUAL, 3, 1, 0) \ | |
52ce6436 PH |
13537 | OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \ |
13538 | OP_DEFN (OP_OTHERS, 1, 1, 0) \ | |
13539 | OP_DEFN (OP_POSITIONAL, 3, 1, 0) \ | |
13540 | OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0) | |
4c4b4cd2 PH |
13541 | |
13542 | static void | |
554794dc SDJ |
13543 | ada_operator_length (const struct expression *exp, int pc, int *oplenp, |
13544 | int *argsp) | |
4c4b4cd2 PH |
13545 | { |
13546 | switch (exp->elts[pc - 1].opcode) | |
13547 | { | |
76a01679 | 13548 | default: |
4c4b4cd2 PH |
13549 | operator_length_standard (exp, pc, oplenp, argsp); |
13550 | break; | |
13551 | ||
13552 | #define OP_DEFN(op, len, args, binop) \ | |
13553 | case op: *oplenp = len; *argsp = args; break; | |
13554 | ADA_OPERATORS; | |
13555 | #undef OP_DEFN | |
52ce6436 PH |
13556 | |
13557 | case OP_AGGREGATE: | |
13558 | *oplenp = 3; | |
13559 | *argsp = longest_to_int (exp->elts[pc - 2].longconst); | |
13560 | break; | |
13561 | ||
13562 | case OP_CHOICES: | |
13563 | *oplenp = 3; | |
13564 | *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1; | |
13565 | break; | |
4c4b4cd2 PH |
13566 | } |
13567 | } | |
13568 | ||
c0201579 JK |
13569 | /* Implementation of the exp_descriptor method operator_check. */ |
13570 | ||
13571 | static int | |
13572 | ada_operator_check (struct expression *exp, int pos, | |
13573 | int (*objfile_func) (struct objfile *objfile, void *data), | |
13574 | void *data) | |
13575 | { | |
13576 | const union exp_element *const elts = exp->elts; | |
13577 | struct type *type = NULL; | |
13578 | ||
13579 | switch (elts[pos].opcode) | |
13580 | { | |
13581 | case UNOP_IN_RANGE: | |
13582 | case UNOP_QUAL: | |
13583 | type = elts[pos + 1].type; | |
13584 | break; | |
13585 | ||
13586 | default: | |
13587 | return operator_check_standard (exp, pos, objfile_func, data); | |
13588 | } | |
13589 | ||
13590 | /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */ | |
13591 | ||
13592 | if (type && TYPE_OBJFILE (type) | |
13593 | && (*objfile_func) (TYPE_OBJFILE (type), data)) | |
13594 | return 1; | |
13595 | ||
13596 | return 0; | |
13597 | } | |
13598 | ||
4c4b4cd2 PH |
13599 | static char * |
13600 | ada_op_name (enum exp_opcode opcode) | |
13601 | { | |
13602 | switch (opcode) | |
13603 | { | |
76a01679 | 13604 | default: |
4c4b4cd2 | 13605 | return op_name_standard (opcode); |
52ce6436 | 13606 | |
4c4b4cd2 PH |
13607 | #define OP_DEFN(op, len, args, binop) case op: return #op; |
13608 | ADA_OPERATORS; | |
13609 | #undef OP_DEFN | |
52ce6436 PH |
13610 | |
13611 | case OP_AGGREGATE: | |
13612 | return "OP_AGGREGATE"; | |
13613 | case OP_CHOICES: | |
13614 | return "OP_CHOICES"; | |
13615 | case OP_NAME: | |
13616 | return "OP_NAME"; | |
4c4b4cd2 PH |
13617 | } |
13618 | } | |
13619 | ||
13620 | /* As for operator_length, but assumes PC is pointing at the first | |
13621 | element of the operator, and gives meaningful results only for the | |
52ce6436 | 13622 | Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */ |
4c4b4cd2 PH |
13623 | |
13624 | static void | |
76a01679 JB |
13625 | ada_forward_operator_length (struct expression *exp, int pc, |
13626 | int *oplenp, int *argsp) | |
4c4b4cd2 | 13627 | { |
76a01679 | 13628 | switch (exp->elts[pc].opcode) |
4c4b4cd2 PH |
13629 | { |
13630 | default: | |
13631 | *oplenp = *argsp = 0; | |
13632 | break; | |
52ce6436 | 13633 | |
4c4b4cd2 PH |
13634 | #define OP_DEFN(op, len, args, binop) \ |
13635 | case op: *oplenp = len; *argsp = args; break; | |
13636 | ADA_OPERATORS; | |
13637 | #undef OP_DEFN | |
52ce6436 PH |
13638 | |
13639 | case OP_AGGREGATE: | |
13640 | *oplenp = 3; | |
13641 | *argsp = longest_to_int (exp->elts[pc + 1].longconst); | |
13642 | break; | |
13643 | ||
13644 | case OP_CHOICES: | |
13645 | *oplenp = 3; | |
13646 | *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1; | |
13647 | break; | |
13648 | ||
13649 | case OP_STRING: | |
13650 | case OP_NAME: | |
13651 | { | |
13652 | int len = longest_to_int (exp->elts[pc + 1].longconst); | |
5b4ee69b | 13653 | |
52ce6436 PH |
13654 | *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1); |
13655 | *argsp = 0; | |
13656 | break; | |
13657 | } | |
4c4b4cd2 PH |
13658 | } |
13659 | } | |
13660 | ||
13661 | static int | |
13662 | ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt) | |
13663 | { | |
13664 | enum exp_opcode op = exp->elts[elt].opcode; | |
13665 | int oplen, nargs; | |
13666 | int pc = elt; | |
13667 | int i; | |
76a01679 | 13668 | |
4c4b4cd2 PH |
13669 | ada_forward_operator_length (exp, elt, &oplen, &nargs); |
13670 | ||
76a01679 | 13671 | switch (op) |
4c4b4cd2 | 13672 | { |
76a01679 | 13673 | /* Ada attributes ('Foo). */ |
4c4b4cd2 PH |
13674 | case OP_ATR_FIRST: |
13675 | case OP_ATR_LAST: | |
13676 | case OP_ATR_LENGTH: | |
13677 | case OP_ATR_IMAGE: | |
13678 | case OP_ATR_MAX: | |
13679 | case OP_ATR_MIN: | |
13680 | case OP_ATR_MODULUS: | |
13681 | case OP_ATR_POS: | |
13682 | case OP_ATR_SIZE: | |
13683 | case OP_ATR_TAG: | |
13684 | case OP_ATR_VAL: | |
13685 | break; | |
13686 | ||
13687 | case UNOP_IN_RANGE: | |
13688 | case UNOP_QUAL: | |
323e0a4a AC |
13689 | /* XXX: gdb_sprint_host_address, type_sprint */ |
13690 | fprintf_filtered (stream, _("Type @")); | |
4c4b4cd2 PH |
13691 | gdb_print_host_address (exp->elts[pc + 1].type, stream); |
13692 | fprintf_filtered (stream, " ("); | |
13693 | type_print (exp->elts[pc + 1].type, NULL, stream, 0); | |
13694 | fprintf_filtered (stream, ")"); | |
13695 | break; | |
13696 | case BINOP_IN_BOUNDS: | |
52ce6436 PH |
13697 | fprintf_filtered (stream, " (%d)", |
13698 | longest_to_int (exp->elts[pc + 2].longconst)); | |
4c4b4cd2 PH |
13699 | break; |
13700 | case TERNOP_IN_RANGE: | |
13701 | break; | |
13702 | ||
52ce6436 PH |
13703 | case OP_AGGREGATE: |
13704 | case OP_OTHERS: | |
13705 | case OP_DISCRETE_RANGE: | |
13706 | case OP_POSITIONAL: | |
13707 | case OP_CHOICES: | |
13708 | break; | |
13709 | ||
13710 | case OP_NAME: | |
13711 | case OP_STRING: | |
13712 | { | |
13713 | char *name = &exp->elts[elt + 2].string; | |
13714 | int len = longest_to_int (exp->elts[elt + 1].longconst); | |
5b4ee69b | 13715 | |
52ce6436 PH |
13716 | fprintf_filtered (stream, "Text: `%.*s'", len, name); |
13717 | break; | |
13718 | } | |
13719 | ||
4c4b4cd2 PH |
13720 | default: |
13721 | return dump_subexp_body_standard (exp, stream, elt); | |
13722 | } | |
13723 | ||
13724 | elt += oplen; | |
13725 | for (i = 0; i < nargs; i += 1) | |
13726 | elt = dump_subexp (exp, stream, elt); | |
13727 | ||
13728 | return elt; | |
13729 | } | |
13730 | ||
13731 | /* The Ada extension of print_subexp (q.v.). */ | |
13732 | ||
76a01679 JB |
13733 | static void |
13734 | ada_print_subexp (struct expression *exp, int *pos, | |
13735 | struct ui_file *stream, enum precedence prec) | |
4c4b4cd2 | 13736 | { |
52ce6436 | 13737 | int oplen, nargs, i; |
4c4b4cd2 PH |
13738 | int pc = *pos; |
13739 | enum exp_opcode op = exp->elts[pc].opcode; | |
13740 | ||
13741 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
13742 | ||
52ce6436 | 13743 | *pos += oplen; |
4c4b4cd2 PH |
13744 | switch (op) |
13745 | { | |
13746 | default: | |
52ce6436 | 13747 | *pos -= oplen; |
4c4b4cd2 PH |
13748 | print_subexp_standard (exp, pos, stream, prec); |
13749 | return; | |
13750 | ||
13751 | case OP_VAR_VALUE: | |
4c4b4cd2 PH |
13752 | fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream); |
13753 | return; | |
13754 | ||
13755 | case BINOP_IN_BOUNDS: | |
323e0a4a | 13756 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13757 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13758 | fputs_filtered (" in ", stream); |
4c4b4cd2 | 13759 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13760 | fputs_filtered ("'range", stream); |
4c4b4cd2 | 13761 | if (exp->elts[pc + 1].longconst > 1) |
76a01679 JB |
13762 | fprintf_filtered (stream, "(%ld)", |
13763 | (long) exp->elts[pc + 1].longconst); | |
4c4b4cd2 PH |
13764 | return; |
13765 | ||
13766 | case TERNOP_IN_RANGE: | |
4c4b4cd2 | 13767 | if (prec >= PREC_EQUAL) |
76a01679 | 13768 | fputs_filtered ("(", stream); |
323e0a4a | 13769 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13770 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13771 | fputs_filtered (" in ", stream); |
4c4b4cd2 PH |
13772 | print_subexp (exp, pos, stream, PREC_EQUAL); |
13773 | fputs_filtered (" .. ", stream); | |
13774 | print_subexp (exp, pos, stream, PREC_EQUAL); | |
13775 | if (prec >= PREC_EQUAL) | |
76a01679 JB |
13776 | fputs_filtered (")", stream); |
13777 | return; | |
4c4b4cd2 PH |
13778 | |
13779 | case OP_ATR_FIRST: | |
13780 | case OP_ATR_LAST: | |
13781 | case OP_ATR_LENGTH: | |
13782 | case OP_ATR_IMAGE: | |
13783 | case OP_ATR_MAX: | |
13784 | case OP_ATR_MIN: | |
13785 | case OP_ATR_MODULUS: | |
13786 | case OP_ATR_POS: | |
13787 | case OP_ATR_SIZE: | |
13788 | case OP_ATR_TAG: | |
13789 | case OP_ATR_VAL: | |
4c4b4cd2 | 13790 | if (exp->elts[*pos].opcode == OP_TYPE) |
76a01679 JB |
13791 | { |
13792 | if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID) | |
79d43c61 TT |
13793 | LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0, |
13794 | &type_print_raw_options); | |
76a01679 JB |
13795 | *pos += 3; |
13796 | } | |
4c4b4cd2 | 13797 | else |
76a01679 | 13798 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
4c4b4cd2 PH |
13799 | fprintf_filtered (stream, "'%s", ada_attribute_name (op)); |
13800 | if (nargs > 1) | |
76a01679 JB |
13801 | { |
13802 | int tem; | |
5b4ee69b | 13803 | |
76a01679 JB |
13804 | for (tem = 1; tem < nargs; tem += 1) |
13805 | { | |
13806 | fputs_filtered ((tem == 1) ? " (" : ", ", stream); | |
13807 | print_subexp (exp, pos, stream, PREC_ABOVE_COMMA); | |
13808 | } | |
13809 | fputs_filtered (")", stream); | |
13810 | } | |
4c4b4cd2 | 13811 | return; |
14f9c5c9 | 13812 | |
4c4b4cd2 | 13813 | case UNOP_QUAL: |
4c4b4cd2 PH |
13814 | type_print (exp->elts[pc + 1].type, "", stream, 0); |
13815 | fputs_filtered ("'(", stream); | |
13816 | print_subexp (exp, pos, stream, PREC_PREFIX); | |
13817 | fputs_filtered (")", stream); | |
13818 | return; | |
14f9c5c9 | 13819 | |
4c4b4cd2 | 13820 | case UNOP_IN_RANGE: |
323e0a4a | 13821 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13822 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13823 | fputs_filtered (" in ", stream); |
79d43c61 TT |
13824 | LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0, |
13825 | &type_print_raw_options); | |
4c4b4cd2 | 13826 | return; |
52ce6436 PH |
13827 | |
13828 | case OP_DISCRETE_RANGE: | |
13829 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13830 | fputs_filtered ("..", stream); | |
13831 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13832 | return; | |
13833 | ||
13834 | case OP_OTHERS: | |
13835 | fputs_filtered ("others => ", stream); | |
13836 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13837 | return; | |
13838 | ||
13839 | case OP_CHOICES: | |
13840 | for (i = 0; i < nargs-1; i += 1) | |
13841 | { | |
13842 | if (i > 0) | |
13843 | fputs_filtered ("|", stream); | |
13844 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13845 | } | |
13846 | fputs_filtered (" => ", stream); | |
13847 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13848 | return; | |
13849 | ||
13850 | case OP_POSITIONAL: | |
13851 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13852 | return; | |
13853 | ||
13854 | case OP_AGGREGATE: | |
13855 | fputs_filtered ("(", stream); | |
13856 | for (i = 0; i < nargs; i += 1) | |
13857 | { | |
13858 | if (i > 0) | |
13859 | fputs_filtered (", ", stream); | |
13860 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13861 | } | |
13862 | fputs_filtered (")", stream); | |
13863 | return; | |
4c4b4cd2 PH |
13864 | } |
13865 | } | |
14f9c5c9 AS |
13866 | |
13867 | /* Table mapping opcodes into strings for printing operators | |
13868 | and precedences of the operators. */ | |
13869 | ||
d2e4a39e AS |
13870 | static const struct op_print ada_op_print_tab[] = { |
13871 | {":=", BINOP_ASSIGN, PREC_ASSIGN, 1}, | |
13872 | {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0}, | |
13873 | {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0}, | |
13874 | {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0}, | |
13875 | {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0}, | |
13876 | {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0}, | |
13877 | {"=", BINOP_EQUAL, PREC_EQUAL, 0}, | |
13878 | {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0}, | |
13879 | {"<=", BINOP_LEQ, PREC_ORDER, 0}, | |
13880 | {">=", BINOP_GEQ, PREC_ORDER, 0}, | |
13881 | {">", BINOP_GTR, PREC_ORDER, 0}, | |
13882 | {"<", BINOP_LESS, PREC_ORDER, 0}, | |
13883 | {">>", BINOP_RSH, PREC_SHIFT, 0}, | |
13884 | {"<<", BINOP_LSH, PREC_SHIFT, 0}, | |
13885 | {"+", BINOP_ADD, PREC_ADD, 0}, | |
13886 | {"-", BINOP_SUB, PREC_ADD, 0}, | |
13887 | {"&", BINOP_CONCAT, PREC_ADD, 0}, | |
13888 | {"*", BINOP_MUL, PREC_MUL, 0}, | |
13889 | {"/", BINOP_DIV, PREC_MUL, 0}, | |
13890 | {"rem", BINOP_REM, PREC_MUL, 0}, | |
13891 | {"mod", BINOP_MOD, PREC_MUL, 0}, | |
13892 | {"**", BINOP_EXP, PREC_REPEAT, 0}, | |
13893 | {"@", BINOP_REPEAT, PREC_REPEAT, 0}, | |
13894 | {"-", UNOP_NEG, PREC_PREFIX, 0}, | |
13895 | {"+", UNOP_PLUS, PREC_PREFIX, 0}, | |
13896 | {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0}, | |
13897 | {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0}, | |
13898 | {"abs ", UNOP_ABS, PREC_PREFIX, 0}, | |
4c4b4cd2 PH |
13899 | {".all", UNOP_IND, PREC_SUFFIX, 1}, |
13900 | {"'access", UNOP_ADDR, PREC_SUFFIX, 1}, | |
13901 | {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1}, | |
f486487f | 13902 | {NULL, OP_NULL, PREC_SUFFIX, 0} |
14f9c5c9 AS |
13903 | }; |
13904 | \f | |
72d5681a PH |
13905 | enum ada_primitive_types { |
13906 | ada_primitive_type_int, | |
13907 | ada_primitive_type_long, | |
13908 | ada_primitive_type_short, | |
13909 | ada_primitive_type_char, | |
13910 | ada_primitive_type_float, | |
13911 | ada_primitive_type_double, | |
13912 | ada_primitive_type_void, | |
13913 | ada_primitive_type_long_long, | |
13914 | ada_primitive_type_long_double, | |
13915 | ada_primitive_type_natural, | |
13916 | ada_primitive_type_positive, | |
13917 | ada_primitive_type_system_address, | |
13918 | nr_ada_primitive_types | |
13919 | }; | |
6c038f32 PH |
13920 | |
13921 | static void | |
d4a9a881 | 13922 | ada_language_arch_info (struct gdbarch *gdbarch, |
72d5681a PH |
13923 | struct language_arch_info *lai) |
13924 | { | |
d4a9a881 | 13925 | const struct builtin_type *builtin = builtin_type (gdbarch); |
5b4ee69b | 13926 | |
72d5681a | 13927 | lai->primitive_type_vector |
d4a9a881 | 13928 | = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1, |
72d5681a | 13929 | struct type *); |
e9bb382b UW |
13930 | |
13931 | lai->primitive_type_vector [ada_primitive_type_int] | |
13932 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
13933 | 0, "integer"); | |
13934 | lai->primitive_type_vector [ada_primitive_type_long] | |
13935 | = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch), | |
13936 | 0, "long_integer"); | |
13937 | lai->primitive_type_vector [ada_primitive_type_short] | |
13938 | = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch), | |
13939 | 0, "short_integer"); | |
13940 | lai->string_char_type | |
13941 | = lai->primitive_type_vector [ada_primitive_type_char] | |
cd7c1778 | 13942 | = arch_character_type (gdbarch, TARGET_CHAR_BIT, 0, "character"); |
e9bb382b UW |
13943 | lai->primitive_type_vector [ada_primitive_type_float] |
13944 | = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch), | |
13945 | "float", NULL); | |
13946 | lai->primitive_type_vector [ada_primitive_type_double] | |
13947 | = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch), | |
13948 | "long_float", NULL); | |
13949 | lai->primitive_type_vector [ada_primitive_type_long_long] | |
13950 | = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch), | |
13951 | 0, "long_long_integer"); | |
13952 | lai->primitive_type_vector [ada_primitive_type_long_double] | |
13953 | = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch), | |
13954 | "long_long_float", NULL); | |
13955 | lai->primitive_type_vector [ada_primitive_type_natural] | |
13956 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
13957 | 0, "natural"); | |
13958 | lai->primitive_type_vector [ada_primitive_type_positive] | |
13959 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
13960 | 0, "positive"); | |
13961 | lai->primitive_type_vector [ada_primitive_type_void] | |
13962 | = builtin->builtin_void; | |
13963 | ||
13964 | lai->primitive_type_vector [ada_primitive_type_system_address] | |
13965 | = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, 1, "void")); | |
72d5681a PH |
13966 | TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address]) |
13967 | = "system__address"; | |
fbb06eb1 | 13968 | |
47e729a8 | 13969 | lai->bool_type_symbol = NULL; |
fbb06eb1 | 13970 | lai->bool_type_default = builtin->builtin_bool; |
6c038f32 | 13971 | } |
6c038f32 PH |
13972 | \f |
13973 | /* Language vector */ | |
13974 | ||
13975 | /* Not really used, but needed in the ada_language_defn. */ | |
13976 | ||
13977 | static void | |
6c7a06a3 | 13978 | emit_char (int c, struct type *type, struct ui_file *stream, int quoter) |
6c038f32 | 13979 | { |
6c7a06a3 | 13980 | ada_emit_char (c, type, stream, quoter, 1); |
6c038f32 PH |
13981 | } |
13982 | ||
13983 | static int | |
410a0ff2 | 13984 | parse (struct parser_state *ps) |
6c038f32 PH |
13985 | { |
13986 | warnings_issued = 0; | |
410a0ff2 | 13987 | return ada_parse (ps); |
6c038f32 PH |
13988 | } |
13989 | ||
13990 | static const struct exp_descriptor ada_exp_descriptor = { | |
13991 | ada_print_subexp, | |
13992 | ada_operator_length, | |
c0201579 | 13993 | ada_operator_check, |
6c038f32 PH |
13994 | ada_op_name, |
13995 | ada_dump_subexp_body, | |
13996 | ada_evaluate_subexp | |
13997 | }; | |
13998 | ||
1a119f36 | 13999 | /* Implement the "la_get_symbol_name_cmp" language_defn method |
74ccd7f5 JB |
14000 | for Ada. */ |
14001 | ||
1a119f36 JB |
14002 | static symbol_name_cmp_ftype |
14003 | ada_get_symbol_name_cmp (const char *lookup_name) | |
74ccd7f5 JB |
14004 | { |
14005 | if (should_use_wild_match (lookup_name)) | |
14006 | return wild_match; | |
14007 | else | |
14008 | return compare_names; | |
14009 | } | |
14010 | ||
a5ee536b JB |
14011 | /* Implement the "la_read_var_value" language_defn method for Ada. */ |
14012 | ||
14013 | static struct value * | |
63e43d3a PMR |
14014 | ada_read_var_value (struct symbol *var, const struct block *var_block, |
14015 | struct frame_info *frame) | |
a5ee536b | 14016 | { |
3977b71f | 14017 | const struct block *frame_block = NULL; |
a5ee536b JB |
14018 | struct symbol *renaming_sym = NULL; |
14019 | ||
14020 | /* The only case where default_read_var_value is not sufficient | |
14021 | is when VAR is a renaming... */ | |
14022 | if (frame) | |
14023 | frame_block = get_frame_block (frame, NULL); | |
14024 | if (frame_block) | |
14025 | renaming_sym = ada_find_renaming_symbol (var, frame_block); | |
14026 | if (renaming_sym != NULL) | |
14027 | return ada_read_renaming_var_value (renaming_sym, frame_block); | |
14028 | ||
14029 | /* This is a typical case where we expect the default_read_var_value | |
14030 | function to work. */ | |
63e43d3a | 14031 | return default_read_var_value (var, var_block, frame); |
a5ee536b JB |
14032 | } |
14033 | ||
6c038f32 PH |
14034 | const struct language_defn ada_language_defn = { |
14035 | "ada", /* Language name */ | |
6abde28f | 14036 | "Ada", |
6c038f32 | 14037 | language_ada, |
6c038f32 | 14038 | range_check_off, |
6c038f32 PH |
14039 | case_sensitive_on, /* Yes, Ada is case-insensitive, but |
14040 | that's not quite what this means. */ | |
6c038f32 | 14041 | array_row_major, |
9a044a89 | 14042 | macro_expansion_no, |
6c038f32 PH |
14043 | &ada_exp_descriptor, |
14044 | parse, | |
14045 | ada_error, | |
14046 | resolve, | |
14047 | ada_printchar, /* Print a character constant */ | |
14048 | ada_printstr, /* Function to print string constant */ | |
14049 | emit_char, /* Function to print single char (not used) */ | |
6c038f32 | 14050 | ada_print_type, /* Print a type using appropriate syntax */ |
be942545 | 14051 | ada_print_typedef, /* Print a typedef using appropriate syntax */ |
6c038f32 PH |
14052 | ada_val_print, /* Print a value using appropriate syntax */ |
14053 | ada_value_print, /* Print a top-level value */ | |
a5ee536b | 14054 | ada_read_var_value, /* la_read_var_value */ |
6c038f32 | 14055 | NULL, /* Language specific skip_trampoline */ |
2b2d9e11 | 14056 | NULL, /* name_of_this */ |
6c038f32 PH |
14057 | ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */ |
14058 | basic_lookup_transparent_type, /* lookup_transparent_type */ | |
14059 | ada_la_decode, /* Language specific symbol demangler */ | |
0963b4bd MS |
14060 | NULL, /* Language specific |
14061 | class_name_from_physname */ | |
6c038f32 PH |
14062 | ada_op_print_tab, /* expression operators for printing */ |
14063 | 0, /* c-style arrays */ | |
14064 | 1, /* String lower bound */ | |
6c038f32 | 14065 | ada_get_gdb_completer_word_break_characters, |
41d27058 | 14066 | ada_make_symbol_completion_list, |
72d5681a | 14067 | ada_language_arch_info, |
e79af960 | 14068 | ada_print_array_index, |
41f1b697 | 14069 | default_pass_by_reference, |
ae6a3a4c | 14070 | c_get_string, |
1a119f36 | 14071 | ada_get_symbol_name_cmp, /* la_get_symbol_name_cmp */ |
f8eba3c6 | 14072 | ada_iterate_over_symbols, |
a53b64ea | 14073 | &ada_varobj_ops, |
bb2ec1b3 TT |
14074 | NULL, |
14075 | NULL, | |
6c038f32 PH |
14076 | LANG_MAGIC |
14077 | }; | |
14078 | ||
2c0b251b PA |
14079 | /* Provide a prototype to silence -Wmissing-prototypes. */ |
14080 | extern initialize_file_ftype _initialize_ada_language; | |
14081 | ||
5bf03f13 JB |
14082 | /* Command-list for the "set/show ada" prefix command. */ |
14083 | static struct cmd_list_element *set_ada_list; | |
14084 | static struct cmd_list_element *show_ada_list; | |
14085 | ||
14086 | /* Implement the "set ada" prefix command. */ | |
14087 | ||
14088 | static void | |
14089 | set_ada_command (char *arg, int from_tty) | |
14090 | { | |
14091 | printf_unfiltered (_(\ | |
14092 | "\"set ada\" must be followed by the name of a setting.\n")); | |
635c7e8a | 14093 | help_list (set_ada_list, "set ada ", all_commands, gdb_stdout); |
5bf03f13 JB |
14094 | } |
14095 | ||
14096 | /* Implement the "show ada" prefix command. */ | |
14097 | ||
14098 | static void | |
14099 | show_ada_command (char *args, int from_tty) | |
14100 | { | |
14101 | cmd_show_list (show_ada_list, from_tty, ""); | |
14102 | } | |
14103 | ||
2060206e PA |
14104 | static void |
14105 | initialize_ada_catchpoint_ops (void) | |
14106 | { | |
14107 | struct breakpoint_ops *ops; | |
14108 | ||
14109 | initialize_breakpoint_ops (); | |
14110 | ||
14111 | ops = &catch_exception_breakpoint_ops; | |
14112 | *ops = bkpt_breakpoint_ops; | |
14113 | ops->dtor = dtor_catch_exception; | |
14114 | ops->allocate_location = allocate_location_catch_exception; | |
14115 | ops->re_set = re_set_catch_exception; | |
14116 | ops->check_status = check_status_catch_exception; | |
14117 | ops->print_it = print_it_catch_exception; | |
14118 | ops->print_one = print_one_catch_exception; | |
14119 | ops->print_mention = print_mention_catch_exception; | |
14120 | ops->print_recreate = print_recreate_catch_exception; | |
14121 | ||
14122 | ops = &catch_exception_unhandled_breakpoint_ops; | |
14123 | *ops = bkpt_breakpoint_ops; | |
14124 | ops->dtor = dtor_catch_exception_unhandled; | |
14125 | ops->allocate_location = allocate_location_catch_exception_unhandled; | |
14126 | ops->re_set = re_set_catch_exception_unhandled; | |
14127 | ops->check_status = check_status_catch_exception_unhandled; | |
14128 | ops->print_it = print_it_catch_exception_unhandled; | |
14129 | ops->print_one = print_one_catch_exception_unhandled; | |
14130 | ops->print_mention = print_mention_catch_exception_unhandled; | |
14131 | ops->print_recreate = print_recreate_catch_exception_unhandled; | |
14132 | ||
14133 | ops = &catch_assert_breakpoint_ops; | |
14134 | *ops = bkpt_breakpoint_ops; | |
14135 | ops->dtor = dtor_catch_assert; | |
14136 | ops->allocate_location = allocate_location_catch_assert; | |
14137 | ops->re_set = re_set_catch_assert; | |
14138 | ops->check_status = check_status_catch_assert; | |
14139 | ops->print_it = print_it_catch_assert; | |
14140 | ops->print_one = print_one_catch_assert; | |
14141 | ops->print_mention = print_mention_catch_assert; | |
14142 | ops->print_recreate = print_recreate_catch_assert; | |
14143 | } | |
14144 | ||
3d9434b5 JB |
14145 | /* This module's 'new_objfile' observer. */ |
14146 | ||
14147 | static void | |
14148 | ada_new_objfile_observer (struct objfile *objfile) | |
14149 | { | |
14150 | ada_clear_symbol_cache (); | |
14151 | } | |
14152 | ||
14153 | /* This module's 'free_objfile' observer. */ | |
14154 | ||
14155 | static void | |
14156 | ada_free_objfile_observer (struct objfile *objfile) | |
14157 | { | |
14158 | ada_clear_symbol_cache (); | |
14159 | } | |
14160 | ||
d2e4a39e | 14161 | void |
6c038f32 | 14162 | _initialize_ada_language (void) |
14f9c5c9 | 14163 | { |
6c038f32 PH |
14164 | add_language (&ada_language_defn); |
14165 | ||
2060206e PA |
14166 | initialize_ada_catchpoint_ops (); |
14167 | ||
5bf03f13 JB |
14168 | add_prefix_cmd ("ada", no_class, set_ada_command, |
14169 | _("Prefix command for changing Ada-specfic settings"), | |
14170 | &set_ada_list, "set ada ", 0, &setlist); | |
14171 | ||
14172 | add_prefix_cmd ("ada", no_class, show_ada_command, | |
14173 | _("Generic command for showing Ada-specific settings."), | |
14174 | &show_ada_list, "show ada ", 0, &showlist); | |
14175 | ||
14176 | add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure, | |
14177 | &trust_pad_over_xvs, _("\ | |
14178 | Enable or disable an optimization trusting PAD types over XVS types"), _("\ | |
14179 | Show whether an optimization trusting PAD types over XVS types is activated"), | |
14180 | _("\ | |
14181 | This is related to the encoding used by the GNAT compiler. The debugger\n\ | |
14182 | should normally trust the contents of PAD types, but certain older versions\n\ | |
14183 | of GNAT have a bug that sometimes causes the information in the PAD type\n\ | |
14184 | to be incorrect. Turning this setting \"off\" allows the debugger to\n\ | |
14185 | work around this bug. It is always safe to turn this option \"off\", but\n\ | |
14186 | this incurs a slight performance penalty, so it is recommended to NOT change\n\ | |
14187 | this option to \"off\" unless necessary."), | |
14188 | NULL, NULL, &set_ada_list, &show_ada_list); | |
14189 | ||
d72413e6 PMR |
14190 | add_setshow_boolean_cmd ("print-signatures", class_vars, |
14191 | &print_signatures, _("\ | |
14192 | Enable or disable the output of formal and return types for functions in the \ | |
14193 | overloads selection menu"), _("\ | |
14194 | Show whether the output of formal and return types for functions in the \ | |
14195 | overloads selection menu is activated"), | |
14196 | NULL, NULL, NULL, &set_ada_list, &show_ada_list); | |
14197 | ||
9ac4176b PA |
14198 | add_catch_command ("exception", _("\ |
14199 | Catch Ada exceptions, when raised.\n\ | |
14200 | With an argument, catch only exceptions with the given name."), | |
14201 | catch_ada_exception_command, | |
14202 | NULL, | |
14203 | CATCH_PERMANENT, | |
14204 | CATCH_TEMPORARY); | |
14205 | add_catch_command ("assert", _("\ | |
14206 | Catch failed Ada assertions, when raised.\n\ | |
14207 | With an argument, catch only exceptions with the given name."), | |
14208 | catch_assert_command, | |
14209 | NULL, | |
14210 | CATCH_PERMANENT, | |
14211 | CATCH_TEMPORARY); | |
14212 | ||
6c038f32 | 14213 | varsize_limit = 65536; |
6c038f32 | 14214 | |
778865d3 JB |
14215 | add_info ("exceptions", info_exceptions_command, |
14216 | _("\ | |
14217 | List all Ada exception names.\n\ | |
14218 | If a regular expression is passed as an argument, only those matching\n\ | |
14219 | the regular expression are listed.")); | |
14220 | ||
c6044dd1 JB |
14221 | add_prefix_cmd ("ada", class_maintenance, maint_set_ada_cmd, |
14222 | _("Set Ada maintenance-related variables."), | |
14223 | &maint_set_ada_cmdlist, "maintenance set ada ", | |
14224 | 0/*allow-unknown*/, &maintenance_set_cmdlist); | |
14225 | ||
14226 | add_prefix_cmd ("ada", class_maintenance, maint_show_ada_cmd, | |
14227 | _("Show Ada maintenance-related variables"), | |
14228 | &maint_show_ada_cmdlist, "maintenance show ada ", | |
14229 | 0/*allow-unknown*/, &maintenance_show_cmdlist); | |
14230 | ||
14231 | add_setshow_boolean_cmd | |
14232 | ("ignore-descriptive-types", class_maintenance, | |
14233 | &ada_ignore_descriptive_types_p, | |
14234 | _("Set whether descriptive types generated by GNAT should be ignored."), | |
14235 | _("Show whether descriptive types generated by GNAT should be ignored."), | |
14236 | _("\ | |
14237 | When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\ | |
14238 | DWARF attribute."), | |
14239 | NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist); | |
14240 | ||
6c038f32 PH |
14241 | obstack_init (&symbol_list_obstack); |
14242 | ||
14243 | decoded_names_store = htab_create_alloc | |
14244 | (256, htab_hash_string, (int (*)(const void *, const void *)) streq, | |
14245 | NULL, xcalloc, xfree); | |
6b69afc4 | 14246 | |
3d9434b5 JB |
14247 | /* The ada-lang observers. */ |
14248 | observer_attach_new_objfile (ada_new_objfile_observer); | |
14249 | observer_attach_free_objfile (ada_free_objfile_observer); | |
e802dbe0 | 14250 | observer_attach_inferior_exit (ada_inferior_exit); |
ee01b665 JB |
14251 | |
14252 | /* Setup various context-specific data. */ | |
e802dbe0 | 14253 | ada_inferior_data |
8e260fc0 | 14254 | = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup); |
ee01b665 JB |
14255 | ada_pspace_data_handle |
14256 | = register_program_space_data_with_cleanup (NULL, ada_pspace_data_cleanup); | |
14f9c5c9 | 14257 | } |