Commit | Line | Data |
---|---|---|
6e681866 | 1 | /* Ada language support routines for GDB, the GNU debugger. |
10a2c479 | 2 | |
32d0add0 | 3 | Copyright (C) 1992-2015 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 | ||
401 | data = inferior_data (inf, ada_inferior_data); | |
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 | ||
419 | data = inferior_data (inf, ada_inferior_data); | |
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 | ||
462 | data = program_space_data (pspace, ada_pspace_data_handle); | |
463 | if (data == NULL) | |
464 | { | |
465 | data = XCNEW (struct ada_pspace_data); | |
466 | set_program_space_data (pspace, ada_pspace_data_handle, data); | |
467 | } | |
468 | ||
469 | return data; | |
470 | } | |
471 | ||
472 | /* The cleanup callback for this module's per-program-space data. */ | |
473 | ||
474 | static void | |
475 | ada_pspace_data_cleanup (struct program_space *pspace, void *data) | |
476 | { | |
477 | struct ada_pspace_data *pspace_data = data; | |
478 | ||
479 | if (pspace_data->sym_cache != NULL) | |
480 | ada_free_symbol_cache (pspace_data->sym_cache); | |
481 | xfree (pspace_data); | |
482 | } | |
483 | ||
4c4b4cd2 PH |
484 | /* Utilities */ |
485 | ||
720d1a40 | 486 | /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after |
eed9788b | 487 | all typedef layers have been peeled. Otherwise, return TYPE. |
720d1a40 JB |
488 | |
489 | Normally, we really expect a typedef type to only have 1 typedef layer. | |
490 | In other words, we really expect the target type of a typedef type to be | |
491 | a non-typedef type. This is particularly true for Ada units, because | |
492 | the language does not have a typedef vs not-typedef distinction. | |
493 | In that respect, the Ada compiler has been trying to eliminate as many | |
494 | typedef definitions in the debugging information, since they generally | |
495 | do not bring any extra information (we still use typedef under certain | |
496 | circumstances related mostly to the GNAT encoding). | |
497 | ||
498 | Unfortunately, we have seen situations where the debugging information | |
499 | generated by the compiler leads to such multiple typedef layers. For | |
500 | instance, consider the following example with stabs: | |
501 | ||
502 | .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...] | |
503 | .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0 | |
504 | ||
505 | This is an error in the debugging information which causes type | |
506 | pck__float_array___XUP to be defined twice, and the second time, | |
507 | it is defined as a typedef of a typedef. | |
508 | ||
509 | This is on the fringe of legality as far as debugging information is | |
510 | concerned, and certainly unexpected. But it is easy to handle these | |
511 | situations correctly, so we can afford to be lenient in this case. */ | |
512 | ||
513 | static struct type * | |
514 | ada_typedef_target_type (struct type *type) | |
515 | { | |
516 | while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
517 | type = TYPE_TARGET_TYPE (type); | |
518 | return type; | |
519 | } | |
520 | ||
41d27058 JB |
521 | /* Given DECODED_NAME a string holding a symbol name in its |
522 | decoded form (ie using the Ada dotted notation), returns | |
523 | its unqualified name. */ | |
524 | ||
525 | static const char * | |
526 | ada_unqualified_name (const char *decoded_name) | |
527 | { | |
2b0f535a JB |
528 | const char *result; |
529 | ||
530 | /* If the decoded name starts with '<', it means that the encoded | |
531 | name does not follow standard naming conventions, and thus that | |
532 | it is not your typical Ada symbol name. Trying to unqualify it | |
533 | is therefore pointless and possibly erroneous. */ | |
534 | if (decoded_name[0] == '<') | |
535 | return decoded_name; | |
536 | ||
537 | result = strrchr (decoded_name, '.'); | |
41d27058 JB |
538 | if (result != NULL) |
539 | result++; /* Skip the dot... */ | |
540 | else | |
541 | result = decoded_name; | |
542 | ||
543 | return result; | |
544 | } | |
545 | ||
546 | /* Return a string starting with '<', followed by STR, and '>'. | |
547 | The result is good until the next call. */ | |
548 | ||
549 | static char * | |
550 | add_angle_brackets (const char *str) | |
551 | { | |
552 | static char *result = NULL; | |
553 | ||
554 | xfree (result); | |
88c15c34 | 555 | result = xstrprintf ("<%s>", str); |
41d27058 JB |
556 | return result; |
557 | } | |
96d887e8 | 558 | |
4c4b4cd2 PH |
559 | static char * |
560 | ada_get_gdb_completer_word_break_characters (void) | |
561 | { | |
562 | return ada_completer_word_break_characters; | |
563 | } | |
564 | ||
e79af960 JB |
565 | /* Print an array element index using the Ada syntax. */ |
566 | ||
567 | static void | |
568 | ada_print_array_index (struct value *index_value, struct ui_file *stream, | |
79a45b7d | 569 | const struct value_print_options *options) |
e79af960 | 570 | { |
79a45b7d | 571 | LA_VALUE_PRINT (index_value, stream, options); |
e79af960 JB |
572 | fprintf_filtered (stream, " => "); |
573 | } | |
574 | ||
f27cf670 | 575 | /* Assuming VECT points to an array of *SIZE objects of size |
14f9c5c9 | 576 | ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects, |
f27cf670 | 577 | updating *SIZE as necessary and returning the (new) array. */ |
14f9c5c9 | 578 | |
f27cf670 AS |
579 | void * |
580 | grow_vect (void *vect, size_t *size, size_t min_size, int element_size) | |
14f9c5c9 | 581 | { |
d2e4a39e AS |
582 | if (*size < min_size) |
583 | { | |
584 | *size *= 2; | |
585 | if (*size < min_size) | |
4c4b4cd2 | 586 | *size = min_size; |
f27cf670 | 587 | vect = xrealloc (vect, *size * element_size); |
d2e4a39e | 588 | } |
f27cf670 | 589 | return vect; |
14f9c5c9 AS |
590 | } |
591 | ||
592 | /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing | |
4c4b4cd2 | 593 | suffix of FIELD_NAME beginning "___". */ |
14f9c5c9 AS |
594 | |
595 | static int | |
ebf56fd3 | 596 | field_name_match (const char *field_name, const char *target) |
14f9c5c9 AS |
597 | { |
598 | int len = strlen (target); | |
5b4ee69b | 599 | |
d2e4a39e | 600 | return |
4c4b4cd2 PH |
601 | (strncmp (field_name, target, len) == 0 |
602 | && (field_name[len] == '\0' | |
61012eef | 603 | || (startswith (field_name + len, "___") |
76a01679 JB |
604 | && strcmp (field_name + strlen (field_name) - 6, |
605 | "___XVN") != 0))); | |
14f9c5c9 AS |
606 | } |
607 | ||
608 | ||
872c8b51 JB |
609 | /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to |
610 | a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME, | |
611 | and return its index. This function also handles fields whose name | |
612 | have ___ suffixes because the compiler sometimes alters their name | |
613 | by adding such a suffix to represent fields with certain constraints. | |
614 | If the field could not be found, return a negative number if | |
615 | MAYBE_MISSING is set. Otherwise raise an error. */ | |
4c4b4cd2 PH |
616 | |
617 | int | |
618 | ada_get_field_index (const struct type *type, const char *field_name, | |
619 | int maybe_missing) | |
620 | { | |
621 | int fieldno; | |
872c8b51 JB |
622 | struct type *struct_type = check_typedef ((struct type *) type); |
623 | ||
624 | for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++) | |
625 | if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name)) | |
4c4b4cd2 PH |
626 | return fieldno; |
627 | ||
628 | if (!maybe_missing) | |
323e0a4a | 629 | error (_("Unable to find field %s in struct %s. Aborting"), |
872c8b51 | 630 | field_name, TYPE_NAME (struct_type)); |
4c4b4cd2 PH |
631 | |
632 | return -1; | |
633 | } | |
634 | ||
635 | /* The length of the prefix of NAME prior to any "___" suffix. */ | |
14f9c5c9 AS |
636 | |
637 | int | |
d2e4a39e | 638 | ada_name_prefix_len (const char *name) |
14f9c5c9 AS |
639 | { |
640 | if (name == NULL) | |
641 | return 0; | |
d2e4a39e | 642 | else |
14f9c5c9 | 643 | { |
d2e4a39e | 644 | const char *p = strstr (name, "___"); |
5b4ee69b | 645 | |
14f9c5c9 | 646 | if (p == NULL) |
4c4b4cd2 | 647 | return strlen (name); |
14f9c5c9 | 648 | else |
4c4b4cd2 | 649 | return p - name; |
14f9c5c9 AS |
650 | } |
651 | } | |
652 | ||
4c4b4cd2 PH |
653 | /* Return non-zero if SUFFIX is a suffix of STR. |
654 | Return zero if STR is null. */ | |
655 | ||
14f9c5c9 | 656 | static int |
d2e4a39e | 657 | is_suffix (const char *str, const char *suffix) |
14f9c5c9 AS |
658 | { |
659 | int len1, len2; | |
5b4ee69b | 660 | |
14f9c5c9 AS |
661 | if (str == NULL) |
662 | return 0; | |
663 | len1 = strlen (str); | |
664 | len2 = strlen (suffix); | |
4c4b4cd2 | 665 | return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0); |
14f9c5c9 AS |
666 | } |
667 | ||
4c4b4cd2 PH |
668 | /* The contents of value VAL, treated as a value of type TYPE. The |
669 | result is an lval in memory if VAL is. */ | |
14f9c5c9 | 670 | |
d2e4a39e | 671 | static struct value * |
4c4b4cd2 | 672 | coerce_unspec_val_to_type (struct value *val, struct type *type) |
14f9c5c9 | 673 | { |
61ee279c | 674 | type = ada_check_typedef (type); |
df407dfe | 675 | if (value_type (val) == type) |
4c4b4cd2 | 676 | return val; |
d2e4a39e | 677 | else |
14f9c5c9 | 678 | { |
4c4b4cd2 PH |
679 | struct value *result; |
680 | ||
681 | /* Make sure that the object size is not unreasonable before | |
682 | trying to allocate some memory for it. */ | |
c1b5a1a6 | 683 | ada_ensure_varsize_limit (type); |
4c4b4cd2 | 684 | |
41e8491f JK |
685 | if (value_lazy (val) |
686 | || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val))) | |
687 | result = allocate_value_lazy (type); | |
688 | else | |
689 | { | |
690 | result = allocate_value (type); | |
9a0dc9e3 | 691 | value_contents_copy_raw (result, 0, val, 0, TYPE_LENGTH (type)); |
41e8491f | 692 | } |
74bcbdf3 | 693 | set_value_component_location (result, val); |
9bbda503 AC |
694 | set_value_bitsize (result, value_bitsize (val)); |
695 | set_value_bitpos (result, value_bitpos (val)); | |
42ae5230 | 696 | set_value_address (result, value_address (val)); |
14f9c5c9 AS |
697 | return result; |
698 | } | |
699 | } | |
700 | ||
fc1a4b47 AC |
701 | static const gdb_byte * |
702 | cond_offset_host (const gdb_byte *valaddr, long offset) | |
14f9c5c9 AS |
703 | { |
704 | if (valaddr == NULL) | |
705 | return NULL; | |
706 | else | |
707 | return valaddr + offset; | |
708 | } | |
709 | ||
710 | static CORE_ADDR | |
ebf56fd3 | 711 | cond_offset_target (CORE_ADDR address, long offset) |
14f9c5c9 AS |
712 | { |
713 | if (address == 0) | |
714 | return 0; | |
d2e4a39e | 715 | else |
14f9c5c9 AS |
716 | return address + offset; |
717 | } | |
718 | ||
4c4b4cd2 PH |
719 | /* Issue a warning (as for the definition of warning in utils.c, but |
720 | with exactly one argument rather than ...), unless the limit on the | |
721 | number of warnings has passed during the evaluation of the current | |
722 | expression. */ | |
a2249542 | 723 | |
77109804 AC |
724 | /* FIXME: cagney/2004-10-10: This function is mimicking the behavior |
725 | provided by "complaint". */ | |
a0b31db1 | 726 | static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2); |
77109804 | 727 | |
14f9c5c9 | 728 | static void |
a2249542 | 729 | lim_warning (const char *format, ...) |
14f9c5c9 | 730 | { |
a2249542 | 731 | va_list args; |
a2249542 | 732 | |
5b4ee69b | 733 | va_start (args, format); |
4c4b4cd2 PH |
734 | warnings_issued += 1; |
735 | if (warnings_issued <= warning_limit) | |
a2249542 MK |
736 | vwarning (format, args); |
737 | ||
738 | va_end (args); | |
4c4b4cd2 PH |
739 | } |
740 | ||
714e53ab PH |
741 | /* Issue an error if the size of an object of type T is unreasonable, |
742 | i.e. if it would be a bad idea to allocate a value of this type in | |
743 | GDB. */ | |
744 | ||
c1b5a1a6 JB |
745 | void |
746 | ada_ensure_varsize_limit (const struct type *type) | |
714e53ab PH |
747 | { |
748 | if (TYPE_LENGTH (type) > varsize_limit) | |
323e0a4a | 749 | error (_("object size is larger than varsize-limit")); |
714e53ab PH |
750 | } |
751 | ||
0963b4bd | 752 | /* Maximum value of a SIZE-byte signed integer type. */ |
4c4b4cd2 | 753 | static LONGEST |
c3e5cd34 | 754 | max_of_size (int size) |
4c4b4cd2 | 755 | { |
76a01679 | 756 | LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2); |
5b4ee69b | 757 | |
76a01679 | 758 | return top_bit | (top_bit - 1); |
4c4b4cd2 PH |
759 | } |
760 | ||
0963b4bd | 761 | /* Minimum value of a SIZE-byte signed integer type. */ |
4c4b4cd2 | 762 | static LONGEST |
c3e5cd34 | 763 | min_of_size (int size) |
4c4b4cd2 | 764 | { |
c3e5cd34 | 765 | return -max_of_size (size) - 1; |
4c4b4cd2 PH |
766 | } |
767 | ||
0963b4bd | 768 | /* Maximum value of a SIZE-byte unsigned integer type. */ |
4c4b4cd2 | 769 | static ULONGEST |
c3e5cd34 | 770 | umax_of_size (int size) |
4c4b4cd2 | 771 | { |
76a01679 | 772 | ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1); |
5b4ee69b | 773 | |
76a01679 | 774 | return top_bit | (top_bit - 1); |
4c4b4cd2 PH |
775 | } |
776 | ||
0963b4bd | 777 | /* Maximum value of integral type T, as a signed quantity. */ |
c3e5cd34 PH |
778 | static LONGEST |
779 | max_of_type (struct type *t) | |
4c4b4cd2 | 780 | { |
c3e5cd34 PH |
781 | if (TYPE_UNSIGNED (t)) |
782 | return (LONGEST) umax_of_size (TYPE_LENGTH (t)); | |
783 | else | |
784 | return max_of_size (TYPE_LENGTH (t)); | |
785 | } | |
786 | ||
0963b4bd | 787 | /* Minimum value of integral type T, as a signed quantity. */ |
c3e5cd34 PH |
788 | static LONGEST |
789 | min_of_type (struct type *t) | |
790 | { | |
791 | if (TYPE_UNSIGNED (t)) | |
792 | return 0; | |
793 | else | |
794 | return min_of_size (TYPE_LENGTH (t)); | |
4c4b4cd2 PH |
795 | } |
796 | ||
797 | /* The largest value in the domain of TYPE, a discrete type, as an integer. */ | |
43bbcdc2 PH |
798 | LONGEST |
799 | ada_discrete_type_high_bound (struct type *type) | |
4c4b4cd2 | 800 | { |
c3345124 | 801 | type = resolve_dynamic_type (type, NULL, 0); |
76a01679 | 802 | switch (TYPE_CODE (type)) |
4c4b4cd2 PH |
803 | { |
804 | case TYPE_CODE_RANGE: | |
690cc4eb | 805 | return TYPE_HIGH_BOUND (type); |
4c4b4cd2 | 806 | case TYPE_CODE_ENUM: |
14e75d8e | 807 | return TYPE_FIELD_ENUMVAL (type, TYPE_NFIELDS (type) - 1); |
690cc4eb PH |
808 | case TYPE_CODE_BOOL: |
809 | return 1; | |
810 | case TYPE_CODE_CHAR: | |
76a01679 | 811 | case TYPE_CODE_INT: |
690cc4eb | 812 | return max_of_type (type); |
4c4b4cd2 | 813 | default: |
43bbcdc2 | 814 | error (_("Unexpected type in ada_discrete_type_high_bound.")); |
4c4b4cd2 PH |
815 | } |
816 | } | |
817 | ||
14e75d8e | 818 | /* The smallest value in the domain of TYPE, a discrete type, as an integer. */ |
43bbcdc2 PH |
819 | LONGEST |
820 | ada_discrete_type_low_bound (struct type *type) | |
4c4b4cd2 | 821 | { |
c3345124 | 822 | type = resolve_dynamic_type (type, NULL, 0); |
76a01679 | 823 | switch (TYPE_CODE (type)) |
4c4b4cd2 PH |
824 | { |
825 | case TYPE_CODE_RANGE: | |
690cc4eb | 826 | return TYPE_LOW_BOUND (type); |
4c4b4cd2 | 827 | case TYPE_CODE_ENUM: |
14e75d8e | 828 | return TYPE_FIELD_ENUMVAL (type, 0); |
690cc4eb PH |
829 | case TYPE_CODE_BOOL: |
830 | return 0; | |
831 | case TYPE_CODE_CHAR: | |
76a01679 | 832 | case TYPE_CODE_INT: |
690cc4eb | 833 | return min_of_type (type); |
4c4b4cd2 | 834 | default: |
43bbcdc2 | 835 | error (_("Unexpected type in ada_discrete_type_low_bound.")); |
4c4b4cd2 PH |
836 | } |
837 | } | |
838 | ||
839 | /* The identity on non-range types. For range types, the underlying | |
76a01679 | 840 | non-range scalar type. */ |
4c4b4cd2 PH |
841 | |
842 | static struct type * | |
18af8284 | 843 | get_base_type (struct type *type) |
4c4b4cd2 PH |
844 | { |
845 | while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE) | |
846 | { | |
76a01679 JB |
847 | if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL) |
848 | return type; | |
4c4b4cd2 PH |
849 | type = TYPE_TARGET_TYPE (type); |
850 | } | |
851 | return type; | |
14f9c5c9 | 852 | } |
41246937 JB |
853 | |
854 | /* Return a decoded version of the given VALUE. This means returning | |
855 | a value whose type is obtained by applying all the GNAT-specific | |
856 | encondings, making the resulting type a static but standard description | |
857 | of the initial type. */ | |
858 | ||
859 | struct value * | |
860 | ada_get_decoded_value (struct value *value) | |
861 | { | |
862 | struct type *type = ada_check_typedef (value_type (value)); | |
863 | ||
864 | if (ada_is_array_descriptor_type (type) | |
865 | || (ada_is_constrained_packed_array_type (type) | |
866 | && TYPE_CODE (type) != TYPE_CODE_PTR)) | |
867 | { | |
868 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) /* array access type. */ | |
869 | value = ada_coerce_to_simple_array_ptr (value); | |
870 | else | |
871 | value = ada_coerce_to_simple_array (value); | |
872 | } | |
873 | else | |
874 | value = ada_to_fixed_value (value); | |
875 | ||
876 | return value; | |
877 | } | |
878 | ||
879 | /* Same as ada_get_decoded_value, but with the given TYPE. | |
880 | Because there is no associated actual value for this type, | |
881 | the resulting type might be a best-effort approximation in | |
882 | the case of dynamic types. */ | |
883 | ||
884 | struct type * | |
885 | ada_get_decoded_type (struct type *type) | |
886 | { | |
887 | type = to_static_fixed_type (type); | |
888 | if (ada_is_constrained_packed_array_type (type)) | |
889 | type = ada_coerce_to_simple_array_type (type); | |
890 | return type; | |
891 | } | |
892 | ||
4c4b4cd2 | 893 | \f |
76a01679 | 894 | |
4c4b4cd2 | 895 | /* Language Selection */ |
14f9c5c9 AS |
896 | |
897 | /* If the main program is in Ada, return language_ada, otherwise return LANG | |
ccefe4c4 | 898 | (the main program is in Ada iif the adainit symbol is found). */ |
d2e4a39e | 899 | |
14f9c5c9 | 900 | enum language |
ccefe4c4 | 901 | ada_update_initial_language (enum language lang) |
14f9c5c9 | 902 | { |
d2e4a39e | 903 | if (lookup_minimal_symbol ("adainit", (const char *) NULL, |
3b7344d5 | 904 | (struct objfile *) NULL).minsym != NULL) |
4c4b4cd2 | 905 | return language_ada; |
14f9c5c9 AS |
906 | |
907 | return lang; | |
908 | } | |
96d887e8 PH |
909 | |
910 | /* If the main procedure is written in Ada, then return its name. | |
911 | The result is good until the next call. Return NULL if the main | |
912 | procedure doesn't appear to be in Ada. */ | |
913 | ||
914 | char * | |
915 | ada_main_name (void) | |
916 | { | |
3b7344d5 | 917 | struct bound_minimal_symbol msym; |
f9bc20b9 | 918 | static char *main_program_name = NULL; |
6c038f32 | 919 | |
96d887e8 PH |
920 | /* For Ada, the name of the main procedure is stored in a specific |
921 | string constant, generated by the binder. Look for that symbol, | |
922 | extract its address, and then read that string. If we didn't find | |
923 | that string, then most probably the main procedure is not written | |
924 | in Ada. */ | |
925 | msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL); | |
926 | ||
3b7344d5 | 927 | if (msym.minsym != NULL) |
96d887e8 | 928 | { |
f9bc20b9 JB |
929 | CORE_ADDR main_program_name_addr; |
930 | int err_code; | |
931 | ||
77e371c0 | 932 | main_program_name_addr = BMSYMBOL_VALUE_ADDRESS (msym); |
96d887e8 | 933 | if (main_program_name_addr == 0) |
323e0a4a | 934 | error (_("Invalid address for Ada main program name.")); |
96d887e8 | 935 | |
f9bc20b9 JB |
936 | xfree (main_program_name); |
937 | target_read_string (main_program_name_addr, &main_program_name, | |
938 | 1024, &err_code); | |
939 | ||
940 | if (err_code != 0) | |
941 | return NULL; | |
96d887e8 PH |
942 | return main_program_name; |
943 | } | |
944 | ||
945 | /* The main procedure doesn't seem to be in Ada. */ | |
946 | return NULL; | |
947 | } | |
14f9c5c9 | 948 | \f |
4c4b4cd2 | 949 | /* Symbols */ |
d2e4a39e | 950 | |
4c4b4cd2 PH |
951 | /* Table of Ada operators and their GNAT-encoded names. Last entry is pair |
952 | of NULLs. */ | |
14f9c5c9 | 953 | |
d2e4a39e AS |
954 | const struct ada_opname_map ada_opname_table[] = { |
955 | {"Oadd", "\"+\"", BINOP_ADD}, | |
956 | {"Osubtract", "\"-\"", BINOP_SUB}, | |
957 | {"Omultiply", "\"*\"", BINOP_MUL}, | |
958 | {"Odivide", "\"/\"", BINOP_DIV}, | |
959 | {"Omod", "\"mod\"", BINOP_MOD}, | |
960 | {"Orem", "\"rem\"", BINOP_REM}, | |
961 | {"Oexpon", "\"**\"", BINOP_EXP}, | |
962 | {"Olt", "\"<\"", BINOP_LESS}, | |
963 | {"Ole", "\"<=\"", BINOP_LEQ}, | |
964 | {"Ogt", "\">\"", BINOP_GTR}, | |
965 | {"Oge", "\">=\"", BINOP_GEQ}, | |
966 | {"Oeq", "\"=\"", BINOP_EQUAL}, | |
967 | {"One", "\"/=\"", BINOP_NOTEQUAL}, | |
968 | {"Oand", "\"and\"", BINOP_BITWISE_AND}, | |
969 | {"Oor", "\"or\"", BINOP_BITWISE_IOR}, | |
970 | {"Oxor", "\"xor\"", BINOP_BITWISE_XOR}, | |
971 | {"Oconcat", "\"&\"", BINOP_CONCAT}, | |
972 | {"Oabs", "\"abs\"", UNOP_ABS}, | |
973 | {"Onot", "\"not\"", UNOP_LOGICAL_NOT}, | |
974 | {"Oadd", "\"+\"", UNOP_PLUS}, | |
975 | {"Osubtract", "\"-\"", UNOP_NEG}, | |
976 | {NULL, NULL} | |
14f9c5c9 AS |
977 | }; |
978 | ||
4c4b4cd2 PH |
979 | /* The "encoded" form of DECODED, according to GNAT conventions. |
980 | The result is valid until the next call to ada_encode. */ | |
981 | ||
14f9c5c9 | 982 | char * |
4c4b4cd2 | 983 | ada_encode (const char *decoded) |
14f9c5c9 | 984 | { |
4c4b4cd2 PH |
985 | static char *encoding_buffer = NULL; |
986 | static size_t encoding_buffer_size = 0; | |
d2e4a39e | 987 | const char *p; |
14f9c5c9 | 988 | int k; |
d2e4a39e | 989 | |
4c4b4cd2 | 990 | if (decoded == NULL) |
14f9c5c9 AS |
991 | return NULL; |
992 | ||
4c4b4cd2 PH |
993 | GROW_VECT (encoding_buffer, encoding_buffer_size, |
994 | 2 * strlen (decoded) + 10); | |
14f9c5c9 AS |
995 | |
996 | k = 0; | |
4c4b4cd2 | 997 | for (p = decoded; *p != '\0'; p += 1) |
14f9c5c9 | 998 | { |
cdc7bb92 | 999 | if (*p == '.') |
4c4b4cd2 PH |
1000 | { |
1001 | encoding_buffer[k] = encoding_buffer[k + 1] = '_'; | |
1002 | k += 2; | |
1003 | } | |
14f9c5c9 | 1004 | else if (*p == '"') |
4c4b4cd2 PH |
1005 | { |
1006 | const struct ada_opname_map *mapping; | |
1007 | ||
1008 | for (mapping = ada_opname_table; | |
1265e4aa | 1009 | mapping->encoded != NULL |
61012eef | 1010 | && !startswith (p, mapping->decoded); mapping += 1) |
4c4b4cd2 PH |
1011 | ; |
1012 | if (mapping->encoded == NULL) | |
323e0a4a | 1013 | error (_("invalid Ada operator name: %s"), p); |
4c4b4cd2 PH |
1014 | strcpy (encoding_buffer + k, mapping->encoded); |
1015 | k += strlen (mapping->encoded); | |
1016 | break; | |
1017 | } | |
d2e4a39e | 1018 | else |
4c4b4cd2 PH |
1019 | { |
1020 | encoding_buffer[k] = *p; | |
1021 | k += 1; | |
1022 | } | |
14f9c5c9 AS |
1023 | } |
1024 | ||
4c4b4cd2 PH |
1025 | encoding_buffer[k] = '\0'; |
1026 | return encoding_buffer; | |
14f9c5c9 AS |
1027 | } |
1028 | ||
1029 | /* Return NAME folded to lower case, or, if surrounded by single | |
4c4b4cd2 PH |
1030 | quotes, unfolded, but with the quotes stripped away. Result good |
1031 | to next call. */ | |
1032 | ||
d2e4a39e AS |
1033 | char * |
1034 | ada_fold_name (const char *name) | |
14f9c5c9 | 1035 | { |
d2e4a39e | 1036 | static char *fold_buffer = NULL; |
14f9c5c9 AS |
1037 | static size_t fold_buffer_size = 0; |
1038 | ||
1039 | int len = strlen (name); | |
d2e4a39e | 1040 | GROW_VECT (fold_buffer, fold_buffer_size, len + 1); |
14f9c5c9 AS |
1041 | |
1042 | if (name[0] == '\'') | |
1043 | { | |
d2e4a39e AS |
1044 | strncpy (fold_buffer, name + 1, len - 2); |
1045 | fold_buffer[len - 2] = '\000'; | |
14f9c5c9 AS |
1046 | } |
1047 | else | |
1048 | { | |
1049 | int i; | |
5b4ee69b | 1050 | |
14f9c5c9 | 1051 | for (i = 0; i <= len; i += 1) |
4c4b4cd2 | 1052 | fold_buffer[i] = tolower (name[i]); |
14f9c5c9 AS |
1053 | } |
1054 | ||
1055 | return fold_buffer; | |
1056 | } | |
1057 | ||
529cad9c PH |
1058 | /* Return nonzero if C is either a digit or a lowercase alphabet character. */ |
1059 | ||
1060 | static int | |
1061 | is_lower_alphanum (const char c) | |
1062 | { | |
1063 | return (isdigit (c) || (isalpha (c) && islower (c))); | |
1064 | } | |
1065 | ||
c90092fe JB |
1066 | /* ENCODED is the linkage name of a symbol and LEN contains its length. |
1067 | This function saves in LEN the length of that same symbol name but | |
1068 | without either of these suffixes: | |
29480c32 JB |
1069 | . .{DIGIT}+ |
1070 | . ${DIGIT}+ | |
1071 | . ___{DIGIT}+ | |
1072 | . __{DIGIT}+. | |
c90092fe | 1073 | |
29480c32 JB |
1074 | These are suffixes introduced by the compiler for entities such as |
1075 | nested subprogram for instance, in order to avoid name clashes. | |
1076 | They do not serve any purpose for the debugger. */ | |
1077 | ||
1078 | static void | |
1079 | ada_remove_trailing_digits (const char *encoded, int *len) | |
1080 | { | |
1081 | if (*len > 1 && isdigit (encoded[*len - 1])) | |
1082 | { | |
1083 | int i = *len - 2; | |
5b4ee69b | 1084 | |
29480c32 JB |
1085 | while (i > 0 && isdigit (encoded[i])) |
1086 | i--; | |
1087 | if (i >= 0 && encoded[i] == '.') | |
1088 | *len = i; | |
1089 | else if (i >= 0 && encoded[i] == '$') | |
1090 | *len = i; | |
61012eef | 1091 | else if (i >= 2 && startswith (encoded + i - 2, "___")) |
29480c32 | 1092 | *len = i - 2; |
61012eef | 1093 | else if (i >= 1 && startswith (encoded + i - 1, "__")) |
29480c32 JB |
1094 | *len = i - 1; |
1095 | } | |
1096 | } | |
1097 | ||
1098 | /* Remove the suffix introduced by the compiler for protected object | |
1099 | subprograms. */ | |
1100 | ||
1101 | static void | |
1102 | ada_remove_po_subprogram_suffix (const char *encoded, int *len) | |
1103 | { | |
1104 | /* Remove trailing N. */ | |
1105 | ||
1106 | /* Protected entry subprograms are broken into two | |
1107 | separate subprograms: The first one is unprotected, and has | |
1108 | a 'N' suffix; the second is the protected version, and has | |
0963b4bd | 1109 | the 'P' suffix. The second calls the first one after handling |
29480c32 JB |
1110 | the protection. Since the P subprograms are internally generated, |
1111 | we leave these names undecoded, giving the user a clue that this | |
1112 | entity is internal. */ | |
1113 | ||
1114 | if (*len > 1 | |
1115 | && encoded[*len - 1] == 'N' | |
1116 | && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2]))) | |
1117 | *len = *len - 1; | |
1118 | } | |
1119 | ||
69fadcdf JB |
1120 | /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */ |
1121 | ||
1122 | static void | |
1123 | ada_remove_Xbn_suffix (const char *encoded, int *len) | |
1124 | { | |
1125 | int i = *len - 1; | |
1126 | ||
1127 | while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n')) | |
1128 | i--; | |
1129 | ||
1130 | if (encoded[i] != 'X') | |
1131 | return; | |
1132 | ||
1133 | if (i == 0) | |
1134 | return; | |
1135 | ||
1136 | if (isalnum (encoded[i-1])) | |
1137 | *len = i; | |
1138 | } | |
1139 | ||
29480c32 JB |
1140 | /* If ENCODED follows the GNAT entity encoding conventions, then return |
1141 | the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is | |
1142 | replaced by ENCODED. | |
14f9c5c9 | 1143 | |
4c4b4cd2 | 1144 | The resulting string is valid until the next call of ada_decode. |
29480c32 | 1145 | If the string is unchanged by decoding, the original string pointer |
4c4b4cd2 PH |
1146 | is returned. */ |
1147 | ||
1148 | const char * | |
1149 | ada_decode (const char *encoded) | |
14f9c5c9 AS |
1150 | { |
1151 | int i, j; | |
1152 | int len0; | |
d2e4a39e | 1153 | const char *p; |
4c4b4cd2 | 1154 | char *decoded; |
14f9c5c9 | 1155 | int at_start_name; |
4c4b4cd2 PH |
1156 | static char *decoding_buffer = NULL; |
1157 | static size_t decoding_buffer_size = 0; | |
d2e4a39e | 1158 | |
29480c32 JB |
1159 | /* The name of the Ada main procedure starts with "_ada_". |
1160 | This prefix is not part of the decoded name, so skip this part | |
1161 | if we see this prefix. */ | |
61012eef | 1162 | if (startswith (encoded, "_ada_")) |
4c4b4cd2 | 1163 | encoded += 5; |
14f9c5c9 | 1164 | |
29480c32 JB |
1165 | /* If the name starts with '_', then it is not a properly encoded |
1166 | name, so do not attempt to decode it. Similarly, if the name | |
1167 | starts with '<', the name should not be decoded. */ | |
4c4b4cd2 | 1168 | if (encoded[0] == '_' || encoded[0] == '<') |
14f9c5c9 AS |
1169 | goto Suppress; |
1170 | ||
4c4b4cd2 | 1171 | len0 = strlen (encoded); |
4c4b4cd2 | 1172 | |
29480c32 JB |
1173 | ada_remove_trailing_digits (encoded, &len0); |
1174 | ada_remove_po_subprogram_suffix (encoded, &len0); | |
529cad9c | 1175 | |
4c4b4cd2 PH |
1176 | /* Remove the ___X.* suffix if present. Do not forget to verify that |
1177 | the suffix is located before the current "end" of ENCODED. We want | |
1178 | to avoid re-matching parts of ENCODED that have previously been | |
1179 | marked as discarded (by decrementing LEN0). */ | |
1180 | p = strstr (encoded, "___"); | |
1181 | if (p != NULL && p - encoded < len0 - 3) | |
14f9c5c9 AS |
1182 | { |
1183 | if (p[3] == 'X') | |
4c4b4cd2 | 1184 | len0 = p - encoded; |
14f9c5c9 | 1185 | else |
4c4b4cd2 | 1186 | goto Suppress; |
14f9c5c9 | 1187 | } |
4c4b4cd2 | 1188 | |
29480c32 JB |
1189 | /* Remove any trailing TKB suffix. It tells us that this symbol |
1190 | is for the body of a task, but that information does not actually | |
1191 | appear in the decoded name. */ | |
1192 | ||
61012eef | 1193 | if (len0 > 3 && startswith (encoded + len0 - 3, "TKB")) |
14f9c5c9 | 1194 | len0 -= 3; |
76a01679 | 1195 | |
a10967fa JB |
1196 | /* Remove any trailing TB suffix. The TB suffix is slightly different |
1197 | from the TKB suffix because it is used for non-anonymous task | |
1198 | bodies. */ | |
1199 | ||
61012eef | 1200 | if (len0 > 2 && startswith (encoded + len0 - 2, "TB")) |
a10967fa JB |
1201 | len0 -= 2; |
1202 | ||
29480c32 JB |
1203 | /* Remove trailing "B" suffixes. */ |
1204 | /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */ | |
1205 | ||
61012eef | 1206 | if (len0 > 1 && startswith (encoded + len0 - 1, "B")) |
14f9c5c9 AS |
1207 | len0 -= 1; |
1208 | ||
4c4b4cd2 | 1209 | /* Make decoded big enough for possible expansion by operator name. */ |
29480c32 | 1210 | |
4c4b4cd2 PH |
1211 | GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1); |
1212 | decoded = decoding_buffer; | |
14f9c5c9 | 1213 | |
29480c32 JB |
1214 | /* Remove trailing __{digit}+ or trailing ${digit}+. */ |
1215 | ||
4c4b4cd2 | 1216 | if (len0 > 1 && isdigit (encoded[len0 - 1])) |
d2e4a39e | 1217 | { |
4c4b4cd2 PH |
1218 | i = len0 - 2; |
1219 | while ((i >= 0 && isdigit (encoded[i])) | |
1220 | || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1]))) | |
1221 | i -= 1; | |
1222 | if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_') | |
1223 | len0 = i - 1; | |
1224 | else if (encoded[i] == '$') | |
1225 | len0 = i; | |
d2e4a39e | 1226 | } |
14f9c5c9 | 1227 | |
29480c32 JB |
1228 | /* The first few characters that are not alphabetic are not part |
1229 | of any encoding we use, so we can copy them over verbatim. */ | |
1230 | ||
4c4b4cd2 PH |
1231 | for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1) |
1232 | decoded[j] = encoded[i]; | |
14f9c5c9 AS |
1233 | |
1234 | at_start_name = 1; | |
1235 | while (i < len0) | |
1236 | { | |
29480c32 | 1237 | /* Is this a symbol function? */ |
4c4b4cd2 PH |
1238 | if (at_start_name && encoded[i] == 'O') |
1239 | { | |
1240 | int k; | |
5b4ee69b | 1241 | |
4c4b4cd2 PH |
1242 | for (k = 0; ada_opname_table[k].encoded != NULL; k += 1) |
1243 | { | |
1244 | int op_len = strlen (ada_opname_table[k].encoded); | |
06d5cf63 JB |
1245 | if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1, |
1246 | op_len - 1) == 0) | |
1247 | && !isalnum (encoded[i + op_len])) | |
4c4b4cd2 PH |
1248 | { |
1249 | strcpy (decoded + j, ada_opname_table[k].decoded); | |
1250 | at_start_name = 0; | |
1251 | i += op_len; | |
1252 | j += strlen (ada_opname_table[k].decoded); | |
1253 | break; | |
1254 | } | |
1255 | } | |
1256 | if (ada_opname_table[k].encoded != NULL) | |
1257 | continue; | |
1258 | } | |
14f9c5c9 AS |
1259 | at_start_name = 0; |
1260 | ||
529cad9c PH |
1261 | /* Replace "TK__" with "__", which will eventually be translated |
1262 | into "." (just below). */ | |
1263 | ||
61012eef | 1264 | if (i < len0 - 4 && startswith (encoded + i, "TK__")) |
4c4b4cd2 | 1265 | i += 2; |
529cad9c | 1266 | |
29480c32 JB |
1267 | /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually |
1268 | be translated into "." (just below). These are internal names | |
1269 | generated for anonymous blocks inside which our symbol is nested. */ | |
1270 | ||
1271 | if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_' | |
1272 | && encoded [i+2] == 'B' && encoded [i+3] == '_' | |
1273 | && isdigit (encoded [i+4])) | |
1274 | { | |
1275 | int k = i + 5; | |
1276 | ||
1277 | while (k < len0 && isdigit (encoded[k])) | |
1278 | k++; /* Skip any extra digit. */ | |
1279 | ||
1280 | /* Double-check that the "__B_{DIGITS}+" sequence we found | |
1281 | is indeed followed by "__". */ | |
1282 | if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_') | |
1283 | i = k; | |
1284 | } | |
1285 | ||
529cad9c PH |
1286 | /* Remove _E{DIGITS}+[sb] */ |
1287 | ||
1288 | /* Just as for protected object subprograms, there are 2 categories | |
0963b4bd | 1289 | of subprograms created by the compiler for each entry. The first |
529cad9c PH |
1290 | one implements the actual entry code, and has a suffix following |
1291 | the convention above; the second one implements the barrier and | |
1292 | uses the same convention as above, except that the 'E' is replaced | |
1293 | by a 'B'. | |
1294 | ||
1295 | Just as above, we do not decode the name of barrier functions | |
1296 | to give the user a clue that the code he is debugging has been | |
1297 | internally generated. */ | |
1298 | ||
1299 | if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E' | |
1300 | && isdigit (encoded[i+2])) | |
1301 | { | |
1302 | int k = i + 3; | |
1303 | ||
1304 | while (k < len0 && isdigit (encoded[k])) | |
1305 | k++; | |
1306 | ||
1307 | if (k < len0 | |
1308 | && (encoded[k] == 'b' || encoded[k] == 's')) | |
1309 | { | |
1310 | k++; | |
1311 | /* Just as an extra precaution, make sure that if this | |
1312 | suffix is followed by anything else, it is a '_'. | |
1313 | Otherwise, we matched this sequence by accident. */ | |
1314 | if (k == len0 | |
1315 | || (k < len0 && encoded[k] == '_')) | |
1316 | i = k; | |
1317 | } | |
1318 | } | |
1319 | ||
1320 | /* Remove trailing "N" in [a-z0-9]+N__. The N is added by | |
1321 | the GNAT front-end in protected object subprograms. */ | |
1322 | ||
1323 | if (i < len0 + 3 | |
1324 | && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_') | |
1325 | { | |
1326 | /* Backtrack a bit up until we reach either the begining of | |
1327 | the encoded name, or "__". Make sure that we only find | |
1328 | digits or lowercase characters. */ | |
1329 | const char *ptr = encoded + i - 1; | |
1330 | ||
1331 | while (ptr >= encoded && is_lower_alphanum (ptr[0])) | |
1332 | ptr--; | |
1333 | if (ptr < encoded | |
1334 | || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_')) | |
1335 | i++; | |
1336 | } | |
1337 | ||
4c4b4cd2 PH |
1338 | if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1])) |
1339 | { | |
29480c32 JB |
1340 | /* This is a X[bn]* sequence not separated from the previous |
1341 | part of the name with a non-alpha-numeric character (in other | |
1342 | words, immediately following an alpha-numeric character), then | |
1343 | verify that it is placed at the end of the encoded name. If | |
1344 | not, then the encoding is not valid and we should abort the | |
1345 | decoding. Otherwise, just skip it, it is used in body-nested | |
1346 | package names. */ | |
4c4b4cd2 PH |
1347 | do |
1348 | i += 1; | |
1349 | while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n')); | |
1350 | if (i < len0) | |
1351 | goto Suppress; | |
1352 | } | |
cdc7bb92 | 1353 | else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_') |
4c4b4cd2 | 1354 | { |
29480c32 | 1355 | /* Replace '__' by '.'. */ |
4c4b4cd2 PH |
1356 | decoded[j] = '.'; |
1357 | at_start_name = 1; | |
1358 | i += 2; | |
1359 | j += 1; | |
1360 | } | |
14f9c5c9 | 1361 | else |
4c4b4cd2 | 1362 | { |
29480c32 JB |
1363 | /* It's a character part of the decoded name, so just copy it |
1364 | over. */ | |
4c4b4cd2 PH |
1365 | decoded[j] = encoded[i]; |
1366 | i += 1; | |
1367 | j += 1; | |
1368 | } | |
14f9c5c9 | 1369 | } |
4c4b4cd2 | 1370 | decoded[j] = '\000'; |
14f9c5c9 | 1371 | |
29480c32 JB |
1372 | /* Decoded names should never contain any uppercase character. |
1373 | Double-check this, and abort the decoding if we find one. */ | |
1374 | ||
4c4b4cd2 PH |
1375 | for (i = 0; decoded[i] != '\0'; i += 1) |
1376 | if (isupper (decoded[i]) || decoded[i] == ' ') | |
14f9c5c9 AS |
1377 | goto Suppress; |
1378 | ||
4c4b4cd2 PH |
1379 | if (strcmp (decoded, encoded) == 0) |
1380 | return encoded; | |
1381 | else | |
1382 | return decoded; | |
14f9c5c9 AS |
1383 | |
1384 | Suppress: | |
4c4b4cd2 PH |
1385 | GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3); |
1386 | decoded = decoding_buffer; | |
1387 | if (encoded[0] == '<') | |
1388 | strcpy (decoded, encoded); | |
14f9c5c9 | 1389 | else |
88c15c34 | 1390 | xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded); |
4c4b4cd2 PH |
1391 | return decoded; |
1392 | ||
1393 | } | |
1394 | ||
1395 | /* Table for keeping permanent unique copies of decoded names. Once | |
1396 | allocated, names in this table are never released. While this is a | |
1397 | storage leak, it should not be significant unless there are massive | |
1398 | changes in the set of decoded names in successive versions of a | |
1399 | symbol table loaded during a single session. */ | |
1400 | static struct htab *decoded_names_store; | |
1401 | ||
1402 | /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it | |
1403 | in the language-specific part of GSYMBOL, if it has not been | |
1404 | previously computed. Tries to save the decoded name in the same | |
1405 | obstack as GSYMBOL, if possible, and otherwise on the heap (so that, | |
1406 | in any case, the decoded symbol has a lifetime at least that of | |
0963b4bd | 1407 | GSYMBOL). |
4c4b4cd2 PH |
1408 | The GSYMBOL parameter is "mutable" in the C++ sense: logically |
1409 | const, but nevertheless modified to a semantically equivalent form | |
0963b4bd | 1410 | when a decoded name is cached in it. */ |
4c4b4cd2 | 1411 | |
45e6c716 | 1412 | const char * |
f85f34ed | 1413 | ada_decode_symbol (const struct general_symbol_info *arg) |
4c4b4cd2 | 1414 | { |
f85f34ed TT |
1415 | struct general_symbol_info *gsymbol = (struct general_symbol_info *) arg; |
1416 | const char **resultp = | |
1417 | &gsymbol->language_specific.mangled_lang.demangled_name; | |
5b4ee69b | 1418 | |
f85f34ed | 1419 | if (!gsymbol->ada_mangled) |
4c4b4cd2 PH |
1420 | { |
1421 | const char *decoded = ada_decode (gsymbol->name); | |
f85f34ed | 1422 | struct obstack *obstack = gsymbol->language_specific.obstack; |
5b4ee69b | 1423 | |
f85f34ed | 1424 | gsymbol->ada_mangled = 1; |
5b4ee69b | 1425 | |
f85f34ed TT |
1426 | if (obstack != NULL) |
1427 | *resultp = obstack_copy0 (obstack, decoded, strlen (decoded)); | |
1428 | else | |
76a01679 | 1429 | { |
f85f34ed TT |
1430 | /* Sometimes, we can't find a corresponding objfile, in |
1431 | which case, we put the result on the heap. Since we only | |
1432 | decode when needed, we hope this usually does not cause a | |
1433 | significant memory leak (FIXME). */ | |
1434 | ||
76a01679 JB |
1435 | char **slot = (char **) htab_find_slot (decoded_names_store, |
1436 | decoded, INSERT); | |
5b4ee69b | 1437 | |
76a01679 JB |
1438 | if (*slot == NULL) |
1439 | *slot = xstrdup (decoded); | |
1440 | *resultp = *slot; | |
1441 | } | |
4c4b4cd2 | 1442 | } |
14f9c5c9 | 1443 | |
4c4b4cd2 PH |
1444 | return *resultp; |
1445 | } | |
76a01679 | 1446 | |
2c0b251b | 1447 | static char * |
76a01679 | 1448 | ada_la_decode (const char *encoded, int options) |
4c4b4cd2 PH |
1449 | { |
1450 | return xstrdup (ada_decode (encoded)); | |
14f9c5c9 AS |
1451 | } |
1452 | ||
1453 | /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing | |
4c4b4cd2 PH |
1454 | suffixes that encode debugging information or leading _ada_ on |
1455 | SYM_NAME (see is_name_suffix commentary for the debugging | |
1456 | information that is ignored). If WILD, then NAME need only match a | |
1457 | suffix of SYM_NAME minus the same suffixes. Also returns 0 if | |
1458 | either argument is NULL. */ | |
14f9c5c9 | 1459 | |
2c0b251b | 1460 | static int |
40658b94 | 1461 | match_name (const char *sym_name, const char *name, int wild) |
14f9c5c9 AS |
1462 | { |
1463 | if (sym_name == NULL || name == NULL) | |
1464 | return 0; | |
1465 | else if (wild) | |
73589123 | 1466 | return wild_match (sym_name, name) == 0; |
d2e4a39e AS |
1467 | else |
1468 | { | |
1469 | int len_name = strlen (name); | |
5b4ee69b | 1470 | |
4c4b4cd2 PH |
1471 | return (strncmp (sym_name, name, len_name) == 0 |
1472 | && is_name_suffix (sym_name + len_name)) | |
61012eef | 1473 | || (startswith (sym_name, "_ada_") |
4c4b4cd2 PH |
1474 | && strncmp (sym_name + 5, name, len_name) == 0 |
1475 | && is_name_suffix (sym_name + len_name + 5)); | |
d2e4a39e | 1476 | } |
14f9c5c9 | 1477 | } |
14f9c5c9 | 1478 | \f |
d2e4a39e | 1479 | |
4c4b4cd2 | 1480 | /* Arrays */ |
14f9c5c9 | 1481 | |
28c85d6c JB |
1482 | /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure |
1483 | generated by the GNAT compiler to describe the index type used | |
1484 | for each dimension of an array, check whether it follows the latest | |
1485 | known encoding. If not, fix it up to conform to the latest encoding. | |
1486 | Otherwise, do nothing. This function also does nothing if | |
1487 | INDEX_DESC_TYPE is NULL. | |
1488 | ||
1489 | The GNAT encoding used to describle the array index type evolved a bit. | |
1490 | Initially, the information would be provided through the name of each | |
1491 | field of the structure type only, while the type of these fields was | |
1492 | described as unspecified and irrelevant. The debugger was then expected | |
1493 | to perform a global type lookup using the name of that field in order | |
1494 | to get access to the full index type description. Because these global | |
1495 | lookups can be very expensive, the encoding was later enhanced to make | |
1496 | the global lookup unnecessary by defining the field type as being | |
1497 | the full index type description. | |
1498 | ||
1499 | The purpose of this routine is to allow us to support older versions | |
1500 | of the compiler by detecting the use of the older encoding, and by | |
1501 | fixing up the INDEX_DESC_TYPE to follow the new one (at this point, | |
1502 | we essentially replace each field's meaningless type by the associated | |
1503 | index subtype). */ | |
1504 | ||
1505 | void | |
1506 | ada_fixup_array_indexes_type (struct type *index_desc_type) | |
1507 | { | |
1508 | int i; | |
1509 | ||
1510 | if (index_desc_type == NULL) | |
1511 | return; | |
1512 | gdb_assert (TYPE_NFIELDS (index_desc_type) > 0); | |
1513 | ||
1514 | /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient | |
1515 | to check one field only, no need to check them all). If not, return | |
1516 | now. | |
1517 | ||
1518 | If our INDEX_DESC_TYPE was generated using the older encoding, | |
1519 | the field type should be a meaningless integer type whose name | |
1520 | is not equal to the field name. */ | |
1521 | if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL | |
1522 | && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)), | |
1523 | TYPE_FIELD_NAME (index_desc_type, 0)) == 0) | |
1524 | return; | |
1525 | ||
1526 | /* Fixup each field of INDEX_DESC_TYPE. */ | |
1527 | for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++) | |
1528 | { | |
0d5cff50 | 1529 | const char *name = TYPE_FIELD_NAME (index_desc_type, i); |
28c85d6c JB |
1530 | struct type *raw_type = ada_check_typedef (ada_find_any_type (name)); |
1531 | ||
1532 | if (raw_type) | |
1533 | TYPE_FIELD_TYPE (index_desc_type, i) = raw_type; | |
1534 | } | |
1535 | } | |
1536 | ||
4c4b4cd2 | 1537 | /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */ |
14f9c5c9 | 1538 | |
d2e4a39e AS |
1539 | static char *bound_name[] = { |
1540 | "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3", | |
14f9c5c9 AS |
1541 | "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7" |
1542 | }; | |
1543 | ||
1544 | /* Maximum number of array dimensions we are prepared to handle. */ | |
1545 | ||
4c4b4cd2 | 1546 | #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *))) |
14f9c5c9 | 1547 | |
14f9c5c9 | 1548 | |
4c4b4cd2 PH |
1549 | /* The desc_* routines return primitive portions of array descriptors |
1550 | (fat pointers). */ | |
14f9c5c9 AS |
1551 | |
1552 | /* The descriptor or array type, if any, indicated by TYPE; removes | |
4c4b4cd2 PH |
1553 | level of indirection, if needed. */ |
1554 | ||
d2e4a39e AS |
1555 | static struct type * |
1556 | desc_base_type (struct type *type) | |
14f9c5c9 AS |
1557 | { |
1558 | if (type == NULL) | |
1559 | return NULL; | |
61ee279c | 1560 | type = ada_check_typedef (type); |
720d1a40 JB |
1561 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) |
1562 | type = ada_typedef_target_type (type); | |
1563 | ||
1265e4aa JB |
1564 | if (type != NULL |
1565 | && (TYPE_CODE (type) == TYPE_CODE_PTR | |
1566 | || TYPE_CODE (type) == TYPE_CODE_REF)) | |
61ee279c | 1567 | return ada_check_typedef (TYPE_TARGET_TYPE (type)); |
14f9c5c9 AS |
1568 | else |
1569 | return type; | |
1570 | } | |
1571 | ||
4c4b4cd2 PH |
1572 | /* True iff TYPE indicates a "thin" array pointer type. */ |
1573 | ||
14f9c5c9 | 1574 | static int |
d2e4a39e | 1575 | is_thin_pntr (struct type *type) |
14f9c5c9 | 1576 | { |
d2e4a39e | 1577 | return |
14f9c5c9 AS |
1578 | is_suffix (ada_type_name (desc_base_type (type)), "___XUT") |
1579 | || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE"); | |
1580 | } | |
1581 | ||
4c4b4cd2 PH |
1582 | /* The descriptor type for thin pointer type TYPE. */ |
1583 | ||
d2e4a39e AS |
1584 | static struct type * |
1585 | thin_descriptor_type (struct type *type) | |
14f9c5c9 | 1586 | { |
d2e4a39e | 1587 | struct type *base_type = desc_base_type (type); |
5b4ee69b | 1588 | |
14f9c5c9 AS |
1589 | if (base_type == NULL) |
1590 | return NULL; | |
1591 | if (is_suffix (ada_type_name (base_type), "___XVE")) | |
1592 | return base_type; | |
d2e4a39e | 1593 | else |
14f9c5c9 | 1594 | { |
d2e4a39e | 1595 | struct type *alt_type = ada_find_parallel_type (base_type, "___XVE"); |
5b4ee69b | 1596 | |
14f9c5c9 | 1597 | if (alt_type == NULL) |
4c4b4cd2 | 1598 | return base_type; |
14f9c5c9 | 1599 | else |
4c4b4cd2 | 1600 | return alt_type; |
14f9c5c9 AS |
1601 | } |
1602 | } | |
1603 | ||
4c4b4cd2 PH |
1604 | /* A pointer to the array data for thin-pointer value VAL. */ |
1605 | ||
d2e4a39e AS |
1606 | static struct value * |
1607 | thin_data_pntr (struct value *val) | |
14f9c5c9 | 1608 | { |
828292f2 | 1609 | struct type *type = ada_check_typedef (value_type (val)); |
556bdfd4 | 1610 | struct type *data_type = desc_data_target_type (thin_descriptor_type (type)); |
5b4ee69b | 1611 | |
556bdfd4 UW |
1612 | data_type = lookup_pointer_type (data_type); |
1613 | ||
14f9c5c9 | 1614 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
556bdfd4 | 1615 | return value_cast (data_type, value_copy (val)); |
d2e4a39e | 1616 | else |
42ae5230 | 1617 | return value_from_longest (data_type, value_address (val)); |
14f9c5c9 AS |
1618 | } |
1619 | ||
4c4b4cd2 PH |
1620 | /* True iff TYPE indicates a "thick" array pointer type. */ |
1621 | ||
14f9c5c9 | 1622 | static int |
d2e4a39e | 1623 | is_thick_pntr (struct type *type) |
14f9c5c9 AS |
1624 | { |
1625 | type = desc_base_type (type); | |
1626 | return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT | |
4c4b4cd2 | 1627 | && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL); |
14f9c5c9 AS |
1628 | } |
1629 | ||
4c4b4cd2 PH |
1630 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a |
1631 | pointer to one, the type of its bounds data; otherwise, NULL. */ | |
76a01679 | 1632 | |
d2e4a39e AS |
1633 | static struct type * |
1634 | desc_bounds_type (struct type *type) | |
14f9c5c9 | 1635 | { |
d2e4a39e | 1636 | struct type *r; |
14f9c5c9 AS |
1637 | |
1638 | type = desc_base_type (type); | |
1639 | ||
1640 | if (type == NULL) | |
1641 | return NULL; | |
1642 | else if (is_thin_pntr (type)) | |
1643 | { | |
1644 | type = thin_descriptor_type (type); | |
1645 | if (type == NULL) | |
4c4b4cd2 | 1646 | return NULL; |
14f9c5c9 AS |
1647 | r = lookup_struct_elt_type (type, "BOUNDS", 1); |
1648 | if (r != NULL) | |
61ee279c | 1649 | return ada_check_typedef (r); |
14f9c5c9 AS |
1650 | } |
1651 | else if (TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
1652 | { | |
1653 | r = lookup_struct_elt_type (type, "P_BOUNDS", 1); | |
1654 | if (r != NULL) | |
61ee279c | 1655 | return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r))); |
14f9c5c9 AS |
1656 | } |
1657 | return NULL; | |
1658 | } | |
1659 | ||
1660 | /* If ARR is an array descriptor (fat or thin pointer), or pointer to | |
4c4b4cd2 PH |
1661 | one, a pointer to its bounds data. Otherwise NULL. */ |
1662 | ||
d2e4a39e AS |
1663 | static struct value * |
1664 | desc_bounds (struct value *arr) | |
14f9c5c9 | 1665 | { |
df407dfe | 1666 | struct type *type = ada_check_typedef (value_type (arr)); |
5b4ee69b | 1667 | |
d2e4a39e | 1668 | if (is_thin_pntr (type)) |
14f9c5c9 | 1669 | { |
d2e4a39e | 1670 | struct type *bounds_type = |
4c4b4cd2 | 1671 | desc_bounds_type (thin_descriptor_type (type)); |
14f9c5c9 AS |
1672 | LONGEST addr; |
1673 | ||
4cdfadb1 | 1674 | if (bounds_type == NULL) |
323e0a4a | 1675 | error (_("Bad GNAT array descriptor")); |
14f9c5c9 AS |
1676 | |
1677 | /* NOTE: The following calculation is not really kosher, but | |
d2e4a39e | 1678 | since desc_type is an XVE-encoded type (and shouldn't be), |
4c4b4cd2 | 1679 | the correct calculation is a real pain. FIXME (and fix GCC). */ |
14f9c5c9 | 1680 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
4c4b4cd2 | 1681 | addr = value_as_long (arr); |
d2e4a39e | 1682 | else |
42ae5230 | 1683 | addr = value_address (arr); |
14f9c5c9 | 1684 | |
d2e4a39e | 1685 | return |
4c4b4cd2 PH |
1686 | value_from_longest (lookup_pointer_type (bounds_type), |
1687 | addr - TYPE_LENGTH (bounds_type)); | |
14f9c5c9 AS |
1688 | } |
1689 | ||
1690 | else if (is_thick_pntr (type)) | |
05e522ef JB |
1691 | { |
1692 | struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL, | |
1693 | _("Bad GNAT array descriptor")); | |
1694 | struct type *p_bounds_type = value_type (p_bounds); | |
1695 | ||
1696 | if (p_bounds_type | |
1697 | && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR) | |
1698 | { | |
1699 | struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type); | |
1700 | ||
1701 | if (TYPE_STUB (target_type)) | |
1702 | p_bounds = value_cast (lookup_pointer_type | |
1703 | (ada_check_typedef (target_type)), | |
1704 | p_bounds); | |
1705 | } | |
1706 | else | |
1707 | error (_("Bad GNAT array descriptor")); | |
1708 | ||
1709 | return p_bounds; | |
1710 | } | |
14f9c5c9 AS |
1711 | else |
1712 | return NULL; | |
1713 | } | |
1714 | ||
4c4b4cd2 PH |
1715 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit |
1716 | position of the field containing the address of the bounds data. */ | |
1717 | ||
14f9c5c9 | 1718 | static int |
d2e4a39e | 1719 | fat_pntr_bounds_bitpos (struct type *type) |
14f9c5c9 AS |
1720 | { |
1721 | return TYPE_FIELD_BITPOS (desc_base_type (type), 1); | |
1722 | } | |
1723 | ||
1724 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1725 | size of the field containing the address of the bounds data. */ |
1726 | ||
14f9c5c9 | 1727 | static int |
d2e4a39e | 1728 | fat_pntr_bounds_bitsize (struct type *type) |
14f9c5c9 AS |
1729 | { |
1730 | type = desc_base_type (type); | |
1731 | ||
d2e4a39e | 1732 | if (TYPE_FIELD_BITSIZE (type, 1) > 0) |
14f9c5c9 AS |
1733 | return TYPE_FIELD_BITSIZE (type, 1); |
1734 | else | |
61ee279c | 1735 | return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1))); |
14f9c5c9 AS |
1736 | } |
1737 | ||
4c4b4cd2 | 1738 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a |
556bdfd4 UW |
1739 | pointer to one, the type of its array data (a array-with-no-bounds type); |
1740 | otherwise, NULL. Use ada_type_of_array to get an array type with bounds | |
1741 | data. */ | |
4c4b4cd2 | 1742 | |
d2e4a39e | 1743 | static struct type * |
556bdfd4 | 1744 | desc_data_target_type (struct type *type) |
14f9c5c9 AS |
1745 | { |
1746 | type = desc_base_type (type); | |
1747 | ||
4c4b4cd2 | 1748 | /* NOTE: The following is bogus; see comment in desc_bounds. */ |
14f9c5c9 | 1749 | if (is_thin_pntr (type)) |
556bdfd4 | 1750 | return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)); |
14f9c5c9 | 1751 | else if (is_thick_pntr (type)) |
556bdfd4 UW |
1752 | { |
1753 | struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1); | |
1754 | ||
1755 | if (data_type | |
1756 | && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR) | |
05e522ef | 1757 | return ada_check_typedef (TYPE_TARGET_TYPE (data_type)); |
556bdfd4 UW |
1758 | } |
1759 | ||
1760 | return NULL; | |
14f9c5c9 AS |
1761 | } |
1762 | ||
1763 | /* If ARR is an array descriptor (fat or thin pointer), a pointer to | |
1764 | its array data. */ | |
4c4b4cd2 | 1765 | |
d2e4a39e AS |
1766 | static struct value * |
1767 | desc_data (struct value *arr) | |
14f9c5c9 | 1768 | { |
df407dfe | 1769 | struct type *type = value_type (arr); |
5b4ee69b | 1770 | |
14f9c5c9 AS |
1771 | if (is_thin_pntr (type)) |
1772 | return thin_data_pntr (arr); | |
1773 | else if (is_thick_pntr (type)) | |
d2e4a39e | 1774 | return value_struct_elt (&arr, NULL, "P_ARRAY", NULL, |
323e0a4a | 1775 | _("Bad GNAT array descriptor")); |
14f9c5c9 AS |
1776 | else |
1777 | return NULL; | |
1778 | } | |
1779 | ||
1780 | ||
1781 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1782 | position of the field containing the address of the data. */ |
1783 | ||
14f9c5c9 | 1784 | static int |
d2e4a39e | 1785 | fat_pntr_data_bitpos (struct type *type) |
14f9c5c9 AS |
1786 | { |
1787 | return TYPE_FIELD_BITPOS (desc_base_type (type), 0); | |
1788 | } | |
1789 | ||
1790 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1791 | size of the field containing the address of the data. */ |
1792 | ||
14f9c5c9 | 1793 | static int |
d2e4a39e | 1794 | fat_pntr_data_bitsize (struct type *type) |
14f9c5c9 AS |
1795 | { |
1796 | type = desc_base_type (type); | |
1797 | ||
1798 | if (TYPE_FIELD_BITSIZE (type, 0) > 0) | |
1799 | return TYPE_FIELD_BITSIZE (type, 0); | |
d2e4a39e | 1800 | else |
14f9c5c9 AS |
1801 | return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)); |
1802 | } | |
1803 | ||
4c4b4cd2 | 1804 | /* If BOUNDS is an array-bounds structure (or pointer to one), return |
14f9c5c9 | 1805 | the Ith lower bound stored in it, if WHICH is 0, and the Ith upper |
4c4b4cd2 PH |
1806 | bound, if WHICH is 1. The first bound is I=1. */ |
1807 | ||
d2e4a39e AS |
1808 | static struct value * |
1809 | desc_one_bound (struct value *bounds, int i, int which) | |
14f9c5c9 | 1810 | { |
d2e4a39e | 1811 | return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL, |
323e0a4a | 1812 | _("Bad GNAT array descriptor bounds")); |
14f9c5c9 AS |
1813 | } |
1814 | ||
1815 | /* If BOUNDS is an array-bounds structure type, return the bit position | |
1816 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
4c4b4cd2 PH |
1817 | bound, if WHICH is 1. The first bound is I=1. */ |
1818 | ||
14f9c5c9 | 1819 | static int |
d2e4a39e | 1820 | desc_bound_bitpos (struct type *type, int i, int which) |
14f9c5c9 | 1821 | { |
d2e4a39e | 1822 | return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2); |
14f9c5c9 AS |
1823 | } |
1824 | ||
1825 | /* If BOUNDS is an array-bounds structure type, return the bit field size | |
1826 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
4c4b4cd2 PH |
1827 | bound, if WHICH is 1. The first bound is I=1. */ |
1828 | ||
76a01679 | 1829 | static int |
d2e4a39e | 1830 | desc_bound_bitsize (struct type *type, int i, int which) |
14f9c5c9 AS |
1831 | { |
1832 | type = desc_base_type (type); | |
1833 | ||
d2e4a39e AS |
1834 | if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0) |
1835 | return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2); | |
1836 | else | |
1837 | return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2)); | |
14f9c5c9 AS |
1838 | } |
1839 | ||
1840 | /* If TYPE is the type of an array-bounds structure, the type of its | |
4c4b4cd2 PH |
1841 | Ith bound (numbering from 1). Otherwise, NULL. */ |
1842 | ||
d2e4a39e AS |
1843 | static struct type * |
1844 | desc_index_type (struct type *type, int i) | |
14f9c5c9 AS |
1845 | { |
1846 | type = desc_base_type (type); | |
1847 | ||
1848 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
d2e4a39e AS |
1849 | return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1); |
1850 | else | |
14f9c5c9 AS |
1851 | return NULL; |
1852 | } | |
1853 | ||
4c4b4cd2 PH |
1854 | /* The number of index positions in the array-bounds type TYPE. |
1855 | Return 0 if TYPE is NULL. */ | |
1856 | ||
14f9c5c9 | 1857 | static int |
d2e4a39e | 1858 | desc_arity (struct type *type) |
14f9c5c9 AS |
1859 | { |
1860 | type = desc_base_type (type); | |
1861 | ||
1862 | if (type != NULL) | |
1863 | return TYPE_NFIELDS (type) / 2; | |
1864 | return 0; | |
1865 | } | |
1866 | ||
4c4b4cd2 PH |
1867 | /* Non-zero iff TYPE is a simple array type (not a pointer to one) or |
1868 | an array descriptor type (representing an unconstrained array | |
1869 | type). */ | |
1870 | ||
76a01679 JB |
1871 | static int |
1872 | ada_is_direct_array_type (struct type *type) | |
4c4b4cd2 PH |
1873 | { |
1874 | if (type == NULL) | |
1875 | return 0; | |
61ee279c | 1876 | type = ada_check_typedef (type); |
4c4b4cd2 | 1877 | return (TYPE_CODE (type) == TYPE_CODE_ARRAY |
76a01679 | 1878 | || ada_is_array_descriptor_type (type)); |
4c4b4cd2 PH |
1879 | } |
1880 | ||
52ce6436 | 1881 | /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer |
0963b4bd | 1882 | * to one. */ |
52ce6436 | 1883 | |
2c0b251b | 1884 | static int |
52ce6436 PH |
1885 | ada_is_array_type (struct type *type) |
1886 | { | |
1887 | while (type != NULL | |
1888 | && (TYPE_CODE (type) == TYPE_CODE_PTR | |
1889 | || TYPE_CODE (type) == TYPE_CODE_REF)) | |
1890 | type = TYPE_TARGET_TYPE (type); | |
1891 | return ada_is_direct_array_type (type); | |
1892 | } | |
1893 | ||
4c4b4cd2 | 1894 | /* Non-zero iff TYPE is a simple array type or pointer to one. */ |
14f9c5c9 | 1895 | |
14f9c5c9 | 1896 | int |
4c4b4cd2 | 1897 | ada_is_simple_array_type (struct type *type) |
14f9c5c9 AS |
1898 | { |
1899 | if (type == NULL) | |
1900 | return 0; | |
61ee279c | 1901 | type = ada_check_typedef (type); |
14f9c5c9 | 1902 | return (TYPE_CODE (type) == TYPE_CODE_ARRAY |
4c4b4cd2 | 1903 | || (TYPE_CODE (type) == TYPE_CODE_PTR |
b0dd7688 JB |
1904 | && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))) |
1905 | == TYPE_CODE_ARRAY)); | |
14f9c5c9 AS |
1906 | } |
1907 | ||
4c4b4cd2 PH |
1908 | /* Non-zero iff TYPE belongs to a GNAT array descriptor. */ |
1909 | ||
14f9c5c9 | 1910 | int |
4c4b4cd2 | 1911 | ada_is_array_descriptor_type (struct type *type) |
14f9c5c9 | 1912 | { |
556bdfd4 | 1913 | struct type *data_type = desc_data_target_type (type); |
14f9c5c9 AS |
1914 | |
1915 | if (type == NULL) | |
1916 | return 0; | |
61ee279c | 1917 | type = ada_check_typedef (type); |
556bdfd4 UW |
1918 | return (data_type != NULL |
1919 | && TYPE_CODE (data_type) == TYPE_CODE_ARRAY | |
1920 | && desc_arity (desc_bounds_type (type)) > 0); | |
14f9c5c9 AS |
1921 | } |
1922 | ||
1923 | /* Non-zero iff type is a partially mal-formed GNAT array | |
4c4b4cd2 | 1924 | descriptor. FIXME: This is to compensate for some problems with |
14f9c5c9 | 1925 | debugging output from GNAT. Re-examine periodically to see if it |
4c4b4cd2 PH |
1926 | is still needed. */ |
1927 | ||
14f9c5c9 | 1928 | int |
ebf56fd3 | 1929 | ada_is_bogus_array_descriptor (struct type *type) |
14f9c5c9 | 1930 | { |
d2e4a39e | 1931 | return |
14f9c5c9 AS |
1932 | type != NULL |
1933 | && TYPE_CODE (type) == TYPE_CODE_STRUCT | |
1934 | && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL | |
4c4b4cd2 PH |
1935 | || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL) |
1936 | && !ada_is_array_descriptor_type (type); | |
14f9c5c9 AS |
1937 | } |
1938 | ||
1939 | ||
4c4b4cd2 | 1940 | /* If ARR has a record type in the form of a standard GNAT array descriptor, |
14f9c5c9 | 1941 | (fat pointer) returns the type of the array data described---specifically, |
4c4b4cd2 | 1942 | a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled |
14f9c5c9 | 1943 | in from the descriptor; otherwise, they are left unspecified. If |
4c4b4cd2 PH |
1944 | the ARR denotes a null array descriptor and BOUNDS is non-zero, |
1945 | returns NULL. The result is simply the type of ARR if ARR is not | |
14f9c5c9 | 1946 | a descriptor. */ |
d2e4a39e AS |
1947 | struct type * |
1948 | ada_type_of_array (struct value *arr, int bounds) | |
14f9c5c9 | 1949 | { |
ad82864c JB |
1950 | if (ada_is_constrained_packed_array_type (value_type (arr))) |
1951 | return decode_constrained_packed_array_type (value_type (arr)); | |
14f9c5c9 | 1952 | |
df407dfe AC |
1953 | if (!ada_is_array_descriptor_type (value_type (arr))) |
1954 | return value_type (arr); | |
d2e4a39e AS |
1955 | |
1956 | if (!bounds) | |
ad82864c JB |
1957 | { |
1958 | struct type *array_type = | |
1959 | ada_check_typedef (desc_data_target_type (value_type (arr))); | |
1960 | ||
1961 | if (ada_is_unconstrained_packed_array_type (value_type (arr))) | |
1962 | TYPE_FIELD_BITSIZE (array_type, 0) = | |
1963 | decode_packed_array_bitsize (value_type (arr)); | |
1964 | ||
1965 | return array_type; | |
1966 | } | |
14f9c5c9 AS |
1967 | else |
1968 | { | |
d2e4a39e | 1969 | struct type *elt_type; |
14f9c5c9 | 1970 | int arity; |
d2e4a39e | 1971 | struct value *descriptor; |
14f9c5c9 | 1972 | |
df407dfe AC |
1973 | elt_type = ada_array_element_type (value_type (arr), -1); |
1974 | arity = ada_array_arity (value_type (arr)); | |
14f9c5c9 | 1975 | |
d2e4a39e | 1976 | if (elt_type == NULL || arity == 0) |
df407dfe | 1977 | return ada_check_typedef (value_type (arr)); |
14f9c5c9 AS |
1978 | |
1979 | descriptor = desc_bounds (arr); | |
d2e4a39e | 1980 | if (value_as_long (descriptor) == 0) |
4c4b4cd2 | 1981 | return NULL; |
d2e4a39e | 1982 | while (arity > 0) |
4c4b4cd2 | 1983 | { |
e9bb382b UW |
1984 | struct type *range_type = alloc_type_copy (value_type (arr)); |
1985 | struct type *array_type = alloc_type_copy (value_type (arr)); | |
4c4b4cd2 PH |
1986 | struct value *low = desc_one_bound (descriptor, arity, 0); |
1987 | struct value *high = desc_one_bound (descriptor, arity, 1); | |
4c4b4cd2 | 1988 | |
5b4ee69b | 1989 | arity -= 1; |
0c9c3474 SA |
1990 | create_static_range_type (range_type, value_type (low), |
1991 | longest_to_int (value_as_long (low)), | |
1992 | longest_to_int (value_as_long (high))); | |
4c4b4cd2 | 1993 | elt_type = create_array_type (array_type, elt_type, range_type); |
ad82864c JB |
1994 | |
1995 | if (ada_is_unconstrained_packed_array_type (value_type (arr))) | |
e67ad678 JB |
1996 | { |
1997 | /* We need to store the element packed bitsize, as well as | |
1998 | recompute the array size, because it was previously | |
1999 | computed based on the unpacked element size. */ | |
2000 | LONGEST lo = value_as_long (low); | |
2001 | LONGEST hi = value_as_long (high); | |
2002 | ||
2003 | TYPE_FIELD_BITSIZE (elt_type, 0) = | |
2004 | decode_packed_array_bitsize (value_type (arr)); | |
2005 | /* If the array has no element, then the size is already | |
2006 | zero, and does not need to be recomputed. */ | |
2007 | if (lo < hi) | |
2008 | { | |
2009 | int array_bitsize = | |
2010 | (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0); | |
2011 | ||
2012 | TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8; | |
2013 | } | |
2014 | } | |
4c4b4cd2 | 2015 | } |
14f9c5c9 AS |
2016 | |
2017 | return lookup_pointer_type (elt_type); | |
2018 | } | |
2019 | } | |
2020 | ||
2021 | /* If ARR does not represent an array, returns ARR unchanged. | |
4c4b4cd2 PH |
2022 | Otherwise, returns either a standard GDB array with bounds set |
2023 | appropriately or, if ARR is a non-null fat pointer, a pointer to a standard | |
2024 | GDB array. Returns NULL if ARR is a null fat pointer. */ | |
2025 | ||
d2e4a39e AS |
2026 | struct value * |
2027 | ada_coerce_to_simple_array_ptr (struct value *arr) | |
14f9c5c9 | 2028 | { |
df407dfe | 2029 | if (ada_is_array_descriptor_type (value_type (arr))) |
14f9c5c9 | 2030 | { |
d2e4a39e | 2031 | struct type *arrType = ada_type_of_array (arr, 1); |
5b4ee69b | 2032 | |
14f9c5c9 | 2033 | if (arrType == NULL) |
4c4b4cd2 | 2034 | return NULL; |
14f9c5c9 AS |
2035 | return value_cast (arrType, value_copy (desc_data (arr))); |
2036 | } | |
ad82864c JB |
2037 | else if (ada_is_constrained_packed_array_type (value_type (arr))) |
2038 | return decode_constrained_packed_array (arr); | |
14f9c5c9 AS |
2039 | else |
2040 | return arr; | |
2041 | } | |
2042 | ||
2043 | /* If ARR does not represent an array, returns ARR unchanged. | |
2044 | Otherwise, returns a standard GDB array describing ARR (which may | |
4c4b4cd2 PH |
2045 | be ARR itself if it already is in the proper form). */ |
2046 | ||
720d1a40 | 2047 | struct value * |
d2e4a39e | 2048 | ada_coerce_to_simple_array (struct value *arr) |
14f9c5c9 | 2049 | { |
df407dfe | 2050 | if (ada_is_array_descriptor_type (value_type (arr))) |
14f9c5c9 | 2051 | { |
d2e4a39e | 2052 | struct value *arrVal = ada_coerce_to_simple_array_ptr (arr); |
5b4ee69b | 2053 | |
14f9c5c9 | 2054 | if (arrVal == NULL) |
323e0a4a | 2055 | error (_("Bounds unavailable for null array pointer.")); |
c1b5a1a6 | 2056 | ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal))); |
14f9c5c9 AS |
2057 | return value_ind (arrVal); |
2058 | } | |
ad82864c JB |
2059 | else if (ada_is_constrained_packed_array_type (value_type (arr))) |
2060 | return decode_constrained_packed_array (arr); | |
d2e4a39e | 2061 | else |
14f9c5c9 AS |
2062 | return arr; |
2063 | } | |
2064 | ||
2065 | /* If TYPE represents a GNAT array type, return it translated to an | |
2066 | ordinary GDB array type (possibly with BITSIZE fields indicating | |
4c4b4cd2 PH |
2067 | packing). For other types, is the identity. */ |
2068 | ||
d2e4a39e AS |
2069 | struct type * |
2070 | ada_coerce_to_simple_array_type (struct type *type) | |
14f9c5c9 | 2071 | { |
ad82864c JB |
2072 | if (ada_is_constrained_packed_array_type (type)) |
2073 | return decode_constrained_packed_array_type (type); | |
17280b9f UW |
2074 | |
2075 | if (ada_is_array_descriptor_type (type)) | |
556bdfd4 | 2076 | return ada_check_typedef (desc_data_target_type (type)); |
17280b9f UW |
2077 | |
2078 | return type; | |
14f9c5c9 AS |
2079 | } |
2080 | ||
4c4b4cd2 PH |
2081 | /* Non-zero iff TYPE represents a standard GNAT packed-array type. */ |
2082 | ||
ad82864c JB |
2083 | static int |
2084 | ada_is_packed_array_type (struct type *type) | |
14f9c5c9 AS |
2085 | { |
2086 | if (type == NULL) | |
2087 | return 0; | |
4c4b4cd2 | 2088 | type = desc_base_type (type); |
61ee279c | 2089 | type = ada_check_typedef (type); |
d2e4a39e | 2090 | return |
14f9c5c9 AS |
2091 | ada_type_name (type) != NULL |
2092 | && strstr (ada_type_name (type), "___XP") != NULL; | |
2093 | } | |
2094 | ||
ad82864c JB |
2095 | /* Non-zero iff TYPE represents a standard GNAT constrained |
2096 | packed-array type. */ | |
2097 | ||
2098 | int | |
2099 | ada_is_constrained_packed_array_type (struct type *type) | |
2100 | { | |
2101 | return ada_is_packed_array_type (type) | |
2102 | && !ada_is_array_descriptor_type (type); | |
2103 | } | |
2104 | ||
2105 | /* Non-zero iff TYPE represents an array descriptor for a | |
2106 | unconstrained packed-array type. */ | |
2107 | ||
2108 | static int | |
2109 | ada_is_unconstrained_packed_array_type (struct type *type) | |
2110 | { | |
2111 | return ada_is_packed_array_type (type) | |
2112 | && ada_is_array_descriptor_type (type); | |
2113 | } | |
2114 | ||
2115 | /* Given that TYPE encodes a packed array type (constrained or unconstrained), | |
2116 | return the size of its elements in bits. */ | |
2117 | ||
2118 | static long | |
2119 | decode_packed_array_bitsize (struct type *type) | |
2120 | { | |
0d5cff50 DE |
2121 | const char *raw_name; |
2122 | const char *tail; | |
ad82864c JB |
2123 | long bits; |
2124 | ||
720d1a40 JB |
2125 | /* Access to arrays implemented as fat pointers are encoded as a typedef |
2126 | of the fat pointer type. We need the name of the fat pointer type | |
2127 | to do the decoding, so strip the typedef layer. */ | |
2128 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
2129 | type = ada_typedef_target_type (type); | |
2130 | ||
2131 | raw_name = ada_type_name (ada_check_typedef (type)); | |
ad82864c JB |
2132 | if (!raw_name) |
2133 | raw_name = ada_type_name (desc_base_type (type)); | |
2134 | ||
2135 | if (!raw_name) | |
2136 | return 0; | |
2137 | ||
2138 | tail = strstr (raw_name, "___XP"); | |
720d1a40 | 2139 | gdb_assert (tail != NULL); |
ad82864c JB |
2140 | |
2141 | if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1) | |
2142 | { | |
2143 | lim_warning | |
2144 | (_("could not understand bit size information on packed array")); | |
2145 | return 0; | |
2146 | } | |
2147 | ||
2148 | return bits; | |
2149 | } | |
2150 | ||
14f9c5c9 AS |
2151 | /* Given that TYPE is a standard GDB array type with all bounds filled |
2152 | in, and that the element size of its ultimate scalar constituents | |
2153 | (that is, either its elements, or, if it is an array of arrays, its | |
2154 | elements' elements, etc.) is *ELT_BITS, return an identical type, | |
2155 | but with the bit sizes of its elements (and those of any | |
2156 | constituent arrays) recorded in the BITSIZE components of its | |
4c4b4cd2 | 2157 | TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size |
4a46959e JB |
2158 | in bits. |
2159 | ||
2160 | Note that, for arrays whose index type has an XA encoding where | |
2161 | a bound references a record discriminant, getting that discriminant, | |
2162 | and therefore the actual value of that bound, is not possible | |
2163 | because none of the given parameters gives us access to the record. | |
2164 | This function assumes that it is OK in the context where it is being | |
2165 | used to return an array whose bounds are still dynamic and where | |
2166 | the length is arbitrary. */ | |
4c4b4cd2 | 2167 | |
d2e4a39e | 2168 | static struct type * |
ad82864c | 2169 | constrained_packed_array_type (struct type *type, long *elt_bits) |
14f9c5c9 | 2170 | { |
d2e4a39e AS |
2171 | struct type *new_elt_type; |
2172 | struct type *new_type; | |
99b1c762 JB |
2173 | struct type *index_type_desc; |
2174 | struct type *index_type; | |
14f9c5c9 AS |
2175 | LONGEST low_bound, high_bound; |
2176 | ||
61ee279c | 2177 | type = ada_check_typedef (type); |
14f9c5c9 AS |
2178 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY) |
2179 | return type; | |
2180 | ||
99b1c762 JB |
2181 | index_type_desc = ada_find_parallel_type (type, "___XA"); |
2182 | if (index_type_desc) | |
2183 | index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0), | |
2184 | NULL); | |
2185 | else | |
2186 | index_type = TYPE_INDEX_TYPE (type); | |
2187 | ||
e9bb382b | 2188 | new_type = alloc_type_copy (type); |
ad82864c JB |
2189 | new_elt_type = |
2190 | constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)), | |
2191 | elt_bits); | |
99b1c762 | 2192 | create_array_type (new_type, new_elt_type, index_type); |
14f9c5c9 AS |
2193 | TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits; |
2194 | TYPE_NAME (new_type) = ada_type_name (type); | |
2195 | ||
4a46959e JB |
2196 | if ((TYPE_CODE (check_typedef (index_type)) == TYPE_CODE_RANGE |
2197 | && is_dynamic_type (check_typedef (index_type))) | |
2198 | || get_discrete_bounds (index_type, &low_bound, &high_bound) < 0) | |
14f9c5c9 AS |
2199 | low_bound = high_bound = 0; |
2200 | if (high_bound < low_bound) | |
2201 | *elt_bits = TYPE_LENGTH (new_type) = 0; | |
d2e4a39e | 2202 | else |
14f9c5c9 AS |
2203 | { |
2204 | *elt_bits *= (high_bound - low_bound + 1); | |
d2e4a39e | 2205 | TYPE_LENGTH (new_type) = |
4c4b4cd2 | 2206 | (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; |
14f9c5c9 AS |
2207 | } |
2208 | ||
876cecd0 | 2209 | TYPE_FIXED_INSTANCE (new_type) = 1; |
14f9c5c9 AS |
2210 | return new_type; |
2211 | } | |
2212 | ||
ad82864c JB |
2213 | /* The array type encoded by TYPE, where |
2214 | ada_is_constrained_packed_array_type (TYPE). */ | |
4c4b4cd2 | 2215 | |
d2e4a39e | 2216 | static struct type * |
ad82864c | 2217 | decode_constrained_packed_array_type (struct type *type) |
d2e4a39e | 2218 | { |
0d5cff50 | 2219 | const char *raw_name = ada_type_name (ada_check_typedef (type)); |
727e3d2e | 2220 | char *name; |
0d5cff50 | 2221 | const char *tail; |
d2e4a39e | 2222 | struct type *shadow_type; |
14f9c5c9 | 2223 | long bits; |
14f9c5c9 | 2224 | |
727e3d2e JB |
2225 | if (!raw_name) |
2226 | raw_name = ada_type_name (desc_base_type (type)); | |
2227 | ||
2228 | if (!raw_name) | |
2229 | return NULL; | |
2230 | ||
2231 | name = (char *) alloca (strlen (raw_name) + 1); | |
2232 | tail = strstr (raw_name, "___XP"); | |
4c4b4cd2 PH |
2233 | type = desc_base_type (type); |
2234 | ||
14f9c5c9 AS |
2235 | memcpy (name, raw_name, tail - raw_name); |
2236 | name[tail - raw_name] = '\000'; | |
2237 | ||
b4ba55a1 JB |
2238 | shadow_type = ada_find_parallel_type_with_name (type, name); |
2239 | ||
2240 | if (shadow_type == NULL) | |
14f9c5c9 | 2241 | { |
323e0a4a | 2242 | lim_warning (_("could not find bounds information on packed array")); |
14f9c5c9 AS |
2243 | return NULL; |
2244 | } | |
f168693b | 2245 | shadow_type = check_typedef (shadow_type); |
14f9c5c9 AS |
2246 | |
2247 | if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY) | |
2248 | { | |
0963b4bd MS |
2249 | lim_warning (_("could not understand bounds " |
2250 | "information on packed array")); | |
14f9c5c9 AS |
2251 | return NULL; |
2252 | } | |
d2e4a39e | 2253 | |
ad82864c JB |
2254 | bits = decode_packed_array_bitsize (type); |
2255 | return constrained_packed_array_type (shadow_type, &bits); | |
14f9c5c9 AS |
2256 | } |
2257 | ||
ad82864c JB |
2258 | /* Given that ARR is a struct value *indicating a GNAT constrained packed |
2259 | array, returns a simple array that denotes that array. Its type is a | |
14f9c5c9 AS |
2260 | standard GDB array type except that the BITSIZEs of the array |
2261 | target types are set to the number of bits in each element, and the | |
4c4b4cd2 | 2262 | type length is set appropriately. */ |
14f9c5c9 | 2263 | |
d2e4a39e | 2264 | static struct value * |
ad82864c | 2265 | decode_constrained_packed_array (struct value *arr) |
14f9c5c9 | 2266 | { |
4c4b4cd2 | 2267 | struct type *type; |
14f9c5c9 | 2268 | |
11aa919a PMR |
2269 | /* If our value is a pointer, then dereference it. Likewise if |
2270 | the value is a reference. Make sure that this operation does not | |
2271 | cause the target type to be fixed, as this would indirectly cause | |
2272 | this array to be decoded. The rest of the routine assumes that | |
2273 | the array hasn't been decoded yet, so we use the basic "coerce_ref" | |
2274 | and "value_ind" routines to perform the dereferencing, as opposed | |
2275 | to using "ada_coerce_ref" or "ada_value_ind". */ | |
2276 | arr = coerce_ref (arr); | |
828292f2 | 2277 | if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR) |
284614f0 | 2278 | arr = value_ind (arr); |
4c4b4cd2 | 2279 | |
ad82864c | 2280 | type = decode_constrained_packed_array_type (value_type (arr)); |
14f9c5c9 AS |
2281 | if (type == NULL) |
2282 | { | |
323e0a4a | 2283 | error (_("can't unpack array")); |
14f9c5c9 AS |
2284 | return NULL; |
2285 | } | |
61ee279c | 2286 | |
50810684 | 2287 | if (gdbarch_bits_big_endian (get_type_arch (value_type (arr))) |
32c9a795 | 2288 | && ada_is_modular_type (value_type (arr))) |
61ee279c PH |
2289 | { |
2290 | /* This is a (right-justified) modular type representing a packed | |
2291 | array with no wrapper. In order to interpret the value through | |
2292 | the (left-justified) packed array type we just built, we must | |
2293 | first left-justify it. */ | |
2294 | int bit_size, bit_pos; | |
2295 | ULONGEST mod; | |
2296 | ||
df407dfe | 2297 | mod = ada_modulus (value_type (arr)) - 1; |
61ee279c PH |
2298 | bit_size = 0; |
2299 | while (mod > 0) | |
2300 | { | |
2301 | bit_size += 1; | |
2302 | mod >>= 1; | |
2303 | } | |
df407dfe | 2304 | bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size; |
61ee279c PH |
2305 | arr = ada_value_primitive_packed_val (arr, NULL, |
2306 | bit_pos / HOST_CHAR_BIT, | |
2307 | bit_pos % HOST_CHAR_BIT, | |
2308 | bit_size, | |
2309 | type); | |
2310 | } | |
2311 | ||
4c4b4cd2 | 2312 | return coerce_unspec_val_to_type (arr, type); |
14f9c5c9 AS |
2313 | } |
2314 | ||
2315 | ||
2316 | /* The value of the element of packed array ARR at the ARITY indices | |
4c4b4cd2 | 2317 | given in IND. ARR must be a simple array. */ |
14f9c5c9 | 2318 | |
d2e4a39e AS |
2319 | static struct value * |
2320 | value_subscript_packed (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
2321 | { |
2322 | int i; | |
2323 | int bits, elt_off, bit_off; | |
2324 | long elt_total_bit_offset; | |
d2e4a39e AS |
2325 | struct type *elt_type; |
2326 | struct value *v; | |
14f9c5c9 AS |
2327 | |
2328 | bits = 0; | |
2329 | elt_total_bit_offset = 0; | |
df407dfe | 2330 | elt_type = ada_check_typedef (value_type (arr)); |
d2e4a39e | 2331 | for (i = 0; i < arity; i += 1) |
14f9c5c9 | 2332 | { |
d2e4a39e | 2333 | if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY |
4c4b4cd2 PH |
2334 | || TYPE_FIELD_BITSIZE (elt_type, 0) == 0) |
2335 | error | |
0963b4bd MS |
2336 | (_("attempt to do packed indexing of " |
2337 | "something other than a packed array")); | |
14f9c5c9 | 2338 | else |
4c4b4cd2 PH |
2339 | { |
2340 | struct type *range_type = TYPE_INDEX_TYPE (elt_type); | |
2341 | LONGEST lowerbound, upperbound; | |
2342 | LONGEST idx; | |
2343 | ||
2344 | if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0) | |
2345 | { | |
323e0a4a | 2346 | lim_warning (_("don't know bounds of array")); |
4c4b4cd2 PH |
2347 | lowerbound = upperbound = 0; |
2348 | } | |
2349 | ||
3cb382c9 | 2350 | idx = pos_atr (ind[i]); |
4c4b4cd2 | 2351 | if (idx < lowerbound || idx > upperbound) |
0963b4bd MS |
2352 | lim_warning (_("packed array index %ld out of bounds"), |
2353 | (long) idx); | |
4c4b4cd2 PH |
2354 | bits = TYPE_FIELD_BITSIZE (elt_type, 0); |
2355 | elt_total_bit_offset += (idx - lowerbound) * bits; | |
61ee279c | 2356 | elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type)); |
4c4b4cd2 | 2357 | } |
14f9c5c9 AS |
2358 | } |
2359 | elt_off = elt_total_bit_offset / HOST_CHAR_BIT; | |
2360 | bit_off = elt_total_bit_offset % HOST_CHAR_BIT; | |
d2e4a39e AS |
2361 | |
2362 | v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off, | |
4c4b4cd2 | 2363 | bits, elt_type); |
14f9c5c9 AS |
2364 | return v; |
2365 | } | |
2366 | ||
4c4b4cd2 | 2367 | /* Non-zero iff TYPE includes negative integer values. */ |
14f9c5c9 AS |
2368 | |
2369 | static int | |
d2e4a39e | 2370 | has_negatives (struct type *type) |
14f9c5c9 | 2371 | { |
d2e4a39e AS |
2372 | switch (TYPE_CODE (type)) |
2373 | { | |
2374 | default: | |
2375 | return 0; | |
2376 | case TYPE_CODE_INT: | |
2377 | return !TYPE_UNSIGNED (type); | |
2378 | case TYPE_CODE_RANGE: | |
2379 | return TYPE_LOW_BOUND (type) < 0; | |
2380 | } | |
14f9c5c9 | 2381 | } |
d2e4a39e | 2382 | |
14f9c5c9 AS |
2383 | |
2384 | /* Create a new value of type TYPE from the contents of OBJ starting | |
2385 | at byte OFFSET, and bit offset BIT_OFFSET within that byte, | |
2386 | proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then | |
0963b4bd | 2387 | assigning through the result will set the field fetched from. |
4c4b4cd2 PH |
2388 | VALADDR is ignored unless OBJ is NULL, in which case, |
2389 | VALADDR+OFFSET must address the start of storage containing the | |
2390 | packed value. The value returned in this case is never an lval. | |
2391 | Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */ | |
14f9c5c9 | 2392 | |
d2e4a39e | 2393 | struct value * |
fc1a4b47 | 2394 | ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr, |
a2bd3dcd | 2395 | long offset, int bit_offset, int bit_size, |
4c4b4cd2 | 2396 | struct type *type) |
14f9c5c9 | 2397 | { |
d2e4a39e | 2398 | struct value *v; |
4c4b4cd2 PH |
2399 | int src, /* Index into the source area */ |
2400 | targ, /* Index into the target area */ | |
2401 | srcBitsLeft, /* Number of source bits left to move */ | |
2402 | nsrc, ntarg, /* Number of source and target bytes */ | |
2403 | unusedLS, /* Number of bits in next significant | |
2404 | byte of source that are unused */ | |
2405 | accumSize; /* Number of meaningful bits in accum */ | |
2406 | unsigned char *bytes; /* First byte containing data to unpack */ | |
d2e4a39e | 2407 | unsigned char *unpacked; |
4c4b4cd2 | 2408 | unsigned long accum; /* Staging area for bits being transferred */ |
14f9c5c9 AS |
2409 | unsigned char sign; |
2410 | int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8; | |
4c4b4cd2 PH |
2411 | /* Transmit bytes from least to most significant; delta is the direction |
2412 | the indices move. */ | |
50810684 | 2413 | int delta = gdbarch_bits_big_endian (get_type_arch (type)) ? -1 : 1; |
14f9c5c9 | 2414 | |
61ee279c | 2415 | type = ada_check_typedef (type); |
14f9c5c9 AS |
2416 | |
2417 | if (obj == NULL) | |
2418 | { | |
2419 | v = allocate_value (type); | |
d2e4a39e | 2420 | bytes = (unsigned char *) (valaddr + offset); |
14f9c5c9 | 2421 | } |
9214ee5f | 2422 | else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj)) |
14f9c5c9 | 2423 | { |
ca34b84f | 2424 | v = value_at (type, value_address (obj) + offset); |
9f1f738a | 2425 | type = value_type (v); |
fc958966 JB |
2426 | if (TYPE_LENGTH (type) * HOST_CHAR_BIT < bit_size) |
2427 | { | |
2428 | /* This can happen in the case of an array of dynamic objects, | |
2429 | where the size of each element changes from element to element. | |
2430 | In that case, we're initially given the array stride, but | |
2431 | after resolving the element type, we find that its size is | |
2432 | less than this stride. In that case, adjust bit_size to | |
2433 | match TYPE's length, and recompute LEN accordingly. */ | |
2434 | bit_size = TYPE_LENGTH (type) * HOST_CHAR_BIT; | |
2435 | len = TYPE_LENGTH (type) + (bit_offset + HOST_CHAR_BIT - 1) / 8; | |
2436 | } | |
d2e4a39e | 2437 | bytes = (unsigned char *) alloca (len); |
ca34b84f | 2438 | read_memory (value_address (v), bytes, len); |
14f9c5c9 | 2439 | } |
d2e4a39e | 2440 | else |
14f9c5c9 AS |
2441 | { |
2442 | v = allocate_value (type); | |
0fd88904 | 2443 | bytes = (unsigned char *) value_contents (obj) + offset; |
14f9c5c9 | 2444 | } |
d2e4a39e AS |
2445 | |
2446 | if (obj != NULL) | |
14f9c5c9 | 2447 | { |
53ba8333 | 2448 | long new_offset = offset; |
5b4ee69b | 2449 | |
74bcbdf3 | 2450 | set_value_component_location (v, obj); |
9bbda503 AC |
2451 | set_value_bitpos (v, bit_offset + value_bitpos (obj)); |
2452 | set_value_bitsize (v, bit_size); | |
df407dfe | 2453 | if (value_bitpos (v) >= HOST_CHAR_BIT) |
4c4b4cd2 | 2454 | { |
53ba8333 | 2455 | ++new_offset; |
9bbda503 | 2456 | set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT); |
4c4b4cd2 | 2457 | } |
53ba8333 JB |
2458 | set_value_offset (v, new_offset); |
2459 | ||
2460 | /* Also set the parent value. This is needed when trying to | |
2461 | assign a new value (in inferior memory). */ | |
2462 | set_value_parent (v, obj); | |
14f9c5c9 AS |
2463 | } |
2464 | else | |
9bbda503 | 2465 | set_value_bitsize (v, bit_size); |
0fd88904 | 2466 | unpacked = (unsigned char *) value_contents (v); |
14f9c5c9 AS |
2467 | |
2468 | srcBitsLeft = bit_size; | |
2469 | nsrc = len; | |
2470 | ntarg = TYPE_LENGTH (type); | |
2471 | sign = 0; | |
2472 | if (bit_size == 0) | |
2473 | { | |
2474 | memset (unpacked, 0, TYPE_LENGTH (type)); | |
2475 | return v; | |
2476 | } | |
50810684 | 2477 | else if (gdbarch_bits_big_endian (get_type_arch (type))) |
14f9c5c9 | 2478 | { |
d2e4a39e | 2479 | src = len - 1; |
1265e4aa JB |
2480 | if (has_negatives (type) |
2481 | && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1)))) | |
4c4b4cd2 | 2482 | sign = ~0; |
d2e4a39e AS |
2483 | |
2484 | unusedLS = | |
4c4b4cd2 PH |
2485 | (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT) |
2486 | % HOST_CHAR_BIT; | |
14f9c5c9 AS |
2487 | |
2488 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
2489 | { |
2490 | case TYPE_CODE_ARRAY: | |
2491 | case TYPE_CODE_UNION: | |
2492 | case TYPE_CODE_STRUCT: | |
2493 | /* Non-scalar values must be aligned at a byte boundary... */ | |
2494 | accumSize = | |
2495 | (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT; | |
2496 | /* ... And are placed at the beginning (most-significant) bytes | |
2497 | of the target. */ | |
529cad9c | 2498 | targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1; |
0056e4d5 | 2499 | ntarg = targ + 1; |
4c4b4cd2 PH |
2500 | break; |
2501 | default: | |
2502 | accumSize = 0; | |
2503 | targ = TYPE_LENGTH (type) - 1; | |
2504 | break; | |
2505 | } | |
14f9c5c9 | 2506 | } |
d2e4a39e | 2507 | else |
14f9c5c9 AS |
2508 | { |
2509 | int sign_bit_offset = (bit_size + bit_offset - 1) % 8; | |
2510 | ||
2511 | src = targ = 0; | |
2512 | unusedLS = bit_offset; | |
2513 | accumSize = 0; | |
2514 | ||
d2e4a39e | 2515 | if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset))) |
4c4b4cd2 | 2516 | sign = ~0; |
14f9c5c9 | 2517 | } |
d2e4a39e | 2518 | |
14f9c5c9 AS |
2519 | accum = 0; |
2520 | while (nsrc > 0) | |
2521 | { | |
2522 | /* Mask for removing bits of the next source byte that are not | |
4c4b4cd2 | 2523 | part of the value. */ |
d2e4a39e | 2524 | unsigned int unusedMSMask = |
4c4b4cd2 PH |
2525 | (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) - |
2526 | 1; | |
2527 | /* Sign-extend bits for this byte. */ | |
14f9c5c9 | 2528 | unsigned int signMask = sign & ~unusedMSMask; |
5b4ee69b | 2529 | |
d2e4a39e | 2530 | accum |= |
4c4b4cd2 | 2531 | (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize; |
14f9c5c9 | 2532 | accumSize += HOST_CHAR_BIT - unusedLS; |
d2e4a39e | 2533 | if (accumSize >= HOST_CHAR_BIT) |
4c4b4cd2 PH |
2534 | { |
2535 | unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT); | |
2536 | accumSize -= HOST_CHAR_BIT; | |
2537 | accum >>= HOST_CHAR_BIT; | |
2538 | ntarg -= 1; | |
2539 | targ += delta; | |
2540 | } | |
14f9c5c9 AS |
2541 | srcBitsLeft -= HOST_CHAR_BIT - unusedLS; |
2542 | unusedLS = 0; | |
2543 | nsrc -= 1; | |
2544 | src += delta; | |
2545 | } | |
2546 | while (ntarg > 0) | |
2547 | { | |
2548 | accum |= sign << accumSize; | |
2549 | unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT); | |
2550 | accumSize -= HOST_CHAR_BIT; | |
9cd4d857 JB |
2551 | if (accumSize < 0) |
2552 | accumSize = 0; | |
14f9c5c9 AS |
2553 | accum >>= HOST_CHAR_BIT; |
2554 | ntarg -= 1; | |
2555 | targ += delta; | |
2556 | } | |
2557 | ||
2478d075 JB |
2558 | if (is_dynamic_type (value_type (v))) |
2559 | v = value_from_contents_and_address (value_type (v), value_contents (v), | |
2560 | 0); | |
14f9c5c9 AS |
2561 | return v; |
2562 | } | |
d2e4a39e | 2563 | |
14f9c5c9 AS |
2564 | /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to |
2565 | TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must | |
4c4b4cd2 | 2566 | not overlap. */ |
14f9c5c9 | 2567 | static void |
fc1a4b47 | 2568 | move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source, |
50810684 | 2569 | int src_offset, int n, int bits_big_endian_p) |
14f9c5c9 AS |
2570 | { |
2571 | unsigned int accum, mask; | |
2572 | int accum_bits, chunk_size; | |
2573 | ||
2574 | target += targ_offset / HOST_CHAR_BIT; | |
2575 | targ_offset %= HOST_CHAR_BIT; | |
2576 | source += src_offset / HOST_CHAR_BIT; | |
2577 | src_offset %= HOST_CHAR_BIT; | |
50810684 | 2578 | if (bits_big_endian_p) |
14f9c5c9 AS |
2579 | { |
2580 | accum = (unsigned char) *source; | |
2581 | source += 1; | |
2582 | accum_bits = HOST_CHAR_BIT - src_offset; | |
2583 | ||
d2e4a39e | 2584 | while (n > 0) |
4c4b4cd2 PH |
2585 | { |
2586 | int unused_right; | |
5b4ee69b | 2587 | |
4c4b4cd2 PH |
2588 | accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source; |
2589 | accum_bits += HOST_CHAR_BIT; | |
2590 | source += 1; | |
2591 | chunk_size = HOST_CHAR_BIT - targ_offset; | |
2592 | if (chunk_size > n) | |
2593 | chunk_size = n; | |
2594 | unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset); | |
2595 | mask = ((1 << chunk_size) - 1) << unused_right; | |
2596 | *target = | |
2597 | (*target & ~mask) | |
2598 | | ((accum >> (accum_bits - chunk_size - unused_right)) & mask); | |
2599 | n -= chunk_size; | |
2600 | accum_bits -= chunk_size; | |
2601 | target += 1; | |
2602 | targ_offset = 0; | |
2603 | } | |
14f9c5c9 AS |
2604 | } |
2605 | else | |
2606 | { | |
2607 | accum = (unsigned char) *source >> src_offset; | |
2608 | source += 1; | |
2609 | accum_bits = HOST_CHAR_BIT - src_offset; | |
2610 | ||
d2e4a39e | 2611 | while (n > 0) |
4c4b4cd2 PH |
2612 | { |
2613 | accum = accum + ((unsigned char) *source << accum_bits); | |
2614 | accum_bits += HOST_CHAR_BIT; | |
2615 | source += 1; | |
2616 | chunk_size = HOST_CHAR_BIT - targ_offset; | |
2617 | if (chunk_size > n) | |
2618 | chunk_size = n; | |
2619 | mask = ((1 << chunk_size) - 1) << targ_offset; | |
2620 | *target = (*target & ~mask) | ((accum << targ_offset) & mask); | |
2621 | n -= chunk_size; | |
2622 | accum_bits -= chunk_size; | |
2623 | accum >>= chunk_size; | |
2624 | target += 1; | |
2625 | targ_offset = 0; | |
2626 | } | |
14f9c5c9 AS |
2627 | } |
2628 | } | |
2629 | ||
14f9c5c9 AS |
2630 | /* Store the contents of FROMVAL into the location of TOVAL. |
2631 | Return a new value with the location of TOVAL and contents of | |
2632 | FROMVAL. Handles assignment into packed fields that have | |
4c4b4cd2 | 2633 | floating-point or non-scalar types. */ |
14f9c5c9 | 2634 | |
d2e4a39e AS |
2635 | static struct value * |
2636 | ada_value_assign (struct value *toval, struct value *fromval) | |
14f9c5c9 | 2637 | { |
df407dfe AC |
2638 | struct type *type = value_type (toval); |
2639 | int bits = value_bitsize (toval); | |
14f9c5c9 | 2640 | |
52ce6436 PH |
2641 | toval = ada_coerce_ref (toval); |
2642 | fromval = ada_coerce_ref (fromval); | |
2643 | ||
2644 | if (ada_is_direct_array_type (value_type (toval))) | |
2645 | toval = ada_coerce_to_simple_array (toval); | |
2646 | if (ada_is_direct_array_type (value_type (fromval))) | |
2647 | fromval = ada_coerce_to_simple_array (fromval); | |
2648 | ||
88e3b34b | 2649 | if (!deprecated_value_modifiable (toval)) |
323e0a4a | 2650 | error (_("Left operand of assignment is not a modifiable lvalue.")); |
14f9c5c9 | 2651 | |
d2e4a39e | 2652 | if (VALUE_LVAL (toval) == lval_memory |
14f9c5c9 | 2653 | && bits > 0 |
d2e4a39e | 2654 | && (TYPE_CODE (type) == TYPE_CODE_FLT |
4c4b4cd2 | 2655 | || TYPE_CODE (type) == TYPE_CODE_STRUCT)) |
14f9c5c9 | 2656 | { |
df407dfe AC |
2657 | int len = (value_bitpos (toval) |
2658 | + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
aced2898 | 2659 | int from_size; |
948f8e3d | 2660 | gdb_byte *buffer = alloca (len); |
d2e4a39e | 2661 | struct value *val; |
42ae5230 | 2662 | CORE_ADDR to_addr = value_address (toval); |
14f9c5c9 AS |
2663 | |
2664 | if (TYPE_CODE (type) == TYPE_CODE_FLT) | |
4c4b4cd2 | 2665 | fromval = value_cast (type, fromval); |
14f9c5c9 | 2666 | |
52ce6436 | 2667 | read_memory (to_addr, buffer, len); |
aced2898 PH |
2668 | from_size = value_bitsize (fromval); |
2669 | if (from_size == 0) | |
2670 | from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT; | |
50810684 | 2671 | if (gdbarch_bits_big_endian (get_type_arch (type))) |
df407dfe | 2672 | move_bits (buffer, value_bitpos (toval), |
50810684 | 2673 | value_contents (fromval), from_size - bits, bits, 1); |
14f9c5c9 | 2674 | else |
50810684 UW |
2675 | move_bits (buffer, value_bitpos (toval), |
2676 | value_contents (fromval), 0, bits, 0); | |
972daa01 | 2677 | write_memory_with_notification (to_addr, buffer, len); |
8cebebb9 | 2678 | |
14f9c5c9 | 2679 | val = value_copy (toval); |
0fd88904 | 2680 | memcpy (value_contents_raw (val), value_contents (fromval), |
4c4b4cd2 | 2681 | TYPE_LENGTH (type)); |
04624583 | 2682 | deprecated_set_value_type (val, type); |
d2e4a39e | 2683 | |
14f9c5c9 AS |
2684 | return val; |
2685 | } | |
2686 | ||
2687 | return value_assign (toval, fromval); | |
2688 | } | |
2689 | ||
2690 | ||
7c512744 JB |
2691 | /* Given that COMPONENT is a memory lvalue that is part of the lvalue |
2692 | CONTAINER, assign the contents of VAL to COMPONENTS's place in | |
2693 | CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not | |
2694 | COMPONENT, and not the inferior's memory. The current contents | |
2695 | of COMPONENT are ignored. | |
2696 | ||
2697 | Although not part of the initial design, this function also works | |
2698 | when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER | |
2699 | had a null address, and COMPONENT had an address which is equal to | |
2700 | its offset inside CONTAINER. */ | |
2701 | ||
52ce6436 PH |
2702 | static void |
2703 | value_assign_to_component (struct value *container, struct value *component, | |
2704 | struct value *val) | |
2705 | { | |
2706 | LONGEST offset_in_container = | |
42ae5230 | 2707 | (LONGEST) (value_address (component) - value_address (container)); |
7c512744 | 2708 | int bit_offset_in_container = |
52ce6436 PH |
2709 | value_bitpos (component) - value_bitpos (container); |
2710 | int bits; | |
7c512744 | 2711 | |
52ce6436 PH |
2712 | val = value_cast (value_type (component), val); |
2713 | ||
2714 | if (value_bitsize (component) == 0) | |
2715 | bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component)); | |
2716 | else | |
2717 | bits = value_bitsize (component); | |
2718 | ||
50810684 | 2719 | if (gdbarch_bits_big_endian (get_type_arch (value_type (container)))) |
7c512744 | 2720 | move_bits (value_contents_writeable (container) + offset_in_container, |
52ce6436 PH |
2721 | value_bitpos (container) + bit_offset_in_container, |
2722 | value_contents (val), | |
2723 | TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits, | |
50810684 | 2724 | bits, 1); |
52ce6436 | 2725 | else |
7c512744 | 2726 | move_bits (value_contents_writeable (container) + offset_in_container, |
52ce6436 | 2727 | value_bitpos (container) + bit_offset_in_container, |
50810684 | 2728 | value_contents (val), 0, bits, 0); |
7c512744 JB |
2729 | } |
2730 | ||
4c4b4cd2 PH |
2731 | /* The value of the element of array ARR at the ARITY indices given in IND. |
2732 | ARR may be either a simple array, GNAT array descriptor, or pointer | |
14f9c5c9 AS |
2733 | thereto. */ |
2734 | ||
d2e4a39e AS |
2735 | struct value * |
2736 | ada_value_subscript (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
2737 | { |
2738 | int k; | |
d2e4a39e AS |
2739 | struct value *elt; |
2740 | struct type *elt_type; | |
14f9c5c9 AS |
2741 | |
2742 | elt = ada_coerce_to_simple_array (arr); | |
2743 | ||
df407dfe | 2744 | elt_type = ada_check_typedef (value_type (elt)); |
d2e4a39e | 2745 | if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
2746 | && TYPE_FIELD_BITSIZE (elt_type, 0) > 0) |
2747 | return value_subscript_packed (elt, arity, ind); | |
2748 | ||
2749 | for (k = 0; k < arity; k += 1) | |
2750 | { | |
2751 | if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY) | |
323e0a4a | 2752 | error (_("too many subscripts (%d expected)"), k); |
2497b498 | 2753 | elt = value_subscript (elt, pos_atr (ind[k])); |
14f9c5c9 AS |
2754 | } |
2755 | return elt; | |
2756 | } | |
2757 | ||
deede10c JB |
2758 | /* Assuming ARR is a pointer to a GDB array, the value of the element |
2759 | of *ARR at the ARITY indices given in IND. | |
919e6dbe PMR |
2760 | Does not read the entire array into memory. |
2761 | ||
2762 | Note: Unlike what one would expect, this function is used instead of | |
2763 | ada_value_subscript for basically all non-packed array types. The reason | |
2764 | for this is that a side effect of doing our own pointer arithmetics instead | |
2765 | of relying on value_subscript is that there is no implicit typedef peeling. | |
2766 | This is important for arrays of array accesses, where it allows us to | |
2767 | preserve the fact that the array's element is an array access, where the | |
2768 | access part os encoded in a typedef layer. */ | |
14f9c5c9 | 2769 | |
2c0b251b | 2770 | static struct value * |
deede10c | 2771 | ada_value_ptr_subscript (struct value *arr, int arity, struct value **ind) |
14f9c5c9 AS |
2772 | { |
2773 | int k; | |
919e6dbe | 2774 | struct value *array_ind = ada_value_ind (arr); |
deede10c | 2775 | struct type *type |
919e6dbe PMR |
2776 | = check_typedef (value_enclosing_type (array_ind)); |
2777 | ||
2778 | if (TYPE_CODE (type) == TYPE_CODE_ARRAY | |
2779 | && TYPE_FIELD_BITSIZE (type, 0) > 0) | |
2780 | return value_subscript_packed (array_ind, arity, ind); | |
14f9c5c9 AS |
2781 | |
2782 | for (k = 0; k < arity; k += 1) | |
2783 | { | |
2784 | LONGEST lwb, upb; | |
aa715135 | 2785 | struct value *lwb_value; |
14f9c5c9 AS |
2786 | |
2787 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY) | |
323e0a4a | 2788 | error (_("too many subscripts (%d expected)"), k); |
d2e4a39e | 2789 | arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
4c4b4cd2 | 2790 | value_copy (arr)); |
14f9c5c9 | 2791 | get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb); |
aa715135 JG |
2792 | lwb_value = value_from_longest (value_type(ind[k]), lwb); |
2793 | arr = value_ptradd (arr, pos_atr (ind[k]) - pos_atr (lwb_value)); | |
14f9c5c9 AS |
2794 | type = TYPE_TARGET_TYPE (type); |
2795 | } | |
2796 | ||
2797 | return value_ind (arr); | |
2798 | } | |
2799 | ||
0b5d8877 | 2800 | /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the |
aa715135 JG |
2801 | actual type of ARRAY_PTR is ignored), returns the Ada slice of |
2802 | HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of | |
2803 | this array is LOW, as per Ada rules. */ | |
0b5d8877 | 2804 | static struct value * |
f5938064 JG |
2805 | ada_value_slice_from_ptr (struct value *array_ptr, struct type *type, |
2806 | int low, int high) | |
0b5d8877 | 2807 | { |
b0dd7688 | 2808 | struct type *type0 = ada_check_typedef (type); |
aa715135 | 2809 | struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)); |
0c9c3474 | 2810 | struct type *index_type |
aa715135 | 2811 | = create_static_range_type (NULL, base_index_type, low, high); |
6c038f32 | 2812 | struct type *slice_type = |
b0dd7688 | 2813 | create_array_type (NULL, TYPE_TARGET_TYPE (type0), index_type); |
aa715135 JG |
2814 | int base_low = ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)); |
2815 | LONGEST base_low_pos, low_pos; | |
2816 | CORE_ADDR base; | |
2817 | ||
2818 | if (!discrete_position (base_index_type, low, &low_pos) | |
2819 | || !discrete_position (base_index_type, base_low, &base_low_pos)) | |
2820 | { | |
2821 | warning (_("unable to get positions in slice, use bounds instead")); | |
2822 | low_pos = low; | |
2823 | base_low_pos = base_low; | |
2824 | } | |
5b4ee69b | 2825 | |
aa715135 JG |
2826 | base = value_as_address (array_ptr) |
2827 | + ((low_pos - base_low_pos) | |
2828 | * TYPE_LENGTH (TYPE_TARGET_TYPE (type0))); | |
f5938064 | 2829 | return value_at_lazy (slice_type, base); |
0b5d8877 PH |
2830 | } |
2831 | ||
2832 | ||
2833 | static struct value * | |
2834 | ada_value_slice (struct value *array, int low, int high) | |
2835 | { | |
b0dd7688 | 2836 | struct type *type = ada_check_typedef (value_type (array)); |
aa715135 | 2837 | struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)); |
0c9c3474 SA |
2838 | struct type *index_type |
2839 | = create_static_range_type (NULL, TYPE_INDEX_TYPE (type), low, high); | |
6c038f32 | 2840 | struct type *slice_type = |
0b5d8877 | 2841 | create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type); |
aa715135 | 2842 | LONGEST low_pos, high_pos; |
5b4ee69b | 2843 | |
aa715135 JG |
2844 | if (!discrete_position (base_index_type, low, &low_pos) |
2845 | || !discrete_position (base_index_type, high, &high_pos)) | |
2846 | { | |
2847 | warning (_("unable to get positions in slice, use bounds instead")); | |
2848 | low_pos = low; | |
2849 | high_pos = high; | |
2850 | } | |
2851 | ||
2852 | return value_cast (slice_type, | |
2853 | value_slice (array, low, high_pos - low_pos + 1)); | |
0b5d8877 PH |
2854 | } |
2855 | ||
14f9c5c9 AS |
2856 | /* If type is a record type in the form of a standard GNAT array |
2857 | descriptor, returns the number of dimensions for type. If arr is a | |
2858 | simple array, returns the number of "array of"s that prefix its | |
4c4b4cd2 | 2859 | type designation. Otherwise, returns 0. */ |
14f9c5c9 AS |
2860 | |
2861 | int | |
d2e4a39e | 2862 | ada_array_arity (struct type *type) |
14f9c5c9 AS |
2863 | { |
2864 | int arity; | |
2865 | ||
2866 | if (type == NULL) | |
2867 | return 0; | |
2868 | ||
2869 | type = desc_base_type (type); | |
2870 | ||
2871 | arity = 0; | |
d2e4a39e | 2872 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
14f9c5c9 | 2873 | return desc_arity (desc_bounds_type (type)); |
d2e4a39e AS |
2874 | else |
2875 | while (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
14f9c5c9 | 2876 | { |
4c4b4cd2 | 2877 | arity += 1; |
61ee279c | 2878 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
14f9c5c9 | 2879 | } |
d2e4a39e | 2880 | |
14f9c5c9 AS |
2881 | return arity; |
2882 | } | |
2883 | ||
2884 | /* If TYPE is a record type in the form of a standard GNAT array | |
2885 | descriptor or a simple array type, returns the element type for | |
2886 | TYPE after indexing by NINDICES indices, or by all indices if | |
4c4b4cd2 | 2887 | NINDICES is -1. Otherwise, returns NULL. */ |
14f9c5c9 | 2888 | |
d2e4a39e AS |
2889 | struct type * |
2890 | ada_array_element_type (struct type *type, int nindices) | |
14f9c5c9 AS |
2891 | { |
2892 | type = desc_base_type (type); | |
2893 | ||
d2e4a39e | 2894 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
14f9c5c9 AS |
2895 | { |
2896 | int k; | |
d2e4a39e | 2897 | struct type *p_array_type; |
14f9c5c9 | 2898 | |
556bdfd4 | 2899 | p_array_type = desc_data_target_type (type); |
14f9c5c9 AS |
2900 | |
2901 | k = ada_array_arity (type); | |
2902 | if (k == 0) | |
4c4b4cd2 | 2903 | return NULL; |
d2e4a39e | 2904 | |
4c4b4cd2 | 2905 | /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */ |
14f9c5c9 | 2906 | if (nindices >= 0 && k > nindices) |
4c4b4cd2 | 2907 | k = nindices; |
d2e4a39e | 2908 | while (k > 0 && p_array_type != NULL) |
4c4b4cd2 | 2909 | { |
61ee279c | 2910 | p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type)); |
4c4b4cd2 PH |
2911 | k -= 1; |
2912 | } | |
14f9c5c9 AS |
2913 | return p_array_type; |
2914 | } | |
2915 | else if (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
2916 | { | |
2917 | while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
4c4b4cd2 PH |
2918 | { |
2919 | type = TYPE_TARGET_TYPE (type); | |
2920 | nindices -= 1; | |
2921 | } | |
14f9c5c9 AS |
2922 | return type; |
2923 | } | |
2924 | ||
2925 | return NULL; | |
2926 | } | |
2927 | ||
4c4b4cd2 | 2928 | /* The type of nth index in arrays of given type (n numbering from 1). |
dd19d49e UW |
2929 | Does not examine memory. Throws an error if N is invalid or TYPE |
2930 | is not an array type. NAME is the name of the Ada attribute being | |
2931 | evaluated ('range, 'first, 'last, or 'length); it is used in building | |
2932 | the error message. */ | |
14f9c5c9 | 2933 | |
1eea4ebd UW |
2934 | static struct type * |
2935 | ada_index_type (struct type *type, int n, const char *name) | |
14f9c5c9 | 2936 | { |
4c4b4cd2 PH |
2937 | struct type *result_type; |
2938 | ||
14f9c5c9 AS |
2939 | type = desc_base_type (type); |
2940 | ||
1eea4ebd UW |
2941 | if (n < 0 || n > ada_array_arity (type)) |
2942 | error (_("invalid dimension number to '%s"), name); | |
14f9c5c9 | 2943 | |
4c4b4cd2 | 2944 | if (ada_is_simple_array_type (type)) |
14f9c5c9 AS |
2945 | { |
2946 | int i; | |
2947 | ||
2948 | for (i = 1; i < n; i += 1) | |
4c4b4cd2 | 2949 | type = TYPE_TARGET_TYPE (type); |
262452ec | 2950 | result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)); |
4c4b4cd2 PH |
2951 | /* FIXME: The stabs type r(0,0);bound;bound in an array type |
2952 | has a target type of TYPE_CODE_UNDEF. We compensate here, but | |
76a01679 | 2953 | perhaps stabsread.c would make more sense. */ |
1eea4ebd UW |
2954 | if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF) |
2955 | result_type = NULL; | |
14f9c5c9 | 2956 | } |
d2e4a39e | 2957 | else |
1eea4ebd UW |
2958 | { |
2959 | result_type = desc_index_type (desc_bounds_type (type), n); | |
2960 | if (result_type == NULL) | |
2961 | error (_("attempt to take bound of something that is not an array")); | |
2962 | } | |
2963 | ||
2964 | return result_type; | |
14f9c5c9 AS |
2965 | } |
2966 | ||
2967 | /* Given that arr is an array type, returns the lower bound of the | |
2968 | Nth index (numbering from 1) if WHICH is 0, and the upper bound if | |
4c4b4cd2 | 2969 | WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an |
1eea4ebd UW |
2970 | array-descriptor type. It works for other arrays with bounds supplied |
2971 | by run-time quantities other than discriminants. */ | |
14f9c5c9 | 2972 | |
abb68b3e | 2973 | static LONGEST |
fb5e3d5c | 2974 | ada_array_bound_from_type (struct type *arr_type, int n, int which) |
14f9c5c9 | 2975 | { |
8a48ac95 | 2976 | struct type *type, *index_type_desc, *index_type; |
1ce677a4 | 2977 | int i; |
262452ec JK |
2978 | |
2979 | gdb_assert (which == 0 || which == 1); | |
14f9c5c9 | 2980 | |
ad82864c JB |
2981 | if (ada_is_constrained_packed_array_type (arr_type)) |
2982 | arr_type = decode_constrained_packed_array_type (arr_type); | |
14f9c5c9 | 2983 | |
4c4b4cd2 | 2984 | if (arr_type == NULL || !ada_is_simple_array_type (arr_type)) |
1eea4ebd | 2985 | return (LONGEST) - which; |
14f9c5c9 AS |
2986 | |
2987 | if (TYPE_CODE (arr_type) == TYPE_CODE_PTR) | |
2988 | type = TYPE_TARGET_TYPE (arr_type); | |
2989 | else | |
2990 | type = arr_type; | |
2991 | ||
bafffb51 JB |
2992 | if (TYPE_FIXED_INSTANCE (type)) |
2993 | { | |
2994 | /* The array has already been fixed, so we do not need to | |
2995 | check the parallel ___XA type again. That encoding has | |
2996 | already been applied, so ignore it now. */ | |
2997 | index_type_desc = NULL; | |
2998 | } | |
2999 | else | |
3000 | { | |
3001 | index_type_desc = ada_find_parallel_type (type, "___XA"); | |
3002 | ada_fixup_array_indexes_type (index_type_desc); | |
3003 | } | |
3004 | ||
262452ec | 3005 | if (index_type_desc != NULL) |
28c85d6c JB |
3006 | index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1), |
3007 | NULL); | |
262452ec | 3008 | else |
8a48ac95 JB |
3009 | { |
3010 | struct type *elt_type = check_typedef (type); | |
3011 | ||
3012 | for (i = 1; i < n; i++) | |
3013 | elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type)); | |
3014 | ||
3015 | index_type = TYPE_INDEX_TYPE (elt_type); | |
3016 | } | |
262452ec | 3017 | |
43bbcdc2 PH |
3018 | return |
3019 | (LONGEST) (which == 0 | |
3020 | ? ada_discrete_type_low_bound (index_type) | |
3021 | : ada_discrete_type_high_bound (index_type)); | |
14f9c5c9 AS |
3022 | } |
3023 | ||
3024 | /* Given that arr is an array value, returns the lower bound of the | |
abb68b3e JB |
3025 | nth index (numbering from 1) if WHICH is 0, and the upper bound if |
3026 | WHICH is 1. This routine will also work for arrays with bounds | |
4c4b4cd2 | 3027 | supplied by run-time quantities other than discriminants. */ |
14f9c5c9 | 3028 | |
1eea4ebd | 3029 | static LONGEST |
4dc81987 | 3030 | ada_array_bound (struct value *arr, int n, int which) |
14f9c5c9 | 3031 | { |
eb479039 JB |
3032 | struct type *arr_type; |
3033 | ||
3034 | if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR) | |
3035 | arr = value_ind (arr); | |
3036 | arr_type = value_enclosing_type (arr); | |
14f9c5c9 | 3037 | |
ad82864c JB |
3038 | if (ada_is_constrained_packed_array_type (arr_type)) |
3039 | return ada_array_bound (decode_constrained_packed_array (arr), n, which); | |
4c4b4cd2 | 3040 | else if (ada_is_simple_array_type (arr_type)) |
1eea4ebd | 3041 | return ada_array_bound_from_type (arr_type, n, which); |
14f9c5c9 | 3042 | else |
1eea4ebd | 3043 | return value_as_long (desc_one_bound (desc_bounds (arr), n, which)); |
14f9c5c9 AS |
3044 | } |
3045 | ||
3046 | /* Given that arr is an array value, returns the length of the | |
3047 | nth index. This routine will also work for arrays with bounds | |
4c4b4cd2 PH |
3048 | supplied by run-time quantities other than discriminants. |
3049 | Does not work for arrays indexed by enumeration types with representation | |
3050 | clauses at the moment. */ | |
14f9c5c9 | 3051 | |
1eea4ebd | 3052 | static LONGEST |
d2e4a39e | 3053 | ada_array_length (struct value *arr, int n) |
14f9c5c9 | 3054 | { |
aa715135 JG |
3055 | struct type *arr_type, *index_type; |
3056 | int low, high; | |
eb479039 JB |
3057 | |
3058 | if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR) | |
3059 | arr = value_ind (arr); | |
3060 | arr_type = value_enclosing_type (arr); | |
14f9c5c9 | 3061 | |
ad82864c JB |
3062 | if (ada_is_constrained_packed_array_type (arr_type)) |
3063 | return ada_array_length (decode_constrained_packed_array (arr), n); | |
14f9c5c9 | 3064 | |
4c4b4cd2 | 3065 | if (ada_is_simple_array_type (arr_type)) |
aa715135 JG |
3066 | { |
3067 | low = ada_array_bound_from_type (arr_type, n, 0); | |
3068 | high = ada_array_bound_from_type (arr_type, n, 1); | |
3069 | } | |
14f9c5c9 | 3070 | else |
aa715135 JG |
3071 | { |
3072 | low = value_as_long (desc_one_bound (desc_bounds (arr), n, 0)); | |
3073 | high = value_as_long (desc_one_bound (desc_bounds (arr), n, 1)); | |
3074 | } | |
3075 | ||
f168693b | 3076 | arr_type = check_typedef (arr_type); |
aa715135 JG |
3077 | index_type = TYPE_INDEX_TYPE (arr_type); |
3078 | if (index_type != NULL) | |
3079 | { | |
3080 | struct type *base_type; | |
3081 | if (TYPE_CODE (index_type) == TYPE_CODE_RANGE) | |
3082 | base_type = TYPE_TARGET_TYPE (index_type); | |
3083 | else | |
3084 | base_type = index_type; | |
3085 | ||
3086 | low = pos_atr (value_from_longest (base_type, low)); | |
3087 | high = pos_atr (value_from_longest (base_type, high)); | |
3088 | } | |
3089 | return high - low + 1; | |
4c4b4cd2 PH |
3090 | } |
3091 | ||
3092 | /* An empty array whose type is that of ARR_TYPE (an array type), | |
3093 | with bounds LOW to LOW-1. */ | |
3094 | ||
3095 | static struct value * | |
3096 | empty_array (struct type *arr_type, int low) | |
3097 | { | |
b0dd7688 | 3098 | struct type *arr_type0 = ada_check_typedef (arr_type); |
0c9c3474 SA |
3099 | struct type *index_type |
3100 | = create_static_range_type | |
3101 | (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)), low, low - 1); | |
b0dd7688 | 3102 | struct type *elt_type = ada_array_element_type (arr_type0, 1); |
5b4ee69b | 3103 | |
0b5d8877 | 3104 | return allocate_value (create_array_type (NULL, elt_type, index_type)); |
14f9c5c9 | 3105 | } |
14f9c5c9 | 3106 | \f |
d2e4a39e | 3107 | |
4c4b4cd2 | 3108 | /* Name resolution */ |
14f9c5c9 | 3109 | |
4c4b4cd2 PH |
3110 | /* The "decoded" name for the user-definable Ada operator corresponding |
3111 | to OP. */ | |
14f9c5c9 | 3112 | |
d2e4a39e | 3113 | static const char * |
4c4b4cd2 | 3114 | ada_decoded_op_name (enum exp_opcode op) |
14f9c5c9 AS |
3115 | { |
3116 | int i; | |
3117 | ||
4c4b4cd2 | 3118 | for (i = 0; ada_opname_table[i].encoded != NULL; i += 1) |
14f9c5c9 AS |
3119 | { |
3120 | if (ada_opname_table[i].op == op) | |
4c4b4cd2 | 3121 | return ada_opname_table[i].decoded; |
14f9c5c9 | 3122 | } |
323e0a4a | 3123 | error (_("Could not find operator name for opcode")); |
14f9c5c9 AS |
3124 | } |
3125 | ||
3126 | ||
4c4b4cd2 PH |
3127 | /* Same as evaluate_type (*EXP), but resolves ambiguous symbol |
3128 | references (marked by OP_VAR_VALUE nodes in which the symbol has an | |
3129 | undefined namespace) and converts operators that are | |
3130 | user-defined into appropriate function calls. If CONTEXT_TYPE is | |
14f9c5c9 AS |
3131 | non-null, it provides a preferred result type [at the moment, only |
3132 | type void has any effect---causing procedures to be preferred over | |
3133 | functions in calls]. A null CONTEXT_TYPE indicates that a non-void | |
4c4b4cd2 | 3134 | return type is preferred. May change (expand) *EXP. */ |
14f9c5c9 | 3135 | |
4c4b4cd2 PH |
3136 | static void |
3137 | resolve (struct expression **expp, int void_context_p) | |
14f9c5c9 | 3138 | { |
30b15541 UW |
3139 | struct type *context_type = NULL; |
3140 | int pc = 0; | |
3141 | ||
3142 | if (void_context_p) | |
3143 | context_type = builtin_type ((*expp)->gdbarch)->builtin_void; | |
3144 | ||
3145 | resolve_subexp (expp, &pc, 1, context_type); | |
14f9c5c9 AS |
3146 | } |
3147 | ||
4c4b4cd2 PH |
3148 | /* Resolve the operator of the subexpression beginning at |
3149 | position *POS of *EXPP. "Resolving" consists of replacing | |
3150 | the symbols that have undefined namespaces in OP_VAR_VALUE nodes | |
3151 | with their resolutions, replacing built-in operators with | |
3152 | function calls to user-defined operators, where appropriate, and, | |
3153 | when DEPROCEDURE_P is non-zero, converting function-valued variables | |
3154 | into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions | |
3155 | are as in ada_resolve, above. */ | |
14f9c5c9 | 3156 | |
d2e4a39e | 3157 | static struct value * |
4c4b4cd2 | 3158 | resolve_subexp (struct expression **expp, int *pos, int deprocedure_p, |
76a01679 | 3159 | struct type *context_type) |
14f9c5c9 AS |
3160 | { |
3161 | int pc = *pos; | |
3162 | int i; | |
4c4b4cd2 | 3163 | struct expression *exp; /* Convenience: == *expp. */ |
14f9c5c9 | 3164 | enum exp_opcode op = (*expp)->elts[pc].opcode; |
4c4b4cd2 PH |
3165 | struct value **argvec; /* Vector of operand types (alloca'ed). */ |
3166 | int nargs; /* Number of operands. */ | |
52ce6436 | 3167 | int oplen; |
14f9c5c9 AS |
3168 | |
3169 | argvec = NULL; | |
3170 | nargs = 0; | |
3171 | exp = *expp; | |
3172 | ||
52ce6436 PH |
3173 | /* Pass one: resolve operands, saving their types and updating *pos, |
3174 | if needed. */ | |
14f9c5c9 AS |
3175 | switch (op) |
3176 | { | |
4c4b4cd2 PH |
3177 | case OP_FUNCALL: |
3178 | if (exp->elts[pc + 3].opcode == OP_VAR_VALUE | |
76a01679 JB |
3179 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
3180 | *pos += 7; | |
4c4b4cd2 PH |
3181 | else |
3182 | { | |
3183 | *pos += 3; | |
3184 | resolve_subexp (expp, pos, 0, NULL); | |
3185 | } | |
3186 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
14f9c5c9 AS |
3187 | break; |
3188 | ||
14f9c5c9 | 3189 | case UNOP_ADDR: |
4c4b4cd2 PH |
3190 | *pos += 1; |
3191 | resolve_subexp (expp, pos, 0, NULL); | |
3192 | break; | |
3193 | ||
52ce6436 PH |
3194 | case UNOP_QUAL: |
3195 | *pos += 3; | |
17466c1a | 3196 | resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type)); |
4c4b4cd2 PH |
3197 | break; |
3198 | ||
52ce6436 | 3199 | case OP_ATR_MODULUS: |
4c4b4cd2 PH |
3200 | case OP_ATR_SIZE: |
3201 | case OP_ATR_TAG: | |
4c4b4cd2 PH |
3202 | case OP_ATR_FIRST: |
3203 | case OP_ATR_LAST: | |
3204 | case OP_ATR_LENGTH: | |
3205 | case OP_ATR_POS: | |
3206 | case OP_ATR_VAL: | |
4c4b4cd2 PH |
3207 | case OP_ATR_MIN: |
3208 | case OP_ATR_MAX: | |
52ce6436 PH |
3209 | case TERNOP_IN_RANGE: |
3210 | case BINOP_IN_BOUNDS: | |
3211 | case UNOP_IN_RANGE: | |
3212 | case OP_AGGREGATE: | |
3213 | case OP_OTHERS: | |
3214 | case OP_CHOICES: | |
3215 | case OP_POSITIONAL: | |
3216 | case OP_DISCRETE_RANGE: | |
3217 | case OP_NAME: | |
3218 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
3219 | *pos += oplen; | |
14f9c5c9 AS |
3220 | break; |
3221 | ||
3222 | case BINOP_ASSIGN: | |
3223 | { | |
4c4b4cd2 PH |
3224 | struct value *arg1; |
3225 | ||
3226 | *pos += 1; | |
3227 | arg1 = resolve_subexp (expp, pos, 0, NULL); | |
3228 | if (arg1 == NULL) | |
3229 | resolve_subexp (expp, pos, 1, NULL); | |
3230 | else | |
df407dfe | 3231 | resolve_subexp (expp, pos, 1, value_type (arg1)); |
4c4b4cd2 | 3232 | break; |
14f9c5c9 AS |
3233 | } |
3234 | ||
4c4b4cd2 | 3235 | case UNOP_CAST: |
4c4b4cd2 PH |
3236 | *pos += 3; |
3237 | nargs = 1; | |
3238 | break; | |
14f9c5c9 | 3239 | |
4c4b4cd2 PH |
3240 | case BINOP_ADD: |
3241 | case BINOP_SUB: | |
3242 | case BINOP_MUL: | |
3243 | case BINOP_DIV: | |
3244 | case BINOP_REM: | |
3245 | case BINOP_MOD: | |
3246 | case BINOP_EXP: | |
3247 | case BINOP_CONCAT: | |
3248 | case BINOP_LOGICAL_AND: | |
3249 | case BINOP_LOGICAL_OR: | |
3250 | case BINOP_BITWISE_AND: | |
3251 | case BINOP_BITWISE_IOR: | |
3252 | case BINOP_BITWISE_XOR: | |
14f9c5c9 | 3253 | |
4c4b4cd2 PH |
3254 | case BINOP_EQUAL: |
3255 | case BINOP_NOTEQUAL: | |
3256 | case BINOP_LESS: | |
3257 | case BINOP_GTR: | |
3258 | case BINOP_LEQ: | |
3259 | case BINOP_GEQ: | |
14f9c5c9 | 3260 | |
4c4b4cd2 PH |
3261 | case BINOP_REPEAT: |
3262 | case BINOP_SUBSCRIPT: | |
3263 | case BINOP_COMMA: | |
40c8aaa9 JB |
3264 | *pos += 1; |
3265 | nargs = 2; | |
3266 | break; | |
14f9c5c9 | 3267 | |
4c4b4cd2 PH |
3268 | case UNOP_NEG: |
3269 | case UNOP_PLUS: | |
3270 | case UNOP_LOGICAL_NOT: | |
3271 | case UNOP_ABS: | |
3272 | case UNOP_IND: | |
3273 | *pos += 1; | |
3274 | nargs = 1; | |
3275 | break; | |
14f9c5c9 | 3276 | |
4c4b4cd2 PH |
3277 | case OP_LONG: |
3278 | case OP_DOUBLE: | |
3279 | case OP_VAR_VALUE: | |
3280 | *pos += 4; | |
3281 | break; | |
14f9c5c9 | 3282 | |
4c4b4cd2 PH |
3283 | case OP_TYPE: |
3284 | case OP_BOOL: | |
3285 | case OP_LAST: | |
4c4b4cd2 PH |
3286 | case OP_INTERNALVAR: |
3287 | *pos += 3; | |
3288 | break; | |
14f9c5c9 | 3289 | |
4c4b4cd2 PH |
3290 | case UNOP_MEMVAL: |
3291 | *pos += 3; | |
3292 | nargs = 1; | |
3293 | break; | |
3294 | ||
67f3407f DJ |
3295 | case OP_REGISTER: |
3296 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
3297 | break; | |
3298 | ||
4c4b4cd2 PH |
3299 | case STRUCTOP_STRUCT: |
3300 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
3301 | nargs = 1; | |
3302 | break; | |
3303 | ||
4c4b4cd2 | 3304 | case TERNOP_SLICE: |
4c4b4cd2 PH |
3305 | *pos += 1; |
3306 | nargs = 3; | |
3307 | break; | |
3308 | ||
52ce6436 | 3309 | case OP_STRING: |
14f9c5c9 | 3310 | break; |
4c4b4cd2 PH |
3311 | |
3312 | default: | |
323e0a4a | 3313 | error (_("Unexpected operator during name resolution")); |
14f9c5c9 AS |
3314 | } |
3315 | ||
8d749320 | 3316 | argvec = XALLOCAVEC (struct value *, nargs + 1); |
4c4b4cd2 PH |
3317 | for (i = 0; i < nargs; i += 1) |
3318 | argvec[i] = resolve_subexp (expp, pos, 1, NULL); | |
3319 | argvec[i] = NULL; | |
3320 | exp = *expp; | |
3321 | ||
3322 | /* Pass two: perform any resolution on principal operator. */ | |
14f9c5c9 AS |
3323 | switch (op) |
3324 | { | |
3325 | default: | |
3326 | break; | |
3327 | ||
14f9c5c9 | 3328 | case OP_VAR_VALUE: |
4c4b4cd2 | 3329 | if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN) |
76a01679 | 3330 | { |
d12307c1 | 3331 | struct block_symbol *candidates; |
76a01679 JB |
3332 | int n_candidates; |
3333 | ||
3334 | n_candidates = | |
3335 | ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME | |
3336 | (exp->elts[pc + 2].symbol), | |
3337 | exp->elts[pc + 1].block, VAR_DOMAIN, | |
4eeaa230 | 3338 | &candidates); |
76a01679 JB |
3339 | |
3340 | if (n_candidates > 1) | |
3341 | { | |
3342 | /* Types tend to get re-introduced locally, so if there | |
3343 | are any local symbols that are not types, first filter | |
3344 | out all types. */ | |
3345 | int j; | |
3346 | for (j = 0; j < n_candidates; j += 1) | |
d12307c1 | 3347 | switch (SYMBOL_CLASS (candidates[j].symbol)) |
76a01679 JB |
3348 | { |
3349 | case LOC_REGISTER: | |
3350 | case LOC_ARG: | |
3351 | case LOC_REF_ARG: | |
76a01679 JB |
3352 | case LOC_REGPARM_ADDR: |
3353 | case LOC_LOCAL: | |
76a01679 | 3354 | case LOC_COMPUTED: |
76a01679 JB |
3355 | goto FoundNonType; |
3356 | default: | |
3357 | break; | |
3358 | } | |
3359 | FoundNonType: | |
3360 | if (j < n_candidates) | |
3361 | { | |
3362 | j = 0; | |
3363 | while (j < n_candidates) | |
3364 | { | |
d12307c1 | 3365 | if (SYMBOL_CLASS (candidates[j].symbol) == LOC_TYPEDEF) |
76a01679 JB |
3366 | { |
3367 | candidates[j] = candidates[n_candidates - 1]; | |
3368 | n_candidates -= 1; | |
3369 | } | |
3370 | else | |
3371 | j += 1; | |
3372 | } | |
3373 | } | |
3374 | } | |
3375 | ||
3376 | if (n_candidates == 0) | |
323e0a4a | 3377 | error (_("No definition found for %s"), |
76a01679 JB |
3378 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3379 | else if (n_candidates == 1) | |
3380 | i = 0; | |
3381 | else if (deprocedure_p | |
3382 | && !is_nonfunction (candidates, n_candidates)) | |
3383 | { | |
06d5cf63 JB |
3384 | i = ada_resolve_function |
3385 | (candidates, n_candidates, NULL, 0, | |
3386 | SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol), | |
3387 | context_type); | |
76a01679 | 3388 | if (i < 0) |
323e0a4a | 3389 | error (_("Could not find a match for %s"), |
76a01679 JB |
3390 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3391 | } | |
3392 | else | |
3393 | { | |
323e0a4a | 3394 | printf_filtered (_("Multiple matches for %s\n"), |
76a01679 JB |
3395 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3396 | user_select_syms (candidates, n_candidates, 1); | |
3397 | i = 0; | |
3398 | } | |
3399 | ||
3400 | exp->elts[pc + 1].block = candidates[i].block; | |
d12307c1 | 3401 | exp->elts[pc + 2].symbol = candidates[i].symbol; |
1265e4aa JB |
3402 | if (innermost_block == NULL |
3403 | || contained_in (candidates[i].block, innermost_block)) | |
76a01679 JB |
3404 | innermost_block = candidates[i].block; |
3405 | } | |
3406 | ||
3407 | if (deprocedure_p | |
3408 | && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol)) | |
3409 | == TYPE_CODE_FUNC)) | |
3410 | { | |
3411 | replace_operator_with_call (expp, pc, 0, 0, | |
3412 | exp->elts[pc + 2].symbol, | |
3413 | exp->elts[pc + 1].block); | |
3414 | exp = *expp; | |
3415 | } | |
14f9c5c9 AS |
3416 | break; |
3417 | ||
3418 | case OP_FUNCALL: | |
3419 | { | |
4c4b4cd2 | 3420 | if (exp->elts[pc + 3].opcode == OP_VAR_VALUE |
76a01679 | 3421 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
4c4b4cd2 | 3422 | { |
d12307c1 | 3423 | struct block_symbol *candidates; |
4c4b4cd2 PH |
3424 | int n_candidates; |
3425 | ||
3426 | n_candidates = | |
76a01679 JB |
3427 | ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME |
3428 | (exp->elts[pc + 5].symbol), | |
3429 | exp->elts[pc + 4].block, VAR_DOMAIN, | |
4eeaa230 | 3430 | &candidates); |
4c4b4cd2 PH |
3431 | if (n_candidates == 1) |
3432 | i = 0; | |
3433 | else | |
3434 | { | |
06d5cf63 JB |
3435 | i = ada_resolve_function |
3436 | (candidates, n_candidates, | |
3437 | argvec, nargs, | |
3438 | SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol), | |
3439 | context_type); | |
4c4b4cd2 | 3440 | if (i < 0) |
323e0a4a | 3441 | error (_("Could not find a match for %s"), |
4c4b4cd2 PH |
3442 | SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol)); |
3443 | } | |
3444 | ||
3445 | exp->elts[pc + 4].block = candidates[i].block; | |
d12307c1 | 3446 | exp->elts[pc + 5].symbol = candidates[i].symbol; |
1265e4aa JB |
3447 | if (innermost_block == NULL |
3448 | || contained_in (candidates[i].block, innermost_block)) | |
4c4b4cd2 PH |
3449 | innermost_block = candidates[i].block; |
3450 | } | |
14f9c5c9 AS |
3451 | } |
3452 | break; | |
3453 | case BINOP_ADD: | |
3454 | case BINOP_SUB: | |
3455 | case BINOP_MUL: | |
3456 | case BINOP_DIV: | |
3457 | case BINOP_REM: | |
3458 | case BINOP_MOD: | |
3459 | case BINOP_CONCAT: | |
3460 | case BINOP_BITWISE_AND: | |
3461 | case BINOP_BITWISE_IOR: | |
3462 | case BINOP_BITWISE_XOR: | |
3463 | case BINOP_EQUAL: | |
3464 | case BINOP_NOTEQUAL: | |
3465 | case BINOP_LESS: | |
3466 | case BINOP_GTR: | |
3467 | case BINOP_LEQ: | |
3468 | case BINOP_GEQ: | |
3469 | case BINOP_EXP: | |
3470 | case UNOP_NEG: | |
3471 | case UNOP_PLUS: | |
3472 | case UNOP_LOGICAL_NOT: | |
3473 | case UNOP_ABS: | |
3474 | if (possible_user_operator_p (op, argvec)) | |
4c4b4cd2 | 3475 | { |
d12307c1 | 3476 | struct block_symbol *candidates; |
4c4b4cd2 PH |
3477 | int n_candidates; |
3478 | ||
3479 | n_candidates = | |
3480 | ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)), | |
3481 | (struct block *) NULL, VAR_DOMAIN, | |
4eeaa230 | 3482 | &candidates); |
4c4b4cd2 | 3483 | i = ada_resolve_function (candidates, n_candidates, argvec, nargs, |
76a01679 | 3484 | ada_decoded_op_name (op), NULL); |
4c4b4cd2 PH |
3485 | if (i < 0) |
3486 | break; | |
3487 | ||
d12307c1 PMR |
3488 | replace_operator_with_call (expp, pc, nargs, 1, |
3489 | candidates[i].symbol, | |
3490 | candidates[i].block); | |
4c4b4cd2 PH |
3491 | exp = *expp; |
3492 | } | |
14f9c5c9 | 3493 | break; |
4c4b4cd2 PH |
3494 | |
3495 | case OP_TYPE: | |
b3dbf008 | 3496 | case OP_REGISTER: |
4c4b4cd2 | 3497 | return NULL; |
14f9c5c9 AS |
3498 | } |
3499 | ||
3500 | *pos = pc; | |
3501 | return evaluate_subexp_type (exp, pos); | |
3502 | } | |
3503 | ||
3504 | /* Return non-zero if formal type FTYPE matches actual type ATYPE. If | |
4c4b4cd2 | 3505 | MAY_DEREF is non-zero, the formal may be a pointer and the actual |
5b3d5b7d | 3506 | a non-pointer. */ |
14f9c5c9 | 3507 | /* The term "match" here is rather loose. The match is heuristic and |
5b3d5b7d | 3508 | liberal. */ |
14f9c5c9 AS |
3509 | |
3510 | static int | |
4dc81987 | 3511 | ada_type_match (struct type *ftype, struct type *atype, int may_deref) |
14f9c5c9 | 3512 | { |
61ee279c PH |
3513 | ftype = ada_check_typedef (ftype); |
3514 | atype = ada_check_typedef (atype); | |
14f9c5c9 AS |
3515 | |
3516 | if (TYPE_CODE (ftype) == TYPE_CODE_REF) | |
3517 | ftype = TYPE_TARGET_TYPE (ftype); | |
3518 | if (TYPE_CODE (atype) == TYPE_CODE_REF) | |
3519 | atype = TYPE_TARGET_TYPE (atype); | |
3520 | ||
d2e4a39e | 3521 | switch (TYPE_CODE (ftype)) |
14f9c5c9 AS |
3522 | { |
3523 | default: | |
5b3d5b7d | 3524 | return TYPE_CODE (ftype) == TYPE_CODE (atype); |
14f9c5c9 AS |
3525 | case TYPE_CODE_PTR: |
3526 | if (TYPE_CODE (atype) == TYPE_CODE_PTR) | |
4c4b4cd2 PH |
3527 | return ada_type_match (TYPE_TARGET_TYPE (ftype), |
3528 | TYPE_TARGET_TYPE (atype), 0); | |
d2e4a39e | 3529 | else |
1265e4aa JB |
3530 | return (may_deref |
3531 | && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0)); | |
14f9c5c9 AS |
3532 | case TYPE_CODE_INT: |
3533 | case TYPE_CODE_ENUM: | |
3534 | case TYPE_CODE_RANGE: | |
3535 | switch (TYPE_CODE (atype)) | |
4c4b4cd2 PH |
3536 | { |
3537 | case TYPE_CODE_INT: | |
3538 | case TYPE_CODE_ENUM: | |
3539 | case TYPE_CODE_RANGE: | |
3540 | return 1; | |
3541 | default: | |
3542 | return 0; | |
3543 | } | |
14f9c5c9 AS |
3544 | |
3545 | case TYPE_CODE_ARRAY: | |
d2e4a39e | 3546 | return (TYPE_CODE (atype) == TYPE_CODE_ARRAY |
4c4b4cd2 | 3547 | || ada_is_array_descriptor_type (atype)); |
14f9c5c9 AS |
3548 | |
3549 | case TYPE_CODE_STRUCT: | |
4c4b4cd2 PH |
3550 | if (ada_is_array_descriptor_type (ftype)) |
3551 | return (TYPE_CODE (atype) == TYPE_CODE_ARRAY | |
3552 | || ada_is_array_descriptor_type (atype)); | |
14f9c5c9 | 3553 | else |
4c4b4cd2 PH |
3554 | return (TYPE_CODE (atype) == TYPE_CODE_STRUCT |
3555 | && !ada_is_array_descriptor_type (atype)); | |
14f9c5c9 AS |
3556 | |
3557 | case TYPE_CODE_UNION: | |
3558 | case TYPE_CODE_FLT: | |
3559 | return (TYPE_CODE (atype) == TYPE_CODE (ftype)); | |
3560 | } | |
3561 | } | |
3562 | ||
3563 | /* Return non-zero if the formals of FUNC "sufficiently match" the | |
3564 | vector of actual argument types ACTUALS of size N_ACTUALS. FUNC | |
3565 | may also be an enumeral, in which case it is treated as a 0- | |
4c4b4cd2 | 3566 | argument function. */ |
14f9c5c9 AS |
3567 | |
3568 | static int | |
d2e4a39e | 3569 | ada_args_match (struct symbol *func, struct value **actuals, int n_actuals) |
14f9c5c9 AS |
3570 | { |
3571 | int i; | |
d2e4a39e | 3572 | struct type *func_type = SYMBOL_TYPE (func); |
14f9c5c9 | 3573 | |
1265e4aa JB |
3574 | if (SYMBOL_CLASS (func) == LOC_CONST |
3575 | && TYPE_CODE (func_type) == TYPE_CODE_ENUM) | |
14f9c5c9 AS |
3576 | return (n_actuals == 0); |
3577 | else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC) | |
3578 | return 0; | |
3579 | ||
3580 | if (TYPE_NFIELDS (func_type) != n_actuals) | |
3581 | return 0; | |
3582 | ||
3583 | for (i = 0; i < n_actuals; i += 1) | |
3584 | { | |
4c4b4cd2 | 3585 | if (actuals[i] == NULL) |
76a01679 JB |
3586 | return 0; |
3587 | else | |
3588 | { | |
5b4ee69b MS |
3589 | struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, |
3590 | i)); | |
df407dfe | 3591 | struct type *atype = ada_check_typedef (value_type (actuals[i])); |
4c4b4cd2 | 3592 | |
76a01679 JB |
3593 | if (!ada_type_match (ftype, atype, 1)) |
3594 | return 0; | |
3595 | } | |
14f9c5c9 AS |
3596 | } |
3597 | return 1; | |
3598 | } | |
3599 | ||
3600 | /* False iff function type FUNC_TYPE definitely does not produce a value | |
3601 | compatible with type CONTEXT_TYPE. Conservatively returns 1 if | |
3602 | FUNC_TYPE is not a valid function type with a non-null return type | |
3603 | or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */ | |
3604 | ||
3605 | static int | |
d2e4a39e | 3606 | return_match (struct type *func_type, struct type *context_type) |
14f9c5c9 | 3607 | { |
d2e4a39e | 3608 | struct type *return_type; |
14f9c5c9 AS |
3609 | |
3610 | if (func_type == NULL) | |
3611 | return 1; | |
3612 | ||
4c4b4cd2 | 3613 | if (TYPE_CODE (func_type) == TYPE_CODE_FUNC) |
18af8284 | 3614 | return_type = get_base_type (TYPE_TARGET_TYPE (func_type)); |
4c4b4cd2 | 3615 | else |
18af8284 | 3616 | return_type = get_base_type (func_type); |
14f9c5c9 AS |
3617 | if (return_type == NULL) |
3618 | return 1; | |
3619 | ||
18af8284 | 3620 | context_type = get_base_type (context_type); |
14f9c5c9 AS |
3621 | |
3622 | if (TYPE_CODE (return_type) == TYPE_CODE_ENUM) | |
3623 | return context_type == NULL || return_type == context_type; | |
3624 | else if (context_type == NULL) | |
3625 | return TYPE_CODE (return_type) != TYPE_CODE_VOID; | |
3626 | else | |
3627 | return TYPE_CODE (return_type) == TYPE_CODE (context_type); | |
3628 | } | |
3629 | ||
3630 | ||
4c4b4cd2 | 3631 | /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the |
14f9c5c9 | 3632 | function (if any) that matches the types of the NARGS arguments in |
4c4b4cd2 PH |
3633 | ARGS. If CONTEXT_TYPE is non-null and there is at least one match |
3634 | that returns that type, then eliminate matches that don't. If | |
3635 | CONTEXT_TYPE is void and there is at least one match that does not | |
3636 | return void, eliminate all matches that do. | |
3637 | ||
14f9c5c9 AS |
3638 | Asks the user if there is more than one match remaining. Returns -1 |
3639 | if there is no such symbol or none is selected. NAME is used | |
4c4b4cd2 PH |
3640 | solely for messages. May re-arrange and modify SYMS in |
3641 | the process; the index returned is for the modified vector. */ | |
14f9c5c9 | 3642 | |
4c4b4cd2 | 3643 | static int |
d12307c1 | 3644 | ada_resolve_function (struct block_symbol syms[], |
4c4b4cd2 PH |
3645 | int nsyms, struct value **args, int nargs, |
3646 | const char *name, struct type *context_type) | |
14f9c5c9 | 3647 | { |
30b15541 | 3648 | int fallback; |
14f9c5c9 | 3649 | int k; |
4c4b4cd2 | 3650 | int m; /* Number of hits */ |
14f9c5c9 | 3651 | |
d2e4a39e | 3652 | m = 0; |
30b15541 UW |
3653 | /* In the first pass of the loop, we only accept functions matching |
3654 | context_type. If none are found, we add a second pass of the loop | |
3655 | where every function is accepted. */ | |
3656 | for (fallback = 0; m == 0 && fallback < 2; fallback++) | |
14f9c5c9 AS |
3657 | { |
3658 | for (k = 0; k < nsyms; k += 1) | |
4c4b4cd2 | 3659 | { |
d12307c1 | 3660 | struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].symbol)); |
4c4b4cd2 | 3661 | |
d12307c1 | 3662 | if (ada_args_match (syms[k].symbol, args, nargs) |
30b15541 | 3663 | && (fallback || return_match (type, context_type))) |
4c4b4cd2 PH |
3664 | { |
3665 | syms[m] = syms[k]; | |
3666 | m += 1; | |
3667 | } | |
3668 | } | |
14f9c5c9 AS |
3669 | } |
3670 | ||
dc5c8746 PMR |
3671 | /* If we got multiple matches, ask the user which one to use. Don't do this |
3672 | interactive thing during completion, though, as the purpose of the | |
3673 | completion is providing a list of all possible matches. Prompting the | |
3674 | user to filter it down would be completely unexpected in this case. */ | |
14f9c5c9 AS |
3675 | if (m == 0) |
3676 | return -1; | |
dc5c8746 | 3677 | else if (m > 1 && !parse_completion) |
14f9c5c9 | 3678 | { |
323e0a4a | 3679 | printf_filtered (_("Multiple matches for %s\n"), name); |
4c4b4cd2 | 3680 | user_select_syms (syms, m, 1); |
14f9c5c9 AS |
3681 | return 0; |
3682 | } | |
3683 | return 0; | |
3684 | } | |
3685 | ||
4c4b4cd2 PH |
3686 | /* Returns true (non-zero) iff decoded name N0 should appear before N1 |
3687 | in a listing of choices during disambiguation (see sort_choices, below). | |
3688 | The idea is that overloadings of a subprogram name from the | |
3689 | same package should sort in their source order. We settle for ordering | |
3690 | such symbols by their trailing number (__N or $N). */ | |
3691 | ||
14f9c5c9 | 3692 | static int |
0d5cff50 | 3693 | encoded_ordered_before (const char *N0, const char *N1) |
14f9c5c9 AS |
3694 | { |
3695 | if (N1 == NULL) | |
3696 | return 0; | |
3697 | else if (N0 == NULL) | |
3698 | return 1; | |
3699 | else | |
3700 | { | |
3701 | int k0, k1; | |
5b4ee69b | 3702 | |
d2e4a39e | 3703 | for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1) |
4c4b4cd2 | 3704 | ; |
d2e4a39e | 3705 | for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1) |
4c4b4cd2 | 3706 | ; |
d2e4a39e | 3707 | if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000' |
4c4b4cd2 PH |
3708 | && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000') |
3709 | { | |
3710 | int n0, n1; | |
5b4ee69b | 3711 | |
4c4b4cd2 PH |
3712 | n0 = k0; |
3713 | while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_') | |
3714 | n0 -= 1; | |
3715 | n1 = k1; | |
3716 | while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_') | |
3717 | n1 -= 1; | |
3718 | if (n0 == n1 && strncmp (N0, N1, n0) == 0) | |
3719 | return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1)); | |
3720 | } | |
14f9c5c9 AS |
3721 | return (strcmp (N0, N1) < 0); |
3722 | } | |
3723 | } | |
d2e4a39e | 3724 | |
4c4b4cd2 PH |
3725 | /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the |
3726 | encoded names. */ | |
3727 | ||
d2e4a39e | 3728 | static void |
d12307c1 | 3729 | sort_choices (struct block_symbol syms[], int nsyms) |
14f9c5c9 | 3730 | { |
4c4b4cd2 | 3731 | int i; |
5b4ee69b | 3732 | |
d2e4a39e | 3733 | for (i = 1; i < nsyms; i += 1) |
14f9c5c9 | 3734 | { |
d12307c1 | 3735 | struct block_symbol sym = syms[i]; |
14f9c5c9 AS |
3736 | int j; |
3737 | ||
d2e4a39e | 3738 | for (j = i - 1; j >= 0; j -= 1) |
4c4b4cd2 | 3739 | { |
d12307c1 PMR |
3740 | if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].symbol), |
3741 | SYMBOL_LINKAGE_NAME (sym.symbol))) | |
4c4b4cd2 PH |
3742 | break; |
3743 | syms[j + 1] = syms[j]; | |
3744 | } | |
d2e4a39e | 3745 | syms[j + 1] = sym; |
14f9c5c9 AS |
3746 | } |
3747 | } | |
3748 | ||
4c4b4cd2 PH |
3749 | /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0 |
3750 | by asking the user (if necessary), returning the number selected, | |
3751 | and setting the first elements of SYMS items. Error if no symbols | |
3752 | selected. */ | |
14f9c5c9 AS |
3753 | |
3754 | /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought | |
4c4b4cd2 | 3755 | to be re-integrated one of these days. */ |
14f9c5c9 AS |
3756 | |
3757 | int | |
d12307c1 | 3758 | user_select_syms (struct block_symbol *syms, int nsyms, int max_results) |
14f9c5c9 AS |
3759 | { |
3760 | int i; | |
8d749320 | 3761 | int *chosen = XALLOCAVEC (int , nsyms); |
14f9c5c9 AS |
3762 | int n_chosen; |
3763 | int first_choice = (max_results == 1) ? 1 : 2; | |
717d2f5a | 3764 | const char *select_mode = multiple_symbols_select_mode (); |
14f9c5c9 AS |
3765 | |
3766 | if (max_results < 1) | |
323e0a4a | 3767 | error (_("Request to select 0 symbols!")); |
14f9c5c9 AS |
3768 | if (nsyms <= 1) |
3769 | return nsyms; | |
3770 | ||
717d2f5a JB |
3771 | if (select_mode == multiple_symbols_cancel) |
3772 | error (_("\ | |
3773 | canceled because the command is ambiguous\n\ | |
3774 | See set/show multiple-symbol.")); | |
3775 | ||
3776 | /* If select_mode is "all", then return all possible symbols. | |
3777 | Only do that if more than one symbol can be selected, of course. | |
3778 | Otherwise, display the menu as usual. */ | |
3779 | if (select_mode == multiple_symbols_all && max_results > 1) | |
3780 | return nsyms; | |
3781 | ||
323e0a4a | 3782 | printf_unfiltered (_("[0] cancel\n")); |
14f9c5c9 | 3783 | if (max_results > 1) |
323e0a4a | 3784 | printf_unfiltered (_("[1] all\n")); |
14f9c5c9 | 3785 | |
4c4b4cd2 | 3786 | sort_choices (syms, nsyms); |
14f9c5c9 AS |
3787 | |
3788 | for (i = 0; i < nsyms; i += 1) | |
3789 | { | |
d12307c1 | 3790 | if (syms[i].symbol == NULL) |
4c4b4cd2 PH |
3791 | continue; |
3792 | ||
d12307c1 | 3793 | if (SYMBOL_CLASS (syms[i].symbol) == LOC_BLOCK) |
4c4b4cd2 | 3794 | { |
76a01679 | 3795 | struct symtab_and_line sal = |
d12307c1 | 3796 | find_function_start_sal (syms[i].symbol, 1); |
5b4ee69b | 3797 | |
323e0a4a AC |
3798 | if (sal.symtab == NULL) |
3799 | printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"), | |
3800 | i + first_choice, | |
d12307c1 | 3801 | SYMBOL_PRINT_NAME (syms[i].symbol), |
323e0a4a AC |
3802 | sal.line); |
3803 | else | |
3804 | printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice, | |
d12307c1 | 3805 | SYMBOL_PRINT_NAME (syms[i].symbol), |
05cba821 JK |
3806 | symtab_to_filename_for_display (sal.symtab), |
3807 | sal.line); | |
4c4b4cd2 PH |
3808 | continue; |
3809 | } | |
d2e4a39e | 3810 | else |
4c4b4cd2 PH |
3811 | { |
3812 | int is_enumeral = | |
d12307c1 PMR |
3813 | (SYMBOL_CLASS (syms[i].symbol) == LOC_CONST |
3814 | && SYMBOL_TYPE (syms[i].symbol) != NULL | |
3815 | && TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) == TYPE_CODE_ENUM); | |
1994afbf DE |
3816 | struct symtab *symtab = NULL; |
3817 | ||
d12307c1 PMR |
3818 | if (SYMBOL_OBJFILE_OWNED (syms[i].symbol)) |
3819 | symtab = symbol_symtab (syms[i].symbol); | |
4c4b4cd2 | 3820 | |
d12307c1 | 3821 | if (SYMBOL_LINE (syms[i].symbol) != 0 && symtab != NULL) |
323e0a4a | 3822 | printf_unfiltered (_("[%d] %s at %s:%d\n"), |
4c4b4cd2 | 3823 | i + first_choice, |
d12307c1 | 3824 | SYMBOL_PRINT_NAME (syms[i].symbol), |
05cba821 | 3825 | symtab_to_filename_for_display (symtab), |
d12307c1 | 3826 | SYMBOL_LINE (syms[i].symbol)); |
76a01679 | 3827 | else if (is_enumeral |
d12307c1 | 3828 | && TYPE_NAME (SYMBOL_TYPE (syms[i].symbol)) != NULL) |
4c4b4cd2 | 3829 | { |
a3f17187 | 3830 | printf_unfiltered (("[%d] "), i + first_choice); |
d12307c1 | 3831 | ada_print_type (SYMBOL_TYPE (syms[i].symbol), NULL, |
79d43c61 | 3832 | gdb_stdout, -1, 0, &type_print_raw_options); |
323e0a4a | 3833 | printf_unfiltered (_("'(%s) (enumeral)\n"), |
d12307c1 | 3834 | SYMBOL_PRINT_NAME (syms[i].symbol)); |
4c4b4cd2 PH |
3835 | } |
3836 | else if (symtab != NULL) | |
3837 | printf_unfiltered (is_enumeral | |
323e0a4a AC |
3838 | ? _("[%d] %s in %s (enumeral)\n") |
3839 | : _("[%d] %s at %s:?\n"), | |
4c4b4cd2 | 3840 | i + first_choice, |
d12307c1 | 3841 | SYMBOL_PRINT_NAME (syms[i].symbol), |
05cba821 | 3842 | symtab_to_filename_for_display (symtab)); |
4c4b4cd2 PH |
3843 | else |
3844 | printf_unfiltered (is_enumeral | |
323e0a4a AC |
3845 | ? _("[%d] %s (enumeral)\n") |
3846 | : _("[%d] %s at ?\n"), | |
4c4b4cd2 | 3847 | i + first_choice, |
d12307c1 | 3848 | SYMBOL_PRINT_NAME (syms[i].symbol)); |
4c4b4cd2 | 3849 | } |
14f9c5c9 | 3850 | } |
d2e4a39e | 3851 | |
14f9c5c9 | 3852 | n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1, |
4c4b4cd2 | 3853 | "overload-choice"); |
14f9c5c9 AS |
3854 | |
3855 | for (i = 0; i < n_chosen; i += 1) | |
4c4b4cd2 | 3856 | syms[i] = syms[chosen[i]]; |
14f9c5c9 AS |
3857 | |
3858 | return n_chosen; | |
3859 | } | |
3860 | ||
3861 | /* Read and validate a set of numeric choices from the user in the | |
4c4b4cd2 | 3862 | range 0 .. N_CHOICES-1. Place the results in increasing |
14f9c5c9 AS |
3863 | order in CHOICES[0 .. N-1], and return N. |
3864 | ||
3865 | The user types choices as a sequence of numbers on one line | |
3866 | separated by blanks, encoding them as follows: | |
3867 | ||
4c4b4cd2 | 3868 | + A choice of 0 means to cancel the selection, throwing an error. |
14f9c5c9 AS |
3869 | + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1. |
3870 | + The user chooses k by typing k+IS_ALL_CHOICE+1. | |
3871 | ||
4c4b4cd2 | 3872 | The user is not allowed to choose more than MAX_RESULTS values. |
14f9c5c9 AS |
3873 | |
3874 | ANNOTATION_SUFFIX, if present, is used to annotate the input | |
4c4b4cd2 | 3875 | prompts (for use with the -f switch). */ |
14f9c5c9 AS |
3876 | |
3877 | int | |
d2e4a39e | 3878 | get_selections (int *choices, int n_choices, int max_results, |
4c4b4cd2 | 3879 | int is_all_choice, char *annotation_suffix) |
14f9c5c9 | 3880 | { |
d2e4a39e | 3881 | char *args; |
0bcd0149 | 3882 | char *prompt; |
14f9c5c9 AS |
3883 | int n_chosen; |
3884 | int first_choice = is_all_choice ? 2 : 1; | |
d2e4a39e | 3885 | |
14f9c5c9 AS |
3886 | prompt = getenv ("PS2"); |
3887 | if (prompt == NULL) | |
0bcd0149 | 3888 | prompt = "> "; |
14f9c5c9 | 3889 | |
0bcd0149 | 3890 | args = command_line_input (prompt, 0, annotation_suffix); |
d2e4a39e | 3891 | |
14f9c5c9 | 3892 | if (args == NULL) |
323e0a4a | 3893 | error_no_arg (_("one or more choice numbers")); |
14f9c5c9 AS |
3894 | |
3895 | n_chosen = 0; | |
76a01679 | 3896 | |
4c4b4cd2 PH |
3897 | /* Set choices[0 .. n_chosen-1] to the users' choices in ascending |
3898 | order, as given in args. Choices are validated. */ | |
14f9c5c9 AS |
3899 | while (1) |
3900 | { | |
d2e4a39e | 3901 | char *args2; |
14f9c5c9 AS |
3902 | int choice, j; |
3903 | ||
0fcd72ba | 3904 | args = skip_spaces (args); |
14f9c5c9 | 3905 | if (*args == '\0' && n_chosen == 0) |
323e0a4a | 3906 | error_no_arg (_("one or more choice numbers")); |
14f9c5c9 | 3907 | else if (*args == '\0') |
4c4b4cd2 | 3908 | break; |
14f9c5c9 AS |
3909 | |
3910 | choice = strtol (args, &args2, 10); | |
d2e4a39e | 3911 | if (args == args2 || choice < 0 |
4c4b4cd2 | 3912 | || choice > n_choices + first_choice - 1) |
323e0a4a | 3913 | error (_("Argument must be choice number")); |
14f9c5c9 AS |
3914 | args = args2; |
3915 | ||
d2e4a39e | 3916 | if (choice == 0) |
323e0a4a | 3917 | error (_("cancelled")); |
14f9c5c9 AS |
3918 | |
3919 | if (choice < first_choice) | |
4c4b4cd2 PH |
3920 | { |
3921 | n_chosen = n_choices; | |
3922 | for (j = 0; j < n_choices; j += 1) | |
3923 | choices[j] = j; | |
3924 | break; | |
3925 | } | |
14f9c5c9 AS |
3926 | choice -= first_choice; |
3927 | ||
d2e4a39e | 3928 | for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1) |
4c4b4cd2 PH |
3929 | { |
3930 | } | |
14f9c5c9 AS |
3931 | |
3932 | if (j < 0 || choice != choices[j]) | |
4c4b4cd2 PH |
3933 | { |
3934 | int k; | |
5b4ee69b | 3935 | |
4c4b4cd2 PH |
3936 | for (k = n_chosen - 1; k > j; k -= 1) |
3937 | choices[k + 1] = choices[k]; | |
3938 | choices[j + 1] = choice; | |
3939 | n_chosen += 1; | |
3940 | } | |
14f9c5c9 AS |
3941 | } |
3942 | ||
3943 | if (n_chosen > max_results) | |
323e0a4a | 3944 | error (_("Select no more than %d of the above"), max_results); |
d2e4a39e | 3945 | |
14f9c5c9 AS |
3946 | return n_chosen; |
3947 | } | |
3948 | ||
4c4b4cd2 PH |
3949 | /* Replace the operator of length OPLEN at position PC in *EXPP with a call |
3950 | on the function identified by SYM and BLOCK, and taking NARGS | |
3951 | arguments. Update *EXPP as needed to hold more space. */ | |
14f9c5c9 AS |
3952 | |
3953 | static void | |
d2e4a39e | 3954 | replace_operator_with_call (struct expression **expp, int pc, int nargs, |
4c4b4cd2 | 3955 | int oplen, struct symbol *sym, |
270140bd | 3956 | const struct block *block) |
14f9c5c9 AS |
3957 | { |
3958 | /* A new expression, with 6 more elements (3 for funcall, 4 for function | |
4c4b4cd2 | 3959 | symbol, -oplen for operator being replaced). */ |
d2e4a39e | 3960 | struct expression *newexp = (struct expression *) |
8c1a34e7 | 3961 | xzalloc (sizeof (struct expression) |
4c4b4cd2 | 3962 | + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen)); |
d2e4a39e | 3963 | struct expression *exp = *expp; |
14f9c5c9 AS |
3964 | |
3965 | newexp->nelts = exp->nelts + 7 - oplen; | |
3966 | newexp->language_defn = exp->language_defn; | |
3489610d | 3967 | newexp->gdbarch = exp->gdbarch; |
14f9c5c9 | 3968 | memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc)); |
d2e4a39e | 3969 | memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen, |
4c4b4cd2 | 3970 | EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen)); |
14f9c5c9 AS |
3971 | |
3972 | newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL; | |
3973 | newexp->elts[pc + 1].longconst = (LONGEST) nargs; | |
3974 | ||
3975 | newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE; | |
3976 | newexp->elts[pc + 4].block = block; | |
3977 | newexp->elts[pc + 5].symbol = sym; | |
3978 | ||
3979 | *expp = newexp; | |
aacb1f0a | 3980 | xfree (exp); |
d2e4a39e | 3981 | } |
14f9c5c9 AS |
3982 | |
3983 | /* Type-class predicates */ | |
3984 | ||
4c4b4cd2 PH |
3985 | /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type), |
3986 | or FLOAT). */ | |
14f9c5c9 AS |
3987 | |
3988 | static int | |
d2e4a39e | 3989 | numeric_type_p (struct type *type) |
14f9c5c9 AS |
3990 | { |
3991 | if (type == NULL) | |
3992 | return 0; | |
d2e4a39e AS |
3993 | else |
3994 | { | |
3995 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
3996 | { |
3997 | case TYPE_CODE_INT: | |
3998 | case TYPE_CODE_FLT: | |
3999 | return 1; | |
4000 | case TYPE_CODE_RANGE: | |
4001 | return (type == TYPE_TARGET_TYPE (type) | |
4002 | || numeric_type_p (TYPE_TARGET_TYPE (type))); | |
4003 | default: | |
4004 | return 0; | |
4005 | } | |
d2e4a39e | 4006 | } |
14f9c5c9 AS |
4007 | } |
4008 | ||
4c4b4cd2 | 4009 | /* True iff TYPE is integral (an INT or RANGE of INTs). */ |
14f9c5c9 AS |
4010 | |
4011 | static int | |
d2e4a39e | 4012 | integer_type_p (struct type *type) |
14f9c5c9 AS |
4013 | { |
4014 | if (type == NULL) | |
4015 | return 0; | |
d2e4a39e AS |
4016 | else |
4017 | { | |
4018 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4019 | { |
4020 | case TYPE_CODE_INT: | |
4021 | return 1; | |
4022 | case TYPE_CODE_RANGE: | |
4023 | return (type == TYPE_TARGET_TYPE (type) | |
4024 | || integer_type_p (TYPE_TARGET_TYPE (type))); | |
4025 | default: | |
4026 | return 0; | |
4027 | } | |
d2e4a39e | 4028 | } |
14f9c5c9 AS |
4029 | } |
4030 | ||
4c4b4cd2 | 4031 | /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */ |
14f9c5c9 AS |
4032 | |
4033 | static int | |
d2e4a39e | 4034 | scalar_type_p (struct type *type) |
14f9c5c9 AS |
4035 | { |
4036 | if (type == NULL) | |
4037 | return 0; | |
d2e4a39e AS |
4038 | else |
4039 | { | |
4040 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4041 | { |
4042 | case TYPE_CODE_INT: | |
4043 | case TYPE_CODE_RANGE: | |
4044 | case TYPE_CODE_ENUM: | |
4045 | case TYPE_CODE_FLT: | |
4046 | return 1; | |
4047 | default: | |
4048 | return 0; | |
4049 | } | |
d2e4a39e | 4050 | } |
14f9c5c9 AS |
4051 | } |
4052 | ||
4c4b4cd2 | 4053 | /* True iff TYPE is discrete (INT, RANGE, ENUM). */ |
14f9c5c9 AS |
4054 | |
4055 | static int | |
d2e4a39e | 4056 | discrete_type_p (struct type *type) |
14f9c5c9 AS |
4057 | { |
4058 | if (type == NULL) | |
4059 | return 0; | |
d2e4a39e AS |
4060 | else |
4061 | { | |
4062 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4063 | { |
4064 | case TYPE_CODE_INT: | |
4065 | case TYPE_CODE_RANGE: | |
4066 | case TYPE_CODE_ENUM: | |
872f0337 | 4067 | case TYPE_CODE_BOOL: |
4c4b4cd2 PH |
4068 | return 1; |
4069 | default: | |
4070 | return 0; | |
4071 | } | |
d2e4a39e | 4072 | } |
14f9c5c9 AS |
4073 | } |
4074 | ||
4c4b4cd2 PH |
4075 | /* Returns non-zero if OP with operands in the vector ARGS could be |
4076 | a user-defined function. Errs on the side of pre-defined operators | |
4077 | (i.e., result 0). */ | |
14f9c5c9 AS |
4078 | |
4079 | static int | |
d2e4a39e | 4080 | possible_user_operator_p (enum exp_opcode op, struct value *args[]) |
14f9c5c9 | 4081 | { |
76a01679 | 4082 | struct type *type0 = |
df407dfe | 4083 | (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0])); |
d2e4a39e | 4084 | struct type *type1 = |
df407dfe | 4085 | (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1])); |
d2e4a39e | 4086 | |
4c4b4cd2 PH |
4087 | if (type0 == NULL) |
4088 | return 0; | |
4089 | ||
14f9c5c9 AS |
4090 | switch (op) |
4091 | { | |
4092 | default: | |
4093 | return 0; | |
4094 | ||
4095 | case BINOP_ADD: | |
4096 | case BINOP_SUB: | |
4097 | case BINOP_MUL: | |
4098 | case BINOP_DIV: | |
d2e4a39e | 4099 | return (!(numeric_type_p (type0) && numeric_type_p (type1))); |
14f9c5c9 AS |
4100 | |
4101 | case BINOP_REM: | |
4102 | case BINOP_MOD: | |
4103 | case BINOP_BITWISE_AND: | |
4104 | case BINOP_BITWISE_IOR: | |
4105 | case BINOP_BITWISE_XOR: | |
d2e4a39e | 4106 | return (!(integer_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
4107 | |
4108 | case BINOP_EQUAL: | |
4109 | case BINOP_NOTEQUAL: | |
4110 | case BINOP_LESS: | |
4111 | case BINOP_GTR: | |
4112 | case BINOP_LEQ: | |
4113 | case BINOP_GEQ: | |
d2e4a39e | 4114 | return (!(scalar_type_p (type0) && scalar_type_p (type1))); |
14f9c5c9 AS |
4115 | |
4116 | case BINOP_CONCAT: | |
ee90b9ab | 4117 | return !ada_is_array_type (type0) || !ada_is_array_type (type1); |
14f9c5c9 AS |
4118 | |
4119 | case BINOP_EXP: | |
d2e4a39e | 4120 | return (!(numeric_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
4121 | |
4122 | case UNOP_NEG: | |
4123 | case UNOP_PLUS: | |
4124 | case UNOP_LOGICAL_NOT: | |
d2e4a39e AS |
4125 | case UNOP_ABS: |
4126 | return (!numeric_type_p (type0)); | |
14f9c5c9 AS |
4127 | |
4128 | } | |
4129 | } | |
4130 | \f | |
4c4b4cd2 | 4131 | /* Renaming */ |
14f9c5c9 | 4132 | |
aeb5907d JB |
4133 | /* NOTES: |
4134 | ||
4135 | 1. In the following, we assume that a renaming type's name may | |
4136 | have an ___XD suffix. It would be nice if this went away at some | |
4137 | point. | |
4138 | 2. We handle both the (old) purely type-based representation of | |
4139 | renamings and the (new) variable-based encoding. At some point, | |
4140 | it is devoutly to be hoped that the former goes away | |
4141 | (FIXME: hilfinger-2007-07-09). | |
4142 | 3. Subprogram renamings are not implemented, although the XRS | |
4143 | suffix is recognized (FIXME: hilfinger-2007-07-09). */ | |
4144 | ||
4145 | /* If SYM encodes a renaming, | |
4146 | ||
4147 | <renaming> renames <renamed entity>, | |
4148 | ||
4149 | sets *LEN to the length of the renamed entity's name, | |
4150 | *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to | |
4151 | the string describing the subcomponent selected from the renamed | |
0963b4bd | 4152 | entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming |
aeb5907d JB |
4153 | (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR |
4154 | are undefined). Otherwise, returns a value indicating the category | |
4155 | of entity renamed: an object (ADA_OBJECT_RENAMING), exception | |
4156 | (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or | |
4157 | subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the | |
4158 | strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be | |
4159 | deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR | |
4160 | may be NULL, in which case they are not assigned. | |
4161 | ||
4162 | [Currently, however, GCC does not generate subprogram renamings.] */ | |
4163 | ||
4164 | enum ada_renaming_category | |
4165 | ada_parse_renaming (struct symbol *sym, | |
4166 | const char **renamed_entity, int *len, | |
4167 | const char **renaming_expr) | |
4168 | { | |
4169 | enum ada_renaming_category kind; | |
4170 | const char *info; | |
4171 | const char *suffix; | |
4172 | ||
4173 | if (sym == NULL) | |
4174 | return ADA_NOT_RENAMING; | |
4175 | switch (SYMBOL_CLASS (sym)) | |
14f9c5c9 | 4176 | { |
aeb5907d JB |
4177 | default: |
4178 | return ADA_NOT_RENAMING; | |
4179 | case LOC_TYPEDEF: | |
4180 | return parse_old_style_renaming (SYMBOL_TYPE (sym), | |
4181 | renamed_entity, len, renaming_expr); | |
4182 | case LOC_LOCAL: | |
4183 | case LOC_STATIC: | |
4184 | case LOC_COMPUTED: | |
4185 | case LOC_OPTIMIZED_OUT: | |
4186 | info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR"); | |
4187 | if (info == NULL) | |
4188 | return ADA_NOT_RENAMING; | |
4189 | switch (info[5]) | |
4190 | { | |
4191 | case '_': | |
4192 | kind = ADA_OBJECT_RENAMING; | |
4193 | info += 6; | |
4194 | break; | |
4195 | case 'E': | |
4196 | kind = ADA_EXCEPTION_RENAMING; | |
4197 | info += 7; | |
4198 | break; | |
4199 | case 'P': | |
4200 | kind = ADA_PACKAGE_RENAMING; | |
4201 | info += 7; | |
4202 | break; | |
4203 | case 'S': | |
4204 | kind = ADA_SUBPROGRAM_RENAMING; | |
4205 | info += 7; | |
4206 | break; | |
4207 | default: | |
4208 | return ADA_NOT_RENAMING; | |
4209 | } | |
14f9c5c9 | 4210 | } |
4c4b4cd2 | 4211 | |
aeb5907d JB |
4212 | if (renamed_entity != NULL) |
4213 | *renamed_entity = info; | |
4214 | suffix = strstr (info, "___XE"); | |
4215 | if (suffix == NULL || suffix == info) | |
4216 | return ADA_NOT_RENAMING; | |
4217 | if (len != NULL) | |
4218 | *len = strlen (info) - strlen (suffix); | |
4219 | suffix += 5; | |
4220 | if (renaming_expr != NULL) | |
4221 | *renaming_expr = suffix; | |
4222 | return kind; | |
4223 | } | |
4224 | ||
4225 | /* Assuming TYPE encodes a renaming according to the old encoding in | |
4226 | exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY, | |
4227 | *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns | |
4228 | ADA_NOT_RENAMING otherwise. */ | |
4229 | static enum ada_renaming_category | |
4230 | parse_old_style_renaming (struct type *type, | |
4231 | const char **renamed_entity, int *len, | |
4232 | const char **renaming_expr) | |
4233 | { | |
4234 | enum ada_renaming_category kind; | |
4235 | const char *name; | |
4236 | const char *info; | |
4237 | const char *suffix; | |
14f9c5c9 | 4238 | |
aeb5907d JB |
4239 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM |
4240 | || TYPE_NFIELDS (type) != 1) | |
4241 | return ADA_NOT_RENAMING; | |
14f9c5c9 | 4242 | |
aeb5907d JB |
4243 | name = type_name_no_tag (type); |
4244 | if (name == NULL) | |
4245 | return ADA_NOT_RENAMING; | |
4246 | ||
4247 | name = strstr (name, "___XR"); | |
4248 | if (name == NULL) | |
4249 | return ADA_NOT_RENAMING; | |
4250 | switch (name[5]) | |
4251 | { | |
4252 | case '\0': | |
4253 | case '_': | |
4254 | kind = ADA_OBJECT_RENAMING; | |
4255 | break; | |
4256 | case 'E': | |
4257 | kind = ADA_EXCEPTION_RENAMING; | |
4258 | break; | |
4259 | case 'P': | |
4260 | kind = ADA_PACKAGE_RENAMING; | |
4261 | break; | |
4262 | case 'S': | |
4263 | kind = ADA_SUBPROGRAM_RENAMING; | |
4264 | break; | |
4265 | default: | |
4266 | return ADA_NOT_RENAMING; | |
4267 | } | |
14f9c5c9 | 4268 | |
aeb5907d JB |
4269 | info = TYPE_FIELD_NAME (type, 0); |
4270 | if (info == NULL) | |
4271 | return ADA_NOT_RENAMING; | |
4272 | if (renamed_entity != NULL) | |
4273 | *renamed_entity = info; | |
4274 | suffix = strstr (info, "___XE"); | |
4275 | if (renaming_expr != NULL) | |
4276 | *renaming_expr = suffix + 5; | |
4277 | if (suffix == NULL || suffix == info) | |
4278 | return ADA_NOT_RENAMING; | |
4279 | if (len != NULL) | |
4280 | *len = suffix - info; | |
4281 | return kind; | |
a5ee536b JB |
4282 | } |
4283 | ||
4284 | /* Compute the value of the given RENAMING_SYM, which is expected to | |
4285 | be a symbol encoding a renaming expression. BLOCK is the block | |
4286 | used to evaluate the renaming. */ | |
52ce6436 | 4287 | |
a5ee536b JB |
4288 | static struct value * |
4289 | ada_read_renaming_var_value (struct symbol *renaming_sym, | |
3977b71f | 4290 | const struct block *block) |
a5ee536b | 4291 | { |
bbc13ae3 | 4292 | const char *sym_name; |
a5ee536b JB |
4293 | struct expression *expr; |
4294 | struct value *value; | |
4295 | struct cleanup *old_chain = NULL; | |
4296 | ||
bbc13ae3 | 4297 | sym_name = SYMBOL_LINKAGE_NAME (renaming_sym); |
1bb9788d | 4298 | expr = parse_exp_1 (&sym_name, 0, block, 0); |
bbc13ae3 | 4299 | old_chain = make_cleanup (free_current_contents, &expr); |
a5ee536b JB |
4300 | value = evaluate_expression (expr); |
4301 | ||
4302 | do_cleanups (old_chain); | |
4303 | return value; | |
4304 | } | |
14f9c5c9 | 4305 | \f |
d2e4a39e | 4306 | |
4c4b4cd2 | 4307 | /* Evaluation: Function Calls */ |
14f9c5c9 | 4308 | |
4c4b4cd2 | 4309 | /* Return an lvalue containing the value VAL. This is the identity on |
40bc484c JB |
4310 | lvalues, and otherwise has the side-effect of allocating memory |
4311 | in the inferior where a copy of the value contents is copied. */ | |
14f9c5c9 | 4312 | |
d2e4a39e | 4313 | static struct value * |
40bc484c | 4314 | ensure_lval (struct value *val) |
14f9c5c9 | 4315 | { |
40bc484c JB |
4316 | if (VALUE_LVAL (val) == not_lval |
4317 | || VALUE_LVAL (val) == lval_internalvar) | |
c3e5cd34 | 4318 | { |
df407dfe | 4319 | int len = TYPE_LENGTH (ada_check_typedef (value_type (val))); |
40bc484c JB |
4320 | const CORE_ADDR addr = |
4321 | value_as_long (value_allocate_space_in_inferior (len)); | |
c3e5cd34 | 4322 | |
40bc484c | 4323 | set_value_address (val, addr); |
a84a8a0d | 4324 | VALUE_LVAL (val) = lval_memory; |
40bc484c | 4325 | write_memory (addr, value_contents (val), len); |
c3e5cd34 | 4326 | } |
14f9c5c9 AS |
4327 | |
4328 | return val; | |
4329 | } | |
4330 | ||
4331 | /* Return the value ACTUAL, converted to be an appropriate value for a | |
4332 | formal of type FORMAL_TYPE. Use *SP as a stack pointer for | |
4333 | allocating any necessary descriptors (fat pointers), or copies of | |
4c4b4cd2 | 4334 | values not residing in memory, updating it as needed. */ |
14f9c5c9 | 4335 | |
a93c0eb6 | 4336 | struct value * |
40bc484c | 4337 | ada_convert_actual (struct value *actual, struct type *formal_type0) |
14f9c5c9 | 4338 | { |
df407dfe | 4339 | struct type *actual_type = ada_check_typedef (value_type (actual)); |
61ee279c | 4340 | struct type *formal_type = ada_check_typedef (formal_type0); |
d2e4a39e AS |
4341 | struct type *formal_target = |
4342 | TYPE_CODE (formal_type) == TYPE_CODE_PTR | |
61ee279c | 4343 | ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type; |
d2e4a39e AS |
4344 | struct type *actual_target = |
4345 | TYPE_CODE (actual_type) == TYPE_CODE_PTR | |
61ee279c | 4346 | ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type; |
14f9c5c9 | 4347 | |
4c4b4cd2 | 4348 | if (ada_is_array_descriptor_type (formal_target) |
14f9c5c9 | 4349 | && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY) |
40bc484c | 4350 | return make_array_descriptor (formal_type, actual); |
a84a8a0d JB |
4351 | else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR |
4352 | || TYPE_CODE (formal_type) == TYPE_CODE_REF) | |
14f9c5c9 | 4353 | { |
a84a8a0d | 4354 | struct value *result; |
5b4ee69b | 4355 | |
14f9c5c9 | 4356 | if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY |
4c4b4cd2 | 4357 | && ada_is_array_descriptor_type (actual_target)) |
a84a8a0d | 4358 | result = desc_data (actual); |
14f9c5c9 | 4359 | else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR) |
4c4b4cd2 PH |
4360 | { |
4361 | if (VALUE_LVAL (actual) != lval_memory) | |
4362 | { | |
4363 | struct value *val; | |
5b4ee69b | 4364 | |
df407dfe | 4365 | actual_type = ada_check_typedef (value_type (actual)); |
4c4b4cd2 | 4366 | val = allocate_value (actual_type); |
990a07ab | 4367 | memcpy ((char *) value_contents_raw (val), |
0fd88904 | 4368 | (char *) value_contents (actual), |
4c4b4cd2 | 4369 | TYPE_LENGTH (actual_type)); |
40bc484c | 4370 | actual = ensure_lval (val); |
4c4b4cd2 | 4371 | } |
a84a8a0d | 4372 | result = value_addr (actual); |
4c4b4cd2 | 4373 | } |
a84a8a0d JB |
4374 | else |
4375 | return actual; | |
b1af9e97 | 4376 | return value_cast_pointers (formal_type, result, 0); |
14f9c5c9 AS |
4377 | } |
4378 | else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR) | |
4379 | return ada_value_ind (actual); | |
8344af1e JB |
4380 | else if (ada_is_aligner_type (formal_type)) |
4381 | { | |
4382 | /* We need to turn this parameter into an aligner type | |
4383 | as well. */ | |
4384 | struct value *aligner = allocate_value (formal_type); | |
4385 | struct value *component = ada_value_struct_elt (aligner, "F", 0); | |
4386 | ||
4387 | value_assign_to_component (aligner, component, actual); | |
4388 | return aligner; | |
4389 | } | |
14f9c5c9 AS |
4390 | |
4391 | return actual; | |
4392 | } | |
4393 | ||
438c98a1 JB |
4394 | /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of |
4395 | type TYPE. This is usually an inefficient no-op except on some targets | |
4396 | (such as AVR) where the representation of a pointer and an address | |
4397 | differs. */ | |
4398 | ||
4399 | static CORE_ADDR | |
4400 | value_pointer (struct value *value, struct type *type) | |
4401 | { | |
4402 | struct gdbarch *gdbarch = get_type_arch (type); | |
4403 | unsigned len = TYPE_LENGTH (type); | |
4404 | gdb_byte *buf = alloca (len); | |
4405 | CORE_ADDR addr; | |
4406 | ||
4407 | addr = value_address (value); | |
4408 | gdbarch_address_to_pointer (gdbarch, type, buf, addr); | |
4409 | addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch)); | |
4410 | return addr; | |
4411 | } | |
4412 | ||
14f9c5c9 | 4413 | |
4c4b4cd2 PH |
4414 | /* Push a descriptor of type TYPE for array value ARR on the stack at |
4415 | *SP, updating *SP to reflect the new descriptor. Return either | |
14f9c5c9 | 4416 | an lvalue representing the new descriptor, or (if TYPE is a pointer- |
4c4b4cd2 PH |
4417 | to-descriptor type rather than a descriptor type), a struct value * |
4418 | representing a pointer to this descriptor. */ | |
14f9c5c9 | 4419 | |
d2e4a39e | 4420 | static struct value * |
40bc484c | 4421 | make_array_descriptor (struct type *type, struct value *arr) |
14f9c5c9 | 4422 | { |
d2e4a39e AS |
4423 | struct type *bounds_type = desc_bounds_type (type); |
4424 | struct type *desc_type = desc_base_type (type); | |
4425 | struct value *descriptor = allocate_value (desc_type); | |
4426 | struct value *bounds = allocate_value (bounds_type); | |
14f9c5c9 | 4427 | int i; |
d2e4a39e | 4428 | |
0963b4bd MS |
4429 | for (i = ada_array_arity (ada_check_typedef (value_type (arr))); |
4430 | i > 0; i -= 1) | |
14f9c5c9 | 4431 | { |
19f220c3 JK |
4432 | modify_field (value_type (bounds), value_contents_writeable (bounds), |
4433 | ada_array_bound (arr, i, 0), | |
4434 | desc_bound_bitpos (bounds_type, i, 0), | |
4435 | desc_bound_bitsize (bounds_type, i, 0)); | |
4436 | modify_field (value_type (bounds), value_contents_writeable (bounds), | |
4437 | ada_array_bound (arr, i, 1), | |
4438 | desc_bound_bitpos (bounds_type, i, 1), | |
4439 | desc_bound_bitsize (bounds_type, i, 1)); | |
14f9c5c9 | 4440 | } |
d2e4a39e | 4441 | |
40bc484c | 4442 | bounds = ensure_lval (bounds); |
d2e4a39e | 4443 | |
19f220c3 JK |
4444 | modify_field (value_type (descriptor), |
4445 | value_contents_writeable (descriptor), | |
4446 | value_pointer (ensure_lval (arr), | |
4447 | TYPE_FIELD_TYPE (desc_type, 0)), | |
4448 | fat_pntr_data_bitpos (desc_type), | |
4449 | fat_pntr_data_bitsize (desc_type)); | |
4450 | ||
4451 | modify_field (value_type (descriptor), | |
4452 | value_contents_writeable (descriptor), | |
4453 | value_pointer (bounds, | |
4454 | TYPE_FIELD_TYPE (desc_type, 1)), | |
4455 | fat_pntr_bounds_bitpos (desc_type), | |
4456 | fat_pntr_bounds_bitsize (desc_type)); | |
14f9c5c9 | 4457 | |
40bc484c | 4458 | descriptor = ensure_lval (descriptor); |
14f9c5c9 AS |
4459 | |
4460 | if (TYPE_CODE (type) == TYPE_CODE_PTR) | |
4461 | return value_addr (descriptor); | |
4462 | else | |
4463 | return descriptor; | |
4464 | } | |
14f9c5c9 | 4465 | \f |
3d9434b5 JB |
4466 | /* Symbol Cache Module */ |
4467 | ||
3d9434b5 | 4468 | /* Performance measurements made as of 2010-01-15 indicate that |
ee01b665 | 4469 | this cache does bring some noticeable improvements. Depending |
3d9434b5 JB |
4470 | on the type of entity being printed, the cache can make it as much |
4471 | as an order of magnitude faster than without it. | |
4472 | ||
4473 | The descriptive type DWARF extension has significantly reduced | |
4474 | the need for this cache, at least when DWARF is being used. However, | |
4475 | even in this case, some expensive name-based symbol searches are still | |
4476 | sometimes necessary - to find an XVZ variable, mostly. */ | |
4477 | ||
ee01b665 | 4478 | /* Initialize the contents of SYM_CACHE. */ |
3d9434b5 | 4479 | |
ee01b665 JB |
4480 | static void |
4481 | ada_init_symbol_cache (struct ada_symbol_cache *sym_cache) | |
4482 | { | |
4483 | obstack_init (&sym_cache->cache_space); | |
4484 | memset (sym_cache->root, '\000', sizeof (sym_cache->root)); | |
4485 | } | |
3d9434b5 | 4486 | |
ee01b665 JB |
4487 | /* Free the memory used by SYM_CACHE. */ |
4488 | ||
4489 | static void | |
4490 | ada_free_symbol_cache (struct ada_symbol_cache *sym_cache) | |
3d9434b5 | 4491 | { |
ee01b665 JB |
4492 | obstack_free (&sym_cache->cache_space, NULL); |
4493 | xfree (sym_cache); | |
4494 | } | |
3d9434b5 | 4495 | |
ee01b665 JB |
4496 | /* Return the symbol cache associated to the given program space PSPACE. |
4497 | If not allocated for this PSPACE yet, allocate and initialize one. */ | |
3d9434b5 | 4498 | |
ee01b665 JB |
4499 | static struct ada_symbol_cache * |
4500 | ada_get_symbol_cache (struct program_space *pspace) | |
4501 | { | |
4502 | struct ada_pspace_data *pspace_data = get_ada_pspace_data (pspace); | |
ee01b665 | 4503 | |
66c168ae | 4504 | if (pspace_data->sym_cache == NULL) |
ee01b665 | 4505 | { |
66c168ae JB |
4506 | pspace_data->sym_cache = XCNEW (struct ada_symbol_cache); |
4507 | ada_init_symbol_cache (pspace_data->sym_cache); | |
ee01b665 JB |
4508 | } |
4509 | ||
66c168ae | 4510 | return pspace_data->sym_cache; |
ee01b665 | 4511 | } |
3d9434b5 JB |
4512 | |
4513 | /* Clear all entries from the symbol cache. */ | |
4514 | ||
4515 | static void | |
4516 | ada_clear_symbol_cache (void) | |
4517 | { | |
ee01b665 JB |
4518 | struct ada_symbol_cache *sym_cache |
4519 | = ada_get_symbol_cache (current_program_space); | |
4520 | ||
4521 | obstack_free (&sym_cache->cache_space, NULL); | |
4522 | ada_init_symbol_cache (sym_cache); | |
3d9434b5 JB |
4523 | } |
4524 | ||
fe978cb0 | 4525 | /* Search our cache for an entry matching NAME and DOMAIN. |
3d9434b5 JB |
4526 | Return it if found, or NULL otherwise. */ |
4527 | ||
4528 | static struct cache_entry ** | |
fe978cb0 | 4529 | find_entry (const char *name, domain_enum domain) |
3d9434b5 | 4530 | { |
ee01b665 JB |
4531 | struct ada_symbol_cache *sym_cache |
4532 | = ada_get_symbol_cache (current_program_space); | |
3d9434b5 JB |
4533 | int h = msymbol_hash (name) % HASH_SIZE; |
4534 | struct cache_entry **e; | |
4535 | ||
ee01b665 | 4536 | for (e = &sym_cache->root[h]; *e != NULL; e = &(*e)->next) |
3d9434b5 | 4537 | { |
fe978cb0 | 4538 | if (domain == (*e)->domain && strcmp (name, (*e)->name) == 0) |
3d9434b5 JB |
4539 | return e; |
4540 | } | |
4541 | return NULL; | |
4542 | } | |
4543 | ||
fe978cb0 | 4544 | /* Search the symbol cache for an entry matching NAME and DOMAIN. |
3d9434b5 JB |
4545 | Return 1 if found, 0 otherwise. |
4546 | ||
4547 | If an entry was found and SYM is not NULL, set *SYM to the entry's | |
4548 | SYM. Same principle for BLOCK if not NULL. */ | |
96d887e8 | 4549 | |
96d887e8 | 4550 | static int |
fe978cb0 | 4551 | lookup_cached_symbol (const char *name, domain_enum domain, |
f0c5f9b2 | 4552 | struct symbol **sym, const struct block **block) |
96d887e8 | 4553 | { |
fe978cb0 | 4554 | struct cache_entry **e = find_entry (name, domain); |
3d9434b5 JB |
4555 | |
4556 | if (e == NULL) | |
4557 | return 0; | |
4558 | if (sym != NULL) | |
4559 | *sym = (*e)->sym; | |
4560 | if (block != NULL) | |
4561 | *block = (*e)->block; | |
4562 | return 1; | |
96d887e8 PH |
4563 | } |
4564 | ||
3d9434b5 | 4565 | /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME |
fe978cb0 | 4566 | in domain DOMAIN, save this result in our symbol cache. */ |
3d9434b5 | 4567 | |
96d887e8 | 4568 | static void |
fe978cb0 | 4569 | cache_symbol (const char *name, domain_enum domain, struct symbol *sym, |
270140bd | 4570 | const struct block *block) |
96d887e8 | 4571 | { |
ee01b665 JB |
4572 | struct ada_symbol_cache *sym_cache |
4573 | = ada_get_symbol_cache (current_program_space); | |
3d9434b5 JB |
4574 | int h; |
4575 | char *copy; | |
4576 | struct cache_entry *e; | |
4577 | ||
1994afbf DE |
4578 | /* Symbols for builtin types don't have a block. |
4579 | For now don't cache such symbols. */ | |
4580 | if (sym != NULL && !SYMBOL_OBJFILE_OWNED (sym)) | |
4581 | return; | |
4582 | ||
3d9434b5 JB |
4583 | /* If the symbol is a local symbol, then do not cache it, as a search |
4584 | for that symbol depends on the context. To determine whether | |
4585 | the symbol is local or not, we check the block where we found it | |
4586 | against the global and static blocks of its associated symtab. */ | |
4587 | if (sym | |
08be3fe3 | 4588 | && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)), |
439247b6 | 4589 | GLOBAL_BLOCK) != block |
08be3fe3 | 4590 | && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)), |
439247b6 | 4591 | STATIC_BLOCK) != block) |
3d9434b5 JB |
4592 | return; |
4593 | ||
4594 | h = msymbol_hash (name) % HASH_SIZE; | |
ee01b665 JB |
4595 | e = (struct cache_entry *) obstack_alloc (&sym_cache->cache_space, |
4596 | sizeof (*e)); | |
4597 | e->next = sym_cache->root[h]; | |
4598 | sym_cache->root[h] = e; | |
4599 | e->name = copy = obstack_alloc (&sym_cache->cache_space, strlen (name) + 1); | |
3d9434b5 JB |
4600 | strcpy (copy, name); |
4601 | e->sym = sym; | |
fe978cb0 | 4602 | e->domain = domain; |
3d9434b5 | 4603 | e->block = block; |
96d887e8 | 4604 | } |
4c4b4cd2 PH |
4605 | \f |
4606 | /* Symbol Lookup */ | |
4607 | ||
c0431670 JB |
4608 | /* Return nonzero if wild matching should be used when searching for |
4609 | all symbols matching LOOKUP_NAME. | |
4610 | ||
4611 | LOOKUP_NAME is expected to be a symbol name after transformation | |
4612 | for Ada lookups (see ada_name_for_lookup). */ | |
4613 | ||
4614 | static int | |
4615 | should_use_wild_match (const char *lookup_name) | |
4616 | { | |
4617 | return (strstr (lookup_name, "__") == NULL); | |
4618 | } | |
4619 | ||
4c4b4cd2 PH |
4620 | /* Return the result of a standard (literal, C-like) lookup of NAME in |
4621 | given DOMAIN, visible from lexical block BLOCK. */ | |
4622 | ||
4623 | static struct symbol * | |
4624 | standard_lookup (const char *name, const struct block *block, | |
4625 | domain_enum domain) | |
4626 | { | |
acbd605d | 4627 | /* Initialize it just to avoid a GCC false warning. */ |
d12307c1 | 4628 | struct block_symbol sym = {NULL, NULL}; |
4c4b4cd2 | 4629 | |
d12307c1 PMR |
4630 | if (lookup_cached_symbol (name, domain, &sym.symbol, NULL)) |
4631 | return sym.symbol; | |
2570f2b7 | 4632 | sym = lookup_symbol_in_language (name, block, domain, language_c, 0); |
d12307c1 PMR |
4633 | cache_symbol (name, domain, sym.symbol, sym.block); |
4634 | return sym.symbol; | |
4c4b4cd2 PH |
4635 | } |
4636 | ||
4637 | ||
4638 | /* Non-zero iff there is at least one non-function/non-enumeral symbol | |
4639 | in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions, | |
4640 | since they contend in overloading in the same way. */ | |
4641 | static int | |
d12307c1 | 4642 | is_nonfunction (struct block_symbol syms[], int n) |
4c4b4cd2 PH |
4643 | { |
4644 | int i; | |
4645 | ||
4646 | for (i = 0; i < n; i += 1) | |
d12307c1 PMR |
4647 | if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_FUNC |
4648 | && (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM | |
4649 | || SYMBOL_CLASS (syms[i].symbol) != LOC_CONST)) | |
14f9c5c9 AS |
4650 | return 1; |
4651 | ||
4652 | return 0; | |
4653 | } | |
4654 | ||
4655 | /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent | |
4c4b4cd2 | 4656 | struct types. Otherwise, they may not. */ |
14f9c5c9 AS |
4657 | |
4658 | static int | |
d2e4a39e | 4659 | equiv_types (struct type *type0, struct type *type1) |
14f9c5c9 | 4660 | { |
d2e4a39e | 4661 | if (type0 == type1) |
14f9c5c9 | 4662 | return 1; |
d2e4a39e | 4663 | if (type0 == NULL || type1 == NULL |
14f9c5c9 AS |
4664 | || TYPE_CODE (type0) != TYPE_CODE (type1)) |
4665 | return 0; | |
d2e4a39e | 4666 | if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT |
14f9c5c9 AS |
4667 | || TYPE_CODE (type0) == TYPE_CODE_ENUM) |
4668 | && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL | |
4c4b4cd2 | 4669 | && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0) |
14f9c5c9 | 4670 | return 1; |
d2e4a39e | 4671 | |
14f9c5c9 AS |
4672 | return 0; |
4673 | } | |
4674 | ||
4675 | /* True iff SYM0 represents the same entity as SYM1, or one that is | |
4c4b4cd2 | 4676 | no more defined than that of SYM1. */ |
14f9c5c9 AS |
4677 | |
4678 | static int | |
d2e4a39e | 4679 | lesseq_defined_than (struct symbol *sym0, struct symbol *sym1) |
14f9c5c9 AS |
4680 | { |
4681 | if (sym0 == sym1) | |
4682 | return 1; | |
176620f1 | 4683 | if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1) |
14f9c5c9 AS |
4684 | || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1)) |
4685 | return 0; | |
4686 | ||
d2e4a39e | 4687 | switch (SYMBOL_CLASS (sym0)) |
14f9c5c9 AS |
4688 | { |
4689 | case LOC_UNDEF: | |
4690 | return 1; | |
4691 | case LOC_TYPEDEF: | |
4692 | { | |
4c4b4cd2 PH |
4693 | struct type *type0 = SYMBOL_TYPE (sym0); |
4694 | struct type *type1 = SYMBOL_TYPE (sym1); | |
0d5cff50 DE |
4695 | const char *name0 = SYMBOL_LINKAGE_NAME (sym0); |
4696 | const char *name1 = SYMBOL_LINKAGE_NAME (sym1); | |
4c4b4cd2 | 4697 | int len0 = strlen (name0); |
5b4ee69b | 4698 | |
4c4b4cd2 PH |
4699 | return |
4700 | TYPE_CODE (type0) == TYPE_CODE (type1) | |
4701 | && (equiv_types (type0, type1) | |
4702 | || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0 | |
61012eef | 4703 | && startswith (name1 + len0, "___XV"))); |
14f9c5c9 AS |
4704 | } |
4705 | case LOC_CONST: | |
4706 | return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1) | |
4c4b4cd2 | 4707 | && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1)); |
d2e4a39e AS |
4708 | default: |
4709 | return 0; | |
14f9c5c9 AS |
4710 | } |
4711 | } | |
4712 | ||
d12307c1 | 4713 | /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol |
4c4b4cd2 | 4714 | records in OBSTACKP. Do nothing if SYM is a duplicate. */ |
14f9c5c9 AS |
4715 | |
4716 | static void | |
76a01679 JB |
4717 | add_defn_to_vec (struct obstack *obstackp, |
4718 | struct symbol *sym, | |
f0c5f9b2 | 4719 | const struct block *block) |
14f9c5c9 AS |
4720 | { |
4721 | int i; | |
d12307c1 | 4722 | struct block_symbol *prevDefns = defns_collected (obstackp, 0); |
14f9c5c9 | 4723 | |
529cad9c PH |
4724 | /* Do not try to complete stub types, as the debugger is probably |
4725 | already scanning all symbols matching a certain name at the | |
4726 | time when this function is called. Trying to replace the stub | |
4727 | type by its associated full type will cause us to restart a scan | |
4728 | which may lead to an infinite recursion. Instead, the client | |
4729 | collecting the matching symbols will end up collecting several | |
4730 | matches, with at least one of them complete. It can then filter | |
4731 | out the stub ones if needed. */ | |
4732 | ||
4c4b4cd2 PH |
4733 | for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1) |
4734 | { | |
d12307c1 | 4735 | if (lesseq_defined_than (sym, prevDefns[i].symbol)) |
4c4b4cd2 | 4736 | return; |
d12307c1 | 4737 | else if (lesseq_defined_than (prevDefns[i].symbol, sym)) |
4c4b4cd2 | 4738 | { |
d12307c1 | 4739 | prevDefns[i].symbol = sym; |
4c4b4cd2 | 4740 | prevDefns[i].block = block; |
4c4b4cd2 | 4741 | return; |
76a01679 | 4742 | } |
4c4b4cd2 PH |
4743 | } |
4744 | ||
4745 | { | |
d12307c1 | 4746 | struct block_symbol info; |
4c4b4cd2 | 4747 | |
d12307c1 | 4748 | info.symbol = sym; |
4c4b4cd2 | 4749 | info.block = block; |
d12307c1 | 4750 | obstack_grow (obstackp, &info, sizeof (struct block_symbol)); |
4c4b4cd2 PH |
4751 | } |
4752 | } | |
4753 | ||
d12307c1 PMR |
4754 | /* Number of block_symbol structures currently collected in current vector in |
4755 | OBSTACKP. */ | |
4c4b4cd2 | 4756 | |
76a01679 JB |
4757 | static int |
4758 | num_defns_collected (struct obstack *obstackp) | |
4c4b4cd2 | 4759 | { |
d12307c1 | 4760 | return obstack_object_size (obstackp) / sizeof (struct block_symbol); |
4c4b4cd2 PH |
4761 | } |
4762 | ||
d12307c1 PMR |
4763 | /* Vector of block_symbol structures currently collected in current vector in |
4764 | OBSTACKP. If FINISH, close off the vector and return its final address. */ | |
4c4b4cd2 | 4765 | |
d12307c1 | 4766 | static struct block_symbol * |
4c4b4cd2 PH |
4767 | defns_collected (struct obstack *obstackp, int finish) |
4768 | { | |
4769 | if (finish) | |
4770 | return obstack_finish (obstackp); | |
4771 | else | |
d12307c1 | 4772 | return (struct block_symbol *) obstack_base (obstackp); |
4c4b4cd2 PH |
4773 | } |
4774 | ||
7c7b6655 TT |
4775 | /* Return a bound minimal symbol matching NAME according to Ada |
4776 | decoding rules. Returns an invalid symbol if there is no such | |
4777 | minimal symbol. Names prefixed with "standard__" are handled | |
4778 | specially: "standard__" is first stripped off, and only static and | |
4779 | global symbols are searched. */ | |
4c4b4cd2 | 4780 | |
7c7b6655 | 4781 | struct bound_minimal_symbol |
96d887e8 | 4782 | ada_lookup_simple_minsym (const char *name) |
4c4b4cd2 | 4783 | { |
7c7b6655 | 4784 | struct bound_minimal_symbol result; |
4c4b4cd2 | 4785 | struct objfile *objfile; |
96d887e8 | 4786 | struct minimal_symbol *msymbol; |
dc4024cd | 4787 | const int wild_match_p = should_use_wild_match (name); |
4c4b4cd2 | 4788 | |
7c7b6655 TT |
4789 | memset (&result, 0, sizeof (result)); |
4790 | ||
c0431670 JB |
4791 | /* Special case: If the user specifies a symbol name inside package |
4792 | Standard, do a non-wild matching of the symbol name without | |
4793 | the "standard__" prefix. This was primarily introduced in order | |
4794 | to allow the user to specifically access the standard exceptions | |
4795 | using, for instance, Standard.Constraint_Error when Constraint_Error | |
4796 | is ambiguous (due to the user defining its own Constraint_Error | |
4797 | entity inside its program). */ | |
61012eef | 4798 | if (startswith (name, "standard__")) |
c0431670 | 4799 | name += sizeof ("standard__") - 1; |
4c4b4cd2 | 4800 | |
96d887e8 PH |
4801 | ALL_MSYMBOLS (objfile, msymbol) |
4802 | { | |
efd66ac6 | 4803 | if (match_name (MSYMBOL_LINKAGE_NAME (msymbol), name, wild_match_p) |
96d887e8 | 4804 | && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline) |
7c7b6655 TT |
4805 | { |
4806 | result.minsym = msymbol; | |
4807 | result.objfile = objfile; | |
4808 | break; | |
4809 | } | |
96d887e8 | 4810 | } |
4c4b4cd2 | 4811 | |
7c7b6655 | 4812 | return result; |
96d887e8 | 4813 | } |
4c4b4cd2 | 4814 | |
96d887e8 PH |
4815 | /* For all subprograms that statically enclose the subprogram of the |
4816 | selected frame, add symbols matching identifier NAME in DOMAIN | |
4817 | and their blocks to the list of data in OBSTACKP, as for | |
48b78332 JB |
4818 | ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME |
4819 | with a wildcard prefix. */ | |
4c4b4cd2 | 4820 | |
96d887e8 PH |
4821 | static void |
4822 | add_symbols_from_enclosing_procs (struct obstack *obstackp, | |
fe978cb0 | 4823 | const char *name, domain_enum domain, |
48b78332 | 4824 | int wild_match_p) |
96d887e8 | 4825 | { |
96d887e8 | 4826 | } |
14f9c5c9 | 4827 | |
96d887e8 PH |
4828 | /* True if TYPE is definitely an artificial type supplied to a symbol |
4829 | for which no debugging information was given in the symbol file. */ | |
14f9c5c9 | 4830 | |
96d887e8 PH |
4831 | static int |
4832 | is_nondebugging_type (struct type *type) | |
4833 | { | |
0d5cff50 | 4834 | const char *name = ada_type_name (type); |
5b4ee69b | 4835 | |
96d887e8 PH |
4836 | return (name != NULL && strcmp (name, "<variable, no debug info>") == 0); |
4837 | } | |
4c4b4cd2 | 4838 | |
8f17729f JB |
4839 | /* Return nonzero if TYPE1 and TYPE2 are two enumeration types |
4840 | that are deemed "identical" for practical purposes. | |
4841 | ||
4842 | This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM | |
4843 | types and that their number of enumerals is identical (in other | |
4844 | words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */ | |
4845 | ||
4846 | static int | |
4847 | ada_identical_enum_types_p (struct type *type1, struct type *type2) | |
4848 | { | |
4849 | int i; | |
4850 | ||
4851 | /* The heuristic we use here is fairly conservative. We consider | |
4852 | that 2 enumerate types are identical if they have the same | |
4853 | number of enumerals and that all enumerals have the same | |
4854 | underlying value and name. */ | |
4855 | ||
4856 | /* All enums in the type should have an identical underlying value. */ | |
4857 | for (i = 0; i < TYPE_NFIELDS (type1); i++) | |
14e75d8e | 4858 | if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i)) |
8f17729f JB |
4859 | return 0; |
4860 | ||
4861 | /* All enumerals should also have the same name (modulo any numerical | |
4862 | suffix). */ | |
4863 | for (i = 0; i < TYPE_NFIELDS (type1); i++) | |
4864 | { | |
0d5cff50 DE |
4865 | const char *name_1 = TYPE_FIELD_NAME (type1, i); |
4866 | const char *name_2 = TYPE_FIELD_NAME (type2, i); | |
8f17729f JB |
4867 | int len_1 = strlen (name_1); |
4868 | int len_2 = strlen (name_2); | |
4869 | ||
4870 | ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1); | |
4871 | ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2); | |
4872 | if (len_1 != len_2 | |
4873 | || strncmp (TYPE_FIELD_NAME (type1, i), | |
4874 | TYPE_FIELD_NAME (type2, i), | |
4875 | len_1) != 0) | |
4876 | return 0; | |
4877 | } | |
4878 | ||
4879 | return 1; | |
4880 | } | |
4881 | ||
4882 | /* Return nonzero if all the symbols in SYMS are all enumeral symbols | |
4883 | that are deemed "identical" for practical purposes. Sometimes, | |
4884 | enumerals are not strictly identical, but their types are so similar | |
4885 | that they can be considered identical. | |
4886 | ||
4887 | For instance, consider the following code: | |
4888 | ||
4889 | type Color is (Black, Red, Green, Blue, White); | |
4890 | type RGB_Color is new Color range Red .. Blue; | |
4891 | ||
4892 | Type RGB_Color is a subrange of an implicit type which is a copy | |
4893 | of type Color. If we call that implicit type RGB_ColorB ("B" is | |
4894 | for "Base Type"), then type RGB_ColorB is a copy of type Color. | |
4895 | As a result, when an expression references any of the enumeral | |
4896 | by name (Eg. "print green"), the expression is technically | |
4897 | ambiguous and the user should be asked to disambiguate. But | |
4898 | doing so would only hinder the user, since it wouldn't matter | |
4899 | what choice he makes, the outcome would always be the same. | |
4900 | So, for practical purposes, we consider them as the same. */ | |
4901 | ||
4902 | static int | |
d12307c1 | 4903 | symbols_are_identical_enums (struct block_symbol *syms, int nsyms) |
8f17729f JB |
4904 | { |
4905 | int i; | |
4906 | ||
4907 | /* Before performing a thorough comparison check of each type, | |
4908 | we perform a series of inexpensive checks. We expect that these | |
4909 | checks will quickly fail in the vast majority of cases, and thus | |
4910 | help prevent the unnecessary use of a more expensive comparison. | |
4911 | Said comparison also expects us to make some of these checks | |
4912 | (see ada_identical_enum_types_p). */ | |
4913 | ||
4914 | /* Quick check: All symbols should have an enum type. */ | |
4915 | for (i = 0; i < nsyms; i++) | |
d12307c1 | 4916 | if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM) |
8f17729f JB |
4917 | return 0; |
4918 | ||
4919 | /* Quick check: They should all have the same value. */ | |
4920 | for (i = 1; i < nsyms; i++) | |
d12307c1 | 4921 | if (SYMBOL_VALUE (syms[i].symbol) != SYMBOL_VALUE (syms[0].symbol)) |
8f17729f JB |
4922 | return 0; |
4923 | ||
4924 | /* Quick check: They should all have the same number of enumerals. */ | |
4925 | for (i = 1; i < nsyms; i++) | |
d12307c1 PMR |
4926 | if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].symbol)) |
4927 | != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].symbol))) | |
8f17729f JB |
4928 | return 0; |
4929 | ||
4930 | /* All the sanity checks passed, so we might have a set of | |
4931 | identical enumeration types. Perform a more complete | |
4932 | comparison of the type of each symbol. */ | |
4933 | for (i = 1; i < nsyms; i++) | |
d12307c1 PMR |
4934 | if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].symbol), |
4935 | SYMBOL_TYPE (syms[0].symbol))) | |
8f17729f JB |
4936 | return 0; |
4937 | ||
4938 | return 1; | |
4939 | } | |
4940 | ||
96d887e8 PH |
4941 | /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely |
4942 | duplicate other symbols in the list (The only case I know of where | |
4943 | this happens is when object files containing stabs-in-ecoff are | |
4944 | linked with files containing ordinary ecoff debugging symbols (or no | |
4945 | debugging symbols)). Modifies SYMS to squeeze out deleted entries. | |
4946 | Returns the number of items in the modified list. */ | |
4c4b4cd2 | 4947 | |
96d887e8 | 4948 | static int |
d12307c1 | 4949 | remove_extra_symbols (struct block_symbol *syms, int nsyms) |
96d887e8 PH |
4950 | { |
4951 | int i, j; | |
4c4b4cd2 | 4952 | |
8f17729f JB |
4953 | /* We should never be called with less than 2 symbols, as there |
4954 | cannot be any extra symbol in that case. But it's easy to | |
4955 | handle, since we have nothing to do in that case. */ | |
4956 | if (nsyms < 2) | |
4957 | return nsyms; | |
4958 | ||
96d887e8 PH |
4959 | i = 0; |
4960 | while (i < nsyms) | |
4961 | { | |
a35ddb44 | 4962 | int remove_p = 0; |
339c13b6 JB |
4963 | |
4964 | /* If two symbols have the same name and one of them is a stub type, | |
4965 | the get rid of the stub. */ | |
4966 | ||
d12307c1 PMR |
4967 | if (TYPE_STUB (SYMBOL_TYPE (syms[i].symbol)) |
4968 | && SYMBOL_LINKAGE_NAME (syms[i].symbol) != NULL) | |
339c13b6 JB |
4969 | { |
4970 | for (j = 0; j < nsyms; j++) | |
4971 | { | |
4972 | if (j != i | |
d12307c1 PMR |
4973 | && !TYPE_STUB (SYMBOL_TYPE (syms[j].symbol)) |
4974 | && SYMBOL_LINKAGE_NAME (syms[j].symbol) != NULL | |
4975 | && strcmp (SYMBOL_LINKAGE_NAME (syms[i].symbol), | |
4976 | SYMBOL_LINKAGE_NAME (syms[j].symbol)) == 0) | |
a35ddb44 | 4977 | remove_p = 1; |
339c13b6 JB |
4978 | } |
4979 | } | |
4980 | ||
4981 | /* Two symbols with the same name, same class and same address | |
4982 | should be identical. */ | |
4983 | ||
d12307c1 PMR |
4984 | else if (SYMBOL_LINKAGE_NAME (syms[i].symbol) != NULL |
4985 | && SYMBOL_CLASS (syms[i].symbol) == LOC_STATIC | |
4986 | && is_nondebugging_type (SYMBOL_TYPE (syms[i].symbol))) | |
96d887e8 PH |
4987 | { |
4988 | for (j = 0; j < nsyms; j += 1) | |
4989 | { | |
4990 | if (i != j | |
d12307c1 PMR |
4991 | && SYMBOL_LINKAGE_NAME (syms[j].symbol) != NULL |
4992 | && strcmp (SYMBOL_LINKAGE_NAME (syms[i].symbol), | |
4993 | SYMBOL_LINKAGE_NAME (syms[j].symbol)) == 0 | |
4994 | && SYMBOL_CLASS (syms[i].symbol) | |
4995 | == SYMBOL_CLASS (syms[j].symbol) | |
4996 | && SYMBOL_VALUE_ADDRESS (syms[i].symbol) | |
4997 | == SYMBOL_VALUE_ADDRESS (syms[j].symbol)) | |
a35ddb44 | 4998 | remove_p = 1; |
4c4b4cd2 | 4999 | } |
4c4b4cd2 | 5000 | } |
339c13b6 | 5001 | |
a35ddb44 | 5002 | if (remove_p) |
339c13b6 JB |
5003 | { |
5004 | for (j = i + 1; j < nsyms; j += 1) | |
5005 | syms[j - 1] = syms[j]; | |
5006 | nsyms -= 1; | |
5007 | } | |
5008 | ||
96d887e8 | 5009 | i += 1; |
14f9c5c9 | 5010 | } |
8f17729f JB |
5011 | |
5012 | /* If all the remaining symbols are identical enumerals, then | |
5013 | just keep the first one and discard the rest. | |
5014 | ||
5015 | Unlike what we did previously, we do not discard any entry | |
5016 | unless they are ALL identical. This is because the symbol | |
5017 | comparison is not a strict comparison, but rather a practical | |
5018 | comparison. If all symbols are considered identical, then | |
5019 | we can just go ahead and use the first one and discard the rest. | |
5020 | But if we cannot reduce the list to a single element, we have | |
5021 | to ask the user to disambiguate anyways. And if we have to | |
5022 | present a multiple-choice menu, it's less confusing if the list | |
5023 | isn't missing some choices that were identical and yet distinct. */ | |
5024 | if (symbols_are_identical_enums (syms, nsyms)) | |
5025 | nsyms = 1; | |
5026 | ||
96d887e8 | 5027 | return nsyms; |
14f9c5c9 AS |
5028 | } |
5029 | ||
96d887e8 PH |
5030 | /* Given a type that corresponds to a renaming entity, use the type name |
5031 | to extract the scope (package name or function name, fully qualified, | |
5032 | and following the GNAT encoding convention) where this renaming has been | |
5033 | defined. The string returned needs to be deallocated after use. */ | |
4c4b4cd2 | 5034 | |
96d887e8 PH |
5035 | static char * |
5036 | xget_renaming_scope (struct type *renaming_type) | |
14f9c5c9 | 5037 | { |
96d887e8 | 5038 | /* The renaming types adhere to the following convention: |
0963b4bd | 5039 | <scope>__<rename>___<XR extension>. |
96d887e8 PH |
5040 | So, to extract the scope, we search for the "___XR" extension, |
5041 | and then backtrack until we find the first "__". */ | |
76a01679 | 5042 | |
96d887e8 | 5043 | const char *name = type_name_no_tag (renaming_type); |
108d56a4 SM |
5044 | const char *suffix = strstr (name, "___XR"); |
5045 | const char *last; | |
96d887e8 PH |
5046 | int scope_len; |
5047 | char *scope; | |
14f9c5c9 | 5048 | |
96d887e8 PH |
5049 | /* Now, backtrack a bit until we find the first "__". Start looking |
5050 | at suffix - 3, as the <rename> part is at least one character long. */ | |
14f9c5c9 | 5051 | |
96d887e8 PH |
5052 | for (last = suffix - 3; last > name; last--) |
5053 | if (last[0] == '_' && last[1] == '_') | |
5054 | break; | |
76a01679 | 5055 | |
96d887e8 | 5056 | /* Make a copy of scope and return it. */ |
14f9c5c9 | 5057 | |
96d887e8 PH |
5058 | scope_len = last - name; |
5059 | scope = (char *) xmalloc ((scope_len + 1) * sizeof (char)); | |
14f9c5c9 | 5060 | |
96d887e8 PH |
5061 | strncpy (scope, name, scope_len); |
5062 | scope[scope_len] = '\0'; | |
4c4b4cd2 | 5063 | |
96d887e8 | 5064 | return scope; |
4c4b4cd2 PH |
5065 | } |
5066 | ||
96d887e8 | 5067 | /* Return nonzero if NAME corresponds to a package name. */ |
4c4b4cd2 | 5068 | |
96d887e8 PH |
5069 | static int |
5070 | is_package_name (const char *name) | |
4c4b4cd2 | 5071 | { |
96d887e8 PH |
5072 | /* Here, We take advantage of the fact that no symbols are generated |
5073 | for packages, while symbols are generated for each function. | |
5074 | So the condition for NAME represent a package becomes equivalent | |
5075 | to NAME not existing in our list of symbols. There is only one | |
5076 | small complication with library-level functions (see below). */ | |
4c4b4cd2 | 5077 | |
96d887e8 | 5078 | char *fun_name; |
76a01679 | 5079 | |
96d887e8 PH |
5080 | /* If it is a function that has not been defined at library level, |
5081 | then we should be able to look it up in the symbols. */ | |
5082 | if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL) | |
5083 | return 0; | |
14f9c5c9 | 5084 | |
96d887e8 PH |
5085 | /* Library-level function names start with "_ada_". See if function |
5086 | "_ada_" followed by NAME can be found. */ | |
14f9c5c9 | 5087 | |
96d887e8 | 5088 | /* Do a quick check that NAME does not contain "__", since library-level |
e1d5a0d2 | 5089 | functions names cannot contain "__" in them. */ |
96d887e8 PH |
5090 | if (strstr (name, "__") != NULL) |
5091 | return 0; | |
4c4b4cd2 | 5092 | |
b435e160 | 5093 | fun_name = xstrprintf ("_ada_%s", name); |
14f9c5c9 | 5094 | |
96d887e8 PH |
5095 | return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL); |
5096 | } | |
14f9c5c9 | 5097 | |
96d887e8 | 5098 | /* Return nonzero if SYM corresponds to a renaming entity that is |
aeb5907d | 5099 | not visible from FUNCTION_NAME. */ |
14f9c5c9 | 5100 | |
96d887e8 | 5101 | static int |
0d5cff50 | 5102 | old_renaming_is_invisible (const struct symbol *sym, const char *function_name) |
96d887e8 | 5103 | { |
aeb5907d | 5104 | char *scope; |
1509e573 | 5105 | struct cleanup *old_chain; |
aeb5907d JB |
5106 | |
5107 | if (SYMBOL_CLASS (sym) != LOC_TYPEDEF) | |
5108 | return 0; | |
5109 | ||
5110 | scope = xget_renaming_scope (SYMBOL_TYPE (sym)); | |
1509e573 | 5111 | old_chain = make_cleanup (xfree, scope); |
14f9c5c9 | 5112 | |
96d887e8 PH |
5113 | /* If the rename has been defined in a package, then it is visible. */ |
5114 | if (is_package_name (scope)) | |
1509e573 JB |
5115 | { |
5116 | do_cleanups (old_chain); | |
5117 | return 0; | |
5118 | } | |
14f9c5c9 | 5119 | |
96d887e8 PH |
5120 | /* Check that the rename is in the current function scope by checking |
5121 | that its name starts with SCOPE. */ | |
76a01679 | 5122 | |
96d887e8 PH |
5123 | /* If the function name starts with "_ada_", it means that it is |
5124 | a library-level function. Strip this prefix before doing the | |
5125 | comparison, as the encoding for the renaming does not contain | |
5126 | this prefix. */ | |
61012eef | 5127 | if (startswith (function_name, "_ada_")) |
96d887e8 | 5128 | function_name += 5; |
f26caa11 | 5129 | |
1509e573 | 5130 | { |
61012eef | 5131 | int is_invisible = !startswith (function_name, scope); |
1509e573 JB |
5132 | |
5133 | do_cleanups (old_chain); | |
5134 | return is_invisible; | |
5135 | } | |
f26caa11 PH |
5136 | } |
5137 | ||
aeb5907d JB |
5138 | /* Remove entries from SYMS that corresponds to a renaming entity that |
5139 | is not visible from the function associated with CURRENT_BLOCK or | |
5140 | that is superfluous due to the presence of more specific renaming | |
5141 | information. Places surviving symbols in the initial entries of | |
5142 | SYMS and returns the number of surviving symbols. | |
96d887e8 PH |
5143 | |
5144 | Rationale: | |
aeb5907d JB |
5145 | First, in cases where an object renaming is implemented as a |
5146 | reference variable, GNAT may produce both the actual reference | |
5147 | variable and the renaming encoding. In this case, we discard the | |
5148 | latter. | |
5149 | ||
5150 | Second, GNAT emits a type following a specified encoding for each renaming | |
96d887e8 PH |
5151 | entity. Unfortunately, STABS currently does not support the definition |
5152 | of types that are local to a given lexical block, so all renamings types | |
5153 | are emitted at library level. As a consequence, if an application | |
5154 | contains two renaming entities using the same name, and a user tries to | |
5155 | print the value of one of these entities, the result of the ada symbol | |
5156 | lookup will also contain the wrong renaming type. | |
f26caa11 | 5157 | |
96d887e8 PH |
5158 | This function partially covers for this limitation by attempting to |
5159 | remove from the SYMS list renaming symbols that should be visible | |
5160 | from CURRENT_BLOCK. However, there does not seem be a 100% reliable | |
5161 | method with the current information available. The implementation | |
5162 | below has a couple of limitations (FIXME: brobecker-2003-05-12): | |
5163 | ||
5164 | - When the user tries to print a rename in a function while there | |
5165 | is another rename entity defined in a package: Normally, the | |
5166 | rename in the function has precedence over the rename in the | |
5167 | package, so the latter should be removed from the list. This is | |
5168 | currently not the case. | |
5169 | ||
5170 | - This function will incorrectly remove valid renames if | |
5171 | the CURRENT_BLOCK corresponds to a function which symbol name | |
5172 | has been changed by an "Export" pragma. As a consequence, | |
5173 | the user will be unable to print such rename entities. */ | |
4c4b4cd2 | 5174 | |
14f9c5c9 | 5175 | static int |
d12307c1 | 5176 | remove_irrelevant_renamings (struct block_symbol *syms, |
aeb5907d | 5177 | int nsyms, const struct block *current_block) |
4c4b4cd2 PH |
5178 | { |
5179 | struct symbol *current_function; | |
0d5cff50 | 5180 | const char *current_function_name; |
4c4b4cd2 | 5181 | int i; |
aeb5907d JB |
5182 | int is_new_style_renaming; |
5183 | ||
5184 | /* If there is both a renaming foo___XR... encoded as a variable and | |
5185 | a simple variable foo in the same block, discard the latter. | |
0963b4bd | 5186 | First, zero out such symbols, then compress. */ |
aeb5907d JB |
5187 | is_new_style_renaming = 0; |
5188 | for (i = 0; i < nsyms; i += 1) | |
5189 | { | |
d12307c1 | 5190 | struct symbol *sym = syms[i].symbol; |
270140bd | 5191 | const struct block *block = syms[i].block; |
aeb5907d JB |
5192 | const char *name; |
5193 | const char *suffix; | |
5194 | ||
5195 | if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
5196 | continue; | |
5197 | name = SYMBOL_LINKAGE_NAME (sym); | |
5198 | suffix = strstr (name, "___XR"); | |
5199 | ||
5200 | if (suffix != NULL) | |
5201 | { | |
5202 | int name_len = suffix - name; | |
5203 | int j; | |
5b4ee69b | 5204 | |
aeb5907d JB |
5205 | is_new_style_renaming = 1; |
5206 | for (j = 0; j < nsyms; j += 1) | |
d12307c1 PMR |
5207 | if (i != j && syms[j].symbol != NULL |
5208 | && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].symbol), | |
aeb5907d JB |
5209 | name_len) == 0 |
5210 | && block == syms[j].block) | |
d12307c1 | 5211 | syms[j].symbol = NULL; |
aeb5907d JB |
5212 | } |
5213 | } | |
5214 | if (is_new_style_renaming) | |
5215 | { | |
5216 | int j, k; | |
5217 | ||
5218 | for (j = k = 0; j < nsyms; j += 1) | |
d12307c1 | 5219 | if (syms[j].symbol != NULL) |
aeb5907d JB |
5220 | { |
5221 | syms[k] = syms[j]; | |
5222 | k += 1; | |
5223 | } | |
5224 | return k; | |
5225 | } | |
4c4b4cd2 PH |
5226 | |
5227 | /* Extract the function name associated to CURRENT_BLOCK. | |
5228 | Abort if unable to do so. */ | |
76a01679 | 5229 | |
4c4b4cd2 PH |
5230 | if (current_block == NULL) |
5231 | return nsyms; | |
76a01679 | 5232 | |
7f0df278 | 5233 | current_function = block_linkage_function (current_block); |
4c4b4cd2 PH |
5234 | if (current_function == NULL) |
5235 | return nsyms; | |
5236 | ||
5237 | current_function_name = SYMBOL_LINKAGE_NAME (current_function); | |
5238 | if (current_function_name == NULL) | |
5239 | return nsyms; | |
5240 | ||
5241 | /* Check each of the symbols, and remove it from the list if it is | |
5242 | a type corresponding to a renaming that is out of the scope of | |
5243 | the current block. */ | |
5244 | ||
5245 | i = 0; | |
5246 | while (i < nsyms) | |
5247 | { | |
d12307c1 | 5248 | if (ada_parse_renaming (syms[i].symbol, NULL, NULL, NULL) |
aeb5907d | 5249 | == ADA_OBJECT_RENAMING |
d12307c1 | 5250 | && old_renaming_is_invisible (syms[i].symbol, current_function_name)) |
4c4b4cd2 PH |
5251 | { |
5252 | int j; | |
5b4ee69b | 5253 | |
aeb5907d | 5254 | for (j = i + 1; j < nsyms; j += 1) |
76a01679 | 5255 | syms[j - 1] = syms[j]; |
4c4b4cd2 PH |
5256 | nsyms -= 1; |
5257 | } | |
5258 | else | |
5259 | i += 1; | |
5260 | } | |
5261 | ||
5262 | return nsyms; | |
5263 | } | |
5264 | ||
339c13b6 JB |
5265 | /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks) |
5266 | whose name and domain match NAME and DOMAIN respectively. | |
5267 | If no match was found, then extend the search to "enclosing" | |
5268 | routines (in other words, if we're inside a nested function, | |
5269 | search the symbols defined inside the enclosing functions). | |
d0a8ab18 JB |
5270 | If WILD_MATCH_P is nonzero, perform the naming matching in |
5271 | "wild" mode (see function "wild_match" for more info). | |
339c13b6 JB |
5272 | |
5273 | Note: This function assumes that OBSTACKP has 0 (zero) element in it. */ | |
5274 | ||
5275 | static void | |
5276 | ada_add_local_symbols (struct obstack *obstackp, const char *name, | |
f0c5f9b2 | 5277 | const struct block *block, domain_enum domain, |
d0a8ab18 | 5278 | int wild_match_p) |
339c13b6 JB |
5279 | { |
5280 | int block_depth = 0; | |
5281 | ||
5282 | while (block != NULL) | |
5283 | { | |
5284 | block_depth += 1; | |
d0a8ab18 JB |
5285 | ada_add_block_symbols (obstackp, block, name, domain, NULL, |
5286 | wild_match_p); | |
339c13b6 JB |
5287 | |
5288 | /* If we found a non-function match, assume that's the one. */ | |
5289 | if (is_nonfunction (defns_collected (obstackp, 0), | |
5290 | num_defns_collected (obstackp))) | |
5291 | return; | |
5292 | ||
5293 | block = BLOCK_SUPERBLOCK (block); | |
5294 | } | |
5295 | ||
5296 | /* If no luck so far, try to find NAME as a local symbol in some lexically | |
5297 | enclosing subprogram. */ | |
5298 | if (num_defns_collected (obstackp) == 0 && block_depth > 2) | |
d0a8ab18 | 5299 | add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match_p); |
339c13b6 JB |
5300 | } |
5301 | ||
ccefe4c4 | 5302 | /* An object of this type is used as the user_data argument when |
40658b94 | 5303 | calling the map_matching_symbols method. */ |
ccefe4c4 | 5304 | |
40658b94 | 5305 | struct match_data |
ccefe4c4 | 5306 | { |
40658b94 | 5307 | struct objfile *objfile; |
ccefe4c4 | 5308 | struct obstack *obstackp; |
40658b94 PH |
5309 | struct symbol *arg_sym; |
5310 | int found_sym; | |
ccefe4c4 TT |
5311 | }; |
5312 | ||
22cee43f | 5313 | /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK, |
40658b94 PH |
5314 | to a list of symbols. DATA0 is a pointer to a struct match_data * |
5315 | containing the obstack that collects the symbol list, the file that SYM | |
5316 | must come from, a flag indicating whether a non-argument symbol has | |
5317 | been found in the current block, and the last argument symbol | |
5318 | passed in SYM within the current block (if any). When SYM is null, | |
5319 | marking the end of a block, the argument symbol is added if no | |
5320 | other has been found. */ | |
ccefe4c4 | 5321 | |
40658b94 PH |
5322 | static int |
5323 | aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0) | |
ccefe4c4 | 5324 | { |
40658b94 PH |
5325 | struct match_data *data = (struct match_data *) data0; |
5326 | ||
5327 | if (sym == NULL) | |
5328 | { | |
5329 | if (!data->found_sym && data->arg_sym != NULL) | |
5330 | add_defn_to_vec (data->obstackp, | |
5331 | fixup_symbol_section (data->arg_sym, data->objfile), | |
5332 | block); | |
5333 | data->found_sym = 0; | |
5334 | data->arg_sym = NULL; | |
5335 | } | |
5336 | else | |
5337 | { | |
5338 | if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED) | |
5339 | return 0; | |
5340 | else if (SYMBOL_IS_ARGUMENT (sym)) | |
5341 | data->arg_sym = sym; | |
5342 | else | |
5343 | { | |
5344 | data->found_sym = 1; | |
5345 | add_defn_to_vec (data->obstackp, | |
5346 | fixup_symbol_section (sym, data->objfile), | |
5347 | block); | |
5348 | } | |
5349 | } | |
5350 | return 0; | |
5351 | } | |
5352 | ||
22cee43f PMR |
5353 | /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are targetted |
5354 | by renamings matching NAME in BLOCK. Add these symbols to OBSTACKP. If | |
5355 | WILD_MATCH_P is nonzero, perform the naming matching in "wild" mode (see | |
5356 | function "wild_match" for more information). Return whether we found such | |
5357 | symbols. */ | |
5358 | ||
5359 | static int | |
5360 | ada_add_block_renamings (struct obstack *obstackp, | |
5361 | const struct block *block, | |
5362 | const char *name, | |
5363 | domain_enum domain, | |
5364 | int wild_match_p) | |
5365 | { | |
5366 | struct using_direct *renaming; | |
5367 | int defns_mark = num_defns_collected (obstackp); | |
5368 | ||
5369 | for (renaming = block_using (block); | |
5370 | renaming != NULL; | |
5371 | renaming = renaming->next) | |
5372 | { | |
5373 | const char *r_name; | |
5374 | int name_match; | |
5375 | ||
5376 | /* Avoid infinite recursions: skip this renaming if we are actually | |
5377 | already traversing it. | |
5378 | ||
5379 | Currently, symbol lookup in Ada don't use the namespace machinery from | |
5380 | C++/Fortran support: skip namespace imports that use them. */ | |
5381 | if (renaming->searched | |
5382 | || (renaming->import_src != NULL | |
5383 | && renaming->import_src[0] != '\0') | |
5384 | || (renaming->import_dest != NULL | |
5385 | && renaming->import_dest[0] != '\0')) | |
5386 | continue; | |
5387 | renaming->searched = 1; | |
5388 | ||
5389 | /* TODO: here, we perform another name-based symbol lookup, which can | |
5390 | pull its own multiple overloads. In theory, we should be able to do | |
5391 | better in this case since, in DWARF, DW_AT_import is a DIE reference, | |
5392 | not a simple name. But in order to do this, we would need to enhance | |
5393 | the DWARF reader to associate a symbol to this renaming, instead of a | |
5394 | name. So, for now, we do something simpler: re-use the C++/Fortran | |
5395 | namespace machinery. */ | |
5396 | r_name = (renaming->alias != NULL | |
5397 | ? renaming->alias | |
5398 | : renaming->declaration); | |
5399 | name_match | |
5400 | = wild_match_p ? wild_match (r_name, name) : strcmp (r_name, name); | |
5401 | if (name_match == 0) | |
5402 | ada_add_all_symbols (obstackp, block, renaming->declaration, domain, | |
5403 | 1, NULL); | |
5404 | renaming->searched = 0; | |
5405 | } | |
5406 | return num_defns_collected (obstackp) != defns_mark; | |
5407 | } | |
5408 | ||
db230ce3 JB |
5409 | /* Implements compare_names, but only applying the comparision using |
5410 | the given CASING. */ | |
5b4ee69b | 5411 | |
40658b94 | 5412 | static int |
db230ce3 JB |
5413 | compare_names_with_case (const char *string1, const char *string2, |
5414 | enum case_sensitivity casing) | |
40658b94 PH |
5415 | { |
5416 | while (*string1 != '\0' && *string2 != '\0') | |
5417 | { | |
db230ce3 JB |
5418 | char c1, c2; |
5419 | ||
40658b94 PH |
5420 | if (isspace (*string1) || isspace (*string2)) |
5421 | return strcmp_iw_ordered (string1, string2); | |
db230ce3 JB |
5422 | |
5423 | if (casing == case_sensitive_off) | |
5424 | { | |
5425 | c1 = tolower (*string1); | |
5426 | c2 = tolower (*string2); | |
5427 | } | |
5428 | else | |
5429 | { | |
5430 | c1 = *string1; | |
5431 | c2 = *string2; | |
5432 | } | |
5433 | if (c1 != c2) | |
40658b94 | 5434 | break; |
db230ce3 | 5435 | |
40658b94 PH |
5436 | string1 += 1; |
5437 | string2 += 1; | |
5438 | } | |
db230ce3 | 5439 | |
40658b94 PH |
5440 | switch (*string1) |
5441 | { | |
5442 | case '(': | |
5443 | return strcmp_iw_ordered (string1, string2); | |
5444 | case '_': | |
5445 | if (*string2 == '\0') | |
5446 | { | |
052874e8 | 5447 | if (is_name_suffix (string1)) |
40658b94 PH |
5448 | return 0; |
5449 | else | |
1a1d5513 | 5450 | return 1; |
40658b94 | 5451 | } |
dbb8534f | 5452 | /* FALLTHROUGH */ |
40658b94 PH |
5453 | default: |
5454 | if (*string2 == '(') | |
5455 | return strcmp_iw_ordered (string1, string2); | |
5456 | else | |
db230ce3 JB |
5457 | { |
5458 | if (casing == case_sensitive_off) | |
5459 | return tolower (*string1) - tolower (*string2); | |
5460 | else | |
5461 | return *string1 - *string2; | |
5462 | } | |
40658b94 | 5463 | } |
ccefe4c4 TT |
5464 | } |
5465 | ||
db230ce3 JB |
5466 | /* Compare STRING1 to STRING2, with results as for strcmp. |
5467 | Compatible with strcmp_iw_ordered in that... | |
5468 | ||
5469 | strcmp_iw_ordered (STRING1, STRING2) <= 0 | |
5470 | ||
5471 | ... implies... | |
5472 | ||
5473 | compare_names (STRING1, STRING2) <= 0 | |
5474 | ||
5475 | (they may differ as to what symbols compare equal). */ | |
5476 | ||
5477 | static int | |
5478 | compare_names (const char *string1, const char *string2) | |
5479 | { | |
5480 | int result; | |
5481 | ||
5482 | /* Similar to what strcmp_iw_ordered does, we need to perform | |
5483 | a case-insensitive comparison first, and only resort to | |
5484 | a second, case-sensitive, comparison if the first one was | |
5485 | not sufficient to differentiate the two strings. */ | |
5486 | ||
5487 | result = compare_names_with_case (string1, string2, case_sensitive_off); | |
5488 | if (result == 0) | |
5489 | result = compare_names_with_case (string1, string2, case_sensitive_on); | |
5490 | ||
5491 | return result; | |
5492 | } | |
5493 | ||
339c13b6 JB |
5494 | /* Add to OBSTACKP all non-local symbols whose name and domain match |
5495 | NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK | |
5496 | symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */ | |
5497 | ||
5498 | static void | |
40658b94 PH |
5499 | add_nonlocal_symbols (struct obstack *obstackp, const char *name, |
5500 | domain_enum domain, int global, | |
5501 | int is_wild_match) | |
339c13b6 JB |
5502 | { |
5503 | struct objfile *objfile; | |
22cee43f | 5504 | struct compunit_symtab *cu; |
40658b94 | 5505 | struct match_data data; |
339c13b6 | 5506 | |
6475f2fe | 5507 | memset (&data, 0, sizeof data); |
ccefe4c4 | 5508 | data.obstackp = obstackp; |
339c13b6 | 5509 | |
ccefe4c4 | 5510 | ALL_OBJFILES (objfile) |
40658b94 PH |
5511 | { |
5512 | data.objfile = objfile; | |
5513 | ||
5514 | if (is_wild_match) | |
4186eb54 KS |
5515 | objfile->sf->qf->map_matching_symbols (objfile, name, domain, global, |
5516 | aux_add_nonlocal_symbols, &data, | |
5517 | wild_match, NULL); | |
40658b94 | 5518 | else |
4186eb54 KS |
5519 | objfile->sf->qf->map_matching_symbols (objfile, name, domain, global, |
5520 | aux_add_nonlocal_symbols, &data, | |
5521 | full_match, compare_names); | |
22cee43f PMR |
5522 | |
5523 | ALL_OBJFILE_COMPUNITS (objfile, cu) | |
5524 | { | |
5525 | const struct block *global_block | |
5526 | = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu), GLOBAL_BLOCK); | |
5527 | ||
5528 | if (ada_add_block_renamings (obstackp, global_block , name, domain, | |
5529 | is_wild_match)) | |
5530 | data.found_sym = 1; | |
5531 | } | |
40658b94 PH |
5532 | } |
5533 | ||
5534 | if (num_defns_collected (obstackp) == 0 && global && !is_wild_match) | |
5535 | { | |
5536 | ALL_OBJFILES (objfile) | |
5537 | { | |
5538 | char *name1 = alloca (strlen (name) + sizeof ("_ada_")); | |
5539 | strcpy (name1, "_ada_"); | |
5540 | strcpy (name1 + sizeof ("_ada_") - 1, name); | |
5541 | data.objfile = objfile; | |
ade7ed9e DE |
5542 | objfile->sf->qf->map_matching_symbols (objfile, name1, domain, |
5543 | global, | |
0963b4bd MS |
5544 | aux_add_nonlocal_symbols, |
5545 | &data, | |
40658b94 PH |
5546 | full_match, compare_names); |
5547 | } | |
5548 | } | |
339c13b6 JB |
5549 | } |
5550 | ||
22cee43f | 5551 | /* Find symbols in DOMAIN matching NAME, in BLOCK and, if FULL_SEARCH is |
4eeaa230 | 5552 | non-zero, enclosing scope and in global scopes, returning the number of |
22cee43f | 5553 | matches. Add these to OBSTACKP. |
4eeaa230 | 5554 | |
22cee43f PMR |
5555 | When FULL_SEARCH is non-zero, any non-function/non-enumeral |
5556 | symbol match within the nest of blocks whose innermost member is BLOCK, | |
4c4b4cd2 | 5557 | is the one match returned (no other matches in that or |
d9680e73 | 5558 | enclosing blocks is returned). If there are any matches in or |
22cee43f | 5559 | surrounding BLOCK, then these alone are returned. |
4eeaa230 | 5560 | |
9f88c959 | 5561 | Names prefixed with "standard__" are handled specially: "standard__" |
22cee43f | 5562 | is first stripped off, and only static and global symbols are searched. |
14f9c5c9 | 5563 | |
22cee43f PMR |
5564 | If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had |
5565 | to lookup global symbols. */ | |
5566 | ||
5567 | static void | |
5568 | ada_add_all_symbols (struct obstack *obstackp, | |
5569 | const struct block *block, | |
5570 | const char *name, | |
5571 | domain_enum domain, | |
5572 | int full_search, | |
5573 | int *made_global_lookup_p) | |
14f9c5c9 AS |
5574 | { |
5575 | struct symbol *sym; | |
22cee43f | 5576 | const int wild_match_p = should_use_wild_match (name); |
14f9c5c9 | 5577 | |
22cee43f PMR |
5578 | if (made_global_lookup_p) |
5579 | *made_global_lookup_p = 0; | |
339c13b6 JB |
5580 | |
5581 | /* Special case: If the user specifies a symbol name inside package | |
5582 | Standard, do a non-wild matching of the symbol name without | |
5583 | the "standard__" prefix. This was primarily introduced in order | |
5584 | to allow the user to specifically access the standard exceptions | |
5585 | using, for instance, Standard.Constraint_Error when Constraint_Error | |
5586 | is ambiguous (due to the user defining its own Constraint_Error | |
5587 | entity inside its program). */ | |
22cee43f | 5588 | if (startswith (name, "standard__")) |
4c4b4cd2 | 5589 | { |
4c4b4cd2 | 5590 | block = NULL; |
22cee43f | 5591 | name = name + sizeof ("standard__") - 1; |
4c4b4cd2 PH |
5592 | } |
5593 | ||
339c13b6 | 5594 | /* Check the non-global symbols. If we have ANY match, then we're done. */ |
14f9c5c9 | 5595 | |
4eeaa230 DE |
5596 | if (block != NULL) |
5597 | { | |
5598 | if (full_search) | |
22cee43f | 5599 | ada_add_local_symbols (obstackp, name, block, domain, wild_match_p); |
4eeaa230 DE |
5600 | else |
5601 | { | |
5602 | /* In the !full_search case we're are being called by | |
5603 | ada_iterate_over_symbols, and we don't want to search | |
5604 | superblocks. */ | |
22cee43f PMR |
5605 | ada_add_block_symbols (obstackp, block, name, domain, NULL, |
5606 | wild_match_p); | |
4eeaa230 | 5607 | } |
22cee43f PMR |
5608 | if (num_defns_collected (obstackp) > 0 || !full_search) |
5609 | return; | |
4eeaa230 | 5610 | } |
d2e4a39e | 5611 | |
339c13b6 JB |
5612 | /* No non-global symbols found. Check our cache to see if we have |
5613 | already performed this search before. If we have, then return | |
5614 | the same result. */ | |
5615 | ||
22cee43f | 5616 | if (lookup_cached_symbol (name, domain, &sym, &block)) |
4c4b4cd2 PH |
5617 | { |
5618 | if (sym != NULL) | |
22cee43f PMR |
5619 | add_defn_to_vec (obstackp, sym, block); |
5620 | return; | |
4c4b4cd2 | 5621 | } |
14f9c5c9 | 5622 | |
22cee43f PMR |
5623 | if (made_global_lookup_p) |
5624 | *made_global_lookup_p = 1; | |
b1eedac9 | 5625 | |
339c13b6 JB |
5626 | /* Search symbols from all global blocks. */ |
5627 | ||
22cee43f | 5628 | add_nonlocal_symbols (obstackp, name, domain, 1, wild_match_p); |
d2e4a39e | 5629 | |
4c4b4cd2 | 5630 | /* Now add symbols from all per-file blocks if we've gotten no hits |
339c13b6 | 5631 | (not strictly correct, but perhaps better than an error). */ |
d2e4a39e | 5632 | |
22cee43f PMR |
5633 | if (num_defns_collected (obstackp) == 0) |
5634 | add_nonlocal_symbols (obstackp, name, domain, 0, wild_match_p); | |
5635 | } | |
5636 | ||
5637 | /* Find symbols in DOMAIN matching NAME, in BLOCK and, if full_search is | |
5638 | non-zero, enclosing scope and in global scopes, returning the number of | |
5639 | matches. | |
5640 | Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples, | |
5641 | indicating the symbols found and the blocks and symbol tables (if | |
5642 | any) in which they were found. This vector is transient---good only to | |
5643 | the next call of ada_lookup_symbol_list. | |
5644 | ||
5645 | When full_search is non-zero, any non-function/non-enumeral | |
5646 | symbol match within the nest of blocks whose innermost member is BLOCK, | |
5647 | is the one match returned (no other matches in that or | |
5648 | enclosing blocks is returned). If there are any matches in or | |
5649 | surrounding BLOCK, then these alone are returned. | |
5650 | ||
5651 | Names prefixed with "standard__" are handled specially: "standard__" | |
5652 | is first stripped off, and only static and global symbols are searched. */ | |
5653 | ||
5654 | static int | |
5655 | ada_lookup_symbol_list_worker (const char *name, const struct block *block, | |
5656 | domain_enum domain, | |
5657 | struct block_symbol **results, | |
5658 | int full_search) | |
5659 | { | |
5660 | const int wild_match_p = should_use_wild_match (name); | |
5661 | int syms_from_global_search; | |
5662 | int ndefns; | |
5663 | ||
5664 | obstack_free (&symbol_list_obstack, NULL); | |
5665 | obstack_init (&symbol_list_obstack); | |
5666 | ada_add_all_symbols (&symbol_list_obstack, block, name, domain, | |
5667 | full_search, &syms_from_global_search); | |
14f9c5c9 | 5668 | |
4c4b4cd2 PH |
5669 | ndefns = num_defns_collected (&symbol_list_obstack); |
5670 | *results = defns_collected (&symbol_list_obstack, 1); | |
5671 | ||
5672 | ndefns = remove_extra_symbols (*results, ndefns); | |
5673 | ||
b1eedac9 | 5674 | if (ndefns == 0 && full_search && syms_from_global_search) |
22cee43f | 5675 | cache_symbol (name, domain, NULL, NULL); |
14f9c5c9 | 5676 | |
b1eedac9 | 5677 | if (ndefns == 1 && full_search && syms_from_global_search) |
22cee43f | 5678 | cache_symbol (name, domain, (*results)[0].symbol, (*results)[0].block); |
14f9c5c9 | 5679 | |
22cee43f | 5680 | ndefns = remove_irrelevant_renamings (*results, ndefns, block); |
14f9c5c9 AS |
5681 | return ndefns; |
5682 | } | |
5683 | ||
4eeaa230 DE |
5684 | /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and |
5685 | in global scopes, returning the number of matches, and setting *RESULTS | |
5686 | to a vector of (SYM,BLOCK) tuples. | |
5687 | See ada_lookup_symbol_list_worker for further details. */ | |
5688 | ||
5689 | int | |
5690 | ada_lookup_symbol_list (const char *name0, const struct block *block0, | |
d12307c1 | 5691 | domain_enum domain, struct block_symbol **results) |
4eeaa230 DE |
5692 | { |
5693 | return ada_lookup_symbol_list_worker (name0, block0, domain, results, 1); | |
5694 | } | |
5695 | ||
5696 | /* Implementation of the la_iterate_over_symbols method. */ | |
5697 | ||
5698 | static void | |
5699 | ada_iterate_over_symbols (const struct block *block, | |
5700 | const char *name, domain_enum domain, | |
5701 | symbol_found_callback_ftype *callback, | |
5702 | void *data) | |
5703 | { | |
5704 | int ndefs, i; | |
d12307c1 | 5705 | struct block_symbol *results; |
4eeaa230 DE |
5706 | |
5707 | ndefs = ada_lookup_symbol_list_worker (name, block, domain, &results, 0); | |
5708 | for (i = 0; i < ndefs; ++i) | |
5709 | { | |
d12307c1 | 5710 | if (! (*callback) (results[i].symbol, data)) |
4eeaa230 DE |
5711 | break; |
5712 | } | |
5713 | } | |
5714 | ||
f8eba3c6 TT |
5715 | /* If NAME is the name of an entity, return a string that should |
5716 | be used to look that entity up in Ada units. This string should | |
5717 | be deallocated after use using xfree. | |
5718 | ||
5719 | NAME can have any form that the "break" or "print" commands might | |
5720 | recognize. In other words, it does not have to be the "natural" | |
5721 | name, or the "encoded" name. */ | |
5722 | ||
5723 | char * | |
5724 | ada_name_for_lookup (const char *name) | |
5725 | { | |
5726 | char *canon; | |
5727 | int nlen = strlen (name); | |
5728 | ||
5729 | if (name[0] == '<' && name[nlen - 1] == '>') | |
5730 | { | |
5731 | canon = xmalloc (nlen - 1); | |
5732 | memcpy (canon, name + 1, nlen - 2); | |
5733 | canon[nlen - 2] = '\0'; | |
5734 | } | |
5735 | else | |
5736 | canon = xstrdup (ada_encode (ada_fold_name (name))); | |
5737 | return canon; | |
5738 | } | |
5739 | ||
4e5c77fe JB |
5740 | /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set |
5741 | to 1, but choosing the first symbol found if there are multiple | |
5742 | choices. | |
5743 | ||
5e2336be JB |
5744 | The result is stored in *INFO, which must be non-NULL. |
5745 | If no match is found, INFO->SYM is set to NULL. */ | |
4e5c77fe JB |
5746 | |
5747 | void | |
5748 | ada_lookup_encoded_symbol (const char *name, const struct block *block, | |
fe978cb0 | 5749 | domain_enum domain, |
d12307c1 | 5750 | struct block_symbol *info) |
14f9c5c9 | 5751 | { |
d12307c1 | 5752 | struct block_symbol *candidates; |
14f9c5c9 AS |
5753 | int n_candidates; |
5754 | ||
5e2336be | 5755 | gdb_assert (info != NULL); |
d12307c1 | 5756 | memset (info, 0, sizeof (struct block_symbol)); |
4e5c77fe | 5757 | |
fe978cb0 | 5758 | n_candidates = ada_lookup_symbol_list (name, block, domain, &candidates); |
14f9c5c9 | 5759 | if (n_candidates == 0) |
4e5c77fe | 5760 | return; |
4c4b4cd2 | 5761 | |
5e2336be | 5762 | *info = candidates[0]; |
d12307c1 | 5763 | info->symbol = fixup_symbol_section (info->symbol, NULL); |
4e5c77fe | 5764 | } |
aeb5907d JB |
5765 | |
5766 | /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing | |
5767 | scope and in global scopes, or NULL if none. NAME is folded and | |
5768 | encoded first. Otherwise, the result is as for ada_lookup_symbol_list, | |
0963b4bd | 5769 | choosing the first symbol if there are multiple choices. |
4e5c77fe JB |
5770 | If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */ |
5771 | ||
d12307c1 | 5772 | struct block_symbol |
aeb5907d | 5773 | ada_lookup_symbol (const char *name, const struct block *block0, |
fe978cb0 | 5774 | domain_enum domain, int *is_a_field_of_this) |
aeb5907d | 5775 | { |
d12307c1 | 5776 | struct block_symbol info; |
4e5c77fe | 5777 | |
aeb5907d JB |
5778 | if (is_a_field_of_this != NULL) |
5779 | *is_a_field_of_this = 0; | |
5780 | ||
4e5c77fe | 5781 | ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)), |
fe978cb0 | 5782 | block0, domain, &info); |
d12307c1 | 5783 | return info; |
4c4b4cd2 | 5784 | } |
14f9c5c9 | 5785 | |
d12307c1 | 5786 | static struct block_symbol |
f606139a DE |
5787 | ada_lookup_symbol_nonlocal (const struct language_defn *langdef, |
5788 | const char *name, | |
76a01679 | 5789 | const struct block *block, |
21b556f4 | 5790 | const domain_enum domain) |
4c4b4cd2 | 5791 | { |
d12307c1 | 5792 | struct block_symbol sym; |
04dccad0 JB |
5793 | |
5794 | sym = ada_lookup_symbol (name, block_static_block (block), domain, NULL); | |
d12307c1 | 5795 | if (sym.symbol != NULL) |
04dccad0 JB |
5796 | return sym; |
5797 | ||
5798 | /* If we haven't found a match at this point, try the primitive | |
5799 | types. In other languages, this search is performed before | |
5800 | searching for global symbols in order to short-circuit that | |
5801 | global-symbol search if it happens that the name corresponds | |
5802 | to a primitive type. But we cannot do the same in Ada, because | |
5803 | it is perfectly legitimate for a program to declare a type which | |
5804 | has the same name as a standard type. If looking up a type in | |
5805 | that situation, we have traditionally ignored the primitive type | |
5806 | in favor of user-defined types. This is why, unlike most other | |
5807 | languages, we search the primitive types this late and only after | |
5808 | having searched the global symbols without success. */ | |
5809 | ||
5810 | if (domain == VAR_DOMAIN) | |
5811 | { | |
5812 | struct gdbarch *gdbarch; | |
5813 | ||
5814 | if (block == NULL) | |
5815 | gdbarch = target_gdbarch (); | |
5816 | else | |
5817 | gdbarch = block_gdbarch (block); | |
d12307c1 PMR |
5818 | sym.symbol = language_lookup_primitive_type_as_symbol (langdef, gdbarch, name); |
5819 | if (sym.symbol != NULL) | |
04dccad0 JB |
5820 | return sym; |
5821 | } | |
5822 | ||
d12307c1 | 5823 | return (struct block_symbol) {NULL, NULL}; |
14f9c5c9 AS |
5824 | } |
5825 | ||
5826 | ||
4c4b4cd2 PH |
5827 | /* True iff STR is a possible encoded suffix of a normal Ada name |
5828 | that is to be ignored for matching purposes. Suffixes of parallel | |
5829 | names (e.g., XVE) are not included here. Currently, the possible suffixes | |
5823c3ef | 5830 | are given by any of the regular expressions: |
4c4b4cd2 | 5831 | |
babe1480 JB |
5832 | [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux] |
5833 | ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX] | |
9ac7f98e | 5834 | TKB [subprogram suffix for task bodies] |
babe1480 | 5835 | _E[0-9]+[bs]$ [protected object entry suffixes] |
61ee279c | 5836 | (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$ |
babe1480 JB |
5837 | |
5838 | Also, any leading "__[0-9]+" sequence is skipped before the suffix | |
5839 | match is performed. This sequence is used to differentiate homonyms, | |
5840 | is an optional part of a valid name suffix. */ | |
4c4b4cd2 | 5841 | |
14f9c5c9 | 5842 | static int |
d2e4a39e | 5843 | is_name_suffix (const char *str) |
14f9c5c9 AS |
5844 | { |
5845 | int k; | |
4c4b4cd2 PH |
5846 | const char *matching; |
5847 | const int len = strlen (str); | |
5848 | ||
babe1480 JB |
5849 | /* Skip optional leading __[0-9]+. */ |
5850 | ||
4c4b4cd2 PH |
5851 | if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2])) |
5852 | { | |
babe1480 JB |
5853 | str += 3; |
5854 | while (isdigit (str[0])) | |
5855 | str += 1; | |
4c4b4cd2 | 5856 | } |
babe1480 JB |
5857 | |
5858 | /* [.$][0-9]+ */ | |
4c4b4cd2 | 5859 | |
babe1480 | 5860 | if (str[0] == '.' || str[0] == '$') |
4c4b4cd2 | 5861 | { |
babe1480 | 5862 | matching = str + 1; |
4c4b4cd2 PH |
5863 | while (isdigit (matching[0])) |
5864 | matching += 1; | |
5865 | if (matching[0] == '\0') | |
5866 | return 1; | |
5867 | } | |
5868 | ||
5869 | /* ___[0-9]+ */ | |
babe1480 | 5870 | |
4c4b4cd2 PH |
5871 | if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_') |
5872 | { | |
5873 | matching = str + 3; | |
5874 | while (isdigit (matching[0])) | |
5875 | matching += 1; | |
5876 | if (matching[0] == '\0') | |
5877 | return 1; | |
5878 | } | |
5879 | ||
9ac7f98e JB |
5880 | /* "TKB" suffixes are used for subprograms implementing task bodies. */ |
5881 | ||
5882 | if (strcmp (str, "TKB") == 0) | |
5883 | return 1; | |
5884 | ||
529cad9c PH |
5885 | #if 0 |
5886 | /* FIXME: brobecker/2005-09-23: Protected Object subprograms end | |
0963b4bd MS |
5887 | with a N at the end. Unfortunately, the compiler uses the same |
5888 | convention for other internal types it creates. So treating | |
529cad9c | 5889 | all entity names that end with an "N" as a name suffix causes |
0963b4bd MS |
5890 | some regressions. For instance, consider the case of an enumerated |
5891 | type. To support the 'Image attribute, it creates an array whose | |
529cad9c PH |
5892 | name ends with N. |
5893 | Having a single character like this as a suffix carrying some | |
0963b4bd | 5894 | information is a bit risky. Perhaps we should change the encoding |
529cad9c PH |
5895 | to be something like "_N" instead. In the meantime, do not do |
5896 | the following check. */ | |
5897 | /* Protected Object Subprograms */ | |
5898 | if (len == 1 && str [0] == 'N') | |
5899 | return 1; | |
5900 | #endif | |
5901 | ||
5902 | /* _E[0-9]+[bs]$ */ | |
5903 | if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2])) | |
5904 | { | |
5905 | matching = str + 3; | |
5906 | while (isdigit (matching[0])) | |
5907 | matching += 1; | |
5908 | if ((matching[0] == 'b' || matching[0] == 's') | |
5909 | && matching [1] == '\0') | |
5910 | return 1; | |
5911 | } | |
5912 | ||
4c4b4cd2 PH |
5913 | /* ??? We should not modify STR directly, as we are doing below. This |
5914 | is fine in this case, but may become problematic later if we find | |
5915 | that this alternative did not work, and want to try matching | |
5916 | another one from the begining of STR. Since we modified it, we | |
5917 | won't be able to find the begining of the string anymore! */ | |
14f9c5c9 AS |
5918 | if (str[0] == 'X') |
5919 | { | |
5920 | str += 1; | |
d2e4a39e | 5921 | while (str[0] != '_' && str[0] != '\0') |
4c4b4cd2 PH |
5922 | { |
5923 | if (str[0] != 'n' && str[0] != 'b') | |
5924 | return 0; | |
5925 | str += 1; | |
5926 | } | |
14f9c5c9 | 5927 | } |
babe1480 | 5928 | |
14f9c5c9 AS |
5929 | if (str[0] == '\000') |
5930 | return 1; | |
babe1480 | 5931 | |
d2e4a39e | 5932 | if (str[0] == '_') |
14f9c5c9 AS |
5933 | { |
5934 | if (str[1] != '_' || str[2] == '\000') | |
4c4b4cd2 | 5935 | return 0; |
d2e4a39e | 5936 | if (str[2] == '_') |
4c4b4cd2 | 5937 | { |
61ee279c PH |
5938 | if (strcmp (str + 3, "JM") == 0) |
5939 | return 1; | |
5940 | /* FIXME: brobecker/2004-09-30: GNAT will soon stop using | |
5941 | the LJM suffix in favor of the JM one. But we will | |
5942 | still accept LJM as a valid suffix for a reasonable | |
5943 | amount of time, just to allow ourselves to debug programs | |
5944 | compiled using an older version of GNAT. */ | |
4c4b4cd2 PH |
5945 | if (strcmp (str + 3, "LJM") == 0) |
5946 | return 1; | |
5947 | if (str[3] != 'X') | |
5948 | return 0; | |
1265e4aa JB |
5949 | if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B' |
5950 | || str[4] == 'U' || str[4] == 'P') | |
4c4b4cd2 PH |
5951 | return 1; |
5952 | if (str[4] == 'R' && str[5] != 'T') | |
5953 | return 1; | |
5954 | return 0; | |
5955 | } | |
5956 | if (!isdigit (str[2])) | |
5957 | return 0; | |
5958 | for (k = 3; str[k] != '\0'; k += 1) | |
5959 | if (!isdigit (str[k]) && str[k] != '_') | |
5960 | return 0; | |
14f9c5c9 AS |
5961 | return 1; |
5962 | } | |
4c4b4cd2 | 5963 | if (str[0] == '$' && isdigit (str[1])) |
14f9c5c9 | 5964 | { |
4c4b4cd2 PH |
5965 | for (k = 2; str[k] != '\0'; k += 1) |
5966 | if (!isdigit (str[k]) && str[k] != '_') | |
5967 | return 0; | |
14f9c5c9 AS |
5968 | return 1; |
5969 | } | |
5970 | return 0; | |
5971 | } | |
d2e4a39e | 5972 | |
aeb5907d JB |
5973 | /* Return non-zero if the string starting at NAME and ending before |
5974 | NAME_END contains no capital letters. */ | |
529cad9c PH |
5975 | |
5976 | static int | |
5977 | is_valid_name_for_wild_match (const char *name0) | |
5978 | { | |
5979 | const char *decoded_name = ada_decode (name0); | |
5980 | int i; | |
5981 | ||
5823c3ef JB |
5982 | /* If the decoded name starts with an angle bracket, it means that |
5983 | NAME0 does not follow the GNAT encoding format. It should then | |
5984 | not be allowed as a possible wild match. */ | |
5985 | if (decoded_name[0] == '<') | |
5986 | return 0; | |
5987 | ||
529cad9c PH |
5988 | for (i=0; decoded_name[i] != '\0'; i++) |
5989 | if (isalpha (decoded_name[i]) && !islower (decoded_name[i])) | |
5990 | return 0; | |
5991 | ||
5992 | return 1; | |
5993 | } | |
5994 | ||
73589123 PH |
5995 | /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0 |
5996 | that could start a simple name. Assumes that *NAMEP points into | |
5997 | the string beginning at NAME0. */ | |
4c4b4cd2 | 5998 | |
14f9c5c9 | 5999 | static int |
73589123 | 6000 | advance_wild_match (const char **namep, const char *name0, int target0) |
14f9c5c9 | 6001 | { |
73589123 | 6002 | const char *name = *namep; |
5b4ee69b | 6003 | |
5823c3ef | 6004 | while (1) |
14f9c5c9 | 6005 | { |
aa27d0b3 | 6006 | int t0, t1; |
73589123 PH |
6007 | |
6008 | t0 = *name; | |
6009 | if (t0 == '_') | |
6010 | { | |
6011 | t1 = name[1]; | |
6012 | if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9')) | |
6013 | { | |
6014 | name += 1; | |
61012eef | 6015 | if (name == name0 + 5 && startswith (name0, "_ada")) |
73589123 PH |
6016 | break; |
6017 | else | |
6018 | name += 1; | |
6019 | } | |
aa27d0b3 JB |
6020 | else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z') |
6021 | || name[2] == target0)) | |
73589123 PH |
6022 | { |
6023 | name += 2; | |
6024 | break; | |
6025 | } | |
6026 | else | |
6027 | return 0; | |
6028 | } | |
6029 | else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9')) | |
6030 | name += 1; | |
6031 | else | |
5823c3ef | 6032 | return 0; |
73589123 PH |
6033 | } |
6034 | ||
6035 | *namep = name; | |
6036 | return 1; | |
6037 | } | |
6038 | ||
6039 | /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any | |
6040 | informational suffixes of NAME (i.e., for which is_name_suffix is | |
6041 | true). Assumes that PATN is a lower-cased Ada simple name. */ | |
6042 | ||
6043 | static int | |
6044 | wild_match (const char *name, const char *patn) | |
6045 | { | |
22e048c9 | 6046 | const char *p; |
73589123 PH |
6047 | const char *name0 = name; |
6048 | ||
6049 | while (1) | |
6050 | { | |
6051 | const char *match = name; | |
6052 | ||
6053 | if (*name == *patn) | |
6054 | { | |
6055 | for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1) | |
6056 | if (*p != *name) | |
6057 | break; | |
6058 | if (*p == '\0' && is_name_suffix (name)) | |
6059 | return match != name0 && !is_valid_name_for_wild_match (name0); | |
6060 | ||
6061 | if (name[-1] == '_') | |
6062 | name -= 1; | |
6063 | } | |
6064 | if (!advance_wild_match (&name, name0, *patn)) | |
6065 | return 1; | |
96d887e8 | 6066 | } |
96d887e8 PH |
6067 | } |
6068 | ||
40658b94 PH |
6069 | /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from |
6070 | informational suffix. */ | |
6071 | ||
c4d840bd PH |
6072 | static int |
6073 | full_match (const char *sym_name, const char *search_name) | |
6074 | { | |
40658b94 | 6075 | return !match_name (sym_name, search_name, 0); |
c4d840bd PH |
6076 | } |
6077 | ||
6078 | ||
96d887e8 PH |
6079 | /* Add symbols from BLOCK matching identifier NAME in DOMAIN to |
6080 | vector *defn_symbols, updating the list of symbols in OBSTACKP | |
0963b4bd | 6081 | (if necessary). If WILD, treat as NAME with a wildcard prefix. |
4eeaa230 | 6082 | OBJFILE is the section containing BLOCK. */ |
96d887e8 PH |
6083 | |
6084 | static void | |
6085 | ada_add_block_symbols (struct obstack *obstackp, | |
f0c5f9b2 | 6086 | const struct block *block, const char *name, |
96d887e8 | 6087 | domain_enum domain, struct objfile *objfile, |
2570f2b7 | 6088 | int wild) |
96d887e8 | 6089 | { |
8157b174 | 6090 | struct block_iterator iter; |
96d887e8 PH |
6091 | int name_len = strlen (name); |
6092 | /* A matching argument symbol, if any. */ | |
6093 | struct symbol *arg_sym; | |
6094 | /* Set true when we find a matching non-argument symbol. */ | |
6095 | int found_sym; | |
6096 | struct symbol *sym; | |
6097 | ||
6098 | arg_sym = NULL; | |
6099 | found_sym = 0; | |
6100 | if (wild) | |
6101 | { | |
8157b174 TT |
6102 | for (sym = block_iter_match_first (block, name, wild_match, &iter); |
6103 | sym != NULL; sym = block_iter_match_next (name, wild_match, &iter)) | |
76a01679 | 6104 | { |
4186eb54 KS |
6105 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
6106 | SYMBOL_DOMAIN (sym), domain) | |
73589123 | 6107 | && wild_match (SYMBOL_LINKAGE_NAME (sym), name) == 0) |
76a01679 | 6108 | { |
2a2d4dc3 AS |
6109 | if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED) |
6110 | continue; | |
6111 | else if (SYMBOL_IS_ARGUMENT (sym)) | |
6112 | arg_sym = sym; | |
6113 | else | |
6114 | { | |
76a01679 JB |
6115 | found_sym = 1; |
6116 | add_defn_to_vec (obstackp, | |
6117 | fixup_symbol_section (sym, objfile), | |
2570f2b7 | 6118 | block); |
76a01679 JB |
6119 | } |
6120 | } | |
6121 | } | |
96d887e8 PH |
6122 | } |
6123 | else | |
6124 | { | |
8157b174 TT |
6125 | for (sym = block_iter_match_first (block, name, full_match, &iter); |
6126 | sym != NULL; sym = block_iter_match_next (name, full_match, &iter)) | |
76a01679 | 6127 | { |
4186eb54 KS |
6128 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
6129 | SYMBOL_DOMAIN (sym), domain)) | |
76a01679 | 6130 | { |
c4d840bd PH |
6131 | if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED) |
6132 | { | |
6133 | if (SYMBOL_IS_ARGUMENT (sym)) | |
6134 | arg_sym = sym; | |
6135 | else | |
2a2d4dc3 | 6136 | { |
c4d840bd PH |
6137 | found_sym = 1; |
6138 | add_defn_to_vec (obstackp, | |
6139 | fixup_symbol_section (sym, objfile), | |
6140 | block); | |
2a2d4dc3 | 6141 | } |
c4d840bd | 6142 | } |
76a01679 JB |
6143 | } |
6144 | } | |
96d887e8 PH |
6145 | } |
6146 | ||
22cee43f PMR |
6147 | /* Handle renamings. */ |
6148 | ||
6149 | if (ada_add_block_renamings (obstackp, block, name, domain, wild)) | |
6150 | found_sym = 1; | |
6151 | ||
96d887e8 PH |
6152 | if (!found_sym && arg_sym != NULL) |
6153 | { | |
76a01679 JB |
6154 | add_defn_to_vec (obstackp, |
6155 | fixup_symbol_section (arg_sym, objfile), | |
2570f2b7 | 6156 | block); |
96d887e8 PH |
6157 | } |
6158 | ||
6159 | if (!wild) | |
6160 | { | |
6161 | arg_sym = NULL; | |
6162 | found_sym = 0; | |
6163 | ||
6164 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
76a01679 | 6165 | { |
4186eb54 KS |
6166 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
6167 | SYMBOL_DOMAIN (sym), domain)) | |
76a01679 JB |
6168 | { |
6169 | int cmp; | |
6170 | ||
6171 | cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0]; | |
6172 | if (cmp == 0) | |
6173 | { | |
61012eef | 6174 | cmp = !startswith (SYMBOL_LINKAGE_NAME (sym), "_ada_"); |
76a01679 JB |
6175 | if (cmp == 0) |
6176 | cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5, | |
6177 | name_len); | |
6178 | } | |
6179 | ||
6180 | if (cmp == 0 | |
6181 | && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5)) | |
6182 | { | |
2a2d4dc3 AS |
6183 | if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED) |
6184 | { | |
6185 | if (SYMBOL_IS_ARGUMENT (sym)) | |
6186 | arg_sym = sym; | |
6187 | else | |
6188 | { | |
6189 | found_sym = 1; | |
6190 | add_defn_to_vec (obstackp, | |
6191 | fixup_symbol_section (sym, objfile), | |
6192 | block); | |
6193 | } | |
6194 | } | |
76a01679 JB |
6195 | } |
6196 | } | |
76a01679 | 6197 | } |
96d887e8 PH |
6198 | |
6199 | /* NOTE: This really shouldn't be needed for _ada_ symbols. | |
6200 | They aren't parameters, right? */ | |
6201 | if (!found_sym && arg_sym != NULL) | |
6202 | { | |
6203 | add_defn_to_vec (obstackp, | |
76a01679 | 6204 | fixup_symbol_section (arg_sym, objfile), |
2570f2b7 | 6205 | block); |
96d887e8 PH |
6206 | } |
6207 | } | |
6208 | } | |
6209 | \f | |
41d27058 JB |
6210 | |
6211 | /* Symbol Completion */ | |
6212 | ||
6213 | /* If SYM_NAME is a completion candidate for TEXT, return this symbol | |
6214 | name in a form that's appropriate for the completion. The result | |
6215 | does not need to be deallocated, but is only good until the next call. | |
6216 | ||
6217 | TEXT_LEN is equal to the length of TEXT. | |
e701b3c0 | 6218 | Perform a wild match if WILD_MATCH_P is set. |
6ea35997 | 6219 | ENCODED_P should be set if TEXT represents the start of a symbol name |
41d27058 JB |
6220 | in its encoded form. */ |
6221 | ||
6222 | static const char * | |
6223 | symbol_completion_match (const char *sym_name, | |
6224 | const char *text, int text_len, | |
6ea35997 | 6225 | int wild_match_p, int encoded_p) |
41d27058 | 6226 | { |
41d27058 JB |
6227 | const int verbatim_match = (text[0] == '<'); |
6228 | int match = 0; | |
6229 | ||
6230 | if (verbatim_match) | |
6231 | { | |
6232 | /* Strip the leading angle bracket. */ | |
6233 | text = text + 1; | |
6234 | text_len--; | |
6235 | } | |
6236 | ||
6237 | /* First, test against the fully qualified name of the symbol. */ | |
6238 | ||
6239 | if (strncmp (sym_name, text, text_len) == 0) | |
6240 | match = 1; | |
6241 | ||
6ea35997 | 6242 | if (match && !encoded_p) |
41d27058 JB |
6243 | { |
6244 | /* One needed check before declaring a positive match is to verify | |
6245 | that iff we are doing a verbatim match, the decoded version | |
6246 | of the symbol name starts with '<'. Otherwise, this symbol name | |
6247 | is not a suitable completion. */ | |
6248 | const char *sym_name_copy = sym_name; | |
6249 | int has_angle_bracket; | |
6250 | ||
6251 | sym_name = ada_decode (sym_name); | |
6252 | has_angle_bracket = (sym_name[0] == '<'); | |
6253 | match = (has_angle_bracket == verbatim_match); | |
6254 | sym_name = sym_name_copy; | |
6255 | } | |
6256 | ||
6257 | if (match && !verbatim_match) | |
6258 | { | |
6259 | /* When doing non-verbatim match, another check that needs to | |
6260 | be done is to verify that the potentially matching symbol name | |
6261 | does not include capital letters, because the ada-mode would | |
6262 | not be able to understand these symbol names without the | |
6263 | angle bracket notation. */ | |
6264 | const char *tmp; | |
6265 | ||
6266 | for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++); | |
6267 | if (*tmp != '\0') | |
6268 | match = 0; | |
6269 | } | |
6270 | ||
6271 | /* Second: Try wild matching... */ | |
6272 | ||
e701b3c0 | 6273 | if (!match && wild_match_p) |
41d27058 JB |
6274 | { |
6275 | /* Since we are doing wild matching, this means that TEXT | |
6276 | may represent an unqualified symbol name. We therefore must | |
6277 | also compare TEXT against the unqualified name of the symbol. */ | |
6278 | sym_name = ada_unqualified_name (ada_decode (sym_name)); | |
6279 | ||
6280 | if (strncmp (sym_name, text, text_len) == 0) | |
6281 | match = 1; | |
6282 | } | |
6283 | ||
6284 | /* Finally: If we found a mach, prepare the result to return. */ | |
6285 | ||
6286 | if (!match) | |
6287 | return NULL; | |
6288 | ||
6289 | if (verbatim_match) | |
6290 | sym_name = add_angle_brackets (sym_name); | |
6291 | ||
6ea35997 | 6292 | if (!encoded_p) |
41d27058 JB |
6293 | sym_name = ada_decode (sym_name); |
6294 | ||
6295 | return sym_name; | |
6296 | } | |
6297 | ||
6298 | /* A companion function to ada_make_symbol_completion_list(). | |
6299 | Check if SYM_NAME represents a symbol which name would be suitable | |
6300 | to complete TEXT (TEXT_LEN is the length of TEXT), in which case | |
6301 | it is appended at the end of the given string vector SV. | |
6302 | ||
6303 | ORIG_TEXT is the string original string from the user command | |
6304 | that needs to be completed. WORD is the entire command on which | |
6305 | completion should be performed. These two parameters are used to | |
6306 | determine which part of the symbol name should be added to the | |
6307 | completion vector. | |
c0af1706 | 6308 | if WILD_MATCH_P is set, then wild matching is performed. |
cb8e9b97 | 6309 | ENCODED_P should be set if TEXT represents a symbol name in its |
41d27058 JB |
6310 | encoded formed (in which case the completion should also be |
6311 | encoded). */ | |
6312 | ||
6313 | static void | |
d6565258 | 6314 | symbol_completion_add (VEC(char_ptr) **sv, |
41d27058 JB |
6315 | const char *sym_name, |
6316 | const char *text, int text_len, | |
6317 | const char *orig_text, const char *word, | |
cb8e9b97 | 6318 | int wild_match_p, int encoded_p) |
41d27058 JB |
6319 | { |
6320 | const char *match = symbol_completion_match (sym_name, text, text_len, | |
cb8e9b97 | 6321 | wild_match_p, encoded_p); |
41d27058 JB |
6322 | char *completion; |
6323 | ||
6324 | if (match == NULL) | |
6325 | return; | |
6326 | ||
6327 | /* We found a match, so add the appropriate completion to the given | |
6328 | string vector. */ | |
6329 | ||
6330 | if (word == orig_text) | |
6331 | { | |
6332 | completion = xmalloc (strlen (match) + 5); | |
6333 | strcpy (completion, match); | |
6334 | } | |
6335 | else if (word > orig_text) | |
6336 | { | |
6337 | /* Return some portion of sym_name. */ | |
6338 | completion = xmalloc (strlen (match) + 5); | |
6339 | strcpy (completion, match + (word - orig_text)); | |
6340 | } | |
6341 | else | |
6342 | { | |
6343 | /* Return some of ORIG_TEXT plus sym_name. */ | |
6344 | completion = xmalloc (strlen (match) + (orig_text - word) + 5); | |
6345 | strncpy (completion, word, orig_text - word); | |
6346 | completion[orig_text - word] = '\0'; | |
6347 | strcat (completion, match); | |
6348 | } | |
6349 | ||
d6565258 | 6350 | VEC_safe_push (char_ptr, *sv, completion); |
41d27058 JB |
6351 | } |
6352 | ||
ccefe4c4 | 6353 | /* An object of this type is passed as the user_data argument to the |
bb4142cf | 6354 | expand_symtabs_matching method. */ |
ccefe4c4 TT |
6355 | struct add_partial_datum |
6356 | { | |
6357 | VEC(char_ptr) **completions; | |
6f937416 | 6358 | const char *text; |
ccefe4c4 | 6359 | int text_len; |
6f937416 PA |
6360 | const char *text0; |
6361 | const char *word; | |
ccefe4c4 TT |
6362 | int wild_match; |
6363 | int encoded; | |
6364 | }; | |
6365 | ||
bb4142cf DE |
6366 | /* A callback for expand_symtabs_matching. */ |
6367 | ||
7b08b9eb | 6368 | static int |
bb4142cf | 6369 | ada_complete_symbol_matcher (const char *name, void *user_data) |
ccefe4c4 TT |
6370 | { |
6371 | struct add_partial_datum *data = user_data; | |
7b08b9eb JK |
6372 | |
6373 | return symbol_completion_match (name, data->text, data->text_len, | |
6374 | data->wild_match, data->encoded) != NULL; | |
ccefe4c4 TT |
6375 | } |
6376 | ||
49c4e619 TT |
6377 | /* Return a list of possible symbol names completing TEXT0. WORD is |
6378 | the entire command on which completion is made. */ | |
41d27058 | 6379 | |
49c4e619 | 6380 | static VEC (char_ptr) * |
6f937416 PA |
6381 | ada_make_symbol_completion_list (const char *text0, const char *word, |
6382 | enum type_code code) | |
41d27058 JB |
6383 | { |
6384 | char *text; | |
6385 | int text_len; | |
b1ed564a JB |
6386 | int wild_match_p; |
6387 | int encoded_p; | |
2ba95b9b | 6388 | VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128); |
41d27058 | 6389 | struct symbol *sym; |
43f3e411 | 6390 | struct compunit_symtab *s; |
41d27058 JB |
6391 | struct minimal_symbol *msymbol; |
6392 | struct objfile *objfile; | |
3977b71f | 6393 | const struct block *b, *surrounding_static_block = 0; |
41d27058 | 6394 | int i; |
8157b174 | 6395 | struct block_iterator iter; |
b8fea896 | 6396 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); |
41d27058 | 6397 | |
2f68a895 TT |
6398 | gdb_assert (code == TYPE_CODE_UNDEF); |
6399 | ||
41d27058 JB |
6400 | if (text0[0] == '<') |
6401 | { | |
6402 | text = xstrdup (text0); | |
6403 | make_cleanup (xfree, text); | |
6404 | text_len = strlen (text); | |
b1ed564a JB |
6405 | wild_match_p = 0; |
6406 | encoded_p = 1; | |
41d27058 JB |
6407 | } |
6408 | else | |
6409 | { | |
6410 | text = xstrdup (ada_encode (text0)); | |
6411 | make_cleanup (xfree, text); | |
6412 | text_len = strlen (text); | |
6413 | for (i = 0; i < text_len; i++) | |
6414 | text[i] = tolower (text[i]); | |
6415 | ||
b1ed564a | 6416 | encoded_p = (strstr (text0, "__") != NULL); |
41d27058 JB |
6417 | /* If the name contains a ".", then the user is entering a fully |
6418 | qualified entity name, and the match must not be done in wild | |
6419 | mode. Similarly, if the user wants to complete what looks like | |
6420 | an encoded name, the match must not be done in wild mode. */ | |
b1ed564a | 6421 | wild_match_p = (strchr (text0, '.') == NULL && !encoded_p); |
41d27058 JB |
6422 | } |
6423 | ||
6424 | /* First, look at the partial symtab symbols. */ | |
41d27058 | 6425 | { |
ccefe4c4 TT |
6426 | struct add_partial_datum data; |
6427 | ||
6428 | data.completions = &completions; | |
6429 | data.text = text; | |
6430 | data.text_len = text_len; | |
6431 | data.text0 = text0; | |
6432 | data.word = word; | |
b1ed564a JB |
6433 | data.wild_match = wild_match_p; |
6434 | data.encoded = encoded_p; | |
276d885b GB |
6435 | expand_symtabs_matching (NULL, ada_complete_symbol_matcher, NULL, |
6436 | ALL_DOMAIN, &data); | |
41d27058 JB |
6437 | } |
6438 | ||
6439 | /* At this point scan through the misc symbol vectors and add each | |
6440 | symbol you find to the list. Eventually we want to ignore | |
6441 | anything that isn't a text symbol (everything else will be | |
6442 | handled by the psymtab code above). */ | |
6443 | ||
6444 | ALL_MSYMBOLS (objfile, msymbol) | |
6445 | { | |
6446 | QUIT; | |
efd66ac6 | 6447 | symbol_completion_add (&completions, MSYMBOL_LINKAGE_NAME (msymbol), |
b1ed564a JB |
6448 | text, text_len, text0, word, wild_match_p, |
6449 | encoded_p); | |
41d27058 JB |
6450 | } |
6451 | ||
6452 | /* Search upwards from currently selected frame (so that we can | |
6453 | complete on local vars. */ | |
6454 | ||
6455 | for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b)) | |
6456 | { | |
6457 | if (!BLOCK_SUPERBLOCK (b)) | |
6458 | surrounding_static_block = b; /* For elmin of dups */ | |
6459 | ||
6460 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6461 | { | |
d6565258 | 6462 | symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym), |
41d27058 | 6463 | text, text_len, text0, word, |
b1ed564a | 6464 | wild_match_p, encoded_p); |
41d27058 JB |
6465 | } |
6466 | } | |
6467 | ||
6468 | /* Go through the symtabs and check the externs and statics for | |
43f3e411 | 6469 | symbols which match. */ |
41d27058 | 6470 | |
43f3e411 | 6471 | ALL_COMPUNITS (objfile, s) |
41d27058 JB |
6472 | { |
6473 | QUIT; | |
43f3e411 | 6474 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), GLOBAL_BLOCK); |
41d27058 JB |
6475 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
6476 | { | |
d6565258 | 6477 | symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym), |
41d27058 | 6478 | text, text_len, text0, word, |
b1ed564a | 6479 | wild_match_p, encoded_p); |
41d27058 JB |
6480 | } |
6481 | } | |
6482 | ||
43f3e411 | 6483 | ALL_COMPUNITS (objfile, s) |
41d27058 JB |
6484 | { |
6485 | QUIT; | |
43f3e411 | 6486 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), STATIC_BLOCK); |
41d27058 JB |
6487 | /* Don't do this block twice. */ |
6488 | if (b == surrounding_static_block) | |
6489 | continue; | |
6490 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6491 | { | |
d6565258 | 6492 | symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym), |
41d27058 | 6493 | text, text_len, text0, word, |
b1ed564a | 6494 | wild_match_p, encoded_p); |
41d27058 JB |
6495 | } |
6496 | } | |
6497 | ||
b8fea896 | 6498 | do_cleanups (old_chain); |
49c4e619 | 6499 | return completions; |
41d27058 JB |
6500 | } |
6501 | ||
963a6417 | 6502 | /* Field Access */ |
96d887e8 | 6503 | |
73fb9985 JB |
6504 | /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used |
6505 | for tagged types. */ | |
6506 | ||
6507 | static int | |
6508 | ada_is_dispatch_table_ptr_type (struct type *type) | |
6509 | { | |
0d5cff50 | 6510 | const char *name; |
73fb9985 JB |
6511 | |
6512 | if (TYPE_CODE (type) != TYPE_CODE_PTR) | |
6513 | return 0; | |
6514 | ||
6515 | name = TYPE_NAME (TYPE_TARGET_TYPE (type)); | |
6516 | if (name == NULL) | |
6517 | return 0; | |
6518 | ||
6519 | return (strcmp (name, "ada__tags__dispatch_table") == 0); | |
6520 | } | |
6521 | ||
ac4a2da4 JG |
6522 | /* Return non-zero if TYPE is an interface tag. */ |
6523 | ||
6524 | static int | |
6525 | ada_is_interface_tag (struct type *type) | |
6526 | { | |
6527 | const char *name = TYPE_NAME (type); | |
6528 | ||
6529 | if (name == NULL) | |
6530 | return 0; | |
6531 | ||
6532 | return (strcmp (name, "ada__tags__interface_tag") == 0); | |
6533 | } | |
6534 | ||
963a6417 PH |
6535 | /* True if field number FIELD_NUM in struct or union type TYPE is supposed |
6536 | to be invisible to users. */ | |
96d887e8 | 6537 | |
963a6417 PH |
6538 | int |
6539 | ada_is_ignored_field (struct type *type, int field_num) | |
96d887e8 | 6540 | { |
963a6417 PH |
6541 | if (field_num < 0 || field_num > TYPE_NFIELDS (type)) |
6542 | return 1; | |
ffde82bf | 6543 | |
73fb9985 JB |
6544 | /* Check the name of that field. */ |
6545 | { | |
6546 | const char *name = TYPE_FIELD_NAME (type, field_num); | |
6547 | ||
6548 | /* Anonymous field names should not be printed. | |
6549 | brobecker/2007-02-20: I don't think this can actually happen | |
6550 | but we don't want to print the value of annonymous fields anyway. */ | |
6551 | if (name == NULL) | |
6552 | return 1; | |
6553 | ||
ffde82bf JB |
6554 | /* Normally, fields whose name start with an underscore ("_") |
6555 | are fields that have been internally generated by the compiler, | |
6556 | and thus should not be printed. The "_parent" field is special, | |
6557 | however: This is a field internally generated by the compiler | |
6558 | for tagged types, and it contains the components inherited from | |
6559 | the parent type. This field should not be printed as is, but | |
6560 | should not be ignored either. */ | |
61012eef | 6561 | if (name[0] == '_' && !startswith (name, "_parent")) |
73fb9985 JB |
6562 | return 1; |
6563 | } | |
6564 | ||
ac4a2da4 JG |
6565 | /* If this is the dispatch table of a tagged type or an interface tag, |
6566 | then ignore. */ | |
73fb9985 | 6567 | if (ada_is_tagged_type (type, 1) |
ac4a2da4 JG |
6568 | && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)) |
6569 | || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num)))) | |
73fb9985 JB |
6570 | return 1; |
6571 | ||
6572 | /* Not a special field, so it should not be ignored. */ | |
6573 | return 0; | |
963a6417 | 6574 | } |
96d887e8 | 6575 | |
963a6417 | 6576 | /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a |
0963b4bd | 6577 | pointer or reference type whose ultimate target has a tag field. */ |
96d887e8 | 6578 | |
963a6417 PH |
6579 | int |
6580 | ada_is_tagged_type (struct type *type, int refok) | |
6581 | { | |
6582 | return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL); | |
6583 | } | |
96d887e8 | 6584 | |
963a6417 | 6585 | /* True iff TYPE represents the type of X'Tag */ |
96d887e8 | 6586 | |
963a6417 PH |
6587 | int |
6588 | ada_is_tag_type (struct type *type) | |
6589 | { | |
460efde1 JB |
6590 | type = ada_check_typedef (type); |
6591 | ||
963a6417 PH |
6592 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR) |
6593 | return 0; | |
6594 | else | |
96d887e8 | 6595 | { |
963a6417 | 6596 | const char *name = ada_type_name (TYPE_TARGET_TYPE (type)); |
5b4ee69b | 6597 | |
963a6417 PH |
6598 | return (name != NULL |
6599 | && strcmp (name, "ada__tags__dispatch_table") == 0); | |
96d887e8 | 6600 | } |
96d887e8 PH |
6601 | } |
6602 | ||
963a6417 | 6603 | /* The type of the tag on VAL. */ |
76a01679 | 6604 | |
963a6417 PH |
6605 | struct type * |
6606 | ada_tag_type (struct value *val) | |
96d887e8 | 6607 | { |
df407dfe | 6608 | return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL); |
963a6417 | 6609 | } |
96d887e8 | 6610 | |
b50d69b5 JG |
6611 | /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95, |
6612 | retired at Ada 05). */ | |
6613 | ||
6614 | static int | |
6615 | is_ada95_tag (struct value *tag) | |
6616 | { | |
6617 | return ada_value_struct_elt (tag, "tsd", 1) != NULL; | |
6618 | } | |
6619 | ||
963a6417 | 6620 | /* The value of the tag on VAL. */ |
96d887e8 | 6621 | |
963a6417 PH |
6622 | struct value * |
6623 | ada_value_tag (struct value *val) | |
6624 | { | |
03ee6b2e | 6625 | return ada_value_struct_elt (val, "_tag", 0); |
96d887e8 PH |
6626 | } |
6627 | ||
963a6417 PH |
6628 | /* The value of the tag on the object of type TYPE whose contents are |
6629 | saved at VALADDR, if it is non-null, or is at memory address | |
0963b4bd | 6630 | ADDRESS. */ |
96d887e8 | 6631 | |
963a6417 | 6632 | static struct value * |
10a2c479 | 6633 | value_tag_from_contents_and_address (struct type *type, |
fc1a4b47 | 6634 | const gdb_byte *valaddr, |
963a6417 | 6635 | CORE_ADDR address) |
96d887e8 | 6636 | { |
b5385fc0 | 6637 | int tag_byte_offset; |
963a6417 | 6638 | struct type *tag_type; |
5b4ee69b | 6639 | |
963a6417 | 6640 | if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset, |
52ce6436 | 6641 | NULL, NULL, NULL)) |
96d887e8 | 6642 | { |
fc1a4b47 | 6643 | const gdb_byte *valaddr1 = ((valaddr == NULL) |
10a2c479 AC |
6644 | ? NULL |
6645 | : valaddr + tag_byte_offset); | |
963a6417 | 6646 | CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset; |
96d887e8 | 6647 | |
963a6417 | 6648 | return value_from_contents_and_address (tag_type, valaddr1, address1); |
96d887e8 | 6649 | } |
963a6417 PH |
6650 | return NULL; |
6651 | } | |
96d887e8 | 6652 | |
963a6417 PH |
6653 | static struct type * |
6654 | type_from_tag (struct value *tag) | |
6655 | { | |
6656 | const char *type_name = ada_tag_name (tag); | |
5b4ee69b | 6657 | |
963a6417 PH |
6658 | if (type_name != NULL) |
6659 | return ada_find_any_type (ada_encode (type_name)); | |
6660 | return NULL; | |
6661 | } | |
96d887e8 | 6662 | |
b50d69b5 JG |
6663 | /* Given a value OBJ of a tagged type, return a value of this |
6664 | type at the base address of the object. The base address, as | |
6665 | defined in Ada.Tags, it is the address of the primary tag of | |
6666 | the object, and therefore where the field values of its full | |
6667 | view can be fetched. */ | |
6668 | ||
6669 | struct value * | |
6670 | ada_tag_value_at_base_address (struct value *obj) | |
6671 | { | |
b50d69b5 JG |
6672 | struct value *val; |
6673 | LONGEST offset_to_top = 0; | |
6674 | struct type *ptr_type, *obj_type; | |
6675 | struct value *tag; | |
6676 | CORE_ADDR base_address; | |
6677 | ||
6678 | obj_type = value_type (obj); | |
6679 | ||
6680 | /* It is the responsability of the caller to deref pointers. */ | |
6681 | ||
6682 | if (TYPE_CODE (obj_type) == TYPE_CODE_PTR | |
6683 | || TYPE_CODE (obj_type) == TYPE_CODE_REF) | |
6684 | return obj; | |
6685 | ||
6686 | tag = ada_value_tag (obj); | |
6687 | if (!tag) | |
6688 | return obj; | |
6689 | ||
6690 | /* Base addresses only appeared with Ada 05 and multiple inheritance. */ | |
6691 | ||
6692 | if (is_ada95_tag (tag)) | |
6693 | return obj; | |
6694 | ||
6695 | ptr_type = builtin_type (target_gdbarch ())->builtin_data_ptr; | |
6696 | ptr_type = lookup_pointer_type (ptr_type); | |
6697 | val = value_cast (ptr_type, tag); | |
6698 | if (!val) | |
6699 | return obj; | |
6700 | ||
6701 | /* It is perfectly possible that an exception be raised while | |
6702 | trying to determine the base address, just like for the tag; | |
6703 | see ada_tag_name for more details. We do not print the error | |
6704 | message for the same reason. */ | |
6705 | ||
492d29ea | 6706 | TRY |
b50d69b5 JG |
6707 | { |
6708 | offset_to_top = value_as_long (value_ind (value_ptradd (val, -2))); | |
6709 | } | |
6710 | ||
492d29ea PA |
6711 | CATCH (e, RETURN_MASK_ERROR) |
6712 | { | |
6713 | return obj; | |
6714 | } | |
6715 | END_CATCH | |
b50d69b5 JG |
6716 | |
6717 | /* If offset is null, nothing to do. */ | |
6718 | ||
6719 | if (offset_to_top == 0) | |
6720 | return obj; | |
6721 | ||
6722 | /* -1 is a special case in Ada.Tags; however, what should be done | |
6723 | is not quite clear from the documentation. So do nothing for | |
6724 | now. */ | |
6725 | ||
6726 | if (offset_to_top == -1) | |
6727 | return obj; | |
6728 | ||
6729 | base_address = value_address (obj) - offset_to_top; | |
6730 | tag = value_tag_from_contents_and_address (obj_type, NULL, base_address); | |
6731 | ||
6732 | /* Make sure that we have a proper tag at the new address. | |
6733 | Otherwise, offset_to_top is bogus (which can happen when | |
6734 | the object is not initialized yet). */ | |
6735 | ||
6736 | if (!tag) | |
6737 | return obj; | |
6738 | ||
6739 | obj_type = type_from_tag (tag); | |
6740 | ||
6741 | if (!obj_type) | |
6742 | return obj; | |
6743 | ||
6744 | return value_from_contents_and_address (obj_type, NULL, base_address); | |
6745 | } | |
6746 | ||
1b611343 JB |
6747 | /* Return the "ada__tags__type_specific_data" type. */ |
6748 | ||
6749 | static struct type * | |
6750 | ada_get_tsd_type (struct inferior *inf) | |
963a6417 | 6751 | { |
1b611343 | 6752 | struct ada_inferior_data *data = get_ada_inferior_data (inf); |
4c4b4cd2 | 6753 | |
1b611343 JB |
6754 | if (data->tsd_type == 0) |
6755 | data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data"); | |
6756 | return data->tsd_type; | |
6757 | } | |
529cad9c | 6758 | |
1b611343 JB |
6759 | /* Return the TSD (type-specific data) associated to the given TAG. |
6760 | TAG is assumed to be the tag of a tagged-type entity. | |
529cad9c | 6761 | |
1b611343 | 6762 | May return NULL if we are unable to get the TSD. */ |
4c4b4cd2 | 6763 | |
1b611343 JB |
6764 | static struct value * |
6765 | ada_get_tsd_from_tag (struct value *tag) | |
4c4b4cd2 | 6766 | { |
4c4b4cd2 | 6767 | struct value *val; |
1b611343 | 6768 | struct type *type; |
5b4ee69b | 6769 | |
1b611343 JB |
6770 | /* First option: The TSD is simply stored as a field of our TAG. |
6771 | Only older versions of GNAT would use this format, but we have | |
6772 | to test it first, because there are no visible markers for | |
6773 | the current approach except the absence of that field. */ | |
529cad9c | 6774 | |
1b611343 JB |
6775 | val = ada_value_struct_elt (tag, "tsd", 1); |
6776 | if (val) | |
6777 | return val; | |
e802dbe0 | 6778 | |
1b611343 JB |
6779 | /* Try the second representation for the dispatch table (in which |
6780 | there is no explicit 'tsd' field in the referent of the tag pointer, | |
6781 | and instead the tsd pointer is stored just before the dispatch | |
6782 | table. */ | |
e802dbe0 | 6783 | |
1b611343 JB |
6784 | type = ada_get_tsd_type (current_inferior()); |
6785 | if (type == NULL) | |
6786 | return NULL; | |
6787 | type = lookup_pointer_type (lookup_pointer_type (type)); | |
6788 | val = value_cast (type, tag); | |
6789 | if (val == NULL) | |
6790 | return NULL; | |
6791 | return value_ind (value_ptradd (val, -1)); | |
e802dbe0 JB |
6792 | } |
6793 | ||
1b611343 JB |
6794 | /* Given the TSD of a tag (type-specific data), return a string |
6795 | containing the name of the associated type. | |
6796 | ||
6797 | The returned value is good until the next call. May return NULL | |
6798 | if we are unable to determine the tag name. */ | |
6799 | ||
6800 | static char * | |
6801 | ada_tag_name_from_tsd (struct value *tsd) | |
529cad9c | 6802 | { |
529cad9c PH |
6803 | static char name[1024]; |
6804 | char *p; | |
1b611343 | 6805 | struct value *val; |
529cad9c | 6806 | |
1b611343 | 6807 | val = ada_value_struct_elt (tsd, "expanded_name", 1); |
4c4b4cd2 | 6808 | if (val == NULL) |
1b611343 | 6809 | return NULL; |
4c4b4cd2 PH |
6810 | read_memory_string (value_as_address (val), name, sizeof (name) - 1); |
6811 | for (p = name; *p != '\0'; p += 1) | |
6812 | if (isalpha (*p)) | |
6813 | *p = tolower (*p); | |
1b611343 | 6814 | return name; |
4c4b4cd2 PH |
6815 | } |
6816 | ||
6817 | /* The type name of the dynamic type denoted by the 'tag value TAG, as | |
1b611343 JB |
6818 | a C string. |
6819 | ||
6820 | Return NULL if the TAG is not an Ada tag, or if we were unable to | |
6821 | determine the name of that tag. The result is good until the next | |
6822 | call. */ | |
4c4b4cd2 PH |
6823 | |
6824 | const char * | |
6825 | ada_tag_name (struct value *tag) | |
6826 | { | |
1b611343 | 6827 | char *name = NULL; |
5b4ee69b | 6828 | |
df407dfe | 6829 | if (!ada_is_tag_type (value_type (tag))) |
4c4b4cd2 | 6830 | return NULL; |
1b611343 JB |
6831 | |
6832 | /* It is perfectly possible that an exception be raised while trying | |
6833 | to determine the TAG's name, even under normal circumstances: | |
6834 | The associated variable may be uninitialized or corrupted, for | |
6835 | instance. We do not let any exception propagate past this point. | |
6836 | instead we return NULL. | |
6837 | ||
6838 | We also do not print the error message either (which often is very | |
6839 | low-level (Eg: "Cannot read memory at 0x[...]"), but instead let | |
6840 | the caller print a more meaningful message if necessary. */ | |
492d29ea | 6841 | TRY |
1b611343 JB |
6842 | { |
6843 | struct value *tsd = ada_get_tsd_from_tag (tag); | |
6844 | ||
6845 | if (tsd != NULL) | |
6846 | name = ada_tag_name_from_tsd (tsd); | |
6847 | } | |
492d29ea PA |
6848 | CATCH (e, RETURN_MASK_ERROR) |
6849 | { | |
6850 | } | |
6851 | END_CATCH | |
1b611343 JB |
6852 | |
6853 | return name; | |
4c4b4cd2 PH |
6854 | } |
6855 | ||
6856 | /* The parent type of TYPE, or NULL if none. */ | |
14f9c5c9 | 6857 | |
d2e4a39e | 6858 | struct type * |
ebf56fd3 | 6859 | ada_parent_type (struct type *type) |
14f9c5c9 AS |
6860 | { |
6861 | int i; | |
6862 | ||
61ee279c | 6863 | type = ada_check_typedef (type); |
14f9c5c9 AS |
6864 | |
6865 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT) | |
6866 | return NULL; | |
6867 | ||
6868 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
6869 | if (ada_is_parent_field (type, i)) | |
0c1f74cf JB |
6870 | { |
6871 | struct type *parent_type = TYPE_FIELD_TYPE (type, i); | |
6872 | ||
6873 | /* If the _parent field is a pointer, then dereference it. */ | |
6874 | if (TYPE_CODE (parent_type) == TYPE_CODE_PTR) | |
6875 | parent_type = TYPE_TARGET_TYPE (parent_type); | |
6876 | /* If there is a parallel XVS type, get the actual base type. */ | |
6877 | parent_type = ada_get_base_type (parent_type); | |
6878 | ||
6879 | return ada_check_typedef (parent_type); | |
6880 | } | |
14f9c5c9 AS |
6881 | |
6882 | return NULL; | |
6883 | } | |
6884 | ||
4c4b4cd2 PH |
6885 | /* True iff field number FIELD_NUM of structure type TYPE contains the |
6886 | parent-type (inherited) fields of a derived type. Assumes TYPE is | |
6887 | a structure type with at least FIELD_NUM+1 fields. */ | |
14f9c5c9 AS |
6888 | |
6889 | int | |
ebf56fd3 | 6890 | ada_is_parent_field (struct type *type, int field_num) |
14f9c5c9 | 6891 | { |
61ee279c | 6892 | const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num); |
5b4ee69b | 6893 | |
4c4b4cd2 | 6894 | return (name != NULL |
61012eef GB |
6895 | && (startswith (name, "PARENT") |
6896 | || startswith (name, "_parent"))); | |
14f9c5c9 AS |
6897 | } |
6898 | ||
4c4b4cd2 | 6899 | /* True iff field number FIELD_NUM of structure type TYPE is a |
14f9c5c9 | 6900 | transparent wrapper field (which should be silently traversed when doing |
4c4b4cd2 | 6901 | field selection and flattened when printing). Assumes TYPE is a |
14f9c5c9 | 6902 | structure type with at least FIELD_NUM+1 fields. Such fields are always |
4c4b4cd2 | 6903 | structures. */ |
14f9c5c9 AS |
6904 | |
6905 | int | |
ebf56fd3 | 6906 | ada_is_wrapper_field (struct type *type, int field_num) |
14f9c5c9 | 6907 | { |
d2e4a39e | 6908 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5b4ee69b | 6909 | |
d2e4a39e | 6910 | return (name != NULL |
61012eef | 6911 | && (startswith (name, "PARENT") |
4c4b4cd2 | 6912 | || strcmp (name, "REP") == 0 |
61012eef | 6913 | || startswith (name, "_parent") |
4c4b4cd2 | 6914 | || name[0] == 'S' || name[0] == 'R' || name[0] == 'O')); |
14f9c5c9 AS |
6915 | } |
6916 | ||
4c4b4cd2 PH |
6917 | /* True iff field number FIELD_NUM of structure or union type TYPE |
6918 | is a variant wrapper. Assumes TYPE is a structure type with at least | |
6919 | FIELD_NUM+1 fields. */ | |
14f9c5c9 AS |
6920 | |
6921 | int | |
ebf56fd3 | 6922 | ada_is_variant_part (struct type *type, int field_num) |
14f9c5c9 | 6923 | { |
d2e4a39e | 6924 | struct type *field_type = TYPE_FIELD_TYPE (type, field_num); |
5b4ee69b | 6925 | |
14f9c5c9 | 6926 | return (TYPE_CODE (field_type) == TYPE_CODE_UNION |
4c4b4cd2 | 6927 | || (is_dynamic_field (type, field_num) |
c3e5cd34 PH |
6928 | && (TYPE_CODE (TYPE_TARGET_TYPE (field_type)) |
6929 | == TYPE_CODE_UNION))); | |
14f9c5c9 AS |
6930 | } |
6931 | ||
6932 | /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part) | |
4c4b4cd2 | 6933 | whose discriminants are contained in the record type OUTER_TYPE, |
7c964f07 UW |
6934 | returns the type of the controlling discriminant for the variant. |
6935 | May return NULL if the type could not be found. */ | |
14f9c5c9 | 6936 | |
d2e4a39e | 6937 | struct type * |
ebf56fd3 | 6938 | ada_variant_discrim_type (struct type *var_type, struct type *outer_type) |
14f9c5c9 | 6939 | { |
d2e4a39e | 6940 | char *name = ada_variant_discrim_name (var_type); |
5b4ee69b | 6941 | |
7c964f07 | 6942 | return ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL); |
14f9c5c9 AS |
6943 | } |
6944 | ||
4c4b4cd2 | 6945 | /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a |
14f9c5c9 | 6946 | valid field number within it, returns 1 iff field FIELD_NUM of TYPE |
4c4b4cd2 | 6947 | represents a 'when others' clause; otherwise 0. */ |
14f9c5c9 AS |
6948 | |
6949 | int | |
ebf56fd3 | 6950 | ada_is_others_clause (struct type *type, int field_num) |
14f9c5c9 | 6951 | { |
d2e4a39e | 6952 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5b4ee69b | 6953 | |
14f9c5c9 AS |
6954 | return (name != NULL && name[0] == 'O'); |
6955 | } | |
6956 | ||
6957 | /* Assuming that TYPE0 is the type of the variant part of a record, | |
4c4b4cd2 PH |
6958 | returns the name of the discriminant controlling the variant. |
6959 | The value is valid until the next call to ada_variant_discrim_name. */ | |
14f9c5c9 | 6960 | |
d2e4a39e | 6961 | char * |
ebf56fd3 | 6962 | ada_variant_discrim_name (struct type *type0) |
14f9c5c9 | 6963 | { |
d2e4a39e | 6964 | static char *result = NULL; |
14f9c5c9 | 6965 | static size_t result_len = 0; |
d2e4a39e AS |
6966 | struct type *type; |
6967 | const char *name; | |
6968 | const char *discrim_end; | |
6969 | const char *discrim_start; | |
14f9c5c9 AS |
6970 | |
6971 | if (TYPE_CODE (type0) == TYPE_CODE_PTR) | |
6972 | type = TYPE_TARGET_TYPE (type0); | |
6973 | else | |
6974 | type = type0; | |
6975 | ||
6976 | name = ada_type_name (type); | |
6977 | ||
6978 | if (name == NULL || name[0] == '\000') | |
6979 | return ""; | |
6980 | ||
6981 | for (discrim_end = name + strlen (name) - 6; discrim_end != name; | |
6982 | discrim_end -= 1) | |
6983 | { | |
61012eef | 6984 | if (startswith (discrim_end, "___XVN")) |
4c4b4cd2 | 6985 | break; |
14f9c5c9 AS |
6986 | } |
6987 | if (discrim_end == name) | |
6988 | return ""; | |
6989 | ||
d2e4a39e | 6990 | for (discrim_start = discrim_end; discrim_start != name + 3; |
14f9c5c9 AS |
6991 | discrim_start -= 1) |
6992 | { | |
d2e4a39e | 6993 | if (discrim_start == name + 1) |
4c4b4cd2 | 6994 | return ""; |
76a01679 | 6995 | if ((discrim_start > name + 3 |
61012eef | 6996 | && startswith (discrim_start - 3, "___")) |
4c4b4cd2 PH |
6997 | || discrim_start[-1] == '.') |
6998 | break; | |
14f9c5c9 AS |
6999 | } |
7000 | ||
7001 | GROW_VECT (result, result_len, discrim_end - discrim_start + 1); | |
7002 | strncpy (result, discrim_start, discrim_end - discrim_start); | |
d2e4a39e | 7003 | result[discrim_end - discrim_start] = '\0'; |
14f9c5c9 AS |
7004 | return result; |
7005 | } | |
7006 | ||
4c4b4cd2 PH |
7007 | /* Scan STR for a subtype-encoded number, beginning at position K. |
7008 | Put the position of the character just past the number scanned in | |
7009 | *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL. | |
7010 | Return 1 if there was a valid number at the given position, and 0 | |
7011 | otherwise. A "subtype-encoded" number consists of the absolute value | |
7012 | in decimal, followed by the letter 'm' to indicate a negative number. | |
7013 | Assumes 0m does not occur. */ | |
14f9c5c9 AS |
7014 | |
7015 | int | |
d2e4a39e | 7016 | ada_scan_number (const char str[], int k, LONGEST * R, int *new_k) |
14f9c5c9 AS |
7017 | { |
7018 | ULONGEST RU; | |
7019 | ||
d2e4a39e | 7020 | if (!isdigit (str[k])) |
14f9c5c9 AS |
7021 | return 0; |
7022 | ||
4c4b4cd2 | 7023 | /* Do it the hard way so as not to make any assumption about |
14f9c5c9 | 7024 | the relationship of unsigned long (%lu scan format code) and |
4c4b4cd2 | 7025 | LONGEST. */ |
14f9c5c9 AS |
7026 | RU = 0; |
7027 | while (isdigit (str[k])) | |
7028 | { | |
d2e4a39e | 7029 | RU = RU * 10 + (str[k] - '0'); |
14f9c5c9 AS |
7030 | k += 1; |
7031 | } | |
7032 | ||
d2e4a39e | 7033 | if (str[k] == 'm') |
14f9c5c9 AS |
7034 | { |
7035 | if (R != NULL) | |
4c4b4cd2 | 7036 | *R = (-(LONGEST) (RU - 1)) - 1; |
14f9c5c9 AS |
7037 | k += 1; |
7038 | } | |
7039 | else if (R != NULL) | |
7040 | *R = (LONGEST) RU; | |
7041 | ||
4c4b4cd2 | 7042 | /* NOTE on the above: Technically, C does not say what the results of |
14f9c5c9 AS |
7043 | - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive |
7044 | number representable as a LONGEST (although either would probably work | |
7045 | in most implementations). When RU>0, the locution in the then branch | |
4c4b4cd2 | 7046 | above is always equivalent to the negative of RU. */ |
14f9c5c9 AS |
7047 | |
7048 | if (new_k != NULL) | |
7049 | *new_k = k; | |
7050 | return 1; | |
7051 | } | |
7052 | ||
4c4b4cd2 PH |
7053 | /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field), |
7054 | and FIELD_NUM is a valid field number within it, returns 1 iff VAL is | |
7055 | in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */ | |
14f9c5c9 | 7056 | |
d2e4a39e | 7057 | int |
ebf56fd3 | 7058 | ada_in_variant (LONGEST val, struct type *type, int field_num) |
14f9c5c9 | 7059 | { |
d2e4a39e | 7060 | const char *name = TYPE_FIELD_NAME (type, field_num); |
14f9c5c9 AS |
7061 | int p; |
7062 | ||
7063 | p = 0; | |
7064 | while (1) | |
7065 | { | |
d2e4a39e | 7066 | switch (name[p]) |
4c4b4cd2 PH |
7067 | { |
7068 | case '\0': | |
7069 | return 0; | |
7070 | case 'S': | |
7071 | { | |
7072 | LONGEST W; | |
5b4ee69b | 7073 | |
4c4b4cd2 PH |
7074 | if (!ada_scan_number (name, p + 1, &W, &p)) |
7075 | return 0; | |
7076 | if (val == W) | |
7077 | return 1; | |
7078 | break; | |
7079 | } | |
7080 | case 'R': | |
7081 | { | |
7082 | LONGEST L, U; | |
5b4ee69b | 7083 | |
4c4b4cd2 PH |
7084 | if (!ada_scan_number (name, p + 1, &L, &p) |
7085 | || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p)) | |
7086 | return 0; | |
7087 | if (val >= L && val <= U) | |
7088 | return 1; | |
7089 | break; | |
7090 | } | |
7091 | case 'O': | |
7092 | return 1; | |
7093 | default: | |
7094 | return 0; | |
7095 | } | |
7096 | } | |
7097 | } | |
7098 | ||
0963b4bd | 7099 | /* FIXME: Lots of redundancy below. Try to consolidate. */ |
4c4b4cd2 PH |
7100 | |
7101 | /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type | |
7102 | ARG_TYPE, extract and return the value of one of its (non-static) | |
7103 | fields. FIELDNO says which field. Differs from value_primitive_field | |
7104 | only in that it can handle packed values of arbitrary type. */ | |
14f9c5c9 | 7105 | |
4c4b4cd2 | 7106 | static struct value * |
d2e4a39e | 7107 | ada_value_primitive_field (struct value *arg1, int offset, int fieldno, |
4c4b4cd2 | 7108 | struct type *arg_type) |
14f9c5c9 | 7109 | { |
14f9c5c9 AS |
7110 | struct type *type; |
7111 | ||
61ee279c | 7112 | arg_type = ada_check_typedef (arg_type); |
14f9c5c9 AS |
7113 | type = TYPE_FIELD_TYPE (arg_type, fieldno); |
7114 | ||
4c4b4cd2 | 7115 | /* Handle packed fields. */ |
14f9c5c9 AS |
7116 | |
7117 | if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0) | |
7118 | { | |
7119 | int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno); | |
7120 | int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno); | |
d2e4a39e | 7121 | |
0fd88904 | 7122 | return ada_value_primitive_packed_val (arg1, value_contents (arg1), |
4c4b4cd2 PH |
7123 | offset + bit_pos / 8, |
7124 | bit_pos % 8, bit_size, type); | |
14f9c5c9 AS |
7125 | } |
7126 | else | |
7127 | return value_primitive_field (arg1, offset, fieldno, arg_type); | |
7128 | } | |
7129 | ||
52ce6436 PH |
7130 | /* Find field with name NAME in object of type TYPE. If found, |
7131 | set the following for each argument that is non-null: | |
7132 | - *FIELD_TYPE_P to the field's type; | |
7133 | - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within | |
7134 | an object of that type; | |
7135 | - *BIT_OFFSET_P to the bit offset modulo byte size of the field; | |
7136 | - *BIT_SIZE_P to its size in bits if the field is packed, and | |
7137 | 0 otherwise; | |
7138 | If INDEX_P is non-null, increment *INDEX_P by the number of source-visible | |
7139 | fields up to but not including the desired field, or by the total | |
7140 | number of fields if not found. A NULL value of NAME never | |
7141 | matches; the function just counts visible fields in this case. | |
7142 | ||
0963b4bd | 7143 | Returns 1 if found, 0 otherwise. */ |
52ce6436 | 7144 | |
4c4b4cd2 | 7145 | static int |
0d5cff50 | 7146 | find_struct_field (const char *name, struct type *type, int offset, |
76a01679 | 7147 | struct type **field_type_p, |
52ce6436 PH |
7148 | int *byte_offset_p, int *bit_offset_p, int *bit_size_p, |
7149 | int *index_p) | |
4c4b4cd2 PH |
7150 | { |
7151 | int i; | |
7152 | ||
61ee279c | 7153 | type = ada_check_typedef (type); |
76a01679 | 7154 | |
52ce6436 PH |
7155 | if (field_type_p != NULL) |
7156 | *field_type_p = NULL; | |
7157 | if (byte_offset_p != NULL) | |
d5d6fca5 | 7158 | *byte_offset_p = 0; |
52ce6436 PH |
7159 | if (bit_offset_p != NULL) |
7160 | *bit_offset_p = 0; | |
7161 | if (bit_size_p != NULL) | |
7162 | *bit_size_p = 0; | |
7163 | ||
7164 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
4c4b4cd2 PH |
7165 | { |
7166 | int bit_pos = TYPE_FIELD_BITPOS (type, i); | |
7167 | int fld_offset = offset + bit_pos / 8; | |
0d5cff50 | 7168 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
76a01679 | 7169 | |
4c4b4cd2 PH |
7170 | if (t_field_name == NULL) |
7171 | continue; | |
7172 | ||
52ce6436 | 7173 | else if (name != NULL && field_name_match (t_field_name, name)) |
76a01679 JB |
7174 | { |
7175 | int bit_size = TYPE_FIELD_BITSIZE (type, i); | |
5b4ee69b | 7176 | |
52ce6436 PH |
7177 | if (field_type_p != NULL) |
7178 | *field_type_p = TYPE_FIELD_TYPE (type, i); | |
7179 | if (byte_offset_p != NULL) | |
7180 | *byte_offset_p = fld_offset; | |
7181 | if (bit_offset_p != NULL) | |
7182 | *bit_offset_p = bit_pos % 8; | |
7183 | if (bit_size_p != NULL) | |
7184 | *bit_size_p = bit_size; | |
76a01679 JB |
7185 | return 1; |
7186 | } | |
4c4b4cd2 PH |
7187 | else if (ada_is_wrapper_field (type, i)) |
7188 | { | |
52ce6436 PH |
7189 | if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset, |
7190 | field_type_p, byte_offset_p, bit_offset_p, | |
7191 | bit_size_p, index_p)) | |
76a01679 JB |
7192 | return 1; |
7193 | } | |
4c4b4cd2 PH |
7194 | else if (ada_is_variant_part (type, i)) |
7195 | { | |
52ce6436 PH |
7196 | /* PNH: Wait. Do we ever execute this section, or is ARG always of |
7197 | fixed type?? */ | |
4c4b4cd2 | 7198 | int j; |
52ce6436 PH |
7199 | struct type *field_type |
7200 | = ada_check_typedef (TYPE_FIELD_TYPE (type, i)); | |
4c4b4cd2 | 7201 | |
52ce6436 | 7202 | for (j = 0; j < TYPE_NFIELDS (field_type); j += 1) |
4c4b4cd2 | 7203 | { |
76a01679 JB |
7204 | if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j), |
7205 | fld_offset | |
7206 | + TYPE_FIELD_BITPOS (field_type, j) / 8, | |
7207 | field_type_p, byte_offset_p, | |
52ce6436 | 7208 | bit_offset_p, bit_size_p, index_p)) |
76a01679 | 7209 | return 1; |
4c4b4cd2 PH |
7210 | } |
7211 | } | |
52ce6436 PH |
7212 | else if (index_p != NULL) |
7213 | *index_p += 1; | |
4c4b4cd2 PH |
7214 | } |
7215 | return 0; | |
7216 | } | |
7217 | ||
0963b4bd | 7218 | /* Number of user-visible fields in record type TYPE. */ |
4c4b4cd2 | 7219 | |
52ce6436 PH |
7220 | static int |
7221 | num_visible_fields (struct type *type) | |
7222 | { | |
7223 | int n; | |
5b4ee69b | 7224 | |
52ce6436 PH |
7225 | n = 0; |
7226 | find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n); | |
7227 | return n; | |
7228 | } | |
14f9c5c9 | 7229 | |
4c4b4cd2 | 7230 | /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes, |
14f9c5c9 AS |
7231 | and search in it assuming it has (class) type TYPE. |
7232 | If found, return value, else return NULL. | |
7233 | ||
4c4b4cd2 | 7234 | Searches recursively through wrapper fields (e.g., '_parent'). */ |
14f9c5c9 | 7235 | |
4c4b4cd2 | 7236 | static struct value * |
108d56a4 | 7237 | ada_search_struct_field (const char *name, struct value *arg, int offset, |
4c4b4cd2 | 7238 | struct type *type) |
14f9c5c9 AS |
7239 | { |
7240 | int i; | |
14f9c5c9 | 7241 | |
5b4ee69b | 7242 | type = ada_check_typedef (type); |
52ce6436 | 7243 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) |
14f9c5c9 | 7244 | { |
0d5cff50 | 7245 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
14f9c5c9 AS |
7246 | |
7247 | if (t_field_name == NULL) | |
4c4b4cd2 | 7248 | continue; |
14f9c5c9 AS |
7249 | |
7250 | else if (field_name_match (t_field_name, name)) | |
4c4b4cd2 | 7251 | return ada_value_primitive_field (arg, offset, i, type); |
14f9c5c9 AS |
7252 | |
7253 | else if (ada_is_wrapper_field (type, i)) | |
4c4b4cd2 | 7254 | { |
0963b4bd | 7255 | struct value *v = /* Do not let indent join lines here. */ |
06d5cf63 JB |
7256 | ada_search_struct_field (name, arg, |
7257 | offset + TYPE_FIELD_BITPOS (type, i) / 8, | |
7258 | TYPE_FIELD_TYPE (type, i)); | |
5b4ee69b | 7259 | |
4c4b4cd2 PH |
7260 | if (v != NULL) |
7261 | return v; | |
7262 | } | |
14f9c5c9 AS |
7263 | |
7264 | else if (ada_is_variant_part (type, i)) | |
4c4b4cd2 | 7265 | { |
0963b4bd | 7266 | /* PNH: Do we ever get here? See find_struct_field. */ |
4c4b4cd2 | 7267 | int j; |
5b4ee69b MS |
7268 | struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, |
7269 | i)); | |
4c4b4cd2 PH |
7270 | int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8; |
7271 | ||
52ce6436 | 7272 | for (j = 0; j < TYPE_NFIELDS (field_type); j += 1) |
4c4b4cd2 | 7273 | { |
0963b4bd MS |
7274 | struct value *v = ada_search_struct_field /* Force line |
7275 | break. */ | |
06d5cf63 JB |
7276 | (name, arg, |
7277 | var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8, | |
7278 | TYPE_FIELD_TYPE (field_type, j)); | |
5b4ee69b | 7279 | |
4c4b4cd2 PH |
7280 | if (v != NULL) |
7281 | return v; | |
7282 | } | |
7283 | } | |
14f9c5c9 AS |
7284 | } |
7285 | return NULL; | |
7286 | } | |
d2e4a39e | 7287 | |
52ce6436 PH |
7288 | static struct value *ada_index_struct_field_1 (int *, struct value *, |
7289 | int, struct type *); | |
7290 | ||
7291 | ||
7292 | /* Return field #INDEX in ARG, where the index is that returned by | |
7293 | * find_struct_field through its INDEX_P argument. Adjust the address | |
7294 | * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE. | |
0963b4bd | 7295 | * If found, return value, else return NULL. */ |
52ce6436 PH |
7296 | |
7297 | static struct value * | |
7298 | ada_index_struct_field (int index, struct value *arg, int offset, | |
7299 | struct type *type) | |
7300 | { | |
7301 | return ada_index_struct_field_1 (&index, arg, offset, type); | |
7302 | } | |
7303 | ||
7304 | ||
7305 | /* Auxiliary function for ada_index_struct_field. Like | |
7306 | * ada_index_struct_field, but takes index from *INDEX_P and modifies | |
0963b4bd | 7307 | * *INDEX_P. */ |
52ce6436 PH |
7308 | |
7309 | static struct value * | |
7310 | ada_index_struct_field_1 (int *index_p, struct value *arg, int offset, | |
7311 | struct type *type) | |
7312 | { | |
7313 | int i; | |
7314 | type = ada_check_typedef (type); | |
7315 | ||
7316 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
7317 | { | |
7318 | if (TYPE_FIELD_NAME (type, i) == NULL) | |
7319 | continue; | |
7320 | else if (ada_is_wrapper_field (type, i)) | |
7321 | { | |
0963b4bd | 7322 | struct value *v = /* Do not let indent join lines here. */ |
52ce6436 PH |
7323 | ada_index_struct_field_1 (index_p, arg, |
7324 | offset + TYPE_FIELD_BITPOS (type, i) / 8, | |
7325 | TYPE_FIELD_TYPE (type, i)); | |
5b4ee69b | 7326 | |
52ce6436 PH |
7327 | if (v != NULL) |
7328 | return v; | |
7329 | } | |
7330 | ||
7331 | else if (ada_is_variant_part (type, i)) | |
7332 | { | |
7333 | /* PNH: Do we ever get here? See ada_search_struct_field, | |
0963b4bd | 7334 | find_struct_field. */ |
52ce6436 PH |
7335 | error (_("Cannot assign this kind of variant record")); |
7336 | } | |
7337 | else if (*index_p == 0) | |
7338 | return ada_value_primitive_field (arg, offset, i, type); | |
7339 | else | |
7340 | *index_p -= 1; | |
7341 | } | |
7342 | return NULL; | |
7343 | } | |
7344 | ||
4c4b4cd2 PH |
7345 | /* Given ARG, a value of type (pointer or reference to a)* |
7346 | structure/union, extract the component named NAME from the ultimate | |
7347 | target structure/union and return it as a value with its | |
f5938064 | 7348 | appropriate type. |
14f9c5c9 | 7349 | |
4c4b4cd2 PH |
7350 | The routine searches for NAME among all members of the structure itself |
7351 | and (recursively) among all members of any wrapper members | |
14f9c5c9 AS |
7352 | (e.g., '_parent'). |
7353 | ||
03ee6b2e PH |
7354 | If NO_ERR, then simply return NULL in case of error, rather than |
7355 | calling error. */ | |
14f9c5c9 | 7356 | |
d2e4a39e | 7357 | struct value * |
03ee6b2e | 7358 | ada_value_struct_elt (struct value *arg, char *name, int no_err) |
14f9c5c9 | 7359 | { |
4c4b4cd2 | 7360 | struct type *t, *t1; |
d2e4a39e | 7361 | struct value *v; |
14f9c5c9 | 7362 | |
4c4b4cd2 | 7363 | v = NULL; |
df407dfe | 7364 | t1 = t = ada_check_typedef (value_type (arg)); |
4c4b4cd2 PH |
7365 | if (TYPE_CODE (t) == TYPE_CODE_REF) |
7366 | { | |
7367 | t1 = TYPE_TARGET_TYPE (t); | |
7368 | if (t1 == NULL) | |
03ee6b2e | 7369 | goto BadValue; |
61ee279c | 7370 | t1 = ada_check_typedef (t1); |
4c4b4cd2 | 7371 | if (TYPE_CODE (t1) == TYPE_CODE_PTR) |
76a01679 | 7372 | { |
994b9211 | 7373 | arg = coerce_ref (arg); |
76a01679 JB |
7374 | t = t1; |
7375 | } | |
4c4b4cd2 | 7376 | } |
14f9c5c9 | 7377 | |
4c4b4cd2 PH |
7378 | while (TYPE_CODE (t) == TYPE_CODE_PTR) |
7379 | { | |
7380 | t1 = TYPE_TARGET_TYPE (t); | |
7381 | if (t1 == NULL) | |
03ee6b2e | 7382 | goto BadValue; |
61ee279c | 7383 | t1 = ada_check_typedef (t1); |
4c4b4cd2 | 7384 | if (TYPE_CODE (t1) == TYPE_CODE_PTR) |
76a01679 JB |
7385 | { |
7386 | arg = value_ind (arg); | |
7387 | t = t1; | |
7388 | } | |
4c4b4cd2 | 7389 | else |
76a01679 | 7390 | break; |
4c4b4cd2 | 7391 | } |
14f9c5c9 | 7392 | |
4c4b4cd2 | 7393 | if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION) |
03ee6b2e | 7394 | goto BadValue; |
14f9c5c9 | 7395 | |
4c4b4cd2 PH |
7396 | if (t1 == t) |
7397 | v = ada_search_struct_field (name, arg, 0, t); | |
7398 | else | |
7399 | { | |
7400 | int bit_offset, bit_size, byte_offset; | |
7401 | struct type *field_type; | |
7402 | CORE_ADDR address; | |
7403 | ||
76a01679 | 7404 | if (TYPE_CODE (t) == TYPE_CODE_PTR) |
b50d69b5 | 7405 | address = value_address (ada_value_ind (arg)); |
4c4b4cd2 | 7406 | else |
b50d69b5 | 7407 | address = value_address (ada_coerce_ref (arg)); |
14f9c5c9 | 7408 | |
1ed6ede0 | 7409 | t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1); |
76a01679 JB |
7410 | if (find_struct_field (name, t1, 0, |
7411 | &field_type, &byte_offset, &bit_offset, | |
52ce6436 | 7412 | &bit_size, NULL)) |
76a01679 JB |
7413 | { |
7414 | if (bit_size != 0) | |
7415 | { | |
714e53ab PH |
7416 | if (TYPE_CODE (t) == TYPE_CODE_REF) |
7417 | arg = ada_coerce_ref (arg); | |
7418 | else | |
7419 | arg = ada_value_ind (arg); | |
76a01679 JB |
7420 | v = ada_value_primitive_packed_val (arg, NULL, byte_offset, |
7421 | bit_offset, bit_size, | |
7422 | field_type); | |
7423 | } | |
7424 | else | |
f5938064 | 7425 | v = value_at_lazy (field_type, address + byte_offset); |
76a01679 JB |
7426 | } |
7427 | } | |
7428 | ||
03ee6b2e PH |
7429 | if (v != NULL || no_err) |
7430 | return v; | |
7431 | else | |
323e0a4a | 7432 | error (_("There is no member named %s."), name); |
14f9c5c9 | 7433 | |
03ee6b2e PH |
7434 | BadValue: |
7435 | if (no_err) | |
7436 | return NULL; | |
7437 | else | |
0963b4bd MS |
7438 | error (_("Attempt to extract a component of " |
7439 | "a value that is not a record.")); | |
14f9c5c9 AS |
7440 | } |
7441 | ||
7442 | /* Given a type TYPE, look up the type of the component of type named NAME. | |
4c4b4cd2 PH |
7443 | If DISPP is non-null, add its byte displacement from the beginning of a |
7444 | structure (pointed to by a value) of type TYPE to *DISPP (does not | |
14f9c5c9 AS |
7445 | work for packed fields). |
7446 | ||
7447 | Matches any field whose name has NAME as a prefix, possibly | |
4c4b4cd2 | 7448 | followed by "___". |
14f9c5c9 | 7449 | |
0963b4bd | 7450 | TYPE can be either a struct or union. If REFOK, TYPE may also |
4c4b4cd2 PH |
7451 | be a (pointer or reference)+ to a struct or union, and the |
7452 | ultimate target type will be searched. | |
14f9c5c9 AS |
7453 | |
7454 | Looks recursively into variant clauses and parent types. | |
7455 | ||
4c4b4cd2 PH |
7456 | If NOERR is nonzero, return NULL if NAME is not suitably defined or |
7457 | TYPE is not a type of the right kind. */ | |
14f9c5c9 | 7458 | |
4c4b4cd2 | 7459 | static struct type * |
76a01679 JB |
7460 | ada_lookup_struct_elt_type (struct type *type, char *name, int refok, |
7461 | int noerr, int *dispp) | |
14f9c5c9 AS |
7462 | { |
7463 | int i; | |
7464 | ||
7465 | if (name == NULL) | |
7466 | goto BadName; | |
7467 | ||
76a01679 | 7468 | if (refok && type != NULL) |
4c4b4cd2 PH |
7469 | while (1) |
7470 | { | |
61ee279c | 7471 | type = ada_check_typedef (type); |
76a01679 JB |
7472 | if (TYPE_CODE (type) != TYPE_CODE_PTR |
7473 | && TYPE_CODE (type) != TYPE_CODE_REF) | |
7474 | break; | |
7475 | type = TYPE_TARGET_TYPE (type); | |
4c4b4cd2 | 7476 | } |
14f9c5c9 | 7477 | |
76a01679 | 7478 | if (type == NULL |
1265e4aa JB |
7479 | || (TYPE_CODE (type) != TYPE_CODE_STRUCT |
7480 | && TYPE_CODE (type) != TYPE_CODE_UNION)) | |
14f9c5c9 | 7481 | { |
4c4b4cd2 | 7482 | if (noerr) |
76a01679 | 7483 | return NULL; |
4c4b4cd2 | 7484 | else |
76a01679 JB |
7485 | { |
7486 | target_terminal_ours (); | |
7487 | gdb_flush (gdb_stdout); | |
323e0a4a AC |
7488 | if (type == NULL) |
7489 | error (_("Type (null) is not a structure or union type")); | |
7490 | else | |
7491 | { | |
7492 | /* XXX: type_sprint */ | |
7493 | fprintf_unfiltered (gdb_stderr, _("Type ")); | |
7494 | type_print (type, "", gdb_stderr, -1); | |
7495 | error (_(" is not a structure or union type")); | |
7496 | } | |
76a01679 | 7497 | } |
14f9c5c9 AS |
7498 | } |
7499 | ||
7500 | type = to_static_fixed_type (type); | |
7501 | ||
7502 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
7503 | { | |
0d5cff50 | 7504 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
14f9c5c9 AS |
7505 | struct type *t; |
7506 | int disp; | |
d2e4a39e | 7507 | |
14f9c5c9 | 7508 | if (t_field_name == NULL) |
4c4b4cd2 | 7509 | continue; |
14f9c5c9 AS |
7510 | |
7511 | else if (field_name_match (t_field_name, name)) | |
4c4b4cd2 PH |
7512 | { |
7513 | if (dispp != NULL) | |
7514 | *dispp += TYPE_FIELD_BITPOS (type, i) / 8; | |
460efde1 | 7515 | return TYPE_FIELD_TYPE (type, i); |
4c4b4cd2 | 7516 | } |
14f9c5c9 AS |
7517 | |
7518 | else if (ada_is_wrapper_field (type, i)) | |
4c4b4cd2 PH |
7519 | { |
7520 | disp = 0; | |
7521 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name, | |
7522 | 0, 1, &disp); | |
7523 | if (t != NULL) | |
7524 | { | |
7525 | if (dispp != NULL) | |
7526 | *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8; | |
7527 | return t; | |
7528 | } | |
7529 | } | |
14f9c5c9 AS |
7530 | |
7531 | else if (ada_is_variant_part (type, i)) | |
4c4b4cd2 PH |
7532 | { |
7533 | int j; | |
5b4ee69b MS |
7534 | struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, |
7535 | i)); | |
4c4b4cd2 PH |
7536 | |
7537 | for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1) | |
7538 | { | |
b1f33ddd JB |
7539 | /* FIXME pnh 2008/01/26: We check for a field that is |
7540 | NOT wrapped in a struct, since the compiler sometimes | |
7541 | generates these for unchecked variant types. Revisit | |
0963b4bd | 7542 | if the compiler changes this practice. */ |
0d5cff50 | 7543 | const char *v_field_name = TYPE_FIELD_NAME (field_type, j); |
4c4b4cd2 | 7544 | disp = 0; |
b1f33ddd JB |
7545 | if (v_field_name != NULL |
7546 | && field_name_match (v_field_name, name)) | |
460efde1 | 7547 | t = TYPE_FIELD_TYPE (field_type, j); |
b1f33ddd | 7548 | else |
0963b4bd MS |
7549 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, |
7550 | j), | |
b1f33ddd JB |
7551 | name, 0, 1, &disp); |
7552 | ||
4c4b4cd2 PH |
7553 | if (t != NULL) |
7554 | { | |
7555 | if (dispp != NULL) | |
7556 | *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8; | |
7557 | return t; | |
7558 | } | |
7559 | } | |
7560 | } | |
14f9c5c9 AS |
7561 | |
7562 | } | |
7563 | ||
7564 | BadName: | |
d2e4a39e | 7565 | if (!noerr) |
14f9c5c9 AS |
7566 | { |
7567 | target_terminal_ours (); | |
7568 | gdb_flush (gdb_stdout); | |
323e0a4a AC |
7569 | if (name == NULL) |
7570 | { | |
7571 | /* XXX: type_sprint */ | |
7572 | fprintf_unfiltered (gdb_stderr, _("Type ")); | |
7573 | type_print (type, "", gdb_stderr, -1); | |
7574 | error (_(" has no component named <null>")); | |
7575 | } | |
7576 | else | |
7577 | { | |
7578 | /* XXX: type_sprint */ | |
7579 | fprintf_unfiltered (gdb_stderr, _("Type ")); | |
7580 | type_print (type, "", gdb_stderr, -1); | |
7581 | error (_(" has no component named %s"), name); | |
7582 | } | |
14f9c5c9 AS |
7583 | } |
7584 | ||
7585 | return NULL; | |
7586 | } | |
7587 | ||
b1f33ddd JB |
7588 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), |
7589 | within a value of type OUTER_TYPE, return true iff VAR_TYPE | |
7590 | represents an unchecked union (that is, the variant part of a | |
0963b4bd | 7591 | record that is named in an Unchecked_Union pragma). */ |
b1f33ddd JB |
7592 | |
7593 | static int | |
7594 | is_unchecked_variant (struct type *var_type, struct type *outer_type) | |
7595 | { | |
7596 | char *discrim_name = ada_variant_discrim_name (var_type); | |
5b4ee69b | 7597 | |
b1f33ddd JB |
7598 | return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL) |
7599 | == NULL); | |
7600 | } | |
7601 | ||
7602 | ||
14f9c5c9 AS |
7603 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), |
7604 | within a value of type OUTER_TYPE that is stored in GDB at | |
4c4b4cd2 PH |
7605 | OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE, |
7606 | numbering from 0) is applicable. Returns -1 if none are. */ | |
14f9c5c9 | 7607 | |
d2e4a39e | 7608 | int |
ebf56fd3 | 7609 | ada_which_variant_applies (struct type *var_type, struct type *outer_type, |
fc1a4b47 | 7610 | const gdb_byte *outer_valaddr) |
14f9c5c9 AS |
7611 | { |
7612 | int others_clause; | |
7613 | int i; | |
d2e4a39e | 7614 | char *discrim_name = ada_variant_discrim_name (var_type); |
0c281816 JB |
7615 | struct value *outer; |
7616 | struct value *discrim; | |
14f9c5c9 AS |
7617 | LONGEST discrim_val; |
7618 | ||
012370f6 TT |
7619 | /* Using plain value_from_contents_and_address here causes problems |
7620 | because we will end up trying to resolve a type that is currently | |
7621 | being constructed. */ | |
7622 | outer = value_from_contents_and_address_unresolved (outer_type, | |
7623 | outer_valaddr, 0); | |
0c281816 JB |
7624 | discrim = ada_value_struct_elt (outer, discrim_name, 1); |
7625 | if (discrim == NULL) | |
14f9c5c9 | 7626 | return -1; |
0c281816 | 7627 | discrim_val = value_as_long (discrim); |
14f9c5c9 AS |
7628 | |
7629 | others_clause = -1; | |
7630 | for (i = 0; i < TYPE_NFIELDS (var_type); i += 1) | |
7631 | { | |
7632 | if (ada_is_others_clause (var_type, i)) | |
4c4b4cd2 | 7633 | others_clause = i; |
14f9c5c9 | 7634 | else if (ada_in_variant (discrim_val, var_type, i)) |
4c4b4cd2 | 7635 | return i; |
14f9c5c9 AS |
7636 | } |
7637 | ||
7638 | return others_clause; | |
7639 | } | |
d2e4a39e | 7640 | \f |
14f9c5c9 AS |
7641 | |
7642 | ||
4c4b4cd2 | 7643 | /* Dynamic-Sized Records */ |
14f9c5c9 AS |
7644 | |
7645 | /* Strategy: The type ostensibly attached to a value with dynamic size | |
7646 | (i.e., a size that is not statically recorded in the debugging | |
7647 | data) does not accurately reflect the size or layout of the value. | |
7648 | Our strategy is to convert these values to values with accurate, | |
4c4b4cd2 | 7649 | conventional types that are constructed on the fly. */ |
14f9c5c9 AS |
7650 | |
7651 | /* There is a subtle and tricky problem here. In general, we cannot | |
7652 | determine the size of dynamic records without its data. However, | |
7653 | the 'struct value' data structure, which GDB uses to represent | |
7654 | quantities in the inferior process (the target), requires the size | |
7655 | of the type at the time of its allocation in order to reserve space | |
7656 | for GDB's internal copy of the data. That's why the | |
7657 | 'to_fixed_xxx_type' routines take (target) addresses as parameters, | |
4c4b4cd2 | 7658 | rather than struct value*s. |
14f9c5c9 AS |
7659 | |
7660 | However, GDB's internal history variables ($1, $2, etc.) are | |
7661 | struct value*s containing internal copies of the data that are not, in | |
7662 | general, the same as the data at their corresponding addresses in | |
7663 | the target. Fortunately, the types we give to these values are all | |
7664 | conventional, fixed-size types (as per the strategy described | |
7665 | above), so that we don't usually have to perform the | |
7666 | 'to_fixed_xxx_type' conversions to look at their values. | |
7667 | Unfortunately, there is one exception: if one of the internal | |
7668 | history variables is an array whose elements are unconstrained | |
7669 | records, then we will need to create distinct fixed types for each | |
7670 | element selected. */ | |
7671 | ||
7672 | /* The upshot of all of this is that many routines take a (type, host | |
7673 | address, target address) triple as arguments to represent a value. | |
7674 | The host address, if non-null, is supposed to contain an internal | |
7675 | copy of the relevant data; otherwise, the program is to consult the | |
4c4b4cd2 | 7676 | target at the target address. */ |
14f9c5c9 AS |
7677 | |
7678 | /* Assuming that VAL0 represents a pointer value, the result of | |
7679 | dereferencing it. Differs from value_ind in its treatment of | |
4c4b4cd2 | 7680 | dynamic-sized types. */ |
14f9c5c9 | 7681 | |
d2e4a39e AS |
7682 | struct value * |
7683 | ada_value_ind (struct value *val0) | |
14f9c5c9 | 7684 | { |
c48db5ca | 7685 | struct value *val = value_ind (val0); |
5b4ee69b | 7686 | |
b50d69b5 JG |
7687 | if (ada_is_tagged_type (value_type (val), 0)) |
7688 | val = ada_tag_value_at_base_address (val); | |
7689 | ||
4c4b4cd2 | 7690 | return ada_to_fixed_value (val); |
14f9c5c9 AS |
7691 | } |
7692 | ||
7693 | /* The value resulting from dereferencing any "reference to" | |
4c4b4cd2 PH |
7694 | qualifiers on VAL0. */ |
7695 | ||
d2e4a39e AS |
7696 | static struct value * |
7697 | ada_coerce_ref (struct value *val0) | |
7698 | { | |
df407dfe | 7699 | if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF) |
d2e4a39e AS |
7700 | { |
7701 | struct value *val = val0; | |
5b4ee69b | 7702 | |
994b9211 | 7703 | val = coerce_ref (val); |
b50d69b5 JG |
7704 | |
7705 | if (ada_is_tagged_type (value_type (val), 0)) | |
7706 | val = ada_tag_value_at_base_address (val); | |
7707 | ||
4c4b4cd2 | 7708 | return ada_to_fixed_value (val); |
d2e4a39e AS |
7709 | } |
7710 | else | |
14f9c5c9 AS |
7711 | return val0; |
7712 | } | |
7713 | ||
7714 | /* Return OFF rounded upward if necessary to a multiple of | |
4c4b4cd2 | 7715 | ALIGNMENT (a power of 2). */ |
14f9c5c9 AS |
7716 | |
7717 | static unsigned int | |
ebf56fd3 | 7718 | align_value (unsigned int off, unsigned int alignment) |
14f9c5c9 AS |
7719 | { |
7720 | return (off + alignment - 1) & ~(alignment - 1); | |
7721 | } | |
7722 | ||
4c4b4cd2 | 7723 | /* Return the bit alignment required for field #F of template type TYPE. */ |
14f9c5c9 AS |
7724 | |
7725 | static unsigned int | |
ebf56fd3 | 7726 | field_alignment (struct type *type, int f) |
14f9c5c9 | 7727 | { |
d2e4a39e | 7728 | const char *name = TYPE_FIELD_NAME (type, f); |
64a1bf19 | 7729 | int len; |
14f9c5c9 AS |
7730 | int align_offset; |
7731 | ||
64a1bf19 JB |
7732 | /* The field name should never be null, unless the debugging information |
7733 | is somehow malformed. In this case, we assume the field does not | |
7734 | require any alignment. */ | |
7735 | if (name == NULL) | |
7736 | return 1; | |
7737 | ||
7738 | len = strlen (name); | |
7739 | ||
4c4b4cd2 PH |
7740 | if (!isdigit (name[len - 1])) |
7741 | return 1; | |
14f9c5c9 | 7742 | |
d2e4a39e | 7743 | if (isdigit (name[len - 2])) |
14f9c5c9 AS |
7744 | align_offset = len - 2; |
7745 | else | |
7746 | align_offset = len - 1; | |
7747 | ||
61012eef | 7748 | if (align_offset < 7 || !startswith (name + align_offset - 6, "___XV")) |
14f9c5c9 AS |
7749 | return TARGET_CHAR_BIT; |
7750 | ||
4c4b4cd2 PH |
7751 | return atoi (name + align_offset) * TARGET_CHAR_BIT; |
7752 | } | |
7753 | ||
852dff6c | 7754 | /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */ |
4c4b4cd2 | 7755 | |
852dff6c JB |
7756 | static struct symbol * |
7757 | ada_find_any_type_symbol (const char *name) | |
4c4b4cd2 PH |
7758 | { |
7759 | struct symbol *sym; | |
7760 | ||
7761 | sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN); | |
4186eb54 | 7762 | if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF) |
4c4b4cd2 PH |
7763 | return sym; |
7764 | ||
4186eb54 KS |
7765 | sym = standard_lookup (name, NULL, STRUCT_DOMAIN); |
7766 | return sym; | |
14f9c5c9 AS |
7767 | } |
7768 | ||
dddfab26 UW |
7769 | /* Find a type named NAME. Ignores ambiguity. This routine will look |
7770 | solely for types defined by debug info, it will not search the GDB | |
7771 | primitive types. */ | |
4c4b4cd2 | 7772 | |
852dff6c | 7773 | static struct type * |
ebf56fd3 | 7774 | ada_find_any_type (const char *name) |
14f9c5c9 | 7775 | { |
852dff6c | 7776 | struct symbol *sym = ada_find_any_type_symbol (name); |
14f9c5c9 | 7777 | |
14f9c5c9 | 7778 | if (sym != NULL) |
dddfab26 | 7779 | return SYMBOL_TYPE (sym); |
14f9c5c9 | 7780 | |
dddfab26 | 7781 | return NULL; |
14f9c5c9 AS |
7782 | } |
7783 | ||
739593e0 JB |
7784 | /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol |
7785 | associated with NAME_SYM's name. NAME_SYM may itself be a renaming | |
7786 | symbol, in which case it is returned. Otherwise, this looks for | |
7787 | symbols whose name is that of NAME_SYM suffixed with "___XR". | |
7788 | Return symbol if found, and NULL otherwise. */ | |
4c4b4cd2 PH |
7789 | |
7790 | struct symbol * | |
270140bd | 7791 | ada_find_renaming_symbol (struct symbol *name_sym, const struct block *block) |
aeb5907d | 7792 | { |
739593e0 | 7793 | const char *name = SYMBOL_LINKAGE_NAME (name_sym); |
aeb5907d JB |
7794 | struct symbol *sym; |
7795 | ||
739593e0 JB |
7796 | if (strstr (name, "___XR") != NULL) |
7797 | return name_sym; | |
7798 | ||
aeb5907d JB |
7799 | sym = find_old_style_renaming_symbol (name, block); |
7800 | ||
7801 | if (sym != NULL) | |
7802 | return sym; | |
7803 | ||
0963b4bd | 7804 | /* Not right yet. FIXME pnh 7/20/2007. */ |
852dff6c | 7805 | sym = ada_find_any_type_symbol (name); |
aeb5907d JB |
7806 | if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL) |
7807 | return sym; | |
7808 | else | |
7809 | return NULL; | |
7810 | } | |
7811 | ||
7812 | static struct symbol * | |
270140bd | 7813 | find_old_style_renaming_symbol (const char *name, const struct block *block) |
4c4b4cd2 | 7814 | { |
7f0df278 | 7815 | const struct symbol *function_sym = block_linkage_function (block); |
4c4b4cd2 PH |
7816 | char *rename; |
7817 | ||
7818 | if (function_sym != NULL) | |
7819 | { | |
7820 | /* If the symbol is defined inside a function, NAME is not fully | |
7821 | qualified. This means we need to prepend the function name | |
7822 | as well as adding the ``___XR'' suffix to build the name of | |
7823 | the associated renaming symbol. */ | |
0d5cff50 | 7824 | const char *function_name = SYMBOL_LINKAGE_NAME (function_sym); |
529cad9c PH |
7825 | /* Function names sometimes contain suffixes used |
7826 | for instance to qualify nested subprograms. When building | |
7827 | the XR type name, we need to make sure that this suffix is | |
7828 | not included. So do not include any suffix in the function | |
7829 | name length below. */ | |
69fadcdf | 7830 | int function_name_len = ada_name_prefix_len (function_name); |
76a01679 JB |
7831 | const int rename_len = function_name_len + 2 /* "__" */ |
7832 | + strlen (name) + 6 /* "___XR\0" */ ; | |
4c4b4cd2 | 7833 | |
529cad9c | 7834 | /* Strip the suffix if necessary. */ |
69fadcdf JB |
7835 | ada_remove_trailing_digits (function_name, &function_name_len); |
7836 | ada_remove_po_subprogram_suffix (function_name, &function_name_len); | |
7837 | ada_remove_Xbn_suffix (function_name, &function_name_len); | |
529cad9c | 7838 | |
4c4b4cd2 PH |
7839 | /* Library-level functions are a special case, as GNAT adds |
7840 | a ``_ada_'' prefix to the function name to avoid namespace | |
aeb5907d | 7841 | pollution. However, the renaming symbols themselves do not |
4c4b4cd2 PH |
7842 | have this prefix, so we need to skip this prefix if present. */ |
7843 | if (function_name_len > 5 /* "_ada_" */ | |
7844 | && strstr (function_name, "_ada_") == function_name) | |
69fadcdf JB |
7845 | { |
7846 | function_name += 5; | |
7847 | function_name_len -= 5; | |
7848 | } | |
4c4b4cd2 PH |
7849 | |
7850 | rename = (char *) alloca (rename_len * sizeof (char)); | |
69fadcdf JB |
7851 | strncpy (rename, function_name, function_name_len); |
7852 | xsnprintf (rename + function_name_len, rename_len - function_name_len, | |
7853 | "__%s___XR", name); | |
4c4b4cd2 PH |
7854 | } |
7855 | else | |
7856 | { | |
7857 | const int rename_len = strlen (name) + 6; | |
5b4ee69b | 7858 | |
4c4b4cd2 | 7859 | rename = (char *) alloca (rename_len * sizeof (char)); |
88c15c34 | 7860 | xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name); |
4c4b4cd2 PH |
7861 | } |
7862 | ||
852dff6c | 7863 | return ada_find_any_type_symbol (rename); |
4c4b4cd2 PH |
7864 | } |
7865 | ||
14f9c5c9 | 7866 | /* Because of GNAT encoding conventions, several GDB symbols may match a |
4c4b4cd2 | 7867 | given type name. If the type denoted by TYPE0 is to be preferred to |
14f9c5c9 | 7868 | that of TYPE1 for purposes of type printing, return non-zero; |
4c4b4cd2 PH |
7869 | otherwise return 0. */ |
7870 | ||
14f9c5c9 | 7871 | int |
d2e4a39e | 7872 | ada_prefer_type (struct type *type0, struct type *type1) |
14f9c5c9 AS |
7873 | { |
7874 | if (type1 == NULL) | |
7875 | return 1; | |
7876 | else if (type0 == NULL) | |
7877 | return 0; | |
7878 | else if (TYPE_CODE (type1) == TYPE_CODE_VOID) | |
7879 | return 1; | |
7880 | else if (TYPE_CODE (type0) == TYPE_CODE_VOID) | |
7881 | return 0; | |
4c4b4cd2 PH |
7882 | else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL) |
7883 | return 1; | |
ad82864c | 7884 | else if (ada_is_constrained_packed_array_type (type0)) |
14f9c5c9 | 7885 | return 1; |
4c4b4cd2 PH |
7886 | else if (ada_is_array_descriptor_type (type0) |
7887 | && !ada_is_array_descriptor_type (type1)) | |
14f9c5c9 | 7888 | return 1; |
aeb5907d JB |
7889 | else |
7890 | { | |
7891 | const char *type0_name = type_name_no_tag (type0); | |
7892 | const char *type1_name = type_name_no_tag (type1); | |
7893 | ||
7894 | if (type0_name != NULL && strstr (type0_name, "___XR") != NULL | |
7895 | && (type1_name == NULL || strstr (type1_name, "___XR") == NULL)) | |
7896 | return 1; | |
7897 | } | |
14f9c5c9 AS |
7898 | return 0; |
7899 | } | |
7900 | ||
7901 | /* The name of TYPE, which is either its TYPE_NAME, or, if that is | |
4c4b4cd2 PH |
7902 | null, its TYPE_TAG_NAME. Null if TYPE is null. */ |
7903 | ||
0d5cff50 | 7904 | const char * |
d2e4a39e | 7905 | ada_type_name (struct type *type) |
14f9c5c9 | 7906 | { |
d2e4a39e | 7907 | if (type == NULL) |
14f9c5c9 AS |
7908 | return NULL; |
7909 | else if (TYPE_NAME (type) != NULL) | |
7910 | return TYPE_NAME (type); | |
7911 | else | |
7912 | return TYPE_TAG_NAME (type); | |
7913 | } | |
7914 | ||
b4ba55a1 JB |
7915 | /* Search the list of "descriptive" types associated to TYPE for a type |
7916 | whose name is NAME. */ | |
7917 | ||
7918 | static struct type * | |
7919 | find_parallel_type_by_descriptive_type (struct type *type, const char *name) | |
7920 | { | |
931e5bc3 | 7921 | struct type *result, *tmp; |
b4ba55a1 | 7922 | |
c6044dd1 JB |
7923 | if (ada_ignore_descriptive_types_p) |
7924 | return NULL; | |
7925 | ||
b4ba55a1 JB |
7926 | /* If there no descriptive-type info, then there is no parallel type |
7927 | to be found. */ | |
7928 | if (!HAVE_GNAT_AUX_INFO (type)) | |
7929 | return NULL; | |
7930 | ||
7931 | result = TYPE_DESCRIPTIVE_TYPE (type); | |
7932 | while (result != NULL) | |
7933 | { | |
0d5cff50 | 7934 | const char *result_name = ada_type_name (result); |
b4ba55a1 JB |
7935 | |
7936 | if (result_name == NULL) | |
7937 | { | |
7938 | warning (_("unexpected null name on descriptive type")); | |
7939 | return NULL; | |
7940 | } | |
7941 | ||
7942 | /* If the names match, stop. */ | |
7943 | if (strcmp (result_name, name) == 0) | |
7944 | break; | |
7945 | ||
7946 | /* Otherwise, look at the next item on the list, if any. */ | |
7947 | if (HAVE_GNAT_AUX_INFO (result)) | |
931e5bc3 JG |
7948 | tmp = TYPE_DESCRIPTIVE_TYPE (result); |
7949 | else | |
7950 | tmp = NULL; | |
7951 | ||
7952 | /* If not found either, try after having resolved the typedef. */ | |
7953 | if (tmp != NULL) | |
7954 | result = tmp; | |
b4ba55a1 | 7955 | else |
931e5bc3 | 7956 | { |
f168693b | 7957 | result = check_typedef (result); |
931e5bc3 JG |
7958 | if (HAVE_GNAT_AUX_INFO (result)) |
7959 | result = TYPE_DESCRIPTIVE_TYPE (result); | |
7960 | else | |
7961 | result = NULL; | |
7962 | } | |
b4ba55a1 JB |
7963 | } |
7964 | ||
7965 | /* If we didn't find a match, see whether this is a packed array. With | |
7966 | older compilers, the descriptive type information is either absent or | |
7967 | irrelevant when it comes to packed arrays so the above lookup fails. | |
7968 | Fall back to using a parallel lookup by name in this case. */ | |
12ab9e09 | 7969 | if (result == NULL && ada_is_constrained_packed_array_type (type)) |
b4ba55a1 JB |
7970 | return ada_find_any_type (name); |
7971 | ||
7972 | return result; | |
7973 | } | |
7974 | ||
7975 | /* Find a parallel type to TYPE with the specified NAME, using the | |
7976 | descriptive type taken from the debugging information, if available, | |
7977 | and otherwise using the (slower) name-based method. */ | |
7978 | ||
7979 | static struct type * | |
7980 | ada_find_parallel_type_with_name (struct type *type, const char *name) | |
7981 | { | |
7982 | struct type *result = NULL; | |
7983 | ||
7984 | if (HAVE_GNAT_AUX_INFO (type)) | |
7985 | result = find_parallel_type_by_descriptive_type (type, name); | |
7986 | else | |
7987 | result = ada_find_any_type (name); | |
7988 | ||
7989 | return result; | |
7990 | } | |
7991 | ||
7992 | /* Same as above, but specify the name of the parallel type by appending | |
4c4b4cd2 | 7993 | SUFFIX to the name of TYPE. */ |
14f9c5c9 | 7994 | |
d2e4a39e | 7995 | struct type * |
ebf56fd3 | 7996 | ada_find_parallel_type (struct type *type, const char *suffix) |
14f9c5c9 | 7997 | { |
0d5cff50 | 7998 | char *name; |
fe978cb0 | 7999 | const char *type_name = ada_type_name (type); |
14f9c5c9 | 8000 | int len; |
d2e4a39e | 8001 | |
fe978cb0 | 8002 | if (type_name == NULL) |
14f9c5c9 AS |
8003 | return NULL; |
8004 | ||
fe978cb0 | 8005 | len = strlen (type_name); |
14f9c5c9 | 8006 | |
b4ba55a1 | 8007 | name = (char *) alloca (len + strlen (suffix) + 1); |
14f9c5c9 | 8008 | |
fe978cb0 | 8009 | strcpy (name, type_name); |
14f9c5c9 AS |
8010 | strcpy (name + len, suffix); |
8011 | ||
b4ba55a1 | 8012 | return ada_find_parallel_type_with_name (type, name); |
14f9c5c9 AS |
8013 | } |
8014 | ||
14f9c5c9 | 8015 | /* If TYPE is a variable-size record type, return the corresponding template |
4c4b4cd2 | 8016 | type describing its fields. Otherwise, return NULL. */ |
14f9c5c9 | 8017 | |
d2e4a39e AS |
8018 | static struct type * |
8019 | dynamic_template_type (struct type *type) | |
14f9c5c9 | 8020 | { |
61ee279c | 8021 | type = ada_check_typedef (type); |
14f9c5c9 AS |
8022 | |
8023 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT | |
d2e4a39e | 8024 | || ada_type_name (type) == NULL) |
14f9c5c9 | 8025 | return NULL; |
d2e4a39e | 8026 | else |
14f9c5c9 AS |
8027 | { |
8028 | int len = strlen (ada_type_name (type)); | |
5b4ee69b | 8029 | |
4c4b4cd2 PH |
8030 | if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0) |
8031 | return type; | |
14f9c5c9 | 8032 | else |
4c4b4cd2 | 8033 | return ada_find_parallel_type (type, "___XVE"); |
14f9c5c9 AS |
8034 | } |
8035 | } | |
8036 | ||
8037 | /* Assuming that TEMPL_TYPE is a union or struct type, returns | |
4c4b4cd2 | 8038 | non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */ |
14f9c5c9 | 8039 | |
d2e4a39e AS |
8040 | static int |
8041 | is_dynamic_field (struct type *templ_type, int field_num) | |
14f9c5c9 AS |
8042 | { |
8043 | const char *name = TYPE_FIELD_NAME (templ_type, field_num); | |
5b4ee69b | 8044 | |
d2e4a39e | 8045 | return name != NULL |
14f9c5c9 AS |
8046 | && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR |
8047 | && strstr (name, "___XVL") != NULL; | |
8048 | } | |
8049 | ||
4c4b4cd2 PH |
8050 | /* The index of the variant field of TYPE, or -1 if TYPE does not |
8051 | represent a variant record type. */ | |
14f9c5c9 | 8052 | |
d2e4a39e | 8053 | static int |
4c4b4cd2 | 8054 | variant_field_index (struct type *type) |
14f9c5c9 AS |
8055 | { |
8056 | int f; | |
8057 | ||
4c4b4cd2 PH |
8058 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT) |
8059 | return -1; | |
8060 | ||
8061 | for (f = 0; f < TYPE_NFIELDS (type); f += 1) | |
8062 | { | |
8063 | if (ada_is_variant_part (type, f)) | |
8064 | return f; | |
8065 | } | |
8066 | return -1; | |
14f9c5c9 AS |
8067 | } |
8068 | ||
4c4b4cd2 PH |
8069 | /* A record type with no fields. */ |
8070 | ||
d2e4a39e | 8071 | static struct type * |
fe978cb0 | 8072 | empty_record (struct type *templ) |
14f9c5c9 | 8073 | { |
fe978cb0 | 8074 | struct type *type = alloc_type_copy (templ); |
5b4ee69b | 8075 | |
14f9c5c9 AS |
8076 | TYPE_CODE (type) = TYPE_CODE_STRUCT; |
8077 | TYPE_NFIELDS (type) = 0; | |
8078 | TYPE_FIELDS (type) = NULL; | |
b1f33ddd | 8079 | INIT_CPLUS_SPECIFIC (type); |
14f9c5c9 AS |
8080 | TYPE_NAME (type) = "<empty>"; |
8081 | TYPE_TAG_NAME (type) = NULL; | |
14f9c5c9 AS |
8082 | TYPE_LENGTH (type) = 0; |
8083 | return type; | |
8084 | } | |
8085 | ||
8086 | /* An ordinary record type (with fixed-length fields) that describes | |
4c4b4cd2 PH |
8087 | the value of type TYPE at VALADDR or ADDRESS (see comments at |
8088 | the beginning of this section) VAL according to GNAT conventions. | |
8089 | DVAL0 should describe the (portion of a) record that contains any | |
df407dfe | 8090 | necessary discriminants. It should be NULL if value_type (VAL) is |
14f9c5c9 AS |
8091 | an outer-level type (i.e., as opposed to a branch of a variant.) A |
8092 | variant field (unless unchecked) is replaced by a particular branch | |
4c4b4cd2 | 8093 | of the variant. |
14f9c5c9 | 8094 | |
4c4b4cd2 PH |
8095 | If not KEEP_DYNAMIC_FIELDS, then all fields whose position or |
8096 | length are not statically known are discarded. As a consequence, | |
8097 | VALADDR, ADDRESS and DVAL0 are ignored. | |
8098 | ||
8099 | NOTE: Limitations: For now, we assume that dynamic fields and | |
8100 | variants occupy whole numbers of bytes. However, they need not be | |
8101 | byte-aligned. */ | |
8102 | ||
8103 | struct type * | |
10a2c479 | 8104 | ada_template_to_fixed_record_type_1 (struct type *type, |
fc1a4b47 | 8105 | const gdb_byte *valaddr, |
4c4b4cd2 PH |
8106 | CORE_ADDR address, struct value *dval0, |
8107 | int keep_dynamic_fields) | |
14f9c5c9 | 8108 | { |
d2e4a39e AS |
8109 | struct value *mark = value_mark (); |
8110 | struct value *dval; | |
8111 | struct type *rtype; | |
14f9c5c9 | 8112 | int nfields, bit_len; |
4c4b4cd2 | 8113 | int variant_field; |
14f9c5c9 | 8114 | long off; |
d94e4f4f | 8115 | int fld_bit_len; |
14f9c5c9 AS |
8116 | int f; |
8117 | ||
4c4b4cd2 PH |
8118 | /* Compute the number of fields in this record type that are going |
8119 | to be processed: unless keep_dynamic_fields, this includes only | |
8120 | fields whose position and length are static will be processed. */ | |
8121 | if (keep_dynamic_fields) | |
8122 | nfields = TYPE_NFIELDS (type); | |
8123 | else | |
8124 | { | |
8125 | nfields = 0; | |
76a01679 | 8126 | while (nfields < TYPE_NFIELDS (type) |
4c4b4cd2 PH |
8127 | && !ada_is_variant_part (type, nfields) |
8128 | && !is_dynamic_field (type, nfields)) | |
8129 | nfields++; | |
8130 | } | |
8131 | ||
e9bb382b | 8132 | rtype = alloc_type_copy (type); |
14f9c5c9 AS |
8133 | TYPE_CODE (rtype) = TYPE_CODE_STRUCT; |
8134 | INIT_CPLUS_SPECIFIC (rtype); | |
8135 | TYPE_NFIELDS (rtype) = nfields; | |
d2e4a39e | 8136 | TYPE_FIELDS (rtype) = (struct field *) |
14f9c5c9 AS |
8137 | TYPE_ALLOC (rtype, nfields * sizeof (struct field)); |
8138 | memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields); | |
8139 | TYPE_NAME (rtype) = ada_type_name (type); | |
8140 | TYPE_TAG_NAME (rtype) = NULL; | |
876cecd0 | 8141 | TYPE_FIXED_INSTANCE (rtype) = 1; |
14f9c5c9 | 8142 | |
d2e4a39e AS |
8143 | off = 0; |
8144 | bit_len = 0; | |
4c4b4cd2 PH |
8145 | variant_field = -1; |
8146 | ||
14f9c5c9 AS |
8147 | for (f = 0; f < nfields; f += 1) |
8148 | { | |
6c038f32 PH |
8149 | off = align_value (off, field_alignment (type, f)) |
8150 | + TYPE_FIELD_BITPOS (type, f); | |
945b3a32 | 8151 | SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off); |
d2e4a39e | 8152 | TYPE_FIELD_BITSIZE (rtype, f) = 0; |
14f9c5c9 | 8153 | |
d2e4a39e | 8154 | if (ada_is_variant_part (type, f)) |
4c4b4cd2 PH |
8155 | { |
8156 | variant_field = f; | |
d94e4f4f | 8157 | fld_bit_len = 0; |
4c4b4cd2 | 8158 | } |
14f9c5c9 | 8159 | else if (is_dynamic_field (type, f)) |
4c4b4cd2 | 8160 | { |
284614f0 JB |
8161 | const gdb_byte *field_valaddr = valaddr; |
8162 | CORE_ADDR field_address = address; | |
8163 | struct type *field_type = | |
8164 | TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f)); | |
8165 | ||
4c4b4cd2 | 8166 | if (dval0 == NULL) |
b5304971 JG |
8167 | { |
8168 | /* rtype's length is computed based on the run-time | |
8169 | value of discriminants. If the discriminants are not | |
8170 | initialized, the type size may be completely bogus and | |
0963b4bd | 8171 | GDB may fail to allocate a value for it. So check the |
b5304971 | 8172 | size first before creating the value. */ |
c1b5a1a6 | 8173 | ada_ensure_varsize_limit (rtype); |
012370f6 TT |
8174 | /* Using plain value_from_contents_and_address here |
8175 | causes problems because we will end up trying to | |
8176 | resolve a type that is currently being | |
8177 | constructed. */ | |
8178 | dval = value_from_contents_and_address_unresolved (rtype, | |
8179 | valaddr, | |
8180 | address); | |
9f1f738a | 8181 | rtype = value_type (dval); |
b5304971 | 8182 | } |
4c4b4cd2 PH |
8183 | else |
8184 | dval = dval0; | |
8185 | ||
284614f0 JB |
8186 | /* If the type referenced by this field is an aligner type, we need |
8187 | to unwrap that aligner type, because its size might not be set. | |
8188 | Keeping the aligner type would cause us to compute the wrong | |
8189 | size for this field, impacting the offset of the all the fields | |
8190 | that follow this one. */ | |
8191 | if (ada_is_aligner_type (field_type)) | |
8192 | { | |
8193 | long field_offset = TYPE_FIELD_BITPOS (field_type, f); | |
8194 | ||
8195 | field_valaddr = cond_offset_host (field_valaddr, field_offset); | |
8196 | field_address = cond_offset_target (field_address, field_offset); | |
8197 | field_type = ada_aligned_type (field_type); | |
8198 | } | |
8199 | ||
8200 | field_valaddr = cond_offset_host (field_valaddr, | |
8201 | off / TARGET_CHAR_BIT); | |
8202 | field_address = cond_offset_target (field_address, | |
8203 | off / TARGET_CHAR_BIT); | |
8204 | ||
8205 | /* Get the fixed type of the field. Note that, in this case, | |
8206 | we do not want to get the real type out of the tag: if | |
8207 | the current field is the parent part of a tagged record, | |
8208 | we will get the tag of the object. Clearly wrong: the real | |
8209 | type of the parent is not the real type of the child. We | |
8210 | would end up in an infinite loop. */ | |
8211 | field_type = ada_get_base_type (field_type); | |
8212 | field_type = ada_to_fixed_type (field_type, field_valaddr, | |
8213 | field_address, dval, 0); | |
27f2a97b JB |
8214 | /* If the field size is already larger than the maximum |
8215 | object size, then the record itself will necessarily | |
8216 | be larger than the maximum object size. We need to make | |
8217 | this check now, because the size might be so ridiculously | |
8218 | large (due to an uninitialized variable in the inferior) | |
8219 | that it would cause an overflow when adding it to the | |
8220 | record size. */ | |
c1b5a1a6 | 8221 | ada_ensure_varsize_limit (field_type); |
284614f0 JB |
8222 | |
8223 | TYPE_FIELD_TYPE (rtype, f) = field_type; | |
4c4b4cd2 | 8224 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
27f2a97b JB |
8225 | /* The multiplication can potentially overflow. But because |
8226 | the field length has been size-checked just above, and | |
8227 | assuming that the maximum size is a reasonable value, | |
8228 | an overflow should not happen in practice. So rather than | |
8229 | adding overflow recovery code to this already complex code, | |
8230 | we just assume that it's not going to happen. */ | |
d94e4f4f | 8231 | fld_bit_len = |
4c4b4cd2 PH |
8232 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT; |
8233 | } | |
14f9c5c9 | 8234 | else |
4c4b4cd2 | 8235 | { |
5ded5331 JB |
8236 | /* Note: If this field's type is a typedef, it is important |
8237 | to preserve the typedef layer. | |
8238 | ||
8239 | Otherwise, we might be transforming a typedef to a fat | |
8240 | pointer (encoding a pointer to an unconstrained array), | |
8241 | into a basic fat pointer (encoding an unconstrained | |
8242 | array). As both types are implemented using the same | |
8243 | structure, the typedef is the only clue which allows us | |
8244 | to distinguish between the two options. Stripping it | |
8245 | would prevent us from printing this field appropriately. */ | |
8246 | TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f); | |
4c4b4cd2 PH |
8247 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
8248 | if (TYPE_FIELD_BITSIZE (type, f) > 0) | |
d94e4f4f | 8249 | fld_bit_len = |
4c4b4cd2 PH |
8250 | TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f); |
8251 | else | |
5ded5331 JB |
8252 | { |
8253 | struct type *field_type = TYPE_FIELD_TYPE (type, f); | |
8254 | ||
8255 | /* We need to be careful of typedefs when computing | |
8256 | the length of our field. If this is a typedef, | |
8257 | get the length of the target type, not the length | |
8258 | of the typedef. */ | |
8259 | if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF) | |
8260 | field_type = ada_typedef_target_type (field_type); | |
8261 | ||
8262 | fld_bit_len = | |
8263 | TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT; | |
8264 | } | |
4c4b4cd2 | 8265 | } |
14f9c5c9 | 8266 | if (off + fld_bit_len > bit_len) |
4c4b4cd2 | 8267 | bit_len = off + fld_bit_len; |
d94e4f4f | 8268 | off += fld_bit_len; |
4c4b4cd2 PH |
8269 | TYPE_LENGTH (rtype) = |
8270 | align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT; | |
14f9c5c9 | 8271 | } |
4c4b4cd2 PH |
8272 | |
8273 | /* We handle the variant part, if any, at the end because of certain | |
b1f33ddd | 8274 | odd cases in which it is re-ordered so as NOT to be the last field of |
4c4b4cd2 PH |
8275 | the record. This can happen in the presence of representation |
8276 | clauses. */ | |
8277 | if (variant_field >= 0) | |
8278 | { | |
8279 | struct type *branch_type; | |
8280 | ||
8281 | off = TYPE_FIELD_BITPOS (rtype, variant_field); | |
8282 | ||
8283 | if (dval0 == NULL) | |
9f1f738a | 8284 | { |
012370f6 TT |
8285 | /* Using plain value_from_contents_and_address here causes |
8286 | problems because we will end up trying to resolve a type | |
8287 | that is currently being constructed. */ | |
8288 | dval = value_from_contents_and_address_unresolved (rtype, valaddr, | |
8289 | address); | |
9f1f738a SA |
8290 | rtype = value_type (dval); |
8291 | } | |
4c4b4cd2 PH |
8292 | else |
8293 | dval = dval0; | |
8294 | ||
8295 | branch_type = | |
8296 | to_fixed_variant_branch_type | |
8297 | (TYPE_FIELD_TYPE (type, variant_field), | |
8298 | cond_offset_host (valaddr, off / TARGET_CHAR_BIT), | |
8299 | cond_offset_target (address, off / TARGET_CHAR_BIT), dval); | |
8300 | if (branch_type == NULL) | |
8301 | { | |
8302 | for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1) | |
8303 | TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f]; | |
8304 | TYPE_NFIELDS (rtype) -= 1; | |
8305 | } | |
8306 | else | |
8307 | { | |
8308 | TYPE_FIELD_TYPE (rtype, variant_field) = branch_type; | |
8309 | TYPE_FIELD_NAME (rtype, variant_field) = "S"; | |
8310 | fld_bit_len = | |
8311 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) * | |
8312 | TARGET_CHAR_BIT; | |
8313 | if (off + fld_bit_len > bit_len) | |
8314 | bit_len = off + fld_bit_len; | |
8315 | TYPE_LENGTH (rtype) = | |
8316 | align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT; | |
8317 | } | |
8318 | } | |
8319 | ||
714e53ab PH |
8320 | /* According to exp_dbug.ads, the size of TYPE for variable-size records |
8321 | should contain the alignment of that record, which should be a strictly | |
8322 | positive value. If null or negative, then something is wrong, most | |
8323 | probably in the debug info. In that case, we don't round up the size | |
0963b4bd | 8324 | of the resulting type. If this record is not part of another structure, |
714e53ab PH |
8325 | the current RTYPE length might be good enough for our purposes. */ |
8326 | if (TYPE_LENGTH (type) <= 0) | |
8327 | { | |
323e0a4a AC |
8328 | if (TYPE_NAME (rtype)) |
8329 | warning (_("Invalid type size for `%s' detected: %d."), | |
8330 | TYPE_NAME (rtype), TYPE_LENGTH (type)); | |
8331 | else | |
8332 | warning (_("Invalid type size for <unnamed> detected: %d."), | |
8333 | TYPE_LENGTH (type)); | |
714e53ab PH |
8334 | } |
8335 | else | |
8336 | { | |
8337 | TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype), | |
8338 | TYPE_LENGTH (type)); | |
8339 | } | |
14f9c5c9 AS |
8340 | |
8341 | value_free_to_mark (mark); | |
d2e4a39e | 8342 | if (TYPE_LENGTH (rtype) > varsize_limit) |
323e0a4a | 8343 | error (_("record type with dynamic size is larger than varsize-limit")); |
14f9c5c9 AS |
8344 | return rtype; |
8345 | } | |
8346 | ||
4c4b4cd2 PH |
8347 | /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS |
8348 | of 1. */ | |
14f9c5c9 | 8349 | |
d2e4a39e | 8350 | static struct type * |
fc1a4b47 | 8351 | template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr, |
4c4b4cd2 PH |
8352 | CORE_ADDR address, struct value *dval0) |
8353 | { | |
8354 | return ada_template_to_fixed_record_type_1 (type, valaddr, | |
8355 | address, dval0, 1); | |
8356 | } | |
8357 | ||
8358 | /* An ordinary record type in which ___XVL-convention fields and | |
8359 | ___XVU- and ___XVN-convention field types in TYPE0 are replaced with | |
8360 | static approximations, containing all possible fields. Uses | |
8361 | no runtime values. Useless for use in values, but that's OK, | |
8362 | since the results are used only for type determinations. Works on both | |
8363 | structs and unions. Representation note: to save space, we memorize | |
8364 | the result of this function in the TYPE_TARGET_TYPE of the | |
8365 | template type. */ | |
8366 | ||
8367 | static struct type * | |
8368 | template_to_static_fixed_type (struct type *type0) | |
14f9c5c9 AS |
8369 | { |
8370 | struct type *type; | |
8371 | int nfields; | |
8372 | int f; | |
8373 | ||
9e195661 PMR |
8374 | /* No need no do anything if the input type is already fixed. */ |
8375 | if (TYPE_FIXED_INSTANCE (type0)) | |
8376 | return type0; | |
8377 | ||
8378 | /* Likewise if we already have computed the static approximation. */ | |
4c4b4cd2 PH |
8379 | if (TYPE_TARGET_TYPE (type0) != NULL) |
8380 | return TYPE_TARGET_TYPE (type0); | |
8381 | ||
9e195661 | 8382 | /* Don't clone TYPE0 until we are sure we are going to need a copy. */ |
4c4b4cd2 | 8383 | type = type0; |
9e195661 PMR |
8384 | nfields = TYPE_NFIELDS (type0); |
8385 | ||
8386 | /* Whether or not we cloned TYPE0, cache the result so that we don't do | |
8387 | recompute all over next time. */ | |
8388 | TYPE_TARGET_TYPE (type0) = type; | |
14f9c5c9 AS |
8389 | |
8390 | for (f = 0; f < nfields; f += 1) | |
8391 | { | |
460efde1 | 8392 | struct type *field_type = TYPE_FIELD_TYPE (type0, f); |
4c4b4cd2 | 8393 | struct type *new_type; |
14f9c5c9 | 8394 | |
4c4b4cd2 | 8395 | if (is_dynamic_field (type0, f)) |
460efde1 JB |
8396 | { |
8397 | field_type = ada_check_typedef (field_type); | |
8398 | new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type)); | |
8399 | } | |
14f9c5c9 | 8400 | else |
f192137b | 8401 | new_type = static_unwrap_type (field_type); |
9e195661 PMR |
8402 | |
8403 | if (new_type != field_type) | |
8404 | { | |
8405 | /* Clone TYPE0 only the first time we get a new field type. */ | |
8406 | if (type == type0) | |
8407 | { | |
8408 | TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0); | |
8409 | TYPE_CODE (type) = TYPE_CODE (type0); | |
8410 | INIT_CPLUS_SPECIFIC (type); | |
8411 | TYPE_NFIELDS (type) = nfields; | |
8412 | TYPE_FIELDS (type) = (struct field *) | |
8413 | TYPE_ALLOC (type, nfields * sizeof (struct field)); | |
8414 | memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0), | |
8415 | sizeof (struct field) * nfields); | |
8416 | TYPE_NAME (type) = ada_type_name (type0); | |
8417 | TYPE_TAG_NAME (type) = NULL; | |
8418 | TYPE_FIXED_INSTANCE (type) = 1; | |
8419 | TYPE_LENGTH (type) = 0; | |
8420 | } | |
8421 | TYPE_FIELD_TYPE (type, f) = new_type; | |
8422 | TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f); | |
8423 | } | |
14f9c5c9 | 8424 | } |
9e195661 | 8425 | |
14f9c5c9 AS |
8426 | return type; |
8427 | } | |
8428 | ||
4c4b4cd2 | 8429 | /* Given an object of type TYPE whose contents are at VALADDR and |
5823c3ef JB |
8430 | whose address in memory is ADDRESS, returns a revision of TYPE, |
8431 | which should be a non-dynamic-sized record, in which the variant | |
8432 | part, if any, is replaced with the appropriate branch. Looks | |
4c4b4cd2 PH |
8433 | for discriminant values in DVAL0, which can be NULL if the record |
8434 | contains the necessary discriminant values. */ | |
8435 | ||
d2e4a39e | 8436 | static struct type * |
fc1a4b47 | 8437 | to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr, |
4c4b4cd2 | 8438 | CORE_ADDR address, struct value *dval0) |
14f9c5c9 | 8439 | { |
d2e4a39e | 8440 | struct value *mark = value_mark (); |
4c4b4cd2 | 8441 | struct value *dval; |
d2e4a39e | 8442 | struct type *rtype; |
14f9c5c9 AS |
8443 | struct type *branch_type; |
8444 | int nfields = TYPE_NFIELDS (type); | |
4c4b4cd2 | 8445 | int variant_field = variant_field_index (type); |
14f9c5c9 | 8446 | |
4c4b4cd2 | 8447 | if (variant_field == -1) |
14f9c5c9 AS |
8448 | return type; |
8449 | ||
4c4b4cd2 | 8450 | if (dval0 == NULL) |
9f1f738a SA |
8451 | { |
8452 | dval = value_from_contents_and_address (type, valaddr, address); | |
8453 | type = value_type (dval); | |
8454 | } | |
4c4b4cd2 PH |
8455 | else |
8456 | dval = dval0; | |
8457 | ||
e9bb382b | 8458 | rtype = alloc_type_copy (type); |
14f9c5c9 | 8459 | TYPE_CODE (rtype) = TYPE_CODE_STRUCT; |
4c4b4cd2 PH |
8460 | INIT_CPLUS_SPECIFIC (rtype); |
8461 | TYPE_NFIELDS (rtype) = nfields; | |
d2e4a39e AS |
8462 | TYPE_FIELDS (rtype) = |
8463 | (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field)); | |
8464 | memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type), | |
4c4b4cd2 | 8465 | sizeof (struct field) * nfields); |
14f9c5c9 AS |
8466 | TYPE_NAME (rtype) = ada_type_name (type); |
8467 | TYPE_TAG_NAME (rtype) = NULL; | |
876cecd0 | 8468 | TYPE_FIXED_INSTANCE (rtype) = 1; |
14f9c5c9 AS |
8469 | TYPE_LENGTH (rtype) = TYPE_LENGTH (type); |
8470 | ||
4c4b4cd2 PH |
8471 | branch_type = to_fixed_variant_branch_type |
8472 | (TYPE_FIELD_TYPE (type, variant_field), | |
d2e4a39e | 8473 | cond_offset_host (valaddr, |
4c4b4cd2 PH |
8474 | TYPE_FIELD_BITPOS (type, variant_field) |
8475 | / TARGET_CHAR_BIT), | |
d2e4a39e | 8476 | cond_offset_target (address, |
4c4b4cd2 PH |
8477 | TYPE_FIELD_BITPOS (type, variant_field) |
8478 | / TARGET_CHAR_BIT), dval); | |
d2e4a39e | 8479 | if (branch_type == NULL) |
14f9c5c9 | 8480 | { |
4c4b4cd2 | 8481 | int f; |
5b4ee69b | 8482 | |
4c4b4cd2 PH |
8483 | for (f = variant_field + 1; f < nfields; f += 1) |
8484 | TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f]; | |
14f9c5c9 | 8485 | TYPE_NFIELDS (rtype) -= 1; |
14f9c5c9 AS |
8486 | } |
8487 | else | |
8488 | { | |
4c4b4cd2 PH |
8489 | TYPE_FIELD_TYPE (rtype, variant_field) = branch_type; |
8490 | TYPE_FIELD_NAME (rtype, variant_field) = "S"; | |
8491 | TYPE_FIELD_BITSIZE (rtype, variant_field) = 0; | |
14f9c5c9 | 8492 | TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type); |
14f9c5c9 | 8493 | } |
4c4b4cd2 | 8494 | TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field)); |
d2e4a39e | 8495 | |
4c4b4cd2 | 8496 | value_free_to_mark (mark); |
14f9c5c9 AS |
8497 | return rtype; |
8498 | } | |
8499 | ||
8500 | /* An ordinary record type (with fixed-length fields) that describes | |
8501 | the value at (TYPE0, VALADDR, ADDRESS) [see explanation at | |
8502 | beginning of this section]. Any necessary discriminants' values | |
4c4b4cd2 PH |
8503 | should be in DVAL, a record value; it may be NULL if the object |
8504 | at ADDR itself contains any necessary discriminant values. | |
8505 | Additionally, VALADDR and ADDRESS may also be NULL if no discriminant | |
8506 | values from the record are needed. Except in the case that DVAL, | |
8507 | VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless | |
8508 | unchecked) is replaced by a particular branch of the variant. | |
8509 | ||
8510 | NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0 | |
8511 | is questionable and may be removed. It can arise during the | |
8512 | processing of an unconstrained-array-of-record type where all the | |
8513 | variant branches have exactly the same size. This is because in | |
8514 | such cases, the compiler does not bother to use the XVS convention | |
8515 | when encoding the record. I am currently dubious of this | |
8516 | shortcut and suspect the compiler should be altered. FIXME. */ | |
14f9c5c9 | 8517 | |
d2e4a39e | 8518 | static struct type * |
fc1a4b47 | 8519 | to_fixed_record_type (struct type *type0, const gdb_byte *valaddr, |
4c4b4cd2 | 8520 | CORE_ADDR address, struct value *dval) |
14f9c5c9 | 8521 | { |
d2e4a39e | 8522 | struct type *templ_type; |
14f9c5c9 | 8523 | |
876cecd0 | 8524 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 PH |
8525 | return type0; |
8526 | ||
d2e4a39e | 8527 | templ_type = dynamic_template_type (type0); |
14f9c5c9 AS |
8528 | |
8529 | if (templ_type != NULL) | |
8530 | return template_to_fixed_record_type (templ_type, valaddr, address, dval); | |
4c4b4cd2 PH |
8531 | else if (variant_field_index (type0) >= 0) |
8532 | { | |
8533 | if (dval == NULL && valaddr == NULL && address == 0) | |
8534 | return type0; | |
8535 | return to_record_with_fixed_variant_part (type0, valaddr, address, | |
8536 | dval); | |
8537 | } | |
14f9c5c9 AS |
8538 | else |
8539 | { | |
876cecd0 | 8540 | TYPE_FIXED_INSTANCE (type0) = 1; |
14f9c5c9 AS |
8541 | return type0; |
8542 | } | |
8543 | ||
8544 | } | |
8545 | ||
8546 | /* An ordinary record type (with fixed-length fields) that describes | |
8547 | the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a | |
8548 | union type. Any necessary discriminants' values should be in DVAL, | |
8549 | a record value. That is, this routine selects the appropriate | |
8550 | branch of the union at ADDR according to the discriminant value | |
b1f33ddd | 8551 | indicated in the union's type name. Returns VAR_TYPE0 itself if |
0963b4bd | 8552 | it represents a variant subject to a pragma Unchecked_Union. */ |
14f9c5c9 | 8553 | |
d2e4a39e | 8554 | static struct type * |
fc1a4b47 | 8555 | to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr, |
4c4b4cd2 | 8556 | CORE_ADDR address, struct value *dval) |
14f9c5c9 AS |
8557 | { |
8558 | int which; | |
d2e4a39e AS |
8559 | struct type *templ_type; |
8560 | struct type *var_type; | |
14f9c5c9 AS |
8561 | |
8562 | if (TYPE_CODE (var_type0) == TYPE_CODE_PTR) | |
8563 | var_type = TYPE_TARGET_TYPE (var_type0); | |
d2e4a39e | 8564 | else |
14f9c5c9 AS |
8565 | var_type = var_type0; |
8566 | ||
8567 | templ_type = ada_find_parallel_type (var_type, "___XVU"); | |
8568 | ||
8569 | if (templ_type != NULL) | |
8570 | var_type = templ_type; | |
8571 | ||
b1f33ddd JB |
8572 | if (is_unchecked_variant (var_type, value_type (dval))) |
8573 | return var_type0; | |
d2e4a39e AS |
8574 | which = |
8575 | ada_which_variant_applies (var_type, | |
0fd88904 | 8576 | value_type (dval), value_contents (dval)); |
14f9c5c9 AS |
8577 | |
8578 | if (which < 0) | |
e9bb382b | 8579 | return empty_record (var_type); |
14f9c5c9 | 8580 | else if (is_dynamic_field (var_type, which)) |
4c4b4cd2 | 8581 | return to_fixed_record_type |
d2e4a39e AS |
8582 | (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)), |
8583 | valaddr, address, dval); | |
4c4b4cd2 | 8584 | else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0) |
d2e4a39e AS |
8585 | return |
8586 | to_fixed_record_type | |
8587 | (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval); | |
14f9c5c9 AS |
8588 | else |
8589 | return TYPE_FIELD_TYPE (var_type, which); | |
8590 | } | |
8591 | ||
8908fca5 JB |
8592 | /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if |
8593 | ENCODING_TYPE, a type following the GNAT conventions for discrete | |
8594 | type encodings, only carries redundant information. */ | |
8595 | ||
8596 | static int | |
8597 | ada_is_redundant_range_encoding (struct type *range_type, | |
8598 | struct type *encoding_type) | |
8599 | { | |
8600 | struct type *fixed_range_type; | |
108d56a4 | 8601 | const char *bounds_str; |
8908fca5 JB |
8602 | int n; |
8603 | LONGEST lo, hi; | |
8604 | ||
8605 | gdb_assert (TYPE_CODE (range_type) == TYPE_CODE_RANGE); | |
8606 | ||
005e2509 JB |
8607 | if (TYPE_CODE (get_base_type (range_type)) |
8608 | != TYPE_CODE (get_base_type (encoding_type))) | |
8609 | { | |
8610 | /* The compiler probably used a simple base type to describe | |
8611 | the range type instead of the range's actual base type, | |
8612 | expecting us to get the real base type from the encoding | |
8613 | anyway. In this situation, the encoding cannot be ignored | |
8614 | as redundant. */ | |
8615 | return 0; | |
8616 | } | |
8617 | ||
8908fca5 JB |
8618 | if (is_dynamic_type (range_type)) |
8619 | return 0; | |
8620 | ||
8621 | if (TYPE_NAME (encoding_type) == NULL) | |
8622 | return 0; | |
8623 | ||
8624 | bounds_str = strstr (TYPE_NAME (encoding_type), "___XDLU_"); | |
8625 | if (bounds_str == NULL) | |
8626 | return 0; | |
8627 | ||
8628 | n = 8; /* Skip "___XDLU_". */ | |
8629 | if (!ada_scan_number (bounds_str, n, &lo, &n)) | |
8630 | return 0; | |
8631 | if (TYPE_LOW_BOUND (range_type) != lo) | |
8632 | return 0; | |
8633 | ||
8634 | n += 2; /* Skip the "__" separator between the two bounds. */ | |
8635 | if (!ada_scan_number (bounds_str, n, &hi, &n)) | |
8636 | return 0; | |
8637 | if (TYPE_HIGH_BOUND (range_type) != hi) | |
8638 | return 0; | |
8639 | ||
8640 | return 1; | |
8641 | } | |
8642 | ||
8643 | /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE, | |
8644 | a type following the GNAT encoding for describing array type | |
8645 | indices, only carries redundant information. */ | |
8646 | ||
8647 | static int | |
8648 | ada_is_redundant_index_type_desc (struct type *array_type, | |
8649 | struct type *desc_type) | |
8650 | { | |
8651 | struct type *this_layer = check_typedef (array_type); | |
8652 | int i; | |
8653 | ||
8654 | for (i = 0; i < TYPE_NFIELDS (desc_type); i++) | |
8655 | { | |
8656 | if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer), | |
8657 | TYPE_FIELD_TYPE (desc_type, i))) | |
8658 | return 0; | |
8659 | this_layer = check_typedef (TYPE_TARGET_TYPE (this_layer)); | |
8660 | } | |
8661 | ||
8662 | return 1; | |
8663 | } | |
8664 | ||
14f9c5c9 AS |
8665 | /* Assuming that TYPE0 is an array type describing the type of a value |
8666 | at ADDR, and that DVAL describes a record containing any | |
8667 | discriminants used in TYPE0, returns a type for the value that | |
8668 | contains no dynamic components (that is, no components whose sizes | |
8669 | are determined by run-time quantities). Unless IGNORE_TOO_BIG is | |
8670 | true, gives an error message if the resulting type's size is over | |
4c4b4cd2 | 8671 | varsize_limit. */ |
14f9c5c9 | 8672 | |
d2e4a39e AS |
8673 | static struct type * |
8674 | to_fixed_array_type (struct type *type0, struct value *dval, | |
4c4b4cd2 | 8675 | int ignore_too_big) |
14f9c5c9 | 8676 | { |
d2e4a39e AS |
8677 | struct type *index_type_desc; |
8678 | struct type *result; | |
ad82864c | 8679 | int constrained_packed_array_p; |
931e5bc3 | 8680 | static const char *xa_suffix = "___XA"; |
14f9c5c9 | 8681 | |
b0dd7688 | 8682 | type0 = ada_check_typedef (type0); |
284614f0 | 8683 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 | 8684 | return type0; |
14f9c5c9 | 8685 | |
ad82864c JB |
8686 | constrained_packed_array_p = ada_is_constrained_packed_array_type (type0); |
8687 | if (constrained_packed_array_p) | |
8688 | type0 = decode_constrained_packed_array_type (type0); | |
284614f0 | 8689 | |
931e5bc3 JG |
8690 | index_type_desc = ada_find_parallel_type (type0, xa_suffix); |
8691 | ||
8692 | /* As mentioned in exp_dbug.ads, for non bit-packed arrays an | |
8693 | encoding suffixed with 'P' may still be generated. If so, | |
8694 | it should be used to find the XA type. */ | |
8695 | ||
8696 | if (index_type_desc == NULL) | |
8697 | { | |
1da0522e | 8698 | const char *type_name = ada_type_name (type0); |
931e5bc3 | 8699 | |
1da0522e | 8700 | if (type_name != NULL) |
931e5bc3 | 8701 | { |
1da0522e | 8702 | const int len = strlen (type_name); |
931e5bc3 JG |
8703 | char *name = (char *) alloca (len + strlen (xa_suffix)); |
8704 | ||
1da0522e | 8705 | if (type_name[len - 1] == 'P') |
931e5bc3 | 8706 | { |
1da0522e | 8707 | strcpy (name, type_name); |
931e5bc3 JG |
8708 | strcpy (name + len - 1, xa_suffix); |
8709 | index_type_desc = ada_find_parallel_type_with_name (type0, name); | |
8710 | } | |
8711 | } | |
8712 | } | |
8713 | ||
28c85d6c | 8714 | ada_fixup_array_indexes_type (index_type_desc); |
8908fca5 JB |
8715 | if (index_type_desc != NULL |
8716 | && ada_is_redundant_index_type_desc (type0, index_type_desc)) | |
8717 | { | |
8718 | /* Ignore this ___XA parallel type, as it does not bring any | |
8719 | useful information. This allows us to avoid creating fixed | |
8720 | versions of the array's index types, which would be identical | |
8721 | to the original ones. This, in turn, can also help avoid | |
8722 | the creation of fixed versions of the array itself. */ | |
8723 | index_type_desc = NULL; | |
8724 | } | |
8725 | ||
14f9c5c9 AS |
8726 | if (index_type_desc == NULL) |
8727 | { | |
61ee279c | 8728 | struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0)); |
5b4ee69b | 8729 | |
14f9c5c9 | 8730 | /* NOTE: elt_type---the fixed version of elt_type0---should never |
4c4b4cd2 PH |
8731 | depend on the contents of the array in properly constructed |
8732 | debugging data. */ | |
529cad9c PH |
8733 | /* Create a fixed version of the array element type. |
8734 | We're not providing the address of an element here, | |
e1d5a0d2 | 8735 | and thus the actual object value cannot be inspected to do |
529cad9c PH |
8736 | the conversion. This should not be a problem, since arrays of |
8737 | unconstrained objects are not allowed. In particular, all | |
8738 | the elements of an array of a tagged type should all be of | |
8739 | the same type specified in the debugging info. No need to | |
8740 | consult the object tag. */ | |
1ed6ede0 | 8741 | struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1); |
14f9c5c9 | 8742 | |
284614f0 JB |
8743 | /* Make sure we always create a new array type when dealing with |
8744 | packed array types, since we're going to fix-up the array | |
8745 | type length and element bitsize a little further down. */ | |
ad82864c | 8746 | if (elt_type0 == elt_type && !constrained_packed_array_p) |
4c4b4cd2 | 8747 | result = type0; |
14f9c5c9 | 8748 | else |
e9bb382b | 8749 | result = create_array_type (alloc_type_copy (type0), |
4c4b4cd2 | 8750 | elt_type, TYPE_INDEX_TYPE (type0)); |
14f9c5c9 AS |
8751 | } |
8752 | else | |
8753 | { | |
8754 | int i; | |
8755 | struct type *elt_type0; | |
8756 | ||
8757 | elt_type0 = type0; | |
8758 | for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1) | |
4c4b4cd2 | 8759 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); |
14f9c5c9 AS |
8760 | |
8761 | /* NOTE: result---the fixed version of elt_type0---should never | |
4c4b4cd2 PH |
8762 | depend on the contents of the array in properly constructed |
8763 | debugging data. */ | |
529cad9c PH |
8764 | /* Create a fixed version of the array element type. |
8765 | We're not providing the address of an element here, | |
e1d5a0d2 | 8766 | and thus the actual object value cannot be inspected to do |
529cad9c PH |
8767 | the conversion. This should not be a problem, since arrays of |
8768 | unconstrained objects are not allowed. In particular, all | |
8769 | the elements of an array of a tagged type should all be of | |
8770 | the same type specified in the debugging info. No need to | |
8771 | consult the object tag. */ | |
1ed6ede0 JB |
8772 | result = |
8773 | ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1); | |
1ce677a4 UW |
8774 | |
8775 | elt_type0 = type0; | |
14f9c5c9 | 8776 | for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1) |
4c4b4cd2 PH |
8777 | { |
8778 | struct type *range_type = | |
28c85d6c | 8779 | to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval); |
5b4ee69b | 8780 | |
e9bb382b | 8781 | result = create_array_type (alloc_type_copy (elt_type0), |
4c4b4cd2 | 8782 | result, range_type); |
1ce677a4 | 8783 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); |
4c4b4cd2 | 8784 | } |
d2e4a39e | 8785 | if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit) |
323e0a4a | 8786 | error (_("array type with dynamic size is larger than varsize-limit")); |
14f9c5c9 AS |
8787 | } |
8788 | ||
2e6fda7d JB |
8789 | /* We want to preserve the type name. This can be useful when |
8790 | trying to get the type name of a value that has already been | |
8791 | printed (for instance, if the user did "print VAR; whatis $". */ | |
8792 | TYPE_NAME (result) = TYPE_NAME (type0); | |
8793 | ||
ad82864c | 8794 | if (constrained_packed_array_p) |
284614f0 JB |
8795 | { |
8796 | /* So far, the resulting type has been created as if the original | |
8797 | type was a regular (non-packed) array type. As a result, the | |
8798 | bitsize of the array elements needs to be set again, and the array | |
8799 | length needs to be recomputed based on that bitsize. */ | |
8800 | int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result)); | |
8801 | int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0); | |
8802 | ||
8803 | TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0); | |
8804 | TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT; | |
8805 | if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize) | |
8806 | TYPE_LENGTH (result)++; | |
8807 | } | |
8808 | ||
876cecd0 | 8809 | TYPE_FIXED_INSTANCE (result) = 1; |
14f9c5c9 | 8810 | return result; |
d2e4a39e | 8811 | } |
14f9c5c9 AS |
8812 | |
8813 | ||
8814 | /* A standard type (containing no dynamically sized components) | |
8815 | corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS) | |
8816 | DVAL describes a record containing any discriminants used in TYPE0, | |
4c4b4cd2 | 8817 | and may be NULL if there are none, or if the object of type TYPE at |
529cad9c PH |
8818 | ADDRESS or in VALADDR contains these discriminants. |
8819 | ||
1ed6ede0 JB |
8820 | If CHECK_TAG is not null, in the case of tagged types, this function |
8821 | attempts to locate the object's tag and use it to compute the actual | |
8822 | type. However, when ADDRESS is null, we cannot use it to determine the | |
8823 | location of the tag, and therefore compute the tagged type's actual type. | |
8824 | So we return the tagged type without consulting the tag. */ | |
529cad9c | 8825 | |
f192137b JB |
8826 | static struct type * |
8827 | ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr, | |
1ed6ede0 | 8828 | CORE_ADDR address, struct value *dval, int check_tag) |
14f9c5c9 | 8829 | { |
61ee279c | 8830 | type = ada_check_typedef (type); |
d2e4a39e AS |
8831 | switch (TYPE_CODE (type)) |
8832 | { | |
8833 | default: | |
14f9c5c9 | 8834 | return type; |
d2e4a39e | 8835 | case TYPE_CODE_STRUCT: |
4c4b4cd2 | 8836 | { |
76a01679 | 8837 | struct type *static_type = to_static_fixed_type (type); |
1ed6ede0 JB |
8838 | struct type *fixed_record_type = |
8839 | to_fixed_record_type (type, valaddr, address, NULL); | |
5b4ee69b | 8840 | |
529cad9c PH |
8841 | /* If STATIC_TYPE is a tagged type and we know the object's address, |
8842 | then we can determine its tag, and compute the object's actual | |
0963b4bd | 8843 | type from there. Note that we have to use the fixed record |
1ed6ede0 JB |
8844 | type (the parent part of the record may have dynamic fields |
8845 | and the way the location of _tag is expressed may depend on | |
8846 | them). */ | |
529cad9c | 8847 | |
1ed6ede0 | 8848 | if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0)) |
76a01679 | 8849 | { |
b50d69b5 JG |
8850 | struct value *tag = |
8851 | value_tag_from_contents_and_address | |
8852 | (fixed_record_type, | |
8853 | valaddr, | |
8854 | address); | |
8855 | struct type *real_type = type_from_tag (tag); | |
8856 | struct value *obj = | |
8857 | value_from_contents_and_address (fixed_record_type, | |
8858 | valaddr, | |
8859 | address); | |
9f1f738a | 8860 | fixed_record_type = value_type (obj); |
76a01679 | 8861 | if (real_type != NULL) |
b50d69b5 JG |
8862 | return to_fixed_record_type |
8863 | (real_type, NULL, | |
8864 | value_address (ada_tag_value_at_base_address (obj)), NULL); | |
76a01679 | 8865 | } |
4af88198 JB |
8866 | |
8867 | /* Check to see if there is a parallel ___XVZ variable. | |
8868 | If there is, then it provides the actual size of our type. */ | |
8869 | else if (ada_type_name (fixed_record_type) != NULL) | |
8870 | { | |
0d5cff50 | 8871 | const char *name = ada_type_name (fixed_record_type); |
4af88198 JB |
8872 | char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */); |
8873 | int xvz_found = 0; | |
8874 | LONGEST size; | |
8875 | ||
88c15c34 | 8876 | xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name); |
4af88198 JB |
8877 | size = get_int_var_value (xvz_name, &xvz_found); |
8878 | if (xvz_found && TYPE_LENGTH (fixed_record_type) != size) | |
8879 | { | |
8880 | fixed_record_type = copy_type (fixed_record_type); | |
8881 | TYPE_LENGTH (fixed_record_type) = size; | |
8882 | ||
8883 | /* The FIXED_RECORD_TYPE may have be a stub. We have | |
8884 | observed this when the debugging info is STABS, and | |
8885 | apparently it is something that is hard to fix. | |
8886 | ||
8887 | In practice, we don't need the actual type definition | |
8888 | at all, because the presence of the XVZ variable allows us | |
8889 | to assume that there must be a XVS type as well, which we | |
8890 | should be able to use later, when we need the actual type | |
8891 | definition. | |
8892 | ||
8893 | In the meantime, pretend that the "fixed" type we are | |
8894 | returning is NOT a stub, because this can cause trouble | |
8895 | when using this type to create new types targeting it. | |
8896 | Indeed, the associated creation routines often check | |
8897 | whether the target type is a stub and will try to replace | |
0963b4bd | 8898 | it, thus using a type with the wrong size. This, in turn, |
4af88198 JB |
8899 | might cause the new type to have the wrong size too. |
8900 | Consider the case of an array, for instance, where the size | |
8901 | of the array is computed from the number of elements in | |
8902 | our array multiplied by the size of its element. */ | |
8903 | TYPE_STUB (fixed_record_type) = 0; | |
8904 | } | |
8905 | } | |
1ed6ede0 | 8906 | return fixed_record_type; |
4c4b4cd2 | 8907 | } |
d2e4a39e | 8908 | case TYPE_CODE_ARRAY: |
4c4b4cd2 | 8909 | return to_fixed_array_type (type, dval, 1); |
d2e4a39e AS |
8910 | case TYPE_CODE_UNION: |
8911 | if (dval == NULL) | |
4c4b4cd2 | 8912 | return type; |
d2e4a39e | 8913 | else |
4c4b4cd2 | 8914 | return to_fixed_variant_branch_type (type, valaddr, address, dval); |
d2e4a39e | 8915 | } |
14f9c5c9 AS |
8916 | } |
8917 | ||
f192137b JB |
8918 | /* The same as ada_to_fixed_type_1, except that it preserves the type |
8919 | if it is a TYPE_CODE_TYPEDEF of a type that is already fixed. | |
96dbd2c1 JB |
8920 | |
8921 | The typedef layer needs be preserved in order to differentiate between | |
8922 | arrays and array pointers when both types are implemented using the same | |
8923 | fat pointer. In the array pointer case, the pointer is encoded as | |
8924 | a typedef of the pointer type. For instance, considering: | |
8925 | ||
8926 | type String_Access is access String; | |
8927 | S1 : String_Access := null; | |
8928 | ||
8929 | To the debugger, S1 is defined as a typedef of type String. But | |
8930 | to the user, it is a pointer. So if the user tries to print S1, | |
8931 | we should not dereference the array, but print the array address | |
8932 | instead. | |
8933 | ||
8934 | If we didn't preserve the typedef layer, we would lose the fact that | |
8935 | the type is to be presented as a pointer (needs de-reference before | |
8936 | being printed). And we would also use the source-level type name. */ | |
f192137b JB |
8937 | |
8938 | struct type * | |
8939 | ada_to_fixed_type (struct type *type, const gdb_byte *valaddr, | |
8940 | CORE_ADDR address, struct value *dval, int check_tag) | |
8941 | ||
8942 | { | |
8943 | struct type *fixed_type = | |
8944 | ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag); | |
8945 | ||
96dbd2c1 JB |
8946 | /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE, |
8947 | then preserve the typedef layer. | |
8948 | ||
8949 | Implementation note: We can only check the main-type portion of | |
8950 | the TYPE and FIXED_TYPE, because eliminating the typedef layer | |
8951 | from TYPE now returns a type that has the same instance flags | |
8952 | as TYPE. For instance, if TYPE is a "typedef const", and its | |
8953 | target type is a "struct", then the typedef elimination will return | |
8954 | a "const" version of the target type. See check_typedef for more | |
8955 | details about how the typedef layer elimination is done. | |
8956 | ||
8957 | brobecker/2010-11-19: It seems to me that the only case where it is | |
8958 | useful to preserve the typedef layer is when dealing with fat pointers. | |
8959 | Perhaps, we could add a check for that and preserve the typedef layer | |
8960 | only in that situation. But this seems unecessary so far, probably | |
8961 | because we call check_typedef/ada_check_typedef pretty much everywhere. | |
8962 | */ | |
f192137b | 8963 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF |
720d1a40 | 8964 | && (TYPE_MAIN_TYPE (ada_typedef_target_type (type)) |
96dbd2c1 | 8965 | == TYPE_MAIN_TYPE (fixed_type))) |
f192137b JB |
8966 | return type; |
8967 | ||
8968 | return fixed_type; | |
8969 | } | |
8970 | ||
14f9c5c9 | 8971 | /* A standard (static-sized) type corresponding as well as possible to |
4c4b4cd2 | 8972 | TYPE0, but based on no runtime data. */ |
14f9c5c9 | 8973 | |
d2e4a39e AS |
8974 | static struct type * |
8975 | to_static_fixed_type (struct type *type0) | |
14f9c5c9 | 8976 | { |
d2e4a39e | 8977 | struct type *type; |
14f9c5c9 AS |
8978 | |
8979 | if (type0 == NULL) | |
8980 | return NULL; | |
8981 | ||
876cecd0 | 8982 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 PH |
8983 | return type0; |
8984 | ||
61ee279c | 8985 | type0 = ada_check_typedef (type0); |
d2e4a39e | 8986 | |
14f9c5c9 AS |
8987 | switch (TYPE_CODE (type0)) |
8988 | { | |
8989 | default: | |
8990 | return type0; | |
8991 | case TYPE_CODE_STRUCT: | |
8992 | type = dynamic_template_type (type0); | |
d2e4a39e | 8993 | if (type != NULL) |
4c4b4cd2 PH |
8994 | return template_to_static_fixed_type (type); |
8995 | else | |
8996 | return template_to_static_fixed_type (type0); | |
14f9c5c9 AS |
8997 | case TYPE_CODE_UNION: |
8998 | type = ada_find_parallel_type (type0, "___XVU"); | |
8999 | if (type != NULL) | |
4c4b4cd2 PH |
9000 | return template_to_static_fixed_type (type); |
9001 | else | |
9002 | return template_to_static_fixed_type (type0); | |
14f9c5c9 AS |
9003 | } |
9004 | } | |
9005 | ||
4c4b4cd2 PH |
9006 | /* A static approximation of TYPE with all type wrappers removed. */ |
9007 | ||
d2e4a39e AS |
9008 | static struct type * |
9009 | static_unwrap_type (struct type *type) | |
14f9c5c9 AS |
9010 | { |
9011 | if (ada_is_aligner_type (type)) | |
9012 | { | |
61ee279c | 9013 | struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0); |
14f9c5c9 | 9014 | if (ada_type_name (type1) == NULL) |
4c4b4cd2 | 9015 | TYPE_NAME (type1) = ada_type_name (type); |
14f9c5c9 AS |
9016 | |
9017 | return static_unwrap_type (type1); | |
9018 | } | |
d2e4a39e | 9019 | else |
14f9c5c9 | 9020 | { |
d2e4a39e | 9021 | struct type *raw_real_type = ada_get_base_type (type); |
5b4ee69b | 9022 | |
d2e4a39e | 9023 | if (raw_real_type == type) |
4c4b4cd2 | 9024 | return type; |
14f9c5c9 | 9025 | else |
4c4b4cd2 | 9026 | return to_static_fixed_type (raw_real_type); |
14f9c5c9 AS |
9027 | } |
9028 | } | |
9029 | ||
9030 | /* In some cases, incomplete and private types require | |
4c4b4cd2 | 9031 | cross-references that are not resolved as records (for example, |
14f9c5c9 AS |
9032 | type Foo; |
9033 | type FooP is access Foo; | |
9034 | V: FooP; | |
9035 | type Foo is array ...; | |
4c4b4cd2 | 9036 | ). In these cases, since there is no mechanism for producing |
14f9c5c9 AS |
9037 | cross-references to such types, we instead substitute for FooP a |
9038 | stub enumeration type that is nowhere resolved, and whose tag is | |
4c4b4cd2 | 9039 | the name of the actual type. Call these types "non-record stubs". */ |
14f9c5c9 AS |
9040 | |
9041 | /* A type equivalent to TYPE that is not a non-record stub, if one | |
4c4b4cd2 PH |
9042 | exists, otherwise TYPE. */ |
9043 | ||
d2e4a39e | 9044 | struct type * |
61ee279c | 9045 | ada_check_typedef (struct type *type) |
14f9c5c9 | 9046 | { |
727e3d2e JB |
9047 | if (type == NULL) |
9048 | return NULL; | |
9049 | ||
720d1a40 JB |
9050 | /* If our type is a typedef type of a fat pointer, then we're done. |
9051 | We don't want to strip the TYPE_CODE_TYPDEF layer, because this is | |
9052 | what allows us to distinguish between fat pointers that represent | |
9053 | array types, and fat pointers that represent array access types | |
9054 | (in both cases, the compiler implements them as fat pointers). */ | |
9055 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF | |
9056 | && is_thick_pntr (ada_typedef_target_type (type))) | |
9057 | return type; | |
9058 | ||
f168693b | 9059 | type = check_typedef (type); |
14f9c5c9 | 9060 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM |
529cad9c | 9061 | || !TYPE_STUB (type) |
14f9c5c9 AS |
9062 | || TYPE_TAG_NAME (type) == NULL) |
9063 | return type; | |
d2e4a39e | 9064 | else |
14f9c5c9 | 9065 | { |
0d5cff50 | 9066 | const char *name = TYPE_TAG_NAME (type); |
d2e4a39e | 9067 | struct type *type1 = ada_find_any_type (name); |
5b4ee69b | 9068 | |
05e522ef JB |
9069 | if (type1 == NULL) |
9070 | return type; | |
9071 | ||
9072 | /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with | |
9073 | stubs pointing to arrays, as we don't create symbols for array | |
3a867c22 JB |
9074 | types, only for the typedef-to-array types). If that's the case, |
9075 | strip the typedef layer. */ | |
9076 | if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF) | |
9077 | type1 = ada_check_typedef (type1); | |
9078 | ||
9079 | return type1; | |
14f9c5c9 AS |
9080 | } |
9081 | } | |
9082 | ||
9083 | /* A value representing the data at VALADDR/ADDRESS as described by | |
9084 | type TYPE0, but with a standard (static-sized) type that correctly | |
9085 | describes it. If VAL0 is not NULL and TYPE0 already is a standard | |
9086 | type, then return VAL0 [this feature is simply to avoid redundant | |
4c4b4cd2 | 9087 | creation of struct values]. */ |
14f9c5c9 | 9088 | |
4c4b4cd2 PH |
9089 | static struct value * |
9090 | ada_to_fixed_value_create (struct type *type0, CORE_ADDR address, | |
9091 | struct value *val0) | |
14f9c5c9 | 9092 | { |
1ed6ede0 | 9093 | struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1); |
5b4ee69b | 9094 | |
14f9c5c9 AS |
9095 | if (type == type0 && val0 != NULL) |
9096 | return val0; | |
d2e4a39e | 9097 | else |
4c4b4cd2 PH |
9098 | return value_from_contents_and_address (type, 0, address); |
9099 | } | |
9100 | ||
9101 | /* A value representing VAL, but with a standard (static-sized) type | |
9102 | that correctly describes it. Does not necessarily create a new | |
9103 | value. */ | |
9104 | ||
0c3acc09 | 9105 | struct value * |
4c4b4cd2 PH |
9106 | ada_to_fixed_value (struct value *val) |
9107 | { | |
c48db5ca JB |
9108 | val = unwrap_value (val); |
9109 | val = ada_to_fixed_value_create (value_type (val), | |
9110 | value_address (val), | |
9111 | val); | |
9112 | return val; | |
14f9c5c9 | 9113 | } |
d2e4a39e | 9114 | \f |
14f9c5c9 | 9115 | |
14f9c5c9 AS |
9116 | /* Attributes */ |
9117 | ||
4c4b4cd2 PH |
9118 | /* Table mapping attribute numbers to names. |
9119 | NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */ | |
14f9c5c9 | 9120 | |
d2e4a39e | 9121 | static const char *attribute_names[] = { |
14f9c5c9 AS |
9122 | "<?>", |
9123 | ||
d2e4a39e | 9124 | "first", |
14f9c5c9 AS |
9125 | "last", |
9126 | "length", | |
9127 | "image", | |
14f9c5c9 AS |
9128 | "max", |
9129 | "min", | |
4c4b4cd2 PH |
9130 | "modulus", |
9131 | "pos", | |
9132 | "size", | |
9133 | "tag", | |
14f9c5c9 | 9134 | "val", |
14f9c5c9 AS |
9135 | 0 |
9136 | }; | |
9137 | ||
d2e4a39e | 9138 | const char * |
4c4b4cd2 | 9139 | ada_attribute_name (enum exp_opcode n) |
14f9c5c9 | 9140 | { |
4c4b4cd2 PH |
9141 | if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL) |
9142 | return attribute_names[n - OP_ATR_FIRST + 1]; | |
14f9c5c9 AS |
9143 | else |
9144 | return attribute_names[0]; | |
9145 | } | |
9146 | ||
4c4b4cd2 | 9147 | /* Evaluate the 'POS attribute applied to ARG. */ |
14f9c5c9 | 9148 | |
4c4b4cd2 PH |
9149 | static LONGEST |
9150 | pos_atr (struct value *arg) | |
14f9c5c9 | 9151 | { |
24209737 PH |
9152 | struct value *val = coerce_ref (arg); |
9153 | struct type *type = value_type (val); | |
aa715135 | 9154 | LONGEST result; |
14f9c5c9 | 9155 | |
d2e4a39e | 9156 | if (!discrete_type_p (type)) |
323e0a4a | 9157 | error (_("'POS only defined on discrete types")); |
14f9c5c9 | 9158 | |
aa715135 JG |
9159 | if (!discrete_position (type, value_as_long (val), &result)) |
9160 | error (_("enumeration value is invalid: can't find 'POS")); | |
14f9c5c9 | 9161 | |
aa715135 | 9162 | return result; |
4c4b4cd2 PH |
9163 | } |
9164 | ||
9165 | static struct value * | |
3cb382c9 | 9166 | value_pos_atr (struct type *type, struct value *arg) |
4c4b4cd2 | 9167 | { |
3cb382c9 | 9168 | return value_from_longest (type, pos_atr (arg)); |
14f9c5c9 AS |
9169 | } |
9170 | ||
4c4b4cd2 | 9171 | /* Evaluate the TYPE'VAL attribute applied to ARG. */ |
14f9c5c9 | 9172 | |
d2e4a39e AS |
9173 | static struct value * |
9174 | value_val_atr (struct type *type, struct value *arg) | |
14f9c5c9 | 9175 | { |
d2e4a39e | 9176 | if (!discrete_type_p (type)) |
323e0a4a | 9177 | error (_("'VAL only defined on discrete types")); |
df407dfe | 9178 | if (!integer_type_p (value_type (arg))) |
323e0a4a | 9179 | error (_("'VAL requires integral argument")); |
14f9c5c9 AS |
9180 | |
9181 | if (TYPE_CODE (type) == TYPE_CODE_ENUM) | |
9182 | { | |
9183 | long pos = value_as_long (arg); | |
5b4ee69b | 9184 | |
14f9c5c9 | 9185 | if (pos < 0 || pos >= TYPE_NFIELDS (type)) |
323e0a4a | 9186 | error (_("argument to 'VAL out of range")); |
14e75d8e | 9187 | return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos)); |
14f9c5c9 AS |
9188 | } |
9189 | else | |
9190 | return value_from_longest (type, value_as_long (arg)); | |
9191 | } | |
14f9c5c9 | 9192 | \f |
d2e4a39e | 9193 | |
4c4b4cd2 | 9194 | /* Evaluation */ |
14f9c5c9 | 9195 | |
4c4b4cd2 PH |
9196 | /* True if TYPE appears to be an Ada character type. |
9197 | [At the moment, this is true only for Character and Wide_Character; | |
9198 | It is a heuristic test that could stand improvement]. */ | |
14f9c5c9 | 9199 | |
d2e4a39e AS |
9200 | int |
9201 | ada_is_character_type (struct type *type) | |
14f9c5c9 | 9202 | { |
7b9f71f2 JB |
9203 | const char *name; |
9204 | ||
9205 | /* If the type code says it's a character, then assume it really is, | |
9206 | and don't check any further. */ | |
9207 | if (TYPE_CODE (type) == TYPE_CODE_CHAR) | |
9208 | return 1; | |
9209 | ||
9210 | /* Otherwise, assume it's a character type iff it is a discrete type | |
9211 | with a known character type name. */ | |
9212 | name = ada_type_name (type); | |
9213 | return (name != NULL | |
9214 | && (TYPE_CODE (type) == TYPE_CODE_INT | |
9215 | || TYPE_CODE (type) == TYPE_CODE_RANGE) | |
9216 | && (strcmp (name, "character") == 0 | |
9217 | || strcmp (name, "wide_character") == 0 | |
5a517ebd | 9218 | || strcmp (name, "wide_wide_character") == 0 |
7b9f71f2 | 9219 | || strcmp (name, "unsigned char") == 0)); |
14f9c5c9 AS |
9220 | } |
9221 | ||
4c4b4cd2 | 9222 | /* True if TYPE appears to be an Ada string type. */ |
14f9c5c9 AS |
9223 | |
9224 | int | |
ebf56fd3 | 9225 | ada_is_string_type (struct type *type) |
14f9c5c9 | 9226 | { |
61ee279c | 9227 | type = ada_check_typedef (type); |
d2e4a39e | 9228 | if (type != NULL |
14f9c5c9 | 9229 | && TYPE_CODE (type) != TYPE_CODE_PTR |
76a01679 JB |
9230 | && (ada_is_simple_array_type (type) |
9231 | || ada_is_array_descriptor_type (type)) | |
14f9c5c9 AS |
9232 | && ada_array_arity (type) == 1) |
9233 | { | |
9234 | struct type *elttype = ada_array_element_type (type, 1); | |
9235 | ||
9236 | return ada_is_character_type (elttype); | |
9237 | } | |
d2e4a39e | 9238 | else |
14f9c5c9 AS |
9239 | return 0; |
9240 | } | |
9241 | ||
5bf03f13 JB |
9242 | /* The compiler sometimes provides a parallel XVS type for a given |
9243 | PAD type. Normally, it is safe to follow the PAD type directly, | |
9244 | but older versions of the compiler have a bug that causes the offset | |
9245 | of its "F" field to be wrong. Following that field in that case | |
9246 | would lead to incorrect results, but this can be worked around | |
9247 | by ignoring the PAD type and using the associated XVS type instead. | |
9248 | ||
9249 | Set to True if the debugger should trust the contents of PAD types. | |
9250 | Otherwise, ignore the PAD type if there is a parallel XVS type. */ | |
9251 | static int trust_pad_over_xvs = 1; | |
14f9c5c9 AS |
9252 | |
9253 | /* True if TYPE is a struct type introduced by the compiler to force the | |
9254 | alignment of a value. Such types have a single field with a | |
4c4b4cd2 | 9255 | distinctive name. */ |
14f9c5c9 AS |
9256 | |
9257 | int | |
ebf56fd3 | 9258 | ada_is_aligner_type (struct type *type) |
14f9c5c9 | 9259 | { |
61ee279c | 9260 | type = ada_check_typedef (type); |
714e53ab | 9261 | |
5bf03f13 | 9262 | if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL) |
714e53ab PH |
9263 | return 0; |
9264 | ||
14f9c5c9 | 9265 | return (TYPE_CODE (type) == TYPE_CODE_STRUCT |
4c4b4cd2 PH |
9266 | && TYPE_NFIELDS (type) == 1 |
9267 | && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0); | |
14f9c5c9 AS |
9268 | } |
9269 | ||
9270 | /* If there is an ___XVS-convention type parallel to SUBTYPE, return | |
4c4b4cd2 | 9271 | the parallel type. */ |
14f9c5c9 | 9272 | |
d2e4a39e AS |
9273 | struct type * |
9274 | ada_get_base_type (struct type *raw_type) | |
14f9c5c9 | 9275 | { |
d2e4a39e AS |
9276 | struct type *real_type_namer; |
9277 | struct type *raw_real_type; | |
14f9c5c9 AS |
9278 | |
9279 | if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT) | |
9280 | return raw_type; | |
9281 | ||
284614f0 JB |
9282 | if (ada_is_aligner_type (raw_type)) |
9283 | /* The encoding specifies that we should always use the aligner type. | |
9284 | So, even if this aligner type has an associated XVS type, we should | |
9285 | simply ignore it. | |
9286 | ||
9287 | According to the compiler gurus, an XVS type parallel to an aligner | |
9288 | type may exist because of a stabs limitation. In stabs, aligner | |
9289 | types are empty because the field has a variable-sized type, and | |
9290 | thus cannot actually be used as an aligner type. As a result, | |
9291 | we need the associated parallel XVS type to decode the type. | |
9292 | Since the policy in the compiler is to not change the internal | |
9293 | representation based on the debugging info format, we sometimes | |
9294 | end up having a redundant XVS type parallel to the aligner type. */ | |
9295 | return raw_type; | |
9296 | ||
14f9c5c9 | 9297 | real_type_namer = ada_find_parallel_type (raw_type, "___XVS"); |
d2e4a39e | 9298 | if (real_type_namer == NULL |
14f9c5c9 AS |
9299 | || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT |
9300 | || TYPE_NFIELDS (real_type_namer) != 1) | |
9301 | return raw_type; | |
9302 | ||
f80d3ff2 JB |
9303 | if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF) |
9304 | { | |
9305 | /* This is an older encoding form where the base type needs to be | |
9306 | looked up by name. We prefer the newer enconding because it is | |
9307 | more efficient. */ | |
9308 | raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0)); | |
9309 | if (raw_real_type == NULL) | |
9310 | return raw_type; | |
9311 | else | |
9312 | return raw_real_type; | |
9313 | } | |
9314 | ||
9315 | /* The field in our XVS type is a reference to the base type. */ | |
9316 | return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0)); | |
d2e4a39e | 9317 | } |
14f9c5c9 | 9318 | |
4c4b4cd2 | 9319 | /* The type of value designated by TYPE, with all aligners removed. */ |
14f9c5c9 | 9320 | |
d2e4a39e AS |
9321 | struct type * |
9322 | ada_aligned_type (struct type *type) | |
14f9c5c9 AS |
9323 | { |
9324 | if (ada_is_aligner_type (type)) | |
9325 | return ada_aligned_type (TYPE_FIELD_TYPE (type, 0)); | |
9326 | else | |
9327 | return ada_get_base_type (type); | |
9328 | } | |
9329 | ||
9330 | ||
9331 | /* The address of the aligned value in an object at address VALADDR | |
4c4b4cd2 | 9332 | having type TYPE. Assumes ada_is_aligner_type (TYPE). */ |
14f9c5c9 | 9333 | |
fc1a4b47 AC |
9334 | const gdb_byte * |
9335 | ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr) | |
14f9c5c9 | 9336 | { |
d2e4a39e | 9337 | if (ada_is_aligner_type (type)) |
14f9c5c9 | 9338 | return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0), |
4c4b4cd2 PH |
9339 | valaddr + |
9340 | TYPE_FIELD_BITPOS (type, | |
9341 | 0) / TARGET_CHAR_BIT); | |
14f9c5c9 AS |
9342 | else |
9343 | return valaddr; | |
9344 | } | |
9345 | ||
4c4b4cd2 PH |
9346 | |
9347 | ||
14f9c5c9 | 9348 | /* The printed representation of an enumeration literal with encoded |
4c4b4cd2 | 9349 | name NAME. The value is good to the next call of ada_enum_name. */ |
d2e4a39e AS |
9350 | const char * |
9351 | ada_enum_name (const char *name) | |
14f9c5c9 | 9352 | { |
4c4b4cd2 PH |
9353 | static char *result; |
9354 | static size_t result_len = 0; | |
d2e4a39e | 9355 | char *tmp; |
14f9c5c9 | 9356 | |
4c4b4cd2 PH |
9357 | /* First, unqualify the enumeration name: |
9358 | 1. Search for the last '.' character. If we find one, then skip | |
177b42fe | 9359 | all the preceding characters, the unqualified name starts |
76a01679 | 9360 | right after that dot. |
4c4b4cd2 | 9361 | 2. Otherwise, we may be debugging on a target where the compiler |
76a01679 JB |
9362 | translates dots into "__". Search forward for double underscores, |
9363 | but stop searching when we hit an overloading suffix, which is | |
9364 | of the form "__" followed by digits. */ | |
4c4b4cd2 | 9365 | |
c3e5cd34 PH |
9366 | tmp = strrchr (name, '.'); |
9367 | if (tmp != NULL) | |
4c4b4cd2 PH |
9368 | name = tmp + 1; |
9369 | else | |
14f9c5c9 | 9370 | { |
4c4b4cd2 PH |
9371 | while ((tmp = strstr (name, "__")) != NULL) |
9372 | { | |
9373 | if (isdigit (tmp[2])) | |
9374 | break; | |
9375 | else | |
9376 | name = tmp + 2; | |
9377 | } | |
14f9c5c9 AS |
9378 | } |
9379 | ||
9380 | if (name[0] == 'Q') | |
9381 | { | |
14f9c5c9 | 9382 | int v; |
5b4ee69b | 9383 | |
14f9c5c9 | 9384 | if (name[1] == 'U' || name[1] == 'W') |
4c4b4cd2 PH |
9385 | { |
9386 | if (sscanf (name + 2, "%x", &v) != 1) | |
9387 | return name; | |
9388 | } | |
14f9c5c9 | 9389 | else |
4c4b4cd2 | 9390 | return name; |
14f9c5c9 | 9391 | |
4c4b4cd2 | 9392 | GROW_VECT (result, result_len, 16); |
14f9c5c9 | 9393 | if (isascii (v) && isprint (v)) |
88c15c34 | 9394 | xsnprintf (result, result_len, "'%c'", v); |
14f9c5c9 | 9395 | else if (name[1] == 'U') |
88c15c34 | 9396 | xsnprintf (result, result_len, "[\"%02x\"]", v); |
14f9c5c9 | 9397 | else |
88c15c34 | 9398 | xsnprintf (result, result_len, "[\"%04x\"]", v); |
14f9c5c9 AS |
9399 | |
9400 | return result; | |
9401 | } | |
d2e4a39e | 9402 | else |
4c4b4cd2 | 9403 | { |
c3e5cd34 PH |
9404 | tmp = strstr (name, "__"); |
9405 | if (tmp == NULL) | |
9406 | tmp = strstr (name, "$"); | |
9407 | if (tmp != NULL) | |
4c4b4cd2 PH |
9408 | { |
9409 | GROW_VECT (result, result_len, tmp - name + 1); | |
9410 | strncpy (result, name, tmp - name); | |
9411 | result[tmp - name] = '\0'; | |
9412 | return result; | |
9413 | } | |
9414 | ||
9415 | return name; | |
9416 | } | |
14f9c5c9 AS |
9417 | } |
9418 | ||
14f9c5c9 AS |
9419 | /* Evaluate the subexpression of EXP starting at *POS as for |
9420 | evaluate_type, updating *POS to point just past the evaluated | |
4c4b4cd2 | 9421 | expression. */ |
14f9c5c9 | 9422 | |
d2e4a39e AS |
9423 | static struct value * |
9424 | evaluate_subexp_type (struct expression *exp, int *pos) | |
14f9c5c9 | 9425 | { |
4b27a620 | 9426 | return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); |
14f9c5c9 AS |
9427 | } |
9428 | ||
9429 | /* If VAL is wrapped in an aligner or subtype wrapper, return the | |
4c4b4cd2 | 9430 | value it wraps. */ |
14f9c5c9 | 9431 | |
d2e4a39e AS |
9432 | static struct value * |
9433 | unwrap_value (struct value *val) | |
14f9c5c9 | 9434 | { |
df407dfe | 9435 | struct type *type = ada_check_typedef (value_type (val)); |
5b4ee69b | 9436 | |
14f9c5c9 AS |
9437 | if (ada_is_aligner_type (type)) |
9438 | { | |
de4d072f | 9439 | struct value *v = ada_value_struct_elt (val, "F", 0); |
df407dfe | 9440 | struct type *val_type = ada_check_typedef (value_type (v)); |
5b4ee69b | 9441 | |
14f9c5c9 | 9442 | if (ada_type_name (val_type) == NULL) |
4c4b4cd2 | 9443 | TYPE_NAME (val_type) = ada_type_name (type); |
14f9c5c9 AS |
9444 | |
9445 | return unwrap_value (v); | |
9446 | } | |
d2e4a39e | 9447 | else |
14f9c5c9 | 9448 | { |
d2e4a39e | 9449 | struct type *raw_real_type = |
61ee279c | 9450 | ada_check_typedef (ada_get_base_type (type)); |
d2e4a39e | 9451 | |
5bf03f13 JB |
9452 | /* If there is no parallel XVS or XVE type, then the value is |
9453 | already unwrapped. Return it without further modification. */ | |
9454 | if ((type == raw_real_type) | |
9455 | && ada_find_parallel_type (type, "___XVE") == NULL) | |
9456 | return val; | |
14f9c5c9 | 9457 | |
d2e4a39e | 9458 | return |
4c4b4cd2 PH |
9459 | coerce_unspec_val_to_type |
9460 | (val, ada_to_fixed_type (raw_real_type, 0, | |
42ae5230 | 9461 | value_address (val), |
1ed6ede0 | 9462 | NULL, 1)); |
14f9c5c9 AS |
9463 | } |
9464 | } | |
d2e4a39e AS |
9465 | |
9466 | static struct value * | |
9467 | cast_to_fixed (struct type *type, struct value *arg) | |
14f9c5c9 AS |
9468 | { |
9469 | LONGEST val; | |
9470 | ||
df407dfe | 9471 | if (type == value_type (arg)) |
14f9c5c9 | 9472 | return arg; |
df407dfe | 9473 | else if (ada_is_fixed_point_type (value_type (arg))) |
d2e4a39e | 9474 | val = ada_float_to_fixed (type, |
df407dfe | 9475 | ada_fixed_to_float (value_type (arg), |
4c4b4cd2 | 9476 | value_as_long (arg))); |
d2e4a39e | 9477 | else |
14f9c5c9 | 9478 | { |
a53b7a21 | 9479 | DOUBLEST argd = value_as_double (arg); |
5b4ee69b | 9480 | |
14f9c5c9 AS |
9481 | val = ada_float_to_fixed (type, argd); |
9482 | } | |
9483 | ||
9484 | return value_from_longest (type, val); | |
9485 | } | |
9486 | ||
d2e4a39e | 9487 | static struct value * |
a53b7a21 | 9488 | cast_from_fixed (struct type *type, struct value *arg) |
14f9c5c9 | 9489 | { |
df407dfe | 9490 | DOUBLEST val = ada_fixed_to_float (value_type (arg), |
4c4b4cd2 | 9491 | value_as_long (arg)); |
5b4ee69b | 9492 | |
a53b7a21 | 9493 | return value_from_double (type, val); |
14f9c5c9 AS |
9494 | } |
9495 | ||
d99dcf51 JB |
9496 | /* Given two array types T1 and T2, return nonzero iff both arrays |
9497 | contain the same number of elements. */ | |
9498 | ||
9499 | static int | |
9500 | ada_same_array_size_p (struct type *t1, struct type *t2) | |
9501 | { | |
9502 | LONGEST lo1, hi1, lo2, hi2; | |
9503 | ||
9504 | /* Get the array bounds in order to verify that the size of | |
9505 | the two arrays match. */ | |
9506 | if (!get_array_bounds (t1, &lo1, &hi1) | |
9507 | || !get_array_bounds (t2, &lo2, &hi2)) | |
9508 | error (_("unable to determine array bounds")); | |
9509 | ||
9510 | /* To make things easier for size comparison, normalize a bit | |
9511 | the case of empty arrays by making sure that the difference | |
9512 | between upper bound and lower bound is always -1. */ | |
9513 | if (lo1 > hi1) | |
9514 | hi1 = lo1 - 1; | |
9515 | if (lo2 > hi2) | |
9516 | hi2 = lo2 - 1; | |
9517 | ||
9518 | return (hi1 - lo1 == hi2 - lo2); | |
9519 | } | |
9520 | ||
9521 | /* Assuming that VAL is an array of integrals, and TYPE represents | |
9522 | an array with the same number of elements, but with wider integral | |
9523 | elements, return an array "casted" to TYPE. In practice, this | |
9524 | means that the returned array is built by casting each element | |
9525 | of the original array into TYPE's (wider) element type. */ | |
9526 | ||
9527 | static struct value * | |
9528 | ada_promote_array_of_integrals (struct type *type, struct value *val) | |
9529 | { | |
9530 | struct type *elt_type = TYPE_TARGET_TYPE (type); | |
9531 | LONGEST lo, hi; | |
9532 | struct value *res; | |
9533 | LONGEST i; | |
9534 | ||
9535 | /* Verify that both val and type are arrays of scalars, and | |
9536 | that the size of val's elements is smaller than the size | |
9537 | of type's element. */ | |
9538 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY); | |
9539 | gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type))); | |
9540 | gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY); | |
9541 | gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val)))); | |
9542 | gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type)) | |
9543 | > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val)))); | |
9544 | ||
9545 | if (!get_array_bounds (type, &lo, &hi)) | |
9546 | error (_("unable to determine array bounds")); | |
9547 | ||
9548 | res = allocate_value (type); | |
9549 | ||
9550 | /* Promote each array element. */ | |
9551 | for (i = 0; i < hi - lo + 1; i++) | |
9552 | { | |
9553 | struct value *elt = value_cast (elt_type, value_subscript (val, lo + i)); | |
9554 | ||
9555 | memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)), | |
9556 | value_contents_all (elt), TYPE_LENGTH (elt_type)); | |
9557 | } | |
9558 | ||
9559 | return res; | |
9560 | } | |
9561 | ||
4c4b4cd2 PH |
9562 | /* Coerce VAL as necessary for assignment to an lval of type TYPE, and |
9563 | return the converted value. */ | |
9564 | ||
d2e4a39e AS |
9565 | static struct value * |
9566 | coerce_for_assign (struct type *type, struct value *val) | |
14f9c5c9 | 9567 | { |
df407dfe | 9568 | struct type *type2 = value_type (val); |
5b4ee69b | 9569 | |
14f9c5c9 AS |
9570 | if (type == type2) |
9571 | return val; | |
9572 | ||
61ee279c PH |
9573 | type2 = ada_check_typedef (type2); |
9574 | type = ada_check_typedef (type); | |
14f9c5c9 | 9575 | |
d2e4a39e AS |
9576 | if (TYPE_CODE (type2) == TYPE_CODE_PTR |
9577 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
14f9c5c9 AS |
9578 | { |
9579 | val = ada_value_ind (val); | |
df407dfe | 9580 | type2 = value_type (val); |
14f9c5c9 AS |
9581 | } |
9582 | ||
d2e4a39e | 9583 | if (TYPE_CODE (type2) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
9584 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) |
9585 | { | |
d99dcf51 JB |
9586 | if (!ada_same_array_size_p (type, type2)) |
9587 | error (_("cannot assign arrays of different length")); | |
9588 | ||
9589 | if (is_integral_type (TYPE_TARGET_TYPE (type)) | |
9590 | && is_integral_type (TYPE_TARGET_TYPE (type2)) | |
9591 | && TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
9592 | < TYPE_LENGTH (TYPE_TARGET_TYPE (type))) | |
9593 | { | |
9594 | /* Allow implicit promotion of the array elements to | |
9595 | a wider type. */ | |
9596 | return ada_promote_array_of_integrals (type, val); | |
9597 | } | |
9598 | ||
9599 | if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
9600 | != TYPE_LENGTH (TYPE_TARGET_TYPE (type))) | |
323e0a4a | 9601 | error (_("Incompatible types in assignment")); |
04624583 | 9602 | deprecated_set_value_type (val, type); |
14f9c5c9 | 9603 | } |
d2e4a39e | 9604 | return val; |
14f9c5c9 AS |
9605 | } |
9606 | ||
4c4b4cd2 PH |
9607 | static struct value * |
9608 | ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op) | |
9609 | { | |
9610 | struct value *val; | |
9611 | struct type *type1, *type2; | |
9612 | LONGEST v, v1, v2; | |
9613 | ||
994b9211 AC |
9614 | arg1 = coerce_ref (arg1); |
9615 | arg2 = coerce_ref (arg2); | |
18af8284 JB |
9616 | type1 = get_base_type (ada_check_typedef (value_type (arg1))); |
9617 | type2 = get_base_type (ada_check_typedef (value_type (arg2))); | |
4c4b4cd2 | 9618 | |
76a01679 JB |
9619 | if (TYPE_CODE (type1) != TYPE_CODE_INT |
9620 | || TYPE_CODE (type2) != TYPE_CODE_INT) | |
4c4b4cd2 PH |
9621 | return value_binop (arg1, arg2, op); |
9622 | ||
76a01679 | 9623 | switch (op) |
4c4b4cd2 PH |
9624 | { |
9625 | case BINOP_MOD: | |
9626 | case BINOP_DIV: | |
9627 | case BINOP_REM: | |
9628 | break; | |
9629 | default: | |
9630 | return value_binop (arg1, arg2, op); | |
9631 | } | |
9632 | ||
9633 | v2 = value_as_long (arg2); | |
9634 | if (v2 == 0) | |
323e0a4a | 9635 | error (_("second operand of %s must not be zero."), op_string (op)); |
4c4b4cd2 PH |
9636 | |
9637 | if (TYPE_UNSIGNED (type1) || op == BINOP_MOD) | |
9638 | return value_binop (arg1, arg2, op); | |
9639 | ||
9640 | v1 = value_as_long (arg1); | |
9641 | switch (op) | |
9642 | { | |
9643 | case BINOP_DIV: | |
9644 | v = v1 / v2; | |
76a01679 JB |
9645 | if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0) |
9646 | v += v > 0 ? -1 : 1; | |
4c4b4cd2 PH |
9647 | break; |
9648 | case BINOP_REM: | |
9649 | v = v1 % v2; | |
76a01679 JB |
9650 | if (v * v1 < 0) |
9651 | v -= v2; | |
4c4b4cd2 PH |
9652 | break; |
9653 | default: | |
9654 | /* Should not reach this point. */ | |
9655 | v = 0; | |
9656 | } | |
9657 | ||
9658 | val = allocate_value (type1); | |
990a07ab | 9659 | store_unsigned_integer (value_contents_raw (val), |
e17a4113 UW |
9660 | TYPE_LENGTH (value_type (val)), |
9661 | gdbarch_byte_order (get_type_arch (type1)), v); | |
4c4b4cd2 PH |
9662 | return val; |
9663 | } | |
9664 | ||
9665 | static int | |
9666 | ada_value_equal (struct value *arg1, struct value *arg2) | |
9667 | { | |
df407dfe AC |
9668 | if (ada_is_direct_array_type (value_type (arg1)) |
9669 | || ada_is_direct_array_type (value_type (arg2))) | |
4c4b4cd2 | 9670 | { |
f58b38bf JB |
9671 | /* Automatically dereference any array reference before |
9672 | we attempt to perform the comparison. */ | |
9673 | arg1 = ada_coerce_ref (arg1); | |
9674 | arg2 = ada_coerce_ref (arg2); | |
9675 | ||
4c4b4cd2 PH |
9676 | arg1 = ada_coerce_to_simple_array (arg1); |
9677 | arg2 = ada_coerce_to_simple_array (arg2); | |
df407dfe AC |
9678 | if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY |
9679 | || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY) | |
323e0a4a | 9680 | error (_("Attempt to compare array with non-array")); |
4c4b4cd2 | 9681 | /* FIXME: The following works only for types whose |
76a01679 JB |
9682 | representations use all bits (no padding or undefined bits) |
9683 | and do not have user-defined equality. */ | |
9684 | return | |
df407dfe | 9685 | TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2)) |
0fd88904 | 9686 | && memcmp (value_contents (arg1), value_contents (arg2), |
df407dfe | 9687 | TYPE_LENGTH (value_type (arg1))) == 0; |
4c4b4cd2 PH |
9688 | } |
9689 | return value_equal (arg1, arg2); | |
9690 | } | |
9691 | ||
52ce6436 PH |
9692 | /* Total number of component associations in the aggregate starting at |
9693 | index PC in EXP. Assumes that index PC is the start of an | |
0963b4bd | 9694 | OP_AGGREGATE. */ |
52ce6436 PH |
9695 | |
9696 | static int | |
9697 | num_component_specs (struct expression *exp, int pc) | |
9698 | { | |
9699 | int n, m, i; | |
5b4ee69b | 9700 | |
52ce6436 PH |
9701 | m = exp->elts[pc + 1].longconst; |
9702 | pc += 3; | |
9703 | n = 0; | |
9704 | for (i = 0; i < m; i += 1) | |
9705 | { | |
9706 | switch (exp->elts[pc].opcode) | |
9707 | { | |
9708 | default: | |
9709 | n += 1; | |
9710 | break; | |
9711 | case OP_CHOICES: | |
9712 | n += exp->elts[pc + 1].longconst; | |
9713 | break; | |
9714 | } | |
9715 | ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP); | |
9716 | } | |
9717 | return n; | |
9718 | } | |
9719 | ||
9720 | /* Assign the result of evaluating EXP starting at *POS to the INDEXth | |
9721 | component of LHS (a simple array or a record), updating *POS past | |
9722 | the expression, assuming that LHS is contained in CONTAINER. Does | |
9723 | not modify the inferior's memory, nor does it modify LHS (unless | |
9724 | LHS == CONTAINER). */ | |
9725 | ||
9726 | static void | |
9727 | assign_component (struct value *container, struct value *lhs, LONGEST index, | |
9728 | struct expression *exp, int *pos) | |
9729 | { | |
9730 | struct value *mark = value_mark (); | |
9731 | struct value *elt; | |
5b4ee69b | 9732 | |
52ce6436 PH |
9733 | if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY) |
9734 | { | |
22601c15 UW |
9735 | struct type *index_type = builtin_type (exp->gdbarch)->builtin_int; |
9736 | struct value *index_val = value_from_longest (index_type, index); | |
5b4ee69b | 9737 | |
52ce6436 PH |
9738 | elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val)); |
9739 | } | |
9740 | else | |
9741 | { | |
9742 | elt = ada_index_struct_field (index, lhs, 0, value_type (lhs)); | |
c48db5ca | 9743 | elt = ada_to_fixed_value (elt); |
52ce6436 PH |
9744 | } |
9745 | ||
9746 | if (exp->elts[*pos].opcode == OP_AGGREGATE) | |
9747 | assign_aggregate (container, elt, exp, pos, EVAL_NORMAL); | |
9748 | else | |
9749 | value_assign_to_component (container, elt, | |
9750 | ada_evaluate_subexp (NULL, exp, pos, | |
9751 | EVAL_NORMAL)); | |
9752 | ||
9753 | value_free_to_mark (mark); | |
9754 | } | |
9755 | ||
9756 | /* Assuming that LHS represents an lvalue having a record or array | |
9757 | type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment | |
9758 | of that aggregate's value to LHS, advancing *POS past the | |
9759 | aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an | |
9760 | lvalue containing LHS (possibly LHS itself). Does not modify | |
9761 | the inferior's memory, nor does it modify the contents of | |
0963b4bd | 9762 | LHS (unless == CONTAINER). Returns the modified CONTAINER. */ |
52ce6436 PH |
9763 | |
9764 | static struct value * | |
9765 | assign_aggregate (struct value *container, | |
9766 | struct value *lhs, struct expression *exp, | |
9767 | int *pos, enum noside noside) | |
9768 | { | |
9769 | struct type *lhs_type; | |
9770 | int n = exp->elts[*pos+1].longconst; | |
9771 | LONGEST low_index, high_index; | |
9772 | int num_specs; | |
9773 | LONGEST *indices; | |
9774 | int max_indices, num_indices; | |
52ce6436 | 9775 | int i; |
52ce6436 PH |
9776 | |
9777 | *pos += 3; | |
9778 | if (noside != EVAL_NORMAL) | |
9779 | { | |
52ce6436 PH |
9780 | for (i = 0; i < n; i += 1) |
9781 | ada_evaluate_subexp (NULL, exp, pos, noside); | |
9782 | return container; | |
9783 | } | |
9784 | ||
9785 | container = ada_coerce_ref (container); | |
9786 | if (ada_is_direct_array_type (value_type (container))) | |
9787 | container = ada_coerce_to_simple_array (container); | |
9788 | lhs = ada_coerce_ref (lhs); | |
9789 | if (!deprecated_value_modifiable (lhs)) | |
9790 | error (_("Left operand of assignment is not a modifiable lvalue.")); | |
9791 | ||
9792 | lhs_type = value_type (lhs); | |
9793 | if (ada_is_direct_array_type (lhs_type)) | |
9794 | { | |
9795 | lhs = ada_coerce_to_simple_array (lhs); | |
9796 | lhs_type = value_type (lhs); | |
9797 | low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type); | |
9798 | high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type); | |
52ce6436 PH |
9799 | } |
9800 | else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT) | |
9801 | { | |
9802 | low_index = 0; | |
9803 | high_index = num_visible_fields (lhs_type) - 1; | |
52ce6436 PH |
9804 | } |
9805 | else | |
9806 | error (_("Left-hand side must be array or record.")); | |
9807 | ||
9808 | num_specs = num_component_specs (exp, *pos - 3); | |
9809 | max_indices = 4 * num_specs + 4; | |
8d749320 | 9810 | indices = XALLOCAVEC (LONGEST, max_indices); |
52ce6436 PH |
9811 | indices[0] = indices[1] = low_index - 1; |
9812 | indices[2] = indices[3] = high_index + 1; | |
9813 | num_indices = 4; | |
9814 | ||
9815 | for (i = 0; i < n; i += 1) | |
9816 | { | |
9817 | switch (exp->elts[*pos].opcode) | |
9818 | { | |
1fbf5ada JB |
9819 | case OP_CHOICES: |
9820 | aggregate_assign_from_choices (container, lhs, exp, pos, indices, | |
9821 | &num_indices, max_indices, | |
9822 | low_index, high_index); | |
9823 | break; | |
9824 | case OP_POSITIONAL: | |
9825 | aggregate_assign_positional (container, lhs, exp, pos, indices, | |
52ce6436 PH |
9826 | &num_indices, max_indices, |
9827 | low_index, high_index); | |
1fbf5ada JB |
9828 | break; |
9829 | case OP_OTHERS: | |
9830 | if (i != n-1) | |
9831 | error (_("Misplaced 'others' clause")); | |
9832 | aggregate_assign_others (container, lhs, exp, pos, indices, | |
9833 | num_indices, low_index, high_index); | |
9834 | break; | |
9835 | default: | |
9836 | error (_("Internal error: bad aggregate clause")); | |
52ce6436 PH |
9837 | } |
9838 | } | |
9839 | ||
9840 | return container; | |
9841 | } | |
9842 | ||
9843 | /* Assign into the component of LHS indexed by the OP_POSITIONAL | |
9844 | construct at *POS, updating *POS past the construct, given that | |
9845 | the positions are relative to lower bound LOW, where HIGH is the | |
9846 | upper bound. Record the position in INDICES[0 .. MAX_INDICES-1] | |
9847 | updating *NUM_INDICES as needed. CONTAINER is as for | |
0963b4bd | 9848 | assign_aggregate. */ |
52ce6436 PH |
9849 | static void |
9850 | aggregate_assign_positional (struct value *container, | |
9851 | struct value *lhs, struct expression *exp, | |
9852 | int *pos, LONGEST *indices, int *num_indices, | |
9853 | int max_indices, LONGEST low, LONGEST high) | |
9854 | { | |
9855 | LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low; | |
9856 | ||
9857 | if (ind - 1 == high) | |
e1d5a0d2 | 9858 | warning (_("Extra components in aggregate ignored.")); |
52ce6436 PH |
9859 | if (ind <= high) |
9860 | { | |
9861 | add_component_interval (ind, ind, indices, num_indices, max_indices); | |
9862 | *pos += 3; | |
9863 | assign_component (container, lhs, ind, exp, pos); | |
9864 | } | |
9865 | else | |
9866 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
9867 | } | |
9868 | ||
9869 | /* Assign into the components of LHS indexed by the OP_CHOICES | |
9870 | construct at *POS, updating *POS past the construct, given that | |
9871 | the allowable indices are LOW..HIGH. Record the indices assigned | |
9872 | to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as | |
0963b4bd | 9873 | needed. CONTAINER is as for assign_aggregate. */ |
52ce6436 PH |
9874 | static void |
9875 | aggregate_assign_from_choices (struct value *container, | |
9876 | struct value *lhs, struct expression *exp, | |
9877 | int *pos, LONGEST *indices, int *num_indices, | |
9878 | int max_indices, LONGEST low, LONGEST high) | |
9879 | { | |
9880 | int j; | |
9881 | int n_choices = longest_to_int (exp->elts[*pos+1].longconst); | |
9882 | int choice_pos, expr_pc; | |
9883 | int is_array = ada_is_direct_array_type (value_type (lhs)); | |
9884 | ||
9885 | choice_pos = *pos += 3; | |
9886 | ||
9887 | for (j = 0; j < n_choices; j += 1) | |
9888 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
9889 | expr_pc = *pos; | |
9890 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
9891 | ||
9892 | for (j = 0; j < n_choices; j += 1) | |
9893 | { | |
9894 | LONGEST lower, upper; | |
9895 | enum exp_opcode op = exp->elts[choice_pos].opcode; | |
5b4ee69b | 9896 | |
52ce6436 PH |
9897 | if (op == OP_DISCRETE_RANGE) |
9898 | { | |
9899 | choice_pos += 1; | |
9900 | lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos, | |
9901 | EVAL_NORMAL)); | |
9902 | upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos, | |
9903 | EVAL_NORMAL)); | |
9904 | } | |
9905 | else if (is_array) | |
9906 | { | |
9907 | lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos, | |
9908 | EVAL_NORMAL)); | |
9909 | upper = lower; | |
9910 | } | |
9911 | else | |
9912 | { | |
9913 | int ind; | |
0d5cff50 | 9914 | const char *name; |
5b4ee69b | 9915 | |
52ce6436 PH |
9916 | switch (op) |
9917 | { | |
9918 | case OP_NAME: | |
9919 | name = &exp->elts[choice_pos + 2].string; | |
9920 | break; | |
9921 | case OP_VAR_VALUE: | |
9922 | name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol); | |
9923 | break; | |
9924 | default: | |
9925 | error (_("Invalid record component association.")); | |
9926 | } | |
9927 | ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP); | |
9928 | ind = 0; | |
9929 | if (! find_struct_field (name, value_type (lhs), 0, | |
9930 | NULL, NULL, NULL, NULL, &ind)) | |
9931 | error (_("Unknown component name: %s."), name); | |
9932 | lower = upper = ind; | |
9933 | } | |
9934 | ||
9935 | if (lower <= upper && (lower < low || upper > high)) | |
9936 | error (_("Index in component association out of bounds.")); | |
9937 | ||
9938 | add_component_interval (lower, upper, indices, num_indices, | |
9939 | max_indices); | |
9940 | while (lower <= upper) | |
9941 | { | |
9942 | int pos1; | |
5b4ee69b | 9943 | |
52ce6436 PH |
9944 | pos1 = expr_pc; |
9945 | assign_component (container, lhs, lower, exp, &pos1); | |
9946 | lower += 1; | |
9947 | } | |
9948 | } | |
9949 | } | |
9950 | ||
9951 | /* Assign the value of the expression in the OP_OTHERS construct in | |
9952 | EXP at *POS into the components of LHS indexed from LOW .. HIGH that | |
9953 | have not been previously assigned. The index intervals already assigned | |
9954 | are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the | |
0963b4bd | 9955 | OP_OTHERS clause. CONTAINER is as for assign_aggregate. */ |
52ce6436 PH |
9956 | static void |
9957 | aggregate_assign_others (struct value *container, | |
9958 | struct value *lhs, struct expression *exp, | |
9959 | int *pos, LONGEST *indices, int num_indices, | |
9960 | LONGEST low, LONGEST high) | |
9961 | { | |
9962 | int i; | |
5ce64950 | 9963 | int expr_pc = *pos + 1; |
52ce6436 PH |
9964 | |
9965 | for (i = 0; i < num_indices - 2; i += 2) | |
9966 | { | |
9967 | LONGEST ind; | |
5b4ee69b | 9968 | |
52ce6436 PH |
9969 | for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1) |
9970 | { | |
5ce64950 | 9971 | int localpos; |
5b4ee69b | 9972 | |
5ce64950 MS |
9973 | localpos = expr_pc; |
9974 | assign_component (container, lhs, ind, exp, &localpos); | |
52ce6436 PH |
9975 | } |
9976 | } | |
9977 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
9978 | } | |
9979 | ||
9980 | /* Add the interval [LOW .. HIGH] to the sorted set of intervals | |
9981 | [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ], | |
9982 | modifying *SIZE as needed. It is an error if *SIZE exceeds | |
9983 | MAX_SIZE. The resulting intervals do not overlap. */ | |
9984 | static void | |
9985 | add_component_interval (LONGEST low, LONGEST high, | |
9986 | LONGEST* indices, int *size, int max_size) | |
9987 | { | |
9988 | int i, j; | |
5b4ee69b | 9989 | |
52ce6436 PH |
9990 | for (i = 0; i < *size; i += 2) { |
9991 | if (high >= indices[i] && low <= indices[i + 1]) | |
9992 | { | |
9993 | int kh; | |
5b4ee69b | 9994 | |
52ce6436 PH |
9995 | for (kh = i + 2; kh < *size; kh += 2) |
9996 | if (high < indices[kh]) | |
9997 | break; | |
9998 | if (low < indices[i]) | |
9999 | indices[i] = low; | |
10000 | indices[i + 1] = indices[kh - 1]; | |
10001 | if (high > indices[i + 1]) | |
10002 | indices[i + 1] = high; | |
10003 | memcpy (indices + i + 2, indices + kh, *size - kh); | |
10004 | *size -= kh - i - 2; | |
10005 | return; | |
10006 | } | |
10007 | else if (high < indices[i]) | |
10008 | break; | |
10009 | } | |
10010 | ||
10011 | if (*size == max_size) | |
10012 | error (_("Internal error: miscounted aggregate components.")); | |
10013 | *size += 2; | |
10014 | for (j = *size-1; j >= i+2; j -= 1) | |
10015 | indices[j] = indices[j - 2]; | |
10016 | indices[i] = low; | |
10017 | indices[i + 1] = high; | |
10018 | } | |
10019 | ||
6e48bd2c JB |
10020 | /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2 |
10021 | is different. */ | |
10022 | ||
10023 | static struct value * | |
10024 | ada_value_cast (struct type *type, struct value *arg2, enum noside noside) | |
10025 | { | |
10026 | if (type == ada_check_typedef (value_type (arg2))) | |
10027 | return arg2; | |
10028 | ||
10029 | if (ada_is_fixed_point_type (type)) | |
10030 | return (cast_to_fixed (type, arg2)); | |
10031 | ||
10032 | if (ada_is_fixed_point_type (value_type (arg2))) | |
a53b7a21 | 10033 | return cast_from_fixed (type, arg2); |
6e48bd2c JB |
10034 | |
10035 | return value_cast (type, arg2); | |
10036 | } | |
10037 | ||
284614f0 JB |
10038 | /* Evaluating Ada expressions, and printing their result. |
10039 | ------------------------------------------------------ | |
10040 | ||
21649b50 JB |
10041 | 1. Introduction: |
10042 | ---------------- | |
10043 | ||
284614f0 JB |
10044 | We usually evaluate an Ada expression in order to print its value. |
10045 | We also evaluate an expression in order to print its type, which | |
10046 | happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation, | |
10047 | but we'll focus mostly on the EVAL_NORMAL phase. In practice, the | |
10048 | EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of | |
10049 | the evaluation compared to the EVAL_NORMAL, but is otherwise very | |
10050 | similar. | |
10051 | ||
10052 | Evaluating expressions is a little more complicated for Ada entities | |
10053 | than it is for entities in languages such as C. The main reason for | |
10054 | this is that Ada provides types whose definition might be dynamic. | |
10055 | One example of such types is variant records. Or another example | |
10056 | would be an array whose bounds can only be known at run time. | |
10057 | ||
10058 | The following description is a general guide as to what should be | |
10059 | done (and what should NOT be done) in order to evaluate an expression | |
10060 | involving such types, and when. This does not cover how the semantic | |
10061 | information is encoded by GNAT as this is covered separatly. For the | |
10062 | document used as the reference for the GNAT encoding, see exp_dbug.ads | |
10063 | in the GNAT sources. | |
10064 | ||
10065 | Ideally, we should embed each part of this description next to its | |
10066 | associated code. Unfortunately, the amount of code is so vast right | |
10067 | now that it's hard to see whether the code handling a particular | |
10068 | situation might be duplicated or not. One day, when the code is | |
10069 | cleaned up, this guide might become redundant with the comments | |
10070 | inserted in the code, and we might want to remove it. | |
10071 | ||
21649b50 JB |
10072 | 2. ``Fixing'' an Entity, the Simple Case: |
10073 | ----------------------------------------- | |
10074 | ||
284614f0 JB |
10075 | When evaluating Ada expressions, the tricky issue is that they may |
10076 | reference entities whose type contents and size are not statically | |
10077 | known. Consider for instance a variant record: | |
10078 | ||
10079 | type Rec (Empty : Boolean := True) is record | |
10080 | case Empty is | |
10081 | when True => null; | |
10082 | when False => Value : Integer; | |
10083 | end case; | |
10084 | end record; | |
10085 | Yes : Rec := (Empty => False, Value => 1); | |
10086 | No : Rec := (empty => True); | |
10087 | ||
10088 | The size and contents of that record depends on the value of the | |
10089 | descriminant (Rec.Empty). At this point, neither the debugging | |
10090 | information nor the associated type structure in GDB are able to | |
10091 | express such dynamic types. So what the debugger does is to create | |
10092 | "fixed" versions of the type that applies to the specific object. | |
10093 | We also informally refer to this opperation as "fixing" an object, | |
10094 | which means creating its associated fixed type. | |
10095 | ||
10096 | Example: when printing the value of variable "Yes" above, its fixed | |
10097 | type would look like this: | |
10098 | ||
10099 | type Rec is record | |
10100 | Empty : Boolean; | |
10101 | Value : Integer; | |
10102 | end record; | |
10103 | ||
10104 | On the other hand, if we printed the value of "No", its fixed type | |
10105 | would become: | |
10106 | ||
10107 | type Rec is record | |
10108 | Empty : Boolean; | |
10109 | end record; | |
10110 | ||
10111 | Things become a little more complicated when trying to fix an entity | |
10112 | with a dynamic type that directly contains another dynamic type, | |
10113 | such as an array of variant records, for instance. There are | |
10114 | two possible cases: Arrays, and records. | |
10115 | ||
21649b50 JB |
10116 | 3. ``Fixing'' Arrays: |
10117 | --------------------- | |
10118 | ||
10119 | The type structure in GDB describes an array in terms of its bounds, | |
10120 | and the type of its elements. By design, all elements in the array | |
10121 | have the same type and we cannot represent an array of variant elements | |
10122 | using the current type structure in GDB. When fixing an array, | |
10123 | we cannot fix the array element, as we would potentially need one | |
10124 | fixed type per element of the array. As a result, the best we can do | |
10125 | when fixing an array is to produce an array whose bounds and size | |
10126 | are correct (allowing us to read it from memory), but without having | |
10127 | touched its element type. Fixing each element will be done later, | |
10128 | when (if) necessary. | |
10129 | ||
10130 | Arrays are a little simpler to handle than records, because the same | |
10131 | amount of memory is allocated for each element of the array, even if | |
1b536f04 | 10132 | the amount of space actually used by each element differs from element |
21649b50 | 10133 | to element. Consider for instance the following array of type Rec: |
284614f0 JB |
10134 | |
10135 | type Rec_Array is array (1 .. 2) of Rec; | |
10136 | ||
1b536f04 JB |
10137 | The actual amount of memory occupied by each element might be different |
10138 | from element to element, depending on the value of their discriminant. | |
21649b50 | 10139 | But the amount of space reserved for each element in the array remains |
1b536f04 | 10140 | fixed regardless. So we simply need to compute that size using |
21649b50 JB |
10141 | the debugging information available, from which we can then determine |
10142 | the array size (we multiply the number of elements of the array by | |
10143 | the size of each element). | |
10144 | ||
10145 | The simplest case is when we have an array of a constrained element | |
10146 | type. For instance, consider the following type declarations: | |
10147 | ||
10148 | type Bounded_String (Max_Size : Integer) is | |
10149 | Length : Integer; | |
10150 | Buffer : String (1 .. Max_Size); | |
10151 | end record; | |
10152 | type Bounded_String_Array is array (1 ..2) of Bounded_String (80); | |
10153 | ||
10154 | In this case, the compiler describes the array as an array of | |
10155 | variable-size elements (identified by its XVS suffix) for which | |
10156 | the size can be read in the parallel XVZ variable. | |
10157 | ||
10158 | In the case of an array of an unconstrained element type, the compiler | |
10159 | wraps the array element inside a private PAD type. This type should not | |
10160 | be shown to the user, and must be "unwrap"'ed before printing. Note | |
284614f0 JB |
10161 | that we also use the adjective "aligner" in our code to designate |
10162 | these wrapper types. | |
10163 | ||
1b536f04 | 10164 | In some cases, the size allocated for each element is statically |
21649b50 JB |
10165 | known. In that case, the PAD type already has the correct size, |
10166 | and the array element should remain unfixed. | |
10167 | ||
10168 | But there are cases when this size is not statically known. | |
10169 | For instance, assuming that "Five" is an integer variable: | |
284614f0 JB |
10170 | |
10171 | type Dynamic is array (1 .. Five) of Integer; | |
10172 | type Wrapper (Has_Length : Boolean := False) is record | |
10173 | Data : Dynamic; | |
10174 | case Has_Length is | |
10175 | when True => Length : Integer; | |
10176 | when False => null; | |
10177 | end case; | |
10178 | end record; | |
10179 | type Wrapper_Array is array (1 .. 2) of Wrapper; | |
10180 | ||
10181 | Hello : Wrapper_Array := (others => (Has_Length => True, | |
10182 | Data => (others => 17), | |
10183 | Length => 1)); | |
10184 | ||
10185 | ||
10186 | The debugging info would describe variable Hello as being an | |
10187 | array of a PAD type. The size of that PAD type is not statically | |
10188 | known, but can be determined using a parallel XVZ variable. | |
10189 | In that case, a copy of the PAD type with the correct size should | |
10190 | be used for the fixed array. | |
10191 | ||
21649b50 JB |
10192 | 3. ``Fixing'' record type objects: |
10193 | ---------------------------------- | |
10194 | ||
10195 | Things are slightly different from arrays in the case of dynamic | |
284614f0 JB |
10196 | record types. In this case, in order to compute the associated |
10197 | fixed type, we need to determine the size and offset of each of | |
10198 | its components. This, in turn, requires us to compute the fixed | |
10199 | type of each of these components. | |
10200 | ||
10201 | Consider for instance the example: | |
10202 | ||
10203 | type Bounded_String (Max_Size : Natural) is record | |
10204 | Str : String (1 .. Max_Size); | |
10205 | Length : Natural; | |
10206 | end record; | |
10207 | My_String : Bounded_String (Max_Size => 10); | |
10208 | ||
10209 | In that case, the position of field "Length" depends on the size | |
10210 | of field Str, which itself depends on the value of the Max_Size | |
21649b50 | 10211 | discriminant. In order to fix the type of variable My_String, |
284614f0 JB |
10212 | we need to fix the type of field Str. Therefore, fixing a variant |
10213 | record requires us to fix each of its components. | |
10214 | ||
10215 | However, if a component does not have a dynamic size, the component | |
10216 | should not be fixed. In particular, fields that use a PAD type | |
10217 | should not fixed. Here is an example where this might happen | |
10218 | (assuming type Rec above): | |
10219 | ||
10220 | type Container (Big : Boolean) is record | |
10221 | First : Rec; | |
10222 | After : Integer; | |
10223 | case Big is | |
10224 | when True => Another : Integer; | |
10225 | when False => null; | |
10226 | end case; | |
10227 | end record; | |
10228 | My_Container : Container := (Big => False, | |
10229 | First => (Empty => True), | |
10230 | After => 42); | |
10231 | ||
10232 | In that example, the compiler creates a PAD type for component First, | |
10233 | whose size is constant, and then positions the component After just | |
10234 | right after it. The offset of component After is therefore constant | |
10235 | in this case. | |
10236 | ||
10237 | The debugger computes the position of each field based on an algorithm | |
10238 | that uses, among other things, the actual position and size of the field | |
21649b50 JB |
10239 | preceding it. Let's now imagine that the user is trying to print |
10240 | the value of My_Container. If the type fixing was recursive, we would | |
284614f0 JB |
10241 | end up computing the offset of field After based on the size of the |
10242 | fixed version of field First. And since in our example First has | |
10243 | only one actual field, the size of the fixed type is actually smaller | |
10244 | than the amount of space allocated to that field, and thus we would | |
10245 | compute the wrong offset of field After. | |
10246 | ||
21649b50 JB |
10247 | To make things more complicated, we need to watch out for dynamic |
10248 | components of variant records (identified by the ___XVL suffix in | |
10249 | the component name). Even if the target type is a PAD type, the size | |
10250 | of that type might not be statically known. So the PAD type needs | |
10251 | to be unwrapped and the resulting type needs to be fixed. Otherwise, | |
10252 | we might end up with the wrong size for our component. This can be | |
10253 | observed with the following type declarations: | |
284614f0 JB |
10254 | |
10255 | type Octal is new Integer range 0 .. 7; | |
10256 | type Octal_Array is array (Positive range <>) of Octal; | |
10257 | pragma Pack (Octal_Array); | |
10258 | ||
10259 | type Octal_Buffer (Size : Positive) is record | |
10260 | Buffer : Octal_Array (1 .. Size); | |
10261 | Length : Integer; | |
10262 | end record; | |
10263 | ||
10264 | In that case, Buffer is a PAD type whose size is unset and needs | |
10265 | to be computed by fixing the unwrapped type. | |
10266 | ||
21649b50 JB |
10267 | 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity: |
10268 | ---------------------------------------------------------- | |
10269 | ||
10270 | Lastly, when should the sub-elements of an entity that remained unfixed | |
284614f0 JB |
10271 | thus far, be actually fixed? |
10272 | ||
10273 | The answer is: Only when referencing that element. For instance | |
10274 | when selecting one component of a record, this specific component | |
10275 | should be fixed at that point in time. Or when printing the value | |
10276 | of a record, each component should be fixed before its value gets | |
10277 | printed. Similarly for arrays, the element of the array should be | |
10278 | fixed when printing each element of the array, or when extracting | |
10279 | one element out of that array. On the other hand, fixing should | |
10280 | not be performed on the elements when taking a slice of an array! | |
10281 | ||
10282 | Note that one of the side-effects of miscomputing the offset and | |
10283 | size of each field is that we end up also miscomputing the size | |
10284 | of the containing type. This can have adverse results when computing | |
10285 | the value of an entity. GDB fetches the value of an entity based | |
10286 | on the size of its type, and thus a wrong size causes GDB to fetch | |
10287 | the wrong amount of memory. In the case where the computed size is | |
10288 | too small, GDB fetches too little data to print the value of our | |
10289 | entiry. Results in this case as unpredicatble, as we usually read | |
10290 | past the buffer containing the data =:-o. */ | |
10291 | ||
10292 | /* Implement the evaluate_exp routine in the exp_descriptor structure | |
10293 | for the Ada language. */ | |
10294 | ||
52ce6436 | 10295 | static struct value * |
ebf56fd3 | 10296 | ada_evaluate_subexp (struct type *expect_type, struct expression *exp, |
4c4b4cd2 | 10297 | int *pos, enum noside noside) |
14f9c5c9 AS |
10298 | { |
10299 | enum exp_opcode op; | |
b5385fc0 | 10300 | int tem; |
14f9c5c9 | 10301 | int pc; |
5ec18f2b | 10302 | int preeval_pos; |
14f9c5c9 AS |
10303 | struct value *arg1 = NULL, *arg2 = NULL, *arg3; |
10304 | struct type *type; | |
52ce6436 | 10305 | int nargs, oplen; |
d2e4a39e | 10306 | struct value **argvec; |
14f9c5c9 | 10307 | |
d2e4a39e AS |
10308 | pc = *pos; |
10309 | *pos += 1; | |
14f9c5c9 AS |
10310 | op = exp->elts[pc].opcode; |
10311 | ||
d2e4a39e | 10312 | switch (op) |
14f9c5c9 AS |
10313 | { |
10314 | default: | |
10315 | *pos -= 1; | |
6e48bd2c | 10316 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); |
ca1f964d JG |
10317 | |
10318 | if (noside == EVAL_NORMAL) | |
10319 | arg1 = unwrap_value (arg1); | |
6e48bd2c JB |
10320 | |
10321 | /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided, | |
10322 | then we need to perform the conversion manually, because | |
10323 | evaluate_subexp_standard doesn't do it. This conversion is | |
10324 | necessary in Ada because the different kinds of float/fixed | |
10325 | types in Ada have different representations. | |
10326 | ||
10327 | Similarly, we need to perform the conversion from OP_LONG | |
10328 | ourselves. */ | |
10329 | if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL) | |
10330 | arg1 = ada_value_cast (expect_type, arg1, noside); | |
10331 | ||
10332 | return arg1; | |
4c4b4cd2 PH |
10333 | |
10334 | case OP_STRING: | |
10335 | { | |
76a01679 | 10336 | struct value *result; |
5b4ee69b | 10337 | |
76a01679 JB |
10338 | *pos -= 1; |
10339 | result = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10340 | /* The result type will have code OP_STRING, bashed there from | |
10341 | OP_ARRAY. Bash it back. */ | |
df407dfe AC |
10342 | if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING) |
10343 | TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY; | |
76a01679 | 10344 | return result; |
4c4b4cd2 | 10345 | } |
14f9c5c9 AS |
10346 | |
10347 | case UNOP_CAST: | |
10348 | (*pos) += 2; | |
10349 | type = exp->elts[pc + 1].type; | |
10350 | arg1 = evaluate_subexp (type, exp, pos, noside); | |
10351 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10352 | goto nosideret; |
6e48bd2c | 10353 | arg1 = ada_value_cast (type, arg1, noside); |
14f9c5c9 AS |
10354 | return arg1; |
10355 | ||
4c4b4cd2 PH |
10356 | case UNOP_QUAL: |
10357 | (*pos) += 2; | |
10358 | type = exp->elts[pc + 1].type; | |
10359 | return ada_evaluate_subexp (type, exp, pos, noside); | |
10360 | ||
14f9c5c9 AS |
10361 | case BINOP_ASSIGN: |
10362 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
52ce6436 PH |
10363 | if (exp->elts[*pos].opcode == OP_AGGREGATE) |
10364 | { | |
10365 | arg1 = assign_aggregate (arg1, arg1, exp, pos, noside); | |
10366 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
10367 | return arg1; | |
10368 | return ada_value_assign (arg1, arg1); | |
10369 | } | |
003f3813 JB |
10370 | /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1, |
10371 | except if the lhs of our assignment is a convenience variable. | |
10372 | In the case of assigning to a convenience variable, the lhs | |
10373 | should be exactly the result of the evaluation of the rhs. */ | |
10374 | type = value_type (arg1); | |
10375 | if (VALUE_LVAL (arg1) == lval_internalvar) | |
10376 | type = NULL; | |
10377 | arg2 = evaluate_subexp (type, exp, pos, noside); | |
14f9c5c9 | 10378 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) |
4c4b4cd2 | 10379 | return arg1; |
df407dfe AC |
10380 | if (ada_is_fixed_point_type (value_type (arg1))) |
10381 | arg2 = cast_to_fixed (value_type (arg1), arg2); | |
10382 | else if (ada_is_fixed_point_type (value_type (arg2))) | |
76a01679 | 10383 | error |
323e0a4a | 10384 | (_("Fixed-point values must be assigned to fixed-point variables")); |
d2e4a39e | 10385 | else |
df407dfe | 10386 | arg2 = coerce_for_assign (value_type (arg1), arg2); |
4c4b4cd2 | 10387 | return ada_value_assign (arg1, arg2); |
14f9c5c9 AS |
10388 | |
10389 | case BINOP_ADD: | |
10390 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10391 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10392 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10393 | goto nosideret; |
2ac8a782 JB |
10394 | if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR) |
10395 | return (value_from_longest | |
10396 | (value_type (arg1), | |
10397 | value_as_long (arg1) + value_as_long (arg2))); | |
c40cc657 JB |
10398 | if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR) |
10399 | return (value_from_longest | |
10400 | (value_type (arg2), | |
10401 | value_as_long (arg1) + value_as_long (arg2))); | |
df407dfe AC |
10402 | if ((ada_is_fixed_point_type (value_type (arg1)) |
10403 | || ada_is_fixed_point_type (value_type (arg2))) | |
10404 | && value_type (arg1) != value_type (arg2)) | |
323e0a4a | 10405 | error (_("Operands of fixed-point addition must have the same type")); |
b7789565 JB |
10406 | /* Do the addition, and cast the result to the type of the first |
10407 | argument. We cannot cast the result to a reference type, so if | |
10408 | ARG1 is a reference type, find its underlying type. */ | |
10409 | type = value_type (arg1); | |
10410 | while (TYPE_CODE (type) == TYPE_CODE_REF) | |
10411 | type = TYPE_TARGET_TYPE (type); | |
f44316fa | 10412 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
89eef114 | 10413 | return value_cast (type, value_binop (arg1, arg2, BINOP_ADD)); |
14f9c5c9 AS |
10414 | |
10415 | case BINOP_SUB: | |
10416 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10417 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10418 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10419 | goto nosideret; |
2ac8a782 JB |
10420 | if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR) |
10421 | return (value_from_longest | |
10422 | (value_type (arg1), | |
10423 | value_as_long (arg1) - value_as_long (arg2))); | |
c40cc657 JB |
10424 | if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR) |
10425 | return (value_from_longest | |
10426 | (value_type (arg2), | |
10427 | value_as_long (arg1) - value_as_long (arg2))); | |
df407dfe AC |
10428 | if ((ada_is_fixed_point_type (value_type (arg1)) |
10429 | || ada_is_fixed_point_type (value_type (arg2))) | |
10430 | && value_type (arg1) != value_type (arg2)) | |
0963b4bd MS |
10431 | error (_("Operands of fixed-point subtraction " |
10432 | "must have the same type")); | |
b7789565 JB |
10433 | /* Do the substraction, and cast the result to the type of the first |
10434 | argument. We cannot cast the result to a reference type, so if | |
10435 | ARG1 is a reference type, find its underlying type. */ | |
10436 | type = value_type (arg1); | |
10437 | while (TYPE_CODE (type) == TYPE_CODE_REF) | |
10438 | type = TYPE_TARGET_TYPE (type); | |
f44316fa | 10439 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
89eef114 | 10440 | return value_cast (type, value_binop (arg1, arg2, BINOP_SUB)); |
14f9c5c9 AS |
10441 | |
10442 | case BINOP_MUL: | |
10443 | case BINOP_DIV: | |
e1578042 JB |
10444 | case BINOP_REM: |
10445 | case BINOP_MOD: | |
14f9c5c9 AS |
10446 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
10447 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10448 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10449 | goto nosideret; |
e1578042 | 10450 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
9c2be529 JB |
10451 | { |
10452 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
10453 | return value_zero (value_type (arg1), not_lval); | |
10454 | } | |
14f9c5c9 | 10455 | else |
4c4b4cd2 | 10456 | { |
a53b7a21 | 10457 | type = builtin_type (exp->gdbarch)->builtin_double; |
df407dfe | 10458 | if (ada_is_fixed_point_type (value_type (arg1))) |
a53b7a21 | 10459 | arg1 = cast_from_fixed (type, arg1); |
df407dfe | 10460 | if (ada_is_fixed_point_type (value_type (arg2))) |
a53b7a21 | 10461 | arg2 = cast_from_fixed (type, arg2); |
f44316fa | 10462 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
4c4b4cd2 PH |
10463 | return ada_value_binop (arg1, arg2, op); |
10464 | } | |
10465 | ||
4c4b4cd2 PH |
10466 | case BINOP_EQUAL: |
10467 | case BINOP_NOTEQUAL: | |
14f9c5c9 | 10468 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
df407dfe | 10469 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
14f9c5c9 | 10470 | if (noside == EVAL_SKIP) |
76a01679 | 10471 | goto nosideret; |
4c4b4cd2 | 10472 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 10473 | tem = 0; |
4c4b4cd2 | 10474 | else |
f44316fa UW |
10475 | { |
10476 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
10477 | tem = ada_value_equal (arg1, arg2); | |
10478 | } | |
4c4b4cd2 | 10479 | if (op == BINOP_NOTEQUAL) |
76a01679 | 10480 | tem = !tem; |
fbb06eb1 UW |
10481 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10482 | return value_from_longest (type, (LONGEST) tem); | |
4c4b4cd2 PH |
10483 | |
10484 | case UNOP_NEG: | |
10485 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10486 | if (noside == EVAL_SKIP) | |
10487 | goto nosideret; | |
df407dfe AC |
10488 | else if (ada_is_fixed_point_type (value_type (arg1))) |
10489 | return value_cast (value_type (arg1), value_neg (arg1)); | |
14f9c5c9 | 10490 | else |
f44316fa UW |
10491 | { |
10492 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
10493 | return value_neg (arg1); | |
10494 | } | |
4c4b4cd2 | 10495 | |
2330c6c6 JB |
10496 | case BINOP_LOGICAL_AND: |
10497 | case BINOP_LOGICAL_OR: | |
10498 | case UNOP_LOGICAL_NOT: | |
000d5124 JB |
10499 | { |
10500 | struct value *val; | |
10501 | ||
10502 | *pos -= 1; | |
10503 | val = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
fbb06eb1 UW |
10504 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10505 | return value_cast (type, val); | |
000d5124 | 10506 | } |
2330c6c6 JB |
10507 | |
10508 | case BINOP_BITWISE_AND: | |
10509 | case BINOP_BITWISE_IOR: | |
10510 | case BINOP_BITWISE_XOR: | |
000d5124 JB |
10511 | { |
10512 | struct value *val; | |
10513 | ||
10514 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
10515 | *pos = pc; | |
10516 | val = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10517 | ||
10518 | return value_cast (value_type (arg1), val); | |
10519 | } | |
2330c6c6 | 10520 | |
14f9c5c9 AS |
10521 | case OP_VAR_VALUE: |
10522 | *pos -= 1; | |
6799def4 | 10523 | |
14f9c5c9 | 10524 | if (noside == EVAL_SKIP) |
4c4b4cd2 PH |
10525 | { |
10526 | *pos += 4; | |
10527 | goto nosideret; | |
10528 | } | |
da5c522f JB |
10529 | |
10530 | if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN) | |
76a01679 JB |
10531 | /* Only encountered when an unresolved symbol occurs in a |
10532 | context other than a function call, in which case, it is | |
52ce6436 | 10533 | invalid. */ |
323e0a4a | 10534 | error (_("Unexpected unresolved symbol, %s, during evaluation"), |
4c4b4cd2 | 10535 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
da5c522f JB |
10536 | |
10537 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
4c4b4cd2 | 10538 | { |
0c1f74cf | 10539 | type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol)); |
31dbc1c5 JB |
10540 | /* Check to see if this is a tagged type. We also need to handle |
10541 | the case where the type is a reference to a tagged type, but | |
10542 | we have to be careful to exclude pointers to tagged types. | |
10543 | The latter should be shown as usual (as a pointer), whereas | |
10544 | a reference should mostly be transparent to the user. */ | |
10545 | if (ada_is_tagged_type (type, 0) | |
023db19c | 10546 | || (TYPE_CODE (type) == TYPE_CODE_REF |
31dbc1c5 | 10547 | && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0))) |
0d72a7c3 JB |
10548 | { |
10549 | /* Tagged types are a little special in the fact that the real | |
10550 | type is dynamic and can only be determined by inspecting the | |
10551 | object's tag. This means that we need to get the object's | |
10552 | value first (EVAL_NORMAL) and then extract the actual object | |
10553 | type from its tag. | |
10554 | ||
10555 | Note that we cannot skip the final step where we extract | |
10556 | the object type from its tag, because the EVAL_NORMAL phase | |
10557 | results in dynamic components being resolved into fixed ones. | |
10558 | This can cause problems when trying to print the type | |
10559 | description of tagged types whose parent has a dynamic size: | |
10560 | We use the type name of the "_parent" component in order | |
10561 | to print the name of the ancestor type in the type description. | |
10562 | If that component had a dynamic size, the resolution into | |
10563 | a fixed type would result in the loss of that type name, | |
10564 | thus preventing us from printing the name of the ancestor | |
10565 | type in the type description. */ | |
10566 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL); | |
10567 | ||
10568 | if (TYPE_CODE (type) != TYPE_CODE_REF) | |
10569 | { | |
10570 | struct type *actual_type; | |
10571 | ||
10572 | actual_type = type_from_tag (ada_value_tag (arg1)); | |
10573 | if (actual_type == NULL) | |
10574 | /* If, for some reason, we were unable to determine | |
10575 | the actual type from the tag, then use the static | |
10576 | approximation that we just computed as a fallback. | |
10577 | This can happen if the debugging information is | |
10578 | incomplete, for instance. */ | |
10579 | actual_type = type; | |
10580 | return value_zero (actual_type, not_lval); | |
10581 | } | |
10582 | else | |
10583 | { | |
10584 | /* In the case of a ref, ada_coerce_ref takes care | |
10585 | of determining the actual type. But the evaluation | |
10586 | should return a ref as it should be valid to ask | |
10587 | for its address; so rebuild a ref after coerce. */ | |
10588 | arg1 = ada_coerce_ref (arg1); | |
10589 | return value_ref (arg1); | |
10590 | } | |
10591 | } | |
0c1f74cf | 10592 | |
84754697 JB |
10593 | /* Records and unions for which GNAT encodings have been |
10594 | generated need to be statically fixed as well. | |
10595 | Otherwise, non-static fixing produces a type where | |
10596 | all dynamic properties are removed, which prevents "ptype" | |
10597 | from being able to completely describe the type. | |
10598 | For instance, a case statement in a variant record would be | |
10599 | replaced by the relevant components based on the actual | |
10600 | value of the discriminants. */ | |
10601 | if ((TYPE_CODE (type) == TYPE_CODE_STRUCT | |
10602 | && dynamic_template_type (type) != NULL) | |
10603 | || (TYPE_CODE (type) == TYPE_CODE_UNION | |
10604 | && ada_find_parallel_type (type, "___XVU") != NULL)) | |
10605 | { | |
10606 | *pos += 4; | |
10607 | return value_zero (to_static_fixed_type (type), not_lval); | |
10608 | } | |
4c4b4cd2 | 10609 | } |
da5c522f JB |
10610 | |
10611 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10612 | return ada_to_fixed_value (arg1); | |
4c4b4cd2 PH |
10613 | |
10614 | case OP_FUNCALL: | |
10615 | (*pos) += 2; | |
10616 | ||
10617 | /* Allocate arg vector, including space for the function to be | |
10618 | called in argvec[0] and a terminating NULL. */ | |
10619 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
8d749320 | 10620 | argvec = XALLOCAVEC (struct value *, nargs + 2); |
4c4b4cd2 PH |
10621 | |
10622 | if (exp->elts[*pos].opcode == OP_VAR_VALUE | |
76a01679 | 10623 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
323e0a4a | 10624 | error (_("Unexpected unresolved symbol, %s, during evaluation"), |
4c4b4cd2 PH |
10625 | SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol)); |
10626 | else | |
10627 | { | |
10628 | for (tem = 0; tem <= nargs; tem += 1) | |
10629 | argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10630 | argvec[tem] = 0; | |
10631 | ||
10632 | if (noside == EVAL_SKIP) | |
10633 | goto nosideret; | |
10634 | } | |
10635 | ||
ad82864c JB |
10636 | if (ada_is_constrained_packed_array_type |
10637 | (desc_base_type (value_type (argvec[0])))) | |
4c4b4cd2 | 10638 | argvec[0] = ada_coerce_to_simple_array (argvec[0]); |
284614f0 JB |
10639 | else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY |
10640 | && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0) | |
10641 | /* This is a packed array that has already been fixed, and | |
10642 | therefore already coerced to a simple array. Nothing further | |
10643 | to do. */ | |
10644 | ; | |
df407dfe AC |
10645 | else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF |
10646 | || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY | |
76a01679 | 10647 | && VALUE_LVAL (argvec[0]) == lval_memory)) |
4c4b4cd2 PH |
10648 | argvec[0] = value_addr (argvec[0]); |
10649 | ||
df407dfe | 10650 | type = ada_check_typedef (value_type (argvec[0])); |
720d1a40 JB |
10651 | |
10652 | /* Ada allows us to implicitly dereference arrays when subscripting | |
8f465ea7 JB |
10653 | them. So, if this is an array typedef (encoding use for array |
10654 | access types encoded as fat pointers), strip it now. */ | |
720d1a40 JB |
10655 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) |
10656 | type = ada_typedef_target_type (type); | |
10657 | ||
4c4b4cd2 PH |
10658 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
10659 | { | |
61ee279c | 10660 | switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))) |
4c4b4cd2 PH |
10661 | { |
10662 | case TYPE_CODE_FUNC: | |
61ee279c | 10663 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
4c4b4cd2 PH |
10664 | break; |
10665 | case TYPE_CODE_ARRAY: | |
10666 | break; | |
10667 | case TYPE_CODE_STRUCT: | |
10668 | if (noside != EVAL_AVOID_SIDE_EFFECTS) | |
10669 | argvec[0] = ada_value_ind (argvec[0]); | |
61ee279c | 10670 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
4c4b4cd2 PH |
10671 | break; |
10672 | default: | |
323e0a4a | 10673 | error (_("cannot subscript or call something of type `%s'"), |
df407dfe | 10674 | ada_type_name (value_type (argvec[0]))); |
4c4b4cd2 PH |
10675 | break; |
10676 | } | |
10677 | } | |
10678 | ||
10679 | switch (TYPE_CODE (type)) | |
10680 | { | |
10681 | case TYPE_CODE_FUNC: | |
10682 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
c8ea1972 PH |
10683 | { |
10684 | struct type *rtype = TYPE_TARGET_TYPE (type); | |
10685 | ||
10686 | if (TYPE_GNU_IFUNC (type)) | |
10687 | return allocate_value (TYPE_TARGET_TYPE (rtype)); | |
10688 | return allocate_value (rtype); | |
10689 | } | |
4c4b4cd2 | 10690 | return call_function_by_hand (argvec[0], nargs, argvec + 1); |
c8ea1972 PH |
10691 | case TYPE_CODE_INTERNAL_FUNCTION: |
10692 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10693 | /* We don't know anything about what the internal | |
10694 | function might return, but we have to return | |
10695 | something. */ | |
10696 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
10697 | not_lval); | |
10698 | else | |
10699 | return call_internal_function (exp->gdbarch, exp->language_defn, | |
10700 | argvec[0], nargs, argvec + 1); | |
10701 | ||
4c4b4cd2 PH |
10702 | case TYPE_CODE_STRUCT: |
10703 | { | |
10704 | int arity; | |
10705 | ||
4c4b4cd2 PH |
10706 | arity = ada_array_arity (type); |
10707 | type = ada_array_element_type (type, nargs); | |
10708 | if (type == NULL) | |
323e0a4a | 10709 | error (_("cannot subscript or call a record")); |
4c4b4cd2 | 10710 | if (arity != nargs) |
323e0a4a | 10711 | error (_("wrong number of subscripts; expecting %d"), arity); |
4c4b4cd2 | 10712 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
0a07e705 | 10713 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10714 | return |
10715 | unwrap_value (ada_value_subscript | |
10716 | (argvec[0], nargs, argvec + 1)); | |
10717 | } | |
10718 | case TYPE_CODE_ARRAY: | |
10719 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10720 | { | |
10721 | type = ada_array_element_type (type, nargs); | |
10722 | if (type == NULL) | |
323e0a4a | 10723 | error (_("element type of array unknown")); |
4c4b4cd2 | 10724 | else |
0a07e705 | 10725 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10726 | } |
10727 | return | |
10728 | unwrap_value (ada_value_subscript | |
10729 | (ada_coerce_to_simple_array (argvec[0]), | |
10730 | nargs, argvec + 1)); | |
10731 | case TYPE_CODE_PTR: /* Pointer to array */ | |
4c4b4cd2 PH |
10732 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
10733 | { | |
deede10c | 10734 | type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1); |
4c4b4cd2 PH |
10735 | type = ada_array_element_type (type, nargs); |
10736 | if (type == NULL) | |
323e0a4a | 10737 | error (_("element type of array unknown")); |
4c4b4cd2 | 10738 | else |
0a07e705 | 10739 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10740 | } |
10741 | return | |
deede10c JB |
10742 | unwrap_value (ada_value_ptr_subscript (argvec[0], |
10743 | nargs, argvec + 1)); | |
4c4b4cd2 PH |
10744 | |
10745 | default: | |
e1d5a0d2 PH |
10746 | error (_("Attempt to index or call something other than an " |
10747 | "array or function")); | |
4c4b4cd2 PH |
10748 | } |
10749 | ||
10750 | case TERNOP_SLICE: | |
10751 | { | |
10752 | struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10753 | struct value *low_bound_val = | |
10754 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
714e53ab PH |
10755 | struct value *high_bound_val = |
10756 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10757 | LONGEST low_bound; | |
10758 | LONGEST high_bound; | |
5b4ee69b | 10759 | |
994b9211 AC |
10760 | low_bound_val = coerce_ref (low_bound_val); |
10761 | high_bound_val = coerce_ref (high_bound_val); | |
aa715135 JG |
10762 | low_bound = value_as_long (low_bound_val); |
10763 | high_bound = value_as_long (high_bound_val); | |
963a6417 | 10764 | |
4c4b4cd2 PH |
10765 | if (noside == EVAL_SKIP) |
10766 | goto nosideret; | |
10767 | ||
4c4b4cd2 PH |
10768 | /* If this is a reference to an aligner type, then remove all |
10769 | the aligners. */ | |
df407dfe AC |
10770 | if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF |
10771 | && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array)))) | |
10772 | TYPE_TARGET_TYPE (value_type (array)) = | |
10773 | ada_aligned_type (TYPE_TARGET_TYPE (value_type (array))); | |
4c4b4cd2 | 10774 | |
ad82864c | 10775 | if (ada_is_constrained_packed_array_type (value_type (array))) |
323e0a4a | 10776 | error (_("cannot slice a packed array")); |
4c4b4cd2 PH |
10777 | |
10778 | /* If this is a reference to an array or an array lvalue, | |
10779 | convert to a pointer. */ | |
df407dfe AC |
10780 | if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF |
10781 | || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY | |
4c4b4cd2 PH |
10782 | && VALUE_LVAL (array) == lval_memory)) |
10783 | array = value_addr (array); | |
10784 | ||
1265e4aa | 10785 | if (noside == EVAL_AVOID_SIDE_EFFECTS |
61ee279c | 10786 | && ada_is_array_descriptor_type (ada_check_typedef |
df407dfe | 10787 | (value_type (array)))) |
0b5d8877 | 10788 | return empty_array (ada_type_of_array (array, 0), low_bound); |
4c4b4cd2 PH |
10789 | |
10790 | array = ada_coerce_to_simple_array_ptr (array); | |
10791 | ||
714e53ab PH |
10792 | /* If we have more than one level of pointer indirection, |
10793 | dereference the value until we get only one level. */ | |
df407dfe AC |
10794 | while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR |
10795 | && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array))) | |
714e53ab PH |
10796 | == TYPE_CODE_PTR)) |
10797 | array = value_ind (array); | |
10798 | ||
10799 | /* Make sure we really do have an array type before going further, | |
10800 | to avoid a SEGV when trying to get the index type or the target | |
10801 | type later down the road if the debug info generated by | |
10802 | the compiler is incorrect or incomplete. */ | |
df407dfe | 10803 | if (!ada_is_simple_array_type (value_type (array))) |
323e0a4a | 10804 | error (_("cannot take slice of non-array")); |
714e53ab | 10805 | |
828292f2 JB |
10806 | if (TYPE_CODE (ada_check_typedef (value_type (array))) |
10807 | == TYPE_CODE_PTR) | |
4c4b4cd2 | 10808 | { |
828292f2 JB |
10809 | struct type *type0 = ada_check_typedef (value_type (array)); |
10810 | ||
0b5d8877 | 10811 | if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS) |
828292f2 | 10812 | return empty_array (TYPE_TARGET_TYPE (type0), low_bound); |
4c4b4cd2 PH |
10813 | else |
10814 | { | |
10815 | struct type *arr_type0 = | |
828292f2 | 10816 | to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1); |
5b4ee69b | 10817 | |
f5938064 JG |
10818 | return ada_value_slice_from_ptr (array, arr_type0, |
10819 | longest_to_int (low_bound), | |
10820 | longest_to_int (high_bound)); | |
4c4b4cd2 PH |
10821 | } |
10822 | } | |
10823 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10824 | return array; | |
10825 | else if (high_bound < low_bound) | |
df407dfe | 10826 | return empty_array (value_type (array), low_bound); |
4c4b4cd2 | 10827 | else |
529cad9c PH |
10828 | return ada_value_slice (array, longest_to_int (low_bound), |
10829 | longest_to_int (high_bound)); | |
4c4b4cd2 | 10830 | } |
14f9c5c9 | 10831 | |
4c4b4cd2 PH |
10832 | case UNOP_IN_RANGE: |
10833 | (*pos) += 2; | |
10834 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
8008e265 | 10835 | type = check_typedef (exp->elts[pc + 1].type); |
14f9c5c9 | 10836 | |
14f9c5c9 | 10837 | if (noside == EVAL_SKIP) |
4c4b4cd2 | 10838 | goto nosideret; |
14f9c5c9 | 10839 | |
4c4b4cd2 PH |
10840 | switch (TYPE_CODE (type)) |
10841 | { | |
10842 | default: | |
e1d5a0d2 PH |
10843 | lim_warning (_("Membership test incompletely implemented; " |
10844 | "always returns true")); | |
fbb06eb1 UW |
10845 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10846 | return value_from_longest (type, (LONGEST) 1); | |
4c4b4cd2 PH |
10847 | |
10848 | case TYPE_CODE_RANGE: | |
030b4912 UW |
10849 | arg2 = value_from_longest (type, TYPE_LOW_BOUND (type)); |
10850 | arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type)); | |
f44316fa UW |
10851 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
10852 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 UW |
10853 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10854 | return | |
10855 | value_from_longest (type, | |
4c4b4cd2 PH |
10856 | (value_less (arg1, arg3) |
10857 | || value_equal (arg1, arg3)) | |
10858 | && (value_less (arg2, arg1) | |
10859 | || value_equal (arg2, arg1))); | |
10860 | } | |
10861 | ||
10862 | case BINOP_IN_BOUNDS: | |
14f9c5c9 | 10863 | (*pos) += 2; |
4c4b4cd2 PH |
10864 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
10865 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
14f9c5c9 | 10866 | |
4c4b4cd2 PH |
10867 | if (noside == EVAL_SKIP) |
10868 | goto nosideret; | |
14f9c5c9 | 10869 | |
4c4b4cd2 | 10870 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
fbb06eb1 UW |
10871 | { |
10872 | type = language_bool_type (exp->language_defn, exp->gdbarch); | |
10873 | return value_zero (type, not_lval); | |
10874 | } | |
14f9c5c9 | 10875 | |
4c4b4cd2 | 10876 | tem = longest_to_int (exp->elts[pc + 1].longconst); |
14f9c5c9 | 10877 | |
1eea4ebd UW |
10878 | type = ada_index_type (value_type (arg2), tem, "range"); |
10879 | if (!type) | |
10880 | type = value_type (arg1); | |
14f9c5c9 | 10881 | |
1eea4ebd UW |
10882 | arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1)); |
10883 | arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0)); | |
d2e4a39e | 10884 | |
f44316fa UW |
10885 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
10886 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 | 10887 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
4c4b4cd2 | 10888 | return |
fbb06eb1 | 10889 | value_from_longest (type, |
4c4b4cd2 PH |
10890 | (value_less (arg1, arg3) |
10891 | || value_equal (arg1, arg3)) | |
10892 | && (value_less (arg2, arg1) | |
10893 | || value_equal (arg2, arg1))); | |
10894 | ||
10895 | case TERNOP_IN_RANGE: | |
10896 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10897 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10898 | arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10899 | ||
10900 | if (noside == EVAL_SKIP) | |
10901 | goto nosideret; | |
10902 | ||
f44316fa UW |
10903 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
10904 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 | 10905 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
4c4b4cd2 | 10906 | return |
fbb06eb1 | 10907 | value_from_longest (type, |
4c4b4cd2 PH |
10908 | (value_less (arg1, arg3) |
10909 | || value_equal (arg1, arg3)) | |
10910 | && (value_less (arg2, arg1) | |
10911 | || value_equal (arg2, arg1))); | |
10912 | ||
10913 | case OP_ATR_FIRST: | |
10914 | case OP_ATR_LAST: | |
10915 | case OP_ATR_LENGTH: | |
10916 | { | |
76a01679 | 10917 | struct type *type_arg; |
5b4ee69b | 10918 | |
76a01679 JB |
10919 | if (exp->elts[*pos].opcode == OP_TYPE) |
10920 | { | |
10921 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
10922 | arg1 = NULL; | |
5bc23cb3 | 10923 | type_arg = check_typedef (exp->elts[pc + 2].type); |
76a01679 JB |
10924 | } |
10925 | else | |
10926 | { | |
10927 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10928 | type_arg = NULL; | |
10929 | } | |
10930 | ||
10931 | if (exp->elts[*pos].opcode != OP_LONG) | |
323e0a4a | 10932 | error (_("Invalid operand to '%s"), ada_attribute_name (op)); |
76a01679 JB |
10933 | tem = longest_to_int (exp->elts[*pos + 2].longconst); |
10934 | *pos += 4; | |
10935 | ||
10936 | if (noside == EVAL_SKIP) | |
10937 | goto nosideret; | |
10938 | ||
10939 | if (type_arg == NULL) | |
10940 | { | |
10941 | arg1 = ada_coerce_ref (arg1); | |
10942 | ||
ad82864c | 10943 | if (ada_is_constrained_packed_array_type (value_type (arg1))) |
76a01679 JB |
10944 | arg1 = ada_coerce_to_simple_array (arg1); |
10945 | ||
aa4fb036 | 10946 | if (op == OP_ATR_LENGTH) |
1eea4ebd | 10947 | type = builtin_type (exp->gdbarch)->builtin_int; |
aa4fb036 JB |
10948 | else |
10949 | { | |
10950 | type = ada_index_type (value_type (arg1), tem, | |
10951 | ada_attribute_name (op)); | |
10952 | if (type == NULL) | |
10953 | type = builtin_type (exp->gdbarch)->builtin_int; | |
10954 | } | |
76a01679 JB |
10955 | |
10956 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
1eea4ebd | 10957 | return allocate_value (type); |
76a01679 JB |
10958 | |
10959 | switch (op) | |
10960 | { | |
10961 | default: /* Should never happen. */ | |
323e0a4a | 10962 | error (_("unexpected attribute encountered")); |
76a01679 | 10963 | case OP_ATR_FIRST: |
1eea4ebd UW |
10964 | return value_from_longest |
10965 | (type, ada_array_bound (arg1, tem, 0)); | |
76a01679 | 10966 | case OP_ATR_LAST: |
1eea4ebd UW |
10967 | return value_from_longest |
10968 | (type, ada_array_bound (arg1, tem, 1)); | |
76a01679 | 10969 | case OP_ATR_LENGTH: |
1eea4ebd UW |
10970 | return value_from_longest |
10971 | (type, ada_array_length (arg1, tem)); | |
76a01679 JB |
10972 | } |
10973 | } | |
10974 | else if (discrete_type_p (type_arg)) | |
10975 | { | |
10976 | struct type *range_type; | |
0d5cff50 | 10977 | const char *name = ada_type_name (type_arg); |
5b4ee69b | 10978 | |
76a01679 JB |
10979 | range_type = NULL; |
10980 | if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM) | |
28c85d6c | 10981 | range_type = to_fixed_range_type (type_arg, NULL); |
76a01679 JB |
10982 | if (range_type == NULL) |
10983 | range_type = type_arg; | |
10984 | switch (op) | |
10985 | { | |
10986 | default: | |
323e0a4a | 10987 | error (_("unexpected attribute encountered")); |
76a01679 | 10988 | case OP_ATR_FIRST: |
690cc4eb | 10989 | return value_from_longest |
43bbcdc2 | 10990 | (range_type, ada_discrete_type_low_bound (range_type)); |
76a01679 | 10991 | case OP_ATR_LAST: |
690cc4eb | 10992 | return value_from_longest |
43bbcdc2 | 10993 | (range_type, ada_discrete_type_high_bound (range_type)); |
76a01679 | 10994 | case OP_ATR_LENGTH: |
323e0a4a | 10995 | error (_("the 'length attribute applies only to array types")); |
76a01679 JB |
10996 | } |
10997 | } | |
10998 | else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT) | |
323e0a4a | 10999 | error (_("unimplemented type attribute")); |
76a01679 JB |
11000 | else |
11001 | { | |
11002 | LONGEST low, high; | |
11003 | ||
ad82864c JB |
11004 | if (ada_is_constrained_packed_array_type (type_arg)) |
11005 | type_arg = decode_constrained_packed_array_type (type_arg); | |
76a01679 | 11006 | |
aa4fb036 | 11007 | if (op == OP_ATR_LENGTH) |
1eea4ebd | 11008 | type = builtin_type (exp->gdbarch)->builtin_int; |
aa4fb036 JB |
11009 | else |
11010 | { | |
11011 | type = ada_index_type (type_arg, tem, ada_attribute_name (op)); | |
11012 | if (type == NULL) | |
11013 | type = builtin_type (exp->gdbarch)->builtin_int; | |
11014 | } | |
1eea4ebd | 11015 | |
76a01679 JB |
11016 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
11017 | return allocate_value (type); | |
11018 | ||
11019 | switch (op) | |
11020 | { | |
11021 | default: | |
323e0a4a | 11022 | error (_("unexpected attribute encountered")); |
76a01679 | 11023 | case OP_ATR_FIRST: |
1eea4ebd | 11024 | low = ada_array_bound_from_type (type_arg, tem, 0); |
76a01679 JB |
11025 | return value_from_longest (type, low); |
11026 | case OP_ATR_LAST: | |
1eea4ebd | 11027 | high = ada_array_bound_from_type (type_arg, tem, 1); |
76a01679 JB |
11028 | return value_from_longest (type, high); |
11029 | case OP_ATR_LENGTH: | |
1eea4ebd UW |
11030 | low = ada_array_bound_from_type (type_arg, tem, 0); |
11031 | high = ada_array_bound_from_type (type_arg, tem, 1); | |
76a01679 JB |
11032 | return value_from_longest (type, high - low + 1); |
11033 | } | |
11034 | } | |
14f9c5c9 AS |
11035 | } |
11036 | ||
4c4b4cd2 PH |
11037 | case OP_ATR_TAG: |
11038 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11039 | if (noside == EVAL_SKIP) | |
76a01679 | 11040 | goto nosideret; |
4c4b4cd2 PH |
11041 | |
11042 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
76a01679 | 11043 | return value_zero (ada_tag_type (arg1), not_lval); |
4c4b4cd2 PH |
11044 | |
11045 | return ada_value_tag (arg1); | |
11046 | ||
11047 | case OP_ATR_MIN: | |
11048 | case OP_ATR_MAX: | |
11049 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 AS |
11050 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11051 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11052 | if (noside == EVAL_SKIP) | |
76a01679 | 11053 | goto nosideret; |
d2e4a39e | 11054 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
df407dfe | 11055 | return value_zero (value_type (arg1), not_lval); |
14f9c5c9 | 11056 | else |
f44316fa UW |
11057 | { |
11058 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
11059 | return value_binop (arg1, arg2, | |
11060 | op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX); | |
11061 | } | |
14f9c5c9 | 11062 | |
4c4b4cd2 PH |
11063 | case OP_ATR_MODULUS: |
11064 | { | |
31dedfee | 11065 | struct type *type_arg = check_typedef (exp->elts[pc + 2].type); |
4c4b4cd2 | 11066 | |
5b4ee69b | 11067 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); |
76a01679 JB |
11068 | if (noside == EVAL_SKIP) |
11069 | goto nosideret; | |
4c4b4cd2 | 11070 | |
76a01679 | 11071 | if (!ada_is_modular_type (type_arg)) |
323e0a4a | 11072 | error (_("'modulus must be applied to modular type")); |
4c4b4cd2 | 11073 | |
76a01679 JB |
11074 | return value_from_longest (TYPE_TARGET_TYPE (type_arg), |
11075 | ada_modulus (type_arg)); | |
4c4b4cd2 PH |
11076 | } |
11077 | ||
11078 | ||
11079 | case OP_ATR_POS: | |
11080 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 AS |
11081 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11082 | if (noside == EVAL_SKIP) | |
76a01679 | 11083 | goto nosideret; |
3cb382c9 UW |
11084 | type = builtin_type (exp->gdbarch)->builtin_int; |
11085 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
11086 | return value_zero (type, not_lval); | |
14f9c5c9 | 11087 | else |
3cb382c9 | 11088 | return value_pos_atr (type, arg1); |
14f9c5c9 | 11089 | |
4c4b4cd2 PH |
11090 | case OP_ATR_SIZE: |
11091 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
8c1c099f JB |
11092 | type = value_type (arg1); |
11093 | ||
11094 | /* If the argument is a reference, then dereference its type, since | |
11095 | the user is really asking for the size of the actual object, | |
11096 | not the size of the pointer. */ | |
11097 | if (TYPE_CODE (type) == TYPE_CODE_REF) | |
11098 | type = TYPE_TARGET_TYPE (type); | |
11099 | ||
4c4b4cd2 | 11100 | if (noside == EVAL_SKIP) |
76a01679 | 11101 | goto nosideret; |
4c4b4cd2 | 11102 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
22601c15 | 11103 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval); |
4c4b4cd2 | 11104 | else |
22601c15 | 11105 | return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, |
8c1c099f | 11106 | TARGET_CHAR_BIT * TYPE_LENGTH (type)); |
4c4b4cd2 PH |
11107 | |
11108 | case OP_ATR_VAL: | |
11109 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 | 11110 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
4c4b4cd2 | 11111 | type = exp->elts[pc + 2].type; |
14f9c5c9 | 11112 | if (noside == EVAL_SKIP) |
76a01679 | 11113 | goto nosideret; |
4c4b4cd2 | 11114 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 11115 | return value_zero (type, not_lval); |
4c4b4cd2 | 11116 | else |
76a01679 | 11117 | return value_val_atr (type, arg1); |
4c4b4cd2 PH |
11118 | |
11119 | case BINOP_EXP: | |
11120 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11121 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11122 | if (noside == EVAL_SKIP) | |
11123 | goto nosideret; | |
11124 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
df407dfe | 11125 | return value_zero (value_type (arg1), not_lval); |
4c4b4cd2 | 11126 | else |
f44316fa UW |
11127 | { |
11128 | /* For integer exponentiation operations, | |
11129 | only promote the first argument. */ | |
11130 | if (is_integral_type (value_type (arg2))) | |
11131 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
11132 | else | |
11133 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
11134 | ||
11135 | return value_binop (arg1, arg2, op); | |
11136 | } | |
4c4b4cd2 PH |
11137 | |
11138 | case UNOP_PLUS: | |
11139 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11140 | if (noside == EVAL_SKIP) | |
11141 | goto nosideret; | |
11142 | else | |
11143 | return arg1; | |
11144 | ||
11145 | case UNOP_ABS: | |
11146 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11147 | if (noside == EVAL_SKIP) | |
11148 | goto nosideret; | |
f44316fa | 11149 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); |
df407dfe | 11150 | if (value_less (arg1, value_zero (value_type (arg1), not_lval))) |
4c4b4cd2 | 11151 | return value_neg (arg1); |
14f9c5c9 | 11152 | else |
4c4b4cd2 | 11153 | return arg1; |
14f9c5c9 AS |
11154 | |
11155 | case UNOP_IND: | |
5ec18f2b | 11156 | preeval_pos = *pos; |
6b0d7253 | 11157 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
14f9c5c9 | 11158 | if (noside == EVAL_SKIP) |
4c4b4cd2 | 11159 | goto nosideret; |
df407dfe | 11160 | type = ada_check_typedef (value_type (arg1)); |
14f9c5c9 | 11161 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
4c4b4cd2 PH |
11162 | { |
11163 | if (ada_is_array_descriptor_type (type)) | |
11164 | /* GDB allows dereferencing GNAT array descriptors. */ | |
11165 | { | |
11166 | struct type *arrType = ada_type_of_array (arg1, 0); | |
5b4ee69b | 11167 | |
4c4b4cd2 | 11168 | if (arrType == NULL) |
323e0a4a | 11169 | error (_("Attempt to dereference null array pointer.")); |
00a4c844 | 11170 | return value_at_lazy (arrType, 0); |
4c4b4cd2 PH |
11171 | } |
11172 | else if (TYPE_CODE (type) == TYPE_CODE_PTR | |
11173 | || TYPE_CODE (type) == TYPE_CODE_REF | |
11174 | /* In C you can dereference an array to get the 1st elt. */ | |
11175 | || TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
714e53ab | 11176 | { |
5ec18f2b JG |
11177 | /* As mentioned in the OP_VAR_VALUE case, tagged types can |
11178 | only be determined by inspecting the object's tag. | |
11179 | This means that we need to evaluate completely the | |
11180 | expression in order to get its type. */ | |
11181 | ||
023db19c JB |
11182 | if ((TYPE_CODE (type) == TYPE_CODE_REF |
11183 | || TYPE_CODE (type) == TYPE_CODE_PTR) | |
5ec18f2b JG |
11184 | && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)) |
11185 | { | |
11186 | arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos, | |
11187 | EVAL_NORMAL); | |
11188 | type = value_type (ada_value_ind (arg1)); | |
11189 | } | |
11190 | else | |
11191 | { | |
11192 | type = to_static_fixed_type | |
11193 | (ada_aligned_type | |
11194 | (ada_check_typedef (TYPE_TARGET_TYPE (type)))); | |
11195 | } | |
c1b5a1a6 | 11196 | ada_ensure_varsize_limit (type); |
714e53ab PH |
11197 | return value_zero (type, lval_memory); |
11198 | } | |
4c4b4cd2 | 11199 | else if (TYPE_CODE (type) == TYPE_CODE_INT) |
6b0d7253 JB |
11200 | { |
11201 | /* GDB allows dereferencing an int. */ | |
11202 | if (expect_type == NULL) | |
11203 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
11204 | lval_memory); | |
11205 | else | |
11206 | { | |
11207 | expect_type = | |
11208 | to_static_fixed_type (ada_aligned_type (expect_type)); | |
11209 | return value_zero (expect_type, lval_memory); | |
11210 | } | |
11211 | } | |
4c4b4cd2 | 11212 | else |
323e0a4a | 11213 | error (_("Attempt to take contents of a non-pointer value.")); |
4c4b4cd2 | 11214 | } |
0963b4bd | 11215 | arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */ |
df407dfe | 11216 | type = ada_check_typedef (value_type (arg1)); |
d2e4a39e | 11217 | |
96967637 JB |
11218 | if (TYPE_CODE (type) == TYPE_CODE_INT) |
11219 | /* GDB allows dereferencing an int. If we were given | |
11220 | the expect_type, then use that as the target type. | |
11221 | Otherwise, assume that the target type is an int. */ | |
11222 | { | |
11223 | if (expect_type != NULL) | |
11224 | return ada_value_ind (value_cast (lookup_pointer_type (expect_type), | |
11225 | arg1)); | |
11226 | else | |
11227 | return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int, | |
11228 | (CORE_ADDR) value_as_address (arg1)); | |
11229 | } | |
6b0d7253 | 11230 | |
4c4b4cd2 PH |
11231 | if (ada_is_array_descriptor_type (type)) |
11232 | /* GDB allows dereferencing GNAT array descriptors. */ | |
11233 | return ada_coerce_to_simple_array (arg1); | |
14f9c5c9 | 11234 | else |
4c4b4cd2 | 11235 | return ada_value_ind (arg1); |
14f9c5c9 AS |
11236 | |
11237 | case STRUCTOP_STRUCT: | |
11238 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
11239 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
5ec18f2b | 11240 | preeval_pos = *pos; |
14f9c5c9 AS |
11241 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11242 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 11243 | goto nosideret; |
14f9c5c9 | 11244 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 11245 | { |
df407dfe | 11246 | struct type *type1 = value_type (arg1); |
5b4ee69b | 11247 | |
76a01679 JB |
11248 | if (ada_is_tagged_type (type1, 1)) |
11249 | { | |
11250 | type = ada_lookup_struct_elt_type (type1, | |
11251 | &exp->elts[pc + 2].string, | |
11252 | 1, 1, NULL); | |
5ec18f2b JG |
11253 | |
11254 | /* If the field is not found, check if it exists in the | |
11255 | extension of this object's type. This means that we | |
11256 | need to evaluate completely the expression. */ | |
11257 | ||
76a01679 | 11258 | if (type == NULL) |
5ec18f2b JG |
11259 | { |
11260 | arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos, | |
11261 | EVAL_NORMAL); | |
11262 | arg1 = ada_value_struct_elt (arg1, | |
11263 | &exp->elts[pc + 2].string, | |
11264 | 0); | |
11265 | arg1 = unwrap_value (arg1); | |
11266 | type = value_type (ada_to_fixed_value (arg1)); | |
11267 | } | |
76a01679 JB |
11268 | } |
11269 | else | |
11270 | type = | |
11271 | ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1, | |
11272 | 0, NULL); | |
11273 | ||
11274 | return value_zero (ada_aligned_type (type), lval_memory); | |
11275 | } | |
14f9c5c9 | 11276 | else |
284614f0 JB |
11277 | arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0); |
11278 | arg1 = unwrap_value (arg1); | |
11279 | return ada_to_fixed_value (arg1); | |
11280 | ||
14f9c5c9 | 11281 | case OP_TYPE: |
4c4b4cd2 PH |
11282 | /* The value is not supposed to be used. This is here to make it |
11283 | easier to accommodate expressions that contain types. */ | |
14f9c5c9 AS |
11284 | (*pos) += 2; |
11285 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 11286 | goto nosideret; |
14f9c5c9 | 11287 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
a6cfbe68 | 11288 | return allocate_value (exp->elts[pc + 1].type); |
14f9c5c9 | 11289 | else |
323e0a4a | 11290 | error (_("Attempt to use a type name as an expression")); |
52ce6436 PH |
11291 | |
11292 | case OP_AGGREGATE: | |
11293 | case OP_CHOICES: | |
11294 | case OP_OTHERS: | |
11295 | case OP_DISCRETE_RANGE: | |
11296 | case OP_POSITIONAL: | |
11297 | case OP_NAME: | |
11298 | if (noside == EVAL_NORMAL) | |
11299 | switch (op) | |
11300 | { | |
11301 | case OP_NAME: | |
11302 | error (_("Undefined name, ambiguous name, or renaming used in " | |
e1d5a0d2 | 11303 | "component association: %s."), &exp->elts[pc+2].string); |
52ce6436 PH |
11304 | case OP_AGGREGATE: |
11305 | error (_("Aggregates only allowed on the right of an assignment")); | |
11306 | default: | |
0963b4bd MS |
11307 | internal_error (__FILE__, __LINE__, |
11308 | _("aggregate apparently mangled")); | |
52ce6436 PH |
11309 | } |
11310 | ||
11311 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
11312 | *pos += oplen - 1; | |
11313 | for (tem = 0; tem < nargs; tem += 1) | |
11314 | ada_evaluate_subexp (NULL, exp, pos, noside); | |
11315 | goto nosideret; | |
14f9c5c9 AS |
11316 | } |
11317 | ||
11318 | nosideret: | |
22601c15 | 11319 | return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1); |
14f9c5c9 | 11320 | } |
14f9c5c9 | 11321 | \f |
d2e4a39e | 11322 | |
4c4b4cd2 | 11323 | /* Fixed point */ |
14f9c5c9 AS |
11324 | |
11325 | /* If TYPE encodes an Ada fixed-point type, return the suffix of the | |
11326 | type name that encodes the 'small and 'delta information. | |
4c4b4cd2 | 11327 | Otherwise, return NULL. */ |
14f9c5c9 | 11328 | |
d2e4a39e | 11329 | static const char * |
ebf56fd3 | 11330 | fixed_type_info (struct type *type) |
14f9c5c9 | 11331 | { |
d2e4a39e | 11332 | const char *name = ada_type_name (type); |
14f9c5c9 AS |
11333 | enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type); |
11334 | ||
d2e4a39e AS |
11335 | if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL) |
11336 | { | |
14f9c5c9 | 11337 | const char *tail = strstr (name, "___XF_"); |
5b4ee69b | 11338 | |
14f9c5c9 | 11339 | if (tail == NULL) |
4c4b4cd2 | 11340 | return NULL; |
d2e4a39e | 11341 | else |
4c4b4cd2 | 11342 | return tail + 5; |
14f9c5c9 AS |
11343 | } |
11344 | else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type) | |
11345 | return fixed_type_info (TYPE_TARGET_TYPE (type)); | |
11346 | else | |
11347 | return NULL; | |
11348 | } | |
11349 | ||
4c4b4cd2 | 11350 | /* Returns non-zero iff TYPE represents an Ada fixed-point type. */ |
14f9c5c9 AS |
11351 | |
11352 | int | |
ebf56fd3 | 11353 | ada_is_fixed_point_type (struct type *type) |
14f9c5c9 AS |
11354 | { |
11355 | return fixed_type_info (type) != NULL; | |
11356 | } | |
11357 | ||
4c4b4cd2 PH |
11358 | /* Return non-zero iff TYPE represents a System.Address type. */ |
11359 | ||
11360 | int | |
11361 | ada_is_system_address_type (struct type *type) | |
11362 | { | |
11363 | return (TYPE_NAME (type) | |
11364 | && strcmp (TYPE_NAME (type), "system__address") == 0); | |
11365 | } | |
11366 | ||
14f9c5c9 AS |
11367 | /* Assuming that TYPE is the representation of an Ada fixed-point |
11368 | type, return its delta, or -1 if the type is malformed and the | |
4c4b4cd2 | 11369 | delta cannot be determined. */ |
14f9c5c9 AS |
11370 | |
11371 | DOUBLEST | |
ebf56fd3 | 11372 | ada_delta (struct type *type) |
14f9c5c9 AS |
11373 | { |
11374 | const char *encoding = fixed_type_info (type); | |
facc390f | 11375 | DOUBLEST num, den; |
14f9c5c9 | 11376 | |
facc390f JB |
11377 | /* Strictly speaking, num and den are encoded as integer. However, |
11378 | they may not fit into a long, and they will have to be converted | |
11379 | to DOUBLEST anyway. So scan them as DOUBLEST. */ | |
11380 | if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT, | |
11381 | &num, &den) < 2) | |
14f9c5c9 | 11382 | return -1.0; |
d2e4a39e | 11383 | else |
facc390f | 11384 | return num / den; |
14f9c5c9 AS |
11385 | } |
11386 | ||
11387 | /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling | |
4c4b4cd2 | 11388 | factor ('SMALL value) associated with the type. */ |
14f9c5c9 AS |
11389 | |
11390 | static DOUBLEST | |
ebf56fd3 | 11391 | scaling_factor (struct type *type) |
14f9c5c9 AS |
11392 | { |
11393 | const char *encoding = fixed_type_info (type); | |
facc390f | 11394 | DOUBLEST num0, den0, num1, den1; |
14f9c5c9 | 11395 | int n; |
d2e4a39e | 11396 | |
facc390f JB |
11397 | /* Strictly speaking, num's and den's are encoded as integer. However, |
11398 | they may not fit into a long, and they will have to be converted | |
11399 | to DOUBLEST anyway. So scan them as DOUBLEST. */ | |
11400 | n = sscanf (encoding, | |
11401 | "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT | |
11402 | "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT, | |
11403 | &num0, &den0, &num1, &den1); | |
14f9c5c9 AS |
11404 | |
11405 | if (n < 2) | |
11406 | return 1.0; | |
11407 | else if (n == 4) | |
facc390f | 11408 | return num1 / den1; |
d2e4a39e | 11409 | else |
facc390f | 11410 | return num0 / den0; |
14f9c5c9 AS |
11411 | } |
11412 | ||
11413 | ||
11414 | /* Assuming that X is the representation of a value of fixed-point | |
4c4b4cd2 | 11415 | type TYPE, return its floating-point equivalent. */ |
14f9c5c9 AS |
11416 | |
11417 | DOUBLEST | |
ebf56fd3 | 11418 | ada_fixed_to_float (struct type *type, LONGEST x) |
14f9c5c9 | 11419 | { |
d2e4a39e | 11420 | return (DOUBLEST) x *scaling_factor (type); |
14f9c5c9 AS |
11421 | } |
11422 | ||
4c4b4cd2 PH |
11423 | /* The representation of a fixed-point value of type TYPE |
11424 | corresponding to the value X. */ | |
14f9c5c9 AS |
11425 | |
11426 | LONGEST | |
ebf56fd3 | 11427 | ada_float_to_fixed (struct type *type, DOUBLEST x) |
14f9c5c9 AS |
11428 | { |
11429 | return (LONGEST) (x / scaling_factor (type) + 0.5); | |
11430 | } | |
11431 | ||
14f9c5c9 | 11432 | \f |
d2e4a39e | 11433 | |
4c4b4cd2 | 11434 | /* Range types */ |
14f9c5c9 AS |
11435 | |
11436 | /* Scan STR beginning at position K for a discriminant name, and | |
11437 | return the value of that discriminant field of DVAL in *PX. If | |
11438 | PNEW_K is not null, put the position of the character beyond the | |
11439 | name scanned in *PNEW_K. Return 1 if successful; return 0 and do | |
4c4b4cd2 | 11440 | not alter *PX and *PNEW_K if unsuccessful. */ |
14f9c5c9 AS |
11441 | |
11442 | static int | |
108d56a4 | 11443 | scan_discrim_bound (const char *str, int k, struct value *dval, LONGEST * px, |
76a01679 | 11444 | int *pnew_k) |
14f9c5c9 AS |
11445 | { |
11446 | static char *bound_buffer = NULL; | |
11447 | static size_t bound_buffer_len = 0; | |
5da1a4d3 | 11448 | const char *pstart, *pend, *bound; |
d2e4a39e | 11449 | struct value *bound_val; |
14f9c5c9 AS |
11450 | |
11451 | if (dval == NULL || str == NULL || str[k] == '\0') | |
11452 | return 0; | |
11453 | ||
5da1a4d3 SM |
11454 | pstart = str + k; |
11455 | pend = strstr (pstart, "__"); | |
14f9c5c9 AS |
11456 | if (pend == NULL) |
11457 | { | |
5da1a4d3 | 11458 | bound = pstart; |
14f9c5c9 AS |
11459 | k += strlen (bound); |
11460 | } | |
d2e4a39e | 11461 | else |
14f9c5c9 | 11462 | { |
5da1a4d3 SM |
11463 | int len = pend - pstart; |
11464 | ||
11465 | /* Strip __ and beyond. */ | |
11466 | GROW_VECT (bound_buffer, bound_buffer_len, len + 1); | |
11467 | strncpy (bound_buffer, pstart, len); | |
11468 | bound_buffer[len] = '\0'; | |
11469 | ||
14f9c5c9 | 11470 | bound = bound_buffer; |
d2e4a39e | 11471 | k = pend - str; |
14f9c5c9 | 11472 | } |
d2e4a39e | 11473 | |
df407dfe | 11474 | bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval)); |
14f9c5c9 AS |
11475 | if (bound_val == NULL) |
11476 | return 0; | |
11477 | ||
11478 | *px = value_as_long (bound_val); | |
11479 | if (pnew_k != NULL) | |
11480 | *pnew_k = k; | |
11481 | return 1; | |
11482 | } | |
11483 | ||
11484 | /* Value of variable named NAME in the current environment. If | |
11485 | no such variable found, then if ERR_MSG is null, returns 0, and | |
4c4b4cd2 PH |
11486 | otherwise causes an error with message ERR_MSG. */ |
11487 | ||
d2e4a39e AS |
11488 | static struct value * |
11489 | get_var_value (char *name, char *err_msg) | |
14f9c5c9 | 11490 | { |
d12307c1 | 11491 | struct block_symbol *syms; |
14f9c5c9 AS |
11492 | int nsyms; |
11493 | ||
4c4b4cd2 | 11494 | nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN, |
4eeaa230 | 11495 | &syms); |
14f9c5c9 AS |
11496 | |
11497 | if (nsyms != 1) | |
11498 | { | |
11499 | if (err_msg == NULL) | |
4c4b4cd2 | 11500 | return 0; |
14f9c5c9 | 11501 | else |
8a3fe4f8 | 11502 | error (("%s"), err_msg); |
14f9c5c9 AS |
11503 | } |
11504 | ||
d12307c1 | 11505 | return value_of_variable (syms[0].symbol, syms[0].block); |
14f9c5c9 | 11506 | } |
d2e4a39e | 11507 | |
14f9c5c9 | 11508 | /* Value of integer variable named NAME in the current environment. If |
4c4b4cd2 PH |
11509 | no such variable found, returns 0, and sets *FLAG to 0. If |
11510 | successful, sets *FLAG to 1. */ | |
11511 | ||
14f9c5c9 | 11512 | LONGEST |
4c4b4cd2 | 11513 | get_int_var_value (char *name, int *flag) |
14f9c5c9 | 11514 | { |
4c4b4cd2 | 11515 | struct value *var_val = get_var_value (name, 0); |
d2e4a39e | 11516 | |
14f9c5c9 AS |
11517 | if (var_val == 0) |
11518 | { | |
11519 | if (flag != NULL) | |
4c4b4cd2 | 11520 | *flag = 0; |
14f9c5c9 AS |
11521 | return 0; |
11522 | } | |
11523 | else | |
11524 | { | |
11525 | if (flag != NULL) | |
4c4b4cd2 | 11526 | *flag = 1; |
14f9c5c9 AS |
11527 | return value_as_long (var_val); |
11528 | } | |
11529 | } | |
d2e4a39e | 11530 | |
14f9c5c9 AS |
11531 | |
11532 | /* Return a range type whose base type is that of the range type named | |
11533 | NAME in the current environment, and whose bounds are calculated | |
4c4b4cd2 | 11534 | from NAME according to the GNAT range encoding conventions. |
1ce677a4 UW |
11535 | Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the |
11536 | corresponding range type from debug information; fall back to using it | |
11537 | if symbol lookup fails. If a new type must be created, allocate it | |
11538 | like ORIG_TYPE was. The bounds information, in general, is encoded | |
11539 | in NAME, the base type given in the named range type. */ | |
14f9c5c9 | 11540 | |
d2e4a39e | 11541 | static struct type * |
28c85d6c | 11542 | to_fixed_range_type (struct type *raw_type, struct value *dval) |
14f9c5c9 | 11543 | { |
0d5cff50 | 11544 | const char *name; |
14f9c5c9 | 11545 | struct type *base_type; |
108d56a4 | 11546 | const char *subtype_info; |
14f9c5c9 | 11547 | |
28c85d6c JB |
11548 | gdb_assert (raw_type != NULL); |
11549 | gdb_assert (TYPE_NAME (raw_type) != NULL); | |
dddfab26 | 11550 | |
1ce677a4 | 11551 | if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE) |
14f9c5c9 AS |
11552 | base_type = TYPE_TARGET_TYPE (raw_type); |
11553 | else | |
11554 | base_type = raw_type; | |
11555 | ||
28c85d6c | 11556 | name = TYPE_NAME (raw_type); |
14f9c5c9 AS |
11557 | subtype_info = strstr (name, "___XD"); |
11558 | if (subtype_info == NULL) | |
690cc4eb | 11559 | { |
43bbcdc2 PH |
11560 | LONGEST L = ada_discrete_type_low_bound (raw_type); |
11561 | LONGEST U = ada_discrete_type_high_bound (raw_type); | |
5b4ee69b | 11562 | |
690cc4eb PH |
11563 | if (L < INT_MIN || U > INT_MAX) |
11564 | return raw_type; | |
11565 | else | |
0c9c3474 SA |
11566 | return create_static_range_type (alloc_type_copy (raw_type), raw_type, |
11567 | L, U); | |
690cc4eb | 11568 | } |
14f9c5c9 AS |
11569 | else |
11570 | { | |
11571 | static char *name_buf = NULL; | |
11572 | static size_t name_len = 0; | |
11573 | int prefix_len = subtype_info - name; | |
11574 | LONGEST L, U; | |
11575 | struct type *type; | |
108d56a4 | 11576 | const char *bounds_str; |
14f9c5c9 AS |
11577 | int n; |
11578 | ||
11579 | GROW_VECT (name_buf, name_len, prefix_len + 5); | |
11580 | strncpy (name_buf, name, prefix_len); | |
11581 | name_buf[prefix_len] = '\0'; | |
11582 | ||
11583 | subtype_info += 5; | |
11584 | bounds_str = strchr (subtype_info, '_'); | |
11585 | n = 1; | |
11586 | ||
d2e4a39e | 11587 | if (*subtype_info == 'L') |
4c4b4cd2 PH |
11588 | { |
11589 | if (!ada_scan_number (bounds_str, n, &L, &n) | |
11590 | && !scan_discrim_bound (bounds_str, n, dval, &L, &n)) | |
11591 | return raw_type; | |
11592 | if (bounds_str[n] == '_') | |
11593 | n += 2; | |
0963b4bd | 11594 | else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */ |
4c4b4cd2 PH |
11595 | n += 1; |
11596 | subtype_info += 1; | |
11597 | } | |
d2e4a39e | 11598 | else |
4c4b4cd2 PH |
11599 | { |
11600 | int ok; | |
5b4ee69b | 11601 | |
4c4b4cd2 PH |
11602 | strcpy (name_buf + prefix_len, "___L"); |
11603 | L = get_int_var_value (name_buf, &ok); | |
11604 | if (!ok) | |
11605 | { | |
323e0a4a | 11606 | lim_warning (_("Unknown lower bound, using 1.")); |
4c4b4cd2 PH |
11607 | L = 1; |
11608 | } | |
11609 | } | |
14f9c5c9 | 11610 | |
d2e4a39e | 11611 | if (*subtype_info == 'U') |
4c4b4cd2 PH |
11612 | { |
11613 | if (!ada_scan_number (bounds_str, n, &U, &n) | |
11614 | && !scan_discrim_bound (bounds_str, n, dval, &U, &n)) | |
11615 | return raw_type; | |
11616 | } | |
d2e4a39e | 11617 | else |
4c4b4cd2 PH |
11618 | { |
11619 | int ok; | |
5b4ee69b | 11620 | |
4c4b4cd2 PH |
11621 | strcpy (name_buf + prefix_len, "___U"); |
11622 | U = get_int_var_value (name_buf, &ok); | |
11623 | if (!ok) | |
11624 | { | |
323e0a4a | 11625 | lim_warning (_("Unknown upper bound, using %ld."), (long) L); |
4c4b4cd2 PH |
11626 | U = L; |
11627 | } | |
11628 | } | |
14f9c5c9 | 11629 | |
0c9c3474 SA |
11630 | type = create_static_range_type (alloc_type_copy (raw_type), |
11631 | base_type, L, U); | |
d2e4a39e | 11632 | TYPE_NAME (type) = name; |
14f9c5c9 AS |
11633 | return type; |
11634 | } | |
11635 | } | |
11636 | ||
4c4b4cd2 PH |
11637 | /* True iff NAME is the name of a range type. */ |
11638 | ||
14f9c5c9 | 11639 | int |
d2e4a39e | 11640 | ada_is_range_type_name (const char *name) |
14f9c5c9 AS |
11641 | { |
11642 | return (name != NULL && strstr (name, "___XD")); | |
d2e4a39e | 11643 | } |
14f9c5c9 | 11644 | \f |
d2e4a39e | 11645 | |
4c4b4cd2 PH |
11646 | /* Modular types */ |
11647 | ||
11648 | /* True iff TYPE is an Ada modular type. */ | |
14f9c5c9 | 11649 | |
14f9c5c9 | 11650 | int |
d2e4a39e | 11651 | ada_is_modular_type (struct type *type) |
14f9c5c9 | 11652 | { |
18af8284 | 11653 | struct type *subranged_type = get_base_type (type); |
14f9c5c9 AS |
11654 | |
11655 | return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE | |
690cc4eb | 11656 | && TYPE_CODE (subranged_type) == TYPE_CODE_INT |
4c4b4cd2 | 11657 | && TYPE_UNSIGNED (subranged_type)); |
14f9c5c9 AS |
11658 | } |
11659 | ||
4c4b4cd2 PH |
11660 | /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */ |
11661 | ||
61ee279c | 11662 | ULONGEST |
0056e4d5 | 11663 | ada_modulus (struct type *type) |
14f9c5c9 | 11664 | { |
43bbcdc2 | 11665 | return (ULONGEST) TYPE_HIGH_BOUND (type) + 1; |
14f9c5c9 | 11666 | } |
d2e4a39e | 11667 | \f |
f7f9143b JB |
11668 | |
11669 | /* Ada exception catchpoint support: | |
11670 | --------------------------------- | |
11671 | ||
11672 | We support 3 kinds of exception catchpoints: | |
11673 | . catchpoints on Ada exceptions | |
11674 | . catchpoints on unhandled Ada exceptions | |
11675 | . catchpoints on failed assertions | |
11676 | ||
11677 | Exceptions raised during failed assertions, or unhandled exceptions | |
11678 | could perfectly be caught with the general catchpoint on Ada exceptions. | |
11679 | However, we can easily differentiate these two special cases, and having | |
11680 | the option to distinguish these two cases from the rest can be useful | |
11681 | to zero-in on certain situations. | |
11682 | ||
11683 | Exception catchpoints are a specialized form of breakpoint, | |
11684 | since they rely on inserting breakpoints inside known routines | |
11685 | of the GNAT runtime. The implementation therefore uses a standard | |
11686 | breakpoint structure of the BP_BREAKPOINT type, but with its own set | |
11687 | of breakpoint_ops. | |
11688 | ||
0259addd JB |
11689 | Support in the runtime for exception catchpoints have been changed |
11690 | a few times already, and these changes affect the implementation | |
11691 | of these catchpoints. In order to be able to support several | |
11692 | variants of the runtime, we use a sniffer that will determine | |
28010a5d | 11693 | the runtime variant used by the program being debugged. */ |
f7f9143b | 11694 | |
82eacd52 JB |
11695 | /* Ada's standard exceptions. |
11696 | ||
11697 | The Ada 83 standard also defined Numeric_Error. But there so many | |
11698 | situations where it was unclear from the Ada 83 Reference Manual | |
11699 | (RM) whether Constraint_Error or Numeric_Error should be raised, | |
11700 | that the ARG (Ada Rapporteur Group) eventually issued a Binding | |
11701 | Interpretation saying that anytime the RM says that Numeric_Error | |
11702 | should be raised, the implementation may raise Constraint_Error. | |
11703 | Ada 95 went one step further and pretty much removed Numeric_Error | |
11704 | from the list of standard exceptions (it made it a renaming of | |
11705 | Constraint_Error, to help preserve compatibility when compiling | |
11706 | an Ada83 compiler). As such, we do not include Numeric_Error from | |
11707 | this list of standard exceptions. */ | |
3d0b0fa3 JB |
11708 | |
11709 | static char *standard_exc[] = { | |
11710 | "constraint_error", | |
11711 | "program_error", | |
11712 | "storage_error", | |
11713 | "tasking_error" | |
11714 | }; | |
11715 | ||
0259addd JB |
11716 | typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void); |
11717 | ||
11718 | /* A structure that describes how to support exception catchpoints | |
11719 | for a given executable. */ | |
11720 | ||
11721 | struct exception_support_info | |
11722 | { | |
11723 | /* The name of the symbol to break on in order to insert | |
11724 | a catchpoint on exceptions. */ | |
11725 | const char *catch_exception_sym; | |
11726 | ||
11727 | /* The name of the symbol to break on in order to insert | |
11728 | a catchpoint on unhandled exceptions. */ | |
11729 | const char *catch_exception_unhandled_sym; | |
11730 | ||
11731 | /* The name of the symbol to break on in order to insert | |
11732 | a catchpoint on failed assertions. */ | |
11733 | const char *catch_assert_sym; | |
11734 | ||
11735 | /* Assuming that the inferior just triggered an unhandled exception | |
11736 | catchpoint, this function is responsible for returning the address | |
11737 | in inferior memory where the name of that exception is stored. | |
11738 | Return zero if the address could not be computed. */ | |
11739 | ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr; | |
11740 | }; | |
11741 | ||
11742 | static CORE_ADDR ada_unhandled_exception_name_addr (void); | |
11743 | static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void); | |
11744 | ||
11745 | /* The following exception support info structure describes how to | |
11746 | implement exception catchpoints with the latest version of the | |
11747 | Ada runtime (as of 2007-03-06). */ | |
11748 | ||
11749 | static const struct exception_support_info default_exception_support_info = | |
11750 | { | |
11751 | "__gnat_debug_raise_exception", /* catch_exception_sym */ | |
11752 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
11753 | "__gnat_debug_raise_assert_failure", /* catch_assert_sym */ | |
11754 | ada_unhandled_exception_name_addr | |
11755 | }; | |
11756 | ||
11757 | /* The following exception support info structure describes how to | |
11758 | implement exception catchpoints with a slightly older version | |
11759 | of the Ada runtime. */ | |
11760 | ||
11761 | static const struct exception_support_info exception_support_info_fallback = | |
11762 | { | |
11763 | "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */ | |
11764 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
11765 | "system__assertions__raise_assert_failure", /* catch_assert_sym */ | |
11766 | ada_unhandled_exception_name_addr_from_raise | |
11767 | }; | |
11768 | ||
f17011e0 JB |
11769 | /* Return nonzero if we can detect the exception support routines |
11770 | described in EINFO. | |
11771 | ||
11772 | This function errors out if an abnormal situation is detected | |
11773 | (for instance, if we find the exception support routines, but | |
11774 | that support is found to be incomplete). */ | |
11775 | ||
11776 | static int | |
11777 | ada_has_this_exception_support (const struct exception_support_info *einfo) | |
11778 | { | |
11779 | struct symbol *sym; | |
11780 | ||
11781 | /* The symbol we're looking up is provided by a unit in the GNAT runtime | |
11782 | that should be compiled with debugging information. As a result, we | |
11783 | expect to find that symbol in the symtabs. */ | |
11784 | ||
11785 | sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN); | |
11786 | if (sym == NULL) | |
a6af7abe JB |
11787 | { |
11788 | /* Perhaps we did not find our symbol because the Ada runtime was | |
11789 | compiled without debugging info, or simply stripped of it. | |
11790 | It happens on some GNU/Linux distributions for instance, where | |
11791 | users have to install a separate debug package in order to get | |
11792 | the runtime's debugging info. In that situation, let the user | |
11793 | know why we cannot insert an Ada exception catchpoint. | |
11794 | ||
11795 | Note: Just for the purpose of inserting our Ada exception | |
11796 | catchpoint, we could rely purely on the associated minimal symbol. | |
11797 | But we would be operating in degraded mode anyway, since we are | |
11798 | still lacking the debugging info needed later on to extract | |
11799 | the name of the exception being raised (this name is printed in | |
11800 | the catchpoint message, and is also used when trying to catch | |
11801 | a specific exception). We do not handle this case for now. */ | |
3b7344d5 | 11802 | struct bound_minimal_symbol msym |
1c8e84b0 JB |
11803 | = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL); |
11804 | ||
3b7344d5 | 11805 | if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline) |
a6af7abe JB |
11806 | error (_("Your Ada runtime appears to be missing some debugging " |
11807 | "information.\nCannot insert Ada exception catchpoint " | |
11808 | "in this configuration.")); | |
11809 | ||
11810 | return 0; | |
11811 | } | |
f17011e0 JB |
11812 | |
11813 | /* Make sure that the symbol we found corresponds to a function. */ | |
11814 | ||
11815 | if (SYMBOL_CLASS (sym) != LOC_BLOCK) | |
11816 | error (_("Symbol \"%s\" is not a function (class = %d)"), | |
11817 | SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym)); | |
11818 | ||
11819 | return 1; | |
11820 | } | |
11821 | ||
0259addd JB |
11822 | /* Inspect the Ada runtime and determine which exception info structure |
11823 | should be used to provide support for exception catchpoints. | |
11824 | ||
3eecfa55 JB |
11825 | This function will always set the per-inferior exception_info, |
11826 | or raise an error. */ | |
0259addd JB |
11827 | |
11828 | static void | |
11829 | ada_exception_support_info_sniffer (void) | |
11830 | { | |
3eecfa55 | 11831 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
0259addd JB |
11832 | |
11833 | /* If the exception info is already known, then no need to recompute it. */ | |
3eecfa55 | 11834 | if (data->exception_info != NULL) |
0259addd JB |
11835 | return; |
11836 | ||
11837 | /* Check the latest (default) exception support info. */ | |
f17011e0 | 11838 | if (ada_has_this_exception_support (&default_exception_support_info)) |
0259addd | 11839 | { |
3eecfa55 | 11840 | data->exception_info = &default_exception_support_info; |
0259addd JB |
11841 | return; |
11842 | } | |
11843 | ||
11844 | /* Try our fallback exception suport info. */ | |
f17011e0 | 11845 | if (ada_has_this_exception_support (&exception_support_info_fallback)) |
0259addd | 11846 | { |
3eecfa55 | 11847 | data->exception_info = &exception_support_info_fallback; |
0259addd JB |
11848 | return; |
11849 | } | |
11850 | ||
11851 | /* Sometimes, it is normal for us to not be able to find the routine | |
11852 | we are looking for. This happens when the program is linked with | |
11853 | the shared version of the GNAT runtime, and the program has not been | |
11854 | started yet. Inform the user of these two possible causes if | |
11855 | applicable. */ | |
11856 | ||
ccefe4c4 | 11857 | if (ada_update_initial_language (language_unknown) != language_ada) |
0259addd JB |
11858 | error (_("Unable to insert catchpoint. Is this an Ada main program?")); |
11859 | ||
11860 | /* If the symbol does not exist, then check that the program is | |
11861 | already started, to make sure that shared libraries have been | |
11862 | loaded. If it is not started, this may mean that the symbol is | |
11863 | in a shared library. */ | |
11864 | ||
11865 | if (ptid_get_pid (inferior_ptid) == 0) | |
11866 | error (_("Unable to insert catchpoint. Try to start the program first.")); | |
11867 | ||
11868 | /* At this point, we know that we are debugging an Ada program and | |
11869 | that the inferior has been started, but we still are not able to | |
0963b4bd | 11870 | find the run-time symbols. That can mean that we are in |
0259addd JB |
11871 | configurable run time mode, or that a-except as been optimized |
11872 | out by the linker... In any case, at this point it is not worth | |
11873 | supporting this feature. */ | |
11874 | ||
7dda8cff | 11875 | error (_("Cannot insert Ada exception catchpoints in this configuration.")); |
0259addd JB |
11876 | } |
11877 | ||
f7f9143b JB |
11878 | /* True iff FRAME is very likely to be that of a function that is |
11879 | part of the runtime system. This is all very heuristic, but is | |
11880 | intended to be used as advice as to what frames are uninteresting | |
11881 | to most users. */ | |
11882 | ||
11883 | static int | |
11884 | is_known_support_routine (struct frame_info *frame) | |
11885 | { | |
4ed6b5be | 11886 | struct symtab_and_line sal; |
55b87a52 | 11887 | char *func_name; |
692465f1 | 11888 | enum language func_lang; |
f7f9143b | 11889 | int i; |
f35a17b5 | 11890 | const char *fullname; |
f7f9143b | 11891 | |
4ed6b5be JB |
11892 | /* If this code does not have any debugging information (no symtab), |
11893 | This cannot be any user code. */ | |
f7f9143b | 11894 | |
4ed6b5be | 11895 | find_frame_sal (frame, &sal); |
f7f9143b JB |
11896 | if (sal.symtab == NULL) |
11897 | return 1; | |
11898 | ||
4ed6b5be JB |
11899 | /* If there is a symtab, but the associated source file cannot be |
11900 | located, then assume this is not user code: Selecting a frame | |
11901 | for which we cannot display the code would not be very helpful | |
11902 | for the user. This should also take care of case such as VxWorks | |
11903 | where the kernel has some debugging info provided for a few units. */ | |
f7f9143b | 11904 | |
f35a17b5 JK |
11905 | fullname = symtab_to_fullname (sal.symtab); |
11906 | if (access (fullname, R_OK) != 0) | |
f7f9143b JB |
11907 | return 1; |
11908 | ||
4ed6b5be JB |
11909 | /* Check the unit filename againt the Ada runtime file naming. |
11910 | We also check the name of the objfile against the name of some | |
11911 | known system libraries that sometimes come with debugging info | |
11912 | too. */ | |
11913 | ||
f7f9143b JB |
11914 | for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1) |
11915 | { | |
11916 | re_comp (known_runtime_file_name_patterns[i]); | |
f69c91ad | 11917 | if (re_exec (lbasename (sal.symtab->filename))) |
f7f9143b | 11918 | return 1; |
eb822aa6 DE |
11919 | if (SYMTAB_OBJFILE (sal.symtab) != NULL |
11920 | && re_exec (objfile_name (SYMTAB_OBJFILE (sal.symtab)))) | |
4ed6b5be | 11921 | return 1; |
f7f9143b JB |
11922 | } |
11923 | ||
4ed6b5be | 11924 | /* Check whether the function is a GNAT-generated entity. */ |
f7f9143b | 11925 | |
e9e07ba6 | 11926 | find_frame_funname (frame, &func_name, &func_lang, NULL); |
f7f9143b JB |
11927 | if (func_name == NULL) |
11928 | return 1; | |
11929 | ||
11930 | for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1) | |
11931 | { | |
11932 | re_comp (known_auxiliary_function_name_patterns[i]); | |
11933 | if (re_exec (func_name)) | |
55b87a52 KS |
11934 | { |
11935 | xfree (func_name); | |
11936 | return 1; | |
11937 | } | |
f7f9143b JB |
11938 | } |
11939 | ||
55b87a52 | 11940 | xfree (func_name); |
f7f9143b JB |
11941 | return 0; |
11942 | } | |
11943 | ||
11944 | /* Find the first frame that contains debugging information and that is not | |
11945 | part of the Ada run-time, starting from FI and moving upward. */ | |
11946 | ||
0ef643c8 | 11947 | void |
f7f9143b JB |
11948 | ada_find_printable_frame (struct frame_info *fi) |
11949 | { | |
11950 | for (; fi != NULL; fi = get_prev_frame (fi)) | |
11951 | { | |
11952 | if (!is_known_support_routine (fi)) | |
11953 | { | |
11954 | select_frame (fi); | |
11955 | break; | |
11956 | } | |
11957 | } | |
11958 | ||
11959 | } | |
11960 | ||
11961 | /* Assuming that the inferior just triggered an unhandled exception | |
11962 | catchpoint, return the address in inferior memory where the name | |
11963 | of the exception is stored. | |
11964 | ||
11965 | Return zero if the address could not be computed. */ | |
11966 | ||
11967 | static CORE_ADDR | |
11968 | ada_unhandled_exception_name_addr (void) | |
0259addd JB |
11969 | { |
11970 | return parse_and_eval_address ("e.full_name"); | |
11971 | } | |
11972 | ||
11973 | /* Same as ada_unhandled_exception_name_addr, except that this function | |
11974 | should be used when the inferior uses an older version of the runtime, | |
11975 | where the exception name needs to be extracted from a specific frame | |
11976 | several frames up in the callstack. */ | |
11977 | ||
11978 | static CORE_ADDR | |
11979 | ada_unhandled_exception_name_addr_from_raise (void) | |
f7f9143b JB |
11980 | { |
11981 | int frame_level; | |
11982 | struct frame_info *fi; | |
3eecfa55 | 11983 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
55b87a52 | 11984 | struct cleanup *old_chain; |
f7f9143b JB |
11985 | |
11986 | /* To determine the name of this exception, we need to select | |
11987 | the frame corresponding to RAISE_SYM_NAME. This frame is | |
11988 | at least 3 levels up, so we simply skip the first 3 frames | |
11989 | without checking the name of their associated function. */ | |
11990 | fi = get_current_frame (); | |
11991 | for (frame_level = 0; frame_level < 3; frame_level += 1) | |
11992 | if (fi != NULL) | |
11993 | fi = get_prev_frame (fi); | |
11994 | ||
55b87a52 | 11995 | old_chain = make_cleanup (null_cleanup, NULL); |
f7f9143b JB |
11996 | while (fi != NULL) |
11997 | { | |
55b87a52 | 11998 | char *func_name; |
692465f1 JB |
11999 | enum language func_lang; |
12000 | ||
e9e07ba6 | 12001 | find_frame_funname (fi, &func_name, &func_lang, NULL); |
55b87a52 KS |
12002 | if (func_name != NULL) |
12003 | { | |
12004 | make_cleanup (xfree, func_name); | |
12005 | ||
12006 | if (strcmp (func_name, | |
12007 | data->exception_info->catch_exception_sym) == 0) | |
12008 | break; /* We found the frame we were looking for... */ | |
12009 | fi = get_prev_frame (fi); | |
12010 | } | |
f7f9143b | 12011 | } |
55b87a52 | 12012 | do_cleanups (old_chain); |
f7f9143b JB |
12013 | |
12014 | if (fi == NULL) | |
12015 | return 0; | |
12016 | ||
12017 | select_frame (fi); | |
12018 | return parse_and_eval_address ("id.full_name"); | |
12019 | } | |
12020 | ||
12021 | /* Assuming the inferior just triggered an Ada exception catchpoint | |
12022 | (of any type), return the address in inferior memory where the name | |
12023 | of the exception is stored, if applicable. | |
12024 | ||
12025 | Return zero if the address could not be computed, or if not relevant. */ | |
12026 | ||
12027 | static CORE_ADDR | |
761269c8 | 12028 | ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12029 | struct breakpoint *b) |
12030 | { | |
3eecfa55 JB |
12031 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
12032 | ||
f7f9143b JB |
12033 | switch (ex) |
12034 | { | |
761269c8 | 12035 | case ada_catch_exception: |
f7f9143b JB |
12036 | return (parse_and_eval_address ("e.full_name")); |
12037 | break; | |
12038 | ||
761269c8 | 12039 | case ada_catch_exception_unhandled: |
3eecfa55 | 12040 | return data->exception_info->unhandled_exception_name_addr (); |
f7f9143b JB |
12041 | break; |
12042 | ||
761269c8 | 12043 | case ada_catch_assert: |
f7f9143b JB |
12044 | return 0; /* Exception name is not relevant in this case. */ |
12045 | break; | |
12046 | ||
12047 | default: | |
12048 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12049 | break; | |
12050 | } | |
12051 | ||
12052 | return 0; /* Should never be reached. */ | |
12053 | } | |
12054 | ||
12055 | /* Same as ada_exception_name_addr_1, except that it intercepts and contains | |
12056 | any error that ada_exception_name_addr_1 might cause to be thrown. | |
12057 | When an error is intercepted, a warning with the error message is printed, | |
12058 | and zero is returned. */ | |
12059 | ||
12060 | static CORE_ADDR | |
761269c8 | 12061 | ada_exception_name_addr (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12062 | struct breakpoint *b) |
12063 | { | |
f7f9143b JB |
12064 | CORE_ADDR result = 0; |
12065 | ||
492d29ea | 12066 | TRY |
f7f9143b JB |
12067 | { |
12068 | result = ada_exception_name_addr_1 (ex, b); | |
12069 | } | |
12070 | ||
492d29ea | 12071 | CATCH (e, RETURN_MASK_ERROR) |
f7f9143b JB |
12072 | { |
12073 | warning (_("failed to get exception name: %s"), e.message); | |
12074 | return 0; | |
12075 | } | |
492d29ea | 12076 | END_CATCH |
f7f9143b JB |
12077 | |
12078 | return result; | |
12079 | } | |
12080 | ||
28010a5d PA |
12081 | static char *ada_exception_catchpoint_cond_string (const char *excep_string); |
12082 | ||
12083 | /* Ada catchpoints. | |
12084 | ||
12085 | In the case of catchpoints on Ada exceptions, the catchpoint will | |
12086 | stop the target on every exception the program throws. When a user | |
12087 | specifies the name of a specific exception, we translate this | |
12088 | request into a condition expression (in text form), and then parse | |
12089 | it into an expression stored in each of the catchpoint's locations. | |
12090 | We then use this condition to check whether the exception that was | |
12091 | raised is the one the user is interested in. If not, then the | |
12092 | target is resumed again. We store the name of the requested | |
12093 | exception, in order to be able to re-set the condition expression | |
12094 | when symbols change. */ | |
12095 | ||
12096 | /* An instance of this type is used to represent an Ada catchpoint | |
12097 | breakpoint location. It includes a "struct bp_location" as a kind | |
12098 | of base class; users downcast to "struct bp_location *" when | |
12099 | needed. */ | |
12100 | ||
12101 | struct ada_catchpoint_location | |
12102 | { | |
12103 | /* The base class. */ | |
12104 | struct bp_location base; | |
12105 | ||
12106 | /* The condition that checks whether the exception that was raised | |
12107 | is the specific exception the user specified on catchpoint | |
12108 | creation. */ | |
12109 | struct expression *excep_cond_expr; | |
12110 | }; | |
12111 | ||
12112 | /* Implement the DTOR method in the bp_location_ops structure for all | |
12113 | Ada exception catchpoint kinds. */ | |
12114 | ||
12115 | static void | |
12116 | ada_catchpoint_location_dtor (struct bp_location *bl) | |
12117 | { | |
12118 | struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl; | |
12119 | ||
12120 | xfree (al->excep_cond_expr); | |
12121 | } | |
12122 | ||
12123 | /* The vtable to be used in Ada catchpoint locations. */ | |
12124 | ||
12125 | static const struct bp_location_ops ada_catchpoint_location_ops = | |
12126 | { | |
12127 | ada_catchpoint_location_dtor | |
12128 | }; | |
12129 | ||
12130 | /* An instance of this type is used to represent an Ada catchpoint. | |
12131 | It includes a "struct breakpoint" as a kind of base class; users | |
12132 | downcast to "struct breakpoint *" when needed. */ | |
12133 | ||
12134 | struct ada_catchpoint | |
12135 | { | |
12136 | /* The base class. */ | |
12137 | struct breakpoint base; | |
12138 | ||
12139 | /* The name of the specific exception the user specified. */ | |
12140 | char *excep_string; | |
12141 | }; | |
12142 | ||
12143 | /* Parse the exception condition string in the context of each of the | |
12144 | catchpoint's locations, and store them for later evaluation. */ | |
12145 | ||
12146 | static void | |
12147 | create_excep_cond_exprs (struct ada_catchpoint *c) | |
12148 | { | |
12149 | struct cleanup *old_chain; | |
12150 | struct bp_location *bl; | |
12151 | char *cond_string; | |
12152 | ||
12153 | /* Nothing to do if there's no specific exception to catch. */ | |
12154 | if (c->excep_string == NULL) | |
12155 | return; | |
12156 | ||
12157 | /* Same if there are no locations... */ | |
12158 | if (c->base.loc == NULL) | |
12159 | return; | |
12160 | ||
12161 | /* Compute the condition expression in text form, from the specific | |
12162 | expection we want to catch. */ | |
12163 | cond_string = ada_exception_catchpoint_cond_string (c->excep_string); | |
12164 | old_chain = make_cleanup (xfree, cond_string); | |
12165 | ||
12166 | /* Iterate over all the catchpoint's locations, and parse an | |
12167 | expression for each. */ | |
12168 | for (bl = c->base.loc; bl != NULL; bl = bl->next) | |
12169 | { | |
12170 | struct ada_catchpoint_location *ada_loc | |
12171 | = (struct ada_catchpoint_location *) bl; | |
12172 | struct expression *exp = NULL; | |
12173 | ||
12174 | if (!bl->shlib_disabled) | |
12175 | { | |
bbc13ae3 | 12176 | const char *s; |
28010a5d PA |
12177 | |
12178 | s = cond_string; | |
492d29ea | 12179 | TRY |
28010a5d | 12180 | { |
1bb9788d TT |
12181 | exp = parse_exp_1 (&s, bl->address, |
12182 | block_for_pc (bl->address), 0); | |
28010a5d | 12183 | } |
492d29ea | 12184 | CATCH (e, RETURN_MASK_ERROR) |
849f2b52 JB |
12185 | { |
12186 | warning (_("failed to reevaluate internal exception condition " | |
12187 | "for catchpoint %d: %s"), | |
12188 | c->base.number, e.message); | |
12189 | /* There is a bug in GCC on sparc-solaris when building with | |
12190 | optimization which causes EXP to change unexpectedly | |
12191 | (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982). | |
12192 | The problem should be fixed starting with GCC 4.9. | |
12193 | In the meantime, work around it by forcing EXP back | |
12194 | to NULL. */ | |
12195 | exp = NULL; | |
12196 | } | |
492d29ea | 12197 | END_CATCH |
28010a5d PA |
12198 | } |
12199 | ||
12200 | ada_loc->excep_cond_expr = exp; | |
12201 | } | |
12202 | ||
12203 | do_cleanups (old_chain); | |
12204 | } | |
12205 | ||
12206 | /* Implement the DTOR method in the breakpoint_ops structure for all | |
12207 | exception catchpoint kinds. */ | |
12208 | ||
12209 | static void | |
761269c8 | 12210 | dtor_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b) |
28010a5d PA |
12211 | { |
12212 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; | |
12213 | ||
12214 | xfree (c->excep_string); | |
348d480f | 12215 | |
2060206e | 12216 | bkpt_breakpoint_ops.dtor (b); |
28010a5d PA |
12217 | } |
12218 | ||
12219 | /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops | |
12220 | structure for all exception catchpoint kinds. */ | |
12221 | ||
12222 | static struct bp_location * | |
761269c8 | 12223 | allocate_location_exception (enum ada_exception_catchpoint_kind ex, |
28010a5d PA |
12224 | struct breakpoint *self) |
12225 | { | |
12226 | struct ada_catchpoint_location *loc; | |
12227 | ||
12228 | loc = XNEW (struct ada_catchpoint_location); | |
12229 | init_bp_location (&loc->base, &ada_catchpoint_location_ops, self); | |
12230 | loc->excep_cond_expr = NULL; | |
12231 | return &loc->base; | |
12232 | } | |
12233 | ||
12234 | /* Implement the RE_SET method in the breakpoint_ops structure for all | |
12235 | exception catchpoint kinds. */ | |
12236 | ||
12237 | static void | |
761269c8 | 12238 | re_set_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b) |
28010a5d PA |
12239 | { |
12240 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; | |
12241 | ||
12242 | /* Call the base class's method. This updates the catchpoint's | |
12243 | locations. */ | |
2060206e | 12244 | bkpt_breakpoint_ops.re_set (b); |
28010a5d PA |
12245 | |
12246 | /* Reparse the exception conditional expressions. One for each | |
12247 | location. */ | |
12248 | create_excep_cond_exprs (c); | |
12249 | } | |
12250 | ||
12251 | /* Returns true if we should stop for this breakpoint hit. If the | |
12252 | user specified a specific exception, we only want to cause a stop | |
12253 | if the program thrown that exception. */ | |
12254 | ||
12255 | static int | |
12256 | should_stop_exception (const struct bp_location *bl) | |
12257 | { | |
12258 | struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner; | |
12259 | const struct ada_catchpoint_location *ada_loc | |
12260 | = (const struct ada_catchpoint_location *) bl; | |
28010a5d PA |
12261 | int stop; |
12262 | ||
12263 | /* With no specific exception, should always stop. */ | |
12264 | if (c->excep_string == NULL) | |
12265 | return 1; | |
12266 | ||
12267 | if (ada_loc->excep_cond_expr == NULL) | |
12268 | { | |
12269 | /* We will have a NULL expression if back when we were creating | |
12270 | the expressions, this location's had failed to parse. */ | |
12271 | return 1; | |
12272 | } | |
12273 | ||
12274 | stop = 1; | |
492d29ea | 12275 | TRY |
28010a5d PA |
12276 | { |
12277 | struct value *mark; | |
12278 | ||
12279 | mark = value_mark (); | |
12280 | stop = value_true (evaluate_expression (ada_loc->excep_cond_expr)); | |
12281 | value_free_to_mark (mark); | |
12282 | } | |
492d29ea PA |
12283 | CATCH (ex, RETURN_MASK_ALL) |
12284 | { | |
12285 | exception_fprintf (gdb_stderr, ex, | |
12286 | _("Error in testing exception condition:\n")); | |
12287 | } | |
12288 | END_CATCH | |
12289 | ||
28010a5d PA |
12290 | return stop; |
12291 | } | |
12292 | ||
12293 | /* Implement the CHECK_STATUS method in the breakpoint_ops structure | |
12294 | for all exception catchpoint kinds. */ | |
12295 | ||
12296 | static void | |
761269c8 | 12297 | check_status_exception (enum ada_exception_catchpoint_kind ex, bpstat bs) |
28010a5d PA |
12298 | { |
12299 | bs->stop = should_stop_exception (bs->bp_location_at); | |
12300 | } | |
12301 | ||
f7f9143b JB |
12302 | /* Implement the PRINT_IT method in the breakpoint_ops structure |
12303 | for all exception catchpoint kinds. */ | |
12304 | ||
12305 | static enum print_stop_action | |
761269c8 | 12306 | print_it_exception (enum ada_exception_catchpoint_kind ex, bpstat bs) |
f7f9143b | 12307 | { |
79a45e25 | 12308 | struct ui_out *uiout = current_uiout; |
348d480f PA |
12309 | struct breakpoint *b = bs->breakpoint_at; |
12310 | ||
956a9fb9 | 12311 | annotate_catchpoint (b->number); |
f7f9143b | 12312 | |
956a9fb9 | 12313 | if (ui_out_is_mi_like_p (uiout)) |
f7f9143b | 12314 | { |
956a9fb9 JB |
12315 | ui_out_field_string (uiout, "reason", |
12316 | async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT)); | |
12317 | ui_out_field_string (uiout, "disp", bpdisp_text (b->disposition)); | |
f7f9143b JB |
12318 | } |
12319 | ||
00eb2c4a JB |
12320 | ui_out_text (uiout, |
12321 | b->disposition == disp_del ? "\nTemporary catchpoint " | |
12322 | : "\nCatchpoint "); | |
956a9fb9 JB |
12323 | ui_out_field_int (uiout, "bkptno", b->number); |
12324 | ui_out_text (uiout, ", "); | |
f7f9143b | 12325 | |
f7f9143b JB |
12326 | switch (ex) |
12327 | { | |
761269c8 JB |
12328 | case ada_catch_exception: |
12329 | case ada_catch_exception_unhandled: | |
956a9fb9 JB |
12330 | { |
12331 | const CORE_ADDR addr = ada_exception_name_addr (ex, b); | |
12332 | char exception_name[256]; | |
12333 | ||
12334 | if (addr != 0) | |
12335 | { | |
c714b426 PA |
12336 | read_memory (addr, (gdb_byte *) exception_name, |
12337 | sizeof (exception_name) - 1); | |
956a9fb9 JB |
12338 | exception_name [sizeof (exception_name) - 1] = '\0'; |
12339 | } | |
12340 | else | |
12341 | { | |
12342 | /* For some reason, we were unable to read the exception | |
12343 | name. This could happen if the Runtime was compiled | |
12344 | without debugging info, for instance. In that case, | |
12345 | just replace the exception name by the generic string | |
12346 | "exception" - it will read as "an exception" in the | |
12347 | notification we are about to print. */ | |
967cff16 | 12348 | memcpy (exception_name, "exception", sizeof ("exception")); |
956a9fb9 JB |
12349 | } |
12350 | /* In the case of unhandled exception breakpoints, we print | |
12351 | the exception name as "unhandled EXCEPTION_NAME", to make | |
12352 | it clearer to the user which kind of catchpoint just got | |
12353 | hit. We used ui_out_text to make sure that this extra | |
12354 | info does not pollute the exception name in the MI case. */ | |
761269c8 | 12355 | if (ex == ada_catch_exception_unhandled) |
956a9fb9 JB |
12356 | ui_out_text (uiout, "unhandled "); |
12357 | ui_out_field_string (uiout, "exception-name", exception_name); | |
12358 | } | |
12359 | break; | |
761269c8 | 12360 | case ada_catch_assert: |
956a9fb9 JB |
12361 | /* In this case, the name of the exception is not really |
12362 | important. Just print "failed assertion" to make it clearer | |
12363 | that his program just hit an assertion-failure catchpoint. | |
12364 | We used ui_out_text because this info does not belong in | |
12365 | the MI output. */ | |
12366 | ui_out_text (uiout, "failed assertion"); | |
12367 | break; | |
f7f9143b | 12368 | } |
956a9fb9 JB |
12369 | ui_out_text (uiout, " at "); |
12370 | ada_find_printable_frame (get_current_frame ()); | |
f7f9143b JB |
12371 | |
12372 | return PRINT_SRC_AND_LOC; | |
12373 | } | |
12374 | ||
12375 | /* Implement the PRINT_ONE method in the breakpoint_ops structure | |
12376 | for all exception catchpoint kinds. */ | |
12377 | ||
12378 | static void | |
761269c8 | 12379 | print_one_exception (enum ada_exception_catchpoint_kind ex, |
a6d9a66e | 12380 | struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12381 | { |
79a45e25 | 12382 | struct ui_out *uiout = current_uiout; |
28010a5d | 12383 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
79a45b7d TT |
12384 | struct value_print_options opts; |
12385 | ||
12386 | get_user_print_options (&opts); | |
12387 | if (opts.addressprint) | |
f7f9143b JB |
12388 | { |
12389 | annotate_field (4); | |
5af949e3 | 12390 | ui_out_field_core_addr (uiout, "addr", b->loc->gdbarch, b->loc->address); |
f7f9143b JB |
12391 | } |
12392 | ||
12393 | annotate_field (5); | |
a6d9a66e | 12394 | *last_loc = b->loc; |
f7f9143b JB |
12395 | switch (ex) |
12396 | { | |
761269c8 | 12397 | case ada_catch_exception: |
28010a5d | 12398 | if (c->excep_string != NULL) |
f7f9143b | 12399 | { |
28010a5d PA |
12400 | char *msg = xstrprintf (_("`%s' Ada exception"), c->excep_string); |
12401 | ||
f7f9143b JB |
12402 | ui_out_field_string (uiout, "what", msg); |
12403 | xfree (msg); | |
12404 | } | |
12405 | else | |
12406 | ui_out_field_string (uiout, "what", "all Ada exceptions"); | |
12407 | ||
12408 | break; | |
12409 | ||
761269c8 | 12410 | case ada_catch_exception_unhandled: |
f7f9143b JB |
12411 | ui_out_field_string (uiout, "what", "unhandled Ada exceptions"); |
12412 | break; | |
12413 | ||
761269c8 | 12414 | case ada_catch_assert: |
f7f9143b JB |
12415 | ui_out_field_string (uiout, "what", "failed Ada assertions"); |
12416 | break; | |
12417 | ||
12418 | default: | |
12419 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12420 | break; | |
12421 | } | |
12422 | } | |
12423 | ||
12424 | /* Implement the PRINT_MENTION method in the breakpoint_ops structure | |
12425 | for all exception catchpoint kinds. */ | |
12426 | ||
12427 | static void | |
761269c8 | 12428 | print_mention_exception (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12429 | struct breakpoint *b) |
12430 | { | |
28010a5d | 12431 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
79a45e25 | 12432 | struct ui_out *uiout = current_uiout; |
28010a5d | 12433 | |
00eb2c4a JB |
12434 | ui_out_text (uiout, b->disposition == disp_del ? _("Temporary catchpoint ") |
12435 | : _("Catchpoint ")); | |
12436 | ui_out_field_int (uiout, "bkptno", b->number); | |
12437 | ui_out_text (uiout, ": "); | |
12438 | ||
f7f9143b JB |
12439 | switch (ex) |
12440 | { | |
761269c8 | 12441 | case ada_catch_exception: |
28010a5d | 12442 | if (c->excep_string != NULL) |
00eb2c4a JB |
12443 | { |
12444 | char *info = xstrprintf (_("`%s' Ada exception"), c->excep_string); | |
12445 | struct cleanup *old_chain = make_cleanup (xfree, info); | |
12446 | ||
12447 | ui_out_text (uiout, info); | |
12448 | do_cleanups (old_chain); | |
12449 | } | |
f7f9143b | 12450 | else |
00eb2c4a | 12451 | ui_out_text (uiout, _("all Ada exceptions")); |
f7f9143b JB |
12452 | break; |
12453 | ||
761269c8 | 12454 | case ada_catch_exception_unhandled: |
00eb2c4a | 12455 | ui_out_text (uiout, _("unhandled Ada exceptions")); |
f7f9143b JB |
12456 | break; |
12457 | ||
761269c8 | 12458 | case ada_catch_assert: |
00eb2c4a | 12459 | ui_out_text (uiout, _("failed Ada assertions")); |
f7f9143b JB |
12460 | break; |
12461 | ||
12462 | default: | |
12463 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12464 | break; | |
12465 | } | |
12466 | } | |
12467 | ||
6149aea9 PA |
12468 | /* Implement the PRINT_RECREATE method in the breakpoint_ops structure |
12469 | for all exception catchpoint kinds. */ | |
12470 | ||
12471 | static void | |
761269c8 | 12472 | print_recreate_exception (enum ada_exception_catchpoint_kind ex, |
6149aea9 PA |
12473 | struct breakpoint *b, struct ui_file *fp) |
12474 | { | |
28010a5d PA |
12475 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
12476 | ||
6149aea9 PA |
12477 | switch (ex) |
12478 | { | |
761269c8 | 12479 | case ada_catch_exception: |
6149aea9 | 12480 | fprintf_filtered (fp, "catch exception"); |
28010a5d PA |
12481 | if (c->excep_string != NULL) |
12482 | fprintf_filtered (fp, " %s", c->excep_string); | |
6149aea9 PA |
12483 | break; |
12484 | ||
761269c8 | 12485 | case ada_catch_exception_unhandled: |
78076abc | 12486 | fprintf_filtered (fp, "catch exception unhandled"); |
6149aea9 PA |
12487 | break; |
12488 | ||
761269c8 | 12489 | case ada_catch_assert: |
6149aea9 PA |
12490 | fprintf_filtered (fp, "catch assert"); |
12491 | break; | |
12492 | ||
12493 | default: | |
12494 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12495 | } | |
d9b3f62e | 12496 | print_recreate_thread (b, fp); |
6149aea9 PA |
12497 | } |
12498 | ||
f7f9143b JB |
12499 | /* Virtual table for "catch exception" breakpoints. */ |
12500 | ||
28010a5d PA |
12501 | static void |
12502 | dtor_catch_exception (struct breakpoint *b) | |
12503 | { | |
761269c8 | 12504 | dtor_exception (ada_catch_exception, b); |
28010a5d PA |
12505 | } |
12506 | ||
12507 | static struct bp_location * | |
12508 | allocate_location_catch_exception (struct breakpoint *self) | |
12509 | { | |
761269c8 | 12510 | return allocate_location_exception (ada_catch_exception, self); |
28010a5d PA |
12511 | } |
12512 | ||
12513 | static void | |
12514 | re_set_catch_exception (struct breakpoint *b) | |
12515 | { | |
761269c8 | 12516 | re_set_exception (ada_catch_exception, b); |
28010a5d PA |
12517 | } |
12518 | ||
12519 | static void | |
12520 | check_status_catch_exception (bpstat bs) | |
12521 | { | |
761269c8 | 12522 | check_status_exception (ada_catch_exception, bs); |
28010a5d PA |
12523 | } |
12524 | ||
f7f9143b | 12525 | static enum print_stop_action |
348d480f | 12526 | print_it_catch_exception (bpstat bs) |
f7f9143b | 12527 | { |
761269c8 | 12528 | return print_it_exception (ada_catch_exception, bs); |
f7f9143b JB |
12529 | } |
12530 | ||
12531 | static void | |
a6d9a66e | 12532 | print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12533 | { |
761269c8 | 12534 | print_one_exception (ada_catch_exception, b, last_loc); |
f7f9143b JB |
12535 | } |
12536 | ||
12537 | static void | |
12538 | print_mention_catch_exception (struct breakpoint *b) | |
12539 | { | |
761269c8 | 12540 | print_mention_exception (ada_catch_exception, b); |
f7f9143b JB |
12541 | } |
12542 | ||
6149aea9 PA |
12543 | static void |
12544 | print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp) | |
12545 | { | |
761269c8 | 12546 | print_recreate_exception (ada_catch_exception, b, fp); |
6149aea9 PA |
12547 | } |
12548 | ||
2060206e | 12549 | static struct breakpoint_ops catch_exception_breakpoint_ops; |
f7f9143b JB |
12550 | |
12551 | /* Virtual table for "catch exception unhandled" breakpoints. */ | |
12552 | ||
28010a5d PA |
12553 | static void |
12554 | dtor_catch_exception_unhandled (struct breakpoint *b) | |
12555 | { | |
761269c8 | 12556 | dtor_exception (ada_catch_exception_unhandled, b); |
28010a5d PA |
12557 | } |
12558 | ||
12559 | static struct bp_location * | |
12560 | allocate_location_catch_exception_unhandled (struct breakpoint *self) | |
12561 | { | |
761269c8 | 12562 | return allocate_location_exception (ada_catch_exception_unhandled, self); |
28010a5d PA |
12563 | } |
12564 | ||
12565 | static void | |
12566 | re_set_catch_exception_unhandled (struct breakpoint *b) | |
12567 | { | |
761269c8 | 12568 | re_set_exception (ada_catch_exception_unhandled, b); |
28010a5d PA |
12569 | } |
12570 | ||
12571 | static void | |
12572 | check_status_catch_exception_unhandled (bpstat bs) | |
12573 | { | |
761269c8 | 12574 | check_status_exception (ada_catch_exception_unhandled, bs); |
28010a5d PA |
12575 | } |
12576 | ||
f7f9143b | 12577 | static enum print_stop_action |
348d480f | 12578 | print_it_catch_exception_unhandled (bpstat bs) |
f7f9143b | 12579 | { |
761269c8 | 12580 | return print_it_exception (ada_catch_exception_unhandled, bs); |
f7f9143b JB |
12581 | } |
12582 | ||
12583 | static void | |
a6d9a66e UW |
12584 | print_one_catch_exception_unhandled (struct breakpoint *b, |
12585 | struct bp_location **last_loc) | |
f7f9143b | 12586 | { |
761269c8 | 12587 | print_one_exception (ada_catch_exception_unhandled, b, last_loc); |
f7f9143b JB |
12588 | } |
12589 | ||
12590 | static void | |
12591 | print_mention_catch_exception_unhandled (struct breakpoint *b) | |
12592 | { | |
761269c8 | 12593 | print_mention_exception (ada_catch_exception_unhandled, b); |
f7f9143b JB |
12594 | } |
12595 | ||
6149aea9 PA |
12596 | static void |
12597 | print_recreate_catch_exception_unhandled (struct breakpoint *b, | |
12598 | struct ui_file *fp) | |
12599 | { | |
761269c8 | 12600 | print_recreate_exception (ada_catch_exception_unhandled, b, fp); |
6149aea9 PA |
12601 | } |
12602 | ||
2060206e | 12603 | static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops; |
f7f9143b JB |
12604 | |
12605 | /* Virtual table for "catch assert" breakpoints. */ | |
12606 | ||
28010a5d PA |
12607 | static void |
12608 | dtor_catch_assert (struct breakpoint *b) | |
12609 | { | |
761269c8 | 12610 | dtor_exception (ada_catch_assert, b); |
28010a5d PA |
12611 | } |
12612 | ||
12613 | static struct bp_location * | |
12614 | allocate_location_catch_assert (struct breakpoint *self) | |
12615 | { | |
761269c8 | 12616 | return allocate_location_exception (ada_catch_assert, self); |
28010a5d PA |
12617 | } |
12618 | ||
12619 | static void | |
12620 | re_set_catch_assert (struct breakpoint *b) | |
12621 | { | |
761269c8 | 12622 | re_set_exception (ada_catch_assert, b); |
28010a5d PA |
12623 | } |
12624 | ||
12625 | static void | |
12626 | check_status_catch_assert (bpstat bs) | |
12627 | { | |
761269c8 | 12628 | check_status_exception (ada_catch_assert, bs); |
28010a5d PA |
12629 | } |
12630 | ||
f7f9143b | 12631 | static enum print_stop_action |
348d480f | 12632 | print_it_catch_assert (bpstat bs) |
f7f9143b | 12633 | { |
761269c8 | 12634 | return print_it_exception (ada_catch_assert, bs); |
f7f9143b JB |
12635 | } |
12636 | ||
12637 | static void | |
a6d9a66e | 12638 | print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12639 | { |
761269c8 | 12640 | print_one_exception (ada_catch_assert, b, last_loc); |
f7f9143b JB |
12641 | } |
12642 | ||
12643 | static void | |
12644 | print_mention_catch_assert (struct breakpoint *b) | |
12645 | { | |
761269c8 | 12646 | print_mention_exception (ada_catch_assert, b); |
f7f9143b JB |
12647 | } |
12648 | ||
6149aea9 PA |
12649 | static void |
12650 | print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp) | |
12651 | { | |
761269c8 | 12652 | print_recreate_exception (ada_catch_assert, b, fp); |
6149aea9 PA |
12653 | } |
12654 | ||
2060206e | 12655 | static struct breakpoint_ops catch_assert_breakpoint_ops; |
f7f9143b | 12656 | |
f7f9143b JB |
12657 | /* Return a newly allocated copy of the first space-separated token |
12658 | in ARGSP, and then adjust ARGSP to point immediately after that | |
12659 | token. | |
12660 | ||
12661 | Return NULL if ARGPS does not contain any more tokens. */ | |
12662 | ||
12663 | static char * | |
12664 | ada_get_next_arg (char **argsp) | |
12665 | { | |
12666 | char *args = *argsp; | |
12667 | char *end; | |
12668 | char *result; | |
12669 | ||
0fcd72ba | 12670 | args = skip_spaces (args); |
f7f9143b JB |
12671 | if (args[0] == '\0') |
12672 | return NULL; /* No more arguments. */ | |
12673 | ||
12674 | /* Find the end of the current argument. */ | |
12675 | ||
0fcd72ba | 12676 | end = skip_to_space (args); |
f7f9143b JB |
12677 | |
12678 | /* Adjust ARGSP to point to the start of the next argument. */ | |
12679 | ||
12680 | *argsp = end; | |
12681 | ||
12682 | /* Make a copy of the current argument and return it. */ | |
12683 | ||
12684 | result = xmalloc (end - args + 1); | |
12685 | strncpy (result, args, end - args); | |
12686 | result[end - args] = '\0'; | |
12687 | ||
12688 | return result; | |
12689 | } | |
12690 | ||
12691 | /* Split the arguments specified in a "catch exception" command. | |
12692 | Set EX to the appropriate catchpoint type. | |
28010a5d | 12693 | Set EXCEP_STRING to the name of the specific exception if |
5845583d JB |
12694 | specified by the user. |
12695 | If a condition is found at the end of the arguments, the condition | |
12696 | expression is stored in COND_STRING (memory must be deallocated | |
12697 | after use). Otherwise COND_STRING is set to NULL. */ | |
f7f9143b JB |
12698 | |
12699 | static void | |
12700 | catch_ada_exception_command_split (char *args, | |
761269c8 | 12701 | enum ada_exception_catchpoint_kind *ex, |
5845583d JB |
12702 | char **excep_string, |
12703 | char **cond_string) | |
f7f9143b JB |
12704 | { |
12705 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); | |
12706 | char *exception_name; | |
5845583d | 12707 | char *cond = NULL; |
f7f9143b JB |
12708 | |
12709 | exception_name = ada_get_next_arg (&args); | |
5845583d JB |
12710 | if (exception_name != NULL && strcmp (exception_name, "if") == 0) |
12711 | { | |
12712 | /* This is not an exception name; this is the start of a condition | |
12713 | expression for a catchpoint on all exceptions. So, "un-get" | |
12714 | this token, and set exception_name to NULL. */ | |
12715 | xfree (exception_name); | |
12716 | exception_name = NULL; | |
12717 | args -= 2; | |
12718 | } | |
f7f9143b JB |
12719 | make_cleanup (xfree, exception_name); |
12720 | ||
5845583d | 12721 | /* Check to see if we have a condition. */ |
f7f9143b | 12722 | |
0fcd72ba | 12723 | args = skip_spaces (args); |
61012eef | 12724 | if (startswith (args, "if") |
5845583d JB |
12725 | && (isspace (args[2]) || args[2] == '\0')) |
12726 | { | |
12727 | args += 2; | |
12728 | args = skip_spaces (args); | |
12729 | ||
12730 | if (args[0] == '\0') | |
12731 | error (_("Condition missing after `if' keyword")); | |
12732 | cond = xstrdup (args); | |
12733 | make_cleanup (xfree, cond); | |
12734 | ||
12735 | args += strlen (args); | |
12736 | } | |
12737 | ||
12738 | /* Check that we do not have any more arguments. Anything else | |
12739 | is unexpected. */ | |
f7f9143b JB |
12740 | |
12741 | if (args[0] != '\0') | |
12742 | error (_("Junk at end of expression")); | |
12743 | ||
12744 | discard_cleanups (old_chain); | |
12745 | ||
12746 | if (exception_name == NULL) | |
12747 | { | |
12748 | /* Catch all exceptions. */ | |
761269c8 | 12749 | *ex = ada_catch_exception; |
28010a5d | 12750 | *excep_string = NULL; |
f7f9143b JB |
12751 | } |
12752 | else if (strcmp (exception_name, "unhandled") == 0) | |
12753 | { | |
12754 | /* Catch unhandled exceptions. */ | |
761269c8 | 12755 | *ex = ada_catch_exception_unhandled; |
28010a5d | 12756 | *excep_string = NULL; |
f7f9143b JB |
12757 | } |
12758 | else | |
12759 | { | |
12760 | /* Catch a specific exception. */ | |
761269c8 | 12761 | *ex = ada_catch_exception; |
28010a5d | 12762 | *excep_string = exception_name; |
f7f9143b | 12763 | } |
5845583d | 12764 | *cond_string = cond; |
f7f9143b JB |
12765 | } |
12766 | ||
12767 | /* Return the name of the symbol on which we should break in order to | |
12768 | implement a catchpoint of the EX kind. */ | |
12769 | ||
12770 | static const char * | |
761269c8 | 12771 | ada_exception_sym_name (enum ada_exception_catchpoint_kind ex) |
f7f9143b | 12772 | { |
3eecfa55 JB |
12773 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
12774 | ||
12775 | gdb_assert (data->exception_info != NULL); | |
0259addd | 12776 | |
f7f9143b JB |
12777 | switch (ex) |
12778 | { | |
761269c8 | 12779 | case ada_catch_exception: |
3eecfa55 | 12780 | return (data->exception_info->catch_exception_sym); |
f7f9143b | 12781 | break; |
761269c8 | 12782 | case ada_catch_exception_unhandled: |
3eecfa55 | 12783 | return (data->exception_info->catch_exception_unhandled_sym); |
f7f9143b | 12784 | break; |
761269c8 | 12785 | case ada_catch_assert: |
3eecfa55 | 12786 | return (data->exception_info->catch_assert_sym); |
f7f9143b JB |
12787 | break; |
12788 | default: | |
12789 | internal_error (__FILE__, __LINE__, | |
12790 | _("unexpected catchpoint kind (%d)"), ex); | |
12791 | } | |
12792 | } | |
12793 | ||
12794 | /* Return the breakpoint ops "virtual table" used for catchpoints | |
12795 | of the EX kind. */ | |
12796 | ||
c0a91b2b | 12797 | static const struct breakpoint_ops * |
761269c8 | 12798 | ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex) |
f7f9143b JB |
12799 | { |
12800 | switch (ex) | |
12801 | { | |
761269c8 | 12802 | case ada_catch_exception: |
f7f9143b JB |
12803 | return (&catch_exception_breakpoint_ops); |
12804 | break; | |
761269c8 | 12805 | case ada_catch_exception_unhandled: |
f7f9143b JB |
12806 | return (&catch_exception_unhandled_breakpoint_ops); |
12807 | break; | |
761269c8 | 12808 | case ada_catch_assert: |
f7f9143b JB |
12809 | return (&catch_assert_breakpoint_ops); |
12810 | break; | |
12811 | default: | |
12812 | internal_error (__FILE__, __LINE__, | |
12813 | _("unexpected catchpoint kind (%d)"), ex); | |
12814 | } | |
12815 | } | |
12816 | ||
12817 | /* Return the condition that will be used to match the current exception | |
12818 | being raised with the exception that the user wants to catch. This | |
12819 | assumes that this condition is used when the inferior just triggered | |
12820 | an exception catchpoint. | |
12821 | ||
12822 | The string returned is a newly allocated string that needs to be | |
12823 | deallocated later. */ | |
12824 | ||
12825 | static char * | |
28010a5d | 12826 | ada_exception_catchpoint_cond_string (const char *excep_string) |
f7f9143b | 12827 | { |
3d0b0fa3 JB |
12828 | int i; |
12829 | ||
0963b4bd | 12830 | /* The standard exceptions are a special case. They are defined in |
3d0b0fa3 | 12831 | runtime units that have been compiled without debugging info; if |
28010a5d | 12832 | EXCEP_STRING is the not-fully-qualified name of a standard |
3d0b0fa3 JB |
12833 | exception (e.g. "constraint_error") then, during the evaluation |
12834 | of the condition expression, the symbol lookup on this name would | |
0963b4bd | 12835 | *not* return this standard exception. The catchpoint condition |
3d0b0fa3 JB |
12836 | may then be set only on user-defined exceptions which have the |
12837 | same not-fully-qualified name (e.g. my_package.constraint_error). | |
12838 | ||
12839 | To avoid this unexcepted behavior, these standard exceptions are | |
0963b4bd | 12840 | systematically prefixed by "standard". This means that "catch |
3d0b0fa3 JB |
12841 | exception constraint_error" is rewritten into "catch exception |
12842 | standard.constraint_error". | |
12843 | ||
12844 | If an exception named contraint_error is defined in another package of | |
12845 | the inferior program, then the only way to specify this exception as a | |
12846 | breakpoint condition is to use its fully-qualified named: | |
12847 | e.g. my_package.constraint_error. */ | |
12848 | ||
12849 | for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++) | |
12850 | { | |
28010a5d | 12851 | if (strcmp (standard_exc [i], excep_string) == 0) |
3d0b0fa3 JB |
12852 | { |
12853 | return xstrprintf ("long_integer (e) = long_integer (&standard.%s)", | |
28010a5d | 12854 | excep_string); |
3d0b0fa3 JB |
12855 | } |
12856 | } | |
28010a5d | 12857 | return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string); |
f7f9143b JB |
12858 | } |
12859 | ||
12860 | /* Return the symtab_and_line that should be used to insert an exception | |
12861 | catchpoint of the TYPE kind. | |
12862 | ||
28010a5d PA |
12863 | EXCEP_STRING should contain the name of a specific exception that |
12864 | the catchpoint should catch, or NULL otherwise. | |
f7f9143b | 12865 | |
28010a5d PA |
12866 | ADDR_STRING returns the name of the function where the real |
12867 | breakpoint that implements the catchpoints is set, depending on the | |
12868 | type of catchpoint we need to create. */ | |
f7f9143b JB |
12869 | |
12870 | static struct symtab_and_line | |
761269c8 | 12871 | ada_exception_sal (enum ada_exception_catchpoint_kind ex, char *excep_string, |
c0a91b2b | 12872 | char **addr_string, const struct breakpoint_ops **ops) |
f7f9143b JB |
12873 | { |
12874 | const char *sym_name; | |
12875 | struct symbol *sym; | |
f7f9143b | 12876 | |
0259addd JB |
12877 | /* First, find out which exception support info to use. */ |
12878 | ada_exception_support_info_sniffer (); | |
12879 | ||
12880 | /* Then lookup the function on which we will break in order to catch | |
f7f9143b | 12881 | the Ada exceptions requested by the user. */ |
f7f9143b JB |
12882 | sym_name = ada_exception_sym_name (ex); |
12883 | sym = standard_lookup (sym_name, NULL, VAR_DOMAIN); | |
12884 | ||
f17011e0 JB |
12885 | /* We can assume that SYM is not NULL at this stage. If the symbol |
12886 | did not exist, ada_exception_support_info_sniffer would have | |
12887 | raised an exception. | |
f7f9143b | 12888 | |
f17011e0 JB |
12889 | Also, ada_exception_support_info_sniffer should have already |
12890 | verified that SYM is a function symbol. */ | |
12891 | gdb_assert (sym != NULL); | |
12892 | gdb_assert (SYMBOL_CLASS (sym) == LOC_BLOCK); | |
f7f9143b JB |
12893 | |
12894 | /* Set ADDR_STRING. */ | |
f7f9143b JB |
12895 | *addr_string = xstrdup (sym_name); |
12896 | ||
f7f9143b | 12897 | /* Set OPS. */ |
4b9eee8c | 12898 | *ops = ada_exception_breakpoint_ops (ex); |
f7f9143b | 12899 | |
f17011e0 | 12900 | return find_function_start_sal (sym, 1); |
f7f9143b JB |
12901 | } |
12902 | ||
b4a5b78b | 12903 | /* Create an Ada exception catchpoint. |
f7f9143b | 12904 | |
b4a5b78b | 12905 | EX_KIND is the kind of exception catchpoint to be created. |
5845583d | 12906 | |
2df4d1d5 JB |
12907 | If EXCEPT_STRING is NULL, this catchpoint is expected to trigger |
12908 | for all exceptions. Otherwise, EXCEPT_STRING indicates the name | |
12909 | of the exception to which this catchpoint applies. When not NULL, | |
12910 | the string must be allocated on the heap, and its deallocation | |
12911 | is no longer the responsibility of the caller. | |
12912 | ||
12913 | COND_STRING, if not NULL, is the catchpoint condition. This string | |
12914 | must be allocated on the heap, and its deallocation is no longer | |
12915 | the responsibility of the caller. | |
f7f9143b | 12916 | |
b4a5b78b JB |
12917 | TEMPFLAG, if nonzero, means that the underlying breakpoint |
12918 | should be temporary. | |
28010a5d | 12919 | |
b4a5b78b | 12920 | FROM_TTY is the usual argument passed to all commands implementations. */ |
28010a5d | 12921 | |
349774ef | 12922 | void |
28010a5d | 12923 | create_ada_exception_catchpoint (struct gdbarch *gdbarch, |
761269c8 | 12924 | enum ada_exception_catchpoint_kind ex_kind, |
28010a5d | 12925 | char *excep_string, |
5845583d | 12926 | char *cond_string, |
28010a5d | 12927 | int tempflag, |
349774ef | 12928 | int disabled, |
28010a5d PA |
12929 | int from_tty) |
12930 | { | |
12931 | struct ada_catchpoint *c; | |
b4a5b78b JB |
12932 | char *addr_string = NULL; |
12933 | const struct breakpoint_ops *ops = NULL; | |
12934 | struct symtab_and_line sal | |
12935 | = ada_exception_sal (ex_kind, excep_string, &addr_string, &ops); | |
28010a5d PA |
12936 | |
12937 | c = XNEW (struct ada_catchpoint); | |
12938 | init_ada_exception_breakpoint (&c->base, gdbarch, sal, addr_string, | |
349774ef | 12939 | ops, tempflag, disabled, from_tty); |
28010a5d PA |
12940 | c->excep_string = excep_string; |
12941 | create_excep_cond_exprs (c); | |
5845583d JB |
12942 | if (cond_string != NULL) |
12943 | set_breakpoint_condition (&c->base, cond_string, from_tty); | |
3ea46bff | 12944 | install_breakpoint (0, &c->base, 1); |
f7f9143b JB |
12945 | } |
12946 | ||
9ac4176b PA |
12947 | /* Implement the "catch exception" command. */ |
12948 | ||
12949 | static void | |
12950 | catch_ada_exception_command (char *arg, int from_tty, | |
12951 | struct cmd_list_element *command) | |
12952 | { | |
12953 | struct gdbarch *gdbarch = get_current_arch (); | |
12954 | int tempflag; | |
761269c8 | 12955 | enum ada_exception_catchpoint_kind ex_kind; |
28010a5d | 12956 | char *excep_string = NULL; |
5845583d | 12957 | char *cond_string = NULL; |
9ac4176b PA |
12958 | |
12959 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
12960 | ||
12961 | if (!arg) | |
12962 | arg = ""; | |
b4a5b78b JB |
12963 | catch_ada_exception_command_split (arg, &ex_kind, &excep_string, |
12964 | &cond_string); | |
12965 | create_ada_exception_catchpoint (gdbarch, ex_kind, | |
12966 | excep_string, cond_string, | |
349774ef JB |
12967 | tempflag, 1 /* enabled */, |
12968 | from_tty); | |
9ac4176b PA |
12969 | } |
12970 | ||
b4a5b78b | 12971 | /* Split the arguments specified in a "catch assert" command. |
5845583d | 12972 | |
b4a5b78b JB |
12973 | ARGS contains the command's arguments (or the empty string if |
12974 | no arguments were passed). | |
5845583d JB |
12975 | |
12976 | If ARGS contains a condition, set COND_STRING to that condition | |
b4a5b78b | 12977 | (the memory needs to be deallocated after use). */ |
5845583d | 12978 | |
b4a5b78b JB |
12979 | static void |
12980 | catch_ada_assert_command_split (char *args, char **cond_string) | |
f7f9143b | 12981 | { |
5845583d | 12982 | args = skip_spaces (args); |
f7f9143b | 12983 | |
5845583d | 12984 | /* Check whether a condition was provided. */ |
61012eef | 12985 | if (startswith (args, "if") |
5845583d | 12986 | && (isspace (args[2]) || args[2] == '\0')) |
f7f9143b | 12987 | { |
5845583d | 12988 | args += 2; |
0fcd72ba | 12989 | args = skip_spaces (args); |
5845583d JB |
12990 | if (args[0] == '\0') |
12991 | error (_("condition missing after `if' keyword")); | |
12992 | *cond_string = xstrdup (args); | |
f7f9143b JB |
12993 | } |
12994 | ||
5845583d JB |
12995 | /* Otherwise, there should be no other argument at the end of |
12996 | the command. */ | |
12997 | else if (args[0] != '\0') | |
12998 | error (_("Junk at end of arguments.")); | |
f7f9143b JB |
12999 | } |
13000 | ||
9ac4176b PA |
13001 | /* Implement the "catch assert" command. */ |
13002 | ||
13003 | static void | |
13004 | catch_assert_command (char *arg, int from_tty, | |
13005 | struct cmd_list_element *command) | |
13006 | { | |
13007 | struct gdbarch *gdbarch = get_current_arch (); | |
13008 | int tempflag; | |
5845583d | 13009 | char *cond_string = NULL; |
9ac4176b PA |
13010 | |
13011 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
13012 | ||
13013 | if (!arg) | |
13014 | arg = ""; | |
b4a5b78b | 13015 | catch_ada_assert_command_split (arg, &cond_string); |
761269c8 | 13016 | create_ada_exception_catchpoint (gdbarch, ada_catch_assert, |
b4a5b78b | 13017 | NULL, cond_string, |
349774ef JB |
13018 | tempflag, 1 /* enabled */, |
13019 | from_tty); | |
9ac4176b | 13020 | } |
778865d3 JB |
13021 | |
13022 | /* Return non-zero if the symbol SYM is an Ada exception object. */ | |
13023 | ||
13024 | static int | |
13025 | ada_is_exception_sym (struct symbol *sym) | |
13026 | { | |
13027 | const char *type_name = type_name_no_tag (SYMBOL_TYPE (sym)); | |
13028 | ||
13029 | return (SYMBOL_CLASS (sym) != LOC_TYPEDEF | |
13030 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
13031 | && SYMBOL_CLASS (sym) != LOC_CONST | |
13032 | && SYMBOL_CLASS (sym) != LOC_UNRESOLVED | |
13033 | && type_name != NULL && strcmp (type_name, "exception") == 0); | |
13034 | } | |
13035 | ||
13036 | /* Given a global symbol SYM, return non-zero iff SYM is a non-standard | |
13037 | Ada exception object. This matches all exceptions except the ones | |
13038 | defined by the Ada language. */ | |
13039 | ||
13040 | static int | |
13041 | ada_is_non_standard_exception_sym (struct symbol *sym) | |
13042 | { | |
13043 | int i; | |
13044 | ||
13045 | if (!ada_is_exception_sym (sym)) | |
13046 | return 0; | |
13047 | ||
13048 | for (i = 0; i < ARRAY_SIZE (standard_exc); i++) | |
13049 | if (strcmp (SYMBOL_LINKAGE_NAME (sym), standard_exc[i]) == 0) | |
13050 | return 0; /* A standard exception. */ | |
13051 | ||
13052 | /* Numeric_Error is also a standard exception, so exclude it. | |
13053 | See the STANDARD_EXC description for more details as to why | |
13054 | this exception is not listed in that array. */ | |
13055 | if (strcmp (SYMBOL_LINKAGE_NAME (sym), "numeric_error") == 0) | |
13056 | return 0; | |
13057 | ||
13058 | return 1; | |
13059 | } | |
13060 | ||
13061 | /* A helper function for qsort, comparing two struct ada_exc_info | |
13062 | objects. | |
13063 | ||
13064 | The comparison is determined first by exception name, and then | |
13065 | by exception address. */ | |
13066 | ||
13067 | static int | |
13068 | compare_ada_exception_info (const void *a, const void *b) | |
13069 | { | |
13070 | const struct ada_exc_info *exc_a = (struct ada_exc_info *) a; | |
13071 | const struct ada_exc_info *exc_b = (struct ada_exc_info *) b; | |
13072 | int result; | |
13073 | ||
13074 | result = strcmp (exc_a->name, exc_b->name); | |
13075 | if (result != 0) | |
13076 | return result; | |
13077 | ||
13078 | if (exc_a->addr < exc_b->addr) | |
13079 | return -1; | |
13080 | if (exc_a->addr > exc_b->addr) | |
13081 | return 1; | |
13082 | ||
13083 | return 0; | |
13084 | } | |
13085 | ||
13086 | /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison | |
13087 | routine, but keeping the first SKIP elements untouched. | |
13088 | ||
13089 | All duplicates are also removed. */ | |
13090 | ||
13091 | static void | |
13092 | sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info) **exceptions, | |
13093 | int skip) | |
13094 | { | |
13095 | struct ada_exc_info *to_sort | |
13096 | = VEC_address (ada_exc_info, *exceptions) + skip; | |
13097 | int to_sort_len | |
13098 | = VEC_length (ada_exc_info, *exceptions) - skip; | |
13099 | int i, j; | |
13100 | ||
13101 | qsort (to_sort, to_sort_len, sizeof (struct ada_exc_info), | |
13102 | compare_ada_exception_info); | |
13103 | ||
13104 | for (i = 1, j = 1; i < to_sort_len; i++) | |
13105 | if (compare_ada_exception_info (&to_sort[i], &to_sort[j - 1]) != 0) | |
13106 | to_sort[j++] = to_sort[i]; | |
13107 | to_sort_len = j; | |
13108 | VEC_truncate(ada_exc_info, *exceptions, skip + to_sort_len); | |
13109 | } | |
13110 | ||
13111 | /* A function intended as the "name_matcher" callback in the struct | |
13112 | quick_symbol_functions' expand_symtabs_matching method. | |
13113 | ||
13114 | SEARCH_NAME is the symbol's search name. | |
13115 | ||
13116 | If USER_DATA is not NULL, it is a pointer to a regext_t object | |
13117 | used to match the symbol (by natural name). Otherwise, when USER_DATA | |
13118 | is null, no filtering is performed, and all symbols are a positive | |
13119 | match. */ | |
13120 | ||
13121 | static int | |
13122 | ada_exc_search_name_matches (const char *search_name, void *user_data) | |
13123 | { | |
13124 | regex_t *preg = user_data; | |
13125 | ||
13126 | if (preg == NULL) | |
13127 | return 1; | |
13128 | ||
13129 | /* In Ada, the symbol "search name" is a linkage name, whereas | |
13130 | the regular expression used to do the matching refers to | |
13131 | the natural name. So match against the decoded name. */ | |
13132 | return (regexec (preg, ada_decode (search_name), 0, NULL, 0) == 0); | |
13133 | } | |
13134 | ||
13135 | /* Add all exceptions defined by the Ada standard whose name match | |
13136 | a regular expression. | |
13137 | ||
13138 | If PREG is not NULL, then this regexp_t object is used to | |
13139 | perform the symbol name matching. Otherwise, no name-based | |
13140 | filtering is performed. | |
13141 | ||
13142 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13143 | gets pushed. */ | |
13144 | ||
13145 | static void | |
13146 | ada_add_standard_exceptions (regex_t *preg, VEC(ada_exc_info) **exceptions) | |
13147 | { | |
13148 | int i; | |
13149 | ||
13150 | for (i = 0; i < ARRAY_SIZE (standard_exc); i++) | |
13151 | { | |
13152 | if (preg == NULL | |
13153 | || regexec (preg, standard_exc[i], 0, NULL, 0) == 0) | |
13154 | { | |
13155 | struct bound_minimal_symbol msymbol | |
13156 | = ada_lookup_simple_minsym (standard_exc[i]); | |
13157 | ||
13158 | if (msymbol.minsym != NULL) | |
13159 | { | |
13160 | struct ada_exc_info info | |
77e371c0 | 13161 | = {standard_exc[i], BMSYMBOL_VALUE_ADDRESS (msymbol)}; |
778865d3 JB |
13162 | |
13163 | VEC_safe_push (ada_exc_info, *exceptions, &info); | |
13164 | } | |
13165 | } | |
13166 | } | |
13167 | } | |
13168 | ||
13169 | /* Add all Ada exceptions defined locally and accessible from the given | |
13170 | FRAME. | |
13171 | ||
13172 | If PREG is not NULL, then this regexp_t object is used to | |
13173 | perform the symbol name matching. Otherwise, no name-based | |
13174 | filtering is performed. | |
13175 | ||
13176 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13177 | gets pushed. */ | |
13178 | ||
13179 | static void | |
13180 | ada_add_exceptions_from_frame (regex_t *preg, struct frame_info *frame, | |
13181 | VEC(ada_exc_info) **exceptions) | |
13182 | { | |
3977b71f | 13183 | const struct block *block = get_frame_block (frame, 0); |
778865d3 JB |
13184 | |
13185 | while (block != 0) | |
13186 | { | |
13187 | struct block_iterator iter; | |
13188 | struct symbol *sym; | |
13189 | ||
13190 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
13191 | { | |
13192 | switch (SYMBOL_CLASS (sym)) | |
13193 | { | |
13194 | case LOC_TYPEDEF: | |
13195 | case LOC_BLOCK: | |
13196 | case LOC_CONST: | |
13197 | break; | |
13198 | default: | |
13199 | if (ada_is_exception_sym (sym)) | |
13200 | { | |
13201 | struct ada_exc_info info = {SYMBOL_PRINT_NAME (sym), | |
13202 | SYMBOL_VALUE_ADDRESS (sym)}; | |
13203 | ||
13204 | VEC_safe_push (ada_exc_info, *exceptions, &info); | |
13205 | } | |
13206 | } | |
13207 | } | |
13208 | if (BLOCK_FUNCTION (block) != NULL) | |
13209 | break; | |
13210 | block = BLOCK_SUPERBLOCK (block); | |
13211 | } | |
13212 | } | |
13213 | ||
13214 | /* Add all exceptions defined globally whose name name match | |
13215 | a regular expression, excluding standard exceptions. | |
13216 | ||
13217 | The reason we exclude standard exceptions is that they need | |
13218 | to be handled separately: Standard exceptions are defined inside | |
13219 | a runtime unit which is normally not compiled with debugging info, | |
13220 | and thus usually do not show up in our symbol search. However, | |
13221 | if the unit was in fact built with debugging info, we need to | |
13222 | exclude them because they would duplicate the entry we found | |
13223 | during the special loop that specifically searches for those | |
13224 | standard exceptions. | |
13225 | ||
13226 | If PREG is not NULL, then this regexp_t object is used to | |
13227 | perform the symbol name matching. Otherwise, no name-based | |
13228 | filtering is performed. | |
13229 | ||
13230 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13231 | gets pushed. */ | |
13232 | ||
13233 | static void | |
13234 | ada_add_global_exceptions (regex_t *preg, VEC(ada_exc_info) **exceptions) | |
13235 | { | |
13236 | struct objfile *objfile; | |
43f3e411 | 13237 | struct compunit_symtab *s; |
778865d3 | 13238 | |
276d885b | 13239 | expand_symtabs_matching (NULL, ada_exc_search_name_matches, NULL, |
bb4142cf | 13240 | VARIABLES_DOMAIN, preg); |
778865d3 | 13241 | |
43f3e411 | 13242 | ALL_COMPUNITS (objfile, s) |
778865d3 | 13243 | { |
43f3e411 | 13244 | const struct blockvector *bv = COMPUNIT_BLOCKVECTOR (s); |
778865d3 JB |
13245 | int i; |
13246 | ||
13247 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) | |
13248 | { | |
13249 | struct block *b = BLOCKVECTOR_BLOCK (bv, i); | |
13250 | struct block_iterator iter; | |
13251 | struct symbol *sym; | |
13252 | ||
13253 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
13254 | if (ada_is_non_standard_exception_sym (sym) | |
13255 | && (preg == NULL | |
13256 | || regexec (preg, SYMBOL_NATURAL_NAME (sym), | |
13257 | 0, NULL, 0) == 0)) | |
13258 | { | |
13259 | struct ada_exc_info info | |
13260 | = {SYMBOL_PRINT_NAME (sym), SYMBOL_VALUE_ADDRESS (sym)}; | |
13261 | ||
13262 | VEC_safe_push (ada_exc_info, *exceptions, &info); | |
13263 | } | |
13264 | } | |
13265 | } | |
13266 | } | |
13267 | ||
13268 | /* Implements ada_exceptions_list with the regular expression passed | |
13269 | as a regex_t, rather than a string. | |
13270 | ||
13271 | If not NULL, PREG is used to filter out exceptions whose names | |
13272 | do not match. Otherwise, all exceptions are listed. */ | |
13273 | ||
13274 | static VEC(ada_exc_info) * | |
13275 | ada_exceptions_list_1 (regex_t *preg) | |
13276 | { | |
13277 | VEC(ada_exc_info) *result = NULL; | |
13278 | struct cleanup *old_chain | |
13279 | = make_cleanup (VEC_cleanup (ada_exc_info), &result); | |
13280 | int prev_len; | |
13281 | ||
13282 | /* First, list the known standard exceptions. These exceptions | |
13283 | need to be handled separately, as they are usually defined in | |
13284 | runtime units that have been compiled without debugging info. */ | |
13285 | ||
13286 | ada_add_standard_exceptions (preg, &result); | |
13287 | ||
13288 | /* Next, find all exceptions whose scope is local and accessible | |
13289 | from the currently selected frame. */ | |
13290 | ||
13291 | if (has_stack_frames ()) | |
13292 | { | |
13293 | prev_len = VEC_length (ada_exc_info, result); | |
13294 | ada_add_exceptions_from_frame (preg, get_selected_frame (NULL), | |
13295 | &result); | |
13296 | if (VEC_length (ada_exc_info, result) > prev_len) | |
13297 | sort_remove_dups_ada_exceptions_list (&result, prev_len); | |
13298 | } | |
13299 | ||
13300 | /* Add all exceptions whose scope is global. */ | |
13301 | ||
13302 | prev_len = VEC_length (ada_exc_info, result); | |
13303 | ada_add_global_exceptions (preg, &result); | |
13304 | if (VEC_length (ada_exc_info, result) > prev_len) | |
13305 | sort_remove_dups_ada_exceptions_list (&result, prev_len); | |
13306 | ||
13307 | discard_cleanups (old_chain); | |
13308 | return result; | |
13309 | } | |
13310 | ||
13311 | /* Return a vector of ada_exc_info. | |
13312 | ||
13313 | If REGEXP is NULL, all exceptions are included in the result. | |
13314 | Otherwise, it should contain a valid regular expression, | |
13315 | and only the exceptions whose names match that regular expression | |
13316 | are included in the result. | |
13317 | ||
13318 | The exceptions are sorted in the following order: | |
13319 | - Standard exceptions (defined by the Ada language), in | |
13320 | alphabetical order; | |
13321 | - Exceptions only visible from the current frame, in | |
13322 | alphabetical order; | |
13323 | - Exceptions whose scope is global, in alphabetical order. */ | |
13324 | ||
13325 | VEC(ada_exc_info) * | |
13326 | ada_exceptions_list (const char *regexp) | |
13327 | { | |
13328 | VEC(ada_exc_info) *result = NULL; | |
13329 | struct cleanup *old_chain = NULL; | |
13330 | regex_t reg; | |
13331 | ||
13332 | if (regexp != NULL) | |
13333 | old_chain = compile_rx_or_error (®, regexp, | |
13334 | _("invalid regular expression")); | |
13335 | ||
13336 | result = ada_exceptions_list_1 (regexp != NULL ? ® : NULL); | |
13337 | ||
13338 | if (old_chain != NULL) | |
13339 | do_cleanups (old_chain); | |
13340 | return result; | |
13341 | } | |
13342 | ||
13343 | /* Implement the "info exceptions" command. */ | |
13344 | ||
13345 | static void | |
13346 | info_exceptions_command (char *regexp, int from_tty) | |
13347 | { | |
13348 | VEC(ada_exc_info) *exceptions; | |
13349 | struct cleanup *cleanup; | |
13350 | struct gdbarch *gdbarch = get_current_arch (); | |
13351 | int ix; | |
13352 | struct ada_exc_info *info; | |
13353 | ||
13354 | exceptions = ada_exceptions_list (regexp); | |
13355 | cleanup = make_cleanup (VEC_cleanup (ada_exc_info), &exceptions); | |
13356 | ||
13357 | if (regexp != NULL) | |
13358 | printf_filtered | |
13359 | (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp); | |
13360 | else | |
13361 | printf_filtered (_("All defined Ada exceptions:\n")); | |
13362 | ||
13363 | for (ix = 0; VEC_iterate(ada_exc_info, exceptions, ix, info); ix++) | |
13364 | printf_filtered ("%s: %s\n", info->name, paddress (gdbarch, info->addr)); | |
13365 | ||
13366 | do_cleanups (cleanup); | |
13367 | } | |
13368 | ||
4c4b4cd2 PH |
13369 | /* Operators */ |
13370 | /* Information about operators given special treatment in functions | |
13371 | below. */ | |
13372 | /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */ | |
13373 | ||
13374 | #define ADA_OPERATORS \ | |
13375 | OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \ | |
13376 | OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \ | |
13377 | OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \ | |
13378 | OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \ | |
13379 | OP_DEFN (OP_ATR_LAST, 1, 2, 0) \ | |
13380 | OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \ | |
13381 | OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \ | |
13382 | OP_DEFN (OP_ATR_MAX, 1, 3, 0) \ | |
13383 | OP_DEFN (OP_ATR_MIN, 1, 3, 0) \ | |
13384 | OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \ | |
13385 | OP_DEFN (OP_ATR_POS, 1, 2, 0) \ | |
13386 | OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \ | |
13387 | OP_DEFN (OP_ATR_TAG, 1, 1, 0) \ | |
13388 | OP_DEFN (OP_ATR_VAL, 1, 2, 0) \ | |
13389 | OP_DEFN (UNOP_QUAL, 3, 1, 0) \ | |
52ce6436 PH |
13390 | OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \ |
13391 | OP_DEFN (OP_OTHERS, 1, 1, 0) \ | |
13392 | OP_DEFN (OP_POSITIONAL, 3, 1, 0) \ | |
13393 | OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0) | |
4c4b4cd2 PH |
13394 | |
13395 | static void | |
554794dc SDJ |
13396 | ada_operator_length (const struct expression *exp, int pc, int *oplenp, |
13397 | int *argsp) | |
4c4b4cd2 PH |
13398 | { |
13399 | switch (exp->elts[pc - 1].opcode) | |
13400 | { | |
76a01679 | 13401 | default: |
4c4b4cd2 PH |
13402 | operator_length_standard (exp, pc, oplenp, argsp); |
13403 | break; | |
13404 | ||
13405 | #define OP_DEFN(op, len, args, binop) \ | |
13406 | case op: *oplenp = len; *argsp = args; break; | |
13407 | ADA_OPERATORS; | |
13408 | #undef OP_DEFN | |
52ce6436 PH |
13409 | |
13410 | case OP_AGGREGATE: | |
13411 | *oplenp = 3; | |
13412 | *argsp = longest_to_int (exp->elts[pc - 2].longconst); | |
13413 | break; | |
13414 | ||
13415 | case OP_CHOICES: | |
13416 | *oplenp = 3; | |
13417 | *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1; | |
13418 | break; | |
4c4b4cd2 PH |
13419 | } |
13420 | } | |
13421 | ||
c0201579 JK |
13422 | /* Implementation of the exp_descriptor method operator_check. */ |
13423 | ||
13424 | static int | |
13425 | ada_operator_check (struct expression *exp, int pos, | |
13426 | int (*objfile_func) (struct objfile *objfile, void *data), | |
13427 | void *data) | |
13428 | { | |
13429 | const union exp_element *const elts = exp->elts; | |
13430 | struct type *type = NULL; | |
13431 | ||
13432 | switch (elts[pos].opcode) | |
13433 | { | |
13434 | case UNOP_IN_RANGE: | |
13435 | case UNOP_QUAL: | |
13436 | type = elts[pos + 1].type; | |
13437 | break; | |
13438 | ||
13439 | default: | |
13440 | return operator_check_standard (exp, pos, objfile_func, data); | |
13441 | } | |
13442 | ||
13443 | /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */ | |
13444 | ||
13445 | if (type && TYPE_OBJFILE (type) | |
13446 | && (*objfile_func) (TYPE_OBJFILE (type), data)) | |
13447 | return 1; | |
13448 | ||
13449 | return 0; | |
13450 | } | |
13451 | ||
4c4b4cd2 PH |
13452 | static char * |
13453 | ada_op_name (enum exp_opcode opcode) | |
13454 | { | |
13455 | switch (opcode) | |
13456 | { | |
76a01679 | 13457 | default: |
4c4b4cd2 | 13458 | return op_name_standard (opcode); |
52ce6436 | 13459 | |
4c4b4cd2 PH |
13460 | #define OP_DEFN(op, len, args, binop) case op: return #op; |
13461 | ADA_OPERATORS; | |
13462 | #undef OP_DEFN | |
52ce6436 PH |
13463 | |
13464 | case OP_AGGREGATE: | |
13465 | return "OP_AGGREGATE"; | |
13466 | case OP_CHOICES: | |
13467 | return "OP_CHOICES"; | |
13468 | case OP_NAME: | |
13469 | return "OP_NAME"; | |
4c4b4cd2 PH |
13470 | } |
13471 | } | |
13472 | ||
13473 | /* As for operator_length, but assumes PC is pointing at the first | |
13474 | element of the operator, and gives meaningful results only for the | |
52ce6436 | 13475 | Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */ |
4c4b4cd2 PH |
13476 | |
13477 | static void | |
76a01679 JB |
13478 | ada_forward_operator_length (struct expression *exp, int pc, |
13479 | int *oplenp, int *argsp) | |
4c4b4cd2 | 13480 | { |
76a01679 | 13481 | switch (exp->elts[pc].opcode) |
4c4b4cd2 PH |
13482 | { |
13483 | default: | |
13484 | *oplenp = *argsp = 0; | |
13485 | break; | |
52ce6436 | 13486 | |
4c4b4cd2 PH |
13487 | #define OP_DEFN(op, len, args, binop) \ |
13488 | case op: *oplenp = len; *argsp = args; break; | |
13489 | ADA_OPERATORS; | |
13490 | #undef OP_DEFN | |
52ce6436 PH |
13491 | |
13492 | case OP_AGGREGATE: | |
13493 | *oplenp = 3; | |
13494 | *argsp = longest_to_int (exp->elts[pc + 1].longconst); | |
13495 | break; | |
13496 | ||
13497 | case OP_CHOICES: | |
13498 | *oplenp = 3; | |
13499 | *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1; | |
13500 | break; | |
13501 | ||
13502 | case OP_STRING: | |
13503 | case OP_NAME: | |
13504 | { | |
13505 | int len = longest_to_int (exp->elts[pc + 1].longconst); | |
5b4ee69b | 13506 | |
52ce6436 PH |
13507 | *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1); |
13508 | *argsp = 0; | |
13509 | break; | |
13510 | } | |
4c4b4cd2 PH |
13511 | } |
13512 | } | |
13513 | ||
13514 | static int | |
13515 | ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt) | |
13516 | { | |
13517 | enum exp_opcode op = exp->elts[elt].opcode; | |
13518 | int oplen, nargs; | |
13519 | int pc = elt; | |
13520 | int i; | |
76a01679 | 13521 | |
4c4b4cd2 PH |
13522 | ada_forward_operator_length (exp, elt, &oplen, &nargs); |
13523 | ||
76a01679 | 13524 | switch (op) |
4c4b4cd2 | 13525 | { |
76a01679 | 13526 | /* Ada attributes ('Foo). */ |
4c4b4cd2 PH |
13527 | case OP_ATR_FIRST: |
13528 | case OP_ATR_LAST: | |
13529 | case OP_ATR_LENGTH: | |
13530 | case OP_ATR_IMAGE: | |
13531 | case OP_ATR_MAX: | |
13532 | case OP_ATR_MIN: | |
13533 | case OP_ATR_MODULUS: | |
13534 | case OP_ATR_POS: | |
13535 | case OP_ATR_SIZE: | |
13536 | case OP_ATR_TAG: | |
13537 | case OP_ATR_VAL: | |
13538 | break; | |
13539 | ||
13540 | case UNOP_IN_RANGE: | |
13541 | case UNOP_QUAL: | |
323e0a4a AC |
13542 | /* XXX: gdb_sprint_host_address, type_sprint */ |
13543 | fprintf_filtered (stream, _("Type @")); | |
4c4b4cd2 PH |
13544 | gdb_print_host_address (exp->elts[pc + 1].type, stream); |
13545 | fprintf_filtered (stream, " ("); | |
13546 | type_print (exp->elts[pc + 1].type, NULL, stream, 0); | |
13547 | fprintf_filtered (stream, ")"); | |
13548 | break; | |
13549 | case BINOP_IN_BOUNDS: | |
52ce6436 PH |
13550 | fprintf_filtered (stream, " (%d)", |
13551 | longest_to_int (exp->elts[pc + 2].longconst)); | |
4c4b4cd2 PH |
13552 | break; |
13553 | case TERNOP_IN_RANGE: | |
13554 | break; | |
13555 | ||
52ce6436 PH |
13556 | case OP_AGGREGATE: |
13557 | case OP_OTHERS: | |
13558 | case OP_DISCRETE_RANGE: | |
13559 | case OP_POSITIONAL: | |
13560 | case OP_CHOICES: | |
13561 | break; | |
13562 | ||
13563 | case OP_NAME: | |
13564 | case OP_STRING: | |
13565 | { | |
13566 | char *name = &exp->elts[elt + 2].string; | |
13567 | int len = longest_to_int (exp->elts[elt + 1].longconst); | |
5b4ee69b | 13568 | |
52ce6436 PH |
13569 | fprintf_filtered (stream, "Text: `%.*s'", len, name); |
13570 | break; | |
13571 | } | |
13572 | ||
4c4b4cd2 PH |
13573 | default: |
13574 | return dump_subexp_body_standard (exp, stream, elt); | |
13575 | } | |
13576 | ||
13577 | elt += oplen; | |
13578 | for (i = 0; i < nargs; i += 1) | |
13579 | elt = dump_subexp (exp, stream, elt); | |
13580 | ||
13581 | return elt; | |
13582 | } | |
13583 | ||
13584 | /* The Ada extension of print_subexp (q.v.). */ | |
13585 | ||
76a01679 JB |
13586 | static void |
13587 | ada_print_subexp (struct expression *exp, int *pos, | |
13588 | struct ui_file *stream, enum precedence prec) | |
4c4b4cd2 | 13589 | { |
52ce6436 | 13590 | int oplen, nargs, i; |
4c4b4cd2 PH |
13591 | int pc = *pos; |
13592 | enum exp_opcode op = exp->elts[pc].opcode; | |
13593 | ||
13594 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
13595 | ||
52ce6436 | 13596 | *pos += oplen; |
4c4b4cd2 PH |
13597 | switch (op) |
13598 | { | |
13599 | default: | |
52ce6436 | 13600 | *pos -= oplen; |
4c4b4cd2 PH |
13601 | print_subexp_standard (exp, pos, stream, prec); |
13602 | return; | |
13603 | ||
13604 | case OP_VAR_VALUE: | |
4c4b4cd2 PH |
13605 | fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream); |
13606 | return; | |
13607 | ||
13608 | case BINOP_IN_BOUNDS: | |
323e0a4a | 13609 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13610 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13611 | fputs_filtered (" in ", stream); |
4c4b4cd2 | 13612 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13613 | fputs_filtered ("'range", stream); |
4c4b4cd2 | 13614 | if (exp->elts[pc + 1].longconst > 1) |
76a01679 JB |
13615 | fprintf_filtered (stream, "(%ld)", |
13616 | (long) exp->elts[pc + 1].longconst); | |
4c4b4cd2 PH |
13617 | return; |
13618 | ||
13619 | case TERNOP_IN_RANGE: | |
4c4b4cd2 | 13620 | if (prec >= PREC_EQUAL) |
76a01679 | 13621 | fputs_filtered ("(", stream); |
323e0a4a | 13622 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13623 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13624 | fputs_filtered (" in ", stream); |
4c4b4cd2 PH |
13625 | print_subexp (exp, pos, stream, PREC_EQUAL); |
13626 | fputs_filtered (" .. ", stream); | |
13627 | print_subexp (exp, pos, stream, PREC_EQUAL); | |
13628 | if (prec >= PREC_EQUAL) | |
76a01679 JB |
13629 | fputs_filtered (")", stream); |
13630 | return; | |
4c4b4cd2 PH |
13631 | |
13632 | case OP_ATR_FIRST: | |
13633 | case OP_ATR_LAST: | |
13634 | case OP_ATR_LENGTH: | |
13635 | case OP_ATR_IMAGE: | |
13636 | case OP_ATR_MAX: | |
13637 | case OP_ATR_MIN: | |
13638 | case OP_ATR_MODULUS: | |
13639 | case OP_ATR_POS: | |
13640 | case OP_ATR_SIZE: | |
13641 | case OP_ATR_TAG: | |
13642 | case OP_ATR_VAL: | |
4c4b4cd2 | 13643 | if (exp->elts[*pos].opcode == OP_TYPE) |
76a01679 JB |
13644 | { |
13645 | if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID) | |
79d43c61 TT |
13646 | LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0, |
13647 | &type_print_raw_options); | |
76a01679 JB |
13648 | *pos += 3; |
13649 | } | |
4c4b4cd2 | 13650 | else |
76a01679 | 13651 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
4c4b4cd2 PH |
13652 | fprintf_filtered (stream, "'%s", ada_attribute_name (op)); |
13653 | if (nargs > 1) | |
76a01679 JB |
13654 | { |
13655 | int tem; | |
5b4ee69b | 13656 | |
76a01679 JB |
13657 | for (tem = 1; tem < nargs; tem += 1) |
13658 | { | |
13659 | fputs_filtered ((tem == 1) ? " (" : ", ", stream); | |
13660 | print_subexp (exp, pos, stream, PREC_ABOVE_COMMA); | |
13661 | } | |
13662 | fputs_filtered (")", stream); | |
13663 | } | |
4c4b4cd2 | 13664 | return; |
14f9c5c9 | 13665 | |
4c4b4cd2 | 13666 | case UNOP_QUAL: |
4c4b4cd2 PH |
13667 | type_print (exp->elts[pc + 1].type, "", stream, 0); |
13668 | fputs_filtered ("'(", stream); | |
13669 | print_subexp (exp, pos, stream, PREC_PREFIX); | |
13670 | fputs_filtered (")", stream); | |
13671 | return; | |
14f9c5c9 | 13672 | |
4c4b4cd2 | 13673 | case UNOP_IN_RANGE: |
323e0a4a | 13674 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13675 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13676 | fputs_filtered (" in ", stream); |
79d43c61 TT |
13677 | LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0, |
13678 | &type_print_raw_options); | |
4c4b4cd2 | 13679 | return; |
52ce6436 PH |
13680 | |
13681 | case OP_DISCRETE_RANGE: | |
13682 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13683 | fputs_filtered ("..", stream); | |
13684 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13685 | return; | |
13686 | ||
13687 | case OP_OTHERS: | |
13688 | fputs_filtered ("others => ", stream); | |
13689 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13690 | return; | |
13691 | ||
13692 | case OP_CHOICES: | |
13693 | for (i = 0; i < nargs-1; i += 1) | |
13694 | { | |
13695 | if (i > 0) | |
13696 | fputs_filtered ("|", stream); | |
13697 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13698 | } | |
13699 | fputs_filtered (" => ", stream); | |
13700 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13701 | return; | |
13702 | ||
13703 | case OP_POSITIONAL: | |
13704 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13705 | return; | |
13706 | ||
13707 | case OP_AGGREGATE: | |
13708 | fputs_filtered ("(", stream); | |
13709 | for (i = 0; i < nargs; i += 1) | |
13710 | { | |
13711 | if (i > 0) | |
13712 | fputs_filtered (", ", stream); | |
13713 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13714 | } | |
13715 | fputs_filtered (")", stream); | |
13716 | return; | |
4c4b4cd2 PH |
13717 | } |
13718 | } | |
14f9c5c9 AS |
13719 | |
13720 | /* Table mapping opcodes into strings for printing operators | |
13721 | and precedences of the operators. */ | |
13722 | ||
d2e4a39e AS |
13723 | static const struct op_print ada_op_print_tab[] = { |
13724 | {":=", BINOP_ASSIGN, PREC_ASSIGN, 1}, | |
13725 | {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0}, | |
13726 | {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0}, | |
13727 | {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0}, | |
13728 | {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0}, | |
13729 | {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0}, | |
13730 | {"=", BINOP_EQUAL, PREC_EQUAL, 0}, | |
13731 | {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0}, | |
13732 | {"<=", BINOP_LEQ, PREC_ORDER, 0}, | |
13733 | {">=", BINOP_GEQ, PREC_ORDER, 0}, | |
13734 | {">", BINOP_GTR, PREC_ORDER, 0}, | |
13735 | {"<", BINOP_LESS, PREC_ORDER, 0}, | |
13736 | {">>", BINOP_RSH, PREC_SHIFT, 0}, | |
13737 | {"<<", BINOP_LSH, PREC_SHIFT, 0}, | |
13738 | {"+", BINOP_ADD, PREC_ADD, 0}, | |
13739 | {"-", BINOP_SUB, PREC_ADD, 0}, | |
13740 | {"&", BINOP_CONCAT, PREC_ADD, 0}, | |
13741 | {"*", BINOP_MUL, PREC_MUL, 0}, | |
13742 | {"/", BINOP_DIV, PREC_MUL, 0}, | |
13743 | {"rem", BINOP_REM, PREC_MUL, 0}, | |
13744 | {"mod", BINOP_MOD, PREC_MUL, 0}, | |
13745 | {"**", BINOP_EXP, PREC_REPEAT, 0}, | |
13746 | {"@", BINOP_REPEAT, PREC_REPEAT, 0}, | |
13747 | {"-", UNOP_NEG, PREC_PREFIX, 0}, | |
13748 | {"+", UNOP_PLUS, PREC_PREFIX, 0}, | |
13749 | {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0}, | |
13750 | {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0}, | |
13751 | {"abs ", UNOP_ABS, PREC_PREFIX, 0}, | |
4c4b4cd2 PH |
13752 | {".all", UNOP_IND, PREC_SUFFIX, 1}, |
13753 | {"'access", UNOP_ADDR, PREC_SUFFIX, 1}, | |
13754 | {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1}, | |
f486487f | 13755 | {NULL, OP_NULL, PREC_SUFFIX, 0} |
14f9c5c9 AS |
13756 | }; |
13757 | \f | |
72d5681a PH |
13758 | enum ada_primitive_types { |
13759 | ada_primitive_type_int, | |
13760 | ada_primitive_type_long, | |
13761 | ada_primitive_type_short, | |
13762 | ada_primitive_type_char, | |
13763 | ada_primitive_type_float, | |
13764 | ada_primitive_type_double, | |
13765 | ada_primitive_type_void, | |
13766 | ada_primitive_type_long_long, | |
13767 | ada_primitive_type_long_double, | |
13768 | ada_primitive_type_natural, | |
13769 | ada_primitive_type_positive, | |
13770 | ada_primitive_type_system_address, | |
13771 | nr_ada_primitive_types | |
13772 | }; | |
6c038f32 PH |
13773 | |
13774 | static void | |
d4a9a881 | 13775 | ada_language_arch_info (struct gdbarch *gdbarch, |
72d5681a PH |
13776 | struct language_arch_info *lai) |
13777 | { | |
d4a9a881 | 13778 | const struct builtin_type *builtin = builtin_type (gdbarch); |
5b4ee69b | 13779 | |
72d5681a | 13780 | lai->primitive_type_vector |
d4a9a881 | 13781 | = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1, |
72d5681a | 13782 | struct type *); |
e9bb382b UW |
13783 | |
13784 | lai->primitive_type_vector [ada_primitive_type_int] | |
13785 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
13786 | 0, "integer"); | |
13787 | lai->primitive_type_vector [ada_primitive_type_long] | |
13788 | = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch), | |
13789 | 0, "long_integer"); | |
13790 | lai->primitive_type_vector [ada_primitive_type_short] | |
13791 | = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch), | |
13792 | 0, "short_integer"); | |
13793 | lai->string_char_type | |
13794 | = lai->primitive_type_vector [ada_primitive_type_char] | |
cd7c1778 | 13795 | = arch_character_type (gdbarch, TARGET_CHAR_BIT, 0, "character"); |
e9bb382b UW |
13796 | lai->primitive_type_vector [ada_primitive_type_float] |
13797 | = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch), | |
13798 | "float", NULL); | |
13799 | lai->primitive_type_vector [ada_primitive_type_double] | |
13800 | = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch), | |
13801 | "long_float", NULL); | |
13802 | lai->primitive_type_vector [ada_primitive_type_long_long] | |
13803 | = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch), | |
13804 | 0, "long_long_integer"); | |
13805 | lai->primitive_type_vector [ada_primitive_type_long_double] | |
13806 | = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch), | |
13807 | "long_long_float", NULL); | |
13808 | lai->primitive_type_vector [ada_primitive_type_natural] | |
13809 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
13810 | 0, "natural"); | |
13811 | lai->primitive_type_vector [ada_primitive_type_positive] | |
13812 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
13813 | 0, "positive"); | |
13814 | lai->primitive_type_vector [ada_primitive_type_void] | |
13815 | = builtin->builtin_void; | |
13816 | ||
13817 | lai->primitive_type_vector [ada_primitive_type_system_address] | |
13818 | = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, 1, "void")); | |
72d5681a PH |
13819 | TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address]) |
13820 | = "system__address"; | |
fbb06eb1 | 13821 | |
47e729a8 | 13822 | lai->bool_type_symbol = NULL; |
fbb06eb1 | 13823 | lai->bool_type_default = builtin->builtin_bool; |
6c038f32 | 13824 | } |
6c038f32 PH |
13825 | \f |
13826 | /* Language vector */ | |
13827 | ||
13828 | /* Not really used, but needed in the ada_language_defn. */ | |
13829 | ||
13830 | static void | |
6c7a06a3 | 13831 | emit_char (int c, struct type *type, struct ui_file *stream, int quoter) |
6c038f32 | 13832 | { |
6c7a06a3 | 13833 | ada_emit_char (c, type, stream, quoter, 1); |
6c038f32 PH |
13834 | } |
13835 | ||
13836 | static int | |
410a0ff2 | 13837 | parse (struct parser_state *ps) |
6c038f32 PH |
13838 | { |
13839 | warnings_issued = 0; | |
410a0ff2 | 13840 | return ada_parse (ps); |
6c038f32 PH |
13841 | } |
13842 | ||
13843 | static const struct exp_descriptor ada_exp_descriptor = { | |
13844 | ada_print_subexp, | |
13845 | ada_operator_length, | |
c0201579 | 13846 | ada_operator_check, |
6c038f32 PH |
13847 | ada_op_name, |
13848 | ada_dump_subexp_body, | |
13849 | ada_evaluate_subexp | |
13850 | }; | |
13851 | ||
1a119f36 | 13852 | /* Implement the "la_get_symbol_name_cmp" language_defn method |
74ccd7f5 JB |
13853 | for Ada. */ |
13854 | ||
1a119f36 JB |
13855 | static symbol_name_cmp_ftype |
13856 | ada_get_symbol_name_cmp (const char *lookup_name) | |
74ccd7f5 JB |
13857 | { |
13858 | if (should_use_wild_match (lookup_name)) | |
13859 | return wild_match; | |
13860 | else | |
13861 | return compare_names; | |
13862 | } | |
13863 | ||
a5ee536b JB |
13864 | /* Implement the "la_read_var_value" language_defn method for Ada. */ |
13865 | ||
13866 | static struct value * | |
63e43d3a PMR |
13867 | ada_read_var_value (struct symbol *var, const struct block *var_block, |
13868 | struct frame_info *frame) | |
a5ee536b | 13869 | { |
3977b71f | 13870 | const struct block *frame_block = NULL; |
a5ee536b JB |
13871 | struct symbol *renaming_sym = NULL; |
13872 | ||
13873 | /* The only case where default_read_var_value is not sufficient | |
13874 | is when VAR is a renaming... */ | |
13875 | if (frame) | |
13876 | frame_block = get_frame_block (frame, NULL); | |
13877 | if (frame_block) | |
13878 | renaming_sym = ada_find_renaming_symbol (var, frame_block); | |
13879 | if (renaming_sym != NULL) | |
13880 | return ada_read_renaming_var_value (renaming_sym, frame_block); | |
13881 | ||
13882 | /* This is a typical case where we expect the default_read_var_value | |
13883 | function to work. */ | |
63e43d3a | 13884 | return default_read_var_value (var, var_block, frame); |
a5ee536b JB |
13885 | } |
13886 | ||
6c038f32 PH |
13887 | const struct language_defn ada_language_defn = { |
13888 | "ada", /* Language name */ | |
6abde28f | 13889 | "Ada", |
6c038f32 | 13890 | language_ada, |
6c038f32 | 13891 | range_check_off, |
6c038f32 PH |
13892 | case_sensitive_on, /* Yes, Ada is case-insensitive, but |
13893 | that's not quite what this means. */ | |
6c038f32 | 13894 | array_row_major, |
9a044a89 | 13895 | macro_expansion_no, |
6c038f32 PH |
13896 | &ada_exp_descriptor, |
13897 | parse, | |
13898 | ada_error, | |
13899 | resolve, | |
13900 | ada_printchar, /* Print a character constant */ | |
13901 | ada_printstr, /* Function to print string constant */ | |
13902 | emit_char, /* Function to print single char (not used) */ | |
6c038f32 | 13903 | ada_print_type, /* Print a type using appropriate syntax */ |
be942545 | 13904 | ada_print_typedef, /* Print a typedef using appropriate syntax */ |
6c038f32 PH |
13905 | ada_val_print, /* Print a value using appropriate syntax */ |
13906 | ada_value_print, /* Print a top-level value */ | |
a5ee536b | 13907 | ada_read_var_value, /* la_read_var_value */ |
6c038f32 | 13908 | NULL, /* Language specific skip_trampoline */ |
2b2d9e11 | 13909 | NULL, /* name_of_this */ |
6c038f32 PH |
13910 | ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */ |
13911 | basic_lookup_transparent_type, /* lookup_transparent_type */ | |
13912 | ada_la_decode, /* Language specific symbol demangler */ | |
0963b4bd MS |
13913 | NULL, /* Language specific |
13914 | class_name_from_physname */ | |
6c038f32 PH |
13915 | ada_op_print_tab, /* expression operators for printing */ |
13916 | 0, /* c-style arrays */ | |
13917 | 1, /* String lower bound */ | |
6c038f32 | 13918 | ada_get_gdb_completer_word_break_characters, |
41d27058 | 13919 | ada_make_symbol_completion_list, |
72d5681a | 13920 | ada_language_arch_info, |
e79af960 | 13921 | ada_print_array_index, |
41f1b697 | 13922 | default_pass_by_reference, |
ae6a3a4c | 13923 | c_get_string, |
1a119f36 | 13924 | ada_get_symbol_name_cmp, /* la_get_symbol_name_cmp */ |
f8eba3c6 | 13925 | ada_iterate_over_symbols, |
a53b64ea | 13926 | &ada_varobj_ops, |
bb2ec1b3 TT |
13927 | NULL, |
13928 | NULL, | |
6c038f32 PH |
13929 | LANG_MAGIC |
13930 | }; | |
13931 | ||
2c0b251b PA |
13932 | /* Provide a prototype to silence -Wmissing-prototypes. */ |
13933 | extern initialize_file_ftype _initialize_ada_language; | |
13934 | ||
5bf03f13 JB |
13935 | /* Command-list for the "set/show ada" prefix command. */ |
13936 | static struct cmd_list_element *set_ada_list; | |
13937 | static struct cmd_list_element *show_ada_list; | |
13938 | ||
13939 | /* Implement the "set ada" prefix command. */ | |
13940 | ||
13941 | static void | |
13942 | set_ada_command (char *arg, int from_tty) | |
13943 | { | |
13944 | printf_unfiltered (_(\ | |
13945 | "\"set ada\" must be followed by the name of a setting.\n")); | |
635c7e8a | 13946 | help_list (set_ada_list, "set ada ", all_commands, gdb_stdout); |
5bf03f13 JB |
13947 | } |
13948 | ||
13949 | /* Implement the "show ada" prefix command. */ | |
13950 | ||
13951 | static void | |
13952 | show_ada_command (char *args, int from_tty) | |
13953 | { | |
13954 | cmd_show_list (show_ada_list, from_tty, ""); | |
13955 | } | |
13956 | ||
2060206e PA |
13957 | static void |
13958 | initialize_ada_catchpoint_ops (void) | |
13959 | { | |
13960 | struct breakpoint_ops *ops; | |
13961 | ||
13962 | initialize_breakpoint_ops (); | |
13963 | ||
13964 | ops = &catch_exception_breakpoint_ops; | |
13965 | *ops = bkpt_breakpoint_ops; | |
13966 | ops->dtor = dtor_catch_exception; | |
13967 | ops->allocate_location = allocate_location_catch_exception; | |
13968 | ops->re_set = re_set_catch_exception; | |
13969 | ops->check_status = check_status_catch_exception; | |
13970 | ops->print_it = print_it_catch_exception; | |
13971 | ops->print_one = print_one_catch_exception; | |
13972 | ops->print_mention = print_mention_catch_exception; | |
13973 | ops->print_recreate = print_recreate_catch_exception; | |
13974 | ||
13975 | ops = &catch_exception_unhandled_breakpoint_ops; | |
13976 | *ops = bkpt_breakpoint_ops; | |
13977 | ops->dtor = dtor_catch_exception_unhandled; | |
13978 | ops->allocate_location = allocate_location_catch_exception_unhandled; | |
13979 | ops->re_set = re_set_catch_exception_unhandled; | |
13980 | ops->check_status = check_status_catch_exception_unhandled; | |
13981 | ops->print_it = print_it_catch_exception_unhandled; | |
13982 | ops->print_one = print_one_catch_exception_unhandled; | |
13983 | ops->print_mention = print_mention_catch_exception_unhandled; | |
13984 | ops->print_recreate = print_recreate_catch_exception_unhandled; | |
13985 | ||
13986 | ops = &catch_assert_breakpoint_ops; | |
13987 | *ops = bkpt_breakpoint_ops; | |
13988 | ops->dtor = dtor_catch_assert; | |
13989 | ops->allocate_location = allocate_location_catch_assert; | |
13990 | ops->re_set = re_set_catch_assert; | |
13991 | ops->check_status = check_status_catch_assert; | |
13992 | ops->print_it = print_it_catch_assert; | |
13993 | ops->print_one = print_one_catch_assert; | |
13994 | ops->print_mention = print_mention_catch_assert; | |
13995 | ops->print_recreate = print_recreate_catch_assert; | |
13996 | } | |
13997 | ||
3d9434b5 JB |
13998 | /* This module's 'new_objfile' observer. */ |
13999 | ||
14000 | static void | |
14001 | ada_new_objfile_observer (struct objfile *objfile) | |
14002 | { | |
14003 | ada_clear_symbol_cache (); | |
14004 | } | |
14005 | ||
14006 | /* This module's 'free_objfile' observer. */ | |
14007 | ||
14008 | static void | |
14009 | ada_free_objfile_observer (struct objfile *objfile) | |
14010 | { | |
14011 | ada_clear_symbol_cache (); | |
14012 | } | |
14013 | ||
d2e4a39e | 14014 | void |
6c038f32 | 14015 | _initialize_ada_language (void) |
14f9c5c9 | 14016 | { |
6c038f32 PH |
14017 | add_language (&ada_language_defn); |
14018 | ||
2060206e PA |
14019 | initialize_ada_catchpoint_ops (); |
14020 | ||
5bf03f13 JB |
14021 | add_prefix_cmd ("ada", no_class, set_ada_command, |
14022 | _("Prefix command for changing Ada-specfic settings"), | |
14023 | &set_ada_list, "set ada ", 0, &setlist); | |
14024 | ||
14025 | add_prefix_cmd ("ada", no_class, show_ada_command, | |
14026 | _("Generic command for showing Ada-specific settings."), | |
14027 | &show_ada_list, "show ada ", 0, &showlist); | |
14028 | ||
14029 | add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure, | |
14030 | &trust_pad_over_xvs, _("\ | |
14031 | Enable or disable an optimization trusting PAD types over XVS types"), _("\ | |
14032 | Show whether an optimization trusting PAD types over XVS types is activated"), | |
14033 | _("\ | |
14034 | This is related to the encoding used by the GNAT compiler. The debugger\n\ | |
14035 | should normally trust the contents of PAD types, but certain older versions\n\ | |
14036 | of GNAT have a bug that sometimes causes the information in the PAD type\n\ | |
14037 | to be incorrect. Turning this setting \"off\" allows the debugger to\n\ | |
14038 | work around this bug. It is always safe to turn this option \"off\", but\n\ | |
14039 | this incurs a slight performance penalty, so it is recommended to NOT change\n\ | |
14040 | this option to \"off\" unless necessary."), | |
14041 | NULL, NULL, &set_ada_list, &show_ada_list); | |
14042 | ||
9ac4176b PA |
14043 | add_catch_command ("exception", _("\ |
14044 | Catch Ada exceptions, when raised.\n\ | |
14045 | With an argument, catch only exceptions with the given name."), | |
14046 | catch_ada_exception_command, | |
14047 | NULL, | |
14048 | CATCH_PERMANENT, | |
14049 | CATCH_TEMPORARY); | |
14050 | add_catch_command ("assert", _("\ | |
14051 | Catch failed Ada assertions, when raised.\n\ | |
14052 | With an argument, catch only exceptions with the given name."), | |
14053 | catch_assert_command, | |
14054 | NULL, | |
14055 | CATCH_PERMANENT, | |
14056 | CATCH_TEMPORARY); | |
14057 | ||
6c038f32 | 14058 | varsize_limit = 65536; |
6c038f32 | 14059 | |
778865d3 JB |
14060 | add_info ("exceptions", info_exceptions_command, |
14061 | _("\ | |
14062 | List all Ada exception names.\n\ | |
14063 | If a regular expression is passed as an argument, only those matching\n\ | |
14064 | the regular expression are listed.")); | |
14065 | ||
c6044dd1 JB |
14066 | add_prefix_cmd ("ada", class_maintenance, maint_set_ada_cmd, |
14067 | _("Set Ada maintenance-related variables."), | |
14068 | &maint_set_ada_cmdlist, "maintenance set ada ", | |
14069 | 0/*allow-unknown*/, &maintenance_set_cmdlist); | |
14070 | ||
14071 | add_prefix_cmd ("ada", class_maintenance, maint_show_ada_cmd, | |
14072 | _("Show Ada maintenance-related variables"), | |
14073 | &maint_show_ada_cmdlist, "maintenance show ada ", | |
14074 | 0/*allow-unknown*/, &maintenance_show_cmdlist); | |
14075 | ||
14076 | add_setshow_boolean_cmd | |
14077 | ("ignore-descriptive-types", class_maintenance, | |
14078 | &ada_ignore_descriptive_types_p, | |
14079 | _("Set whether descriptive types generated by GNAT should be ignored."), | |
14080 | _("Show whether descriptive types generated by GNAT should be ignored."), | |
14081 | _("\ | |
14082 | When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\ | |
14083 | DWARF attribute."), | |
14084 | NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist); | |
14085 | ||
6c038f32 PH |
14086 | obstack_init (&symbol_list_obstack); |
14087 | ||
14088 | decoded_names_store = htab_create_alloc | |
14089 | (256, htab_hash_string, (int (*)(const void *, const void *)) streq, | |
14090 | NULL, xcalloc, xfree); | |
6b69afc4 | 14091 | |
3d9434b5 JB |
14092 | /* The ada-lang observers. */ |
14093 | observer_attach_new_objfile (ada_new_objfile_observer); | |
14094 | observer_attach_free_objfile (ada_free_objfile_observer); | |
e802dbe0 | 14095 | observer_attach_inferior_exit (ada_inferior_exit); |
ee01b665 JB |
14096 | |
14097 | /* Setup various context-specific data. */ | |
e802dbe0 | 14098 | ada_inferior_data |
8e260fc0 | 14099 | = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup); |
ee01b665 JB |
14100 | ada_pspace_data_handle |
14101 | = register_program_space_data_with_cleanup (NULL, ada_pspace_data_cleanup); | |
14f9c5c9 | 14102 | } |