Commit | Line | Data |
---|---|---|
6e681866 | 1 | /* Ada language support routines for GDB, the GNU debugger. |
10a2c479 | 2 | |
b811d2c2 | 3 | Copyright (C) 1992-2020 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> |
d55e5aa6 | 23 | #include "gdb_regex.h" |
4de283e4 TT |
24 | #include "frame.h" |
25 | #include "symtab.h" | |
26 | #include "gdbtypes.h" | |
14f9c5c9 | 27 | #include "gdbcmd.h" |
4de283e4 TT |
28 | #include "expression.h" |
29 | #include "parser-defs.h" | |
30 | #include "language.h" | |
31 | #include "varobj.h" | |
4de283e4 TT |
32 | #include "inferior.h" |
33 | #include "symfile.h" | |
34 | #include "objfiles.h" | |
35 | #include "breakpoint.h" | |
14f9c5c9 | 36 | #include "gdbcore.h" |
4c4b4cd2 | 37 | #include "hashtab.h" |
4de283e4 TT |
38 | #include "gdb_obstack.h" |
39 | #include "ada-lang.h" | |
40 | #include "completer.h" | |
4de283e4 TT |
41 | #include "ui-out.h" |
42 | #include "block.h" | |
04714b91 | 43 | #include "infcall.h" |
4de283e4 TT |
44 | #include "annotate.h" |
45 | #include "valprint.h" | |
d55e5aa6 | 46 | #include "source.h" |
4de283e4 | 47 | #include "observable.h" |
692465f1 | 48 | #include "stack.h" |
79d43c61 | 49 | #include "typeprint.h" |
4de283e4 | 50 | #include "namespace.h" |
7f6aba03 | 51 | #include "cli/cli-style.h" |
4de283e4 | 52 | |
40bc484c | 53 | #include "value.h" |
4de283e4 TT |
54 | #include "mi/mi-common.h" |
55 | #include "arch-utils.h" | |
56 | #include "cli/cli-utils.h" | |
268a13a5 TT |
57 | #include "gdbsupport/function-view.h" |
58 | #include "gdbsupport/byte-vector.h" | |
4de283e4 | 59 | #include <algorithm> |
ccefe4c4 | 60 | |
4c4b4cd2 | 61 | /* Define whether or not the C operator '/' truncates towards zero for |
0963b4bd | 62 | differently signed operands (truncation direction is undefined in C). |
4c4b4cd2 PH |
63 | Copied from valarith.c. */ |
64 | ||
65 | #ifndef TRUNCATION_TOWARDS_ZERO | |
66 | #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2) | |
67 | #endif | |
68 | ||
d2e4a39e | 69 | static struct type *desc_base_type (struct type *); |
14f9c5c9 | 70 | |
d2e4a39e | 71 | static struct type *desc_bounds_type (struct type *); |
14f9c5c9 | 72 | |
d2e4a39e | 73 | static struct value *desc_bounds (struct value *); |
14f9c5c9 | 74 | |
d2e4a39e | 75 | static int fat_pntr_bounds_bitpos (struct type *); |
14f9c5c9 | 76 | |
d2e4a39e | 77 | static int fat_pntr_bounds_bitsize (struct type *); |
14f9c5c9 | 78 | |
556bdfd4 | 79 | static struct type *desc_data_target_type (struct type *); |
14f9c5c9 | 80 | |
d2e4a39e | 81 | static struct value *desc_data (struct value *); |
14f9c5c9 | 82 | |
d2e4a39e | 83 | static int fat_pntr_data_bitpos (struct type *); |
14f9c5c9 | 84 | |
d2e4a39e | 85 | static int fat_pntr_data_bitsize (struct type *); |
14f9c5c9 | 86 | |
d2e4a39e | 87 | static struct value *desc_one_bound (struct value *, int, int); |
14f9c5c9 | 88 | |
d2e4a39e | 89 | static int desc_bound_bitpos (struct type *, int, int); |
14f9c5c9 | 90 | |
d2e4a39e | 91 | static int desc_bound_bitsize (struct type *, int, int); |
14f9c5c9 | 92 | |
d2e4a39e | 93 | static struct type *desc_index_type (struct type *, int); |
14f9c5c9 | 94 | |
d2e4a39e | 95 | static int desc_arity (struct type *); |
14f9c5c9 | 96 | |
d2e4a39e | 97 | static int ada_type_match (struct type *, struct type *, int); |
14f9c5c9 | 98 | |
d2e4a39e | 99 | static int ada_args_match (struct symbol *, struct value **, int); |
14f9c5c9 | 100 | |
40bc484c | 101 | static struct value *make_array_descriptor (struct type *, struct value *); |
14f9c5c9 | 102 | |
4c4b4cd2 | 103 | static void ada_add_block_symbols (struct obstack *, |
b5ec771e PA |
104 | const struct block *, |
105 | const lookup_name_info &lookup_name, | |
106 | domain_enum, struct objfile *); | |
14f9c5c9 | 107 | |
22cee43f | 108 | static void ada_add_all_symbols (struct obstack *, const struct block *, |
b5ec771e PA |
109 | const lookup_name_info &lookup_name, |
110 | domain_enum, int, int *); | |
22cee43f | 111 | |
d12307c1 | 112 | static int is_nonfunction (struct block_symbol *, int); |
14f9c5c9 | 113 | |
76a01679 | 114 | static void add_defn_to_vec (struct obstack *, struct symbol *, |
f0c5f9b2 | 115 | const struct block *); |
14f9c5c9 | 116 | |
4c4b4cd2 PH |
117 | static int num_defns_collected (struct obstack *); |
118 | ||
d12307c1 | 119 | static struct block_symbol *defns_collected (struct obstack *, int); |
14f9c5c9 | 120 | |
e9d9f57e | 121 | static struct value *resolve_subexp (expression_up *, int *, int, |
699bd4cf TT |
122 | struct type *, int, |
123 | innermost_block_tracker *); | |
14f9c5c9 | 124 | |
e9d9f57e | 125 | static void replace_operator_with_call (expression_up *, int, int, int, |
270140bd | 126 | struct symbol *, const struct block *); |
14f9c5c9 | 127 | |
d2e4a39e | 128 | static int possible_user_operator_p (enum exp_opcode, struct value **); |
14f9c5c9 | 129 | |
a121b7c1 | 130 | static const char *ada_op_name (enum exp_opcode); |
4c4b4cd2 PH |
131 | |
132 | static const char *ada_decoded_op_name (enum exp_opcode); | |
14f9c5c9 | 133 | |
d2e4a39e | 134 | static int numeric_type_p (struct type *); |
14f9c5c9 | 135 | |
d2e4a39e | 136 | static int integer_type_p (struct type *); |
14f9c5c9 | 137 | |
d2e4a39e | 138 | static int scalar_type_p (struct type *); |
14f9c5c9 | 139 | |
d2e4a39e | 140 | static int discrete_type_p (struct type *); |
14f9c5c9 | 141 | |
a121b7c1 | 142 | static struct type *ada_lookup_struct_elt_type (struct type *, const char *, |
988f6b3d | 143 | int, int); |
4c4b4cd2 | 144 | |
d2e4a39e | 145 | static struct value *evaluate_subexp_type (struct expression *, int *); |
14f9c5c9 | 146 | |
b4ba55a1 JB |
147 | static struct type *ada_find_parallel_type_with_name (struct type *, |
148 | const char *); | |
149 | ||
d2e4a39e | 150 | static int is_dynamic_field (struct type *, int); |
14f9c5c9 | 151 | |
10a2c479 | 152 | static struct type *to_fixed_variant_branch_type (struct type *, |
fc1a4b47 | 153 | const gdb_byte *, |
4c4b4cd2 PH |
154 | CORE_ADDR, struct value *); |
155 | ||
156 | static struct type *to_fixed_array_type (struct type *, struct value *, int); | |
14f9c5c9 | 157 | |
28c85d6c | 158 | static struct type *to_fixed_range_type (struct type *, struct value *); |
14f9c5c9 | 159 | |
d2e4a39e | 160 | static struct type *to_static_fixed_type (struct type *); |
f192137b | 161 | static struct type *static_unwrap_type (struct type *type); |
14f9c5c9 | 162 | |
d2e4a39e | 163 | static struct value *unwrap_value (struct value *); |
14f9c5c9 | 164 | |
ad82864c | 165 | static struct type *constrained_packed_array_type (struct type *, long *); |
14f9c5c9 | 166 | |
ad82864c | 167 | static struct type *decode_constrained_packed_array_type (struct type *); |
14f9c5c9 | 168 | |
ad82864c JB |
169 | static long decode_packed_array_bitsize (struct type *); |
170 | ||
171 | static struct value *decode_constrained_packed_array (struct value *); | |
172 | ||
173 | static int ada_is_packed_array_type (struct type *); | |
174 | ||
175 | static int ada_is_unconstrained_packed_array_type (struct type *); | |
14f9c5c9 | 176 | |
d2e4a39e | 177 | static struct value *value_subscript_packed (struct value *, int, |
4c4b4cd2 | 178 | struct value **); |
14f9c5c9 | 179 | |
4c4b4cd2 PH |
180 | static struct value *coerce_unspec_val_to_type (struct value *, |
181 | struct type *); | |
14f9c5c9 | 182 | |
d2e4a39e | 183 | static int lesseq_defined_than (struct symbol *, struct symbol *); |
14f9c5c9 | 184 | |
d2e4a39e | 185 | static int equiv_types (struct type *, struct type *); |
14f9c5c9 | 186 | |
d2e4a39e | 187 | static int is_name_suffix (const char *); |
14f9c5c9 | 188 | |
73589123 PH |
189 | static int advance_wild_match (const char **, const char *, int); |
190 | ||
b5ec771e | 191 | static bool wild_match (const char *name, const char *patn); |
14f9c5c9 | 192 | |
d2e4a39e | 193 | static struct value *ada_coerce_ref (struct value *); |
14f9c5c9 | 194 | |
4c4b4cd2 PH |
195 | static LONGEST pos_atr (struct value *); |
196 | ||
3cb382c9 | 197 | static struct value *value_pos_atr (struct type *, struct value *); |
14f9c5c9 | 198 | |
53a47a3e TT |
199 | static struct value *val_atr (struct type *, LONGEST); |
200 | ||
d2e4a39e | 201 | static struct value *value_val_atr (struct type *, struct value *); |
14f9c5c9 | 202 | |
4c4b4cd2 PH |
203 | static struct symbol *standard_lookup (const char *, const struct block *, |
204 | domain_enum); | |
14f9c5c9 | 205 | |
108d56a4 | 206 | static struct value *ada_search_struct_field (const char *, struct value *, int, |
4c4b4cd2 PH |
207 | struct type *); |
208 | ||
0d5cff50 | 209 | static int find_struct_field (const char *, struct type *, int, |
52ce6436 | 210 | struct type **, int *, int *, int *, int *); |
4c4b4cd2 | 211 | |
d12307c1 | 212 | static int ada_resolve_function (struct block_symbol *, int, |
4c4b4cd2 | 213 | struct value **, int, const char *, |
2a612529 | 214 | struct type *, int); |
4c4b4cd2 | 215 | |
4c4b4cd2 PH |
216 | static int ada_is_direct_array_type (struct type *); |
217 | ||
52ce6436 PH |
218 | static struct value *ada_index_struct_field (int, struct value *, int, |
219 | struct type *); | |
220 | ||
221 | static struct value *assign_aggregate (struct value *, struct value *, | |
0963b4bd MS |
222 | struct expression *, |
223 | int *, enum noside); | |
52ce6436 PH |
224 | |
225 | static void aggregate_assign_from_choices (struct value *, struct value *, | |
226 | struct expression *, | |
227 | int *, LONGEST *, int *, | |
228 | int, LONGEST, LONGEST); | |
229 | ||
230 | static void aggregate_assign_positional (struct value *, struct value *, | |
231 | struct expression *, | |
232 | int *, LONGEST *, int *, int, | |
233 | LONGEST, LONGEST); | |
234 | ||
235 | ||
236 | static void aggregate_assign_others (struct value *, struct value *, | |
237 | struct expression *, | |
238 | int *, LONGEST *, int, LONGEST, LONGEST); | |
239 | ||
240 | ||
241 | static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int); | |
242 | ||
243 | ||
244 | static struct value *ada_evaluate_subexp (struct type *, struct expression *, | |
245 | int *, enum noside); | |
246 | ||
247 | static void ada_forward_operator_length (struct expression *, int, int *, | |
248 | int *); | |
852dff6c JB |
249 | |
250 | static struct type *ada_find_any_type (const char *name); | |
b5ec771e PA |
251 | |
252 | static symbol_name_matcher_ftype *ada_get_symbol_name_matcher | |
253 | (const lookup_name_info &lookup_name); | |
254 | ||
4c4b4cd2 PH |
255 | \f |
256 | ||
ee01b665 JB |
257 | /* The result of a symbol lookup to be stored in our symbol cache. */ |
258 | ||
259 | struct cache_entry | |
260 | { | |
261 | /* The name used to perform the lookup. */ | |
262 | const char *name; | |
263 | /* The namespace used during the lookup. */ | |
fe978cb0 | 264 | domain_enum domain; |
ee01b665 JB |
265 | /* The symbol returned by the lookup, or NULL if no matching symbol |
266 | was found. */ | |
267 | struct symbol *sym; | |
268 | /* The block where the symbol was found, or NULL if no matching | |
269 | symbol was found. */ | |
270 | const struct block *block; | |
271 | /* A pointer to the next entry with the same hash. */ | |
272 | struct cache_entry *next; | |
273 | }; | |
274 | ||
275 | /* The Ada symbol cache, used to store the result of Ada-mode symbol | |
276 | lookups in the course of executing the user's commands. | |
277 | ||
278 | The cache is implemented using a simple, fixed-sized hash. | |
279 | The size is fixed on the grounds that there are not likely to be | |
280 | all that many symbols looked up during any given session, regardless | |
281 | of the size of the symbol table. If we decide to go to a resizable | |
282 | table, let's just use the stuff from libiberty instead. */ | |
283 | ||
284 | #define HASH_SIZE 1009 | |
285 | ||
286 | struct ada_symbol_cache | |
287 | { | |
288 | /* An obstack used to store the entries in our cache. */ | |
289 | struct obstack cache_space; | |
290 | ||
291 | /* The root of the hash table used to implement our symbol cache. */ | |
292 | struct cache_entry *root[HASH_SIZE]; | |
293 | }; | |
294 | ||
295 | static void ada_free_symbol_cache (struct ada_symbol_cache *sym_cache); | |
76a01679 | 296 | |
4c4b4cd2 | 297 | /* Maximum-sized dynamic type. */ |
14f9c5c9 AS |
298 | static unsigned int varsize_limit; |
299 | ||
67cb5b2d | 300 | static const char ada_completer_word_break_characters[] = |
4c4b4cd2 PH |
301 | #ifdef VMS |
302 | " \t\n!@#%^&*()+=|~`}{[]\";:?/,-"; | |
303 | #else | |
14f9c5c9 | 304 | " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-"; |
4c4b4cd2 | 305 | #endif |
14f9c5c9 | 306 | |
4c4b4cd2 | 307 | /* The name of the symbol to use to get the name of the main subprogram. */ |
76a01679 | 308 | static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[] |
4c4b4cd2 | 309 | = "__gnat_ada_main_program_name"; |
14f9c5c9 | 310 | |
4c4b4cd2 PH |
311 | /* Limit on the number of warnings to raise per expression evaluation. */ |
312 | static int warning_limit = 2; | |
313 | ||
314 | /* Number of warning messages issued; reset to 0 by cleanups after | |
315 | expression evaluation. */ | |
316 | static int warnings_issued = 0; | |
317 | ||
318 | static const char *known_runtime_file_name_patterns[] = { | |
319 | ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL | |
320 | }; | |
321 | ||
322 | static const char *known_auxiliary_function_name_patterns[] = { | |
323 | ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL | |
324 | }; | |
325 | ||
c6044dd1 JB |
326 | /* Maintenance-related settings for this module. */ |
327 | ||
328 | static struct cmd_list_element *maint_set_ada_cmdlist; | |
329 | static struct cmd_list_element *maint_show_ada_cmdlist; | |
330 | ||
c6044dd1 JB |
331 | /* The "maintenance ada set/show ignore-descriptive-type" value. */ |
332 | ||
491144b5 | 333 | static bool ada_ignore_descriptive_types_p = false; |
c6044dd1 | 334 | |
e802dbe0 JB |
335 | /* Inferior-specific data. */ |
336 | ||
337 | /* Per-inferior data for this module. */ | |
338 | ||
339 | struct ada_inferior_data | |
340 | { | |
341 | /* The ada__tags__type_specific_data type, which is used when decoding | |
342 | tagged types. With older versions of GNAT, this type was directly | |
343 | accessible through a component ("tsd") in the object tag. But this | |
344 | is no longer the case, so we cache it for each inferior. */ | |
f37b313d | 345 | struct type *tsd_type = nullptr; |
3eecfa55 JB |
346 | |
347 | /* The exception_support_info data. This data is used to determine | |
348 | how to implement support for Ada exception catchpoints in a given | |
349 | inferior. */ | |
f37b313d | 350 | const struct exception_support_info *exception_info = nullptr; |
e802dbe0 JB |
351 | }; |
352 | ||
353 | /* Our key to this module's inferior data. */ | |
f37b313d | 354 | static const struct inferior_key<ada_inferior_data> ada_inferior_data; |
e802dbe0 JB |
355 | |
356 | /* Return our inferior data for the given inferior (INF). | |
357 | ||
358 | This function always returns a valid pointer to an allocated | |
359 | ada_inferior_data structure. If INF's inferior data has not | |
360 | been previously set, this functions creates a new one with all | |
361 | fields set to zero, sets INF's inferior to it, and then returns | |
362 | a pointer to that newly allocated ada_inferior_data. */ | |
363 | ||
364 | static struct ada_inferior_data * | |
365 | get_ada_inferior_data (struct inferior *inf) | |
366 | { | |
367 | struct ada_inferior_data *data; | |
368 | ||
f37b313d | 369 | data = ada_inferior_data.get (inf); |
e802dbe0 | 370 | if (data == NULL) |
f37b313d | 371 | data = ada_inferior_data.emplace (inf); |
e802dbe0 JB |
372 | |
373 | return data; | |
374 | } | |
375 | ||
376 | /* Perform all necessary cleanups regarding our module's inferior data | |
377 | that is required after the inferior INF just exited. */ | |
378 | ||
379 | static void | |
380 | ada_inferior_exit (struct inferior *inf) | |
381 | { | |
f37b313d | 382 | ada_inferior_data.clear (inf); |
e802dbe0 JB |
383 | } |
384 | ||
ee01b665 JB |
385 | |
386 | /* program-space-specific data. */ | |
387 | ||
388 | /* This module's per-program-space data. */ | |
389 | struct ada_pspace_data | |
390 | { | |
f37b313d TT |
391 | ~ada_pspace_data () |
392 | { | |
393 | if (sym_cache != NULL) | |
394 | ada_free_symbol_cache (sym_cache); | |
395 | } | |
396 | ||
ee01b665 | 397 | /* The Ada symbol cache. */ |
f37b313d | 398 | struct ada_symbol_cache *sym_cache = nullptr; |
ee01b665 JB |
399 | }; |
400 | ||
401 | /* Key to our per-program-space data. */ | |
f37b313d | 402 | static const struct program_space_key<ada_pspace_data> ada_pspace_data_handle; |
ee01b665 JB |
403 | |
404 | /* Return this module's data for the given program space (PSPACE). | |
405 | If not is found, add a zero'ed one now. | |
406 | ||
407 | This function always returns a valid object. */ | |
408 | ||
409 | static struct ada_pspace_data * | |
410 | get_ada_pspace_data (struct program_space *pspace) | |
411 | { | |
412 | struct ada_pspace_data *data; | |
413 | ||
f37b313d | 414 | data = ada_pspace_data_handle.get (pspace); |
ee01b665 | 415 | if (data == NULL) |
f37b313d | 416 | data = ada_pspace_data_handle.emplace (pspace); |
ee01b665 JB |
417 | |
418 | return data; | |
419 | } | |
420 | ||
4c4b4cd2 PH |
421 | /* Utilities */ |
422 | ||
720d1a40 | 423 | /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after |
eed9788b | 424 | all typedef layers have been peeled. Otherwise, return TYPE. |
720d1a40 JB |
425 | |
426 | Normally, we really expect a typedef type to only have 1 typedef layer. | |
427 | In other words, we really expect the target type of a typedef type to be | |
428 | a non-typedef type. This is particularly true for Ada units, because | |
429 | the language does not have a typedef vs not-typedef distinction. | |
430 | In that respect, the Ada compiler has been trying to eliminate as many | |
431 | typedef definitions in the debugging information, since they generally | |
432 | do not bring any extra information (we still use typedef under certain | |
433 | circumstances related mostly to the GNAT encoding). | |
434 | ||
435 | Unfortunately, we have seen situations where the debugging information | |
436 | generated by the compiler leads to such multiple typedef layers. For | |
437 | instance, consider the following example with stabs: | |
438 | ||
439 | .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...] | |
440 | .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0 | |
441 | ||
442 | This is an error in the debugging information which causes type | |
443 | pck__float_array___XUP to be defined twice, and the second time, | |
444 | it is defined as a typedef of a typedef. | |
445 | ||
446 | This is on the fringe of legality as far as debugging information is | |
447 | concerned, and certainly unexpected. But it is easy to handle these | |
448 | situations correctly, so we can afford to be lenient in this case. */ | |
449 | ||
450 | static struct type * | |
451 | ada_typedef_target_type (struct type *type) | |
452 | { | |
78134374 | 453 | while (type->code () == TYPE_CODE_TYPEDEF) |
720d1a40 JB |
454 | type = TYPE_TARGET_TYPE (type); |
455 | return type; | |
456 | } | |
457 | ||
41d27058 JB |
458 | /* Given DECODED_NAME a string holding a symbol name in its |
459 | decoded form (ie using the Ada dotted notation), returns | |
460 | its unqualified name. */ | |
461 | ||
462 | static const char * | |
463 | ada_unqualified_name (const char *decoded_name) | |
464 | { | |
2b0f535a JB |
465 | const char *result; |
466 | ||
467 | /* If the decoded name starts with '<', it means that the encoded | |
468 | name does not follow standard naming conventions, and thus that | |
469 | it is not your typical Ada symbol name. Trying to unqualify it | |
470 | is therefore pointless and possibly erroneous. */ | |
471 | if (decoded_name[0] == '<') | |
472 | return decoded_name; | |
473 | ||
474 | result = strrchr (decoded_name, '.'); | |
41d27058 JB |
475 | if (result != NULL) |
476 | result++; /* Skip the dot... */ | |
477 | else | |
478 | result = decoded_name; | |
479 | ||
480 | return result; | |
481 | } | |
482 | ||
39e7af3e | 483 | /* Return a string starting with '<', followed by STR, and '>'. */ |
41d27058 | 484 | |
39e7af3e | 485 | static std::string |
41d27058 JB |
486 | add_angle_brackets (const char *str) |
487 | { | |
39e7af3e | 488 | return string_printf ("<%s>", str); |
41d27058 | 489 | } |
96d887e8 | 490 | |
67cb5b2d | 491 | static const char * |
4c4b4cd2 PH |
492 | ada_get_gdb_completer_word_break_characters (void) |
493 | { | |
494 | return ada_completer_word_break_characters; | |
495 | } | |
496 | ||
e2b7af72 JB |
497 | /* la_watch_location_expression for Ada. */ |
498 | ||
de93309a | 499 | static gdb::unique_xmalloc_ptr<char> |
e2b7af72 JB |
500 | ada_watch_location_expression (struct type *type, CORE_ADDR addr) |
501 | { | |
502 | type = check_typedef (TYPE_TARGET_TYPE (check_typedef (type))); | |
503 | std::string name = type_to_string (type); | |
504 | return gdb::unique_xmalloc_ptr<char> | |
505 | (xstrprintf ("{%s} %s", name.c_str (), core_addr_to_string (addr))); | |
506 | } | |
507 | ||
de93309a SM |
508 | /* Assuming V points to an array of S objects, make sure that it contains at |
509 | least M objects, updating V and S as necessary. */ | |
510 | ||
511 | #define GROW_VECT(v, s, m) \ | |
512 | if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v)); | |
513 | ||
f27cf670 | 514 | /* Assuming VECT points to an array of *SIZE objects of size |
14f9c5c9 | 515 | ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects, |
f27cf670 | 516 | updating *SIZE as necessary and returning the (new) array. */ |
14f9c5c9 | 517 | |
de93309a | 518 | static void * |
f27cf670 | 519 | grow_vect (void *vect, size_t *size, size_t min_size, int element_size) |
14f9c5c9 | 520 | { |
d2e4a39e AS |
521 | if (*size < min_size) |
522 | { | |
523 | *size *= 2; | |
524 | if (*size < min_size) | |
4c4b4cd2 | 525 | *size = min_size; |
f27cf670 | 526 | vect = xrealloc (vect, *size * element_size); |
d2e4a39e | 527 | } |
f27cf670 | 528 | return vect; |
14f9c5c9 AS |
529 | } |
530 | ||
531 | /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing | |
4c4b4cd2 | 532 | suffix of FIELD_NAME beginning "___". */ |
14f9c5c9 AS |
533 | |
534 | static int | |
ebf56fd3 | 535 | field_name_match (const char *field_name, const char *target) |
14f9c5c9 AS |
536 | { |
537 | int len = strlen (target); | |
5b4ee69b | 538 | |
d2e4a39e | 539 | return |
4c4b4cd2 PH |
540 | (strncmp (field_name, target, len) == 0 |
541 | && (field_name[len] == '\0' | |
61012eef | 542 | || (startswith (field_name + len, "___") |
76a01679 JB |
543 | && strcmp (field_name + strlen (field_name) - 6, |
544 | "___XVN") != 0))); | |
14f9c5c9 AS |
545 | } |
546 | ||
547 | ||
872c8b51 JB |
548 | /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to |
549 | a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME, | |
550 | and return its index. This function also handles fields whose name | |
551 | have ___ suffixes because the compiler sometimes alters their name | |
552 | by adding such a suffix to represent fields with certain constraints. | |
553 | If the field could not be found, return a negative number if | |
554 | MAYBE_MISSING is set. Otherwise raise an error. */ | |
4c4b4cd2 PH |
555 | |
556 | int | |
557 | ada_get_field_index (const struct type *type, const char *field_name, | |
558 | int maybe_missing) | |
559 | { | |
560 | int fieldno; | |
872c8b51 JB |
561 | struct type *struct_type = check_typedef ((struct type *) type); |
562 | ||
1f704f76 | 563 | for (fieldno = 0; fieldno < struct_type->num_fields (); fieldno++) |
872c8b51 | 564 | if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name)) |
4c4b4cd2 PH |
565 | return fieldno; |
566 | ||
567 | if (!maybe_missing) | |
323e0a4a | 568 | error (_("Unable to find field %s in struct %s. Aborting"), |
7d93a1e0 | 569 | field_name, struct_type->name ()); |
4c4b4cd2 PH |
570 | |
571 | return -1; | |
572 | } | |
573 | ||
574 | /* The length of the prefix of NAME prior to any "___" suffix. */ | |
14f9c5c9 AS |
575 | |
576 | int | |
d2e4a39e | 577 | ada_name_prefix_len (const char *name) |
14f9c5c9 AS |
578 | { |
579 | if (name == NULL) | |
580 | return 0; | |
d2e4a39e | 581 | else |
14f9c5c9 | 582 | { |
d2e4a39e | 583 | const char *p = strstr (name, "___"); |
5b4ee69b | 584 | |
14f9c5c9 | 585 | if (p == NULL) |
4c4b4cd2 | 586 | return strlen (name); |
14f9c5c9 | 587 | else |
4c4b4cd2 | 588 | return p - name; |
14f9c5c9 AS |
589 | } |
590 | } | |
591 | ||
4c4b4cd2 PH |
592 | /* Return non-zero if SUFFIX is a suffix of STR. |
593 | Return zero if STR is null. */ | |
594 | ||
14f9c5c9 | 595 | static int |
d2e4a39e | 596 | is_suffix (const char *str, const char *suffix) |
14f9c5c9 AS |
597 | { |
598 | int len1, len2; | |
5b4ee69b | 599 | |
14f9c5c9 AS |
600 | if (str == NULL) |
601 | return 0; | |
602 | len1 = strlen (str); | |
603 | len2 = strlen (suffix); | |
4c4b4cd2 | 604 | return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0); |
14f9c5c9 AS |
605 | } |
606 | ||
4c4b4cd2 PH |
607 | /* The contents of value VAL, treated as a value of type TYPE. The |
608 | result is an lval in memory if VAL is. */ | |
14f9c5c9 | 609 | |
d2e4a39e | 610 | static struct value * |
4c4b4cd2 | 611 | coerce_unspec_val_to_type (struct value *val, struct type *type) |
14f9c5c9 | 612 | { |
61ee279c | 613 | type = ada_check_typedef (type); |
df407dfe | 614 | if (value_type (val) == type) |
4c4b4cd2 | 615 | return val; |
d2e4a39e | 616 | else |
14f9c5c9 | 617 | { |
4c4b4cd2 PH |
618 | struct value *result; |
619 | ||
620 | /* Make sure that the object size is not unreasonable before | |
621 | trying to allocate some memory for it. */ | |
c1b5a1a6 | 622 | ada_ensure_varsize_limit (type); |
4c4b4cd2 | 623 | |
41e8491f JK |
624 | if (value_lazy (val) |
625 | || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val))) | |
626 | result = allocate_value_lazy (type); | |
627 | else | |
628 | { | |
629 | result = allocate_value (type); | |
9a0dc9e3 | 630 | value_contents_copy_raw (result, 0, val, 0, TYPE_LENGTH (type)); |
41e8491f | 631 | } |
74bcbdf3 | 632 | set_value_component_location (result, val); |
9bbda503 AC |
633 | set_value_bitsize (result, value_bitsize (val)); |
634 | set_value_bitpos (result, value_bitpos (val)); | |
c408a94f TT |
635 | if (VALUE_LVAL (result) == lval_memory) |
636 | set_value_address (result, value_address (val)); | |
14f9c5c9 AS |
637 | return result; |
638 | } | |
639 | } | |
640 | ||
fc1a4b47 AC |
641 | static const gdb_byte * |
642 | cond_offset_host (const gdb_byte *valaddr, long offset) | |
14f9c5c9 AS |
643 | { |
644 | if (valaddr == NULL) | |
645 | return NULL; | |
646 | else | |
647 | return valaddr + offset; | |
648 | } | |
649 | ||
650 | static CORE_ADDR | |
ebf56fd3 | 651 | cond_offset_target (CORE_ADDR address, long offset) |
14f9c5c9 AS |
652 | { |
653 | if (address == 0) | |
654 | return 0; | |
d2e4a39e | 655 | else |
14f9c5c9 AS |
656 | return address + offset; |
657 | } | |
658 | ||
4c4b4cd2 PH |
659 | /* Issue a warning (as for the definition of warning in utils.c, but |
660 | with exactly one argument rather than ...), unless the limit on the | |
661 | number of warnings has passed during the evaluation of the current | |
662 | expression. */ | |
a2249542 | 663 | |
77109804 AC |
664 | /* FIXME: cagney/2004-10-10: This function is mimicking the behavior |
665 | provided by "complaint". */ | |
a0b31db1 | 666 | static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2); |
77109804 | 667 | |
14f9c5c9 | 668 | static void |
a2249542 | 669 | lim_warning (const char *format, ...) |
14f9c5c9 | 670 | { |
a2249542 | 671 | va_list args; |
a2249542 | 672 | |
5b4ee69b | 673 | va_start (args, format); |
4c4b4cd2 PH |
674 | warnings_issued += 1; |
675 | if (warnings_issued <= warning_limit) | |
a2249542 MK |
676 | vwarning (format, args); |
677 | ||
678 | va_end (args); | |
4c4b4cd2 PH |
679 | } |
680 | ||
714e53ab PH |
681 | /* Issue an error if the size of an object of type T is unreasonable, |
682 | i.e. if it would be a bad idea to allocate a value of this type in | |
683 | GDB. */ | |
684 | ||
c1b5a1a6 JB |
685 | void |
686 | ada_ensure_varsize_limit (const struct type *type) | |
714e53ab PH |
687 | { |
688 | if (TYPE_LENGTH (type) > varsize_limit) | |
323e0a4a | 689 | error (_("object size is larger than varsize-limit")); |
714e53ab PH |
690 | } |
691 | ||
0963b4bd | 692 | /* Maximum value of a SIZE-byte signed integer type. */ |
4c4b4cd2 | 693 | static LONGEST |
c3e5cd34 | 694 | max_of_size (int size) |
4c4b4cd2 | 695 | { |
76a01679 | 696 | LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2); |
5b4ee69b | 697 | |
76a01679 | 698 | return top_bit | (top_bit - 1); |
4c4b4cd2 PH |
699 | } |
700 | ||
0963b4bd | 701 | /* Minimum value of a SIZE-byte signed integer type. */ |
4c4b4cd2 | 702 | static LONGEST |
c3e5cd34 | 703 | min_of_size (int size) |
4c4b4cd2 | 704 | { |
c3e5cd34 | 705 | return -max_of_size (size) - 1; |
4c4b4cd2 PH |
706 | } |
707 | ||
0963b4bd | 708 | /* Maximum value of a SIZE-byte unsigned integer type. */ |
4c4b4cd2 | 709 | static ULONGEST |
c3e5cd34 | 710 | umax_of_size (int size) |
4c4b4cd2 | 711 | { |
76a01679 | 712 | ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1); |
5b4ee69b | 713 | |
76a01679 | 714 | return top_bit | (top_bit - 1); |
4c4b4cd2 PH |
715 | } |
716 | ||
0963b4bd | 717 | /* Maximum value of integral type T, as a signed quantity. */ |
c3e5cd34 PH |
718 | static LONGEST |
719 | max_of_type (struct type *t) | |
4c4b4cd2 | 720 | { |
c3e5cd34 PH |
721 | if (TYPE_UNSIGNED (t)) |
722 | return (LONGEST) umax_of_size (TYPE_LENGTH (t)); | |
723 | else | |
724 | return max_of_size (TYPE_LENGTH (t)); | |
725 | } | |
726 | ||
0963b4bd | 727 | /* Minimum value of integral type T, as a signed quantity. */ |
c3e5cd34 PH |
728 | static LONGEST |
729 | min_of_type (struct type *t) | |
730 | { | |
731 | if (TYPE_UNSIGNED (t)) | |
732 | return 0; | |
733 | else | |
734 | return min_of_size (TYPE_LENGTH (t)); | |
4c4b4cd2 PH |
735 | } |
736 | ||
737 | /* The largest value in the domain of TYPE, a discrete type, as an integer. */ | |
43bbcdc2 PH |
738 | LONGEST |
739 | ada_discrete_type_high_bound (struct type *type) | |
4c4b4cd2 | 740 | { |
b249d2c2 | 741 | type = resolve_dynamic_type (type, {}, 0); |
78134374 | 742 | switch (type->code ()) |
4c4b4cd2 PH |
743 | { |
744 | case TYPE_CODE_RANGE: | |
690cc4eb | 745 | return TYPE_HIGH_BOUND (type); |
4c4b4cd2 | 746 | case TYPE_CODE_ENUM: |
1f704f76 | 747 | return TYPE_FIELD_ENUMVAL (type, type->num_fields () - 1); |
690cc4eb PH |
748 | case TYPE_CODE_BOOL: |
749 | return 1; | |
750 | case TYPE_CODE_CHAR: | |
76a01679 | 751 | case TYPE_CODE_INT: |
690cc4eb | 752 | return max_of_type (type); |
4c4b4cd2 | 753 | default: |
43bbcdc2 | 754 | error (_("Unexpected type in ada_discrete_type_high_bound.")); |
4c4b4cd2 PH |
755 | } |
756 | } | |
757 | ||
14e75d8e | 758 | /* The smallest value in the domain of TYPE, a discrete type, as an integer. */ |
43bbcdc2 PH |
759 | LONGEST |
760 | ada_discrete_type_low_bound (struct type *type) | |
4c4b4cd2 | 761 | { |
b249d2c2 | 762 | type = resolve_dynamic_type (type, {}, 0); |
78134374 | 763 | switch (type->code ()) |
4c4b4cd2 PH |
764 | { |
765 | case TYPE_CODE_RANGE: | |
690cc4eb | 766 | return TYPE_LOW_BOUND (type); |
4c4b4cd2 | 767 | case TYPE_CODE_ENUM: |
14e75d8e | 768 | return TYPE_FIELD_ENUMVAL (type, 0); |
690cc4eb PH |
769 | case TYPE_CODE_BOOL: |
770 | return 0; | |
771 | case TYPE_CODE_CHAR: | |
76a01679 | 772 | case TYPE_CODE_INT: |
690cc4eb | 773 | return min_of_type (type); |
4c4b4cd2 | 774 | default: |
43bbcdc2 | 775 | error (_("Unexpected type in ada_discrete_type_low_bound.")); |
4c4b4cd2 PH |
776 | } |
777 | } | |
778 | ||
779 | /* The identity on non-range types. For range types, the underlying | |
76a01679 | 780 | non-range scalar type. */ |
4c4b4cd2 PH |
781 | |
782 | static struct type * | |
18af8284 | 783 | get_base_type (struct type *type) |
4c4b4cd2 | 784 | { |
78134374 | 785 | while (type != NULL && type->code () == TYPE_CODE_RANGE) |
4c4b4cd2 | 786 | { |
76a01679 JB |
787 | if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL) |
788 | return type; | |
4c4b4cd2 PH |
789 | type = TYPE_TARGET_TYPE (type); |
790 | } | |
791 | return type; | |
14f9c5c9 | 792 | } |
41246937 JB |
793 | |
794 | /* Return a decoded version of the given VALUE. This means returning | |
795 | a value whose type is obtained by applying all the GNAT-specific | |
85102364 | 796 | encodings, making the resulting type a static but standard description |
41246937 JB |
797 | of the initial type. */ |
798 | ||
799 | struct value * | |
800 | ada_get_decoded_value (struct value *value) | |
801 | { | |
802 | struct type *type = ada_check_typedef (value_type (value)); | |
803 | ||
804 | if (ada_is_array_descriptor_type (type) | |
805 | || (ada_is_constrained_packed_array_type (type) | |
78134374 | 806 | && type->code () != TYPE_CODE_PTR)) |
41246937 | 807 | { |
78134374 | 808 | if (type->code () == TYPE_CODE_TYPEDEF) /* array access type. */ |
41246937 JB |
809 | value = ada_coerce_to_simple_array_ptr (value); |
810 | else | |
811 | value = ada_coerce_to_simple_array (value); | |
812 | } | |
813 | else | |
814 | value = ada_to_fixed_value (value); | |
815 | ||
816 | return value; | |
817 | } | |
818 | ||
819 | /* Same as ada_get_decoded_value, but with the given TYPE. | |
820 | Because there is no associated actual value for this type, | |
821 | the resulting type might be a best-effort approximation in | |
822 | the case of dynamic types. */ | |
823 | ||
824 | struct type * | |
825 | ada_get_decoded_type (struct type *type) | |
826 | { | |
827 | type = to_static_fixed_type (type); | |
828 | if (ada_is_constrained_packed_array_type (type)) | |
829 | type = ada_coerce_to_simple_array_type (type); | |
830 | return type; | |
831 | } | |
832 | ||
4c4b4cd2 | 833 | \f |
76a01679 | 834 | |
4c4b4cd2 | 835 | /* Language Selection */ |
14f9c5c9 AS |
836 | |
837 | /* If the main program is in Ada, return language_ada, otherwise return LANG | |
ccefe4c4 | 838 | (the main program is in Ada iif the adainit symbol is found). */ |
d2e4a39e | 839 | |
de93309a | 840 | static enum language |
ccefe4c4 | 841 | ada_update_initial_language (enum language lang) |
14f9c5c9 | 842 | { |
cafb3438 | 843 | if (lookup_minimal_symbol ("adainit", NULL, NULL).minsym != NULL) |
4c4b4cd2 | 844 | return language_ada; |
14f9c5c9 AS |
845 | |
846 | return lang; | |
847 | } | |
96d887e8 PH |
848 | |
849 | /* If the main procedure is written in Ada, then return its name. | |
850 | The result is good until the next call. Return NULL if the main | |
851 | procedure doesn't appear to be in Ada. */ | |
852 | ||
853 | char * | |
854 | ada_main_name (void) | |
855 | { | |
3b7344d5 | 856 | struct bound_minimal_symbol msym; |
e83e4e24 | 857 | static gdb::unique_xmalloc_ptr<char> main_program_name; |
6c038f32 | 858 | |
96d887e8 PH |
859 | /* For Ada, the name of the main procedure is stored in a specific |
860 | string constant, generated by the binder. Look for that symbol, | |
861 | extract its address, and then read that string. If we didn't find | |
862 | that string, then most probably the main procedure is not written | |
863 | in Ada. */ | |
864 | msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL); | |
865 | ||
3b7344d5 | 866 | if (msym.minsym != NULL) |
96d887e8 | 867 | { |
f9bc20b9 JB |
868 | CORE_ADDR main_program_name_addr; |
869 | int err_code; | |
870 | ||
77e371c0 | 871 | main_program_name_addr = BMSYMBOL_VALUE_ADDRESS (msym); |
96d887e8 | 872 | if (main_program_name_addr == 0) |
323e0a4a | 873 | error (_("Invalid address for Ada main program name.")); |
96d887e8 | 874 | |
f9bc20b9 JB |
875 | target_read_string (main_program_name_addr, &main_program_name, |
876 | 1024, &err_code); | |
877 | ||
878 | if (err_code != 0) | |
879 | return NULL; | |
e83e4e24 | 880 | return main_program_name.get (); |
96d887e8 PH |
881 | } |
882 | ||
883 | /* The main procedure doesn't seem to be in Ada. */ | |
884 | return NULL; | |
885 | } | |
14f9c5c9 | 886 | \f |
4c4b4cd2 | 887 | /* Symbols */ |
d2e4a39e | 888 | |
4c4b4cd2 PH |
889 | /* Table of Ada operators and their GNAT-encoded names. Last entry is pair |
890 | of NULLs. */ | |
14f9c5c9 | 891 | |
d2e4a39e AS |
892 | const struct ada_opname_map ada_opname_table[] = { |
893 | {"Oadd", "\"+\"", BINOP_ADD}, | |
894 | {"Osubtract", "\"-\"", BINOP_SUB}, | |
895 | {"Omultiply", "\"*\"", BINOP_MUL}, | |
896 | {"Odivide", "\"/\"", BINOP_DIV}, | |
897 | {"Omod", "\"mod\"", BINOP_MOD}, | |
898 | {"Orem", "\"rem\"", BINOP_REM}, | |
899 | {"Oexpon", "\"**\"", BINOP_EXP}, | |
900 | {"Olt", "\"<\"", BINOP_LESS}, | |
901 | {"Ole", "\"<=\"", BINOP_LEQ}, | |
902 | {"Ogt", "\">\"", BINOP_GTR}, | |
903 | {"Oge", "\">=\"", BINOP_GEQ}, | |
904 | {"Oeq", "\"=\"", BINOP_EQUAL}, | |
905 | {"One", "\"/=\"", BINOP_NOTEQUAL}, | |
906 | {"Oand", "\"and\"", BINOP_BITWISE_AND}, | |
907 | {"Oor", "\"or\"", BINOP_BITWISE_IOR}, | |
908 | {"Oxor", "\"xor\"", BINOP_BITWISE_XOR}, | |
909 | {"Oconcat", "\"&\"", BINOP_CONCAT}, | |
910 | {"Oabs", "\"abs\"", UNOP_ABS}, | |
911 | {"Onot", "\"not\"", UNOP_LOGICAL_NOT}, | |
912 | {"Oadd", "\"+\"", UNOP_PLUS}, | |
913 | {"Osubtract", "\"-\"", UNOP_NEG}, | |
914 | {NULL, NULL} | |
14f9c5c9 AS |
915 | }; |
916 | ||
b5ec771e PA |
917 | /* The "encoded" form of DECODED, according to GNAT conventions. The |
918 | result is valid until the next call to ada_encode. If | |
919 | THROW_ERRORS, throw an error if invalid operator name is found. | |
920 | Otherwise, return NULL in that case. */ | |
4c4b4cd2 | 921 | |
b5ec771e PA |
922 | static char * |
923 | ada_encode_1 (const char *decoded, bool throw_errors) | |
14f9c5c9 | 924 | { |
4c4b4cd2 PH |
925 | static char *encoding_buffer = NULL; |
926 | static size_t encoding_buffer_size = 0; | |
d2e4a39e | 927 | const char *p; |
14f9c5c9 | 928 | int k; |
d2e4a39e | 929 | |
4c4b4cd2 | 930 | if (decoded == NULL) |
14f9c5c9 AS |
931 | return NULL; |
932 | ||
4c4b4cd2 PH |
933 | GROW_VECT (encoding_buffer, encoding_buffer_size, |
934 | 2 * strlen (decoded) + 10); | |
14f9c5c9 AS |
935 | |
936 | k = 0; | |
4c4b4cd2 | 937 | for (p = decoded; *p != '\0'; p += 1) |
14f9c5c9 | 938 | { |
cdc7bb92 | 939 | if (*p == '.') |
4c4b4cd2 PH |
940 | { |
941 | encoding_buffer[k] = encoding_buffer[k + 1] = '_'; | |
942 | k += 2; | |
943 | } | |
14f9c5c9 | 944 | else if (*p == '"') |
4c4b4cd2 PH |
945 | { |
946 | const struct ada_opname_map *mapping; | |
947 | ||
948 | for (mapping = ada_opname_table; | |
1265e4aa | 949 | mapping->encoded != NULL |
61012eef | 950 | && !startswith (p, mapping->decoded); mapping += 1) |
4c4b4cd2 PH |
951 | ; |
952 | if (mapping->encoded == NULL) | |
b5ec771e PA |
953 | { |
954 | if (throw_errors) | |
955 | error (_("invalid Ada operator name: %s"), p); | |
956 | else | |
957 | return NULL; | |
958 | } | |
4c4b4cd2 PH |
959 | strcpy (encoding_buffer + k, mapping->encoded); |
960 | k += strlen (mapping->encoded); | |
961 | break; | |
962 | } | |
d2e4a39e | 963 | else |
4c4b4cd2 PH |
964 | { |
965 | encoding_buffer[k] = *p; | |
966 | k += 1; | |
967 | } | |
14f9c5c9 AS |
968 | } |
969 | ||
4c4b4cd2 PH |
970 | encoding_buffer[k] = '\0'; |
971 | return encoding_buffer; | |
14f9c5c9 AS |
972 | } |
973 | ||
b5ec771e PA |
974 | /* The "encoded" form of DECODED, according to GNAT conventions. |
975 | The result is valid until the next call to ada_encode. */ | |
976 | ||
977 | char * | |
978 | ada_encode (const char *decoded) | |
979 | { | |
980 | return ada_encode_1 (decoded, true); | |
981 | } | |
982 | ||
14f9c5c9 | 983 | /* Return NAME folded to lower case, or, if surrounded by single |
4c4b4cd2 PH |
984 | quotes, unfolded, but with the quotes stripped away. Result good |
985 | to next call. */ | |
986 | ||
de93309a | 987 | static char * |
e0802d59 | 988 | ada_fold_name (gdb::string_view name) |
14f9c5c9 | 989 | { |
d2e4a39e | 990 | static char *fold_buffer = NULL; |
14f9c5c9 AS |
991 | static size_t fold_buffer_size = 0; |
992 | ||
e0802d59 | 993 | int len = name.size (); |
d2e4a39e | 994 | GROW_VECT (fold_buffer, fold_buffer_size, len + 1); |
14f9c5c9 AS |
995 | |
996 | if (name[0] == '\'') | |
997 | { | |
e0802d59 | 998 | strncpy (fold_buffer, name.data () + 1, len - 2); |
d2e4a39e | 999 | fold_buffer[len - 2] = '\000'; |
14f9c5c9 AS |
1000 | } |
1001 | else | |
1002 | { | |
1003 | int i; | |
5b4ee69b | 1004 | |
14f9c5c9 | 1005 | for (i = 0; i <= len; i += 1) |
4c4b4cd2 | 1006 | fold_buffer[i] = tolower (name[i]); |
14f9c5c9 AS |
1007 | } |
1008 | ||
1009 | return fold_buffer; | |
1010 | } | |
1011 | ||
529cad9c PH |
1012 | /* Return nonzero if C is either a digit or a lowercase alphabet character. */ |
1013 | ||
1014 | static int | |
1015 | is_lower_alphanum (const char c) | |
1016 | { | |
1017 | return (isdigit (c) || (isalpha (c) && islower (c))); | |
1018 | } | |
1019 | ||
c90092fe JB |
1020 | /* ENCODED is the linkage name of a symbol and LEN contains its length. |
1021 | This function saves in LEN the length of that same symbol name but | |
1022 | without either of these suffixes: | |
29480c32 JB |
1023 | . .{DIGIT}+ |
1024 | . ${DIGIT}+ | |
1025 | . ___{DIGIT}+ | |
1026 | . __{DIGIT}+. | |
c90092fe | 1027 | |
29480c32 JB |
1028 | These are suffixes introduced by the compiler for entities such as |
1029 | nested subprogram for instance, in order to avoid name clashes. | |
1030 | They do not serve any purpose for the debugger. */ | |
1031 | ||
1032 | static void | |
1033 | ada_remove_trailing_digits (const char *encoded, int *len) | |
1034 | { | |
1035 | if (*len > 1 && isdigit (encoded[*len - 1])) | |
1036 | { | |
1037 | int i = *len - 2; | |
5b4ee69b | 1038 | |
29480c32 JB |
1039 | while (i > 0 && isdigit (encoded[i])) |
1040 | i--; | |
1041 | if (i >= 0 && encoded[i] == '.') | |
1042 | *len = i; | |
1043 | else if (i >= 0 && encoded[i] == '$') | |
1044 | *len = i; | |
61012eef | 1045 | else if (i >= 2 && startswith (encoded + i - 2, "___")) |
29480c32 | 1046 | *len = i - 2; |
61012eef | 1047 | else if (i >= 1 && startswith (encoded + i - 1, "__")) |
29480c32 JB |
1048 | *len = i - 1; |
1049 | } | |
1050 | } | |
1051 | ||
1052 | /* Remove the suffix introduced by the compiler for protected object | |
1053 | subprograms. */ | |
1054 | ||
1055 | static void | |
1056 | ada_remove_po_subprogram_suffix (const char *encoded, int *len) | |
1057 | { | |
1058 | /* Remove trailing N. */ | |
1059 | ||
1060 | /* Protected entry subprograms are broken into two | |
1061 | separate subprograms: The first one is unprotected, and has | |
1062 | a 'N' suffix; the second is the protected version, and has | |
0963b4bd | 1063 | the 'P' suffix. The second calls the first one after handling |
29480c32 JB |
1064 | the protection. Since the P subprograms are internally generated, |
1065 | we leave these names undecoded, giving the user a clue that this | |
1066 | entity is internal. */ | |
1067 | ||
1068 | if (*len > 1 | |
1069 | && encoded[*len - 1] == 'N' | |
1070 | && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2]))) | |
1071 | *len = *len - 1; | |
1072 | } | |
1073 | ||
1074 | /* If ENCODED follows the GNAT entity encoding conventions, then return | |
1075 | the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is | |
f945dedf | 1076 | replaced by ENCODED. */ |
14f9c5c9 | 1077 | |
f945dedf | 1078 | std::string |
4c4b4cd2 | 1079 | ada_decode (const char *encoded) |
14f9c5c9 AS |
1080 | { |
1081 | int i, j; | |
1082 | int len0; | |
d2e4a39e | 1083 | const char *p; |
14f9c5c9 | 1084 | int at_start_name; |
f945dedf | 1085 | std::string decoded; |
d2e4a39e | 1086 | |
0d81f350 JG |
1087 | /* With function descriptors on PPC64, the value of a symbol named |
1088 | ".FN", if it exists, is the entry point of the function "FN". */ | |
1089 | if (encoded[0] == '.') | |
1090 | encoded += 1; | |
1091 | ||
29480c32 JB |
1092 | /* The name of the Ada main procedure starts with "_ada_". |
1093 | This prefix is not part of the decoded name, so skip this part | |
1094 | if we see this prefix. */ | |
61012eef | 1095 | if (startswith (encoded, "_ada_")) |
4c4b4cd2 | 1096 | encoded += 5; |
14f9c5c9 | 1097 | |
29480c32 JB |
1098 | /* If the name starts with '_', then it is not a properly encoded |
1099 | name, so do not attempt to decode it. Similarly, if the name | |
1100 | starts with '<', the name should not be decoded. */ | |
4c4b4cd2 | 1101 | if (encoded[0] == '_' || encoded[0] == '<') |
14f9c5c9 AS |
1102 | goto Suppress; |
1103 | ||
4c4b4cd2 | 1104 | len0 = strlen (encoded); |
4c4b4cd2 | 1105 | |
29480c32 JB |
1106 | ada_remove_trailing_digits (encoded, &len0); |
1107 | ada_remove_po_subprogram_suffix (encoded, &len0); | |
529cad9c | 1108 | |
4c4b4cd2 PH |
1109 | /* Remove the ___X.* suffix if present. Do not forget to verify that |
1110 | the suffix is located before the current "end" of ENCODED. We want | |
1111 | to avoid re-matching parts of ENCODED that have previously been | |
1112 | marked as discarded (by decrementing LEN0). */ | |
1113 | p = strstr (encoded, "___"); | |
1114 | if (p != NULL && p - encoded < len0 - 3) | |
14f9c5c9 AS |
1115 | { |
1116 | if (p[3] == 'X') | |
4c4b4cd2 | 1117 | len0 = p - encoded; |
14f9c5c9 | 1118 | else |
4c4b4cd2 | 1119 | goto Suppress; |
14f9c5c9 | 1120 | } |
4c4b4cd2 | 1121 | |
29480c32 JB |
1122 | /* Remove any trailing TKB suffix. It tells us that this symbol |
1123 | is for the body of a task, but that information does not actually | |
1124 | appear in the decoded name. */ | |
1125 | ||
61012eef | 1126 | if (len0 > 3 && startswith (encoded + len0 - 3, "TKB")) |
14f9c5c9 | 1127 | len0 -= 3; |
76a01679 | 1128 | |
a10967fa JB |
1129 | /* Remove any trailing TB suffix. The TB suffix is slightly different |
1130 | from the TKB suffix because it is used for non-anonymous task | |
1131 | bodies. */ | |
1132 | ||
61012eef | 1133 | if (len0 > 2 && startswith (encoded + len0 - 2, "TB")) |
a10967fa JB |
1134 | len0 -= 2; |
1135 | ||
29480c32 JB |
1136 | /* Remove trailing "B" suffixes. */ |
1137 | /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */ | |
1138 | ||
61012eef | 1139 | if (len0 > 1 && startswith (encoded + len0 - 1, "B")) |
14f9c5c9 AS |
1140 | len0 -= 1; |
1141 | ||
4c4b4cd2 | 1142 | /* Make decoded big enough for possible expansion by operator name. */ |
29480c32 | 1143 | |
f945dedf | 1144 | decoded.resize (2 * len0 + 1, 'X'); |
14f9c5c9 | 1145 | |
29480c32 JB |
1146 | /* Remove trailing __{digit}+ or trailing ${digit}+. */ |
1147 | ||
4c4b4cd2 | 1148 | if (len0 > 1 && isdigit (encoded[len0 - 1])) |
d2e4a39e | 1149 | { |
4c4b4cd2 PH |
1150 | i = len0 - 2; |
1151 | while ((i >= 0 && isdigit (encoded[i])) | |
1152 | || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1]))) | |
1153 | i -= 1; | |
1154 | if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_') | |
1155 | len0 = i - 1; | |
1156 | else if (encoded[i] == '$') | |
1157 | len0 = i; | |
d2e4a39e | 1158 | } |
14f9c5c9 | 1159 | |
29480c32 JB |
1160 | /* The first few characters that are not alphabetic are not part |
1161 | of any encoding we use, so we can copy them over verbatim. */ | |
1162 | ||
4c4b4cd2 PH |
1163 | for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1) |
1164 | decoded[j] = encoded[i]; | |
14f9c5c9 AS |
1165 | |
1166 | at_start_name = 1; | |
1167 | while (i < len0) | |
1168 | { | |
29480c32 | 1169 | /* Is this a symbol function? */ |
4c4b4cd2 PH |
1170 | if (at_start_name && encoded[i] == 'O') |
1171 | { | |
1172 | int k; | |
5b4ee69b | 1173 | |
4c4b4cd2 PH |
1174 | for (k = 0; ada_opname_table[k].encoded != NULL; k += 1) |
1175 | { | |
1176 | int op_len = strlen (ada_opname_table[k].encoded); | |
06d5cf63 JB |
1177 | if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1, |
1178 | op_len - 1) == 0) | |
1179 | && !isalnum (encoded[i + op_len])) | |
4c4b4cd2 | 1180 | { |
f945dedf | 1181 | strcpy (&decoded.front() + j, ada_opname_table[k].decoded); |
4c4b4cd2 PH |
1182 | at_start_name = 0; |
1183 | i += op_len; | |
1184 | j += strlen (ada_opname_table[k].decoded); | |
1185 | break; | |
1186 | } | |
1187 | } | |
1188 | if (ada_opname_table[k].encoded != NULL) | |
1189 | continue; | |
1190 | } | |
14f9c5c9 AS |
1191 | at_start_name = 0; |
1192 | ||
529cad9c PH |
1193 | /* Replace "TK__" with "__", which will eventually be translated |
1194 | into "." (just below). */ | |
1195 | ||
61012eef | 1196 | if (i < len0 - 4 && startswith (encoded + i, "TK__")) |
4c4b4cd2 | 1197 | i += 2; |
529cad9c | 1198 | |
29480c32 JB |
1199 | /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually |
1200 | be translated into "." (just below). These are internal names | |
1201 | generated for anonymous blocks inside which our symbol is nested. */ | |
1202 | ||
1203 | if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_' | |
1204 | && encoded [i+2] == 'B' && encoded [i+3] == '_' | |
1205 | && isdigit (encoded [i+4])) | |
1206 | { | |
1207 | int k = i + 5; | |
1208 | ||
1209 | while (k < len0 && isdigit (encoded[k])) | |
1210 | k++; /* Skip any extra digit. */ | |
1211 | ||
1212 | /* Double-check that the "__B_{DIGITS}+" sequence we found | |
1213 | is indeed followed by "__". */ | |
1214 | if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_') | |
1215 | i = k; | |
1216 | } | |
1217 | ||
529cad9c PH |
1218 | /* Remove _E{DIGITS}+[sb] */ |
1219 | ||
1220 | /* Just as for protected object subprograms, there are 2 categories | |
0963b4bd | 1221 | of subprograms created by the compiler for each entry. The first |
529cad9c PH |
1222 | one implements the actual entry code, and has a suffix following |
1223 | the convention above; the second one implements the barrier and | |
1224 | uses the same convention as above, except that the 'E' is replaced | |
1225 | by a 'B'. | |
1226 | ||
1227 | Just as above, we do not decode the name of barrier functions | |
1228 | to give the user a clue that the code he is debugging has been | |
1229 | internally generated. */ | |
1230 | ||
1231 | if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E' | |
1232 | && isdigit (encoded[i+2])) | |
1233 | { | |
1234 | int k = i + 3; | |
1235 | ||
1236 | while (k < len0 && isdigit (encoded[k])) | |
1237 | k++; | |
1238 | ||
1239 | if (k < len0 | |
1240 | && (encoded[k] == 'b' || encoded[k] == 's')) | |
1241 | { | |
1242 | k++; | |
1243 | /* Just as an extra precaution, make sure that if this | |
1244 | suffix is followed by anything else, it is a '_'. | |
1245 | Otherwise, we matched this sequence by accident. */ | |
1246 | if (k == len0 | |
1247 | || (k < len0 && encoded[k] == '_')) | |
1248 | i = k; | |
1249 | } | |
1250 | } | |
1251 | ||
1252 | /* Remove trailing "N" in [a-z0-9]+N__. The N is added by | |
1253 | the GNAT front-end in protected object subprograms. */ | |
1254 | ||
1255 | if (i < len0 + 3 | |
1256 | && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_') | |
1257 | { | |
1258 | /* Backtrack a bit up until we reach either the begining of | |
1259 | the encoded name, or "__". Make sure that we only find | |
1260 | digits or lowercase characters. */ | |
1261 | const char *ptr = encoded + i - 1; | |
1262 | ||
1263 | while (ptr >= encoded && is_lower_alphanum (ptr[0])) | |
1264 | ptr--; | |
1265 | if (ptr < encoded | |
1266 | || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_')) | |
1267 | i++; | |
1268 | } | |
1269 | ||
4c4b4cd2 PH |
1270 | if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1])) |
1271 | { | |
29480c32 JB |
1272 | /* This is a X[bn]* sequence not separated from the previous |
1273 | part of the name with a non-alpha-numeric character (in other | |
1274 | words, immediately following an alpha-numeric character), then | |
1275 | verify that it is placed at the end of the encoded name. If | |
1276 | not, then the encoding is not valid and we should abort the | |
1277 | decoding. Otherwise, just skip it, it is used in body-nested | |
1278 | package names. */ | |
4c4b4cd2 PH |
1279 | do |
1280 | i += 1; | |
1281 | while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n')); | |
1282 | if (i < len0) | |
1283 | goto Suppress; | |
1284 | } | |
cdc7bb92 | 1285 | else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_') |
4c4b4cd2 | 1286 | { |
29480c32 | 1287 | /* Replace '__' by '.'. */ |
4c4b4cd2 PH |
1288 | decoded[j] = '.'; |
1289 | at_start_name = 1; | |
1290 | i += 2; | |
1291 | j += 1; | |
1292 | } | |
14f9c5c9 | 1293 | else |
4c4b4cd2 | 1294 | { |
29480c32 JB |
1295 | /* It's a character part of the decoded name, so just copy it |
1296 | over. */ | |
4c4b4cd2 PH |
1297 | decoded[j] = encoded[i]; |
1298 | i += 1; | |
1299 | j += 1; | |
1300 | } | |
14f9c5c9 | 1301 | } |
f945dedf | 1302 | decoded.resize (j); |
14f9c5c9 | 1303 | |
29480c32 JB |
1304 | /* Decoded names should never contain any uppercase character. |
1305 | Double-check this, and abort the decoding if we find one. */ | |
1306 | ||
f945dedf | 1307 | for (i = 0; i < decoded.length(); ++i) |
4c4b4cd2 | 1308 | if (isupper (decoded[i]) || decoded[i] == ' ') |
14f9c5c9 AS |
1309 | goto Suppress; |
1310 | ||
f945dedf | 1311 | return decoded; |
14f9c5c9 AS |
1312 | |
1313 | Suppress: | |
4c4b4cd2 | 1314 | if (encoded[0] == '<') |
f945dedf | 1315 | decoded = encoded; |
14f9c5c9 | 1316 | else |
f945dedf | 1317 | decoded = '<' + std::string(encoded) + '>'; |
4c4b4cd2 PH |
1318 | return decoded; |
1319 | ||
1320 | } | |
1321 | ||
1322 | /* Table for keeping permanent unique copies of decoded names. Once | |
1323 | allocated, names in this table are never released. While this is a | |
1324 | storage leak, it should not be significant unless there are massive | |
1325 | changes in the set of decoded names in successive versions of a | |
1326 | symbol table loaded during a single session. */ | |
1327 | static struct htab *decoded_names_store; | |
1328 | ||
1329 | /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it | |
1330 | in the language-specific part of GSYMBOL, if it has not been | |
1331 | previously computed. Tries to save the decoded name in the same | |
1332 | obstack as GSYMBOL, if possible, and otherwise on the heap (so that, | |
1333 | in any case, the decoded symbol has a lifetime at least that of | |
0963b4bd | 1334 | GSYMBOL). |
4c4b4cd2 PH |
1335 | The GSYMBOL parameter is "mutable" in the C++ sense: logically |
1336 | const, but nevertheless modified to a semantically equivalent form | |
0963b4bd | 1337 | when a decoded name is cached in it. */ |
4c4b4cd2 | 1338 | |
45e6c716 | 1339 | const char * |
f85f34ed | 1340 | ada_decode_symbol (const struct general_symbol_info *arg) |
4c4b4cd2 | 1341 | { |
f85f34ed TT |
1342 | struct general_symbol_info *gsymbol = (struct general_symbol_info *) arg; |
1343 | const char **resultp = | |
615b3f62 | 1344 | &gsymbol->language_specific.demangled_name; |
5b4ee69b | 1345 | |
f85f34ed | 1346 | if (!gsymbol->ada_mangled) |
4c4b4cd2 | 1347 | { |
4d4eaa30 | 1348 | std::string decoded = ada_decode (gsymbol->linkage_name ()); |
f85f34ed | 1349 | struct obstack *obstack = gsymbol->language_specific.obstack; |
5b4ee69b | 1350 | |
f85f34ed | 1351 | gsymbol->ada_mangled = 1; |
5b4ee69b | 1352 | |
f85f34ed | 1353 | if (obstack != NULL) |
f945dedf | 1354 | *resultp = obstack_strdup (obstack, decoded.c_str ()); |
f85f34ed | 1355 | else |
76a01679 | 1356 | { |
f85f34ed TT |
1357 | /* Sometimes, we can't find a corresponding objfile, in |
1358 | which case, we put the result on the heap. Since we only | |
1359 | decode when needed, we hope this usually does not cause a | |
1360 | significant memory leak (FIXME). */ | |
1361 | ||
76a01679 | 1362 | char **slot = (char **) htab_find_slot (decoded_names_store, |
f945dedf | 1363 | decoded.c_str (), INSERT); |
5b4ee69b | 1364 | |
76a01679 | 1365 | if (*slot == NULL) |
f945dedf | 1366 | *slot = xstrdup (decoded.c_str ()); |
76a01679 JB |
1367 | *resultp = *slot; |
1368 | } | |
4c4b4cd2 | 1369 | } |
14f9c5c9 | 1370 | |
4c4b4cd2 PH |
1371 | return *resultp; |
1372 | } | |
76a01679 | 1373 | |
2c0b251b | 1374 | static char * |
76a01679 | 1375 | ada_la_decode (const char *encoded, int options) |
4c4b4cd2 | 1376 | { |
f945dedf | 1377 | return xstrdup (ada_decode (encoded).c_str ()); |
14f9c5c9 AS |
1378 | } |
1379 | ||
8b302db8 TT |
1380 | /* Implement la_sniff_from_mangled_name for Ada. */ |
1381 | ||
1382 | static int | |
1383 | ada_sniff_from_mangled_name (const char *mangled, char **out) | |
1384 | { | |
f945dedf | 1385 | std::string demangled = ada_decode (mangled); |
8b302db8 TT |
1386 | |
1387 | *out = NULL; | |
1388 | ||
f945dedf | 1389 | if (demangled != mangled && demangled[0] != '<') |
8b302db8 TT |
1390 | { |
1391 | /* Set the gsymbol language to Ada, but still return 0. | |
1392 | Two reasons for that: | |
1393 | ||
1394 | 1. For Ada, we prefer computing the symbol's decoded name | |
1395 | on the fly rather than pre-compute it, in order to save | |
1396 | memory (Ada projects are typically very large). | |
1397 | ||
1398 | 2. There are some areas in the definition of the GNAT | |
1399 | encoding where, with a bit of bad luck, we might be able | |
1400 | to decode a non-Ada symbol, generating an incorrect | |
1401 | demangled name (Eg: names ending with "TB" for instance | |
1402 | are identified as task bodies and so stripped from | |
1403 | the decoded name returned). | |
1404 | ||
1405 | Returning 1, here, but not setting *DEMANGLED, helps us get a | |
1406 | little bit of the best of both worlds. Because we're last, | |
1407 | we should not affect any of the other languages that were | |
1408 | able to demangle the symbol before us; we get to correctly | |
1409 | tag Ada symbols as such; and even if we incorrectly tagged a | |
1410 | non-Ada symbol, which should be rare, any routing through the | |
1411 | Ada language should be transparent (Ada tries to behave much | |
1412 | like C/C++ with non-Ada symbols). */ | |
1413 | return 1; | |
1414 | } | |
1415 | ||
1416 | return 0; | |
1417 | } | |
1418 | ||
14f9c5c9 | 1419 | \f |
d2e4a39e | 1420 | |
4c4b4cd2 | 1421 | /* Arrays */ |
14f9c5c9 | 1422 | |
28c85d6c JB |
1423 | /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure |
1424 | generated by the GNAT compiler to describe the index type used | |
1425 | for each dimension of an array, check whether it follows the latest | |
1426 | known encoding. If not, fix it up to conform to the latest encoding. | |
1427 | Otherwise, do nothing. This function also does nothing if | |
1428 | INDEX_DESC_TYPE is NULL. | |
1429 | ||
85102364 | 1430 | The GNAT encoding used to describe the array index type evolved a bit. |
28c85d6c JB |
1431 | Initially, the information would be provided through the name of each |
1432 | field of the structure type only, while the type of these fields was | |
1433 | described as unspecified and irrelevant. The debugger was then expected | |
1434 | to perform a global type lookup using the name of that field in order | |
1435 | to get access to the full index type description. Because these global | |
1436 | lookups can be very expensive, the encoding was later enhanced to make | |
1437 | the global lookup unnecessary by defining the field type as being | |
1438 | the full index type description. | |
1439 | ||
1440 | The purpose of this routine is to allow us to support older versions | |
1441 | of the compiler by detecting the use of the older encoding, and by | |
1442 | fixing up the INDEX_DESC_TYPE to follow the new one (at this point, | |
1443 | we essentially replace each field's meaningless type by the associated | |
1444 | index subtype). */ | |
1445 | ||
1446 | void | |
1447 | ada_fixup_array_indexes_type (struct type *index_desc_type) | |
1448 | { | |
1449 | int i; | |
1450 | ||
1451 | if (index_desc_type == NULL) | |
1452 | return; | |
1f704f76 | 1453 | gdb_assert (index_desc_type->num_fields () > 0); |
28c85d6c JB |
1454 | |
1455 | /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient | |
1456 | to check one field only, no need to check them all). If not, return | |
1457 | now. | |
1458 | ||
1459 | If our INDEX_DESC_TYPE was generated using the older encoding, | |
1460 | the field type should be a meaningless integer type whose name | |
1461 | is not equal to the field name. */ | |
7d93a1e0 SM |
1462 | if (TYPE_FIELD_TYPE (index_desc_type, 0)->name () != NULL |
1463 | && strcmp (TYPE_FIELD_TYPE (index_desc_type, 0)->name (), | |
28c85d6c JB |
1464 | TYPE_FIELD_NAME (index_desc_type, 0)) == 0) |
1465 | return; | |
1466 | ||
1467 | /* Fixup each field of INDEX_DESC_TYPE. */ | |
1f704f76 | 1468 | for (i = 0; i < index_desc_type->num_fields (); i++) |
28c85d6c | 1469 | { |
0d5cff50 | 1470 | const char *name = TYPE_FIELD_NAME (index_desc_type, i); |
28c85d6c JB |
1471 | struct type *raw_type = ada_check_typedef (ada_find_any_type (name)); |
1472 | ||
1473 | if (raw_type) | |
1474 | TYPE_FIELD_TYPE (index_desc_type, i) = raw_type; | |
1475 | } | |
1476 | } | |
1477 | ||
4c4b4cd2 PH |
1478 | /* The desc_* routines return primitive portions of array descriptors |
1479 | (fat pointers). */ | |
14f9c5c9 AS |
1480 | |
1481 | /* The descriptor or array type, if any, indicated by TYPE; removes | |
4c4b4cd2 PH |
1482 | level of indirection, if needed. */ |
1483 | ||
d2e4a39e AS |
1484 | static struct type * |
1485 | desc_base_type (struct type *type) | |
14f9c5c9 AS |
1486 | { |
1487 | if (type == NULL) | |
1488 | return NULL; | |
61ee279c | 1489 | type = ada_check_typedef (type); |
78134374 | 1490 | if (type->code () == TYPE_CODE_TYPEDEF) |
720d1a40 JB |
1491 | type = ada_typedef_target_type (type); |
1492 | ||
1265e4aa | 1493 | if (type != NULL |
78134374 SM |
1494 | && (type->code () == TYPE_CODE_PTR |
1495 | || type->code () == TYPE_CODE_REF)) | |
61ee279c | 1496 | return ada_check_typedef (TYPE_TARGET_TYPE (type)); |
14f9c5c9 AS |
1497 | else |
1498 | return type; | |
1499 | } | |
1500 | ||
4c4b4cd2 PH |
1501 | /* True iff TYPE indicates a "thin" array pointer type. */ |
1502 | ||
14f9c5c9 | 1503 | static int |
d2e4a39e | 1504 | is_thin_pntr (struct type *type) |
14f9c5c9 | 1505 | { |
d2e4a39e | 1506 | return |
14f9c5c9 AS |
1507 | is_suffix (ada_type_name (desc_base_type (type)), "___XUT") |
1508 | || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE"); | |
1509 | } | |
1510 | ||
4c4b4cd2 PH |
1511 | /* The descriptor type for thin pointer type TYPE. */ |
1512 | ||
d2e4a39e AS |
1513 | static struct type * |
1514 | thin_descriptor_type (struct type *type) | |
14f9c5c9 | 1515 | { |
d2e4a39e | 1516 | struct type *base_type = desc_base_type (type); |
5b4ee69b | 1517 | |
14f9c5c9 AS |
1518 | if (base_type == NULL) |
1519 | return NULL; | |
1520 | if (is_suffix (ada_type_name (base_type), "___XVE")) | |
1521 | return base_type; | |
d2e4a39e | 1522 | else |
14f9c5c9 | 1523 | { |
d2e4a39e | 1524 | struct type *alt_type = ada_find_parallel_type (base_type, "___XVE"); |
5b4ee69b | 1525 | |
14f9c5c9 | 1526 | if (alt_type == NULL) |
4c4b4cd2 | 1527 | return base_type; |
14f9c5c9 | 1528 | else |
4c4b4cd2 | 1529 | return alt_type; |
14f9c5c9 AS |
1530 | } |
1531 | } | |
1532 | ||
4c4b4cd2 PH |
1533 | /* A pointer to the array data for thin-pointer value VAL. */ |
1534 | ||
d2e4a39e AS |
1535 | static struct value * |
1536 | thin_data_pntr (struct value *val) | |
14f9c5c9 | 1537 | { |
828292f2 | 1538 | struct type *type = ada_check_typedef (value_type (val)); |
556bdfd4 | 1539 | struct type *data_type = desc_data_target_type (thin_descriptor_type (type)); |
5b4ee69b | 1540 | |
556bdfd4 UW |
1541 | data_type = lookup_pointer_type (data_type); |
1542 | ||
78134374 | 1543 | if (type->code () == TYPE_CODE_PTR) |
556bdfd4 | 1544 | return value_cast (data_type, value_copy (val)); |
d2e4a39e | 1545 | else |
42ae5230 | 1546 | return value_from_longest (data_type, value_address (val)); |
14f9c5c9 AS |
1547 | } |
1548 | ||
4c4b4cd2 PH |
1549 | /* True iff TYPE indicates a "thick" array pointer type. */ |
1550 | ||
14f9c5c9 | 1551 | static int |
d2e4a39e | 1552 | is_thick_pntr (struct type *type) |
14f9c5c9 AS |
1553 | { |
1554 | type = desc_base_type (type); | |
78134374 | 1555 | return (type != NULL && type->code () == TYPE_CODE_STRUCT |
4c4b4cd2 | 1556 | && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL); |
14f9c5c9 AS |
1557 | } |
1558 | ||
4c4b4cd2 PH |
1559 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a |
1560 | pointer to one, the type of its bounds data; otherwise, NULL. */ | |
76a01679 | 1561 | |
d2e4a39e AS |
1562 | static struct type * |
1563 | desc_bounds_type (struct type *type) | |
14f9c5c9 | 1564 | { |
d2e4a39e | 1565 | struct type *r; |
14f9c5c9 AS |
1566 | |
1567 | type = desc_base_type (type); | |
1568 | ||
1569 | if (type == NULL) | |
1570 | return NULL; | |
1571 | else if (is_thin_pntr (type)) | |
1572 | { | |
1573 | type = thin_descriptor_type (type); | |
1574 | if (type == NULL) | |
4c4b4cd2 | 1575 | return NULL; |
14f9c5c9 AS |
1576 | r = lookup_struct_elt_type (type, "BOUNDS", 1); |
1577 | if (r != NULL) | |
61ee279c | 1578 | return ada_check_typedef (r); |
14f9c5c9 | 1579 | } |
78134374 | 1580 | else if (type->code () == TYPE_CODE_STRUCT) |
14f9c5c9 AS |
1581 | { |
1582 | r = lookup_struct_elt_type (type, "P_BOUNDS", 1); | |
1583 | if (r != NULL) | |
61ee279c | 1584 | return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r))); |
14f9c5c9 AS |
1585 | } |
1586 | return NULL; | |
1587 | } | |
1588 | ||
1589 | /* If ARR is an array descriptor (fat or thin pointer), or pointer to | |
4c4b4cd2 PH |
1590 | one, a pointer to its bounds data. Otherwise NULL. */ |
1591 | ||
d2e4a39e AS |
1592 | static struct value * |
1593 | desc_bounds (struct value *arr) | |
14f9c5c9 | 1594 | { |
df407dfe | 1595 | struct type *type = ada_check_typedef (value_type (arr)); |
5b4ee69b | 1596 | |
d2e4a39e | 1597 | if (is_thin_pntr (type)) |
14f9c5c9 | 1598 | { |
d2e4a39e | 1599 | struct type *bounds_type = |
4c4b4cd2 | 1600 | desc_bounds_type (thin_descriptor_type (type)); |
14f9c5c9 AS |
1601 | LONGEST addr; |
1602 | ||
4cdfadb1 | 1603 | if (bounds_type == NULL) |
323e0a4a | 1604 | error (_("Bad GNAT array descriptor")); |
14f9c5c9 AS |
1605 | |
1606 | /* NOTE: The following calculation is not really kosher, but | |
d2e4a39e | 1607 | since desc_type is an XVE-encoded type (and shouldn't be), |
4c4b4cd2 | 1608 | the correct calculation is a real pain. FIXME (and fix GCC). */ |
78134374 | 1609 | if (type->code () == TYPE_CODE_PTR) |
4c4b4cd2 | 1610 | addr = value_as_long (arr); |
d2e4a39e | 1611 | else |
42ae5230 | 1612 | addr = value_address (arr); |
14f9c5c9 | 1613 | |
d2e4a39e | 1614 | return |
4c4b4cd2 PH |
1615 | value_from_longest (lookup_pointer_type (bounds_type), |
1616 | addr - TYPE_LENGTH (bounds_type)); | |
14f9c5c9 AS |
1617 | } |
1618 | ||
1619 | else if (is_thick_pntr (type)) | |
05e522ef JB |
1620 | { |
1621 | struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL, | |
1622 | _("Bad GNAT array descriptor")); | |
1623 | struct type *p_bounds_type = value_type (p_bounds); | |
1624 | ||
1625 | if (p_bounds_type | |
78134374 | 1626 | && p_bounds_type->code () == TYPE_CODE_PTR) |
05e522ef JB |
1627 | { |
1628 | struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type); | |
1629 | ||
1630 | if (TYPE_STUB (target_type)) | |
1631 | p_bounds = value_cast (lookup_pointer_type | |
1632 | (ada_check_typedef (target_type)), | |
1633 | p_bounds); | |
1634 | } | |
1635 | else | |
1636 | error (_("Bad GNAT array descriptor")); | |
1637 | ||
1638 | return p_bounds; | |
1639 | } | |
14f9c5c9 AS |
1640 | else |
1641 | return NULL; | |
1642 | } | |
1643 | ||
4c4b4cd2 PH |
1644 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit |
1645 | position of the field containing the address of the bounds data. */ | |
1646 | ||
14f9c5c9 | 1647 | static int |
d2e4a39e | 1648 | fat_pntr_bounds_bitpos (struct type *type) |
14f9c5c9 AS |
1649 | { |
1650 | return TYPE_FIELD_BITPOS (desc_base_type (type), 1); | |
1651 | } | |
1652 | ||
1653 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1654 | size of the field containing the address of the bounds data. */ |
1655 | ||
14f9c5c9 | 1656 | static int |
d2e4a39e | 1657 | fat_pntr_bounds_bitsize (struct type *type) |
14f9c5c9 AS |
1658 | { |
1659 | type = desc_base_type (type); | |
1660 | ||
d2e4a39e | 1661 | if (TYPE_FIELD_BITSIZE (type, 1) > 0) |
14f9c5c9 AS |
1662 | return TYPE_FIELD_BITSIZE (type, 1); |
1663 | else | |
61ee279c | 1664 | return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1))); |
14f9c5c9 AS |
1665 | } |
1666 | ||
4c4b4cd2 | 1667 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a |
556bdfd4 UW |
1668 | pointer to one, the type of its array data (a array-with-no-bounds type); |
1669 | otherwise, NULL. Use ada_type_of_array to get an array type with bounds | |
1670 | data. */ | |
4c4b4cd2 | 1671 | |
d2e4a39e | 1672 | static struct type * |
556bdfd4 | 1673 | desc_data_target_type (struct type *type) |
14f9c5c9 AS |
1674 | { |
1675 | type = desc_base_type (type); | |
1676 | ||
4c4b4cd2 | 1677 | /* NOTE: The following is bogus; see comment in desc_bounds. */ |
14f9c5c9 | 1678 | if (is_thin_pntr (type)) |
556bdfd4 | 1679 | return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)); |
14f9c5c9 | 1680 | else if (is_thick_pntr (type)) |
556bdfd4 UW |
1681 | { |
1682 | struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1); | |
1683 | ||
1684 | if (data_type | |
78134374 | 1685 | && ada_check_typedef (data_type)->code () == TYPE_CODE_PTR) |
05e522ef | 1686 | return ada_check_typedef (TYPE_TARGET_TYPE (data_type)); |
556bdfd4 UW |
1687 | } |
1688 | ||
1689 | return NULL; | |
14f9c5c9 AS |
1690 | } |
1691 | ||
1692 | /* If ARR is an array descriptor (fat or thin pointer), a pointer to | |
1693 | its array data. */ | |
4c4b4cd2 | 1694 | |
d2e4a39e AS |
1695 | static struct value * |
1696 | desc_data (struct value *arr) | |
14f9c5c9 | 1697 | { |
df407dfe | 1698 | struct type *type = value_type (arr); |
5b4ee69b | 1699 | |
14f9c5c9 AS |
1700 | if (is_thin_pntr (type)) |
1701 | return thin_data_pntr (arr); | |
1702 | else if (is_thick_pntr (type)) | |
d2e4a39e | 1703 | return value_struct_elt (&arr, NULL, "P_ARRAY", NULL, |
323e0a4a | 1704 | _("Bad GNAT array descriptor")); |
14f9c5c9 AS |
1705 | else |
1706 | return NULL; | |
1707 | } | |
1708 | ||
1709 | ||
1710 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1711 | position of the field containing the address of the data. */ |
1712 | ||
14f9c5c9 | 1713 | static int |
d2e4a39e | 1714 | fat_pntr_data_bitpos (struct type *type) |
14f9c5c9 AS |
1715 | { |
1716 | return TYPE_FIELD_BITPOS (desc_base_type (type), 0); | |
1717 | } | |
1718 | ||
1719 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1720 | size of the field containing the address of the data. */ |
1721 | ||
14f9c5c9 | 1722 | static int |
d2e4a39e | 1723 | fat_pntr_data_bitsize (struct type *type) |
14f9c5c9 AS |
1724 | { |
1725 | type = desc_base_type (type); | |
1726 | ||
1727 | if (TYPE_FIELD_BITSIZE (type, 0) > 0) | |
1728 | return TYPE_FIELD_BITSIZE (type, 0); | |
d2e4a39e | 1729 | else |
14f9c5c9 AS |
1730 | return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)); |
1731 | } | |
1732 | ||
4c4b4cd2 | 1733 | /* If BOUNDS is an array-bounds structure (or pointer to one), return |
14f9c5c9 | 1734 | the Ith lower bound stored in it, if WHICH is 0, and the Ith upper |
4c4b4cd2 PH |
1735 | bound, if WHICH is 1. The first bound is I=1. */ |
1736 | ||
d2e4a39e AS |
1737 | static struct value * |
1738 | desc_one_bound (struct value *bounds, int i, int which) | |
14f9c5c9 | 1739 | { |
250106a7 TT |
1740 | char bound_name[20]; |
1741 | xsnprintf (bound_name, sizeof (bound_name), "%cB%d", | |
1742 | which ? 'U' : 'L', i - 1); | |
1743 | return value_struct_elt (&bounds, NULL, bound_name, NULL, | |
323e0a4a | 1744 | _("Bad GNAT array descriptor bounds")); |
14f9c5c9 AS |
1745 | } |
1746 | ||
1747 | /* If BOUNDS is an array-bounds structure type, return the bit position | |
1748 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
4c4b4cd2 PH |
1749 | bound, if WHICH is 1. The first bound is I=1. */ |
1750 | ||
14f9c5c9 | 1751 | static int |
d2e4a39e | 1752 | desc_bound_bitpos (struct type *type, int i, int which) |
14f9c5c9 | 1753 | { |
d2e4a39e | 1754 | return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2); |
14f9c5c9 AS |
1755 | } |
1756 | ||
1757 | /* If BOUNDS is an array-bounds structure type, return the bit field size | |
1758 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
4c4b4cd2 PH |
1759 | bound, if WHICH is 1. The first bound is I=1. */ |
1760 | ||
76a01679 | 1761 | static int |
d2e4a39e | 1762 | desc_bound_bitsize (struct type *type, int i, int which) |
14f9c5c9 AS |
1763 | { |
1764 | type = desc_base_type (type); | |
1765 | ||
d2e4a39e AS |
1766 | if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0) |
1767 | return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2); | |
1768 | else | |
1769 | return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2)); | |
14f9c5c9 AS |
1770 | } |
1771 | ||
1772 | /* If TYPE is the type of an array-bounds structure, the type of its | |
4c4b4cd2 PH |
1773 | Ith bound (numbering from 1). Otherwise, NULL. */ |
1774 | ||
d2e4a39e AS |
1775 | static struct type * |
1776 | desc_index_type (struct type *type, int i) | |
14f9c5c9 AS |
1777 | { |
1778 | type = desc_base_type (type); | |
1779 | ||
78134374 | 1780 | if (type->code () == TYPE_CODE_STRUCT) |
250106a7 TT |
1781 | { |
1782 | char bound_name[20]; | |
1783 | xsnprintf (bound_name, sizeof (bound_name), "LB%d", i - 1); | |
1784 | return lookup_struct_elt_type (type, bound_name, 1); | |
1785 | } | |
d2e4a39e | 1786 | else |
14f9c5c9 AS |
1787 | return NULL; |
1788 | } | |
1789 | ||
4c4b4cd2 PH |
1790 | /* The number of index positions in the array-bounds type TYPE. |
1791 | Return 0 if TYPE is NULL. */ | |
1792 | ||
14f9c5c9 | 1793 | static int |
d2e4a39e | 1794 | desc_arity (struct type *type) |
14f9c5c9 AS |
1795 | { |
1796 | type = desc_base_type (type); | |
1797 | ||
1798 | if (type != NULL) | |
1f704f76 | 1799 | return type->num_fields () / 2; |
14f9c5c9 AS |
1800 | return 0; |
1801 | } | |
1802 | ||
4c4b4cd2 PH |
1803 | /* Non-zero iff TYPE is a simple array type (not a pointer to one) or |
1804 | an array descriptor type (representing an unconstrained array | |
1805 | type). */ | |
1806 | ||
76a01679 JB |
1807 | static int |
1808 | ada_is_direct_array_type (struct type *type) | |
4c4b4cd2 PH |
1809 | { |
1810 | if (type == NULL) | |
1811 | return 0; | |
61ee279c | 1812 | type = ada_check_typedef (type); |
78134374 | 1813 | return (type->code () == TYPE_CODE_ARRAY |
76a01679 | 1814 | || ada_is_array_descriptor_type (type)); |
4c4b4cd2 PH |
1815 | } |
1816 | ||
52ce6436 | 1817 | /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer |
0963b4bd | 1818 | * to one. */ |
52ce6436 | 1819 | |
2c0b251b | 1820 | static int |
52ce6436 PH |
1821 | ada_is_array_type (struct type *type) |
1822 | { | |
78134374 SM |
1823 | while (type != NULL |
1824 | && (type->code () == TYPE_CODE_PTR | |
1825 | || type->code () == TYPE_CODE_REF)) | |
52ce6436 PH |
1826 | type = TYPE_TARGET_TYPE (type); |
1827 | return ada_is_direct_array_type (type); | |
1828 | } | |
1829 | ||
4c4b4cd2 | 1830 | /* Non-zero iff TYPE is a simple array type or pointer to one. */ |
14f9c5c9 | 1831 | |
14f9c5c9 | 1832 | int |
4c4b4cd2 | 1833 | ada_is_simple_array_type (struct type *type) |
14f9c5c9 AS |
1834 | { |
1835 | if (type == NULL) | |
1836 | return 0; | |
61ee279c | 1837 | type = ada_check_typedef (type); |
78134374 SM |
1838 | return (type->code () == TYPE_CODE_ARRAY |
1839 | || (type->code () == TYPE_CODE_PTR | |
1840 | && (ada_check_typedef (TYPE_TARGET_TYPE (type))->code () | |
1841 | == TYPE_CODE_ARRAY))); | |
14f9c5c9 AS |
1842 | } |
1843 | ||
4c4b4cd2 PH |
1844 | /* Non-zero iff TYPE belongs to a GNAT array descriptor. */ |
1845 | ||
14f9c5c9 | 1846 | int |
4c4b4cd2 | 1847 | ada_is_array_descriptor_type (struct type *type) |
14f9c5c9 | 1848 | { |
556bdfd4 | 1849 | struct type *data_type = desc_data_target_type (type); |
14f9c5c9 AS |
1850 | |
1851 | if (type == NULL) | |
1852 | return 0; | |
61ee279c | 1853 | type = ada_check_typedef (type); |
556bdfd4 | 1854 | return (data_type != NULL |
78134374 | 1855 | && data_type->code () == TYPE_CODE_ARRAY |
556bdfd4 | 1856 | && desc_arity (desc_bounds_type (type)) > 0); |
14f9c5c9 AS |
1857 | } |
1858 | ||
1859 | /* Non-zero iff type is a partially mal-formed GNAT array | |
4c4b4cd2 | 1860 | descriptor. FIXME: This is to compensate for some problems with |
14f9c5c9 | 1861 | debugging output from GNAT. Re-examine periodically to see if it |
4c4b4cd2 PH |
1862 | is still needed. */ |
1863 | ||
14f9c5c9 | 1864 | int |
ebf56fd3 | 1865 | ada_is_bogus_array_descriptor (struct type *type) |
14f9c5c9 | 1866 | { |
d2e4a39e | 1867 | return |
14f9c5c9 | 1868 | type != NULL |
78134374 | 1869 | && type->code () == TYPE_CODE_STRUCT |
14f9c5c9 | 1870 | && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL |
4c4b4cd2 PH |
1871 | || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL) |
1872 | && !ada_is_array_descriptor_type (type); | |
14f9c5c9 AS |
1873 | } |
1874 | ||
1875 | ||
4c4b4cd2 | 1876 | /* If ARR has a record type in the form of a standard GNAT array descriptor, |
14f9c5c9 | 1877 | (fat pointer) returns the type of the array data described---specifically, |
4c4b4cd2 | 1878 | a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled |
14f9c5c9 | 1879 | in from the descriptor; otherwise, they are left unspecified. If |
4c4b4cd2 PH |
1880 | the ARR denotes a null array descriptor and BOUNDS is non-zero, |
1881 | returns NULL. The result is simply the type of ARR if ARR is not | |
14f9c5c9 | 1882 | a descriptor. */ |
de93309a SM |
1883 | |
1884 | static struct type * | |
d2e4a39e | 1885 | ada_type_of_array (struct value *arr, int bounds) |
14f9c5c9 | 1886 | { |
ad82864c JB |
1887 | if (ada_is_constrained_packed_array_type (value_type (arr))) |
1888 | return decode_constrained_packed_array_type (value_type (arr)); | |
14f9c5c9 | 1889 | |
df407dfe AC |
1890 | if (!ada_is_array_descriptor_type (value_type (arr))) |
1891 | return value_type (arr); | |
d2e4a39e AS |
1892 | |
1893 | if (!bounds) | |
ad82864c JB |
1894 | { |
1895 | struct type *array_type = | |
1896 | ada_check_typedef (desc_data_target_type (value_type (arr))); | |
1897 | ||
1898 | if (ada_is_unconstrained_packed_array_type (value_type (arr))) | |
1899 | TYPE_FIELD_BITSIZE (array_type, 0) = | |
1900 | decode_packed_array_bitsize (value_type (arr)); | |
1901 | ||
1902 | return array_type; | |
1903 | } | |
14f9c5c9 AS |
1904 | else |
1905 | { | |
d2e4a39e | 1906 | struct type *elt_type; |
14f9c5c9 | 1907 | int arity; |
d2e4a39e | 1908 | struct value *descriptor; |
14f9c5c9 | 1909 | |
df407dfe AC |
1910 | elt_type = ada_array_element_type (value_type (arr), -1); |
1911 | arity = ada_array_arity (value_type (arr)); | |
14f9c5c9 | 1912 | |
d2e4a39e | 1913 | if (elt_type == NULL || arity == 0) |
df407dfe | 1914 | return ada_check_typedef (value_type (arr)); |
14f9c5c9 AS |
1915 | |
1916 | descriptor = desc_bounds (arr); | |
d2e4a39e | 1917 | if (value_as_long (descriptor) == 0) |
4c4b4cd2 | 1918 | return NULL; |
d2e4a39e | 1919 | while (arity > 0) |
4c4b4cd2 | 1920 | { |
e9bb382b UW |
1921 | struct type *range_type = alloc_type_copy (value_type (arr)); |
1922 | struct type *array_type = alloc_type_copy (value_type (arr)); | |
4c4b4cd2 PH |
1923 | struct value *low = desc_one_bound (descriptor, arity, 0); |
1924 | struct value *high = desc_one_bound (descriptor, arity, 1); | |
4c4b4cd2 | 1925 | |
5b4ee69b | 1926 | arity -= 1; |
0c9c3474 SA |
1927 | create_static_range_type (range_type, value_type (low), |
1928 | longest_to_int (value_as_long (low)), | |
1929 | longest_to_int (value_as_long (high))); | |
4c4b4cd2 | 1930 | elt_type = create_array_type (array_type, elt_type, range_type); |
ad82864c JB |
1931 | |
1932 | if (ada_is_unconstrained_packed_array_type (value_type (arr))) | |
e67ad678 JB |
1933 | { |
1934 | /* We need to store the element packed bitsize, as well as | |
1935 | recompute the array size, because it was previously | |
1936 | computed based on the unpacked element size. */ | |
1937 | LONGEST lo = value_as_long (low); | |
1938 | LONGEST hi = value_as_long (high); | |
1939 | ||
1940 | TYPE_FIELD_BITSIZE (elt_type, 0) = | |
1941 | decode_packed_array_bitsize (value_type (arr)); | |
1942 | /* If the array has no element, then the size is already | |
1943 | zero, and does not need to be recomputed. */ | |
1944 | if (lo < hi) | |
1945 | { | |
1946 | int array_bitsize = | |
1947 | (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0); | |
1948 | ||
1949 | TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8; | |
1950 | } | |
1951 | } | |
4c4b4cd2 | 1952 | } |
14f9c5c9 AS |
1953 | |
1954 | return lookup_pointer_type (elt_type); | |
1955 | } | |
1956 | } | |
1957 | ||
1958 | /* If ARR does not represent an array, returns ARR unchanged. | |
4c4b4cd2 PH |
1959 | Otherwise, returns either a standard GDB array with bounds set |
1960 | appropriately or, if ARR is a non-null fat pointer, a pointer to a standard | |
1961 | GDB array. Returns NULL if ARR is a null fat pointer. */ | |
1962 | ||
d2e4a39e AS |
1963 | struct value * |
1964 | ada_coerce_to_simple_array_ptr (struct value *arr) | |
14f9c5c9 | 1965 | { |
df407dfe | 1966 | if (ada_is_array_descriptor_type (value_type (arr))) |
14f9c5c9 | 1967 | { |
d2e4a39e | 1968 | struct type *arrType = ada_type_of_array (arr, 1); |
5b4ee69b | 1969 | |
14f9c5c9 | 1970 | if (arrType == NULL) |
4c4b4cd2 | 1971 | return NULL; |
14f9c5c9 AS |
1972 | return value_cast (arrType, value_copy (desc_data (arr))); |
1973 | } | |
ad82864c JB |
1974 | else if (ada_is_constrained_packed_array_type (value_type (arr))) |
1975 | return decode_constrained_packed_array (arr); | |
14f9c5c9 AS |
1976 | else |
1977 | return arr; | |
1978 | } | |
1979 | ||
1980 | /* If ARR does not represent an array, returns ARR unchanged. | |
1981 | Otherwise, returns a standard GDB array describing ARR (which may | |
4c4b4cd2 PH |
1982 | be ARR itself if it already is in the proper form). */ |
1983 | ||
720d1a40 | 1984 | struct value * |
d2e4a39e | 1985 | ada_coerce_to_simple_array (struct value *arr) |
14f9c5c9 | 1986 | { |
df407dfe | 1987 | if (ada_is_array_descriptor_type (value_type (arr))) |
14f9c5c9 | 1988 | { |
d2e4a39e | 1989 | struct value *arrVal = ada_coerce_to_simple_array_ptr (arr); |
5b4ee69b | 1990 | |
14f9c5c9 | 1991 | if (arrVal == NULL) |
323e0a4a | 1992 | error (_("Bounds unavailable for null array pointer.")); |
c1b5a1a6 | 1993 | ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal))); |
14f9c5c9 AS |
1994 | return value_ind (arrVal); |
1995 | } | |
ad82864c JB |
1996 | else if (ada_is_constrained_packed_array_type (value_type (arr))) |
1997 | return decode_constrained_packed_array (arr); | |
d2e4a39e | 1998 | else |
14f9c5c9 AS |
1999 | return arr; |
2000 | } | |
2001 | ||
2002 | /* If TYPE represents a GNAT array type, return it translated to an | |
2003 | ordinary GDB array type (possibly with BITSIZE fields indicating | |
4c4b4cd2 PH |
2004 | packing). For other types, is the identity. */ |
2005 | ||
d2e4a39e AS |
2006 | struct type * |
2007 | ada_coerce_to_simple_array_type (struct type *type) | |
14f9c5c9 | 2008 | { |
ad82864c JB |
2009 | if (ada_is_constrained_packed_array_type (type)) |
2010 | return decode_constrained_packed_array_type (type); | |
17280b9f UW |
2011 | |
2012 | if (ada_is_array_descriptor_type (type)) | |
556bdfd4 | 2013 | return ada_check_typedef (desc_data_target_type (type)); |
17280b9f UW |
2014 | |
2015 | return type; | |
14f9c5c9 AS |
2016 | } |
2017 | ||
4c4b4cd2 PH |
2018 | /* Non-zero iff TYPE represents a standard GNAT packed-array type. */ |
2019 | ||
ad82864c JB |
2020 | static int |
2021 | ada_is_packed_array_type (struct type *type) | |
14f9c5c9 AS |
2022 | { |
2023 | if (type == NULL) | |
2024 | return 0; | |
4c4b4cd2 | 2025 | type = desc_base_type (type); |
61ee279c | 2026 | type = ada_check_typedef (type); |
d2e4a39e | 2027 | return |
14f9c5c9 AS |
2028 | ada_type_name (type) != NULL |
2029 | && strstr (ada_type_name (type), "___XP") != NULL; | |
2030 | } | |
2031 | ||
ad82864c JB |
2032 | /* Non-zero iff TYPE represents a standard GNAT constrained |
2033 | packed-array type. */ | |
2034 | ||
2035 | int | |
2036 | ada_is_constrained_packed_array_type (struct type *type) | |
2037 | { | |
2038 | return ada_is_packed_array_type (type) | |
2039 | && !ada_is_array_descriptor_type (type); | |
2040 | } | |
2041 | ||
2042 | /* Non-zero iff TYPE represents an array descriptor for a | |
2043 | unconstrained packed-array type. */ | |
2044 | ||
2045 | static int | |
2046 | ada_is_unconstrained_packed_array_type (struct type *type) | |
2047 | { | |
2048 | return ada_is_packed_array_type (type) | |
2049 | && ada_is_array_descriptor_type (type); | |
2050 | } | |
2051 | ||
2052 | /* Given that TYPE encodes a packed array type (constrained or unconstrained), | |
2053 | return the size of its elements in bits. */ | |
2054 | ||
2055 | static long | |
2056 | decode_packed_array_bitsize (struct type *type) | |
2057 | { | |
0d5cff50 DE |
2058 | const char *raw_name; |
2059 | const char *tail; | |
ad82864c JB |
2060 | long bits; |
2061 | ||
720d1a40 JB |
2062 | /* Access to arrays implemented as fat pointers are encoded as a typedef |
2063 | of the fat pointer type. We need the name of the fat pointer type | |
2064 | to do the decoding, so strip the typedef layer. */ | |
78134374 | 2065 | if (type->code () == TYPE_CODE_TYPEDEF) |
720d1a40 JB |
2066 | type = ada_typedef_target_type (type); |
2067 | ||
2068 | raw_name = ada_type_name (ada_check_typedef (type)); | |
ad82864c JB |
2069 | if (!raw_name) |
2070 | raw_name = ada_type_name (desc_base_type (type)); | |
2071 | ||
2072 | if (!raw_name) | |
2073 | return 0; | |
2074 | ||
2075 | tail = strstr (raw_name, "___XP"); | |
720d1a40 | 2076 | gdb_assert (tail != NULL); |
ad82864c JB |
2077 | |
2078 | if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1) | |
2079 | { | |
2080 | lim_warning | |
2081 | (_("could not understand bit size information on packed array")); | |
2082 | return 0; | |
2083 | } | |
2084 | ||
2085 | return bits; | |
2086 | } | |
2087 | ||
14f9c5c9 AS |
2088 | /* Given that TYPE is a standard GDB array type with all bounds filled |
2089 | in, and that the element size of its ultimate scalar constituents | |
2090 | (that is, either its elements, or, if it is an array of arrays, its | |
2091 | elements' elements, etc.) is *ELT_BITS, return an identical type, | |
2092 | but with the bit sizes of its elements (and those of any | |
2093 | constituent arrays) recorded in the BITSIZE components of its | |
4c4b4cd2 | 2094 | TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size |
4a46959e JB |
2095 | in bits. |
2096 | ||
2097 | Note that, for arrays whose index type has an XA encoding where | |
2098 | a bound references a record discriminant, getting that discriminant, | |
2099 | and therefore the actual value of that bound, is not possible | |
2100 | because none of the given parameters gives us access to the record. | |
2101 | This function assumes that it is OK in the context where it is being | |
2102 | used to return an array whose bounds are still dynamic and where | |
2103 | the length is arbitrary. */ | |
4c4b4cd2 | 2104 | |
d2e4a39e | 2105 | static struct type * |
ad82864c | 2106 | constrained_packed_array_type (struct type *type, long *elt_bits) |
14f9c5c9 | 2107 | { |
d2e4a39e AS |
2108 | struct type *new_elt_type; |
2109 | struct type *new_type; | |
99b1c762 JB |
2110 | struct type *index_type_desc; |
2111 | struct type *index_type; | |
14f9c5c9 AS |
2112 | LONGEST low_bound, high_bound; |
2113 | ||
61ee279c | 2114 | type = ada_check_typedef (type); |
78134374 | 2115 | if (type->code () != TYPE_CODE_ARRAY) |
14f9c5c9 AS |
2116 | return type; |
2117 | ||
99b1c762 JB |
2118 | index_type_desc = ada_find_parallel_type (type, "___XA"); |
2119 | if (index_type_desc) | |
2120 | index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0), | |
2121 | NULL); | |
2122 | else | |
2123 | index_type = TYPE_INDEX_TYPE (type); | |
2124 | ||
e9bb382b | 2125 | new_type = alloc_type_copy (type); |
ad82864c JB |
2126 | new_elt_type = |
2127 | constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)), | |
2128 | elt_bits); | |
99b1c762 | 2129 | create_array_type (new_type, new_elt_type, index_type); |
14f9c5c9 | 2130 | TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits; |
d0e39ea2 | 2131 | new_type->set_name (ada_type_name (type)); |
14f9c5c9 | 2132 | |
78134374 | 2133 | if ((check_typedef (index_type)->code () == TYPE_CODE_RANGE |
4a46959e JB |
2134 | && is_dynamic_type (check_typedef (index_type))) |
2135 | || get_discrete_bounds (index_type, &low_bound, &high_bound) < 0) | |
14f9c5c9 AS |
2136 | low_bound = high_bound = 0; |
2137 | if (high_bound < low_bound) | |
2138 | *elt_bits = TYPE_LENGTH (new_type) = 0; | |
d2e4a39e | 2139 | else |
14f9c5c9 AS |
2140 | { |
2141 | *elt_bits *= (high_bound - low_bound + 1); | |
d2e4a39e | 2142 | TYPE_LENGTH (new_type) = |
4c4b4cd2 | 2143 | (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; |
14f9c5c9 AS |
2144 | } |
2145 | ||
876cecd0 | 2146 | TYPE_FIXED_INSTANCE (new_type) = 1; |
14f9c5c9 AS |
2147 | return new_type; |
2148 | } | |
2149 | ||
ad82864c JB |
2150 | /* The array type encoded by TYPE, where |
2151 | ada_is_constrained_packed_array_type (TYPE). */ | |
4c4b4cd2 | 2152 | |
d2e4a39e | 2153 | static struct type * |
ad82864c | 2154 | decode_constrained_packed_array_type (struct type *type) |
d2e4a39e | 2155 | { |
0d5cff50 | 2156 | const char *raw_name = ada_type_name (ada_check_typedef (type)); |
727e3d2e | 2157 | char *name; |
0d5cff50 | 2158 | const char *tail; |
d2e4a39e | 2159 | struct type *shadow_type; |
14f9c5c9 | 2160 | long bits; |
14f9c5c9 | 2161 | |
727e3d2e JB |
2162 | if (!raw_name) |
2163 | raw_name = ada_type_name (desc_base_type (type)); | |
2164 | ||
2165 | if (!raw_name) | |
2166 | return NULL; | |
2167 | ||
2168 | name = (char *) alloca (strlen (raw_name) + 1); | |
2169 | tail = strstr (raw_name, "___XP"); | |
4c4b4cd2 PH |
2170 | type = desc_base_type (type); |
2171 | ||
14f9c5c9 AS |
2172 | memcpy (name, raw_name, tail - raw_name); |
2173 | name[tail - raw_name] = '\000'; | |
2174 | ||
b4ba55a1 JB |
2175 | shadow_type = ada_find_parallel_type_with_name (type, name); |
2176 | ||
2177 | if (shadow_type == NULL) | |
14f9c5c9 | 2178 | { |
323e0a4a | 2179 | lim_warning (_("could not find bounds information on packed array")); |
14f9c5c9 AS |
2180 | return NULL; |
2181 | } | |
f168693b | 2182 | shadow_type = check_typedef (shadow_type); |
14f9c5c9 | 2183 | |
78134374 | 2184 | if (shadow_type->code () != TYPE_CODE_ARRAY) |
14f9c5c9 | 2185 | { |
0963b4bd MS |
2186 | lim_warning (_("could not understand bounds " |
2187 | "information on packed array")); | |
14f9c5c9 AS |
2188 | return NULL; |
2189 | } | |
d2e4a39e | 2190 | |
ad82864c JB |
2191 | bits = decode_packed_array_bitsize (type); |
2192 | return constrained_packed_array_type (shadow_type, &bits); | |
14f9c5c9 AS |
2193 | } |
2194 | ||
ad82864c JB |
2195 | /* Given that ARR is a struct value *indicating a GNAT constrained packed |
2196 | array, returns a simple array that denotes that array. Its type is a | |
14f9c5c9 AS |
2197 | standard GDB array type except that the BITSIZEs of the array |
2198 | target types are set to the number of bits in each element, and the | |
4c4b4cd2 | 2199 | type length is set appropriately. */ |
14f9c5c9 | 2200 | |
d2e4a39e | 2201 | static struct value * |
ad82864c | 2202 | decode_constrained_packed_array (struct value *arr) |
14f9c5c9 | 2203 | { |
4c4b4cd2 | 2204 | struct type *type; |
14f9c5c9 | 2205 | |
11aa919a PMR |
2206 | /* If our value is a pointer, then dereference it. Likewise if |
2207 | the value is a reference. Make sure that this operation does not | |
2208 | cause the target type to be fixed, as this would indirectly cause | |
2209 | this array to be decoded. The rest of the routine assumes that | |
2210 | the array hasn't been decoded yet, so we use the basic "coerce_ref" | |
2211 | and "value_ind" routines to perform the dereferencing, as opposed | |
2212 | to using "ada_coerce_ref" or "ada_value_ind". */ | |
2213 | arr = coerce_ref (arr); | |
78134374 | 2214 | if (ada_check_typedef (value_type (arr))->code () == TYPE_CODE_PTR) |
284614f0 | 2215 | arr = value_ind (arr); |
4c4b4cd2 | 2216 | |
ad82864c | 2217 | type = decode_constrained_packed_array_type (value_type (arr)); |
14f9c5c9 AS |
2218 | if (type == NULL) |
2219 | { | |
323e0a4a | 2220 | error (_("can't unpack array")); |
14f9c5c9 AS |
2221 | return NULL; |
2222 | } | |
61ee279c | 2223 | |
d5a22e77 | 2224 | if (type_byte_order (value_type (arr)) == BFD_ENDIAN_BIG |
32c9a795 | 2225 | && ada_is_modular_type (value_type (arr))) |
61ee279c PH |
2226 | { |
2227 | /* This is a (right-justified) modular type representing a packed | |
2228 | array with no wrapper. In order to interpret the value through | |
2229 | the (left-justified) packed array type we just built, we must | |
2230 | first left-justify it. */ | |
2231 | int bit_size, bit_pos; | |
2232 | ULONGEST mod; | |
2233 | ||
df407dfe | 2234 | mod = ada_modulus (value_type (arr)) - 1; |
61ee279c PH |
2235 | bit_size = 0; |
2236 | while (mod > 0) | |
2237 | { | |
2238 | bit_size += 1; | |
2239 | mod >>= 1; | |
2240 | } | |
df407dfe | 2241 | bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size; |
61ee279c PH |
2242 | arr = ada_value_primitive_packed_val (arr, NULL, |
2243 | bit_pos / HOST_CHAR_BIT, | |
2244 | bit_pos % HOST_CHAR_BIT, | |
2245 | bit_size, | |
2246 | type); | |
2247 | } | |
2248 | ||
4c4b4cd2 | 2249 | return coerce_unspec_val_to_type (arr, type); |
14f9c5c9 AS |
2250 | } |
2251 | ||
2252 | ||
2253 | /* The value of the element of packed array ARR at the ARITY indices | |
4c4b4cd2 | 2254 | given in IND. ARR must be a simple array. */ |
14f9c5c9 | 2255 | |
d2e4a39e AS |
2256 | static struct value * |
2257 | value_subscript_packed (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
2258 | { |
2259 | int i; | |
2260 | int bits, elt_off, bit_off; | |
2261 | long elt_total_bit_offset; | |
d2e4a39e AS |
2262 | struct type *elt_type; |
2263 | struct value *v; | |
14f9c5c9 AS |
2264 | |
2265 | bits = 0; | |
2266 | elt_total_bit_offset = 0; | |
df407dfe | 2267 | elt_type = ada_check_typedef (value_type (arr)); |
d2e4a39e | 2268 | for (i = 0; i < arity; i += 1) |
14f9c5c9 | 2269 | { |
78134374 | 2270 | if (elt_type->code () != TYPE_CODE_ARRAY |
4c4b4cd2 PH |
2271 | || TYPE_FIELD_BITSIZE (elt_type, 0) == 0) |
2272 | error | |
0963b4bd MS |
2273 | (_("attempt to do packed indexing of " |
2274 | "something other than a packed array")); | |
14f9c5c9 | 2275 | else |
4c4b4cd2 PH |
2276 | { |
2277 | struct type *range_type = TYPE_INDEX_TYPE (elt_type); | |
2278 | LONGEST lowerbound, upperbound; | |
2279 | LONGEST idx; | |
2280 | ||
2281 | if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0) | |
2282 | { | |
323e0a4a | 2283 | lim_warning (_("don't know bounds of array")); |
4c4b4cd2 PH |
2284 | lowerbound = upperbound = 0; |
2285 | } | |
2286 | ||
3cb382c9 | 2287 | idx = pos_atr (ind[i]); |
4c4b4cd2 | 2288 | if (idx < lowerbound || idx > upperbound) |
0963b4bd MS |
2289 | lim_warning (_("packed array index %ld out of bounds"), |
2290 | (long) idx); | |
4c4b4cd2 PH |
2291 | bits = TYPE_FIELD_BITSIZE (elt_type, 0); |
2292 | elt_total_bit_offset += (idx - lowerbound) * bits; | |
61ee279c | 2293 | elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type)); |
4c4b4cd2 | 2294 | } |
14f9c5c9 AS |
2295 | } |
2296 | elt_off = elt_total_bit_offset / HOST_CHAR_BIT; | |
2297 | bit_off = elt_total_bit_offset % HOST_CHAR_BIT; | |
d2e4a39e AS |
2298 | |
2299 | v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off, | |
4c4b4cd2 | 2300 | bits, elt_type); |
14f9c5c9 AS |
2301 | return v; |
2302 | } | |
2303 | ||
4c4b4cd2 | 2304 | /* Non-zero iff TYPE includes negative integer values. */ |
14f9c5c9 AS |
2305 | |
2306 | static int | |
d2e4a39e | 2307 | has_negatives (struct type *type) |
14f9c5c9 | 2308 | { |
78134374 | 2309 | switch (type->code ()) |
d2e4a39e AS |
2310 | { |
2311 | default: | |
2312 | return 0; | |
2313 | case TYPE_CODE_INT: | |
2314 | return !TYPE_UNSIGNED (type); | |
2315 | case TYPE_CODE_RANGE: | |
4e962e74 | 2316 | return TYPE_LOW_BOUND (type) - TYPE_RANGE_DATA (type)->bias < 0; |
d2e4a39e | 2317 | } |
14f9c5c9 | 2318 | } |
d2e4a39e | 2319 | |
f93fca70 | 2320 | /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET, |
5b639dea | 2321 | unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of |
f93fca70 | 2322 | the unpacked buffer. |
14f9c5c9 | 2323 | |
5b639dea JB |
2324 | The size of the unpacked buffer (UNPACKED_LEN) is expected to be large |
2325 | enough to contain at least BIT_OFFSET bits. If not, an error is raised. | |
2326 | ||
f93fca70 JB |
2327 | IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode, |
2328 | zero otherwise. | |
14f9c5c9 | 2329 | |
f93fca70 | 2330 | IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type. |
a1c95e6b | 2331 | |
f93fca70 JB |
2332 | IS_SCALAR is nonzero if the data corresponds to a signed type. */ |
2333 | ||
2334 | static void | |
2335 | ada_unpack_from_contents (const gdb_byte *src, int bit_offset, int bit_size, | |
2336 | gdb_byte *unpacked, int unpacked_len, | |
2337 | int is_big_endian, int is_signed_type, | |
2338 | int is_scalar) | |
2339 | { | |
a1c95e6b JB |
2340 | int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8; |
2341 | int src_idx; /* Index into the source area */ | |
2342 | int src_bytes_left; /* Number of source bytes left to process. */ | |
2343 | int srcBitsLeft; /* Number of source bits left to move */ | |
2344 | int unusedLS; /* Number of bits in next significant | |
2345 | byte of source that are unused */ | |
2346 | ||
a1c95e6b JB |
2347 | int unpacked_idx; /* Index into the unpacked buffer */ |
2348 | int unpacked_bytes_left; /* Number of bytes left to set in unpacked. */ | |
2349 | ||
4c4b4cd2 | 2350 | unsigned long accum; /* Staging area for bits being transferred */ |
a1c95e6b | 2351 | int accumSize; /* Number of meaningful bits in accum */ |
14f9c5c9 | 2352 | unsigned char sign; |
a1c95e6b | 2353 | |
4c4b4cd2 PH |
2354 | /* Transmit bytes from least to most significant; delta is the direction |
2355 | the indices move. */ | |
f93fca70 | 2356 | int delta = is_big_endian ? -1 : 1; |
14f9c5c9 | 2357 | |
5b639dea JB |
2358 | /* Make sure that unpacked is large enough to receive the BIT_SIZE |
2359 | bits from SRC. .*/ | |
2360 | if ((bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT > unpacked_len) | |
2361 | error (_("Cannot unpack %d bits into buffer of %d bytes"), | |
2362 | bit_size, unpacked_len); | |
2363 | ||
14f9c5c9 | 2364 | srcBitsLeft = bit_size; |
086ca51f | 2365 | src_bytes_left = src_len; |
f93fca70 | 2366 | unpacked_bytes_left = unpacked_len; |
14f9c5c9 | 2367 | sign = 0; |
f93fca70 JB |
2368 | |
2369 | if (is_big_endian) | |
14f9c5c9 | 2370 | { |
086ca51f | 2371 | src_idx = src_len - 1; |
f93fca70 JB |
2372 | if (is_signed_type |
2373 | && ((src[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1)))) | |
4c4b4cd2 | 2374 | sign = ~0; |
d2e4a39e AS |
2375 | |
2376 | unusedLS = | |
4c4b4cd2 PH |
2377 | (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT) |
2378 | % HOST_CHAR_BIT; | |
14f9c5c9 | 2379 | |
f93fca70 JB |
2380 | if (is_scalar) |
2381 | { | |
2382 | accumSize = 0; | |
2383 | unpacked_idx = unpacked_len - 1; | |
2384 | } | |
2385 | else | |
2386 | { | |
4c4b4cd2 PH |
2387 | /* Non-scalar values must be aligned at a byte boundary... */ |
2388 | accumSize = | |
2389 | (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT; | |
2390 | /* ... And are placed at the beginning (most-significant) bytes | |
2391 | of the target. */ | |
086ca51f JB |
2392 | unpacked_idx = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1; |
2393 | unpacked_bytes_left = unpacked_idx + 1; | |
f93fca70 | 2394 | } |
14f9c5c9 | 2395 | } |
d2e4a39e | 2396 | else |
14f9c5c9 AS |
2397 | { |
2398 | int sign_bit_offset = (bit_size + bit_offset - 1) % 8; | |
2399 | ||
086ca51f | 2400 | src_idx = unpacked_idx = 0; |
14f9c5c9 AS |
2401 | unusedLS = bit_offset; |
2402 | accumSize = 0; | |
2403 | ||
f93fca70 | 2404 | if (is_signed_type && (src[src_len - 1] & (1 << sign_bit_offset))) |
4c4b4cd2 | 2405 | sign = ~0; |
14f9c5c9 | 2406 | } |
d2e4a39e | 2407 | |
14f9c5c9 | 2408 | accum = 0; |
086ca51f | 2409 | while (src_bytes_left > 0) |
14f9c5c9 AS |
2410 | { |
2411 | /* Mask for removing bits of the next source byte that are not | |
4c4b4cd2 | 2412 | part of the value. */ |
d2e4a39e | 2413 | unsigned int unusedMSMask = |
4c4b4cd2 PH |
2414 | (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) - |
2415 | 1; | |
2416 | /* Sign-extend bits for this byte. */ | |
14f9c5c9 | 2417 | unsigned int signMask = sign & ~unusedMSMask; |
5b4ee69b | 2418 | |
d2e4a39e | 2419 | accum |= |
086ca51f | 2420 | (((src[src_idx] >> unusedLS) & unusedMSMask) | signMask) << accumSize; |
14f9c5c9 | 2421 | accumSize += HOST_CHAR_BIT - unusedLS; |
d2e4a39e | 2422 | if (accumSize >= HOST_CHAR_BIT) |
4c4b4cd2 | 2423 | { |
db297a65 | 2424 | unpacked[unpacked_idx] = accum & ~(~0UL << HOST_CHAR_BIT); |
4c4b4cd2 PH |
2425 | accumSize -= HOST_CHAR_BIT; |
2426 | accum >>= HOST_CHAR_BIT; | |
086ca51f JB |
2427 | unpacked_bytes_left -= 1; |
2428 | unpacked_idx += delta; | |
4c4b4cd2 | 2429 | } |
14f9c5c9 AS |
2430 | srcBitsLeft -= HOST_CHAR_BIT - unusedLS; |
2431 | unusedLS = 0; | |
086ca51f JB |
2432 | src_bytes_left -= 1; |
2433 | src_idx += delta; | |
14f9c5c9 | 2434 | } |
086ca51f | 2435 | while (unpacked_bytes_left > 0) |
14f9c5c9 AS |
2436 | { |
2437 | accum |= sign << accumSize; | |
db297a65 | 2438 | unpacked[unpacked_idx] = accum & ~(~0UL << HOST_CHAR_BIT); |
14f9c5c9 | 2439 | accumSize -= HOST_CHAR_BIT; |
9cd4d857 JB |
2440 | if (accumSize < 0) |
2441 | accumSize = 0; | |
14f9c5c9 | 2442 | accum >>= HOST_CHAR_BIT; |
086ca51f JB |
2443 | unpacked_bytes_left -= 1; |
2444 | unpacked_idx += delta; | |
14f9c5c9 | 2445 | } |
f93fca70 JB |
2446 | } |
2447 | ||
2448 | /* Create a new value of type TYPE from the contents of OBJ starting | |
2449 | at byte OFFSET, and bit offset BIT_OFFSET within that byte, | |
2450 | proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then | |
2451 | assigning through the result will set the field fetched from. | |
2452 | VALADDR is ignored unless OBJ is NULL, in which case, | |
2453 | VALADDR+OFFSET must address the start of storage containing the | |
2454 | packed value. The value returned in this case is never an lval. | |
2455 | Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */ | |
2456 | ||
2457 | struct value * | |
2458 | ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr, | |
2459 | long offset, int bit_offset, int bit_size, | |
2460 | struct type *type) | |
2461 | { | |
2462 | struct value *v; | |
bfb1c796 | 2463 | const gdb_byte *src; /* First byte containing data to unpack */ |
f93fca70 | 2464 | gdb_byte *unpacked; |
220475ed | 2465 | const int is_scalar = is_scalar_type (type); |
d5a22e77 | 2466 | const int is_big_endian = type_byte_order (type) == BFD_ENDIAN_BIG; |
d5722aa2 | 2467 | gdb::byte_vector staging; |
f93fca70 JB |
2468 | |
2469 | type = ada_check_typedef (type); | |
2470 | ||
d0a9e810 | 2471 | if (obj == NULL) |
bfb1c796 | 2472 | src = valaddr + offset; |
d0a9e810 | 2473 | else |
bfb1c796 | 2474 | src = value_contents (obj) + offset; |
d0a9e810 JB |
2475 | |
2476 | if (is_dynamic_type (type)) | |
2477 | { | |
2478 | /* The length of TYPE might by dynamic, so we need to resolve | |
2479 | TYPE in order to know its actual size, which we then use | |
2480 | to create the contents buffer of the value we return. | |
2481 | The difficulty is that the data containing our object is | |
2482 | packed, and therefore maybe not at a byte boundary. So, what | |
2483 | we do, is unpack the data into a byte-aligned buffer, and then | |
2484 | use that buffer as our object's value for resolving the type. */ | |
d5722aa2 PA |
2485 | int staging_len = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; |
2486 | staging.resize (staging_len); | |
d0a9e810 JB |
2487 | |
2488 | ada_unpack_from_contents (src, bit_offset, bit_size, | |
d5722aa2 | 2489 | staging.data (), staging.size (), |
d0a9e810 JB |
2490 | is_big_endian, has_negatives (type), |
2491 | is_scalar); | |
b249d2c2 | 2492 | type = resolve_dynamic_type (type, staging, 0); |
0cafa88c JB |
2493 | if (TYPE_LENGTH (type) < (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT) |
2494 | { | |
2495 | /* This happens when the length of the object is dynamic, | |
2496 | and is actually smaller than the space reserved for it. | |
2497 | For instance, in an array of variant records, the bit_size | |
2498 | we're given is the array stride, which is constant and | |
2499 | normally equal to the maximum size of its element. | |
2500 | But, in reality, each element only actually spans a portion | |
2501 | of that stride. */ | |
2502 | bit_size = TYPE_LENGTH (type) * HOST_CHAR_BIT; | |
2503 | } | |
d0a9e810 JB |
2504 | } |
2505 | ||
f93fca70 JB |
2506 | if (obj == NULL) |
2507 | { | |
2508 | v = allocate_value (type); | |
bfb1c796 | 2509 | src = valaddr + offset; |
f93fca70 JB |
2510 | } |
2511 | else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj)) | |
2512 | { | |
0cafa88c | 2513 | int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8; |
bfb1c796 | 2514 | gdb_byte *buf; |
0cafa88c | 2515 | |
f93fca70 | 2516 | v = value_at (type, value_address (obj) + offset); |
bfb1c796 PA |
2517 | buf = (gdb_byte *) alloca (src_len); |
2518 | read_memory (value_address (v), buf, src_len); | |
2519 | src = buf; | |
f93fca70 JB |
2520 | } |
2521 | else | |
2522 | { | |
2523 | v = allocate_value (type); | |
bfb1c796 | 2524 | src = value_contents (obj) + offset; |
f93fca70 JB |
2525 | } |
2526 | ||
2527 | if (obj != NULL) | |
2528 | { | |
2529 | long new_offset = offset; | |
2530 | ||
2531 | set_value_component_location (v, obj); | |
2532 | set_value_bitpos (v, bit_offset + value_bitpos (obj)); | |
2533 | set_value_bitsize (v, bit_size); | |
2534 | if (value_bitpos (v) >= HOST_CHAR_BIT) | |
2535 | { | |
2536 | ++new_offset; | |
2537 | set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT); | |
2538 | } | |
2539 | set_value_offset (v, new_offset); | |
2540 | ||
2541 | /* Also set the parent value. This is needed when trying to | |
2542 | assign a new value (in inferior memory). */ | |
2543 | set_value_parent (v, obj); | |
2544 | } | |
2545 | else | |
2546 | set_value_bitsize (v, bit_size); | |
bfb1c796 | 2547 | unpacked = value_contents_writeable (v); |
f93fca70 JB |
2548 | |
2549 | if (bit_size == 0) | |
2550 | { | |
2551 | memset (unpacked, 0, TYPE_LENGTH (type)); | |
2552 | return v; | |
2553 | } | |
2554 | ||
d5722aa2 | 2555 | if (staging.size () == TYPE_LENGTH (type)) |
f93fca70 | 2556 | { |
d0a9e810 JB |
2557 | /* Small short-cut: If we've unpacked the data into a buffer |
2558 | of the same size as TYPE's length, then we can reuse that, | |
2559 | instead of doing the unpacking again. */ | |
d5722aa2 | 2560 | memcpy (unpacked, staging.data (), staging.size ()); |
f93fca70 | 2561 | } |
d0a9e810 JB |
2562 | else |
2563 | ada_unpack_from_contents (src, bit_offset, bit_size, | |
2564 | unpacked, TYPE_LENGTH (type), | |
2565 | is_big_endian, has_negatives (type), is_scalar); | |
f93fca70 | 2566 | |
14f9c5c9 AS |
2567 | return v; |
2568 | } | |
d2e4a39e | 2569 | |
14f9c5c9 AS |
2570 | /* Store the contents of FROMVAL into the location of TOVAL. |
2571 | Return a new value with the location of TOVAL and contents of | |
2572 | FROMVAL. Handles assignment into packed fields that have | |
4c4b4cd2 | 2573 | floating-point or non-scalar types. */ |
14f9c5c9 | 2574 | |
d2e4a39e AS |
2575 | static struct value * |
2576 | ada_value_assign (struct value *toval, struct value *fromval) | |
14f9c5c9 | 2577 | { |
df407dfe AC |
2578 | struct type *type = value_type (toval); |
2579 | int bits = value_bitsize (toval); | |
14f9c5c9 | 2580 | |
52ce6436 PH |
2581 | toval = ada_coerce_ref (toval); |
2582 | fromval = ada_coerce_ref (fromval); | |
2583 | ||
2584 | if (ada_is_direct_array_type (value_type (toval))) | |
2585 | toval = ada_coerce_to_simple_array (toval); | |
2586 | if (ada_is_direct_array_type (value_type (fromval))) | |
2587 | fromval = ada_coerce_to_simple_array (fromval); | |
2588 | ||
88e3b34b | 2589 | if (!deprecated_value_modifiable (toval)) |
323e0a4a | 2590 | error (_("Left operand of assignment is not a modifiable lvalue.")); |
14f9c5c9 | 2591 | |
d2e4a39e | 2592 | if (VALUE_LVAL (toval) == lval_memory |
14f9c5c9 | 2593 | && bits > 0 |
78134374 SM |
2594 | && (type->code () == TYPE_CODE_FLT |
2595 | || type->code () == TYPE_CODE_STRUCT)) | |
14f9c5c9 | 2596 | { |
df407dfe AC |
2597 | int len = (value_bitpos (toval) |
2598 | + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
aced2898 | 2599 | int from_size; |
224c3ddb | 2600 | gdb_byte *buffer = (gdb_byte *) alloca (len); |
d2e4a39e | 2601 | struct value *val; |
42ae5230 | 2602 | CORE_ADDR to_addr = value_address (toval); |
14f9c5c9 | 2603 | |
78134374 | 2604 | if (type->code () == TYPE_CODE_FLT) |
4c4b4cd2 | 2605 | fromval = value_cast (type, fromval); |
14f9c5c9 | 2606 | |
52ce6436 | 2607 | read_memory (to_addr, buffer, len); |
aced2898 PH |
2608 | from_size = value_bitsize (fromval); |
2609 | if (from_size == 0) | |
2610 | from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT; | |
d48e62f4 | 2611 | |
d5a22e77 | 2612 | const int is_big_endian = type_byte_order (type) == BFD_ENDIAN_BIG; |
d48e62f4 TT |
2613 | ULONGEST from_offset = 0; |
2614 | if (is_big_endian && is_scalar_type (value_type (fromval))) | |
2615 | from_offset = from_size - bits; | |
2616 | copy_bitwise (buffer, value_bitpos (toval), | |
2617 | value_contents (fromval), from_offset, | |
2618 | bits, is_big_endian); | |
972daa01 | 2619 | write_memory_with_notification (to_addr, buffer, len); |
8cebebb9 | 2620 | |
14f9c5c9 | 2621 | val = value_copy (toval); |
0fd88904 | 2622 | memcpy (value_contents_raw (val), value_contents (fromval), |
4c4b4cd2 | 2623 | TYPE_LENGTH (type)); |
04624583 | 2624 | deprecated_set_value_type (val, type); |
d2e4a39e | 2625 | |
14f9c5c9 AS |
2626 | return val; |
2627 | } | |
2628 | ||
2629 | return value_assign (toval, fromval); | |
2630 | } | |
2631 | ||
2632 | ||
7c512744 JB |
2633 | /* Given that COMPONENT is a memory lvalue that is part of the lvalue |
2634 | CONTAINER, assign the contents of VAL to COMPONENTS's place in | |
2635 | CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not | |
2636 | COMPONENT, and not the inferior's memory. The current contents | |
2637 | of COMPONENT are ignored. | |
2638 | ||
2639 | Although not part of the initial design, this function also works | |
2640 | when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER | |
2641 | had a null address, and COMPONENT had an address which is equal to | |
2642 | its offset inside CONTAINER. */ | |
2643 | ||
52ce6436 PH |
2644 | static void |
2645 | value_assign_to_component (struct value *container, struct value *component, | |
2646 | struct value *val) | |
2647 | { | |
2648 | LONGEST offset_in_container = | |
42ae5230 | 2649 | (LONGEST) (value_address (component) - value_address (container)); |
7c512744 | 2650 | int bit_offset_in_container = |
52ce6436 PH |
2651 | value_bitpos (component) - value_bitpos (container); |
2652 | int bits; | |
7c512744 | 2653 | |
52ce6436 PH |
2654 | val = value_cast (value_type (component), val); |
2655 | ||
2656 | if (value_bitsize (component) == 0) | |
2657 | bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component)); | |
2658 | else | |
2659 | bits = value_bitsize (component); | |
2660 | ||
d5a22e77 | 2661 | if (type_byte_order (value_type (container)) == BFD_ENDIAN_BIG) |
2a62dfa9 JB |
2662 | { |
2663 | int src_offset; | |
2664 | ||
2665 | if (is_scalar_type (check_typedef (value_type (component)))) | |
2666 | src_offset | |
2667 | = TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits; | |
2668 | else | |
2669 | src_offset = 0; | |
a99bc3d2 JB |
2670 | copy_bitwise (value_contents_writeable (container) + offset_in_container, |
2671 | value_bitpos (container) + bit_offset_in_container, | |
2672 | value_contents (val), src_offset, bits, 1); | |
2a62dfa9 | 2673 | } |
52ce6436 | 2674 | else |
a99bc3d2 JB |
2675 | copy_bitwise (value_contents_writeable (container) + offset_in_container, |
2676 | value_bitpos (container) + bit_offset_in_container, | |
2677 | value_contents (val), 0, bits, 0); | |
7c512744 JB |
2678 | } |
2679 | ||
736ade86 XR |
2680 | /* Determine if TYPE is an access to an unconstrained array. */ |
2681 | ||
d91e9ea8 | 2682 | bool |
736ade86 XR |
2683 | ada_is_access_to_unconstrained_array (struct type *type) |
2684 | { | |
78134374 | 2685 | return (type->code () == TYPE_CODE_TYPEDEF |
736ade86 XR |
2686 | && is_thick_pntr (ada_typedef_target_type (type))); |
2687 | } | |
2688 | ||
4c4b4cd2 PH |
2689 | /* The value of the element of array ARR at the ARITY indices given in IND. |
2690 | ARR may be either a simple array, GNAT array descriptor, or pointer | |
14f9c5c9 AS |
2691 | thereto. */ |
2692 | ||
d2e4a39e AS |
2693 | struct value * |
2694 | ada_value_subscript (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
2695 | { |
2696 | int k; | |
d2e4a39e AS |
2697 | struct value *elt; |
2698 | struct type *elt_type; | |
14f9c5c9 AS |
2699 | |
2700 | elt = ada_coerce_to_simple_array (arr); | |
2701 | ||
df407dfe | 2702 | elt_type = ada_check_typedef (value_type (elt)); |
78134374 | 2703 | if (elt_type->code () == TYPE_CODE_ARRAY |
14f9c5c9 AS |
2704 | && TYPE_FIELD_BITSIZE (elt_type, 0) > 0) |
2705 | return value_subscript_packed (elt, arity, ind); | |
2706 | ||
2707 | for (k = 0; k < arity; k += 1) | |
2708 | { | |
b9c50e9a XR |
2709 | struct type *saved_elt_type = TYPE_TARGET_TYPE (elt_type); |
2710 | ||
78134374 | 2711 | if (elt_type->code () != TYPE_CODE_ARRAY) |
323e0a4a | 2712 | error (_("too many subscripts (%d expected)"), k); |
b9c50e9a | 2713 | |
2497b498 | 2714 | elt = value_subscript (elt, pos_atr (ind[k])); |
b9c50e9a XR |
2715 | |
2716 | if (ada_is_access_to_unconstrained_array (saved_elt_type) | |
78134374 | 2717 | && value_type (elt)->code () != TYPE_CODE_TYPEDEF) |
b9c50e9a XR |
2718 | { |
2719 | /* The element is a typedef to an unconstrained array, | |
2720 | except that the value_subscript call stripped the | |
2721 | typedef layer. The typedef layer is GNAT's way to | |
2722 | specify that the element is, at the source level, an | |
2723 | access to the unconstrained array, rather than the | |
2724 | unconstrained array. So, we need to restore that | |
2725 | typedef layer, which we can do by forcing the element's | |
2726 | type back to its original type. Otherwise, the returned | |
2727 | value is going to be printed as the array, rather | |
2728 | than as an access. Another symptom of the same issue | |
2729 | would be that an expression trying to dereference the | |
2730 | element would also be improperly rejected. */ | |
2731 | deprecated_set_value_type (elt, saved_elt_type); | |
2732 | } | |
2733 | ||
2734 | elt_type = ada_check_typedef (value_type (elt)); | |
14f9c5c9 | 2735 | } |
b9c50e9a | 2736 | |
14f9c5c9 AS |
2737 | return elt; |
2738 | } | |
2739 | ||
deede10c JB |
2740 | /* Assuming ARR is a pointer to a GDB array, the value of the element |
2741 | of *ARR at the ARITY indices given in IND. | |
919e6dbe PMR |
2742 | Does not read the entire array into memory. |
2743 | ||
2744 | Note: Unlike what one would expect, this function is used instead of | |
2745 | ada_value_subscript for basically all non-packed array types. The reason | |
2746 | for this is that a side effect of doing our own pointer arithmetics instead | |
2747 | of relying on value_subscript is that there is no implicit typedef peeling. | |
2748 | This is important for arrays of array accesses, where it allows us to | |
2749 | preserve the fact that the array's element is an array access, where the | |
2750 | access part os encoded in a typedef layer. */ | |
14f9c5c9 | 2751 | |
2c0b251b | 2752 | static struct value * |
deede10c | 2753 | ada_value_ptr_subscript (struct value *arr, int arity, struct value **ind) |
14f9c5c9 AS |
2754 | { |
2755 | int k; | |
919e6dbe | 2756 | struct value *array_ind = ada_value_ind (arr); |
deede10c | 2757 | struct type *type |
919e6dbe PMR |
2758 | = check_typedef (value_enclosing_type (array_ind)); |
2759 | ||
78134374 | 2760 | if (type->code () == TYPE_CODE_ARRAY |
919e6dbe PMR |
2761 | && TYPE_FIELD_BITSIZE (type, 0) > 0) |
2762 | return value_subscript_packed (array_ind, arity, ind); | |
14f9c5c9 AS |
2763 | |
2764 | for (k = 0; k < arity; k += 1) | |
2765 | { | |
2766 | LONGEST lwb, upb; | |
14f9c5c9 | 2767 | |
78134374 | 2768 | if (type->code () != TYPE_CODE_ARRAY) |
323e0a4a | 2769 | error (_("too many subscripts (%d expected)"), k); |
d2e4a39e | 2770 | arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
4c4b4cd2 | 2771 | value_copy (arr)); |
14f9c5c9 | 2772 | get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb); |
53a47a3e | 2773 | arr = value_ptradd (arr, pos_atr (ind[k]) - lwb); |
14f9c5c9 AS |
2774 | type = TYPE_TARGET_TYPE (type); |
2775 | } | |
2776 | ||
2777 | return value_ind (arr); | |
2778 | } | |
2779 | ||
0b5d8877 | 2780 | /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the |
aa715135 JG |
2781 | actual type of ARRAY_PTR is ignored), returns the Ada slice of |
2782 | HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of | |
2783 | this array is LOW, as per Ada rules. */ | |
0b5d8877 | 2784 | static struct value * |
f5938064 JG |
2785 | ada_value_slice_from_ptr (struct value *array_ptr, struct type *type, |
2786 | int low, int high) | |
0b5d8877 | 2787 | { |
b0dd7688 | 2788 | struct type *type0 = ada_check_typedef (type); |
aa715135 | 2789 | struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)); |
0c9c3474 | 2790 | struct type *index_type |
aa715135 | 2791 | = create_static_range_type (NULL, base_index_type, low, high); |
9fe561ab JB |
2792 | struct type *slice_type = create_array_type_with_stride |
2793 | (NULL, TYPE_TARGET_TYPE (type0), index_type, | |
24e99c6c | 2794 | type0->dyn_prop (DYN_PROP_BYTE_STRIDE), |
9fe561ab | 2795 | TYPE_FIELD_BITSIZE (type0, 0)); |
aa715135 JG |
2796 | int base_low = ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)); |
2797 | LONGEST base_low_pos, low_pos; | |
2798 | CORE_ADDR base; | |
2799 | ||
2800 | if (!discrete_position (base_index_type, low, &low_pos) | |
2801 | || !discrete_position (base_index_type, base_low, &base_low_pos)) | |
2802 | { | |
2803 | warning (_("unable to get positions in slice, use bounds instead")); | |
2804 | low_pos = low; | |
2805 | base_low_pos = base_low; | |
2806 | } | |
5b4ee69b | 2807 | |
aa715135 JG |
2808 | base = value_as_address (array_ptr) |
2809 | + ((low_pos - base_low_pos) | |
2810 | * TYPE_LENGTH (TYPE_TARGET_TYPE (type0))); | |
f5938064 | 2811 | return value_at_lazy (slice_type, base); |
0b5d8877 PH |
2812 | } |
2813 | ||
2814 | ||
2815 | static struct value * | |
2816 | ada_value_slice (struct value *array, int low, int high) | |
2817 | { | |
b0dd7688 | 2818 | struct type *type = ada_check_typedef (value_type (array)); |
aa715135 | 2819 | struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)); |
0c9c3474 SA |
2820 | struct type *index_type |
2821 | = create_static_range_type (NULL, TYPE_INDEX_TYPE (type), low, high); | |
9fe561ab JB |
2822 | struct type *slice_type = create_array_type_with_stride |
2823 | (NULL, TYPE_TARGET_TYPE (type), index_type, | |
24e99c6c | 2824 | type->dyn_prop (DYN_PROP_BYTE_STRIDE), |
9fe561ab | 2825 | TYPE_FIELD_BITSIZE (type, 0)); |
aa715135 | 2826 | LONGEST low_pos, high_pos; |
5b4ee69b | 2827 | |
aa715135 JG |
2828 | if (!discrete_position (base_index_type, low, &low_pos) |
2829 | || !discrete_position (base_index_type, high, &high_pos)) | |
2830 | { | |
2831 | warning (_("unable to get positions in slice, use bounds instead")); | |
2832 | low_pos = low; | |
2833 | high_pos = high; | |
2834 | } | |
2835 | ||
2836 | return value_cast (slice_type, | |
2837 | value_slice (array, low, high_pos - low_pos + 1)); | |
0b5d8877 PH |
2838 | } |
2839 | ||
14f9c5c9 AS |
2840 | /* If type is a record type in the form of a standard GNAT array |
2841 | descriptor, returns the number of dimensions for type. If arr is a | |
2842 | simple array, returns the number of "array of"s that prefix its | |
4c4b4cd2 | 2843 | type designation. Otherwise, returns 0. */ |
14f9c5c9 AS |
2844 | |
2845 | int | |
d2e4a39e | 2846 | ada_array_arity (struct type *type) |
14f9c5c9 AS |
2847 | { |
2848 | int arity; | |
2849 | ||
2850 | if (type == NULL) | |
2851 | return 0; | |
2852 | ||
2853 | type = desc_base_type (type); | |
2854 | ||
2855 | arity = 0; | |
78134374 | 2856 | if (type->code () == TYPE_CODE_STRUCT) |
14f9c5c9 | 2857 | return desc_arity (desc_bounds_type (type)); |
d2e4a39e | 2858 | else |
78134374 | 2859 | while (type->code () == TYPE_CODE_ARRAY) |
14f9c5c9 | 2860 | { |
4c4b4cd2 | 2861 | arity += 1; |
61ee279c | 2862 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
14f9c5c9 | 2863 | } |
d2e4a39e | 2864 | |
14f9c5c9 AS |
2865 | return arity; |
2866 | } | |
2867 | ||
2868 | /* If TYPE is a record type in the form of a standard GNAT array | |
2869 | descriptor or a simple array type, returns the element type for | |
2870 | TYPE after indexing by NINDICES indices, or by all indices if | |
4c4b4cd2 | 2871 | NINDICES is -1. Otherwise, returns NULL. */ |
14f9c5c9 | 2872 | |
d2e4a39e AS |
2873 | struct type * |
2874 | ada_array_element_type (struct type *type, int nindices) | |
14f9c5c9 AS |
2875 | { |
2876 | type = desc_base_type (type); | |
2877 | ||
78134374 | 2878 | if (type->code () == TYPE_CODE_STRUCT) |
14f9c5c9 AS |
2879 | { |
2880 | int k; | |
d2e4a39e | 2881 | struct type *p_array_type; |
14f9c5c9 | 2882 | |
556bdfd4 | 2883 | p_array_type = desc_data_target_type (type); |
14f9c5c9 AS |
2884 | |
2885 | k = ada_array_arity (type); | |
2886 | if (k == 0) | |
4c4b4cd2 | 2887 | return NULL; |
d2e4a39e | 2888 | |
4c4b4cd2 | 2889 | /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */ |
14f9c5c9 | 2890 | if (nindices >= 0 && k > nindices) |
4c4b4cd2 | 2891 | k = nindices; |
d2e4a39e | 2892 | while (k > 0 && p_array_type != NULL) |
4c4b4cd2 | 2893 | { |
61ee279c | 2894 | p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type)); |
4c4b4cd2 PH |
2895 | k -= 1; |
2896 | } | |
14f9c5c9 AS |
2897 | return p_array_type; |
2898 | } | |
78134374 | 2899 | else if (type->code () == TYPE_CODE_ARRAY) |
14f9c5c9 | 2900 | { |
78134374 | 2901 | while (nindices != 0 && type->code () == TYPE_CODE_ARRAY) |
4c4b4cd2 PH |
2902 | { |
2903 | type = TYPE_TARGET_TYPE (type); | |
2904 | nindices -= 1; | |
2905 | } | |
14f9c5c9 AS |
2906 | return type; |
2907 | } | |
2908 | ||
2909 | return NULL; | |
2910 | } | |
2911 | ||
4c4b4cd2 | 2912 | /* The type of nth index in arrays of given type (n numbering from 1). |
dd19d49e UW |
2913 | Does not examine memory. Throws an error if N is invalid or TYPE |
2914 | is not an array type. NAME is the name of the Ada attribute being | |
2915 | evaluated ('range, 'first, 'last, or 'length); it is used in building | |
2916 | the error message. */ | |
14f9c5c9 | 2917 | |
1eea4ebd UW |
2918 | static struct type * |
2919 | ada_index_type (struct type *type, int n, const char *name) | |
14f9c5c9 | 2920 | { |
4c4b4cd2 PH |
2921 | struct type *result_type; |
2922 | ||
14f9c5c9 AS |
2923 | type = desc_base_type (type); |
2924 | ||
1eea4ebd UW |
2925 | if (n < 0 || n > ada_array_arity (type)) |
2926 | error (_("invalid dimension number to '%s"), name); | |
14f9c5c9 | 2927 | |
4c4b4cd2 | 2928 | if (ada_is_simple_array_type (type)) |
14f9c5c9 AS |
2929 | { |
2930 | int i; | |
2931 | ||
2932 | for (i = 1; i < n; i += 1) | |
4c4b4cd2 | 2933 | type = TYPE_TARGET_TYPE (type); |
262452ec | 2934 | result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)); |
4c4b4cd2 PH |
2935 | /* FIXME: The stabs type r(0,0);bound;bound in an array type |
2936 | has a target type of TYPE_CODE_UNDEF. We compensate here, but | |
76a01679 | 2937 | perhaps stabsread.c would make more sense. */ |
78134374 | 2938 | if (result_type && result_type->code () == TYPE_CODE_UNDEF) |
1eea4ebd | 2939 | result_type = NULL; |
14f9c5c9 | 2940 | } |
d2e4a39e | 2941 | else |
1eea4ebd UW |
2942 | { |
2943 | result_type = desc_index_type (desc_bounds_type (type), n); | |
2944 | if (result_type == NULL) | |
2945 | error (_("attempt to take bound of something that is not an array")); | |
2946 | } | |
2947 | ||
2948 | return result_type; | |
14f9c5c9 AS |
2949 | } |
2950 | ||
2951 | /* Given that arr is an array type, returns the lower bound of the | |
2952 | Nth index (numbering from 1) if WHICH is 0, and the upper bound if | |
4c4b4cd2 | 2953 | WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an |
1eea4ebd UW |
2954 | array-descriptor type. It works for other arrays with bounds supplied |
2955 | by run-time quantities other than discriminants. */ | |
14f9c5c9 | 2956 | |
abb68b3e | 2957 | static LONGEST |
fb5e3d5c | 2958 | ada_array_bound_from_type (struct type *arr_type, int n, int which) |
14f9c5c9 | 2959 | { |
8a48ac95 | 2960 | struct type *type, *index_type_desc, *index_type; |
1ce677a4 | 2961 | int i; |
262452ec JK |
2962 | |
2963 | gdb_assert (which == 0 || which == 1); | |
14f9c5c9 | 2964 | |
ad82864c JB |
2965 | if (ada_is_constrained_packed_array_type (arr_type)) |
2966 | arr_type = decode_constrained_packed_array_type (arr_type); | |
14f9c5c9 | 2967 | |
4c4b4cd2 | 2968 | if (arr_type == NULL || !ada_is_simple_array_type (arr_type)) |
1eea4ebd | 2969 | return (LONGEST) - which; |
14f9c5c9 | 2970 | |
78134374 | 2971 | if (arr_type->code () == TYPE_CODE_PTR) |
14f9c5c9 AS |
2972 | type = TYPE_TARGET_TYPE (arr_type); |
2973 | else | |
2974 | type = arr_type; | |
2975 | ||
bafffb51 JB |
2976 | if (TYPE_FIXED_INSTANCE (type)) |
2977 | { | |
2978 | /* The array has already been fixed, so we do not need to | |
2979 | check the parallel ___XA type again. That encoding has | |
2980 | already been applied, so ignore it now. */ | |
2981 | index_type_desc = NULL; | |
2982 | } | |
2983 | else | |
2984 | { | |
2985 | index_type_desc = ada_find_parallel_type (type, "___XA"); | |
2986 | ada_fixup_array_indexes_type (index_type_desc); | |
2987 | } | |
2988 | ||
262452ec | 2989 | if (index_type_desc != NULL) |
28c85d6c JB |
2990 | index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1), |
2991 | NULL); | |
262452ec | 2992 | else |
8a48ac95 JB |
2993 | { |
2994 | struct type *elt_type = check_typedef (type); | |
2995 | ||
2996 | for (i = 1; i < n; i++) | |
2997 | elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type)); | |
2998 | ||
2999 | index_type = TYPE_INDEX_TYPE (elt_type); | |
3000 | } | |
262452ec | 3001 | |
43bbcdc2 PH |
3002 | return |
3003 | (LONGEST) (which == 0 | |
3004 | ? ada_discrete_type_low_bound (index_type) | |
3005 | : ada_discrete_type_high_bound (index_type)); | |
14f9c5c9 AS |
3006 | } |
3007 | ||
3008 | /* Given that arr is an array value, returns the lower bound of the | |
abb68b3e JB |
3009 | nth index (numbering from 1) if WHICH is 0, and the upper bound if |
3010 | WHICH is 1. This routine will also work for arrays with bounds | |
4c4b4cd2 | 3011 | supplied by run-time quantities other than discriminants. */ |
14f9c5c9 | 3012 | |
1eea4ebd | 3013 | static LONGEST |
4dc81987 | 3014 | ada_array_bound (struct value *arr, int n, int which) |
14f9c5c9 | 3015 | { |
eb479039 JB |
3016 | struct type *arr_type; |
3017 | ||
78134374 | 3018 | if (check_typedef (value_type (arr))->code () == TYPE_CODE_PTR) |
eb479039 JB |
3019 | arr = value_ind (arr); |
3020 | arr_type = value_enclosing_type (arr); | |
14f9c5c9 | 3021 | |
ad82864c JB |
3022 | if (ada_is_constrained_packed_array_type (arr_type)) |
3023 | return ada_array_bound (decode_constrained_packed_array (arr), n, which); | |
4c4b4cd2 | 3024 | else if (ada_is_simple_array_type (arr_type)) |
1eea4ebd | 3025 | return ada_array_bound_from_type (arr_type, n, which); |
14f9c5c9 | 3026 | else |
1eea4ebd | 3027 | return value_as_long (desc_one_bound (desc_bounds (arr), n, which)); |
14f9c5c9 AS |
3028 | } |
3029 | ||
3030 | /* Given that arr is an array value, returns the length of the | |
3031 | nth index. This routine will also work for arrays with bounds | |
4c4b4cd2 PH |
3032 | supplied by run-time quantities other than discriminants. |
3033 | Does not work for arrays indexed by enumeration types with representation | |
3034 | clauses at the moment. */ | |
14f9c5c9 | 3035 | |
1eea4ebd | 3036 | static LONGEST |
d2e4a39e | 3037 | ada_array_length (struct value *arr, int n) |
14f9c5c9 | 3038 | { |
aa715135 JG |
3039 | struct type *arr_type, *index_type; |
3040 | int low, high; | |
eb479039 | 3041 | |
78134374 | 3042 | if (check_typedef (value_type (arr))->code () == TYPE_CODE_PTR) |
eb479039 JB |
3043 | arr = value_ind (arr); |
3044 | arr_type = value_enclosing_type (arr); | |
14f9c5c9 | 3045 | |
ad82864c JB |
3046 | if (ada_is_constrained_packed_array_type (arr_type)) |
3047 | return ada_array_length (decode_constrained_packed_array (arr), n); | |
14f9c5c9 | 3048 | |
4c4b4cd2 | 3049 | if (ada_is_simple_array_type (arr_type)) |
aa715135 JG |
3050 | { |
3051 | low = ada_array_bound_from_type (arr_type, n, 0); | |
3052 | high = ada_array_bound_from_type (arr_type, n, 1); | |
3053 | } | |
14f9c5c9 | 3054 | else |
aa715135 JG |
3055 | { |
3056 | low = value_as_long (desc_one_bound (desc_bounds (arr), n, 0)); | |
3057 | high = value_as_long (desc_one_bound (desc_bounds (arr), n, 1)); | |
3058 | } | |
3059 | ||
f168693b | 3060 | arr_type = check_typedef (arr_type); |
7150d33c | 3061 | index_type = ada_index_type (arr_type, n, "length"); |
aa715135 JG |
3062 | if (index_type != NULL) |
3063 | { | |
3064 | struct type *base_type; | |
78134374 | 3065 | if (index_type->code () == TYPE_CODE_RANGE) |
aa715135 JG |
3066 | base_type = TYPE_TARGET_TYPE (index_type); |
3067 | else | |
3068 | base_type = index_type; | |
3069 | ||
3070 | low = pos_atr (value_from_longest (base_type, low)); | |
3071 | high = pos_atr (value_from_longest (base_type, high)); | |
3072 | } | |
3073 | return high - low + 1; | |
4c4b4cd2 PH |
3074 | } |
3075 | ||
bff8c71f TT |
3076 | /* An array whose type is that of ARR_TYPE (an array type), with |
3077 | bounds LOW to HIGH, but whose contents are unimportant. If HIGH is | |
3078 | less than LOW, then LOW-1 is used. */ | |
4c4b4cd2 PH |
3079 | |
3080 | static struct value * | |
bff8c71f | 3081 | empty_array (struct type *arr_type, int low, int high) |
4c4b4cd2 | 3082 | { |
b0dd7688 | 3083 | struct type *arr_type0 = ada_check_typedef (arr_type); |
0c9c3474 SA |
3084 | struct type *index_type |
3085 | = create_static_range_type | |
bff8c71f TT |
3086 | (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)), low, |
3087 | high < low ? low - 1 : high); | |
b0dd7688 | 3088 | struct type *elt_type = ada_array_element_type (arr_type0, 1); |
5b4ee69b | 3089 | |
0b5d8877 | 3090 | return allocate_value (create_array_type (NULL, elt_type, index_type)); |
14f9c5c9 | 3091 | } |
14f9c5c9 | 3092 | \f |
d2e4a39e | 3093 | |
4c4b4cd2 | 3094 | /* Name resolution */ |
14f9c5c9 | 3095 | |
4c4b4cd2 PH |
3096 | /* The "decoded" name for the user-definable Ada operator corresponding |
3097 | to OP. */ | |
14f9c5c9 | 3098 | |
d2e4a39e | 3099 | static const char * |
4c4b4cd2 | 3100 | ada_decoded_op_name (enum exp_opcode op) |
14f9c5c9 AS |
3101 | { |
3102 | int i; | |
3103 | ||
4c4b4cd2 | 3104 | for (i = 0; ada_opname_table[i].encoded != NULL; i += 1) |
14f9c5c9 AS |
3105 | { |
3106 | if (ada_opname_table[i].op == op) | |
4c4b4cd2 | 3107 | return ada_opname_table[i].decoded; |
14f9c5c9 | 3108 | } |
323e0a4a | 3109 | error (_("Could not find operator name for opcode")); |
14f9c5c9 AS |
3110 | } |
3111 | ||
de93309a SM |
3112 | /* Returns true (non-zero) iff decoded name N0 should appear before N1 |
3113 | in a listing of choices during disambiguation (see sort_choices, below). | |
3114 | The idea is that overloadings of a subprogram name from the | |
3115 | same package should sort in their source order. We settle for ordering | |
3116 | such symbols by their trailing number (__N or $N). */ | |
14f9c5c9 | 3117 | |
de93309a SM |
3118 | static int |
3119 | encoded_ordered_before (const char *N0, const char *N1) | |
14f9c5c9 | 3120 | { |
de93309a SM |
3121 | if (N1 == NULL) |
3122 | return 0; | |
3123 | else if (N0 == NULL) | |
3124 | return 1; | |
3125 | else | |
3126 | { | |
3127 | int k0, k1; | |
30b15541 | 3128 | |
de93309a SM |
3129 | for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1) |
3130 | ; | |
3131 | for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1) | |
3132 | ; | |
3133 | if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000' | |
3134 | && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000') | |
3135 | { | |
3136 | int n0, n1; | |
30b15541 | 3137 | |
de93309a SM |
3138 | n0 = k0; |
3139 | while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_') | |
3140 | n0 -= 1; | |
3141 | n1 = k1; | |
3142 | while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_') | |
3143 | n1 -= 1; | |
3144 | if (n0 == n1 && strncmp (N0, N1, n0) == 0) | |
3145 | return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1)); | |
3146 | } | |
3147 | return (strcmp (N0, N1) < 0); | |
3148 | } | |
14f9c5c9 AS |
3149 | } |
3150 | ||
de93309a SM |
3151 | /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the |
3152 | encoded names. */ | |
14f9c5c9 | 3153 | |
de93309a SM |
3154 | static void |
3155 | sort_choices (struct block_symbol syms[], int nsyms) | |
14f9c5c9 | 3156 | { |
14f9c5c9 | 3157 | int i; |
14f9c5c9 | 3158 | |
de93309a | 3159 | for (i = 1; i < nsyms; i += 1) |
14f9c5c9 | 3160 | { |
de93309a SM |
3161 | struct block_symbol sym = syms[i]; |
3162 | int j; | |
3163 | ||
3164 | for (j = i - 1; j >= 0; j -= 1) | |
4c4b4cd2 | 3165 | { |
987012b8 CB |
3166 | if (encoded_ordered_before (syms[j].symbol->linkage_name (), |
3167 | sym.symbol->linkage_name ())) | |
de93309a SM |
3168 | break; |
3169 | syms[j + 1] = syms[j]; | |
4c4b4cd2 | 3170 | } |
de93309a SM |
3171 | syms[j + 1] = sym; |
3172 | } | |
3173 | } | |
14f9c5c9 | 3174 | |
de93309a SM |
3175 | /* Whether GDB should display formals and return types for functions in the |
3176 | overloads selection menu. */ | |
3177 | static bool print_signatures = true; | |
4c4b4cd2 | 3178 | |
de93309a SM |
3179 | /* Print the signature for SYM on STREAM according to the FLAGS options. For |
3180 | all but functions, the signature is just the name of the symbol. For | |
3181 | functions, this is the name of the function, the list of types for formals | |
3182 | and the return type (if any). */ | |
4c4b4cd2 | 3183 | |
de93309a SM |
3184 | static void |
3185 | ada_print_symbol_signature (struct ui_file *stream, struct symbol *sym, | |
3186 | const struct type_print_options *flags) | |
3187 | { | |
3188 | struct type *type = SYMBOL_TYPE (sym); | |
14f9c5c9 | 3189 | |
987012b8 | 3190 | fprintf_filtered (stream, "%s", sym->print_name ()); |
de93309a SM |
3191 | if (!print_signatures |
3192 | || type == NULL | |
78134374 | 3193 | || type->code () != TYPE_CODE_FUNC) |
de93309a | 3194 | return; |
4c4b4cd2 | 3195 | |
1f704f76 | 3196 | if (type->num_fields () > 0) |
de93309a SM |
3197 | { |
3198 | int i; | |
14f9c5c9 | 3199 | |
de93309a | 3200 | fprintf_filtered (stream, " ("); |
1f704f76 | 3201 | for (i = 0; i < type->num_fields (); ++i) |
de93309a SM |
3202 | { |
3203 | if (i > 0) | |
3204 | fprintf_filtered (stream, "; "); | |
3205 | ada_print_type (TYPE_FIELD_TYPE (type, i), NULL, stream, -1, 0, | |
3206 | flags); | |
3207 | } | |
3208 | fprintf_filtered (stream, ")"); | |
3209 | } | |
3210 | if (TYPE_TARGET_TYPE (type) != NULL | |
78134374 | 3211 | && TYPE_TARGET_TYPE (type)->code () != TYPE_CODE_VOID) |
de93309a SM |
3212 | { |
3213 | fprintf_filtered (stream, " return "); | |
3214 | ada_print_type (TYPE_TARGET_TYPE (type), NULL, stream, -1, 0, flags); | |
3215 | } | |
3216 | } | |
14f9c5c9 | 3217 | |
de93309a SM |
3218 | /* Read and validate a set of numeric choices from the user in the |
3219 | range 0 .. N_CHOICES-1. Place the results in increasing | |
3220 | order in CHOICES[0 .. N-1], and return N. | |
14f9c5c9 | 3221 | |
de93309a SM |
3222 | The user types choices as a sequence of numbers on one line |
3223 | separated by blanks, encoding them as follows: | |
14f9c5c9 | 3224 | |
de93309a SM |
3225 | + A choice of 0 means to cancel the selection, throwing an error. |
3226 | + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1. | |
3227 | + The user chooses k by typing k+IS_ALL_CHOICE+1. | |
14f9c5c9 | 3228 | |
de93309a | 3229 | The user is not allowed to choose more than MAX_RESULTS values. |
14f9c5c9 | 3230 | |
de93309a SM |
3231 | ANNOTATION_SUFFIX, if present, is used to annotate the input |
3232 | prompts (for use with the -f switch). */ | |
14f9c5c9 | 3233 | |
de93309a SM |
3234 | static int |
3235 | get_selections (int *choices, int n_choices, int max_results, | |
3236 | int is_all_choice, const char *annotation_suffix) | |
3237 | { | |
992a7040 | 3238 | const char *args; |
de93309a SM |
3239 | const char *prompt; |
3240 | int n_chosen; | |
3241 | int first_choice = is_all_choice ? 2 : 1; | |
14f9c5c9 | 3242 | |
de93309a SM |
3243 | prompt = getenv ("PS2"); |
3244 | if (prompt == NULL) | |
3245 | prompt = "> "; | |
4c4b4cd2 | 3246 | |
de93309a | 3247 | args = command_line_input (prompt, annotation_suffix); |
4c4b4cd2 | 3248 | |
de93309a SM |
3249 | if (args == NULL) |
3250 | error_no_arg (_("one or more choice numbers")); | |
14f9c5c9 | 3251 | |
de93309a | 3252 | n_chosen = 0; |
4c4b4cd2 | 3253 | |
de93309a SM |
3254 | /* Set choices[0 .. n_chosen-1] to the users' choices in ascending |
3255 | order, as given in args. Choices are validated. */ | |
3256 | while (1) | |
14f9c5c9 | 3257 | { |
de93309a SM |
3258 | char *args2; |
3259 | int choice, j; | |
76a01679 | 3260 | |
de93309a SM |
3261 | args = skip_spaces (args); |
3262 | if (*args == '\0' && n_chosen == 0) | |
3263 | error_no_arg (_("one or more choice numbers")); | |
3264 | else if (*args == '\0') | |
3265 | break; | |
76a01679 | 3266 | |
de93309a SM |
3267 | choice = strtol (args, &args2, 10); |
3268 | if (args == args2 || choice < 0 | |
3269 | || choice > n_choices + first_choice - 1) | |
3270 | error (_("Argument must be choice number")); | |
3271 | args = args2; | |
76a01679 | 3272 | |
de93309a SM |
3273 | if (choice == 0) |
3274 | error (_("cancelled")); | |
76a01679 | 3275 | |
de93309a SM |
3276 | if (choice < first_choice) |
3277 | { | |
3278 | n_chosen = n_choices; | |
3279 | for (j = 0; j < n_choices; j += 1) | |
3280 | choices[j] = j; | |
3281 | break; | |
76a01679 | 3282 | } |
de93309a | 3283 | choice -= first_choice; |
76a01679 | 3284 | |
de93309a | 3285 | for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1) |
76a01679 | 3286 | { |
76a01679 | 3287 | } |
4c4b4cd2 | 3288 | |
de93309a | 3289 | if (j < 0 || choice != choices[j]) |
4c4b4cd2 | 3290 | { |
de93309a | 3291 | int k; |
4c4b4cd2 | 3292 | |
de93309a SM |
3293 | for (k = n_chosen - 1; k > j; k -= 1) |
3294 | choices[k + 1] = choices[k]; | |
3295 | choices[j + 1] = choice; | |
3296 | n_chosen += 1; | |
4c4b4cd2 | 3297 | } |
14f9c5c9 AS |
3298 | } |
3299 | ||
de93309a SM |
3300 | if (n_chosen > max_results) |
3301 | error (_("Select no more than %d of the above"), max_results); | |
3302 | ||
3303 | return n_chosen; | |
14f9c5c9 AS |
3304 | } |
3305 | ||
de93309a SM |
3306 | /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0 |
3307 | by asking the user (if necessary), returning the number selected, | |
3308 | and setting the first elements of SYMS items. Error if no symbols | |
3309 | selected. */ | |
3310 | ||
3311 | /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought | |
3312 | to be re-integrated one of these days. */ | |
14f9c5c9 AS |
3313 | |
3314 | static int | |
de93309a | 3315 | user_select_syms (struct block_symbol *syms, int nsyms, int max_results) |
14f9c5c9 | 3316 | { |
de93309a SM |
3317 | int i; |
3318 | int *chosen = XALLOCAVEC (int , nsyms); | |
3319 | int n_chosen; | |
3320 | int first_choice = (max_results == 1) ? 1 : 2; | |
3321 | const char *select_mode = multiple_symbols_select_mode (); | |
14f9c5c9 | 3322 | |
de93309a SM |
3323 | if (max_results < 1) |
3324 | error (_("Request to select 0 symbols!")); | |
3325 | if (nsyms <= 1) | |
3326 | return nsyms; | |
14f9c5c9 | 3327 | |
de93309a SM |
3328 | if (select_mode == multiple_symbols_cancel) |
3329 | error (_("\ | |
3330 | canceled because the command is ambiguous\n\ | |
3331 | See set/show multiple-symbol.")); | |
14f9c5c9 | 3332 | |
de93309a SM |
3333 | /* If select_mode is "all", then return all possible symbols. |
3334 | Only do that if more than one symbol can be selected, of course. | |
3335 | Otherwise, display the menu as usual. */ | |
3336 | if (select_mode == multiple_symbols_all && max_results > 1) | |
3337 | return nsyms; | |
14f9c5c9 | 3338 | |
de93309a SM |
3339 | printf_filtered (_("[0] cancel\n")); |
3340 | if (max_results > 1) | |
3341 | printf_filtered (_("[1] all\n")); | |
14f9c5c9 | 3342 | |
de93309a | 3343 | sort_choices (syms, nsyms); |
14f9c5c9 | 3344 | |
de93309a SM |
3345 | for (i = 0; i < nsyms; i += 1) |
3346 | { | |
3347 | if (syms[i].symbol == NULL) | |
3348 | continue; | |
14f9c5c9 | 3349 | |
de93309a SM |
3350 | if (SYMBOL_CLASS (syms[i].symbol) == LOC_BLOCK) |
3351 | { | |
3352 | struct symtab_and_line sal = | |
3353 | find_function_start_sal (syms[i].symbol, 1); | |
14f9c5c9 | 3354 | |
de93309a SM |
3355 | printf_filtered ("[%d] ", i + first_choice); |
3356 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3357 | &type_print_raw_options); | |
3358 | if (sal.symtab == NULL) | |
3359 | printf_filtered (_(" at %p[<no source file available>%p]:%d\n"), | |
3360 | metadata_style.style ().ptr (), nullptr, sal.line); | |
3361 | else | |
3362 | printf_filtered | |
3363 | (_(" at %ps:%d\n"), | |
3364 | styled_string (file_name_style.style (), | |
3365 | symtab_to_filename_for_display (sal.symtab)), | |
3366 | sal.line); | |
3367 | continue; | |
3368 | } | |
76a01679 JB |
3369 | else |
3370 | { | |
de93309a SM |
3371 | int is_enumeral = |
3372 | (SYMBOL_CLASS (syms[i].symbol) == LOC_CONST | |
3373 | && SYMBOL_TYPE (syms[i].symbol) != NULL | |
78134374 | 3374 | && SYMBOL_TYPE (syms[i].symbol)->code () == TYPE_CODE_ENUM); |
de93309a | 3375 | struct symtab *symtab = NULL; |
4c4b4cd2 | 3376 | |
de93309a SM |
3377 | if (SYMBOL_OBJFILE_OWNED (syms[i].symbol)) |
3378 | symtab = symbol_symtab (syms[i].symbol); | |
3379 | ||
3380 | if (SYMBOL_LINE (syms[i].symbol) != 0 && symtab != NULL) | |
3381 | { | |
3382 | printf_filtered ("[%d] ", i + first_choice); | |
3383 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3384 | &type_print_raw_options); | |
3385 | printf_filtered (_(" at %s:%d\n"), | |
3386 | symtab_to_filename_for_display (symtab), | |
3387 | SYMBOL_LINE (syms[i].symbol)); | |
3388 | } | |
3389 | else if (is_enumeral | |
7d93a1e0 | 3390 | && SYMBOL_TYPE (syms[i].symbol)->name () != NULL) |
de93309a SM |
3391 | { |
3392 | printf_filtered (("[%d] "), i + first_choice); | |
3393 | ada_print_type (SYMBOL_TYPE (syms[i].symbol), NULL, | |
3394 | gdb_stdout, -1, 0, &type_print_raw_options); | |
3395 | printf_filtered (_("'(%s) (enumeral)\n"), | |
987012b8 | 3396 | syms[i].symbol->print_name ()); |
de93309a SM |
3397 | } |
3398 | else | |
3399 | { | |
3400 | printf_filtered ("[%d] ", i + first_choice); | |
3401 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3402 | &type_print_raw_options); | |
3403 | ||
3404 | if (symtab != NULL) | |
3405 | printf_filtered (is_enumeral | |
3406 | ? _(" in %s (enumeral)\n") | |
3407 | : _(" at %s:?\n"), | |
3408 | symtab_to_filename_for_display (symtab)); | |
3409 | else | |
3410 | printf_filtered (is_enumeral | |
3411 | ? _(" (enumeral)\n") | |
3412 | : _(" at ?\n")); | |
3413 | } | |
76a01679 | 3414 | } |
14f9c5c9 | 3415 | } |
14f9c5c9 | 3416 | |
de93309a SM |
3417 | n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1, |
3418 | "overload-choice"); | |
14f9c5c9 | 3419 | |
de93309a SM |
3420 | for (i = 0; i < n_chosen; i += 1) |
3421 | syms[i] = syms[chosen[i]]; | |
14f9c5c9 | 3422 | |
de93309a SM |
3423 | return n_chosen; |
3424 | } | |
14f9c5c9 | 3425 | |
de93309a SM |
3426 | /* Same as evaluate_type (*EXP), but resolves ambiguous symbol |
3427 | references (marked by OP_VAR_VALUE nodes in which the symbol has an | |
3428 | undefined namespace) and converts operators that are | |
3429 | user-defined into appropriate function calls. If CONTEXT_TYPE is | |
3430 | non-null, it provides a preferred result type [at the moment, only | |
3431 | type void has any effect---causing procedures to be preferred over | |
3432 | functions in calls]. A null CONTEXT_TYPE indicates that a non-void | |
3433 | return type is preferred. May change (expand) *EXP. */ | |
14f9c5c9 | 3434 | |
de93309a SM |
3435 | static void |
3436 | resolve (expression_up *expp, int void_context_p, int parse_completion, | |
3437 | innermost_block_tracker *tracker) | |
3438 | { | |
3439 | struct type *context_type = NULL; | |
3440 | int pc = 0; | |
14f9c5c9 | 3441 | |
de93309a SM |
3442 | if (void_context_p) |
3443 | context_type = builtin_type ((*expp)->gdbarch)->builtin_void; | |
14f9c5c9 | 3444 | |
de93309a SM |
3445 | resolve_subexp (expp, &pc, 1, context_type, parse_completion, tracker); |
3446 | } | |
4c4b4cd2 | 3447 | |
de93309a SM |
3448 | /* Resolve the operator of the subexpression beginning at |
3449 | position *POS of *EXPP. "Resolving" consists of replacing | |
3450 | the symbols that have undefined namespaces in OP_VAR_VALUE nodes | |
3451 | with their resolutions, replacing built-in operators with | |
3452 | function calls to user-defined operators, where appropriate, and, | |
3453 | when DEPROCEDURE_P is non-zero, converting function-valued variables | |
3454 | into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions | |
3455 | are as in ada_resolve, above. */ | |
14f9c5c9 | 3456 | |
de93309a SM |
3457 | static struct value * |
3458 | resolve_subexp (expression_up *expp, int *pos, int deprocedure_p, | |
3459 | struct type *context_type, int parse_completion, | |
3460 | innermost_block_tracker *tracker) | |
14f9c5c9 | 3461 | { |
de93309a SM |
3462 | int pc = *pos; |
3463 | int i; | |
3464 | struct expression *exp; /* Convenience: == *expp. */ | |
3465 | enum exp_opcode op = (*expp)->elts[pc].opcode; | |
3466 | struct value **argvec; /* Vector of operand types (alloca'ed). */ | |
3467 | int nargs; /* Number of operands. */ | |
3468 | int oplen; | |
14f9c5c9 | 3469 | |
de93309a SM |
3470 | argvec = NULL; |
3471 | nargs = 0; | |
3472 | exp = expp->get (); | |
4c4b4cd2 | 3473 | |
de93309a SM |
3474 | /* Pass one: resolve operands, saving their types and updating *pos, |
3475 | if needed. */ | |
3476 | switch (op) | |
3477 | { | |
3478 | case OP_FUNCALL: | |
3479 | if (exp->elts[pc + 3].opcode == OP_VAR_VALUE | |
3480 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) | |
3481 | *pos += 7; | |
3482 | else | |
3483 | { | |
3484 | *pos += 3; | |
3485 | resolve_subexp (expp, pos, 0, NULL, parse_completion, tracker); | |
4c4b4cd2 | 3486 | } |
de93309a SM |
3487 | nargs = longest_to_int (exp->elts[pc + 1].longconst); |
3488 | break; | |
14f9c5c9 | 3489 | |
de93309a SM |
3490 | case UNOP_ADDR: |
3491 | *pos += 1; | |
3492 | resolve_subexp (expp, pos, 0, NULL, parse_completion, tracker); | |
3493 | break; | |
3494 | ||
3495 | case UNOP_QUAL: | |
3496 | *pos += 3; | |
3497 | resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type), | |
3498 | parse_completion, tracker); | |
3499 | break; | |
3500 | ||
3501 | case OP_ATR_MODULUS: | |
3502 | case OP_ATR_SIZE: | |
3503 | case OP_ATR_TAG: | |
3504 | case OP_ATR_FIRST: | |
3505 | case OP_ATR_LAST: | |
3506 | case OP_ATR_LENGTH: | |
3507 | case OP_ATR_POS: | |
3508 | case OP_ATR_VAL: | |
3509 | case OP_ATR_MIN: | |
3510 | case OP_ATR_MAX: | |
3511 | case TERNOP_IN_RANGE: | |
3512 | case BINOP_IN_BOUNDS: | |
3513 | case UNOP_IN_RANGE: | |
3514 | case OP_AGGREGATE: | |
3515 | case OP_OTHERS: | |
3516 | case OP_CHOICES: | |
3517 | case OP_POSITIONAL: | |
3518 | case OP_DISCRETE_RANGE: | |
3519 | case OP_NAME: | |
3520 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
3521 | *pos += oplen; | |
3522 | break; | |
3523 | ||
3524 | case BINOP_ASSIGN: | |
3525 | { | |
3526 | struct value *arg1; | |
3527 | ||
3528 | *pos += 1; | |
3529 | arg1 = resolve_subexp (expp, pos, 0, NULL, parse_completion, tracker); | |
3530 | if (arg1 == NULL) | |
3531 | resolve_subexp (expp, pos, 1, NULL, parse_completion, tracker); | |
3532 | else | |
3533 | resolve_subexp (expp, pos, 1, value_type (arg1), parse_completion, | |
3534 | tracker); | |
3535 | break; | |
3536 | } | |
3537 | ||
3538 | case UNOP_CAST: | |
3539 | *pos += 3; | |
3540 | nargs = 1; | |
3541 | break; | |
3542 | ||
3543 | case BINOP_ADD: | |
3544 | case BINOP_SUB: | |
3545 | case BINOP_MUL: | |
3546 | case BINOP_DIV: | |
3547 | case BINOP_REM: | |
3548 | case BINOP_MOD: | |
3549 | case BINOP_EXP: | |
3550 | case BINOP_CONCAT: | |
3551 | case BINOP_LOGICAL_AND: | |
3552 | case BINOP_LOGICAL_OR: | |
3553 | case BINOP_BITWISE_AND: | |
3554 | case BINOP_BITWISE_IOR: | |
3555 | case BINOP_BITWISE_XOR: | |
3556 | ||
3557 | case BINOP_EQUAL: | |
3558 | case BINOP_NOTEQUAL: | |
3559 | case BINOP_LESS: | |
3560 | case BINOP_GTR: | |
3561 | case BINOP_LEQ: | |
3562 | case BINOP_GEQ: | |
3563 | ||
3564 | case BINOP_REPEAT: | |
3565 | case BINOP_SUBSCRIPT: | |
3566 | case BINOP_COMMA: | |
3567 | *pos += 1; | |
3568 | nargs = 2; | |
3569 | break; | |
3570 | ||
3571 | case UNOP_NEG: | |
3572 | case UNOP_PLUS: | |
3573 | case UNOP_LOGICAL_NOT: | |
3574 | case UNOP_ABS: | |
3575 | case UNOP_IND: | |
3576 | *pos += 1; | |
3577 | nargs = 1; | |
3578 | break; | |
3579 | ||
3580 | case OP_LONG: | |
3581 | case OP_FLOAT: | |
3582 | case OP_VAR_VALUE: | |
3583 | case OP_VAR_MSYM_VALUE: | |
3584 | *pos += 4; | |
3585 | break; | |
3586 | ||
3587 | case OP_TYPE: | |
3588 | case OP_BOOL: | |
3589 | case OP_LAST: | |
3590 | case OP_INTERNALVAR: | |
3591 | *pos += 3; | |
3592 | break; | |
3593 | ||
3594 | case UNOP_MEMVAL: | |
3595 | *pos += 3; | |
3596 | nargs = 1; | |
3597 | break; | |
3598 | ||
3599 | case OP_REGISTER: | |
3600 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
3601 | break; | |
3602 | ||
3603 | case STRUCTOP_STRUCT: | |
3604 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
3605 | nargs = 1; | |
3606 | break; | |
3607 | ||
3608 | case TERNOP_SLICE: | |
3609 | *pos += 1; | |
3610 | nargs = 3; | |
3611 | break; | |
3612 | ||
3613 | case OP_STRING: | |
3614 | break; | |
3615 | ||
3616 | default: | |
3617 | error (_("Unexpected operator during name resolution")); | |
14f9c5c9 | 3618 | } |
14f9c5c9 | 3619 | |
de93309a SM |
3620 | argvec = XALLOCAVEC (struct value *, nargs + 1); |
3621 | for (i = 0; i < nargs; i += 1) | |
3622 | argvec[i] = resolve_subexp (expp, pos, 1, NULL, parse_completion, | |
3623 | tracker); | |
3624 | argvec[i] = NULL; | |
3625 | exp = expp->get (); | |
4c4b4cd2 | 3626 | |
de93309a SM |
3627 | /* Pass two: perform any resolution on principal operator. */ |
3628 | switch (op) | |
14f9c5c9 | 3629 | { |
de93309a SM |
3630 | default: |
3631 | break; | |
5b4ee69b | 3632 | |
de93309a SM |
3633 | case OP_VAR_VALUE: |
3634 | if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN) | |
4c4b4cd2 | 3635 | { |
de93309a SM |
3636 | std::vector<struct block_symbol> candidates; |
3637 | int n_candidates; | |
5b4ee69b | 3638 | |
de93309a | 3639 | n_candidates = |
987012b8 | 3640 | ada_lookup_symbol_list (exp->elts[pc + 2].symbol->linkage_name (), |
de93309a SM |
3641 | exp->elts[pc + 1].block, VAR_DOMAIN, |
3642 | &candidates); | |
d2e4a39e | 3643 | |
de93309a SM |
3644 | if (n_candidates > 1) |
3645 | { | |
3646 | /* Types tend to get re-introduced locally, so if there | |
3647 | are any local symbols that are not types, first filter | |
3648 | out all types. */ | |
3649 | int j; | |
3650 | for (j = 0; j < n_candidates; j += 1) | |
3651 | switch (SYMBOL_CLASS (candidates[j].symbol)) | |
3652 | { | |
3653 | case LOC_REGISTER: | |
3654 | case LOC_ARG: | |
3655 | case LOC_REF_ARG: | |
3656 | case LOC_REGPARM_ADDR: | |
3657 | case LOC_LOCAL: | |
3658 | case LOC_COMPUTED: | |
3659 | goto FoundNonType; | |
3660 | default: | |
3661 | break; | |
3662 | } | |
3663 | FoundNonType: | |
3664 | if (j < n_candidates) | |
3665 | { | |
3666 | j = 0; | |
3667 | while (j < n_candidates) | |
3668 | { | |
3669 | if (SYMBOL_CLASS (candidates[j].symbol) == LOC_TYPEDEF) | |
3670 | { | |
3671 | candidates[j] = candidates[n_candidates - 1]; | |
3672 | n_candidates -= 1; | |
3673 | } | |
3674 | else | |
3675 | j += 1; | |
3676 | } | |
3677 | } | |
3678 | } | |
4c4b4cd2 | 3679 | |
de93309a SM |
3680 | if (n_candidates == 0) |
3681 | error (_("No definition found for %s"), | |
987012b8 | 3682 | exp->elts[pc + 2].symbol->print_name ()); |
de93309a SM |
3683 | else if (n_candidates == 1) |
3684 | i = 0; | |
3685 | else if (deprocedure_p | |
3686 | && !is_nonfunction (candidates.data (), n_candidates)) | |
3687 | { | |
3688 | i = ada_resolve_function | |
3689 | (candidates.data (), n_candidates, NULL, 0, | |
987012b8 | 3690 | exp->elts[pc + 2].symbol->linkage_name (), |
de93309a SM |
3691 | context_type, parse_completion); |
3692 | if (i < 0) | |
3693 | error (_("Could not find a match for %s"), | |
987012b8 | 3694 | exp->elts[pc + 2].symbol->print_name ()); |
de93309a SM |
3695 | } |
3696 | else | |
3697 | { | |
3698 | printf_filtered (_("Multiple matches for %s\n"), | |
987012b8 | 3699 | exp->elts[pc + 2].symbol->print_name ()); |
de93309a SM |
3700 | user_select_syms (candidates.data (), n_candidates, 1); |
3701 | i = 0; | |
3702 | } | |
5b4ee69b | 3703 | |
de93309a SM |
3704 | exp->elts[pc + 1].block = candidates[i].block; |
3705 | exp->elts[pc + 2].symbol = candidates[i].symbol; | |
3706 | tracker->update (candidates[i]); | |
3707 | } | |
14f9c5c9 | 3708 | |
de93309a | 3709 | if (deprocedure_p |
78134374 | 3710 | && (SYMBOL_TYPE (exp->elts[pc + 2].symbol)->code () |
de93309a | 3711 | == TYPE_CODE_FUNC)) |
4c4b4cd2 | 3712 | { |
de93309a SM |
3713 | replace_operator_with_call (expp, pc, 0, 4, |
3714 | exp->elts[pc + 2].symbol, | |
3715 | exp->elts[pc + 1].block); | |
3716 | exp = expp->get (); | |
4c4b4cd2 | 3717 | } |
de93309a SM |
3718 | break; |
3719 | ||
3720 | case OP_FUNCALL: | |
3721 | { | |
3722 | if (exp->elts[pc + 3].opcode == OP_VAR_VALUE | |
3723 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) | |
3724 | { | |
3725 | std::vector<struct block_symbol> candidates; | |
3726 | int n_candidates; | |
3727 | ||
3728 | n_candidates = | |
987012b8 | 3729 | ada_lookup_symbol_list (exp->elts[pc + 5].symbol->linkage_name (), |
de93309a SM |
3730 | exp->elts[pc + 4].block, VAR_DOMAIN, |
3731 | &candidates); | |
14f9c5c9 | 3732 | |
de93309a SM |
3733 | if (n_candidates == 1) |
3734 | i = 0; | |
3735 | else | |
3736 | { | |
3737 | i = ada_resolve_function | |
3738 | (candidates.data (), n_candidates, | |
3739 | argvec, nargs, | |
987012b8 | 3740 | exp->elts[pc + 5].symbol->linkage_name (), |
de93309a SM |
3741 | context_type, parse_completion); |
3742 | if (i < 0) | |
3743 | error (_("Could not find a match for %s"), | |
987012b8 | 3744 | exp->elts[pc + 5].symbol->print_name ()); |
de93309a | 3745 | } |
d72413e6 | 3746 | |
de93309a SM |
3747 | exp->elts[pc + 4].block = candidates[i].block; |
3748 | exp->elts[pc + 5].symbol = candidates[i].symbol; | |
3749 | tracker->update (candidates[i]); | |
3750 | } | |
3751 | } | |
3752 | break; | |
3753 | case BINOP_ADD: | |
3754 | case BINOP_SUB: | |
3755 | case BINOP_MUL: | |
3756 | case BINOP_DIV: | |
3757 | case BINOP_REM: | |
3758 | case BINOP_MOD: | |
3759 | case BINOP_CONCAT: | |
3760 | case BINOP_BITWISE_AND: | |
3761 | case BINOP_BITWISE_IOR: | |
3762 | case BINOP_BITWISE_XOR: | |
3763 | case BINOP_EQUAL: | |
3764 | case BINOP_NOTEQUAL: | |
3765 | case BINOP_LESS: | |
3766 | case BINOP_GTR: | |
3767 | case BINOP_LEQ: | |
3768 | case BINOP_GEQ: | |
3769 | case BINOP_EXP: | |
3770 | case UNOP_NEG: | |
3771 | case UNOP_PLUS: | |
3772 | case UNOP_LOGICAL_NOT: | |
3773 | case UNOP_ABS: | |
3774 | if (possible_user_operator_p (op, argvec)) | |
3775 | { | |
3776 | std::vector<struct block_symbol> candidates; | |
3777 | int n_candidates; | |
d72413e6 | 3778 | |
de93309a SM |
3779 | n_candidates = |
3780 | ada_lookup_symbol_list (ada_decoded_op_name (op), | |
3781 | NULL, VAR_DOMAIN, | |
3782 | &candidates); | |
d72413e6 | 3783 | |
de93309a SM |
3784 | i = ada_resolve_function (candidates.data (), n_candidates, argvec, |
3785 | nargs, ada_decoded_op_name (op), NULL, | |
3786 | parse_completion); | |
3787 | if (i < 0) | |
3788 | break; | |
d72413e6 | 3789 | |
de93309a SM |
3790 | replace_operator_with_call (expp, pc, nargs, 1, |
3791 | candidates[i].symbol, | |
3792 | candidates[i].block); | |
3793 | exp = expp->get (); | |
3794 | } | |
3795 | break; | |
d72413e6 | 3796 | |
de93309a SM |
3797 | case OP_TYPE: |
3798 | case OP_REGISTER: | |
3799 | return NULL; | |
d72413e6 | 3800 | } |
d72413e6 | 3801 | |
de93309a SM |
3802 | *pos = pc; |
3803 | if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE) | |
3804 | return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS, | |
3805 | exp->elts[pc + 1].objfile, | |
3806 | exp->elts[pc + 2].msymbol); | |
3807 | else | |
3808 | return evaluate_subexp_type (exp, pos); | |
3809 | } | |
14f9c5c9 | 3810 | |
de93309a SM |
3811 | /* Return non-zero if formal type FTYPE matches actual type ATYPE. If |
3812 | MAY_DEREF is non-zero, the formal may be a pointer and the actual | |
3813 | a non-pointer. */ | |
3814 | /* The term "match" here is rather loose. The match is heuristic and | |
3815 | liberal. */ | |
14f9c5c9 | 3816 | |
de93309a SM |
3817 | static int |
3818 | ada_type_match (struct type *ftype, struct type *atype, int may_deref) | |
14f9c5c9 | 3819 | { |
de93309a SM |
3820 | ftype = ada_check_typedef (ftype); |
3821 | atype = ada_check_typedef (atype); | |
14f9c5c9 | 3822 | |
78134374 | 3823 | if (ftype->code () == TYPE_CODE_REF) |
de93309a | 3824 | ftype = TYPE_TARGET_TYPE (ftype); |
78134374 | 3825 | if (atype->code () == TYPE_CODE_REF) |
de93309a | 3826 | atype = TYPE_TARGET_TYPE (atype); |
14f9c5c9 | 3827 | |
78134374 | 3828 | switch (ftype->code ()) |
14f9c5c9 | 3829 | { |
de93309a | 3830 | default: |
78134374 | 3831 | return ftype->code () == atype->code (); |
de93309a | 3832 | case TYPE_CODE_PTR: |
78134374 | 3833 | if (atype->code () == TYPE_CODE_PTR) |
de93309a SM |
3834 | return ada_type_match (TYPE_TARGET_TYPE (ftype), |
3835 | TYPE_TARGET_TYPE (atype), 0); | |
d2e4a39e | 3836 | else |
de93309a SM |
3837 | return (may_deref |
3838 | && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0)); | |
3839 | case TYPE_CODE_INT: | |
3840 | case TYPE_CODE_ENUM: | |
3841 | case TYPE_CODE_RANGE: | |
78134374 | 3842 | switch (atype->code ()) |
4c4b4cd2 | 3843 | { |
de93309a SM |
3844 | case TYPE_CODE_INT: |
3845 | case TYPE_CODE_ENUM: | |
3846 | case TYPE_CODE_RANGE: | |
3847 | return 1; | |
3848 | default: | |
3849 | return 0; | |
4c4b4cd2 | 3850 | } |
d2e4a39e | 3851 | |
de93309a | 3852 | case TYPE_CODE_ARRAY: |
78134374 | 3853 | return (atype->code () == TYPE_CODE_ARRAY |
de93309a | 3854 | || ada_is_array_descriptor_type (atype)); |
14f9c5c9 | 3855 | |
de93309a SM |
3856 | case TYPE_CODE_STRUCT: |
3857 | if (ada_is_array_descriptor_type (ftype)) | |
78134374 | 3858 | return (atype->code () == TYPE_CODE_ARRAY |
de93309a SM |
3859 | || ada_is_array_descriptor_type (atype)); |
3860 | else | |
78134374 | 3861 | return (atype->code () == TYPE_CODE_STRUCT |
de93309a | 3862 | && !ada_is_array_descriptor_type (atype)); |
14f9c5c9 | 3863 | |
de93309a SM |
3864 | case TYPE_CODE_UNION: |
3865 | case TYPE_CODE_FLT: | |
78134374 | 3866 | return (atype->code () == ftype->code ()); |
de93309a | 3867 | } |
14f9c5c9 AS |
3868 | } |
3869 | ||
de93309a SM |
3870 | /* Return non-zero if the formals of FUNC "sufficiently match" the |
3871 | vector of actual argument types ACTUALS of size N_ACTUALS. FUNC | |
3872 | may also be an enumeral, in which case it is treated as a 0- | |
3873 | argument function. */ | |
14f9c5c9 | 3874 | |
de93309a SM |
3875 | static int |
3876 | ada_args_match (struct symbol *func, struct value **actuals, int n_actuals) | |
3877 | { | |
3878 | int i; | |
3879 | struct type *func_type = SYMBOL_TYPE (func); | |
14f9c5c9 | 3880 | |
de93309a | 3881 | if (SYMBOL_CLASS (func) == LOC_CONST |
78134374 | 3882 | && func_type->code () == TYPE_CODE_ENUM) |
de93309a | 3883 | return (n_actuals == 0); |
78134374 | 3884 | else if (func_type == NULL || func_type->code () != TYPE_CODE_FUNC) |
de93309a | 3885 | return 0; |
14f9c5c9 | 3886 | |
1f704f76 | 3887 | if (func_type->num_fields () != n_actuals) |
de93309a | 3888 | return 0; |
14f9c5c9 | 3889 | |
de93309a SM |
3890 | for (i = 0; i < n_actuals; i += 1) |
3891 | { | |
3892 | if (actuals[i] == NULL) | |
3893 | return 0; | |
3894 | else | |
3895 | { | |
3896 | struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, | |
3897 | i)); | |
3898 | struct type *atype = ada_check_typedef (value_type (actuals[i])); | |
14f9c5c9 | 3899 | |
de93309a SM |
3900 | if (!ada_type_match (ftype, atype, 1)) |
3901 | return 0; | |
3902 | } | |
3903 | } | |
3904 | return 1; | |
3905 | } | |
d2e4a39e | 3906 | |
de93309a SM |
3907 | /* False iff function type FUNC_TYPE definitely does not produce a value |
3908 | compatible with type CONTEXT_TYPE. Conservatively returns 1 if | |
3909 | FUNC_TYPE is not a valid function type with a non-null return type | |
3910 | or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */ | |
14f9c5c9 | 3911 | |
de93309a SM |
3912 | static int |
3913 | return_match (struct type *func_type, struct type *context_type) | |
3914 | { | |
3915 | struct type *return_type; | |
d2e4a39e | 3916 | |
de93309a SM |
3917 | if (func_type == NULL) |
3918 | return 1; | |
14f9c5c9 | 3919 | |
78134374 | 3920 | if (func_type->code () == TYPE_CODE_FUNC) |
de93309a SM |
3921 | return_type = get_base_type (TYPE_TARGET_TYPE (func_type)); |
3922 | else | |
3923 | return_type = get_base_type (func_type); | |
3924 | if (return_type == NULL) | |
3925 | return 1; | |
76a01679 | 3926 | |
de93309a | 3927 | context_type = get_base_type (context_type); |
14f9c5c9 | 3928 | |
78134374 | 3929 | if (return_type->code () == TYPE_CODE_ENUM) |
de93309a SM |
3930 | return context_type == NULL || return_type == context_type; |
3931 | else if (context_type == NULL) | |
78134374 | 3932 | return return_type->code () != TYPE_CODE_VOID; |
de93309a | 3933 | else |
78134374 | 3934 | return return_type->code () == context_type->code (); |
de93309a | 3935 | } |
14f9c5c9 | 3936 | |
14f9c5c9 | 3937 | |
de93309a SM |
3938 | /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the |
3939 | function (if any) that matches the types of the NARGS arguments in | |
3940 | ARGS. If CONTEXT_TYPE is non-null and there is at least one match | |
3941 | that returns that type, then eliminate matches that don't. If | |
3942 | CONTEXT_TYPE is void and there is at least one match that does not | |
3943 | return void, eliminate all matches that do. | |
14f9c5c9 | 3944 | |
de93309a SM |
3945 | Asks the user if there is more than one match remaining. Returns -1 |
3946 | if there is no such symbol or none is selected. NAME is used | |
3947 | solely for messages. May re-arrange and modify SYMS in | |
3948 | the process; the index returned is for the modified vector. */ | |
14f9c5c9 | 3949 | |
de93309a SM |
3950 | static int |
3951 | ada_resolve_function (struct block_symbol syms[], | |
3952 | int nsyms, struct value **args, int nargs, | |
3953 | const char *name, struct type *context_type, | |
3954 | int parse_completion) | |
3955 | { | |
3956 | int fallback; | |
3957 | int k; | |
3958 | int m; /* Number of hits */ | |
14f9c5c9 | 3959 | |
de93309a SM |
3960 | m = 0; |
3961 | /* In the first pass of the loop, we only accept functions matching | |
3962 | context_type. If none are found, we add a second pass of the loop | |
3963 | where every function is accepted. */ | |
3964 | for (fallback = 0; m == 0 && fallback < 2; fallback++) | |
3965 | { | |
3966 | for (k = 0; k < nsyms; k += 1) | |
4c4b4cd2 | 3967 | { |
de93309a | 3968 | struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].symbol)); |
5b4ee69b | 3969 | |
de93309a SM |
3970 | if (ada_args_match (syms[k].symbol, args, nargs) |
3971 | && (fallback || return_match (type, context_type))) | |
3972 | { | |
3973 | syms[m] = syms[k]; | |
3974 | m += 1; | |
3975 | } | |
4c4b4cd2 | 3976 | } |
14f9c5c9 AS |
3977 | } |
3978 | ||
de93309a SM |
3979 | /* If we got multiple matches, ask the user which one to use. Don't do this |
3980 | interactive thing during completion, though, as the purpose of the | |
3981 | completion is providing a list of all possible matches. Prompting the | |
3982 | user to filter it down would be completely unexpected in this case. */ | |
3983 | if (m == 0) | |
3984 | return -1; | |
3985 | else if (m > 1 && !parse_completion) | |
3986 | { | |
3987 | printf_filtered (_("Multiple matches for %s\n"), name); | |
3988 | user_select_syms (syms, m, 1); | |
3989 | return 0; | |
3990 | } | |
3991 | return 0; | |
14f9c5c9 AS |
3992 | } |
3993 | ||
4c4b4cd2 PH |
3994 | /* Replace the operator of length OPLEN at position PC in *EXPP with a call |
3995 | on the function identified by SYM and BLOCK, and taking NARGS | |
3996 | arguments. Update *EXPP as needed to hold more space. */ | |
14f9c5c9 AS |
3997 | |
3998 | static void | |
e9d9f57e | 3999 | replace_operator_with_call (expression_up *expp, int pc, int nargs, |
4c4b4cd2 | 4000 | int oplen, struct symbol *sym, |
270140bd | 4001 | const struct block *block) |
14f9c5c9 AS |
4002 | { |
4003 | /* A new expression, with 6 more elements (3 for funcall, 4 for function | |
4c4b4cd2 | 4004 | symbol, -oplen for operator being replaced). */ |
d2e4a39e | 4005 | struct expression *newexp = (struct expression *) |
8c1a34e7 | 4006 | xzalloc (sizeof (struct expression) |
4c4b4cd2 | 4007 | + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen)); |
e9d9f57e | 4008 | struct expression *exp = expp->get (); |
14f9c5c9 AS |
4009 | |
4010 | newexp->nelts = exp->nelts + 7 - oplen; | |
4011 | newexp->language_defn = exp->language_defn; | |
3489610d | 4012 | newexp->gdbarch = exp->gdbarch; |
14f9c5c9 | 4013 | memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc)); |
d2e4a39e | 4014 | memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen, |
4c4b4cd2 | 4015 | EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen)); |
14f9c5c9 AS |
4016 | |
4017 | newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL; | |
4018 | newexp->elts[pc + 1].longconst = (LONGEST) nargs; | |
4019 | ||
4020 | newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE; | |
4021 | newexp->elts[pc + 4].block = block; | |
4022 | newexp->elts[pc + 5].symbol = sym; | |
4023 | ||
e9d9f57e | 4024 | expp->reset (newexp); |
d2e4a39e | 4025 | } |
14f9c5c9 AS |
4026 | |
4027 | /* Type-class predicates */ | |
4028 | ||
4c4b4cd2 PH |
4029 | /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type), |
4030 | or FLOAT). */ | |
14f9c5c9 AS |
4031 | |
4032 | static int | |
d2e4a39e | 4033 | numeric_type_p (struct type *type) |
14f9c5c9 AS |
4034 | { |
4035 | if (type == NULL) | |
4036 | return 0; | |
d2e4a39e AS |
4037 | else |
4038 | { | |
78134374 | 4039 | switch (type->code ()) |
4c4b4cd2 PH |
4040 | { |
4041 | case TYPE_CODE_INT: | |
4042 | case TYPE_CODE_FLT: | |
4043 | return 1; | |
4044 | case TYPE_CODE_RANGE: | |
4045 | return (type == TYPE_TARGET_TYPE (type) | |
4046 | || numeric_type_p (TYPE_TARGET_TYPE (type))); | |
4047 | default: | |
4048 | return 0; | |
4049 | } | |
d2e4a39e | 4050 | } |
14f9c5c9 AS |
4051 | } |
4052 | ||
4c4b4cd2 | 4053 | /* True iff TYPE is integral (an INT or RANGE of INTs). */ |
14f9c5c9 AS |
4054 | |
4055 | static int | |
d2e4a39e | 4056 | integer_type_p (struct type *type) |
14f9c5c9 AS |
4057 | { |
4058 | if (type == NULL) | |
4059 | return 0; | |
d2e4a39e AS |
4060 | else |
4061 | { | |
78134374 | 4062 | switch (type->code ()) |
4c4b4cd2 PH |
4063 | { |
4064 | case TYPE_CODE_INT: | |
4065 | return 1; | |
4066 | case TYPE_CODE_RANGE: | |
4067 | return (type == TYPE_TARGET_TYPE (type) | |
4068 | || integer_type_p (TYPE_TARGET_TYPE (type))); | |
4069 | default: | |
4070 | return 0; | |
4071 | } | |
d2e4a39e | 4072 | } |
14f9c5c9 AS |
4073 | } |
4074 | ||
4c4b4cd2 | 4075 | /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */ |
14f9c5c9 AS |
4076 | |
4077 | static int | |
d2e4a39e | 4078 | scalar_type_p (struct type *type) |
14f9c5c9 AS |
4079 | { |
4080 | if (type == NULL) | |
4081 | return 0; | |
d2e4a39e AS |
4082 | else |
4083 | { | |
78134374 | 4084 | switch (type->code ()) |
4c4b4cd2 PH |
4085 | { |
4086 | case TYPE_CODE_INT: | |
4087 | case TYPE_CODE_RANGE: | |
4088 | case TYPE_CODE_ENUM: | |
4089 | case TYPE_CODE_FLT: | |
4090 | return 1; | |
4091 | default: | |
4092 | return 0; | |
4093 | } | |
d2e4a39e | 4094 | } |
14f9c5c9 AS |
4095 | } |
4096 | ||
4c4b4cd2 | 4097 | /* True iff TYPE is discrete (INT, RANGE, ENUM). */ |
14f9c5c9 AS |
4098 | |
4099 | static int | |
d2e4a39e | 4100 | discrete_type_p (struct type *type) |
14f9c5c9 AS |
4101 | { |
4102 | if (type == NULL) | |
4103 | return 0; | |
d2e4a39e AS |
4104 | else |
4105 | { | |
78134374 | 4106 | switch (type->code ()) |
4c4b4cd2 PH |
4107 | { |
4108 | case TYPE_CODE_INT: | |
4109 | case TYPE_CODE_RANGE: | |
4110 | case TYPE_CODE_ENUM: | |
872f0337 | 4111 | case TYPE_CODE_BOOL: |
4c4b4cd2 PH |
4112 | return 1; |
4113 | default: | |
4114 | return 0; | |
4115 | } | |
d2e4a39e | 4116 | } |
14f9c5c9 AS |
4117 | } |
4118 | ||
4c4b4cd2 PH |
4119 | /* Returns non-zero if OP with operands in the vector ARGS could be |
4120 | a user-defined function. Errs on the side of pre-defined operators | |
4121 | (i.e., result 0). */ | |
14f9c5c9 AS |
4122 | |
4123 | static int | |
d2e4a39e | 4124 | possible_user_operator_p (enum exp_opcode op, struct value *args[]) |
14f9c5c9 | 4125 | { |
76a01679 | 4126 | struct type *type0 = |
df407dfe | 4127 | (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0])); |
d2e4a39e | 4128 | struct type *type1 = |
df407dfe | 4129 | (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1])); |
d2e4a39e | 4130 | |
4c4b4cd2 PH |
4131 | if (type0 == NULL) |
4132 | return 0; | |
4133 | ||
14f9c5c9 AS |
4134 | switch (op) |
4135 | { | |
4136 | default: | |
4137 | return 0; | |
4138 | ||
4139 | case BINOP_ADD: | |
4140 | case BINOP_SUB: | |
4141 | case BINOP_MUL: | |
4142 | case BINOP_DIV: | |
d2e4a39e | 4143 | return (!(numeric_type_p (type0) && numeric_type_p (type1))); |
14f9c5c9 AS |
4144 | |
4145 | case BINOP_REM: | |
4146 | case BINOP_MOD: | |
4147 | case BINOP_BITWISE_AND: | |
4148 | case BINOP_BITWISE_IOR: | |
4149 | case BINOP_BITWISE_XOR: | |
d2e4a39e | 4150 | return (!(integer_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
4151 | |
4152 | case BINOP_EQUAL: | |
4153 | case BINOP_NOTEQUAL: | |
4154 | case BINOP_LESS: | |
4155 | case BINOP_GTR: | |
4156 | case BINOP_LEQ: | |
4157 | case BINOP_GEQ: | |
d2e4a39e | 4158 | return (!(scalar_type_p (type0) && scalar_type_p (type1))); |
14f9c5c9 AS |
4159 | |
4160 | case BINOP_CONCAT: | |
ee90b9ab | 4161 | return !ada_is_array_type (type0) || !ada_is_array_type (type1); |
14f9c5c9 AS |
4162 | |
4163 | case BINOP_EXP: | |
d2e4a39e | 4164 | return (!(numeric_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
4165 | |
4166 | case UNOP_NEG: | |
4167 | case UNOP_PLUS: | |
4168 | case UNOP_LOGICAL_NOT: | |
d2e4a39e AS |
4169 | case UNOP_ABS: |
4170 | return (!numeric_type_p (type0)); | |
14f9c5c9 AS |
4171 | |
4172 | } | |
4173 | } | |
4174 | \f | |
4c4b4cd2 | 4175 | /* Renaming */ |
14f9c5c9 | 4176 | |
aeb5907d JB |
4177 | /* NOTES: |
4178 | ||
4179 | 1. In the following, we assume that a renaming type's name may | |
4180 | have an ___XD suffix. It would be nice if this went away at some | |
4181 | point. | |
4182 | 2. We handle both the (old) purely type-based representation of | |
4183 | renamings and the (new) variable-based encoding. At some point, | |
4184 | it is devoutly to be hoped that the former goes away | |
4185 | (FIXME: hilfinger-2007-07-09). | |
4186 | 3. Subprogram renamings are not implemented, although the XRS | |
4187 | suffix is recognized (FIXME: hilfinger-2007-07-09). */ | |
4188 | ||
4189 | /* If SYM encodes a renaming, | |
4190 | ||
4191 | <renaming> renames <renamed entity>, | |
4192 | ||
4193 | sets *LEN to the length of the renamed entity's name, | |
4194 | *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to | |
4195 | the string describing the subcomponent selected from the renamed | |
0963b4bd | 4196 | entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming |
aeb5907d JB |
4197 | (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR |
4198 | are undefined). Otherwise, returns a value indicating the category | |
4199 | of entity renamed: an object (ADA_OBJECT_RENAMING), exception | |
4200 | (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or | |
4201 | subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the | |
4202 | strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be | |
4203 | deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR | |
4204 | may be NULL, in which case they are not assigned. | |
4205 | ||
4206 | [Currently, however, GCC does not generate subprogram renamings.] */ | |
4207 | ||
4208 | enum ada_renaming_category | |
4209 | ada_parse_renaming (struct symbol *sym, | |
4210 | const char **renamed_entity, int *len, | |
4211 | const char **renaming_expr) | |
4212 | { | |
4213 | enum ada_renaming_category kind; | |
4214 | const char *info; | |
4215 | const char *suffix; | |
4216 | ||
4217 | if (sym == NULL) | |
4218 | return ADA_NOT_RENAMING; | |
4219 | switch (SYMBOL_CLASS (sym)) | |
14f9c5c9 | 4220 | { |
aeb5907d JB |
4221 | default: |
4222 | return ADA_NOT_RENAMING; | |
aeb5907d JB |
4223 | case LOC_LOCAL: |
4224 | case LOC_STATIC: | |
4225 | case LOC_COMPUTED: | |
4226 | case LOC_OPTIMIZED_OUT: | |
987012b8 | 4227 | info = strstr (sym->linkage_name (), "___XR"); |
aeb5907d JB |
4228 | if (info == NULL) |
4229 | return ADA_NOT_RENAMING; | |
4230 | switch (info[5]) | |
4231 | { | |
4232 | case '_': | |
4233 | kind = ADA_OBJECT_RENAMING; | |
4234 | info += 6; | |
4235 | break; | |
4236 | case 'E': | |
4237 | kind = ADA_EXCEPTION_RENAMING; | |
4238 | info += 7; | |
4239 | break; | |
4240 | case 'P': | |
4241 | kind = ADA_PACKAGE_RENAMING; | |
4242 | info += 7; | |
4243 | break; | |
4244 | case 'S': | |
4245 | kind = ADA_SUBPROGRAM_RENAMING; | |
4246 | info += 7; | |
4247 | break; | |
4248 | default: | |
4249 | return ADA_NOT_RENAMING; | |
4250 | } | |
14f9c5c9 | 4251 | } |
4c4b4cd2 | 4252 | |
de93309a SM |
4253 | if (renamed_entity != NULL) |
4254 | *renamed_entity = info; | |
4255 | suffix = strstr (info, "___XE"); | |
4256 | if (suffix == NULL || suffix == info) | |
4257 | return ADA_NOT_RENAMING; | |
4258 | if (len != NULL) | |
4259 | *len = strlen (info) - strlen (suffix); | |
4260 | suffix += 5; | |
4261 | if (renaming_expr != NULL) | |
4262 | *renaming_expr = suffix; | |
4263 | return kind; | |
4264 | } | |
4265 | ||
4266 | /* Compute the value of the given RENAMING_SYM, which is expected to | |
4267 | be a symbol encoding a renaming expression. BLOCK is the block | |
4268 | used to evaluate the renaming. */ | |
4269 | ||
4270 | static struct value * | |
4271 | ada_read_renaming_var_value (struct symbol *renaming_sym, | |
4272 | const struct block *block) | |
4273 | { | |
4274 | const char *sym_name; | |
4275 | ||
987012b8 | 4276 | sym_name = renaming_sym->linkage_name (); |
de93309a SM |
4277 | expression_up expr = parse_exp_1 (&sym_name, 0, block, 0); |
4278 | return evaluate_expression (expr.get ()); | |
4279 | } | |
4280 | \f | |
4281 | ||
4282 | /* Evaluation: Function Calls */ | |
4283 | ||
4284 | /* Return an lvalue containing the value VAL. This is the identity on | |
4285 | lvalues, and otherwise has the side-effect of allocating memory | |
4286 | in the inferior where a copy of the value contents is copied. */ | |
4287 | ||
4288 | static struct value * | |
4289 | ensure_lval (struct value *val) | |
4290 | { | |
4291 | if (VALUE_LVAL (val) == not_lval | |
4292 | || VALUE_LVAL (val) == lval_internalvar) | |
4293 | { | |
4294 | int len = TYPE_LENGTH (ada_check_typedef (value_type (val))); | |
4295 | const CORE_ADDR addr = | |
4296 | value_as_long (value_allocate_space_in_inferior (len)); | |
4297 | ||
4298 | VALUE_LVAL (val) = lval_memory; | |
4299 | set_value_address (val, addr); | |
4300 | write_memory (addr, value_contents (val), len); | |
4301 | } | |
4302 | ||
4303 | return val; | |
4304 | } | |
4305 | ||
4306 | /* Given ARG, a value of type (pointer or reference to a)* | |
4307 | structure/union, extract the component named NAME from the ultimate | |
4308 | target structure/union and return it as a value with its | |
4309 | appropriate type. | |
4310 | ||
4311 | The routine searches for NAME among all members of the structure itself | |
4312 | and (recursively) among all members of any wrapper members | |
4313 | (e.g., '_parent'). | |
4314 | ||
4315 | If NO_ERR, then simply return NULL in case of error, rather than | |
4316 | calling error. */ | |
4317 | ||
4318 | static struct value * | |
4319 | ada_value_struct_elt (struct value *arg, const char *name, int no_err) | |
4320 | { | |
4321 | struct type *t, *t1; | |
4322 | struct value *v; | |
4323 | int check_tag; | |
4324 | ||
4325 | v = NULL; | |
4326 | t1 = t = ada_check_typedef (value_type (arg)); | |
78134374 | 4327 | if (t->code () == TYPE_CODE_REF) |
de93309a SM |
4328 | { |
4329 | t1 = TYPE_TARGET_TYPE (t); | |
4330 | if (t1 == NULL) | |
4331 | goto BadValue; | |
4332 | t1 = ada_check_typedef (t1); | |
78134374 | 4333 | if (t1->code () == TYPE_CODE_PTR) |
de93309a SM |
4334 | { |
4335 | arg = coerce_ref (arg); | |
4336 | t = t1; | |
4337 | } | |
4338 | } | |
4339 | ||
78134374 | 4340 | while (t->code () == TYPE_CODE_PTR) |
de93309a SM |
4341 | { |
4342 | t1 = TYPE_TARGET_TYPE (t); | |
4343 | if (t1 == NULL) | |
4344 | goto BadValue; | |
4345 | t1 = ada_check_typedef (t1); | |
78134374 | 4346 | if (t1->code () == TYPE_CODE_PTR) |
de93309a SM |
4347 | { |
4348 | arg = value_ind (arg); | |
4349 | t = t1; | |
4350 | } | |
4351 | else | |
4352 | break; | |
4353 | } | |
aeb5907d | 4354 | |
78134374 | 4355 | if (t1->code () != TYPE_CODE_STRUCT && t1->code () != TYPE_CODE_UNION) |
de93309a | 4356 | goto BadValue; |
52ce6436 | 4357 | |
de93309a SM |
4358 | if (t1 == t) |
4359 | v = ada_search_struct_field (name, arg, 0, t); | |
4360 | else | |
4361 | { | |
4362 | int bit_offset, bit_size, byte_offset; | |
4363 | struct type *field_type; | |
4364 | CORE_ADDR address; | |
a5ee536b | 4365 | |
78134374 | 4366 | if (t->code () == TYPE_CODE_PTR) |
de93309a SM |
4367 | address = value_address (ada_value_ind (arg)); |
4368 | else | |
4369 | address = value_address (ada_coerce_ref (arg)); | |
d2e4a39e | 4370 | |
de93309a SM |
4371 | /* Check to see if this is a tagged type. We also need to handle |
4372 | the case where the type is a reference to a tagged type, but | |
4373 | we have to be careful to exclude pointers to tagged types. | |
4374 | The latter should be shown as usual (as a pointer), whereas | |
4375 | a reference should mostly be transparent to the user. */ | |
14f9c5c9 | 4376 | |
de93309a | 4377 | if (ada_is_tagged_type (t1, 0) |
78134374 | 4378 | || (t1->code () == TYPE_CODE_REF |
de93309a SM |
4379 | && ada_is_tagged_type (TYPE_TARGET_TYPE (t1), 0))) |
4380 | { | |
4381 | /* We first try to find the searched field in the current type. | |
4382 | If not found then let's look in the fixed type. */ | |
14f9c5c9 | 4383 | |
de93309a SM |
4384 | if (!find_struct_field (name, t1, 0, |
4385 | &field_type, &byte_offset, &bit_offset, | |
4386 | &bit_size, NULL)) | |
4387 | check_tag = 1; | |
4388 | else | |
4389 | check_tag = 0; | |
4390 | } | |
4391 | else | |
4392 | check_tag = 0; | |
c3e5cd34 | 4393 | |
de93309a SM |
4394 | /* Convert to fixed type in all cases, so that we have proper |
4395 | offsets to each field in unconstrained record types. */ | |
4396 | t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, | |
4397 | address, NULL, check_tag); | |
4398 | ||
4399 | if (find_struct_field (name, t1, 0, | |
4400 | &field_type, &byte_offset, &bit_offset, | |
4401 | &bit_size, NULL)) | |
4402 | { | |
4403 | if (bit_size != 0) | |
4404 | { | |
78134374 | 4405 | if (t->code () == TYPE_CODE_REF) |
de93309a SM |
4406 | arg = ada_coerce_ref (arg); |
4407 | else | |
4408 | arg = ada_value_ind (arg); | |
4409 | v = ada_value_primitive_packed_val (arg, NULL, byte_offset, | |
4410 | bit_offset, bit_size, | |
4411 | field_type); | |
4412 | } | |
4413 | else | |
4414 | v = value_at_lazy (field_type, address + byte_offset); | |
4415 | } | |
c3e5cd34 | 4416 | } |
14f9c5c9 | 4417 | |
de93309a SM |
4418 | if (v != NULL || no_err) |
4419 | return v; | |
4420 | else | |
4421 | error (_("There is no member named %s."), name); | |
4422 | ||
4423 | BadValue: | |
4424 | if (no_err) | |
4425 | return NULL; | |
4426 | else | |
4427 | error (_("Attempt to extract a component of " | |
4428 | "a value that is not a record.")); | |
14f9c5c9 AS |
4429 | } |
4430 | ||
4431 | /* Return the value ACTUAL, converted to be an appropriate value for a | |
4432 | formal of type FORMAL_TYPE. Use *SP as a stack pointer for | |
4433 | allocating any necessary descriptors (fat pointers), or copies of | |
4c4b4cd2 | 4434 | values not residing in memory, updating it as needed. */ |
14f9c5c9 | 4435 | |
a93c0eb6 | 4436 | struct value * |
40bc484c | 4437 | ada_convert_actual (struct value *actual, struct type *formal_type0) |
14f9c5c9 | 4438 | { |
df407dfe | 4439 | struct type *actual_type = ada_check_typedef (value_type (actual)); |
61ee279c | 4440 | struct type *formal_type = ada_check_typedef (formal_type0); |
d2e4a39e | 4441 | struct type *formal_target = |
78134374 | 4442 | formal_type->code () == TYPE_CODE_PTR |
61ee279c | 4443 | ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type; |
d2e4a39e | 4444 | struct type *actual_target = |
78134374 | 4445 | actual_type->code () == TYPE_CODE_PTR |
61ee279c | 4446 | ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type; |
14f9c5c9 | 4447 | |
4c4b4cd2 | 4448 | if (ada_is_array_descriptor_type (formal_target) |
78134374 | 4449 | && actual_target->code () == TYPE_CODE_ARRAY) |
40bc484c | 4450 | return make_array_descriptor (formal_type, actual); |
78134374 SM |
4451 | else if (formal_type->code () == TYPE_CODE_PTR |
4452 | || formal_type->code () == TYPE_CODE_REF) | |
14f9c5c9 | 4453 | { |
a84a8a0d | 4454 | struct value *result; |
5b4ee69b | 4455 | |
78134374 | 4456 | if (formal_target->code () == TYPE_CODE_ARRAY |
4c4b4cd2 | 4457 | && ada_is_array_descriptor_type (actual_target)) |
a84a8a0d | 4458 | result = desc_data (actual); |
78134374 | 4459 | else if (formal_type->code () != TYPE_CODE_PTR) |
4c4b4cd2 PH |
4460 | { |
4461 | if (VALUE_LVAL (actual) != lval_memory) | |
4462 | { | |
4463 | struct value *val; | |
5b4ee69b | 4464 | |
df407dfe | 4465 | actual_type = ada_check_typedef (value_type (actual)); |
4c4b4cd2 | 4466 | val = allocate_value (actual_type); |
990a07ab | 4467 | memcpy ((char *) value_contents_raw (val), |
0fd88904 | 4468 | (char *) value_contents (actual), |
4c4b4cd2 | 4469 | TYPE_LENGTH (actual_type)); |
40bc484c | 4470 | actual = ensure_lval (val); |
4c4b4cd2 | 4471 | } |
a84a8a0d | 4472 | result = value_addr (actual); |
4c4b4cd2 | 4473 | } |
a84a8a0d JB |
4474 | else |
4475 | return actual; | |
b1af9e97 | 4476 | return value_cast_pointers (formal_type, result, 0); |
14f9c5c9 | 4477 | } |
78134374 | 4478 | else if (actual_type->code () == TYPE_CODE_PTR) |
14f9c5c9 | 4479 | return ada_value_ind (actual); |
8344af1e JB |
4480 | else if (ada_is_aligner_type (formal_type)) |
4481 | { | |
4482 | /* We need to turn this parameter into an aligner type | |
4483 | as well. */ | |
4484 | struct value *aligner = allocate_value (formal_type); | |
4485 | struct value *component = ada_value_struct_elt (aligner, "F", 0); | |
4486 | ||
4487 | value_assign_to_component (aligner, component, actual); | |
4488 | return aligner; | |
4489 | } | |
14f9c5c9 AS |
4490 | |
4491 | return actual; | |
4492 | } | |
4493 | ||
438c98a1 JB |
4494 | /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of |
4495 | type TYPE. This is usually an inefficient no-op except on some targets | |
4496 | (such as AVR) where the representation of a pointer and an address | |
4497 | differs. */ | |
4498 | ||
4499 | static CORE_ADDR | |
4500 | value_pointer (struct value *value, struct type *type) | |
4501 | { | |
4502 | struct gdbarch *gdbarch = get_type_arch (type); | |
4503 | unsigned len = TYPE_LENGTH (type); | |
224c3ddb | 4504 | gdb_byte *buf = (gdb_byte *) alloca (len); |
438c98a1 JB |
4505 | CORE_ADDR addr; |
4506 | ||
4507 | addr = value_address (value); | |
4508 | gdbarch_address_to_pointer (gdbarch, type, buf, addr); | |
34877895 | 4509 | addr = extract_unsigned_integer (buf, len, type_byte_order (type)); |
438c98a1 JB |
4510 | return addr; |
4511 | } | |
4512 | ||
14f9c5c9 | 4513 | |
4c4b4cd2 PH |
4514 | /* Push a descriptor of type TYPE for array value ARR on the stack at |
4515 | *SP, updating *SP to reflect the new descriptor. Return either | |
14f9c5c9 | 4516 | an lvalue representing the new descriptor, or (if TYPE is a pointer- |
4c4b4cd2 PH |
4517 | to-descriptor type rather than a descriptor type), a struct value * |
4518 | representing a pointer to this descriptor. */ | |
14f9c5c9 | 4519 | |
d2e4a39e | 4520 | static struct value * |
40bc484c | 4521 | make_array_descriptor (struct type *type, struct value *arr) |
14f9c5c9 | 4522 | { |
d2e4a39e AS |
4523 | struct type *bounds_type = desc_bounds_type (type); |
4524 | struct type *desc_type = desc_base_type (type); | |
4525 | struct value *descriptor = allocate_value (desc_type); | |
4526 | struct value *bounds = allocate_value (bounds_type); | |
14f9c5c9 | 4527 | int i; |
d2e4a39e | 4528 | |
0963b4bd MS |
4529 | for (i = ada_array_arity (ada_check_typedef (value_type (arr))); |
4530 | i > 0; i -= 1) | |
14f9c5c9 | 4531 | { |
19f220c3 JK |
4532 | modify_field (value_type (bounds), value_contents_writeable (bounds), |
4533 | ada_array_bound (arr, i, 0), | |
4534 | desc_bound_bitpos (bounds_type, i, 0), | |
4535 | desc_bound_bitsize (bounds_type, i, 0)); | |
4536 | modify_field (value_type (bounds), value_contents_writeable (bounds), | |
4537 | ada_array_bound (arr, i, 1), | |
4538 | desc_bound_bitpos (bounds_type, i, 1), | |
4539 | desc_bound_bitsize (bounds_type, i, 1)); | |
14f9c5c9 | 4540 | } |
d2e4a39e | 4541 | |
40bc484c | 4542 | bounds = ensure_lval (bounds); |
d2e4a39e | 4543 | |
19f220c3 JK |
4544 | modify_field (value_type (descriptor), |
4545 | value_contents_writeable (descriptor), | |
4546 | value_pointer (ensure_lval (arr), | |
4547 | TYPE_FIELD_TYPE (desc_type, 0)), | |
4548 | fat_pntr_data_bitpos (desc_type), | |
4549 | fat_pntr_data_bitsize (desc_type)); | |
4550 | ||
4551 | modify_field (value_type (descriptor), | |
4552 | value_contents_writeable (descriptor), | |
4553 | value_pointer (bounds, | |
4554 | TYPE_FIELD_TYPE (desc_type, 1)), | |
4555 | fat_pntr_bounds_bitpos (desc_type), | |
4556 | fat_pntr_bounds_bitsize (desc_type)); | |
14f9c5c9 | 4557 | |
40bc484c | 4558 | descriptor = ensure_lval (descriptor); |
14f9c5c9 | 4559 | |
78134374 | 4560 | if (type->code () == TYPE_CODE_PTR) |
14f9c5c9 AS |
4561 | return value_addr (descriptor); |
4562 | else | |
4563 | return descriptor; | |
4564 | } | |
14f9c5c9 | 4565 | \f |
3d9434b5 JB |
4566 | /* Symbol Cache Module */ |
4567 | ||
3d9434b5 | 4568 | /* Performance measurements made as of 2010-01-15 indicate that |
ee01b665 | 4569 | this cache does bring some noticeable improvements. Depending |
3d9434b5 JB |
4570 | on the type of entity being printed, the cache can make it as much |
4571 | as an order of magnitude faster than without it. | |
4572 | ||
4573 | The descriptive type DWARF extension has significantly reduced | |
4574 | the need for this cache, at least when DWARF is being used. However, | |
4575 | even in this case, some expensive name-based symbol searches are still | |
4576 | sometimes necessary - to find an XVZ variable, mostly. */ | |
4577 | ||
ee01b665 | 4578 | /* Initialize the contents of SYM_CACHE. */ |
3d9434b5 | 4579 | |
ee01b665 JB |
4580 | static void |
4581 | ada_init_symbol_cache (struct ada_symbol_cache *sym_cache) | |
4582 | { | |
4583 | obstack_init (&sym_cache->cache_space); | |
4584 | memset (sym_cache->root, '\000', sizeof (sym_cache->root)); | |
4585 | } | |
3d9434b5 | 4586 | |
ee01b665 JB |
4587 | /* Free the memory used by SYM_CACHE. */ |
4588 | ||
4589 | static void | |
4590 | ada_free_symbol_cache (struct ada_symbol_cache *sym_cache) | |
3d9434b5 | 4591 | { |
ee01b665 JB |
4592 | obstack_free (&sym_cache->cache_space, NULL); |
4593 | xfree (sym_cache); | |
4594 | } | |
3d9434b5 | 4595 | |
ee01b665 JB |
4596 | /* Return the symbol cache associated to the given program space PSPACE. |
4597 | If not allocated for this PSPACE yet, allocate and initialize one. */ | |
3d9434b5 | 4598 | |
ee01b665 JB |
4599 | static struct ada_symbol_cache * |
4600 | ada_get_symbol_cache (struct program_space *pspace) | |
4601 | { | |
4602 | struct ada_pspace_data *pspace_data = get_ada_pspace_data (pspace); | |
ee01b665 | 4603 | |
66c168ae | 4604 | if (pspace_data->sym_cache == NULL) |
ee01b665 | 4605 | { |
66c168ae JB |
4606 | pspace_data->sym_cache = XCNEW (struct ada_symbol_cache); |
4607 | ada_init_symbol_cache (pspace_data->sym_cache); | |
ee01b665 JB |
4608 | } |
4609 | ||
66c168ae | 4610 | return pspace_data->sym_cache; |
ee01b665 | 4611 | } |
3d9434b5 JB |
4612 | |
4613 | /* Clear all entries from the symbol cache. */ | |
4614 | ||
4615 | static void | |
4616 | ada_clear_symbol_cache (void) | |
4617 | { | |
ee01b665 JB |
4618 | struct ada_symbol_cache *sym_cache |
4619 | = ada_get_symbol_cache (current_program_space); | |
4620 | ||
4621 | obstack_free (&sym_cache->cache_space, NULL); | |
4622 | ada_init_symbol_cache (sym_cache); | |
3d9434b5 JB |
4623 | } |
4624 | ||
fe978cb0 | 4625 | /* Search our cache for an entry matching NAME and DOMAIN. |
3d9434b5 JB |
4626 | Return it if found, or NULL otherwise. */ |
4627 | ||
4628 | static struct cache_entry ** | |
fe978cb0 | 4629 | find_entry (const char *name, domain_enum domain) |
3d9434b5 | 4630 | { |
ee01b665 JB |
4631 | struct ada_symbol_cache *sym_cache |
4632 | = ada_get_symbol_cache (current_program_space); | |
3d9434b5 JB |
4633 | int h = msymbol_hash (name) % HASH_SIZE; |
4634 | struct cache_entry **e; | |
4635 | ||
ee01b665 | 4636 | for (e = &sym_cache->root[h]; *e != NULL; e = &(*e)->next) |
3d9434b5 | 4637 | { |
fe978cb0 | 4638 | if (domain == (*e)->domain && strcmp (name, (*e)->name) == 0) |
3d9434b5 JB |
4639 | return e; |
4640 | } | |
4641 | return NULL; | |
4642 | } | |
4643 | ||
fe978cb0 | 4644 | /* Search the symbol cache for an entry matching NAME and DOMAIN. |
3d9434b5 JB |
4645 | Return 1 if found, 0 otherwise. |
4646 | ||
4647 | If an entry was found and SYM is not NULL, set *SYM to the entry's | |
4648 | SYM. Same principle for BLOCK if not NULL. */ | |
96d887e8 | 4649 | |
96d887e8 | 4650 | static int |
fe978cb0 | 4651 | lookup_cached_symbol (const char *name, domain_enum domain, |
f0c5f9b2 | 4652 | struct symbol **sym, const struct block **block) |
96d887e8 | 4653 | { |
fe978cb0 | 4654 | struct cache_entry **e = find_entry (name, domain); |
3d9434b5 JB |
4655 | |
4656 | if (e == NULL) | |
4657 | return 0; | |
4658 | if (sym != NULL) | |
4659 | *sym = (*e)->sym; | |
4660 | if (block != NULL) | |
4661 | *block = (*e)->block; | |
4662 | return 1; | |
96d887e8 PH |
4663 | } |
4664 | ||
3d9434b5 | 4665 | /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME |
fe978cb0 | 4666 | in domain DOMAIN, save this result in our symbol cache. */ |
3d9434b5 | 4667 | |
96d887e8 | 4668 | static void |
fe978cb0 | 4669 | cache_symbol (const char *name, domain_enum domain, struct symbol *sym, |
270140bd | 4670 | const struct block *block) |
96d887e8 | 4671 | { |
ee01b665 JB |
4672 | struct ada_symbol_cache *sym_cache |
4673 | = ada_get_symbol_cache (current_program_space); | |
3d9434b5 | 4674 | int h; |
3d9434b5 JB |
4675 | struct cache_entry *e; |
4676 | ||
1994afbf DE |
4677 | /* Symbols for builtin types don't have a block. |
4678 | For now don't cache such symbols. */ | |
4679 | if (sym != NULL && !SYMBOL_OBJFILE_OWNED (sym)) | |
4680 | return; | |
4681 | ||
3d9434b5 JB |
4682 | /* If the symbol is a local symbol, then do not cache it, as a search |
4683 | for that symbol depends on the context. To determine whether | |
4684 | the symbol is local or not, we check the block where we found it | |
4685 | against the global and static blocks of its associated symtab. */ | |
4686 | if (sym | |
08be3fe3 | 4687 | && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)), |
439247b6 | 4688 | GLOBAL_BLOCK) != block |
08be3fe3 | 4689 | && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)), |
439247b6 | 4690 | STATIC_BLOCK) != block) |
3d9434b5 JB |
4691 | return; |
4692 | ||
4693 | h = msymbol_hash (name) % HASH_SIZE; | |
e39db4db | 4694 | e = XOBNEW (&sym_cache->cache_space, cache_entry); |
ee01b665 JB |
4695 | e->next = sym_cache->root[h]; |
4696 | sym_cache->root[h] = e; | |
2ef5453b | 4697 | e->name = obstack_strdup (&sym_cache->cache_space, name); |
3d9434b5 | 4698 | e->sym = sym; |
fe978cb0 | 4699 | e->domain = domain; |
3d9434b5 | 4700 | e->block = block; |
96d887e8 | 4701 | } |
4c4b4cd2 PH |
4702 | \f |
4703 | /* Symbol Lookup */ | |
4704 | ||
b5ec771e PA |
4705 | /* Return the symbol name match type that should be used used when |
4706 | searching for all symbols matching LOOKUP_NAME. | |
c0431670 JB |
4707 | |
4708 | LOOKUP_NAME is expected to be a symbol name after transformation | |
f98b2e33 | 4709 | for Ada lookups. */ |
c0431670 | 4710 | |
b5ec771e PA |
4711 | static symbol_name_match_type |
4712 | name_match_type_from_name (const char *lookup_name) | |
c0431670 | 4713 | { |
b5ec771e PA |
4714 | return (strstr (lookup_name, "__") == NULL |
4715 | ? symbol_name_match_type::WILD | |
4716 | : symbol_name_match_type::FULL); | |
c0431670 JB |
4717 | } |
4718 | ||
4c4b4cd2 PH |
4719 | /* Return the result of a standard (literal, C-like) lookup of NAME in |
4720 | given DOMAIN, visible from lexical block BLOCK. */ | |
4721 | ||
4722 | static struct symbol * | |
4723 | standard_lookup (const char *name, const struct block *block, | |
4724 | domain_enum domain) | |
4725 | { | |
acbd605d | 4726 | /* Initialize it just to avoid a GCC false warning. */ |
6640a367 | 4727 | struct block_symbol sym = {}; |
4c4b4cd2 | 4728 | |
d12307c1 PMR |
4729 | if (lookup_cached_symbol (name, domain, &sym.symbol, NULL)) |
4730 | return sym.symbol; | |
a2cd4f14 | 4731 | ada_lookup_encoded_symbol (name, block, domain, &sym); |
d12307c1 PMR |
4732 | cache_symbol (name, domain, sym.symbol, sym.block); |
4733 | return sym.symbol; | |
4c4b4cd2 PH |
4734 | } |
4735 | ||
4736 | ||
4737 | /* Non-zero iff there is at least one non-function/non-enumeral symbol | |
4738 | in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions, | |
4739 | since they contend in overloading in the same way. */ | |
4740 | static int | |
d12307c1 | 4741 | is_nonfunction (struct block_symbol syms[], int n) |
4c4b4cd2 PH |
4742 | { |
4743 | int i; | |
4744 | ||
4745 | for (i = 0; i < n; i += 1) | |
78134374 SM |
4746 | if (SYMBOL_TYPE (syms[i].symbol)->code () != TYPE_CODE_FUNC |
4747 | && (SYMBOL_TYPE (syms[i].symbol)->code () != TYPE_CODE_ENUM | |
d12307c1 | 4748 | || SYMBOL_CLASS (syms[i].symbol) != LOC_CONST)) |
14f9c5c9 AS |
4749 | return 1; |
4750 | ||
4751 | return 0; | |
4752 | } | |
4753 | ||
4754 | /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent | |
4c4b4cd2 | 4755 | struct types. Otherwise, they may not. */ |
14f9c5c9 AS |
4756 | |
4757 | static int | |
d2e4a39e | 4758 | equiv_types (struct type *type0, struct type *type1) |
14f9c5c9 | 4759 | { |
d2e4a39e | 4760 | if (type0 == type1) |
14f9c5c9 | 4761 | return 1; |
d2e4a39e | 4762 | if (type0 == NULL || type1 == NULL |
78134374 | 4763 | || type0->code () != type1->code ()) |
14f9c5c9 | 4764 | return 0; |
78134374 SM |
4765 | if ((type0->code () == TYPE_CODE_STRUCT |
4766 | || type0->code () == TYPE_CODE_ENUM) | |
14f9c5c9 | 4767 | && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL |
4c4b4cd2 | 4768 | && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0) |
14f9c5c9 | 4769 | return 1; |
d2e4a39e | 4770 | |
14f9c5c9 AS |
4771 | return 0; |
4772 | } | |
4773 | ||
4774 | /* True iff SYM0 represents the same entity as SYM1, or one that is | |
4c4b4cd2 | 4775 | no more defined than that of SYM1. */ |
14f9c5c9 AS |
4776 | |
4777 | static int | |
d2e4a39e | 4778 | lesseq_defined_than (struct symbol *sym0, struct symbol *sym1) |
14f9c5c9 AS |
4779 | { |
4780 | if (sym0 == sym1) | |
4781 | return 1; | |
176620f1 | 4782 | if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1) |
14f9c5c9 AS |
4783 | || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1)) |
4784 | return 0; | |
4785 | ||
d2e4a39e | 4786 | switch (SYMBOL_CLASS (sym0)) |
14f9c5c9 AS |
4787 | { |
4788 | case LOC_UNDEF: | |
4789 | return 1; | |
4790 | case LOC_TYPEDEF: | |
4791 | { | |
4c4b4cd2 PH |
4792 | struct type *type0 = SYMBOL_TYPE (sym0); |
4793 | struct type *type1 = SYMBOL_TYPE (sym1); | |
987012b8 CB |
4794 | const char *name0 = sym0->linkage_name (); |
4795 | const char *name1 = sym1->linkage_name (); | |
4c4b4cd2 | 4796 | int len0 = strlen (name0); |
5b4ee69b | 4797 | |
4c4b4cd2 | 4798 | return |
78134374 | 4799 | type0->code () == type1->code () |
4c4b4cd2 PH |
4800 | && (equiv_types (type0, type1) |
4801 | || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0 | |
61012eef | 4802 | && startswith (name1 + len0, "___XV"))); |
14f9c5c9 AS |
4803 | } |
4804 | case LOC_CONST: | |
4805 | return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1) | |
4c4b4cd2 | 4806 | && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1)); |
4b610737 TT |
4807 | |
4808 | case LOC_STATIC: | |
4809 | { | |
987012b8 CB |
4810 | const char *name0 = sym0->linkage_name (); |
4811 | const char *name1 = sym1->linkage_name (); | |
4b610737 TT |
4812 | return (strcmp (name0, name1) == 0 |
4813 | && SYMBOL_VALUE_ADDRESS (sym0) == SYMBOL_VALUE_ADDRESS (sym1)); | |
4814 | } | |
4815 | ||
d2e4a39e AS |
4816 | default: |
4817 | return 0; | |
14f9c5c9 AS |
4818 | } |
4819 | } | |
4820 | ||
d12307c1 | 4821 | /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol |
4c4b4cd2 | 4822 | records in OBSTACKP. Do nothing if SYM is a duplicate. */ |
14f9c5c9 AS |
4823 | |
4824 | static void | |
76a01679 JB |
4825 | add_defn_to_vec (struct obstack *obstackp, |
4826 | struct symbol *sym, | |
f0c5f9b2 | 4827 | const struct block *block) |
14f9c5c9 AS |
4828 | { |
4829 | int i; | |
d12307c1 | 4830 | struct block_symbol *prevDefns = defns_collected (obstackp, 0); |
14f9c5c9 | 4831 | |
529cad9c PH |
4832 | /* Do not try to complete stub types, as the debugger is probably |
4833 | already scanning all symbols matching a certain name at the | |
4834 | time when this function is called. Trying to replace the stub | |
4835 | type by its associated full type will cause us to restart a scan | |
4836 | which may lead to an infinite recursion. Instead, the client | |
4837 | collecting the matching symbols will end up collecting several | |
4838 | matches, with at least one of them complete. It can then filter | |
4839 | out the stub ones if needed. */ | |
4840 | ||
4c4b4cd2 PH |
4841 | for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1) |
4842 | { | |
d12307c1 | 4843 | if (lesseq_defined_than (sym, prevDefns[i].symbol)) |
4c4b4cd2 | 4844 | return; |
d12307c1 | 4845 | else if (lesseq_defined_than (prevDefns[i].symbol, sym)) |
4c4b4cd2 | 4846 | { |
d12307c1 | 4847 | prevDefns[i].symbol = sym; |
4c4b4cd2 | 4848 | prevDefns[i].block = block; |
4c4b4cd2 | 4849 | return; |
76a01679 | 4850 | } |
4c4b4cd2 PH |
4851 | } |
4852 | ||
4853 | { | |
d12307c1 | 4854 | struct block_symbol info; |
4c4b4cd2 | 4855 | |
d12307c1 | 4856 | info.symbol = sym; |
4c4b4cd2 | 4857 | info.block = block; |
d12307c1 | 4858 | obstack_grow (obstackp, &info, sizeof (struct block_symbol)); |
4c4b4cd2 PH |
4859 | } |
4860 | } | |
4861 | ||
d12307c1 PMR |
4862 | /* Number of block_symbol structures currently collected in current vector in |
4863 | OBSTACKP. */ | |
4c4b4cd2 | 4864 | |
76a01679 JB |
4865 | static int |
4866 | num_defns_collected (struct obstack *obstackp) | |
4c4b4cd2 | 4867 | { |
d12307c1 | 4868 | return obstack_object_size (obstackp) / sizeof (struct block_symbol); |
4c4b4cd2 PH |
4869 | } |
4870 | ||
d12307c1 PMR |
4871 | /* Vector of block_symbol structures currently collected in current vector in |
4872 | OBSTACKP. If FINISH, close off the vector and return its final address. */ | |
4c4b4cd2 | 4873 | |
d12307c1 | 4874 | static struct block_symbol * |
4c4b4cd2 PH |
4875 | defns_collected (struct obstack *obstackp, int finish) |
4876 | { | |
4877 | if (finish) | |
224c3ddb | 4878 | return (struct block_symbol *) obstack_finish (obstackp); |
4c4b4cd2 | 4879 | else |
d12307c1 | 4880 | return (struct block_symbol *) obstack_base (obstackp); |
4c4b4cd2 PH |
4881 | } |
4882 | ||
7c7b6655 TT |
4883 | /* Return a bound minimal symbol matching NAME according to Ada |
4884 | decoding rules. Returns an invalid symbol if there is no such | |
4885 | minimal symbol. Names prefixed with "standard__" are handled | |
4886 | specially: "standard__" is first stripped off, and only static and | |
4887 | global symbols are searched. */ | |
4c4b4cd2 | 4888 | |
7c7b6655 | 4889 | struct bound_minimal_symbol |
96d887e8 | 4890 | ada_lookup_simple_minsym (const char *name) |
4c4b4cd2 | 4891 | { |
7c7b6655 | 4892 | struct bound_minimal_symbol result; |
4c4b4cd2 | 4893 | |
7c7b6655 TT |
4894 | memset (&result, 0, sizeof (result)); |
4895 | ||
b5ec771e PA |
4896 | symbol_name_match_type match_type = name_match_type_from_name (name); |
4897 | lookup_name_info lookup_name (name, match_type); | |
4898 | ||
4899 | symbol_name_matcher_ftype *match_name | |
4900 | = ada_get_symbol_name_matcher (lookup_name); | |
4c4b4cd2 | 4901 | |
2030c079 | 4902 | for (objfile *objfile : current_program_space->objfiles ()) |
5325b9bf | 4903 | { |
7932255d | 4904 | for (minimal_symbol *msymbol : objfile->msymbols ()) |
5325b9bf | 4905 | { |
c9d95fa3 | 4906 | if (match_name (msymbol->linkage_name (), lookup_name, NULL) |
5325b9bf TT |
4907 | && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline) |
4908 | { | |
4909 | result.minsym = msymbol; | |
4910 | result.objfile = objfile; | |
4911 | break; | |
4912 | } | |
4913 | } | |
4914 | } | |
4c4b4cd2 | 4915 | |
7c7b6655 | 4916 | return result; |
96d887e8 | 4917 | } |
4c4b4cd2 | 4918 | |
96d887e8 PH |
4919 | /* For all subprograms that statically enclose the subprogram of the |
4920 | selected frame, add symbols matching identifier NAME in DOMAIN | |
4921 | and their blocks to the list of data in OBSTACKP, as for | |
48b78332 JB |
4922 | ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME |
4923 | with a wildcard prefix. */ | |
4c4b4cd2 | 4924 | |
96d887e8 PH |
4925 | static void |
4926 | add_symbols_from_enclosing_procs (struct obstack *obstackp, | |
b5ec771e PA |
4927 | const lookup_name_info &lookup_name, |
4928 | domain_enum domain) | |
96d887e8 | 4929 | { |
96d887e8 | 4930 | } |
14f9c5c9 | 4931 | |
96d887e8 PH |
4932 | /* True if TYPE is definitely an artificial type supplied to a symbol |
4933 | for which no debugging information was given in the symbol file. */ | |
14f9c5c9 | 4934 | |
96d887e8 PH |
4935 | static int |
4936 | is_nondebugging_type (struct type *type) | |
4937 | { | |
0d5cff50 | 4938 | const char *name = ada_type_name (type); |
5b4ee69b | 4939 | |
96d887e8 PH |
4940 | return (name != NULL && strcmp (name, "<variable, no debug info>") == 0); |
4941 | } | |
4c4b4cd2 | 4942 | |
8f17729f JB |
4943 | /* Return nonzero if TYPE1 and TYPE2 are two enumeration types |
4944 | that are deemed "identical" for practical purposes. | |
4945 | ||
4946 | This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM | |
4947 | types and that their number of enumerals is identical (in other | |
1f704f76 | 4948 | words, type1->num_fields () == type2->num_fields ()). */ |
8f17729f JB |
4949 | |
4950 | static int | |
4951 | ada_identical_enum_types_p (struct type *type1, struct type *type2) | |
4952 | { | |
4953 | int i; | |
4954 | ||
4955 | /* The heuristic we use here is fairly conservative. We consider | |
4956 | that 2 enumerate types are identical if they have the same | |
4957 | number of enumerals and that all enumerals have the same | |
4958 | underlying value and name. */ | |
4959 | ||
4960 | /* All enums in the type should have an identical underlying value. */ | |
1f704f76 | 4961 | for (i = 0; i < type1->num_fields (); i++) |
14e75d8e | 4962 | if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i)) |
8f17729f JB |
4963 | return 0; |
4964 | ||
4965 | /* All enumerals should also have the same name (modulo any numerical | |
4966 | suffix). */ | |
1f704f76 | 4967 | for (i = 0; i < type1->num_fields (); i++) |
8f17729f | 4968 | { |
0d5cff50 DE |
4969 | const char *name_1 = TYPE_FIELD_NAME (type1, i); |
4970 | const char *name_2 = TYPE_FIELD_NAME (type2, i); | |
8f17729f JB |
4971 | int len_1 = strlen (name_1); |
4972 | int len_2 = strlen (name_2); | |
4973 | ||
4974 | ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1); | |
4975 | ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2); | |
4976 | if (len_1 != len_2 | |
4977 | || strncmp (TYPE_FIELD_NAME (type1, i), | |
4978 | TYPE_FIELD_NAME (type2, i), | |
4979 | len_1) != 0) | |
4980 | return 0; | |
4981 | } | |
4982 | ||
4983 | return 1; | |
4984 | } | |
4985 | ||
4986 | /* Return nonzero if all the symbols in SYMS are all enumeral symbols | |
4987 | that are deemed "identical" for practical purposes. Sometimes, | |
4988 | enumerals are not strictly identical, but their types are so similar | |
4989 | that they can be considered identical. | |
4990 | ||
4991 | For instance, consider the following code: | |
4992 | ||
4993 | type Color is (Black, Red, Green, Blue, White); | |
4994 | type RGB_Color is new Color range Red .. Blue; | |
4995 | ||
4996 | Type RGB_Color is a subrange of an implicit type which is a copy | |
4997 | of type Color. If we call that implicit type RGB_ColorB ("B" is | |
4998 | for "Base Type"), then type RGB_ColorB is a copy of type Color. | |
4999 | As a result, when an expression references any of the enumeral | |
5000 | by name (Eg. "print green"), the expression is technically | |
5001 | ambiguous and the user should be asked to disambiguate. But | |
5002 | doing so would only hinder the user, since it wouldn't matter | |
5003 | what choice he makes, the outcome would always be the same. | |
5004 | So, for practical purposes, we consider them as the same. */ | |
5005 | ||
5006 | static int | |
54d343a2 | 5007 | symbols_are_identical_enums (const std::vector<struct block_symbol> &syms) |
8f17729f JB |
5008 | { |
5009 | int i; | |
5010 | ||
5011 | /* Before performing a thorough comparison check of each type, | |
5012 | we perform a series of inexpensive checks. We expect that these | |
5013 | checks will quickly fail in the vast majority of cases, and thus | |
5014 | help prevent the unnecessary use of a more expensive comparison. | |
5015 | Said comparison also expects us to make some of these checks | |
5016 | (see ada_identical_enum_types_p). */ | |
5017 | ||
5018 | /* Quick check: All symbols should have an enum type. */ | |
54d343a2 | 5019 | for (i = 0; i < syms.size (); i++) |
78134374 | 5020 | if (SYMBOL_TYPE (syms[i].symbol)->code () != TYPE_CODE_ENUM) |
8f17729f JB |
5021 | return 0; |
5022 | ||
5023 | /* Quick check: They should all have the same value. */ | |
54d343a2 | 5024 | for (i = 1; i < syms.size (); i++) |
d12307c1 | 5025 | if (SYMBOL_VALUE (syms[i].symbol) != SYMBOL_VALUE (syms[0].symbol)) |
8f17729f JB |
5026 | return 0; |
5027 | ||
5028 | /* Quick check: They should all have the same number of enumerals. */ | |
54d343a2 | 5029 | for (i = 1; i < syms.size (); i++) |
1f704f76 SM |
5030 | if (SYMBOL_TYPE (syms[i].symbol)->num_fields () |
5031 | != SYMBOL_TYPE (syms[0].symbol)->num_fields ()) | |
8f17729f JB |
5032 | return 0; |
5033 | ||
5034 | /* All the sanity checks passed, so we might have a set of | |
5035 | identical enumeration types. Perform a more complete | |
5036 | comparison of the type of each symbol. */ | |
54d343a2 | 5037 | for (i = 1; i < syms.size (); i++) |
d12307c1 PMR |
5038 | if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].symbol), |
5039 | SYMBOL_TYPE (syms[0].symbol))) | |
8f17729f JB |
5040 | return 0; |
5041 | ||
5042 | return 1; | |
5043 | } | |
5044 | ||
54d343a2 | 5045 | /* Remove any non-debugging symbols in SYMS that definitely |
96d887e8 PH |
5046 | duplicate other symbols in the list (The only case I know of where |
5047 | this happens is when object files containing stabs-in-ecoff are | |
5048 | linked with files containing ordinary ecoff debugging symbols (or no | |
5049 | debugging symbols)). Modifies SYMS to squeeze out deleted entries. | |
5050 | Returns the number of items in the modified list. */ | |
4c4b4cd2 | 5051 | |
96d887e8 | 5052 | static int |
54d343a2 | 5053 | remove_extra_symbols (std::vector<struct block_symbol> *syms) |
96d887e8 PH |
5054 | { |
5055 | int i, j; | |
4c4b4cd2 | 5056 | |
8f17729f JB |
5057 | /* We should never be called with less than 2 symbols, as there |
5058 | cannot be any extra symbol in that case. But it's easy to | |
5059 | handle, since we have nothing to do in that case. */ | |
54d343a2 TT |
5060 | if (syms->size () < 2) |
5061 | return syms->size (); | |
8f17729f | 5062 | |
96d887e8 | 5063 | i = 0; |
54d343a2 | 5064 | while (i < syms->size ()) |
96d887e8 | 5065 | { |
a35ddb44 | 5066 | int remove_p = 0; |
339c13b6 JB |
5067 | |
5068 | /* If two symbols have the same name and one of them is a stub type, | |
5069 | the get rid of the stub. */ | |
5070 | ||
54d343a2 | 5071 | if (TYPE_STUB (SYMBOL_TYPE ((*syms)[i].symbol)) |
987012b8 | 5072 | && (*syms)[i].symbol->linkage_name () != NULL) |
339c13b6 | 5073 | { |
54d343a2 | 5074 | for (j = 0; j < syms->size (); j++) |
339c13b6 JB |
5075 | { |
5076 | if (j != i | |
54d343a2 | 5077 | && !TYPE_STUB (SYMBOL_TYPE ((*syms)[j].symbol)) |
987012b8 CB |
5078 | && (*syms)[j].symbol->linkage_name () != NULL |
5079 | && strcmp ((*syms)[i].symbol->linkage_name (), | |
5080 | (*syms)[j].symbol->linkage_name ()) == 0) | |
a35ddb44 | 5081 | remove_p = 1; |
339c13b6 JB |
5082 | } |
5083 | } | |
5084 | ||
5085 | /* Two symbols with the same name, same class and same address | |
5086 | should be identical. */ | |
5087 | ||
987012b8 | 5088 | else if ((*syms)[i].symbol->linkage_name () != NULL |
54d343a2 TT |
5089 | && SYMBOL_CLASS ((*syms)[i].symbol) == LOC_STATIC |
5090 | && is_nondebugging_type (SYMBOL_TYPE ((*syms)[i].symbol))) | |
96d887e8 | 5091 | { |
54d343a2 | 5092 | for (j = 0; j < syms->size (); j += 1) |
96d887e8 PH |
5093 | { |
5094 | if (i != j | |
987012b8 CB |
5095 | && (*syms)[j].symbol->linkage_name () != NULL |
5096 | && strcmp ((*syms)[i].symbol->linkage_name (), | |
5097 | (*syms)[j].symbol->linkage_name ()) == 0 | |
54d343a2 TT |
5098 | && SYMBOL_CLASS ((*syms)[i].symbol) |
5099 | == SYMBOL_CLASS ((*syms)[j].symbol) | |
5100 | && SYMBOL_VALUE_ADDRESS ((*syms)[i].symbol) | |
5101 | == SYMBOL_VALUE_ADDRESS ((*syms)[j].symbol)) | |
a35ddb44 | 5102 | remove_p = 1; |
4c4b4cd2 | 5103 | } |
4c4b4cd2 | 5104 | } |
339c13b6 | 5105 | |
a35ddb44 | 5106 | if (remove_p) |
54d343a2 | 5107 | syms->erase (syms->begin () + i); |
339c13b6 | 5108 | |
96d887e8 | 5109 | i += 1; |
14f9c5c9 | 5110 | } |
8f17729f JB |
5111 | |
5112 | /* If all the remaining symbols are identical enumerals, then | |
5113 | just keep the first one and discard the rest. | |
5114 | ||
5115 | Unlike what we did previously, we do not discard any entry | |
5116 | unless they are ALL identical. This is because the symbol | |
5117 | comparison is not a strict comparison, but rather a practical | |
5118 | comparison. If all symbols are considered identical, then | |
5119 | we can just go ahead and use the first one and discard the rest. | |
5120 | But if we cannot reduce the list to a single element, we have | |
5121 | to ask the user to disambiguate anyways. And if we have to | |
5122 | present a multiple-choice menu, it's less confusing if the list | |
5123 | isn't missing some choices that were identical and yet distinct. */ | |
54d343a2 TT |
5124 | if (symbols_are_identical_enums (*syms)) |
5125 | syms->resize (1); | |
8f17729f | 5126 | |
54d343a2 | 5127 | return syms->size (); |
14f9c5c9 AS |
5128 | } |
5129 | ||
96d887e8 PH |
5130 | /* Given a type that corresponds to a renaming entity, use the type name |
5131 | to extract the scope (package name or function name, fully qualified, | |
5132 | and following the GNAT encoding convention) where this renaming has been | |
49d83361 | 5133 | defined. */ |
4c4b4cd2 | 5134 | |
49d83361 | 5135 | static std::string |
96d887e8 | 5136 | xget_renaming_scope (struct type *renaming_type) |
14f9c5c9 | 5137 | { |
96d887e8 | 5138 | /* The renaming types adhere to the following convention: |
0963b4bd | 5139 | <scope>__<rename>___<XR extension>. |
96d887e8 PH |
5140 | So, to extract the scope, we search for the "___XR" extension, |
5141 | and then backtrack until we find the first "__". */ | |
76a01679 | 5142 | |
7d93a1e0 | 5143 | const char *name = renaming_type->name (); |
108d56a4 SM |
5144 | const char *suffix = strstr (name, "___XR"); |
5145 | const char *last; | |
14f9c5c9 | 5146 | |
96d887e8 PH |
5147 | /* Now, backtrack a bit until we find the first "__". Start looking |
5148 | at suffix - 3, as the <rename> part is at least one character long. */ | |
14f9c5c9 | 5149 | |
96d887e8 PH |
5150 | for (last = suffix - 3; last > name; last--) |
5151 | if (last[0] == '_' && last[1] == '_') | |
5152 | break; | |
76a01679 | 5153 | |
96d887e8 | 5154 | /* Make a copy of scope and return it. */ |
49d83361 | 5155 | return std::string (name, last); |
4c4b4cd2 PH |
5156 | } |
5157 | ||
96d887e8 | 5158 | /* Return nonzero if NAME corresponds to a package name. */ |
4c4b4cd2 | 5159 | |
96d887e8 PH |
5160 | static int |
5161 | is_package_name (const char *name) | |
4c4b4cd2 | 5162 | { |
96d887e8 PH |
5163 | /* Here, We take advantage of the fact that no symbols are generated |
5164 | for packages, while symbols are generated for each function. | |
5165 | So the condition for NAME represent a package becomes equivalent | |
5166 | to NAME not existing in our list of symbols. There is only one | |
5167 | small complication with library-level functions (see below). */ | |
4c4b4cd2 | 5168 | |
96d887e8 PH |
5169 | /* If it is a function that has not been defined at library level, |
5170 | then we should be able to look it up in the symbols. */ | |
5171 | if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL) | |
5172 | return 0; | |
14f9c5c9 | 5173 | |
96d887e8 PH |
5174 | /* Library-level function names start with "_ada_". See if function |
5175 | "_ada_" followed by NAME can be found. */ | |
14f9c5c9 | 5176 | |
96d887e8 | 5177 | /* Do a quick check that NAME does not contain "__", since library-level |
e1d5a0d2 | 5178 | functions names cannot contain "__" in them. */ |
96d887e8 PH |
5179 | if (strstr (name, "__") != NULL) |
5180 | return 0; | |
4c4b4cd2 | 5181 | |
528e1572 | 5182 | std::string fun_name = string_printf ("_ada_%s", name); |
14f9c5c9 | 5183 | |
528e1572 | 5184 | return (standard_lookup (fun_name.c_str (), NULL, VAR_DOMAIN) == NULL); |
96d887e8 | 5185 | } |
14f9c5c9 | 5186 | |
96d887e8 | 5187 | /* Return nonzero if SYM corresponds to a renaming entity that is |
aeb5907d | 5188 | not visible from FUNCTION_NAME. */ |
14f9c5c9 | 5189 | |
96d887e8 | 5190 | static int |
0d5cff50 | 5191 | old_renaming_is_invisible (const struct symbol *sym, const char *function_name) |
96d887e8 | 5192 | { |
aeb5907d JB |
5193 | if (SYMBOL_CLASS (sym) != LOC_TYPEDEF) |
5194 | return 0; | |
5195 | ||
49d83361 | 5196 | std::string scope = xget_renaming_scope (SYMBOL_TYPE (sym)); |
14f9c5c9 | 5197 | |
96d887e8 | 5198 | /* If the rename has been defined in a package, then it is visible. */ |
49d83361 TT |
5199 | if (is_package_name (scope.c_str ())) |
5200 | return 0; | |
14f9c5c9 | 5201 | |
96d887e8 PH |
5202 | /* Check that the rename is in the current function scope by checking |
5203 | that its name starts with SCOPE. */ | |
76a01679 | 5204 | |
96d887e8 PH |
5205 | /* If the function name starts with "_ada_", it means that it is |
5206 | a library-level function. Strip this prefix before doing the | |
5207 | comparison, as the encoding for the renaming does not contain | |
5208 | this prefix. */ | |
61012eef | 5209 | if (startswith (function_name, "_ada_")) |
96d887e8 | 5210 | function_name += 5; |
f26caa11 | 5211 | |
49d83361 | 5212 | return !startswith (function_name, scope.c_str ()); |
f26caa11 PH |
5213 | } |
5214 | ||
aeb5907d JB |
5215 | /* Remove entries from SYMS that corresponds to a renaming entity that |
5216 | is not visible from the function associated with CURRENT_BLOCK or | |
5217 | that is superfluous due to the presence of more specific renaming | |
5218 | information. Places surviving symbols in the initial entries of | |
5219 | SYMS and returns the number of surviving symbols. | |
96d887e8 PH |
5220 | |
5221 | Rationale: | |
aeb5907d JB |
5222 | First, in cases where an object renaming is implemented as a |
5223 | reference variable, GNAT may produce both the actual reference | |
5224 | variable and the renaming encoding. In this case, we discard the | |
5225 | latter. | |
5226 | ||
5227 | Second, GNAT emits a type following a specified encoding for each renaming | |
96d887e8 PH |
5228 | entity. Unfortunately, STABS currently does not support the definition |
5229 | of types that are local to a given lexical block, so all renamings types | |
5230 | are emitted at library level. As a consequence, if an application | |
5231 | contains two renaming entities using the same name, and a user tries to | |
5232 | print the value of one of these entities, the result of the ada symbol | |
5233 | lookup will also contain the wrong renaming type. | |
f26caa11 | 5234 | |
96d887e8 PH |
5235 | This function partially covers for this limitation by attempting to |
5236 | remove from the SYMS list renaming symbols that should be visible | |
5237 | from CURRENT_BLOCK. However, there does not seem be a 100% reliable | |
5238 | method with the current information available. The implementation | |
5239 | below has a couple of limitations (FIXME: brobecker-2003-05-12): | |
5240 | ||
5241 | - When the user tries to print a rename in a function while there | |
5242 | is another rename entity defined in a package: Normally, the | |
5243 | rename in the function has precedence over the rename in the | |
5244 | package, so the latter should be removed from the list. This is | |
5245 | currently not the case. | |
5246 | ||
5247 | - This function will incorrectly remove valid renames if | |
5248 | the CURRENT_BLOCK corresponds to a function which symbol name | |
5249 | has been changed by an "Export" pragma. As a consequence, | |
5250 | the user will be unable to print such rename entities. */ | |
4c4b4cd2 | 5251 | |
14f9c5c9 | 5252 | static int |
54d343a2 TT |
5253 | remove_irrelevant_renamings (std::vector<struct block_symbol> *syms, |
5254 | const struct block *current_block) | |
4c4b4cd2 PH |
5255 | { |
5256 | struct symbol *current_function; | |
0d5cff50 | 5257 | const char *current_function_name; |
4c4b4cd2 | 5258 | int i; |
aeb5907d JB |
5259 | int is_new_style_renaming; |
5260 | ||
5261 | /* If there is both a renaming foo___XR... encoded as a variable and | |
5262 | a simple variable foo in the same block, discard the latter. | |
0963b4bd | 5263 | First, zero out such symbols, then compress. */ |
aeb5907d | 5264 | is_new_style_renaming = 0; |
54d343a2 | 5265 | for (i = 0; i < syms->size (); i += 1) |
aeb5907d | 5266 | { |
54d343a2 TT |
5267 | struct symbol *sym = (*syms)[i].symbol; |
5268 | const struct block *block = (*syms)[i].block; | |
aeb5907d JB |
5269 | const char *name; |
5270 | const char *suffix; | |
5271 | ||
5272 | if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
5273 | continue; | |
987012b8 | 5274 | name = sym->linkage_name (); |
aeb5907d JB |
5275 | suffix = strstr (name, "___XR"); |
5276 | ||
5277 | if (suffix != NULL) | |
5278 | { | |
5279 | int name_len = suffix - name; | |
5280 | int j; | |
5b4ee69b | 5281 | |
aeb5907d | 5282 | is_new_style_renaming = 1; |
54d343a2 TT |
5283 | for (j = 0; j < syms->size (); j += 1) |
5284 | if (i != j && (*syms)[j].symbol != NULL | |
987012b8 | 5285 | && strncmp (name, (*syms)[j].symbol->linkage_name (), |
aeb5907d | 5286 | name_len) == 0 |
54d343a2 TT |
5287 | && block == (*syms)[j].block) |
5288 | (*syms)[j].symbol = NULL; | |
aeb5907d JB |
5289 | } |
5290 | } | |
5291 | if (is_new_style_renaming) | |
5292 | { | |
5293 | int j, k; | |
5294 | ||
54d343a2 TT |
5295 | for (j = k = 0; j < syms->size (); j += 1) |
5296 | if ((*syms)[j].symbol != NULL) | |
aeb5907d | 5297 | { |
54d343a2 | 5298 | (*syms)[k] = (*syms)[j]; |
aeb5907d JB |
5299 | k += 1; |
5300 | } | |
5301 | return k; | |
5302 | } | |
4c4b4cd2 PH |
5303 | |
5304 | /* Extract the function name associated to CURRENT_BLOCK. | |
5305 | Abort if unable to do so. */ | |
76a01679 | 5306 | |
4c4b4cd2 | 5307 | if (current_block == NULL) |
54d343a2 | 5308 | return syms->size (); |
76a01679 | 5309 | |
7f0df278 | 5310 | current_function = block_linkage_function (current_block); |
4c4b4cd2 | 5311 | if (current_function == NULL) |
54d343a2 | 5312 | return syms->size (); |
4c4b4cd2 | 5313 | |
987012b8 | 5314 | current_function_name = current_function->linkage_name (); |
4c4b4cd2 | 5315 | if (current_function_name == NULL) |
54d343a2 | 5316 | return syms->size (); |
4c4b4cd2 PH |
5317 | |
5318 | /* Check each of the symbols, and remove it from the list if it is | |
5319 | a type corresponding to a renaming that is out of the scope of | |
5320 | the current block. */ | |
5321 | ||
5322 | i = 0; | |
54d343a2 | 5323 | while (i < syms->size ()) |
4c4b4cd2 | 5324 | { |
54d343a2 | 5325 | if (ada_parse_renaming ((*syms)[i].symbol, NULL, NULL, NULL) |
aeb5907d | 5326 | == ADA_OBJECT_RENAMING |
54d343a2 TT |
5327 | && old_renaming_is_invisible ((*syms)[i].symbol, |
5328 | current_function_name)) | |
5329 | syms->erase (syms->begin () + i); | |
4c4b4cd2 PH |
5330 | else |
5331 | i += 1; | |
5332 | } | |
5333 | ||
54d343a2 | 5334 | return syms->size (); |
4c4b4cd2 PH |
5335 | } |
5336 | ||
339c13b6 JB |
5337 | /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks) |
5338 | whose name and domain match NAME and DOMAIN respectively. | |
5339 | If no match was found, then extend the search to "enclosing" | |
5340 | routines (in other words, if we're inside a nested function, | |
5341 | search the symbols defined inside the enclosing functions). | |
d0a8ab18 JB |
5342 | If WILD_MATCH_P is nonzero, perform the naming matching in |
5343 | "wild" mode (see function "wild_match" for more info). | |
339c13b6 JB |
5344 | |
5345 | Note: This function assumes that OBSTACKP has 0 (zero) element in it. */ | |
5346 | ||
5347 | static void | |
b5ec771e PA |
5348 | ada_add_local_symbols (struct obstack *obstackp, |
5349 | const lookup_name_info &lookup_name, | |
5350 | const struct block *block, domain_enum domain) | |
339c13b6 JB |
5351 | { |
5352 | int block_depth = 0; | |
5353 | ||
5354 | while (block != NULL) | |
5355 | { | |
5356 | block_depth += 1; | |
b5ec771e | 5357 | ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL); |
339c13b6 JB |
5358 | |
5359 | /* If we found a non-function match, assume that's the one. */ | |
5360 | if (is_nonfunction (defns_collected (obstackp, 0), | |
5361 | num_defns_collected (obstackp))) | |
5362 | return; | |
5363 | ||
5364 | block = BLOCK_SUPERBLOCK (block); | |
5365 | } | |
5366 | ||
5367 | /* If no luck so far, try to find NAME as a local symbol in some lexically | |
5368 | enclosing subprogram. */ | |
5369 | if (num_defns_collected (obstackp) == 0 && block_depth > 2) | |
b5ec771e | 5370 | add_symbols_from_enclosing_procs (obstackp, lookup_name, domain); |
339c13b6 JB |
5371 | } |
5372 | ||
ccefe4c4 | 5373 | /* An object of this type is used as the user_data argument when |
40658b94 | 5374 | calling the map_matching_symbols method. */ |
ccefe4c4 | 5375 | |
40658b94 | 5376 | struct match_data |
ccefe4c4 | 5377 | { |
40658b94 | 5378 | struct objfile *objfile; |
ccefe4c4 | 5379 | struct obstack *obstackp; |
40658b94 PH |
5380 | struct symbol *arg_sym; |
5381 | int found_sym; | |
ccefe4c4 TT |
5382 | }; |
5383 | ||
199b4314 TT |
5384 | /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM, |
5385 | to a list of symbols. DATA is a pointer to a struct match_data * | |
40658b94 PH |
5386 | containing the obstack that collects the symbol list, the file that SYM |
5387 | must come from, a flag indicating whether a non-argument symbol has | |
5388 | been found in the current block, and the last argument symbol | |
5389 | passed in SYM within the current block (if any). When SYM is null, | |
5390 | marking the end of a block, the argument symbol is added if no | |
5391 | other has been found. */ | |
ccefe4c4 | 5392 | |
199b4314 TT |
5393 | static bool |
5394 | aux_add_nonlocal_symbols (struct block_symbol *bsym, | |
5395 | struct match_data *data) | |
ccefe4c4 | 5396 | { |
199b4314 TT |
5397 | const struct block *block = bsym->block; |
5398 | struct symbol *sym = bsym->symbol; | |
5399 | ||
40658b94 PH |
5400 | if (sym == NULL) |
5401 | { | |
5402 | if (!data->found_sym && data->arg_sym != NULL) | |
5403 | add_defn_to_vec (data->obstackp, | |
5404 | fixup_symbol_section (data->arg_sym, data->objfile), | |
5405 | block); | |
5406 | data->found_sym = 0; | |
5407 | data->arg_sym = NULL; | |
5408 | } | |
5409 | else | |
5410 | { | |
5411 | if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED) | |
199b4314 | 5412 | return true; |
40658b94 PH |
5413 | else if (SYMBOL_IS_ARGUMENT (sym)) |
5414 | data->arg_sym = sym; | |
5415 | else | |
5416 | { | |
5417 | data->found_sym = 1; | |
5418 | add_defn_to_vec (data->obstackp, | |
5419 | fixup_symbol_section (sym, data->objfile), | |
5420 | block); | |
5421 | } | |
5422 | } | |
199b4314 | 5423 | return true; |
40658b94 PH |
5424 | } |
5425 | ||
b5ec771e PA |
5426 | /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are |
5427 | targeted by renamings matching LOOKUP_NAME in BLOCK. Add these | |
5428 | symbols to OBSTACKP. Return whether we found such symbols. */ | |
22cee43f PMR |
5429 | |
5430 | static int | |
5431 | ada_add_block_renamings (struct obstack *obstackp, | |
5432 | const struct block *block, | |
b5ec771e PA |
5433 | const lookup_name_info &lookup_name, |
5434 | domain_enum domain) | |
22cee43f PMR |
5435 | { |
5436 | struct using_direct *renaming; | |
5437 | int defns_mark = num_defns_collected (obstackp); | |
5438 | ||
b5ec771e PA |
5439 | symbol_name_matcher_ftype *name_match |
5440 | = ada_get_symbol_name_matcher (lookup_name); | |
5441 | ||
22cee43f PMR |
5442 | for (renaming = block_using (block); |
5443 | renaming != NULL; | |
5444 | renaming = renaming->next) | |
5445 | { | |
5446 | const char *r_name; | |
22cee43f PMR |
5447 | |
5448 | /* Avoid infinite recursions: skip this renaming if we are actually | |
5449 | already traversing it. | |
5450 | ||
5451 | Currently, symbol lookup in Ada don't use the namespace machinery from | |
5452 | C++/Fortran support: skip namespace imports that use them. */ | |
5453 | if (renaming->searched | |
5454 | || (renaming->import_src != NULL | |
5455 | && renaming->import_src[0] != '\0') | |
5456 | || (renaming->import_dest != NULL | |
5457 | && renaming->import_dest[0] != '\0')) | |
5458 | continue; | |
5459 | renaming->searched = 1; | |
5460 | ||
5461 | /* TODO: here, we perform another name-based symbol lookup, which can | |
5462 | pull its own multiple overloads. In theory, we should be able to do | |
5463 | better in this case since, in DWARF, DW_AT_import is a DIE reference, | |
5464 | not a simple name. But in order to do this, we would need to enhance | |
5465 | the DWARF reader to associate a symbol to this renaming, instead of a | |
5466 | name. So, for now, we do something simpler: re-use the C++/Fortran | |
5467 | namespace machinery. */ | |
5468 | r_name = (renaming->alias != NULL | |
5469 | ? renaming->alias | |
5470 | : renaming->declaration); | |
b5ec771e PA |
5471 | if (name_match (r_name, lookup_name, NULL)) |
5472 | { | |
5473 | lookup_name_info decl_lookup_name (renaming->declaration, | |
5474 | lookup_name.match_type ()); | |
5475 | ada_add_all_symbols (obstackp, block, decl_lookup_name, domain, | |
5476 | 1, NULL); | |
5477 | } | |
22cee43f PMR |
5478 | renaming->searched = 0; |
5479 | } | |
5480 | return num_defns_collected (obstackp) != defns_mark; | |
5481 | } | |
5482 | ||
db230ce3 JB |
5483 | /* Implements compare_names, but only applying the comparision using |
5484 | the given CASING. */ | |
5b4ee69b | 5485 | |
40658b94 | 5486 | static int |
db230ce3 JB |
5487 | compare_names_with_case (const char *string1, const char *string2, |
5488 | enum case_sensitivity casing) | |
40658b94 PH |
5489 | { |
5490 | while (*string1 != '\0' && *string2 != '\0') | |
5491 | { | |
db230ce3 JB |
5492 | char c1, c2; |
5493 | ||
40658b94 PH |
5494 | if (isspace (*string1) || isspace (*string2)) |
5495 | return strcmp_iw_ordered (string1, string2); | |
db230ce3 JB |
5496 | |
5497 | if (casing == case_sensitive_off) | |
5498 | { | |
5499 | c1 = tolower (*string1); | |
5500 | c2 = tolower (*string2); | |
5501 | } | |
5502 | else | |
5503 | { | |
5504 | c1 = *string1; | |
5505 | c2 = *string2; | |
5506 | } | |
5507 | if (c1 != c2) | |
40658b94 | 5508 | break; |
db230ce3 | 5509 | |
40658b94 PH |
5510 | string1 += 1; |
5511 | string2 += 1; | |
5512 | } | |
db230ce3 | 5513 | |
40658b94 PH |
5514 | switch (*string1) |
5515 | { | |
5516 | case '(': | |
5517 | return strcmp_iw_ordered (string1, string2); | |
5518 | case '_': | |
5519 | if (*string2 == '\0') | |
5520 | { | |
052874e8 | 5521 | if (is_name_suffix (string1)) |
40658b94 PH |
5522 | return 0; |
5523 | else | |
1a1d5513 | 5524 | return 1; |
40658b94 | 5525 | } |
dbb8534f | 5526 | /* FALLTHROUGH */ |
40658b94 PH |
5527 | default: |
5528 | if (*string2 == '(') | |
5529 | return strcmp_iw_ordered (string1, string2); | |
5530 | else | |
db230ce3 JB |
5531 | { |
5532 | if (casing == case_sensitive_off) | |
5533 | return tolower (*string1) - tolower (*string2); | |
5534 | else | |
5535 | return *string1 - *string2; | |
5536 | } | |
40658b94 | 5537 | } |
ccefe4c4 TT |
5538 | } |
5539 | ||
db230ce3 JB |
5540 | /* Compare STRING1 to STRING2, with results as for strcmp. |
5541 | Compatible with strcmp_iw_ordered in that... | |
5542 | ||
5543 | strcmp_iw_ordered (STRING1, STRING2) <= 0 | |
5544 | ||
5545 | ... implies... | |
5546 | ||
5547 | compare_names (STRING1, STRING2) <= 0 | |
5548 | ||
5549 | (they may differ as to what symbols compare equal). */ | |
5550 | ||
5551 | static int | |
5552 | compare_names (const char *string1, const char *string2) | |
5553 | { | |
5554 | int result; | |
5555 | ||
5556 | /* Similar to what strcmp_iw_ordered does, we need to perform | |
5557 | a case-insensitive comparison first, and only resort to | |
5558 | a second, case-sensitive, comparison if the first one was | |
5559 | not sufficient to differentiate the two strings. */ | |
5560 | ||
5561 | result = compare_names_with_case (string1, string2, case_sensitive_off); | |
5562 | if (result == 0) | |
5563 | result = compare_names_with_case (string1, string2, case_sensitive_on); | |
5564 | ||
5565 | return result; | |
5566 | } | |
5567 | ||
b5ec771e PA |
5568 | /* Convenience function to get at the Ada encoded lookup name for |
5569 | LOOKUP_NAME, as a C string. */ | |
5570 | ||
5571 | static const char * | |
5572 | ada_lookup_name (const lookup_name_info &lookup_name) | |
5573 | { | |
5574 | return lookup_name.ada ().lookup_name ().c_str (); | |
5575 | } | |
5576 | ||
339c13b6 | 5577 | /* Add to OBSTACKP all non-local symbols whose name and domain match |
b5ec771e PA |
5578 | LOOKUP_NAME and DOMAIN respectively. The search is performed on |
5579 | GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK | |
5580 | symbols otherwise. */ | |
339c13b6 JB |
5581 | |
5582 | static void | |
b5ec771e PA |
5583 | add_nonlocal_symbols (struct obstack *obstackp, |
5584 | const lookup_name_info &lookup_name, | |
5585 | domain_enum domain, int global) | |
339c13b6 | 5586 | { |
40658b94 | 5587 | struct match_data data; |
339c13b6 | 5588 | |
6475f2fe | 5589 | memset (&data, 0, sizeof data); |
ccefe4c4 | 5590 | data.obstackp = obstackp; |
339c13b6 | 5591 | |
b5ec771e PA |
5592 | bool is_wild_match = lookup_name.ada ().wild_match_p (); |
5593 | ||
199b4314 TT |
5594 | auto callback = [&] (struct block_symbol *bsym) |
5595 | { | |
5596 | return aux_add_nonlocal_symbols (bsym, &data); | |
5597 | }; | |
5598 | ||
2030c079 | 5599 | for (objfile *objfile : current_program_space->objfiles ()) |
40658b94 PH |
5600 | { |
5601 | data.objfile = objfile; | |
5602 | ||
b054970d TT |
5603 | objfile->sf->qf->map_matching_symbols (objfile, lookup_name, |
5604 | domain, global, callback, | |
5605 | (is_wild_match | |
5606 | ? NULL : compare_names)); | |
22cee43f | 5607 | |
b669c953 | 5608 | for (compunit_symtab *cu : objfile->compunits ()) |
22cee43f PMR |
5609 | { |
5610 | const struct block *global_block | |
5611 | = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu), GLOBAL_BLOCK); | |
5612 | ||
b5ec771e PA |
5613 | if (ada_add_block_renamings (obstackp, global_block, lookup_name, |
5614 | domain)) | |
22cee43f PMR |
5615 | data.found_sym = 1; |
5616 | } | |
40658b94 PH |
5617 | } |
5618 | ||
5619 | if (num_defns_collected (obstackp) == 0 && global && !is_wild_match) | |
5620 | { | |
b5ec771e | 5621 | const char *name = ada_lookup_name (lookup_name); |
e0802d59 TT |
5622 | std::string bracket_name = std::string ("<_ada_") + name + '>'; |
5623 | lookup_name_info name1 (bracket_name, symbol_name_match_type::FULL); | |
b5ec771e | 5624 | |
2030c079 | 5625 | for (objfile *objfile : current_program_space->objfiles ()) |
40658b94 | 5626 | { |
40658b94 | 5627 | data.objfile = objfile; |
b054970d | 5628 | objfile->sf->qf->map_matching_symbols (objfile, name1, |
199b4314 | 5629 | domain, global, callback, |
b5ec771e | 5630 | compare_names); |
40658b94 PH |
5631 | } |
5632 | } | |
339c13b6 JB |
5633 | } |
5634 | ||
b5ec771e PA |
5635 | /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if |
5636 | FULL_SEARCH is non-zero, enclosing scope and in global scopes, | |
5637 | returning the number of matches. Add these to OBSTACKP. | |
4eeaa230 | 5638 | |
22cee43f PMR |
5639 | When FULL_SEARCH is non-zero, any non-function/non-enumeral |
5640 | symbol match within the nest of blocks whose innermost member is BLOCK, | |
4c4b4cd2 | 5641 | is the one match returned (no other matches in that or |
d9680e73 | 5642 | enclosing blocks is returned). If there are any matches in or |
22cee43f | 5643 | surrounding BLOCK, then these alone are returned. |
4eeaa230 | 5644 | |
b5ec771e PA |
5645 | Names prefixed with "standard__" are handled specially: |
5646 | "standard__" is first stripped off (by the lookup_name | |
5647 | constructor), and only static and global symbols are searched. | |
14f9c5c9 | 5648 | |
22cee43f PMR |
5649 | If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had |
5650 | to lookup global symbols. */ | |
5651 | ||
5652 | static void | |
5653 | ada_add_all_symbols (struct obstack *obstackp, | |
5654 | const struct block *block, | |
b5ec771e | 5655 | const lookup_name_info &lookup_name, |
22cee43f PMR |
5656 | domain_enum domain, |
5657 | int full_search, | |
5658 | int *made_global_lookup_p) | |
14f9c5c9 AS |
5659 | { |
5660 | struct symbol *sym; | |
14f9c5c9 | 5661 | |
22cee43f PMR |
5662 | if (made_global_lookup_p) |
5663 | *made_global_lookup_p = 0; | |
339c13b6 JB |
5664 | |
5665 | /* Special case: If the user specifies a symbol name inside package | |
5666 | Standard, do a non-wild matching of the symbol name without | |
5667 | the "standard__" prefix. This was primarily introduced in order | |
5668 | to allow the user to specifically access the standard exceptions | |
5669 | using, for instance, Standard.Constraint_Error when Constraint_Error | |
5670 | is ambiguous (due to the user defining its own Constraint_Error | |
5671 | entity inside its program). */ | |
b5ec771e PA |
5672 | if (lookup_name.ada ().standard_p ()) |
5673 | block = NULL; | |
4c4b4cd2 | 5674 | |
339c13b6 | 5675 | /* Check the non-global symbols. If we have ANY match, then we're done. */ |
14f9c5c9 | 5676 | |
4eeaa230 DE |
5677 | if (block != NULL) |
5678 | { | |
5679 | if (full_search) | |
b5ec771e | 5680 | ada_add_local_symbols (obstackp, lookup_name, block, domain); |
4eeaa230 DE |
5681 | else |
5682 | { | |
5683 | /* In the !full_search case we're are being called by | |
4009ee92 | 5684 | iterate_over_symbols, and we don't want to search |
4eeaa230 | 5685 | superblocks. */ |
b5ec771e | 5686 | ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL); |
4eeaa230 | 5687 | } |
22cee43f PMR |
5688 | if (num_defns_collected (obstackp) > 0 || !full_search) |
5689 | return; | |
4eeaa230 | 5690 | } |
d2e4a39e | 5691 | |
339c13b6 JB |
5692 | /* No non-global symbols found. Check our cache to see if we have |
5693 | already performed this search before. If we have, then return | |
5694 | the same result. */ | |
5695 | ||
b5ec771e PA |
5696 | if (lookup_cached_symbol (ada_lookup_name (lookup_name), |
5697 | domain, &sym, &block)) | |
4c4b4cd2 PH |
5698 | { |
5699 | if (sym != NULL) | |
b5ec771e | 5700 | add_defn_to_vec (obstackp, sym, block); |
22cee43f | 5701 | return; |
4c4b4cd2 | 5702 | } |
14f9c5c9 | 5703 | |
22cee43f PMR |
5704 | if (made_global_lookup_p) |
5705 | *made_global_lookup_p = 1; | |
b1eedac9 | 5706 | |
339c13b6 JB |
5707 | /* Search symbols from all global blocks. */ |
5708 | ||
b5ec771e | 5709 | add_nonlocal_symbols (obstackp, lookup_name, domain, 1); |
d2e4a39e | 5710 | |
4c4b4cd2 | 5711 | /* Now add symbols from all per-file blocks if we've gotten no hits |
339c13b6 | 5712 | (not strictly correct, but perhaps better than an error). */ |
d2e4a39e | 5713 | |
22cee43f | 5714 | if (num_defns_collected (obstackp) == 0) |
b5ec771e | 5715 | add_nonlocal_symbols (obstackp, lookup_name, domain, 0); |
22cee43f PMR |
5716 | } |
5717 | ||
b5ec771e PA |
5718 | /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH |
5719 | is non-zero, enclosing scope and in global scopes, returning the number of | |
22cee43f | 5720 | matches. |
54d343a2 TT |
5721 | Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols |
5722 | found and the blocks and symbol tables (if any) in which they were | |
5723 | found. | |
22cee43f PMR |
5724 | |
5725 | When full_search is non-zero, any non-function/non-enumeral | |
5726 | symbol match within the nest of blocks whose innermost member is BLOCK, | |
5727 | is the one match returned (no other matches in that or | |
5728 | enclosing blocks is returned). If there are any matches in or | |
5729 | surrounding BLOCK, then these alone are returned. | |
5730 | ||
5731 | Names prefixed with "standard__" are handled specially: "standard__" | |
5732 | is first stripped off, and only static and global symbols are searched. */ | |
5733 | ||
5734 | static int | |
b5ec771e PA |
5735 | ada_lookup_symbol_list_worker (const lookup_name_info &lookup_name, |
5736 | const struct block *block, | |
22cee43f | 5737 | domain_enum domain, |
54d343a2 | 5738 | std::vector<struct block_symbol> *results, |
22cee43f PMR |
5739 | int full_search) |
5740 | { | |
22cee43f PMR |
5741 | int syms_from_global_search; |
5742 | int ndefns; | |
ec6a20c2 | 5743 | auto_obstack obstack; |
22cee43f | 5744 | |
ec6a20c2 | 5745 | ada_add_all_symbols (&obstack, block, lookup_name, |
b5ec771e | 5746 | domain, full_search, &syms_from_global_search); |
14f9c5c9 | 5747 | |
ec6a20c2 JB |
5748 | ndefns = num_defns_collected (&obstack); |
5749 | ||
54d343a2 TT |
5750 | struct block_symbol *base = defns_collected (&obstack, 1); |
5751 | for (int i = 0; i < ndefns; ++i) | |
5752 | results->push_back (base[i]); | |
4c4b4cd2 | 5753 | |
54d343a2 | 5754 | ndefns = remove_extra_symbols (results); |
4c4b4cd2 | 5755 | |
b1eedac9 | 5756 | if (ndefns == 0 && full_search && syms_from_global_search) |
b5ec771e | 5757 | cache_symbol (ada_lookup_name (lookup_name), domain, NULL, NULL); |
14f9c5c9 | 5758 | |
b1eedac9 | 5759 | if (ndefns == 1 && full_search && syms_from_global_search) |
b5ec771e PA |
5760 | cache_symbol (ada_lookup_name (lookup_name), domain, |
5761 | (*results)[0].symbol, (*results)[0].block); | |
14f9c5c9 | 5762 | |
54d343a2 | 5763 | ndefns = remove_irrelevant_renamings (results, block); |
ec6a20c2 | 5764 | |
14f9c5c9 AS |
5765 | return ndefns; |
5766 | } | |
5767 | ||
b5ec771e | 5768 | /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and |
54d343a2 TT |
5769 | in global scopes, returning the number of matches, and filling *RESULTS |
5770 | with (SYM,BLOCK) tuples. | |
ec6a20c2 | 5771 | |
4eeaa230 DE |
5772 | See ada_lookup_symbol_list_worker for further details. */ |
5773 | ||
5774 | int | |
b5ec771e | 5775 | ada_lookup_symbol_list (const char *name, const struct block *block, |
54d343a2 TT |
5776 | domain_enum domain, |
5777 | std::vector<struct block_symbol> *results) | |
4eeaa230 | 5778 | { |
b5ec771e PA |
5779 | symbol_name_match_type name_match_type = name_match_type_from_name (name); |
5780 | lookup_name_info lookup_name (name, name_match_type); | |
5781 | ||
5782 | return ada_lookup_symbol_list_worker (lookup_name, block, domain, results, 1); | |
4eeaa230 DE |
5783 | } |
5784 | ||
4e5c77fe JB |
5785 | /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set |
5786 | to 1, but choosing the first symbol found if there are multiple | |
5787 | choices. | |
5788 | ||
5e2336be JB |
5789 | The result is stored in *INFO, which must be non-NULL. |
5790 | If no match is found, INFO->SYM is set to NULL. */ | |
4e5c77fe JB |
5791 | |
5792 | void | |
5793 | ada_lookup_encoded_symbol (const char *name, const struct block *block, | |
fe978cb0 | 5794 | domain_enum domain, |
d12307c1 | 5795 | struct block_symbol *info) |
14f9c5c9 | 5796 | { |
b5ec771e PA |
5797 | /* Since we already have an encoded name, wrap it in '<>' to force a |
5798 | verbatim match. Otherwise, if the name happens to not look like | |
5799 | an encoded name (because it doesn't include a "__"), | |
5800 | ada_lookup_name_info would re-encode/fold it again, and that | |
5801 | would e.g., incorrectly lowercase object renaming names like | |
5802 | "R28b" -> "r28b". */ | |
5803 | std::string verbatim = std::string ("<") + name + '>'; | |
5804 | ||
5e2336be | 5805 | gdb_assert (info != NULL); |
65392b3e | 5806 | *info = ada_lookup_symbol (verbatim.c_str (), block, domain); |
4e5c77fe | 5807 | } |
aeb5907d JB |
5808 | |
5809 | /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing | |
5810 | scope and in global scopes, or NULL if none. NAME is folded and | |
5811 | encoded first. Otherwise, the result is as for ada_lookup_symbol_list, | |
65392b3e | 5812 | choosing the first symbol if there are multiple choices. */ |
4e5c77fe | 5813 | |
d12307c1 | 5814 | struct block_symbol |
aeb5907d | 5815 | ada_lookup_symbol (const char *name, const struct block *block0, |
65392b3e | 5816 | domain_enum domain) |
aeb5907d | 5817 | { |
54d343a2 | 5818 | std::vector<struct block_symbol> candidates; |
f98fc17b | 5819 | int n_candidates; |
f98fc17b PA |
5820 | |
5821 | n_candidates = ada_lookup_symbol_list (name, block0, domain, &candidates); | |
f98fc17b PA |
5822 | |
5823 | if (n_candidates == 0) | |
54d343a2 | 5824 | return {}; |
f98fc17b PA |
5825 | |
5826 | block_symbol info = candidates[0]; | |
5827 | info.symbol = fixup_symbol_section (info.symbol, NULL); | |
d12307c1 | 5828 | return info; |
4c4b4cd2 | 5829 | } |
14f9c5c9 | 5830 | |
d12307c1 | 5831 | static struct block_symbol |
f606139a DE |
5832 | ada_lookup_symbol_nonlocal (const struct language_defn *langdef, |
5833 | const char *name, | |
76a01679 | 5834 | const struct block *block, |
21b556f4 | 5835 | const domain_enum domain) |
4c4b4cd2 | 5836 | { |
d12307c1 | 5837 | struct block_symbol sym; |
04dccad0 | 5838 | |
65392b3e | 5839 | sym = ada_lookup_symbol (name, block_static_block (block), domain); |
d12307c1 | 5840 | if (sym.symbol != NULL) |
04dccad0 JB |
5841 | return sym; |
5842 | ||
5843 | /* If we haven't found a match at this point, try the primitive | |
5844 | types. In other languages, this search is performed before | |
5845 | searching for global symbols in order to short-circuit that | |
5846 | global-symbol search if it happens that the name corresponds | |
5847 | to a primitive type. But we cannot do the same in Ada, because | |
5848 | it is perfectly legitimate for a program to declare a type which | |
5849 | has the same name as a standard type. If looking up a type in | |
5850 | that situation, we have traditionally ignored the primitive type | |
5851 | in favor of user-defined types. This is why, unlike most other | |
5852 | languages, we search the primitive types this late and only after | |
5853 | having searched the global symbols without success. */ | |
5854 | ||
5855 | if (domain == VAR_DOMAIN) | |
5856 | { | |
5857 | struct gdbarch *gdbarch; | |
5858 | ||
5859 | if (block == NULL) | |
5860 | gdbarch = target_gdbarch (); | |
5861 | else | |
5862 | gdbarch = block_gdbarch (block); | |
d12307c1 PMR |
5863 | sym.symbol = language_lookup_primitive_type_as_symbol (langdef, gdbarch, name); |
5864 | if (sym.symbol != NULL) | |
04dccad0 JB |
5865 | return sym; |
5866 | } | |
5867 | ||
6640a367 | 5868 | return {}; |
14f9c5c9 AS |
5869 | } |
5870 | ||
5871 | ||
4c4b4cd2 PH |
5872 | /* True iff STR is a possible encoded suffix of a normal Ada name |
5873 | that is to be ignored for matching purposes. Suffixes of parallel | |
5874 | names (e.g., XVE) are not included here. Currently, the possible suffixes | |
5823c3ef | 5875 | are given by any of the regular expressions: |
4c4b4cd2 | 5876 | |
babe1480 JB |
5877 | [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux] |
5878 | ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX] | |
9ac7f98e | 5879 | TKB [subprogram suffix for task bodies] |
babe1480 | 5880 | _E[0-9]+[bs]$ [protected object entry suffixes] |
61ee279c | 5881 | (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$ |
babe1480 JB |
5882 | |
5883 | Also, any leading "__[0-9]+" sequence is skipped before the suffix | |
5884 | match is performed. This sequence is used to differentiate homonyms, | |
5885 | is an optional part of a valid name suffix. */ | |
4c4b4cd2 | 5886 | |
14f9c5c9 | 5887 | static int |
d2e4a39e | 5888 | is_name_suffix (const char *str) |
14f9c5c9 AS |
5889 | { |
5890 | int k; | |
4c4b4cd2 PH |
5891 | const char *matching; |
5892 | const int len = strlen (str); | |
5893 | ||
babe1480 JB |
5894 | /* Skip optional leading __[0-9]+. */ |
5895 | ||
4c4b4cd2 PH |
5896 | if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2])) |
5897 | { | |
babe1480 JB |
5898 | str += 3; |
5899 | while (isdigit (str[0])) | |
5900 | str += 1; | |
4c4b4cd2 | 5901 | } |
babe1480 JB |
5902 | |
5903 | /* [.$][0-9]+ */ | |
4c4b4cd2 | 5904 | |
babe1480 | 5905 | if (str[0] == '.' || str[0] == '$') |
4c4b4cd2 | 5906 | { |
babe1480 | 5907 | matching = str + 1; |
4c4b4cd2 PH |
5908 | while (isdigit (matching[0])) |
5909 | matching += 1; | |
5910 | if (matching[0] == '\0') | |
5911 | return 1; | |
5912 | } | |
5913 | ||
5914 | /* ___[0-9]+ */ | |
babe1480 | 5915 | |
4c4b4cd2 PH |
5916 | if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_') |
5917 | { | |
5918 | matching = str + 3; | |
5919 | while (isdigit (matching[0])) | |
5920 | matching += 1; | |
5921 | if (matching[0] == '\0') | |
5922 | return 1; | |
5923 | } | |
5924 | ||
9ac7f98e JB |
5925 | /* "TKB" suffixes are used for subprograms implementing task bodies. */ |
5926 | ||
5927 | if (strcmp (str, "TKB") == 0) | |
5928 | return 1; | |
5929 | ||
529cad9c PH |
5930 | #if 0 |
5931 | /* FIXME: brobecker/2005-09-23: Protected Object subprograms end | |
0963b4bd MS |
5932 | with a N at the end. Unfortunately, the compiler uses the same |
5933 | convention for other internal types it creates. So treating | |
529cad9c | 5934 | all entity names that end with an "N" as a name suffix causes |
0963b4bd MS |
5935 | some regressions. For instance, consider the case of an enumerated |
5936 | type. To support the 'Image attribute, it creates an array whose | |
529cad9c PH |
5937 | name ends with N. |
5938 | Having a single character like this as a suffix carrying some | |
0963b4bd | 5939 | information is a bit risky. Perhaps we should change the encoding |
529cad9c PH |
5940 | to be something like "_N" instead. In the meantime, do not do |
5941 | the following check. */ | |
5942 | /* Protected Object Subprograms */ | |
5943 | if (len == 1 && str [0] == 'N') | |
5944 | return 1; | |
5945 | #endif | |
5946 | ||
5947 | /* _E[0-9]+[bs]$ */ | |
5948 | if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2])) | |
5949 | { | |
5950 | matching = str + 3; | |
5951 | while (isdigit (matching[0])) | |
5952 | matching += 1; | |
5953 | if ((matching[0] == 'b' || matching[0] == 's') | |
5954 | && matching [1] == '\0') | |
5955 | return 1; | |
5956 | } | |
5957 | ||
4c4b4cd2 PH |
5958 | /* ??? We should not modify STR directly, as we are doing below. This |
5959 | is fine in this case, but may become problematic later if we find | |
5960 | that this alternative did not work, and want to try matching | |
5961 | another one from the begining of STR. Since we modified it, we | |
5962 | won't be able to find the begining of the string anymore! */ | |
14f9c5c9 AS |
5963 | if (str[0] == 'X') |
5964 | { | |
5965 | str += 1; | |
d2e4a39e | 5966 | while (str[0] != '_' && str[0] != '\0') |
4c4b4cd2 PH |
5967 | { |
5968 | if (str[0] != 'n' && str[0] != 'b') | |
5969 | return 0; | |
5970 | str += 1; | |
5971 | } | |
14f9c5c9 | 5972 | } |
babe1480 | 5973 | |
14f9c5c9 AS |
5974 | if (str[0] == '\000') |
5975 | return 1; | |
babe1480 | 5976 | |
d2e4a39e | 5977 | if (str[0] == '_') |
14f9c5c9 AS |
5978 | { |
5979 | if (str[1] != '_' || str[2] == '\000') | |
4c4b4cd2 | 5980 | return 0; |
d2e4a39e | 5981 | if (str[2] == '_') |
4c4b4cd2 | 5982 | { |
61ee279c PH |
5983 | if (strcmp (str + 3, "JM") == 0) |
5984 | return 1; | |
5985 | /* FIXME: brobecker/2004-09-30: GNAT will soon stop using | |
5986 | the LJM suffix in favor of the JM one. But we will | |
5987 | still accept LJM as a valid suffix for a reasonable | |
5988 | amount of time, just to allow ourselves to debug programs | |
5989 | compiled using an older version of GNAT. */ | |
4c4b4cd2 PH |
5990 | if (strcmp (str + 3, "LJM") == 0) |
5991 | return 1; | |
5992 | if (str[3] != 'X') | |
5993 | return 0; | |
1265e4aa JB |
5994 | if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B' |
5995 | || str[4] == 'U' || str[4] == 'P') | |
4c4b4cd2 PH |
5996 | return 1; |
5997 | if (str[4] == 'R' && str[5] != 'T') | |
5998 | return 1; | |
5999 | return 0; | |
6000 | } | |
6001 | if (!isdigit (str[2])) | |
6002 | return 0; | |
6003 | for (k = 3; str[k] != '\0'; k += 1) | |
6004 | if (!isdigit (str[k]) && str[k] != '_') | |
6005 | return 0; | |
14f9c5c9 AS |
6006 | return 1; |
6007 | } | |
4c4b4cd2 | 6008 | if (str[0] == '$' && isdigit (str[1])) |
14f9c5c9 | 6009 | { |
4c4b4cd2 PH |
6010 | for (k = 2; str[k] != '\0'; k += 1) |
6011 | if (!isdigit (str[k]) && str[k] != '_') | |
6012 | return 0; | |
14f9c5c9 AS |
6013 | return 1; |
6014 | } | |
6015 | return 0; | |
6016 | } | |
d2e4a39e | 6017 | |
aeb5907d JB |
6018 | /* Return non-zero if the string starting at NAME and ending before |
6019 | NAME_END contains no capital letters. */ | |
529cad9c PH |
6020 | |
6021 | static int | |
6022 | is_valid_name_for_wild_match (const char *name0) | |
6023 | { | |
f945dedf | 6024 | std::string decoded_name = ada_decode (name0); |
529cad9c PH |
6025 | int i; |
6026 | ||
5823c3ef JB |
6027 | /* If the decoded name starts with an angle bracket, it means that |
6028 | NAME0 does not follow the GNAT encoding format. It should then | |
6029 | not be allowed as a possible wild match. */ | |
6030 | if (decoded_name[0] == '<') | |
6031 | return 0; | |
6032 | ||
529cad9c PH |
6033 | for (i=0; decoded_name[i] != '\0'; i++) |
6034 | if (isalpha (decoded_name[i]) && !islower (decoded_name[i])) | |
6035 | return 0; | |
6036 | ||
6037 | return 1; | |
6038 | } | |
6039 | ||
73589123 PH |
6040 | /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0 |
6041 | that could start a simple name. Assumes that *NAMEP points into | |
6042 | the string beginning at NAME0. */ | |
4c4b4cd2 | 6043 | |
14f9c5c9 | 6044 | static int |
73589123 | 6045 | advance_wild_match (const char **namep, const char *name0, int target0) |
14f9c5c9 | 6046 | { |
73589123 | 6047 | const char *name = *namep; |
5b4ee69b | 6048 | |
5823c3ef | 6049 | while (1) |
14f9c5c9 | 6050 | { |
aa27d0b3 | 6051 | int t0, t1; |
73589123 PH |
6052 | |
6053 | t0 = *name; | |
6054 | if (t0 == '_') | |
6055 | { | |
6056 | t1 = name[1]; | |
6057 | if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9')) | |
6058 | { | |
6059 | name += 1; | |
61012eef | 6060 | if (name == name0 + 5 && startswith (name0, "_ada")) |
73589123 PH |
6061 | break; |
6062 | else | |
6063 | name += 1; | |
6064 | } | |
aa27d0b3 JB |
6065 | else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z') |
6066 | || name[2] == target0)) | |
73589123 PH |
6067 | { |
6068 | name += 2; | |
6069 | break; | |
6070 | } | |
6071 | else | |
6072 | return 0; | |
6073 | } | |
6074 | else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9')) | |
6075 | name += 1; | |
6076 | else | |
5823c3ef | 6077 | return 0; |
73589123 PH |
6078 | } |
6079 | ||
6080 | *namep = name; | |
6081 | return 1; | |
6082 | } | |
6083 | ||
b5ec771e PA |
6084 | /* Return true iff NAME encodes a name of the form prefix.PATN. |
6085 | Ignores any informational suffixes of NAME (i.e., for which | |
6086 | is_name_suffix is true). Assumes that PATN is a lower-cased Ada | |
6087 | simple name. */ | |
73589123 | 6088 | |
b5ec771e | 6089 | static bool |
73589123 PH |
6090 | wild_match (const char *name, const char *patn) |
6091 | { | |
22e048c9 | 6092 | const char *p; |
73589123 PH |
6093 | const char *name0 = name; |
6094 | ||
6095 | while (1) | |
6096 | { | |
6097 | const char *match = name; | |
6098 | ||
6099 | if (*name == *patn) | |
6100 | { | |
6101 | for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1) | |
6102 | if (*p != *name) | |
6103 | break; | |
6104 | if (*p == '\0' && is_name_suffix (name)) | |
b5ec771e | 6105 | return match == name0 || is_valid_name_for_wild_match (name0); |
73589123 PH |
6106 | |
6107 | if (name[-1] == '_') | |
6108 | name -= 1; | |
6109 | } | |
6110 | if (!advance_wild_match (&name, name0, *patn)) | |
b5ec771e | 6111 | return false; |
96d887e8 | 6112 | } |
96d887e8 PH |
6113 | } |
6114 | ||
b5ec771e PA |
6115 | /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring |
6116 | any trailing suffixes that encode debugging information or leading | |
6117 | _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging | |
6118 | information that is ignored). */ | |
40658b94 | 6119 | |
b5ec771e | 6120 | static bool |
c4d840bd PH |
6121 | full_match (const char *sym_name, const char *search_name) |
6122 | { | |
b5ec771e PA |
6123 | size_t search_name_len = strlen (search_name); |
6124 | ||
6125 | if (strncmp (sym_name, search_name, search_name_len) == 0 | |
6126 | && is_name_suffix (sym_name + search_name_len)) | |
6127 | return true; | |
6128 | ||
6129 | if (startswith (sym_name, "_ada_") | |
6130 | && strncmp (sym_name + 5, search_name, search_name_len) == 0 | |
6131 | && is_name_suffix (sym_name + search_name_len + 5)) | |
6132 | return true; | |
c4d840bd | 6133 | |
b5ec771e PA |
6134 | return false; |
6135 | } | |
c4d840bd | 6136 | |
b5ec771e PA |
6137 | /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector |
6138 | *defn_symbols, updating the list of symbols in OBSTACKP (if | |
6139 | necessary). OBJFILE is the section containing BLOCK. */ | |
96d887e8 PH |
6140 | |
6141 | static void | |
6142 | ada_add_block_symbols (struct obstack *obstackp, | |
b5ec771e PA |
6143 | const struct block *block, |
6144 | const lookup_name_info &lookup_name, | |
6145 | domain_enum domain, struct objfile *objfile) | |
96d887e8 | 6146 | { |
8157b174 | 6147 | struct block_iterator iter; |
96d887e8 PH |
6148 | /* A matching argument symbol, if any. */ |
6149 | struct symbol *arg_sym; | |
6150 | /* Set true when we find a matching non-argument symbol. */ | |
6151 | int found_sym; | |
6152 | struct symbol *sym; | |
6153 | ||
6154 | arg_sym = NULL; | |
6155 | found_sym = 0; | |
b5ec771e PA |
6156 | for (sym = block_iter_match_first (block, lookup_name, &iter); |
6157 | sym != NULL; | |
6158 | sym = block_iter_match_next (lookup_name, &iter)) | |
96d887e8 | 6159 | { |
c1b5c1eb | 6160 | if (symbol_matches_domain (sym->language (), SYMBOL_DOMAIN (sym), domain)) |
b5ec771e PA |
6161 | { |
6162 | if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED) | |
6163 | { | |
6164 | if (SYMBOL_IS_ARGUMENT (sym)) | |
6165 | arg_sym = sym; | |
6166 | else | |
6167 | { | |
6168 | found_sym = 1; | |
6169 | add_defn_to_vec (obstackp, | |
6170 | fixup_symbol_section (sym, objfile), | |
6171 | block); | |
6172 | } | |
6173 | } | |
6174 | } | |
96d887e8 PH |
6175 | } |
6176 | ||
22cee43f PMR |
6177 | /* Handle renamings. */ |
6178 | ||
b5ec771e | 6179 | if (ada_add_block_renamings (obstackp, block, lookup_name, domain)) |
22cee43f PMR |
6180 | found_sym = 1; |
6181 | ||
96d887e8 PH |
6182 | if (!found_sym && arg_sym != NULL) |
6183 | { | |
76a01679 JB |
6184 | add_defn_to_vec (obstackp, |
6185 | fixup_symbol_section (arg_sym, objfile), | |
2570f2b7 | 6186 | block); |
96d887e8 PH |
6187 | } |
6188 | ||
b5ec771e | 6189 | if (!lookup_name.ada ().wild_match_p ()) |
96d887e8 PH |
6190 | { |
6191 | arg_sym = NULL; | |
6192 | found_sym = 0; | |
b5ec771e PA |
6193 | const std::string &ada_lookup_name = lookup_name.ada ().lookup_name (); |
6194 | const char *name = ada_lookup_name.c_str (); | |
6195 | size_t name_len = ada_lookup_name.size (); | |
96d887e8 PH |
6196 | |
6197 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
76a01679 | 6198 | { |
c1b5c1eb | 6199 | if (symbol_matches_domain (sym->language (), |
4186eb54 | 6200 | SYMBOL_DOMAIN (sym), domain)) |
76a01679 JB |
6201 | { |
6202 | int cmp; | |
6203 | ||
987012b8 | 6204 | cmp = (int) '_' - (int) sym->linkage_name ()[0]; |
76a01679 JB |
6205 | if (cmp == 0) |
6206 | { | |
987012b8 | 6207 | cmp = !startswith (sym->linkage_name (), "_ada_"); |
76a01679 | 6208 | if (cmp == 0) |
987012b8 | 6209 | cmp = strncmp (name, sym->linkage_name () + 5, |
76a01679 JB |
6210 | name_len); |
6211 | } | |
6212 | ||
6213 | if (cmp == 0 | |
987012b8 | 6214 | && is_name_suffix (sym->linkage_name () + name_len + 5)) |
76a01679 | 6215 | { |
2a2d4dc3 AS |
6216 | if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED) |
6217 | { | |
6218 | if (SYMBOL_IS_ARGUMENT (sym)) | |
6219 | arg_sym = sym; | |
6220 | else | |
6221 | { | |
6222 | found_sym = 1; | |
6223 | add_defn_to_vec (obstackp, | |
6224 | fixup_symbol_section (sym, objfile), | |
6225 | block); | |
6226 | } | |
6227 | } | |
76a01679 JB |
6228 | } |
6229 | } | |
76a01679 | 6230 | } |
96d887e8 PH |
6231 | |
6232 | /* NOTE: This really shouldn't be needed for _ada_ symbols. | |
6233 | They aren't parameters, right? */ | |
6234 | if (!found_sym && arg_sym != NULL) | |
6235 | { | |
6236 | add_defn_to_vec (obstackp, | |
76a01679 | 6237 | fixup_symbol_section (arg_sym, objfile), |
2570f2b7 | 6238 | block); |
96d887e8 PH |
6239 | } |
6240 | } | |
6241 | } | |
6242 | \f | |
41d27058 JB |
6243 | |
6244 | /* Symbol Completion */ | |
6245 | ||
b5ec771e | 6246 | /* See symtab.h. */ |
41d27058 | 6247 | |
b5ec771e PA |
6248 | bool |
6249 | ada_lookup_name_info::matches | |
6250 | (const char *sym_name, | |
6251 | symbol_name_match_type match_type, | |
a207cff2 | 6252 | completion_match_result *comp_match_res) const |
41d27058 | 6253 | { |
b5ec771e PA |
6254 | bool match = false; |
6255 | const char *text = m_encoded_name.c_str (); | |
6256 | size_t text_len = m_encoded_name.size (); | |
41d27058 JB |
6257 | |
6258 | /* First, test against the fully qualified name of the symbol. */ | |
6259 | ||
6260 | if (strncmp (sym_name, text, text_len) == 0) | |
b5ec771e | 6261 | match = true; |
41d27058 | 6262 | |
f945dedf | 6263 | std::string decoded_name = ada_decode (sym_name); |
b5ec771e | 6264 | if (match && !m_encoded_p) |
41d27058 JB |
6265 | { |
6266 | /* One needed check before declaring a positive match is to verify | |
6267 | that iff we are doing a verbatim match, the decoded version | |
6268 | of the symbol name starts with '<'. Otherwise, this symbol name | |
6269 | is not a suitable completion. */ | |
41d27058 | 6270 | |
f945dedf | 6271 | bool has_angle_bracket = (decoded_name[0] == '<'); |
b5ec771e | 6272 | match = (has_angle_bracket == m_verbatim_p); |
41d27058 JB |
6273 | } |
6274 | ||
b5ec771e | 6275 | if (match && !m_verbatim_p) |
41d27058 JB |
6276 | { |
6277 | /* When doing non-verbatim match, another check that needs to | |
6278 | be done is to verify that the potentially matching symbol name | |
6279 | does not include capital letters, because the ada-mode would | |
6280 | not be able to understand these symbol names without the | |
6281 | angle bracket notation. */ | |
6282 | const char *tmp; | |
6283 | ||
6284 | for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++); | |
6285 | if (*tmp != '\0') | |
b5ec771e | 6286 | match = false; |
41d27058 JB |
6287 | } |
6288 | ||
6289 | /* Second: Try wild matching... */ | |
6290 | ||
b5ec771e | 6291 | if (!match && m_wild_match_p) |
41d27058 JB |
6292 | { |
6293 | /* Since we are doing wild matching, this means that TEXT | |
6294 | may represent an unqualified symbol name. We therefore must | |
6295 | also compare TEXT against the unqualified name of the symbol. */ | |
f945dedf | 6296 | sym_name = ada_unqualified_name (decoded_name.c_str ()); |
41d27058 JB |
6297 | |
6298 | if (strncmp (sym_name, text, text_len) == 0) | |
b5ec771e | 6299 | match = true; |
41d27058 JB |
6300 | } |
6301 | ||
b5ec771e | 6302 | /* Finally: If we found a match, prepare the result to return. */ |
41d27058 JB |
6303 | |
6304 | if (!match) | |
b5ec771e | 6305 | return false; |
41d27058 | 6306 | |
a207cff2 | 6307 | if (comp_match_res != NULL) |
b5ec771e | 6308 | { |
a207cff2 | 6309 | std::string &match_str = comp_match_res->match.storage (); |
41d27058 | 6310 | |
b5ec771e | 6311 | if (!m_encoded_p) |
a207cff2 | 6312 | match_str = ada_decode (sym_name); |
b5ec771e PA |
6313 | else |
6314 | { | |
6315 | if (m_verbatim_p) | |
6316 | match_str = add_angle_brackets (sym_name); | |
6317 | else | |
6318 | match_str = sym_name; | |
41d27058 | 6319 | |
b5ec771e | 6320 | } |
a207cff2 PA |
6321 | |
6322 | comp_match_res->set_match (match_str.c_str ()); | |
41d27058 JB |
6323 | } |
6324 | ||
b5ec771e | 6325 | return true; |
41d27058 JB |
6326 | } |
6327 | ||
b5ec771e | 6328 | /* Add the list of possible symbol names completing TEXT to TRACKER. |
eb3ff9a5 | 6329 | WORD is the entire command on which completion is made. */ |
41d27058 | 6330 | |
eb3ff9a5 PA |
6331 | static void |
6332 | ada_collect_symbol_completion_matches (completion_tracker &tracker, | |
c6756f62 | 6333 | complete_symbol_mode mode, |
b5ec771e PA |
6334 | symbol_name_match_type name_match_type, |
6335 | const char *text, const char *word, | |
eb3ff9a5 | 6336 | enum type_code code) |
41d27058 | 6337 | { |
41d27058 | 6338 | struct symbol *sym; |
3977b71f | 6339 | const struct block *b, *surrounding_static_block = 0; |
8157b174 | 6340 | struct block_iterator iter; |
41d27058 | 6341 | |
2f68a895 TT |
6342 | gdb_assert (code == TYPE_CODE_UNDEF); |
6343 | ||
1b026119 | 6344 | lookup_name_info lookup_name (text, name_match_type, true); |
41d27058 JB |
6345 | |
6346 | /* First, look at the partial symtab symbols. */ | |
14bc53a8 | 6347 | expand_symtabs_matching (NULL, |
b5ec771e PA |
6348 | lookup_name, |
6349 | NULL, | |
14bc53a8 PA |
6350 | NULL, |
6351 | ALL_DOMAIN); | |
41d27058 JB |
6352 | |
6353 | /* At this point scan through the misc symbol vectors and add each | |
6354 | symbol you find to the list. Eventually we want to ignore | |
6355 | anything that isn't a text symbol (everything else will be | |
6356 | handled by the psymtab code above). */ | |
6357 | ||
2030c079 | 6358 | for (objfile *objfile : current_program_space->objfiles ()) |
5325b9bf | 6359 | { |
7932255d | 6360 | for (minimal_symbol *msymbol : objfile->msymbols ()) |
5325b9bf TT |
6361 | { |
6362 | QUIT; | |
6363 | ||
6364 | if (completion_skip_symbol (mode, msymbol)) | |
6365 | continue; | |
6366 | ||
c1b5c1eb | 6367 | language symbol_language = msymbol->language (); |
5325b9bf TT |
6368 | |
6369 | /* Ada minimal symbols won't have their language set to Ada. If | |
6370 | we let completion_list_add_name compare using the | |
6371 | default/C-like matcher, then when completing e.g., symbols in a | |
6372 | package named "pck", we'd match internal Ada symbols like | |
6373 | "pckS", which are invalid in an Ada expression, unless you wrap | |
6374 | them in '<' '>' to request a verbatim match. | |
6375 | ||
6376 | Unfortunately, some Ada encoded names successfully demangle as | |
6377 | C++ symbols (using an old mangling scheme), such as "name__2Xn" | |
6378 | -> "Xn::name(void)" and thus some Ada minimal symbols end up | |
6379 | with the wrong language set. Paper over that issue here. */ | |
6380 | if (symbol_language == language_auto | |
6381 | || symbol_language == language_cplus) | |
6382 | symbol_language = language_ada; | |
6383 | ||
6384 | completion_list_add_name (tracker, | |
6385 | symbol_language, | |
c9d95fa3 | 6386 | msymbol->linkage_name (), |
5325b9bf TT |
6387 | lookup_name, text, word); |
6388 | } | |
6389 | } | |
41d27058 JB |
6390 | |
6391 | /* Search upwards from currently selected frame (so that we can | |
6392 | complete on local vars. */ | |
6393 | ||
6394 | for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b)) | |
6395 | { | |
6396 | if (!BLOCK_SUPERBLOCK (b)) | |
6397 | surrounding_static_block = b; /* For elmin of dups */ | |
6398 | ||
6399 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6400 | { | |
f9d67a22 PA |
6401 | if (completion_skip_symbol (mode, sym)) |
6402 | continue; | |
6403 | ||
b5ec771e | 6404 | completion_list_add_name (tracker, |
c1b5c1eb | 6405 | sym->language (), |
987012b8 | 6406 | sym->linkage_name (), |
1b026119 | 6407 | lookup_name, text, word); |
41d27058 JB |
6408 | } |
6409 | } | |
6410 | ||
6411 | /* Go through the symtabs and check the externs and statics for | |
43f3e411 | 6412 | symbols which match. */ |
41d27058 | 6413 | |
2030c079 | 6414 | for (objfile *objfile : current_program_space->objfiles ()) |
41d27058 | 6415 | { |
b669c953 | 6416 | for (compunit_symtab *s : objfile->compunits ()) |
d8aeb77f TT |
6417 | { |
6418 | QUIT; | |
6419 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), GLOBAL_BLOCK); | |
6420 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6421 | { | |
6422 | if (completion_skip_symbol (mode, sym)) | |
6423 | continue; | |
f9d67a22 | 6424 | |
d8aeb77f | 6425 | completion_list_add_name (tracker, |
c1b5c1eb | 6426 | sym->language (), |
987012b8 | 6427 | sym->linkage_name (), |
d8aeb77f TT |
6428 | lookup_name, text, word); |
6429 | } | |
6430 | } | |
41d27058 | 6431 | } |
41d27058 | 6432 | |
2030c079 | 6433 | for (objfile *objfile : current_program_space->objfiles ()) |
d8aeb77f | 6434 | { |
b669c953 | 6435 | for (compunit_symtab *s : objfile->compunits ()) |
d8aeb77f TT |
6436 | { |
6437 | QUIT; | |
6438 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), STATIC_BLOCK); | |
6439 | /* Don't do this block twice. */ | |
6440 | if (b == surrounding_static_block) | |
6441 | continue; | |
6442 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6443 | { | |
6444 | if (completion_skip_symbol (mode, sym)) | |
6445 | continue; | |
f9d67a22 | 6446 | |
d8aeb77f | 6447 | completion_list_add_name (tracker, |
c1b5c1eb | 6448 | sym->language (), |
987012b8 | 6449 | sym->linkage_name (), |
d8aeb77f TT |
6450 | lookup_name, text, word); |
6451 | } | |
6452 | } | |
41d27058 | 6453 | } |
41d27058 JB |
6454 | } |
6455 | ||
963a6417 | 6456 | /* Field Access */ |
96d887e8 | 6457 | |
73fb9985 JB |
6458 | /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used |
6459 | for tagged types. */ | |
6460 | ||
6461 | static int | |
6462 | ada_is_dispatch_table_ptr_type (struct type *type) | |
6463 | { | |
0d5cff50 | 6464 | const char *name; |
73fb9985 | 6465 | |
78134374 | 6466 | if (type->code () != TYPE_CODE_PTR) |
73fb9985 JB |
6467 | return 0; |
6468 | ||
7d93a1e0 | 6469 | name = TYPE_TARGET_TYPE (type)->name (); |
73fb9985 JB |
6470 | if (name == NULL) |
6471 | return 0; | |
6472 | ||
6473 | return (strcmp (name, "ada__tags__dispatch_table") == 0); | |
6474 | } | |
6475 | ||
ac4a2da4 JG |
6476 | /* Return non-zero if TYPE is an interface tag. */ |
6477 | ||
6478 | static int | |
6479 | ada_is_interface_tag (struct type *type) | |
6480 | { | |
7d93a1e0 | 6481 | const char *name = type->name (); |
ac4a2da4 JG |
6482 | |
6483 | if (name == NULL) | |
6484 | return 0; | |
6485 | ||
6486 | return (strcmp (name, "ada__tags__interface_tag") == 0); | |
6487 | } | |
6488 | ||
963a6417 PH |
6489 | /* True if field number FIELD_NUM in struct or union type TYPE is supposed |
6490 | to be invisible to users. */ | |
96d887e8 | 6491 | |
963a6417 PH |
6492 | int |
6493 | ada_is_ignored_field (struct type *type, int field_num) | |
96d887e8 | 6494 | { |
1f704f76 | 6495 | if (field_num < 0 || field_num > type->num_fields ()) |
963a6417 | 6496 | return 1; |
ffde82bf | 6497 | |
73fb9985 JB |
6498 | /* Check the name of that field. */ |
6499 | { | |
6500 | const char *name = TYPE_FIELD_NAME (type, field_num); | |
6501 | ||
6502 | /* Anonymous field names should not be printed. | |
6503 | brobecker/2007-02-20: I don't think this can actually happen | |
30baf67b | 6504 | but we don't want to print the value of anonymous fields anyway. */ |
73fb9985 JB |
6505 | if (name == NULL) |
6506 | return 1; | |
6507 | ||
ffde82bf JB |
6508 | /* Normally, fields whose name start with an underscore ("_") |
6509 | are fields that have been internally generated by the compiler, | |
6510 | and thus should not be printed. The "_parent" field is special, | |
6511 | however: This is a field internally generated by the compiler | |
6512 | for tagged types, and it contains the components inherited from | |
6513 | the parent type. This field should not be printed as is, but | |
6514 | should not be ignored either. */ | |
61012eef | 6515 | if (name[0] == '_' && !startswith (name, "_parent")) |
73fb9985 JB |
6516 | return 1; |
6517 | } | |
6518 | ||
ac4a2da4 JG |
6519 | /* If this is the dispatch table of a tagged type or an interface tag, |
6520 | then ignore. */ | |
73fb9985 | 6521 | if (ada_is_tagged_type (type, 1) |
ac4a2da4 JG |
6522 | && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)) |
6523 | || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num)))) | |
73fb9985 JB |
6524 | return 1; |
6525 | ||
6526 | /* Not a special field, so it should not be ignored. */ | |
6527 | return 0; | |
963a6417 | 6528 | } |
96d887e8 | 6529 | |
963a6417 | 6530 | /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a |
0963b4bd | 6531 | pointer or reference type whose ultimate target has a tag field. */ |
96d887e8 | 6532 | |
963a6417 PH |
6533 | int |
6534 | ada_is_tagged_type (struct type *type, int refok) | |
6535 | { | |
988f6b3d | 6536 | return (ada_lookup_struct_elt_type (type, "_tag", refok, 1) != NULL); |
963a6417 | 6537 | } |
96d887e8 | 6538 | |
963a6417 | 6539 | /* True iff TYPE represents the type of X'Tag */ |
96d887e8 | 6540 | |
963a6417 PH |
6541 | int |
6542 | ada_is_tag_type (struct type *type) | |
6543 | { | |
460efde1 JB |
6544 | type = ada_check_typedef (type); |
6545 | ||
78134374 | 6546 | if (type == NULL || type->code () != TYPE_CODE_PTR) |
963a6417 PH |
6547 | return 0; |
6548 | else | |
96d887e8 | 6549 | { |
963a6417 | 6550 | const char *name = ada_type_name (TYPE_TARGET_TYPE (type)); |
5b4ee69b | 6551 | |
963a6417 PH |
6552 | return (name != NULL |
6553 | && strcmp (name, "ada__tags__dispatch_table") == 0); | |
96d887e8 | 6554 | } |
96d887e8 PH |
6555 | } |
6556 | ||
963a6417 | 6557 | /* The type of the tag on VAL. */ |
76a01679 | 6558 | |
de93309a | 6559 | static struct type * |
963a6417 | 6560 | ada_tag_type (struct value *val) |
96d887e8 | 6561 | { |
988f6b3d | 6562 | return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0); |
963a6417 | 6563 | } |
96d887e8 | 6564 | |
b50d69b5 JG |
6565 | /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95, |
6566 | retired at Ada 05). */ | |
6567 | ||
6568 | static int | |
6569 | is_ada95_tag (struct value *tag) | |
6570 | { | |
6571 | return ada_value_struct_elt (tag, "tsd", 1) != NULL; | |
6572 | } | |
6573 | ||
963a6417 | 6574 | /* The value of the tag on VAL. */ |
96d887e8 | 6575 | |
de93309a | 6576 | static struct value * |
963a6417 PH |
6577 | ada_value_tag (struct value *val) |
6578 | { | |
03ee6b2e | 6579 | return ada_value_struct_elt (val, "_tag", 0); |
96d887e8 PH |
6580 | } |
6581 | ||
963a6417 PH |
6582 | /* The value of the tag on the object of type TYPE whose contents are |
6583 | saved at VALADDR, if it is non-null, or is at memory address | |
0963b4bd | 6584 | ADDRESS. */ |
96d887e8 | 6585 | |
963a6417 | 6586 | static struct value * |
10a2c479 | 6587 | value_tag_from_contents_and_address (struct type *type, |
fc1a4b47 | 6588 | const gdb_byte *valaddr, |
963a6417 | 6589 | CORE_ADDR address) |
96d887e8 | 6590 | { |
b5385fc0 | 6591 | int tag_byte_offset; |
963a6417 | 6592 | struct type *tag_type; |
5b4ee69b | 6593 | |
963a6417 | 6594 | if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset, |
52ce6436 | 6595 | NULL, NULL, NULL)) |
96d887e8 | 6596 | { |
fc1a4b47 | 6597 | const gdb_byte *valaddr1 = ((valaddr == NULL) |
10a2c479 AC |
6598 | ? NULL |
6599 | : valaddr + tag_byte_offset); | |
963a6417 | 6600 | CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset; |
96d887e8 | 6601 | |
963a6417 | 6602 | return value_from_contents_and_address (tag_type, valaddr1, address1); |
96d887e8 | 6603 | } |
963a6417 PH |
6604 | return NULL; |
6605 | } | |
96d887e8 | 6606 | |
963a6417 PH |
6607 | static struct type * |
6608 | type_from_tag (struct value *tag) | |
6609 | { | |
6610 | const char *type_name = ada_tag_name (tag); | |
5b4ee69b | 6611 | |
963a6417 PH |
6612 | if (type_name != NULL) |
6613 | return ada_find_any_type (ada_encode (type_name)); | |
6614 | return NULL; | |
6615 | } | |
96d887e8 | 6616 | |
b50d69b5 JG |
6617 | /* Given a value OBJ of a tagged type, return a value of this |
6618 | type at the base address of the object. The base address, as | |
6619 | defined in Ada.Tags, it is the address of the primary tag of | |
6620 | the object, and therefore where the field values of its full | |
6621 | view can be fetched. */ | |
6622 | ||
6623 | struct value * | |
6624 | ada_tag_value_at_base_address (struct value *obj) | |
6625 | { | |
b50d69b5 JG |
6626 | struct value *val; |
6627 | LONGEST offset_to_top = 0; | |
6628 | struct type *ptr_type, *obj_type; | |
6629 | struct value *tag; | |
6630 | CORE_ADDR base_address; | |
6631 | ||
6632 | obj_type = value_type (obj); | |
6633 | ||
6634 | /* It is the responsability of the caller to deref pointers. */ | |
6635 | ||
78134374 | 6636 | if (obj_type->code () == TYPE_CODE_PTR || obj_type->code () == TYPE_CODE_REF) |
b50d69b5 JG |
6637 | return obj; |
6638 | ||
6639 | tag = ada_value_tag (obj); | |
6640 | if (!tag) | |
6641 | return obj; | |
6642 | ||
6643 | /* Base addresses only appeared with Ada 05 and multiple inheritance. */ | |
6644 | ||
6645 | if (is_ada95_tag (tag)) | |
6646 | return obj; | |
6647 | ||
08f49010 XR |
6648 | ptr_type = language_lookup_primitive_type |
6649 | (language_def (language_ada), target_gdbarch(), "storage_offset"); | |
b50d69b5 JG |
6650 | ptr_type = lookup_pointer_type (ptr_type); |
6651 | val = value_cast (ptr_type, tag); | |
6652 | if (!val) | |
6653 | return obj; | |
6654 | ||
6655 | /* It is perfectly possible that an exception be raised while | |
6656 | trying to determine the base address, just like for the tag; | |
6657 | see ada_tag_name for more details. We do not print the error | |
6658 | message for the same reason. */ | |
6659 | ||
a70b8144 | 6660 | try |
b50d69b5 JG |
6661 | { |
6662 | offset_to_top = value_as_long (value_ind (value_ptradd (val, -2))); | |
6663 | } | |
6664 | ||
230d2906 | 6665 | catch (const gdb_exception_error &e) |
492d29ea PA |
6666 | { |
6667 | return obj; | |
6668 | } | |
b50d69b5 JG |
6669 | |
6670 | /* If offset is null, nothing to do. */ | |
6671 | ||
6672 | if (offset_to_top == 0) | |
6673 | return obj; | |
6674 | ||
6675 | /* -1 is a special case in Ada.Tags; however, what should be done | |
6676 | is not quite clear from the documentation. So do nothing for | |
6677 | now. */ | |
6678 | ||
6679 | if (offset_to_top == -1) | |
6680 | return obj; | |
6681 | ||
08f49010 XR |
6682 | /* OFFSET_TO_TOP used to be a positive value to be subtracted |
6683 | from the base address. This was however incompatible with | |
6684 | C++ dispatch table: C++ uses a *negative* value to *add* | |
6685 | to the base address. Ada's convention has therefore been | |
6686 | changed in GNAT 19.0w 20171023: since then, C++ and Ada | |
6687 | use the same convention. Here, we support both cases by | |
6688 | checking the sign of OFFSET_TO_TOP. */ | |
6689 | ||
6690 | if (offset_to_top > 0) | |
6691 | offset_to_top = -offset_to_top; | |
6692 | ||
6693 | base_address = value_address (obj) + offset_to_top; | |
b50d69b5 JG |
6694 | tag = value_tag_from_contents_and_address (obj_type, NULL, base_address); |
6695 | ||
6696 | /* Make sure that we have a proper tag at the new address. | |
6697 | Otherwise, offset_to_top is bogus (which can happen when | |
6698 | the object is not initialized yet). */ | |
6699 | ||
6700 | if (!tag) | |
6701 | return obj; | |
6702 | ||
6703 | obj_type = type_from_tag (tag); | |
6704 | ||
6705 | if (!obj_type) | |
6706 | return obj; | |
6707 | ||
6708 | return value_from_contents_and_address (obj_type, NULL, base_address); | |
6709 | } | |
6710 | ||
1b611343 JB |
6711 | /* Return the "ada__tags__type_specific_data" type. */ |
6712 | ||
6713 | static struct type * | |
6714 | ada_get_tsd_type (struct inferior *inf) | |
963a6417 | 6715 | { |
1b611343 | 6716 | struct ada_inferior_data *data = get_ada_inferior_data (inf); |
4c4b4cd2 | 6717 | |
1b611343 JB |
6718 | if (data->tsd_type == 0) |
6719 | data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data"); | |
6720 | return data->tsd_type; | |
6721 | } | |
529cad9c | 6722 | |
1b611343 JB |
6723 | /* Return the TSD (type-specific data) associated to the given TAG. |
6724 | TAG is assumed to be the tag of a tagged-type entity. | |
529cad9c | 6725 | |
1b611343 | 6726 | May return NULL if we are unable to get the TSD. */ |
4c4b4cd2 | 6727 | |
1b611343 JB |
6728 | static struct value * |
6729 | ada_get_tsd_from_tag (struct value *tag) | |
4c4b4cd2 | 6730 | { |
4c4b4cd2 | 6731 | struct value *val; |
1b611343 | 6732 | struct type *type; |
5b4ee69b | 6733 | |
1b611343 JB |
6734 | /* First option: The TSD is simply stored as a field of our TAG. |
6735 | Only older versions of GNAT would use this format, but we have | |
6736 | to test it first, because there are no visible markers for | |
6737 | the current approach except the absence of that field. */ | |
529cad9c | 6738 | |
1b611343 JB |
6739 | val = ada_value_struct_elt (tag, "tsd", 1); |
6740 | if (val) | |
6741 | return val; | |
e802dbe0 | 6742 | |
1b611343 JB |
6743 | /* Try the second representation for the dispatch table (in which |
6744 | there is no explicit 'tsd' field in the referent of the tag pointer, | |
6745 | and instead the tsd pointer is stored just before the dispatch | |
6746 | table. */ | |
e802dbe0 | 6747 | |
1b611343 JB |
6748 | type = ada_get_tsd_type (current_inferior()); |
6749 | if (type == NULL) | |
6750 | return NULL; | |
6751 | type = lookup_pointer_type (lookup_pointer_type (type)); | |
6752 | val = value_cast (type, tag); | |
6753 | if (val == NULL) | |
6754 | return NULL; | |
6755 | return value_ind (value_ptradd (val, -1)); | |
e802dbe0 JB |
6756 | } |
6757 | ||
1b611343 JB |
6758 | /* Given the TSD of a tag (type-specific data), return a string |
6759 | containing the name of the associated type. | |
6760 | ||
6761 | The returned value is good until the next call. May return NULL | |
6762 | if we are unable to determine the tag name. */ | |
6763 | ||
6764 | static char * | |
6765 | ada_tag_name_from_tsd (struct value *tsd) | |
529cad9c | 6766 | { |
529cad9c PH |
6767 | static char name[1024]; |
6768 | char *p; | |
1b611343 | 6769 | struct value *val; |
529cad9c | 6770 | |
1b611343 | 6771 | val = ada_value_struct_elt (tsd, "expanded_name", 1); |
4c4b4cd2 | 6772 | if (val == NULL) |
1b611343 | 6773 | return NULL; |
4c4b4cd2 PH |
6774 | read_memory_string (value_as_address (val), name, sizeof (name) - 1); |
6775 | for (p = name; *p != '\0'; p += 1) | |
6776 | if (isalpha (*p)) | |
6777 | *p = tolower (*p); | |
1b611343 | 6778 | return name; |
4c4b4cd2 PH |
6779 | } |
6780 | ||
6781 | /* The type name of the dynamic type denoted by the 'tag value TAG, as | |
1b611343 JB |
6782 | a C string. |
6783 | ||
6784 | Return NULL if the TAG is not an Ada tag, or if we were unable to | |
6785 | determine the name of that tag. The result is good until the next | |
6786 | call. */ | |
4c4b4cd2 PH |
6787 | |
6788 | const char * | |
6789 | ada_tag_name (struct value *tag) | |
6790 | { | |
1b611343 | 6791 | char *name = NULL; |
5b4ee69b | 6792 | |
df407dfe | 6793 | if (!ada_is_tag_type (value_type (tag))) |
4c4b4cd2 | 6794 | return NULL; |
1b611343 JB |
6795 | |
6796 | /* It is perfectly possible that an exception be raised while trying | |
6797 | to determine the TAG's name, even under normal circumstances: | |
6798 | The associated variable may be uninitialized or corrupted, for | |
6799 | instance. We do not let any exception propagate past this point. | |
6800 | instead we return NULL. | |
6801 | ||
6802 | We also do not print the error message either (which often is very | |
6803 | low-level (Eg: "Cannot read memory at 0x[...]"), but instead let | |
6804 | the caller print a more meaningful message if necessary. */ | |
a70b8144 | 6805 | try |
1b611343 JB |
6806 | { |
6807 | struct value *tsd = ada_get_tsd_from_tag (tag); | |
6808 | ||
6809 | if (tsd != NULL) | |
6810 | name = ada_tag_name_from_tsd (tsd); | |
6811 | } | |
230d2906 | 6812 | catch (const gdb_exception_error &e) |
492d29ea PA |
6813 | { |
6814 | } | |
1b611343 JB |
6815 | |
6816 | return name; | |
4c4b4cd2 PH |
6817 | } |
6818 | ||
6819 | /* The parent type of TYPE, or NULL if none. */ | |
14f9c5c9 | 6820 | |
d2e4a39e | 6821 | struct type * |
ebf56fd3 | 6822 | ada_parent_type (struct type *type) |
14f9c5c9 AS |
6823 | { |
6824 | int i; | |
6825 | ||
61ee279c | 6826 | type = ada_check_typedef (type); |
14f9c5c9 | 6827 | |
78134374 | 6828 | if (type == NULL || type->code () != TYPE_CODE_STRUCT) |
14f9c5c9 AS |
6829 | return NULL; |
6830 | ||
1f704f76 | 6831 | for (i = 0; i < type->num_fields (); i += 1) |
14f9c5c9 | 6832 | if (ada_is_parent_field (type, i)) |
0c1f74cf JB |
6833 | { |
6834 | struct type *parent_type = TYPE_FIELD_TYPE (type, i); | |
6835 | ||
6836 | /* If the _parent field is a pointer, then dereference it. */ | |
78134374 | 6837 | if (parent_type->code () == TYPE_CODE_PTR) |
0c1f74cf JB |
6838 | parent_type = TYPE_TARGET_TYPE (parent_type); |
6839 | /* If there is a parallel XVS type, get the actual base type. */ | |
6840 | parent_type = ada_get_base_type (parent_type); | |
6841 | ||
6842 | return ada_check_typedef (parent_type); | |
6843 | } | |
14f9c5c9 AS |
6844 | |
6845 | return NULL; | |
6846 | } | |
6847 | ||
4c4b4cd2 PH |
6848 | /* True iff field number FIELD_NUM of structure type TYPE contains the |
6849 | parent-type (inherited) fields of a derived type. Assumes TYPE is | |
6850 | a structure type with at least FIELD_NUM+1 fields. */ | |
14f9c5c9 AS |
6851 | |
6852 | int | |
ebf56fd3 | 6853 | ada_is_parent_field (struct type *type, int field_num) |
14f9c5c9 | 6854 | { |
61ee279c | 6855 | const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num); |
5b4ee69b | 6856 | |
4c4b4cd2 | 6857 | return (name != NULL |
61012eef GB |
6858 | && (startswith (name, "PARENT") |
6859 | || startswith (name, "_parent"))); | |
14f9c5c9 AS |
6860 | } |
6861 | ||
4c4b4cd2 | 6862 | /* True iff field number FIELD_NUM of structure type TYPE is a |
14f9c5c9 | 6863 | transparent wrapper field (which should be silently traversed when doing |
4c4b4cd2 | 6864 | field selection and flattened when printing). Assumes TYPE is a |
14f9c5c9 | 6865 | structure type with at least FIELD_NUM+1 fields. Such fields are always |
4c4b4cd2 | 6866 | structures. */ |
14f9c5c9 AS |
6867 | |
6868 | int | |
ebf56fd3 | 6869 | ada_is_wrapper_field (struct type *type, int field_num) |
14f9c5c9 | 6870 | { |
d2e4a39e | 6871 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5b4ee69b | 6872 | |
dddc0e16 JB |
6873 | if (name != NULL && strcmp (name, "RETVAL") == 0) |
6874 | { | |
6875 | /* This happens in functions with "out" or "in out" parameters | |
6876 | which are passed by copy. For such functions, GNAT describes | |
6877 | the function's return type as being a struct where the return | |
6878 | value is in a field called RETVAL, and where the other "out" | |
6879 | or "in out" parameters are fields of that struct. This is not | |
6880 | a wrapper. */ | |
6881 | return 0; | |
6882 | } | |
6883 | ||
d2e4a39e | 6884 | return (name != NULL |
61012eef | 6885 | && (startswith (name, "PARENT") |
4c4b4cd2 | 6886 | || strcmp (name, "REP") == 0 |
61012eef | 6887 | || startswith (name, "_parent") |
4c4b4cd2 | 6888 | || name[0] == 'S' || name[0] == 'R' || name[0] == 'O')); |
14f9c5c9 AS |
6889 | } |
6890 | ||
4c4b4cd2 PH |
6891 | /* True iff field number FIELD_NUM of structure or union type TYPE |
6892 | is a variant wrapper. Assumes TYPE is a structure type with at least | |
6893 | FIELD_NUM+1 fields. */ | |
14f9c5c9 AS |
6894 | |
6895 | int | |
ebf56fd3 | 6896 | ada_is_variant_part (struct type *type, int field_num) |
14f9c5c9 | 6897 | { |
8ecb59f8 TT |
6898 | /* Only Ada types are eligible. */ |
6899 | if (!ADA_TYPE_P (type)) | |
6900 | return 0; | |
6901 | ||
d2e4a39e | 6902 | struct type *field_type = TYPE_FIELD_TYPE (type, field_num); |
5b4ee69b | 6903 | |
78134374 SM |
6904 | return (field_type->code () == TYPE_CODE_UNION |
6905 | || (is_dynamic_field (type, field_num) | |
6906 | && (TYPE_TARGET_TYPE (field_type)->code () | |
c3e5cd34 | 6907 | == TYPE_CODE_UNION))); |
14f9c5c9 AS |
6908 | } |
6909 | ||
6910 | /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part) | |
4c4b4cd2 | 6911 | whose discriminants are contained in the record type OUTER_TYPE, |
7c964f07 UW |
6912 | returns the type of the controlling discriminant for the variant. |
6913 | May return NULL if the type could not be found. */ | |
14f9c5c9 | 6914 | |
d2e4a39e | 6915 | struct type * |
ebf56fd3 | 6916 | ada_variant_discrim_type (struct type *var_type, struct type *outer_type) |
14f9c5c9 | 6917 | { |
a121b7c1 | 6918 | const char *name = ada_variant_discrim_name (var_type); |
5b4ee69b | 6919 | |
988f6b3d | 6920 | return ada_lookup_struct_elt_type (outer_type, name, 1, 1); |
14f9c5c9 AS |
6921 | } |
6922 | ||
4c4b4cd2 | 6923 | /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a |
14f9c5c9 | 6924 | valid field number within it, returns 1 iff field FIELD_NUM of TYPE |
4c4b4cd2 | 6925 | represents a 'when others' clause; otherwise 0. */ |
14f9c5c9 | 6926 | |
de93309a | 6927 | static int |
ebf56fd3 | 6928 | ada_is_others_clause (struct type *type, int field_num) |
14f9c5c9 | 6929 | { |
d2e4a39e | 6930 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5b4ee69b | 6931 | |
14f9c5c9 AS |
6932 | return (name != NULL && name[0] == 'O'); |
6933 | } | |
6934 | ||
6935 | /* Assuming that TYPE0 is the type of the variant part of a record, | |
4c4b4cd2 PH |
6936 | returns the name of the discriminant controlling the variant. |
6937 | The value is valid until the next call to ada_variant_discrim_name. */ | |
14f9c5c9 | 6938 | |
a121b7c1 | 6939 | const char * |
ebf56fd3 | 6940 | ada_variant_discrim_name (struct type *type0) |
14f9c5c9 | 6941 | { |
d2e4a39e | 6942 | static char *result = NULL; |
14f9c5c9 | 6943 | static size_t result_len = 0; |
d2e4a39e AS |
6944 | struct type *type; |
6945 | const char *name; | |
6946 | const char *discrim_end; | |
6947 | const char *discrim_start; | |
14f9c5c9 | 6948 | |
78134374 | 6949 | if (type0->code () == TYPE_CODE_PTR) |
14f9c5c9 AS |
6950 | type = TYPE_TARGET_TYPE (type0); |
6951 | else | |
6952 | type = type0; | |
6953 | ||
6954 | name = ada_type_name (type); | |
6955 | ||
6956 | if (name == NULL || name[0] == '\000') | |
6957 | return ""; | |
6958 | ||
6959 | for (discrim_end = name + strlen (name) - 6; discrim_end != name; | |
6960 | discrim_end -= 1) | |
6961 | { | |
61012eef | 6962 | if (startswith (discrim_end, "___XVN")) |
4c4b4cd2 | 6963 | break; |
14f9c5c9 AS |
6964 | } |
6965 | if (discrim_end == name) | |
6966 | return ""; | |
6967 | ||
d2e4a39e | 6968 | for (discrim_start = discrim_end; discrim_start != name + 3; |
14f9c5c9 AS |
6969 | discrim_start -= 1) |
6970 | { | |
d2e4a39e | 6971 | if (discrim_start == name + 1) |
4c4b4cd2 | 6972 | return ""; |
76a01679 | 6973 | if ((discrim_start > name + 3 |
61012eef | 6974 | && startswith (discrim_start - 3, "___")) |
4c4b4cd2 PH |
6975 | || discrim_start[-1] == '.') |
6976 | break; | |
14f9c5c9 AS |
6977 | } |
6978 | ||
6979 | GROW_VECT (result, result_len, discrim_end - discrim_start + 1); | |
6980 | strncpy (result, discrim_start, discrim_end - discrim_start); | |
d2e4a39e | 6981 | result[discrim_end - discrim_start] = '\0'; |
14f9c5c9 AS |
6982 | return result; |
6983 | } | |
6984 | ||
4c4b4cd2 PH |
6985 | /* Scan STR for a subtype-encoded number, beginning at position K. |
6986 | Put the position of the character just past the number scanned in | |
6987 | *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL. | |
6988 | Return 1 if there was a valid number at the given position, and 0 | |
6989 | otherwise. A "subtype-encoded" number consists of the absolute value | |
6990 | in decimal, followed by the letter 'm' to indicate a negative number. | |
6991 | Assumes 0m does not occur. */ | |
14f9c5c9 AS |
6992 | |
6993 | int | |
d2e4a39e | 6994 | ada_scan_number (const char str[], int k, LONGEST * R, int *new_k) |
14f9c5c9 AS |
6995 | { |
6996 | ULONGEST RU; | |
6997 | ||
d2e4a39e | 6998 | if (!isdigit (str[k])) |
14f9c5c9 AS |
6999 | return 0; |
7000 | ||
4c4b4cd2 | 7001 | /* Do it the hard way so as not to make any assumption about |
14f9c5c9 | 7002 | the relationship of unsigned long (%lu scan format code) and |
4c4b4cd2 | 7003 | LONGEST. */ |
14f9c5c9 AS |
7004 | RU = 0; |
7005 | while (isdigit (str[k])) | |
7006 | { | |
d2e4a39e | 7007 | RU = RU * 10 + (str[k] - '0'); |
14f9c5c9 AS |
7008 | k += 1; |
7009 | } | |
7010 | ||
d2e4a39e | 7011 | if (str[k] == 'm') |
14f9c5c9 AS |
7012 | { |
7013 | if (R != NULL) | |
4c4b4cd2 | 7014 | *R = (-(LONGEST) (RU - 1)) - 1; |
14f9c5c9 AS |
7015 | k += 1; |
7016 | } | |
7017 | else if (R != NULL) | |
7018 | *R = (LONGEST) RU; | |
7019 | ||
4c4b4cd2 | 7020 | /* NOTE on the above: Technically, C does not say what the results of |
14f9c5c9 AS |
7021 | - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive |
7022 | number representable as a LONGEST (although either would probably work | |
7023 | in most implementations). When RU>0, the locution in the then branch | |
4c4b4cd2 | 7024 | above is always equivalent to the negative of RU. */ |
14f9c5c9 AS |
7025 | |
7026 | if (new_k != NULL) | |
7027 | *new_k = k; | |
7028 | return 1; | |
7029 | } | |
7030 | ||
4c4b4cd2 PH |
7031 | /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field), |
7032 | and FIELD_NUM is a valid field number within it, returns 1 iff VAL is | |
7033 | in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */ | |
14f9c5c9 | 7034 | |
de93309a | 7035 | static int |
ebf56fd3 | 7036 | ada_in_variant (LONGEST val, struct type *type, int field_num) |
14f9c5c9 | 7037 | { |
d2e4a39e | 7038 | const char *name = TYPE_FIELD_NAME (type, field_num); |
14f9c5c9 AS |
7039 | int p; |
7040 | ||
7041 | p = 0; | |
7042 | while (1) | |
7043 | { | |
d2e4a39e | 7044 | switch (name[p]) |
4c4b4cd2 PH |
7045 | { |
7046 | case '\0': | |
7047 | return 0; | |
7048 | case 'S': | |
7049 | { | |
7050 | LONGEST W; | |
5b4ee69b | 7051 | |
4c4b4cd2 PH |
7052 | if (!ada_scan_number (name, p + 1, &W, &p)) |
7053 | return 0; | |
7054 | if (val == W) | |
7055 | return 1; | |
7056 | break; | |
7057 | } | |
7058 | case 'R': | |
7059 | { | |
7060 | LONGEST L, U; | |
5b4ee69b | 7061 | |
4c4b4cd2 PH |
7062 | if (!ada_scan_number (name, p + 1, &L, &p) |
7063 | || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p)) | |
7064 | return 0; | |
7065 | if (val >= L && val <= U) | |
7066 | return 1; | |
7067 | break; | |
7068 | } | |
7069 | case 'O': | |
7070 | return 1; | |
7071 | default: | |
7072 | return 0; | |
7073 | } | |
7074 | } | |
7075 | } | |
7076 | ||
0963b4bd | 7077 | /* FIXME: Lots of redundancy below. Try to consolidate. */ |
4c4b4cd2 PH |
7078 | |
7079 | /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type | |
7080 | ARG_TYPE, extract and return the value of one of its (non-static) | |
7081 | fields. FIELDNO says which field. Differs from value_primitive_field | |
7082 | only in that it can handle packed values of arbitrary type. */ | |
14f9c5c9 | 7083 | |
5eb68a39 | 7084 | struct value * |
d2e4a39e | 7085 | ada_value_primitive_field (struct value *arg1, int offset, int fieldno, |
4c4b4cd2 | 7086 | struct type *arg_type) |
14f9c5c9 | 7087 | { |
14f9c5c9 AS |
7088 | struct type *type; |
7089 | ||
61ee279c | 7090 | arg_type = ada_check_typedef (arg_type); |
14f9c5c9 AS |
7091 | type = TYPE_FIELD_TYPE (arg_type, fieldno); |
7092 | ||
4504bbde TT |
7093 | /* Handle packed fields. It might be that the field is not packed |
7094 | relative to its containing structure, but the structure itself is | |
7095 | packed; in this case we must take the bit-field path. */ | |
7096 | if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0 || value_bitpos (arg1) != 0) | |
14f9c5c9 AS |
7097 | { |
7098 | int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno); | |
7099 | int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno); | |
d2e4a39e | 7100 | |
0fd88904 | 7101 | return ada_value_primitive_packed_val (arg1, value_contents (arg1), |
4c4b4cd2 PH |
7102 | offset + bit_pos / 8, |
7103 | bit_pos % 8, bit_size, type); | |
14f9c5c9 AS |
7104 | } |
7105 | else | |
7106 | return value_primitive_field (arg1, offset, fieldno, arg_type); | |
7107 | } | |
7108 | ||
52ce6436 PH |
7109 | /* Find field with name NAME in object of type TYPE. If found, |
7110 | set the following for each argument that is non-null: | |
7111 | - *FIELD_TYPE_P to the field's type; | |
7112 | - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within | |
7113 | an object of that type; | |
7114 | - *BIT_OFFSET_P to the bit offset modulo byte size of the field; | |
7115 | - *BIT_SIZE_P to its size in bits if the field is packed, and | |
7116 | 0 otherwise; | |
7117 | If INDEX_P is non-null, increment *INDEX_P by the number of source-visible | |
7118 | fields up to but not including the desired field, or by the total | |
7119 | number of fields if not found. A NULL value of NAME never | |
7120 | matches; the function just counts visible fields in this case. | |
7121 | ||
828d5846 XR |
7122 | Notice that we need to handle when a tagged record hierarchy |
7123 | has some components with the same name, like in this scenario: | |
7124 | ||
7125 | type Top_T is tagged record | |
7126 | N : Integer := 1; | |
7127 | U : Integer := 974; | |
7128 | A : Integer := 48; | |
7129 | end record; | |
7130 | ||
7131 | type Middle_T is new Top.Top_T with record | |
7132 | N : Character := 'a'; | |
7133 | C : Integer := 3; | |
7134 | end record; | |
7135 | ||
7136 | type Bottom_T is new Middle.Middle_T with record | |
7137 | N : Float := 4.0; | |
7138 | C : Character := '5'; | |
7139 | X : Integer := 6; | |
7140 | A : Character := 'J'; | |
7141 | end record; | |
7142 | ||
7143 | Let's say we now have a variable declared and initialized as follow: | |
7144 | ||
7145 | TC : Top_A := new Bottom_T; | |
7146 | ||
7147 | And then we use this variable to call this function | |
7148 | ||
7149 | procedure Assign (Obj: in out Top_T; TV : Integer); | |
7150 | ||
7151 | as follow: | |
7152 | ||
7153 | Assign (Top_T (B), 12); | |
7154 | ||
7155 | Now, we're in the debugger, and we're inside that procedure | |
7156 | then and we want to print the value of obj.c: | |
7157 | ||
7158 | Usually, the tagged record or one of the parent type owns the | |
7159 | component to print and there's no issue but in this particular | |
7160 | case, what does it mean to ask for Obj.C? Since the actual | |
7161 | type for object is type Bottom_T, it could mean two things: type | |
7162 | component C from the Middle_T view, but also component C from | |
7163 | Bottom_T. So in that "undefined" case, when the component is | |
7164 | not found in the non-resolved type (which includes all the | |
7165 | components of the parent type), then resolve it and see if we | |
7166 | get better luck once expanded. | |
7167 | ||
7168 | In the case of homonyms in the derived tagged type, we don't | |
7169 | guaranty anything, and pick the one that's easiest for us | |
7170 | to program. | |
7171 | ||
0963b4bd | 7172 | Returns 1 if found, 0 otherwise. */ |
52ce6436 | 7173 | |
4c4b4cd2 | 7174 | static int |
0d5cff50 | 7175 | find_struct_field (const char *name, struct type *type, int offset, |
76a01679 | 7176 | struct type **field_type_p, |
52ce6436 PH |
7177 | int *byte_offset_p, int *bit_offset_p, int *bit_size_p, |
7178 | int *index_p) | |
4c4b4cd2 PH |
7179 | { |
7180 | int i; | |
828d5846 | 7181 | int parent_offset = -1; |
4c4b4cd2 | 7182 | |
61ee279c | 7183 | type = ada_check_typedef (type); |
76a01679 | 7184 | |
52ce6436 PH |
7185 | if (field_type_p != NULL) |
7186 | *field_type_p = NULL; | |
7187 | if (byte_offset_p != NULL) | |
d5d6fca5 | 7188 | *byte_offset_p = 0; |
52ce6436 PH |
7189 | if (bit_offset_p != NULL) |
7190 | *bit_offset_p = 0; | |
7191 | if (bit_size_p != NULL) | |
7192 | *bit_size_p = 0; | |
7193 | ||
1f704f76 | 7194 | for (i = 0; i < type->num_fields (); i += 1) |
4c4b4cd2 PH |
7195 | { |
7196 | int bit_pos = TYPE_FIELD_BITPOS (type, i); | |
7197 | int fld_offset = offset + bit_pos / 8; | |
0d5cff50 | 7198 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
76a01679 | 7199 | |
4c4b4cd2 PH |
7200 | if (t_field_name == NULL) |
7201 | continue; | |
7202 | ||
828d5846 XR |
7203 | else if (ada_is_parent_field (type, i)) |
7204 | { | |
7205 | /* This is a field pointing us to the parent type of a tagged | |
7206 | type. As hinted in this function's documentation, we give | |
7207 | preference to fields in the current record first, so what | |
7208 | we do here is just record the index of this field before | |
7209 | we skip it. If it turns out we couldn't find our field | |
7210 | in the current record, then we'll get back to it and search | |
7211 | inside it whether the field might exist in the parent. */ | |
7212 | ||
7213 | parent_offset = i; | |
7214 | continue; | |
7215 | } | |
7216 | ||
52ce6436 | 7217 | else if (name != NULL && field_name_match (t_field_name, name)) |
76a01679 JB |
7218 | { |
7219 | int bit_size = TYPE_FIELD_BITSIZE (type, i); | |
5b4ee69b | 7220 | |
52ce6436 PH |
7221 | if (field_type_p != NULL) |
7222 | *field_type_p = TYPE_FIELD_TYPE (type, i); | |
7223 | if (byte_offset_p != NULL) | |
7224 | *byte_offset_p = fld_offset; | |
7225 | if (bit_offset_p != NULL) | |
7226 | *bit_offset_p = bit_pos % 8; | |
7227 | if (bit_size_p != NULL) | |
7228 | *bit_size_p = bit_size; | |
76a01679 JB |
7229 | return 1; |
7230 | } | |
4c4b4cd2 PH |
7231 | else if (ada_is_wrapper_field (type, i)) |
7232 | { | |
52ce6436 PH |
7233 | if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset, |
7234 | field_type_p, byte_offset_p, bit_offset_p, | |
7235 | bit_size_p, index_p)) | |
76a01679 JB |
7236 | return 1; |
7237 | } | |
4c4b4cd2 PH |
7238 | else if (ada_is_variant_part (type, i)) |
7239 | { | |
52ce6436 PH |
7240 | /* PNH: Wait. Do we ever execute this section, or is ARG always of |
7241 | fixed type?? */ | |
4c4b4cd2 | 7242 | int j; |
52ce6436 PH |
7243 | struct type *field_type |
7244 | = ada_check_typedef (TYPE_FIELD_TYPE (type, i)); | |
4c4b4cd2 | 7245 | |
1f704f76 | 7246 | for (j = 0; j < field_type->num_fields (); j += 1) |
4c4b4cd2 | 7247 | { |
76a01679 JB |
7248 | if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j), |
7249 | fld_offset | |
7250 | + TYPE_FIELD_BITPOS (field_type, j) / 8, | |
7251 | field_type_p, byte_offset_p, | |
52ce6436 | 7252 | bit_offset_p, bit_size_p, index_p)) |
76a01679 | 7253 | return 1; |
4c4b4cd2 PH |
7254 | } |
7255 | } | |
52ce6436 PH |
7256 | else if (index_p != NULL) |
7257 | *index_p += 1; | |
4c4b4cd2 | 7258 | } |
828d5846 XR |
7259 | |
7260 | /* Field not found so far. If this is a tagged type which | |
7261 | has a parent, try finding that field in the parent now. */ | |
7262 | ||
7263 | if (parent_offset != -1) | |
7264 | { | |
7265 | int bit_pos = TYPE_FIELD_BITPOS (type, parent_offset); | |
7266 | int fld_offset = offset + bit_pos / 8; | |
7267 | ||
7268 | if (find_struct_field (name, TYPE_FIELD_TYPE (type, parent_offset), | |
7269 | fld_offset, field_type_p, byte_offset_p, | |
7270 | bit_offset_p, bit_size_p, index_p)) | |
7271 | return 1; | |
7272 | } | |
7273 | ||
4c4b4cd2 PH |
7274 | return 0; |
7275 | } | |
7276 | ||
0963b4bd | 7277 | /* Number of user-visible fields in record type TYPE. */ |
4c4b4cd2 | 7278 | |
52ce6436 PH |
7279 | static int |
7280 | num_visible_fields (struct type *type) | |
7281 | { | |
7282 | int n; | |
5b4ee69b | 7283 | |
52ce6436 PH |
7284 | n = 0; |
7285 | find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n); | |
7286 | return n; | |
7287 | } | |
14f9c5c9 | 7288 | |
4c4b4cd2 | 7289 | /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes, |
14f9c5c9 AS |
7290 | and search in it assuming it has (class) type TYPE. |
7291 | If found, return value, else return NULL. | |
7292 | ||
828d5846 XR |
7293 | Searches recursively through wrapper fields (e.g., '_parent'). |
7294 | ||
7295 | In the case of homonyms in the tagged types, please refer to the | |
7296 | long explanation in find_struct_field's function documentation. */ | |
14f9c5c9 | 7297 | |
4c4b4cd2 | 7298 | static struct value * |
108d56a4 | 7299 | ada_search_struct_field (const char *name, struct value *arg, int offset, |
4c4b4cd2 | 7300 | struct type *type) |
14f9c5c9 AS |
7301 | { |
7302 | int i; | |
828d5846 | 7303 | int parent_offset = -1; |
14f9c5c9 | 7304 | |
5b4ee69b | 7305 | type = ada_check_typedef (type); |
1f704f76 | 7306 | for (i = 0; i < type->num_fields (); i += 1) |
14f9c5c9 | 7307 | { |
0d5cff50 | 7308 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
14f9c5c9 AS |
7309 | |
7310 | if (t_field_name == NULL) | |
4c4b4cd2 | 7311 | continue; |
14f9c5c9 | 7312 | |
828d5846 XR |
7313 | else if (ada_is_parent_field (type, i)) |
7314 | { | |
7315 | /* This is a field pointing us to the parent type of a tagged | |
7316 | type. As hinted in this function's documentation, we give | |
7317 | preference to fields in the current record first, so what | |
7318 | we do here is just record the index of this field before | |
7319 | we skip it. If it turns out we couldn't find our field | |
7320 | in the current record, then we'll get back to it and search | |
7321 | inside it whether the field might exist in the parent. */ | |
7322 | ||
7323 | parent_offset = i; | |
7324 | continue; | |
7325 | } | |
7326 | ||
14f9c5c9 | 7327 | else if (field_name_match (t_field_name, name)) |
4c4b4cd2 | 7328 | return ada_value_primitive_field (arg, offset, i, type); |
14f9c5c9 AS |
7329 | |
7330 | else if (ada_is_wrapper_field (type, i)) | |
4c4b4cd2 | 7331 | { |
0963b4bd | 7332 | struct value *v = /* Do not let indent join lines here. */ |
06d5cf63 JB |
7333 | ada_search_struct_field (name, arg, |
7334 | offset + TYPE_FIELD_BITPOS (type, i) / 8, | |
7335 | TYPE_FIELD_TYPE (type, i)); | |
5b4ee69b | 7336 | |
4c4b4cd2 PH |
7337 | if (v != NULL) |
7338 | return v; | |
7339 | } | |
14f9c5c9 AS |
7340 | |
7341 | else if (ada_is_variant_part (type, i)) | |
4c4b4cd2 | 7342 | { |
0963b4bd | 7343 | /* PNH: Do we ever get here? See find_struct_field. */ |
4c4b4cd2 | 7344 | int j; |
5b4ee69b MS |
7345 | struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, |
7346 | i)); | |
4c4b4cd2 PH |
7347 | int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8; |
7348 | ||
1f704f76 | 7349 | for (j = 0; j < field_type->num_fields (); j += 1) |
4c4b4cd2 | 7350 | { |
0963b4bd MS |
7351 | struct value *v = ada_search_struct_field /* Force line |
7352 | break. */ | |
06d5cf63 JB |
7353 | (name, arg, |
7354 | var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8, | |
7355 | TYPE_FIELD_TYPE (field_type, j)); | |
5b4ee69b | 7356 | |
4c4b4cd2 PH |
7357 | if (v != NULL) |
7358 | return v; | |
7359 | } | |
7360 | } | |
14f9c5c9 | 7361 | } |
828d5846 XR |
7362 | |
7363 | /* Field not found so far. If this is a tagged type which | |
7364 | has a parent, try finding that field in the parent now. */ | |
7365 | ||
7366 | if (parent_offset != -1) | |
7367 | { | |
7368 | struct value *v = ada_search_struct_field ( | |
7369 | name, arg, offset + TYPE_FIELD_BITPOS (type, parent_offset) / 8, | |
7370 | TYPE_FIELD_TYPE (type, parent_offset)); | |
7371 | ||
7372 | if (v != NULL) | |
7373 | return v; | |
7374 | } | |
7375 | ||
14f9c5c9 AS |
7376 | return NULL; |
7377 | } | |
d2e4a39e | 7378 | |
52ce6436 PH |
7379 | static struct value *ada_index_struct_field_1 (int *, struct value *, |
7380 | int, struct type *); | |
7381 | ||
7382 | ||
7383 | /* Return field #INDEX in ARG, where the index is that returned by | |
7384 | * find_struct_field through its INDEX_P argument. Adjust the address | |
7385 | * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE. | |
0963b4bd | 7386 | * If found, return value, else return NULL. */ |
52ce6436 PH |
7387 | |
7388 | static struct value * | |
7389 | ada_index_struct_field (int index, struct value *arg, int offset, | |
7390 | struct type *type) | |
7391 | { | |
7392 | return ada_index_struct_field_1 (&index, arg, offset, type); | |
7393 | } | |
7394 | ||
7395 | ||
7396 | /* Auxiliary function for ada_index_struct_field. Like | |
7397 | * ada_index_struct_field, but takes index from *INDEX_P and modifies | |
0963b4bd | 7398 | * *INDEX_P. */ |
52ce6436 PH |
7399 | |
7400 | static struct value * | |
7401 | ada_index_struct_field_1 (int *index_p, struct value *arg, int offset, | |
7402 | struct type *type) | |
7403 | { | |
7404 | int i; | |
7405 | type = ada_check_typedef (type); | |
7406 | ||
1f704f76 | 7407 | for (i = 0; i < type->num_fields (); i += 1) |
52ce6436 PH |
7408 | { |
7409 | if (TYPE_FIELD_NAME (type, i) == NULL) | |
7410 | continue; | |
7411 | else if (ada_is_wrapper_field (type, i)) | |
7412 | { | |
0963b4bd | 7413 | struct value *v = /* Do not let indent join lines here. */ |
52ce6436 PH |
7414 | ada_index_struct_field_1 (index_p, arg, |
7415 | offset + TYPE_FIELD_BITPOS (type, i) / 8, | |
7416 | TYPE_FIELD_TYPE (type, i)); | |
5b4ee69b | 7417 | |
52ce6436 PH |
7418 | if (v != NULL) |
7419 | return v; | |
7420 | } | |
7421 | ||
7422 | else if (ada_is_variant_part (type, i)) | |
7423 | { | |
7424 | /* PNH: Do we ever get here? See ada_search_struct_field, | |
0963b4bd | 7425 | find_struct_field. */ |
52ce6436 PH |
7426 | error (_("Cannot assign this kind of variant record")); |
7427 | } | |
7428 | else if (*index_p == 0) | |
7429 | return ada_value_primitive_field (arg, offset, i, type); | |
7430 | else | |
7431 | *index_p -= 1; | |
7432 | } | |
7433 | return NULL; | |
7434 | } | |
7435 | ||
3b4de39c | 7436 | /* Return a string representation of type TYPE. */ |
99bbb428 | 7437 | |
3b4de39c | 7438 | static std::string |
99bbb428 PA |
7439 | type_as_string (struct type *type) |
7440 | { | |
d7e74731 | 7441 | string_file tmp_stream; |
99bbb428 | 7442 | |
d7e74731 | 7443 | type_print (type, "", &tmp_stream, -1); |
99bbb428 | 7444 | |
d7e74731 | 7445 | return std::move (tmp_stream.string ()); |
99bbb428 PA |
7446 | } |
7447 | ||
14f9c5c9 | 7448 | /* Given a type TYPE, look up the type of the component of type named NAME. |
4c4b4cd2 PH |
7449 | If DISPP is non-null, add its byte displacement from the beginning of a |
7450 | structure (pointed to by a value) of type TYPE to *DISPP (does not | |
14f9c5c9 AS |
7451 | work for packed fields). |
7452 | ||
7453 | Matches any field whose name has NAME as a prefix, possibly | |
4c4b4cd2 | 7454 | followed by "___". |
14f9c5c9 | 7455 | |
0963b4bd | 7456 | TYPE can be either a struct or union. If REFOK, TYPE may also |
4c4b4cd2 PH |
7457 | be a (pointer or reference)+ to a struct or union, and the |
7458 | ultimate target type will be searched. | |
14f9c5c9 AS |
7459 | |
7460 | Looks recursively into variant clauses and parent types. | |
7461 | ||
828d5846 XR |
7462 | In the case of homonyms in the tagged types, please refer to the |
7463 | long explanation in find_struct_field's function documentation. | |
7464 | ||
4c4b4cd2 PH |
7465 | If NOERR is nonzero, return NULL if NAME is not suitably defined or |
7466 | TYPE is not a type of the right kind. */ | |
14f9c5c9 | 7467 | |
4c4b4cd2 | 7468 | static struct type * |
a121b7c1 | 7469 | ada_lookup_struct_elt_type (struct type *type, const char *name, int refok, |
988f6b3d | 7470 | int noerr) |
14f9c5c9 AS |
7471 | { |
7472 | int i; | |
828d5846 | 7473 | int parent_offset = -1; |
14f9c5c9 AS |
7474 | |
7475 | if (name == NULL) | |
7476 | goto BadName; | |
7477 | ||
76a01679 | 7478 | if (refok && type != NULL) |
4c4b4cd2 PH |
7479 | while (1) |
7480 | { | |
61ee279c | 7481 | type = ada_check_typedef (type); |
78134374 | 7482 | if (type->code () != TYPE_CODE_PTR && type->code () != TYPE_CODE_REF) |
76a01679 JB |
7483 | break; |
7484 | type = TYPE_TARGET_TYPE (type); | |
4c4b4cd2 | 7485 | } |
14f9c5c9 | 7486 | |
76a01679 | 7487 | if (type == NULL |
78134374 SM |
7488 | || (type->code () != TYPE_CODE_STRUCT |
7489 | && type->code () != TYPE_CODE_UNION)) | |
14f9c5c9 | 7490 | { |
4c4b4cd2 | 7491 | if (noerr) |
76a01679 | 7492 | return NULL; |
99bbb428 | 7493 | |
3b4de39c PA |
7494 | error (_("Type %s is not a structure or union type"), |
7495 | type != NULL ? type_as_string (type).c_str () : _("(null)")); | |
14f9c5c9 AS |
7496 | } |
7497 | ||
7498 | type = to_static_fixed_type (type); | |
7499 | ||
1f704f76 | 7500 | for (i = 0; i < type->num_fields (); i += 1) |
14f9c5c9 | 7501 | { |
0d5cff50 | 7502 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
14f9c5c9 | 7503 | struct type *t; |
d2e4a39e | 7504 | |
14f9c5c9 | 7505 | if (t_field_name == NULL) |
4c4b4cd2 | 7506 | continue; |
14f9c5c9 | 7507 | |
828d5846 XR |
7508 | else if (ada_is_parent_field (type, i)) |
7509 | { | |
7510 | /* This is a field pointing us to the parent type of a tagged | |
7511 | type. As hinted in this function's documentation, we give | |
7512 | preference to fields in the current record first, so what | |
7513 | we do here is just record the index of this field before | |
7514 | we skip it. If it turns out we couldn't find our field | |
7515 | in the current record, then we'll get back to it and search | |
7516 | inside it whether the field might exist in the parent. */ | |
7517 | ||
7518 | parent_offset = i; | |
7519 | continue; | |
7520 | } | |
7521 | ||
14f9c5c9 | 7522 | else if (field_name_match (t_field_name, name)) |
988f6b3d | 7523 | return TYPE_FIELD_TYPE (type, i); |
14f9c5c9 AS |
7524 | |
7525 | else if (ada_is_wrapper_field (type, i)) | |
4c4b4cd2 | 7526 | { |
4c4b4cd2 | 7527 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name, |
988f6b3d | 7528 | 0, 1); |
4c4b4cd2 | 7529 | if (t != NULL) |
988f6b3d | 7530 | return t; |
4c4b4cd2 | 7531 | } |
14f9c5c9 AS |
7532 | |
7533 | else if (ada_is_variant_part (type, i)) | |
4c4b4cd2 PH |
7534 | { |
7535 | int j; | |
5b4ee69b MS |
7536 | struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, |
7537 | i)); | |
4c4b4cd2 | 7538 | |
1f704f76 | 7539 | for (j = field_type->num_fields () - 1; j >= 0; j -= 1) |
4c4b4cd2 | 7540 | { |
b1f33ddd JB |
7541 | /* FIXME pnh 2008/01/26: We check for a field that is |
7542 | NOT wrapped in a struct, since the compiler sometimes | |
7543 | generates these for unchecked variant types. Revisit | |
0963b4bd | 7544 | if the compiler changes this practice. */ |
0d5cff50 | 7545 | const char *v_field_name = TYPE_FIELD_NAME (field_type, j); |
988f6b3d | 7546 | |
b1f33ddd JB |
7547 | if (v_field_name != NULL |
7548 | && field_name_match (v_field_name, name)) | |
460efde1 | 7549 | t = TYPE_FIELD_TYPE (field_type, j); |
b1f33ddd | 7550 | else |
0963b4bd MS |
7551 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, |
7552 | j), | |
988f6b3d | 7553 | name, 0, 1); |
b1f33ddd | 7554 | |
4c4b4cd2 | 7555 | if (t != NULL) |
988f6b3d | 7556 | return t; |
4c4b4cd2 PH |
7557 | } |
7558 | } | |
14f9c5c9 AS |
7559 | |
7560 | } | |
7561 | ||
828d5846 XR |
7562 | /* Field not found so far. If this is a tagged type which |
7563 | has a parent, try finding that field in the parent now. */ | |
7564 | ||
7565 | if (parent_offset != -1) | |
7566 | { | |
7567 | struct type *t; | |
7568 | ||
7569 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, parent_offset), | |
7570 | name, 0, 1); | |
7571 | if (t != NULL) | |
7572 | return t; | |
7573 | } | |
7574 | ||
14f9c5c9 | 7575 | BadName: |
d2e4a39e | 7576 | if (!noerr) |
14f9c5c9 | 7577 | { |
2b2798cc | 7578 | const char *name_str = name != NULL ? name : _("<null>"); |
99bbb428 PA |
7579 | |
7580 | error (_("Type %s has no component named %s"), | |
3b4de39c | 7581 | type_as_string (type).c_str (), name_str); |
14f9c5c9 AS |
7582 | } |
7583 | ||
7584 | return NULL; | |
7585 | } | |
7586 | ||
b1f33ddd JB |
7587 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), |
7588 | within a value of type OUTER_TYPE, return true iff VAR_TYPE | |
7589 | represents an unchecked union (that is, the variant part of a | |
0963b4bd | 7590 | record that is named in an Unchecked_Union pragma). */ |
b1f33ddd JB |
7591 | |
7592 | static int | |
7593 | is_unchecked_variant (struct type *var_type, struct type *outer_type) | |
7594 | { | |
a121b7c1 | 7595 | const char *discrim_name = ada_variant_discrim_name (var_type); |
5b4ee69b | 7596 | |
988f6b3d | 7597 | return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1) == NULL); |
b1f33ddd JB |
7598 | } |
7599 | ||
7600 | ||
14f9c5c9 | 7601 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), |
d8af9068 | 7602 | within OUTER, determine which variant clause (field number in VAR_TYPE, |
4c4b4cd2 | 7603 | numbering from 0) is applicable. Returns -1 if none are. */ |
14f9c5c9 | 7604 | |
d2e4a39e | 7605 | int |
d8af9068 | 7606 | ada_which_variant_applies (struct type *var_type, struct value *outer) |
14f9c5c9 AS |
7607 | { |
7608 | int others_clause; | |
7609 | int i; | |
a121b7c1 | 7610 | const char *discrim_name = ada_variant_discrim_name (var_type); |
0c281816 | 7611 | struct value *discrim; |
14f9c5c9 AS |
7612 | LONGEST discrim_val; |
7613 | ||
012370f6 TT |
7614 | /* Using plain value_from_contents_and_address here causes problems |
7615 | because we will end up trying to resolve a type that is currently | |
7616 | being constructed. */ | |
0c281816 JB |
7617 | discrim = ada_value_struct_elt (outer, discrim_name, 1); |
7618 | if (discrim == NULL) | |
14f9c5c9 | 7619 | return -1; |
0c281816 | 7620 | discrim_val = value_as_long (discrim); |
14f9c5c9 AS |
7621 | |
7622 | others_clause = -1; | |
1f704f76 | 7623 | for (i = 0; i < var_type->num_fields (); i += 1) |
14f9c5c9 AS |
7624 | { |
7625 | if (ada_is_others_clause (var_type, i)) | |
4c4b4cd2 | 7626 | others_clause = i; |
14f9c5c9 | 7627 | else if (ada_in_variant (discrim_val, var_type, i)) |
4c4b4cd2 | 7628 | return i; |
14f9c5c9 AS |
7629 | } |
7630 | ||
7631 | return others_clause; | |
7632 | } | |
d2e4a39e | 7633 | \f |
14f9c5c9 AS |
7634 | |
7635 | ||
4c4b4cd2 | 7636 | /* Dynamic-Sized Records */ |
14f9c5c9 AS |
7637 | |
7638 | /* Strategy: The type ostensibly attached to a value with dynamic size | |
7639 | (i.e., a size that is not statically recorded in the debugging | |
7640 | data) does not accurately reflect the size or layout of the value. | |
7641 | Our strategy is to convert these values to values with accurate, | |
4c4b4cd2 | 7642 | conventional types that are constructed on the fly. */ |
14f9c5c9 AS |
7643 | |
7644 | /* There is a subtle and tricky problem here. In general, we cannot | |
7645 | determine the size of dynamic records without its data. However, | |
7646 | the 'struct value' data structure, which GDB uses to represent | |
7647 | quantities in the inferior process (the target), requires the size | |
7648 | of the type at the time of its allocation in order to reserve space | |
7649 | for GDB's internal copy of the data. That's why the | |
7650 | 'to_fixed_xxx_type' routines take (target) addresses as parameters, | |
4c4b4cd2 | 7651 | rather than struct value*s. |
14f9c5c9 AS |
7652 | |
7653 | However, GDB's internal history variables ($1, $2, etc.) are | |
7654 | struct value*s containing internal copies of the data that are not, in | |
7655 | general, the same as the data at their corresponding addresses in | |
7656 | the target. Fortunately, the types we give to these values are all | |
7657 | conventional, fixed-size types (as per the strategy described | |
7658 | above), so that we don't usually have to perform the | |
7659 | 'to_fixed_xxx_type' conversions to look at their values. | |
7660 | Unfortunately, there is one exception: if one of the internal | |
7661 | history variables is an array whose elements are unconstrained | |
7662 | records, then we will need to create distinct fixed types for each | |
7663 | element selected. */ | |
7664 | ||
7665 | /* The upshot of all of this is that many routines take a (type, host | |
7666 | address, target address) triple as arguments to represent a value. | |
7667 | The host address, if non-null, is supposed to contain an internal | |
7668 | copy of the relevant data; otherwise, the program is to consult the | |
4c4b4cd2 | 7669 | target at the target address. */ |
14f9c5c9 AS |
7670 | |
7671 | /* Assuming that VAL0 represents a pointer value, the result of | |
7672 | dereferencing it. Differs from value_ind in its treatment of | |
4c4b4cd2 | 7673 | dynamic-sized types. */ |
14f9c5c9 | 7674 | |
d2e4a39e AS |
7675 | struct value * |
7676 | ada_value_ind (struct value *val0) | |
14f9c5c9 | 7677 | { |
c48db5ca | 7678 | struct value *val = value_ind (val0); |
5b4ee69b | 7679 | |
b50d69b5 JG |
7680 | if (ada_is_tagged_type (value_type (val), 0)) |
7681 | val = ada_tag_value_at_base_address (val); | |
7682 | ||
4c4b4cd2 | 7683 | return ada_to_fixed_value (val); |
14f9c5c9 AS |
7684 | } |
7685 | ||
7686 | /* The value resulting from dereferencing any "reference to" | |
4c4b4cd2 PH |
7687 | qualifiers on VAL0. */ |
7688 | ||
d2e4a39e AS |
7689 | static struct value * |
7690 | ada_coerce_ref (struct value *val0) | |
7691 | { | |
78134374 | 7692 | if (value_type (val0)->code () == TYPE_CODE_REF) |
d2e4a39e AS |
7693 | { |
7694 | struct value *val = val0; | |
5b4ee69b | 7695 | |
994b9211 | 7696 | val = coerce_ref (val); |
b50d69b5 JG |
7697 | |
7698 | if (ada_is_tagged_type (value_type (val), 0)) | |
7699 | val = ada_tag_value_at_base_address (val); | |
7700 | ||
4c4b4cd2 | 7701 | return ada_to_fixed_value (val); |
d2e4a39e AS |
7702 | } |
7703 | else | |
14f9c5c9 AS |
7704 | return val0; |
7705 | } | |
7706 | ||
4c4b4cd2 | 7707 | /* Return the bit alignment required for field #F of template type TYPE. */ |
14f9c5c9 AS |
7708 | |
7709 | static unsigned int | |
ebf56fd3 | 7710 | field_alignment (struct type *type, int f) |
14f9c5c9 | 7711 | { |
d2e4a39e | 7712 | const char *name = TYPE_FIELD_NAME (type, f); |
64a1bf19 | 7713 | int len; |
14f9c5c9 AS |
7714 | int align_offset; |
7715 | ||
64a1bf19 JB |
7716 | /* The field name should never be null, unless the debugging information |
7717 | is somehow malformed. In this case, we assume the field does not | |
7718 | require any alignment. */ | |
7719 | if (name == NULL) | |
7720 | return 1; | |
7721 | ||
7722 | len = strlen (name); | |
7723 | ||
4c4b4cd2 PH |
7724 | if (!isdigit (name[len - 1])) |
7725 | return 1; | |
14f9c5c9 | 7726 | |
d2e4a39e | 7727 | if (isdigit (name[len - 2])) |
14f9c5c9 AS |
7728 | align_offset = len - 2; |
7729 | else | |
7730 | align_offset = len - 1; | |
7731 | ||
61012eef | 7732 | if (align_offset < 7 || !startswith (name + align_offset - 6, "___XV")) |
14f9c5c9 AS |
7733 | return TARGET_CHAR_BIT; |
7734 | ||
4c4b4cd2 PH |
7735 | return atoi (name + align_offset) * TARGET_CHAR_BIT; |
7736 | } | |
7737 | ||
852dff6c | 7738 | /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */ |
4c4b4cd2 | 7739 | |
852dff6c JB |
7740 | static struct symbol * |
7741 | ada_find_any_type_symbol (const char *name) | |
4c4b4cd2 PH |
7742 | { |
7743 | struct symbol *sym; | |
7744 | ||
7745 | sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN); | |
4186eb54 | 7746 | if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF) |
4c4b4cd2 PH |
7747 | return sym; |
7748 | ||
4186eb54 KS |
7749 | sym = standard_lookup (name, NULL, STRUCT_DOMAIN); |
7750 | return sym; | |
14f9c5c9 AS |
7751 | } |
7752 | ||
dddfab26 UW |
7753 | /* Find a type named NAME. Ignores ambiguity. This routine will look |
7754 | solely for types defined by debug info, it will not search the GDB | |
7755 | primitive types. */ | |
4c4b4cd2 | 7756 | |
852dff6c | 7757 | static struct type * |
ebf56fd3 | 7758 | ada_find_any_type (const char *name) |
14f9c5c9 | 7759 | { |
852dff6c | 7760 | struct symbol *sym = ada_find_any_type_symbol (name); |
14f9c5c9 | 7761 | |
14f9c5c9 | 7762 | if (sym != NULL) |
dddfab26 | 7763 | return SYMBOL_TYPE (sym); |
14f9c5c9 | 7764 | |
dddfab26 | 7765 | return NULL; |
14f9c5c9 AS |
7766 | } |
7767 | ||
739593e0 JB |
7768 | /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol |
7769 | associated with NAME_SYM's name. NAME_SYM may itself be a renaming | |
7770 | symbol, in which case it is returned. Otherwise, this looks for | |
7771 | symbols whose name is that of NAME_SYM suffixed with "___XR". | |
7772 | Return symbol if found, and NULL otherwise. */ | |
4c4b4cd2 | 7773 | |
c0e70c62 TT |
7774 | static bool |
7775 | ada_is_renaming_symbol (struct symbol *name_sym) | |
aeb5907d | 7776 | { |
987012b8 | 7777 | const char *name = name_sym->linkage_name (); |
c0e70c62 | 7778 | return strstr (name, "___XR") != NULL; |
4c4b4cd2 PH |
7779 | } |
7780 | ||
14f9c5c9 | 7781 | /* Because of GNAT encoding conventions, several GDB symbols may match a |
4c4b4cd2 | 7782 | given type name. If the type denoted by TYPE0 is to be preferred to |
14f9c5c9 | 7783 | that of TYPE1 for purposes of type printing, return non-zero; |
4c4b4cd2 PH |
7784 | otherwise return 0. */ |
7785 | ||
14f9c5c9 | 7786 | int |
d2e4a39e | 7787 | ada_prefer_type (struct type *type0, struct type *type1) |
14f9c5c9 AS |
7788 | { |
7789 | if (type1 == NULL) | |
7790 | return 1; | |
7791 | else if (type0 == NULL) | |
7792 | return 0; | |
78134374 | 7793 | else if (type1->code () == TYPE_CODE_VOID) |
14f9c5c9 | 7794 | return 1; |
78134374 | 7795 | else if (type0->code () == TYPE_CODE_VOID) |
14f9c5c9 | 7796 | return 0; |
7d93a1e0 | 7797 | else if (type1->name () == NULL && type0->name () != NULL) |
4c4b4cd2 | 7798 | return 1; |
ad82864c | 7799 | else if (ada_is_constrained_packed_array_type (type0)) |
14f9c5c9 | 7800 | return 1; |
4c4b4cd2 PH |
7801 | else if (ada_is_array_descriptor_type (type0) |
7802 | && !ada_is_array_descriptor_type (type1)) | |
14f9c5c9 | 7803 | return 1; |
aeb5907d JB |
7804 | else |
7805 | { | |
7d93a1e0 SM |
7806 | const char *type0_name = type0->name (); |
7807 | const char *type1_name = type1->name (); | |
aeb5907d JB |
7808 | |
7809 | if (type0_name != NULL && strstr (type0_name, "___XR") != NULL | |
7810 | && (type1_name == NULL || strstr (type1_name, "___XR") == NULL)) | |
7811 | return 1; | |
7812 | } | |
14f9c5c9 AS |
7813 | return 0; |
7814 | } | |
7815 | ||
e86ca25f TT |
7816 | /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is |
7817 | null. */ | |
4c4b4cd2 | 7818 | |
0d5cff50 | 7819 | const char * |
d2e4a39e | 7820 | ada_type_name (struct type *type) |
14f9c5c9 | 7821 | { |
d2e4a39e | 7822 | if (type == NULL) |
14f9c5c9 | 7823 | return NULL; |
7d93a1e0 | 7824 | return type->name (); |
14f9c5c9 AS |
7825 | } |
7826 | ||
b4ba55a1 JB |
7827 | /* Search the list of "descriptive" types associated to TYPE for a type |
7828 | whose name is NAME. */ | |
7829 | ||
7830 | static struct type * | |
7831 | find_parallel_type_by_descriptive_type (struct type *type, const char *name) | |
7832 | { | |
931e5bc3 | 7833 | struct type *result, *tmp; |
b4ba55a1 | 7834 | |
c6044dd1 JB |
7835 | if (ada_ignore_descriptive_types_p) |
7836 | return NULL; | |
7837 | ||
b4ba55a1 JB |
7838 | /* If there no descriptive-type info, then there is no parallel type |
7839 | to be found. */ | |
7840 | if (!HAVE_GNAT_AUX_INFO (type)) | |
7841 | return NULL; | |
7842 | ||
7843 | result = TYPE_DESCRIPTIVE_TYPE (type); | |
7844 | while (result != NULL) | |
7845 | { | |
0d5cff50 | 7846 | const char *result_name = ada_type_name (result); |
b4ba55a1 JB |
7847 | |
7848 | if (result_name == NULL) | |
7849 | { | |
7850 | warning (_("unexpected null name on descriptive type")); | |
7851 | return NULL; | |
7852 | } | |
7853 | ||
7854 | /* If the names match, stop. */ | |
7855 | if (strcmp (result_name, name) == 0) | |
7856 | break; | |
7857 | ||
7858 | /* Otherwise, look at the next item on the list, if any. */ | |
7859 | if (HAVE_GNAT_AUX_INFO (result)) | |
931e5bc3 JG |
7860 | tmp = TYPE_DESCRIPTIVE_TYPE (result); |
7861 | else | |
7862 | tmp = NULL; | |
7863 | ||
7864 | /* If not found either, try after having resolved the typedef. */ | |
7865 | if (tmp != NULL) | |
7866 | result = tmp; | |
b4ba55a1 | 7867 | else |
931e5bc3 | 7868 | { |
f168693b | 7869 | result = check_typedef (result); |
931e5bc3 JG |
7870 | if (HAVE_GNAT_AUX_INFO (result)) |
7871 | result = TYPE_DESCRIPTIVE_TYPE (result); | |
7872 | else | |
7873 | result = NULL; | |
7874 | } | |
b4ba55a1 JB |
7875 | } |
7876 | ||
7877 | /* If we didn't find a match, see whether this is a packed array. With | |
7878 | older compilers, the descriptive type information is either absent or | |
7879 | irrelevant when it comes to packed arrays so the above lookup fails. | |
7880 | Fall back to using a parallel lookup by name in this case. */ | |
12ab9e09 | 7881 | if (result == NULL && ada_is_constrained_packed_array_type (type)) |
b4ba55a1 JB |
7882 | return ada_find_any_type (name); |
7883 | ||
7884 | return result; | |
7885 | } | |
7886 | ||
7887 | /* Find a parallel type to TYPE with the specified NAME, using the | |
7888 | descriptive type taken from the debugging information, if available, | |
7889 | and otherwise using the (slower) name-based method. */ | |
7890 | ||
7891 | static struct type * | |
7892 | ada_find_parallel_type_with_name (struct type *type, const char *name) | |
7893 | { | |
7894 | struct type *result = NULL; | |
7895 | ||
7896 | if (HAVE_GNAT_AUX_INFO (type)) | |
7897 | result = find_parallel_type_by_descriptive_type (type, name); | |
7898 | else | |
7899 | result = ada_find_any_type (name); | |
7900 | ||
7901 | return result; | |
7902 | } | |
7903 | ||
7904 | /* Same as above, but specify the name of the parallel type by appending | |
4c4b4cd2 | 7905 | SUFFIX to the name of TYPE. */ |
14f9c5c9 | 7906 | |
d2e4a39e | 7907 | struct type * |
ebf56fd3 | 7908 | ada_find_parallel_type (struct type *type, const char *suffix) |
14f9c5c9 | 7909 | { |
0d5cff50 | 7910 | char *name; |
fe978cb0 | 7911 | const char *type_name = ada_type_name (type); |
14f9c5c9 | 7912 | int len; |
d2e4a39e | 7913 | |
fe978cb0 | 7914 | if (type_name == NULL) |
14f9c5c9 AS |
7915 | return NULL; |
7916 | ||
fe978cb0 | 7917 | len = strlen (type_name); |
14f9c5c9 | 7918 | |
b4ba55a1 | 7919 | name = (char *) alloca (len + strlen (suffix) + 1); |
14f9c5c9 | 7920 | |
fe978cb0 | 7921 | strcpy (name, type_name); |
14f9c5c9 AS |
7922 | strcpy (name + len, suffix); |
7923 | ||
b4ba55a1 | 7924 | return ada_find_parallel_type_with_name (type, name); |
14f9c5c9 AS |
7925 | } |
7926 | ||
14f9c5c9 | 7927 | /* If TYPE is a variable-size record type, return the corresponding template |
4c4b4cd2 | 7928 | type describing its fields. Otherwise, return NULL. */ |
14f9c5c9 | 7929 | |
d2e4a39e AS |
7930 | static struct type * |
7931 | dynamic_template_type (struct type *type) | |
14f9c5c9 | 7932 | { |
61ee279c | 7933 | type = ada_check_typedef (type); |
14f9c5c9 | 7934 | |
78134374 | 7935 | if (type == NULL || type->code () != TYPE_CODE_STRUCT |
d2e4a39e | 7936 | || ada_type_name (type) == NULL) |
14f9c5c9 | 7937 | return NULL; |
d2e4a39e | 7938 | else |
14f9c5c9 AS |
7939 | { |
7940 | int len = strlen (ada_type_name (type)); | |
5b4ee69b | 7941 | |
4c4b4cd2 PH |
7942 | if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0) |
7943 | return type; | |
14f9c5c9 | 7944 | else |
4c4b4cd2 | 7945 | return ada_find_parallel_type (type, "___XVE"); |
14f9c5c9 AS |
7946 | } |
7947 | } | |
7948 | ||
7949 | /* Assuming that TEMPL_TYPE is a union or struct type, returns | |
4c4b4cd2 | 7950 | non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */ |
14f9c5c9 | 7951 | |
d2e4a39e AS |
7952 | static int |
7953 | is_dynamic_field (struct type *templ_type, int field_num) | |
14f9c5c9 AS |
7954 | { |
7955 | const char *name = TYPE_FIELD_NAME (templ_type, field_num); | |
5b4ee69b | 7956 | |
d2e4a39e | 7957 | return name != NULL |
78134374 | 7958 | && TYPE_FIELD_TYPE (templ_type, field_num)->code () == TYPE_CODE_PTR |
14f9c5c9 AS |
7959 | && strstr (name, "___XVL") != NULL; |
7960 | } | |
7961 | ||
4c4b4cd2 PH |
7962 | /* The index of the variant field of TYPE, or -1 if TYPE does not |
7963 | represent a variant record type. */ | |
14f9c5c9 | 7964 | |
d2e4a39e | 7965 | static int |
4c4b4cd2 | 7966 | variant_field_index (struct type *type) |
14f9c5c9 AS |
7967 | { |
7968 | int f; | |
7969 | ||
78134374 | 7970 | if (type == NULL || type->code () != TYPE_CODE_STRUCT) |
4c4b4cd2 PH |
7971 | return -1; |
7972 | ||
1f704f76 | 7973 | for (f = 0; f < type->num_fields (); f += 1) |
4c4b4cd2 PH |
7974 | { |
7975 | if (ada_is_variant_part (type, f)) | |
7976 | return f; | |
7977 | } | |
7978 | return -1; | |
14f9c5c9 AS |
7979 | } |
7980 | ||
4c4b4cd2 PH |
7981 | /* A record type with no fields. */ |
7982 | ||
d2e4a39e | 7983 | static struct type * |
fe978cb0 | 7984 | empty_record (struct type *templ) |
14f9c5c9 | 7985 | { |
fe978cb0 | 7986 | struct type *type = alloc_type_copy (templ); |
5b4ee69b | 7987 | |
67607e24 | 7988 | type->set_code (TYPE_CODE_STRUCT); |
8ecb59f8 | 7989 | INIT_NONE_SPECIFIC (type); |
d0e39ea2 | 7990 | type->set_name ("<empty>"); |
14f9c5c9 AS |
7991 | TYPE_LENGTH (type) = 0; |
7992 | return type; | |
7993 | } | |
7994 | ||
7995 | /* An ordinary record type (with fixed-length fields) that describes | |
4c4b4cd2 PH |
7996 | the value of type TYPE at VALADDR or ADDRESS (see comments at |
7997 | the beginning of this section) VAL according to GNAT conventions. | |
7998 | DVAL0 should describe the (portion of a) record that contains any | |
df407dfe | 7999 | necessary discriminants. It should be NULL if value_type (VAL) is |
14f9c5c9 AS |
8000 | an outer-level type (i.e., as opposed to a branch of a variant.) A |
8001 | variant field (unless unchecked) is replaced by a particular branch | |
4c4b4cd2 | 8002 | of the variant. |
14f9c5c9 | 8003 | |
4c4b4cd2 PH |
8004 | If not KEEP_DYNAMIC_FIELDS, then all fields whose position or |
8005 | length are not statically known are discarded. As a consequence, | |
8006 | VALADDR, ADDRESS and DVAL0 are ignored. | |
8007 | ||
8008 | NOTE: Limitations: For now, we assume that dynamic fields and | |
8009 | variants occupy whole numbers of bytes. However, they need not be | |
8010 | byte-aligned. */ | |
8011 | ||
8012 | struct type * | |
10a2c479 | 8013 | ada_template_to_fixed_record_type_1 (struct type *type, |
fc1a4b47 | 8014 | const gdb_byte *valaddr, |
4c4b4cd2 PH |
8015 | CORE_ADDR address, struct value *dval0, |
8016 | int keep_dynamic_fields) | |
14f9c5c9 | 8017 | { |
d2e4a39e AS |
8018 | struct value *mark = value_mark (); |
8019 | struct value *dval; | |
8020 | struct type *rtype; | |
14f9c5c9 | 8021 | int nfields, bit_len; |
4c4b4cd2 | 8022 | int variant_field; |
14f9c5c9 | 8023 | long off; |
d94e4f4f | 8024 | int fld_bit_len; |
14f9c5c9 AS |
8025 | int f; |
8026 | ||
4c4b4cd2 PH |
8027 | /* Compute the number of fields in this record type that are going |
8028 | to be processed: unless keep_dynamic_fields, this includes only | |
8029 | fields whose position and length are static will be processed. */ | |
8030 | if (keep_dynamic_fields) | |
1f704f76 | 8031 | nfields = type->num_fields (); |
4c4b4cd2 PH |
8032 | else |
8033 | { | |
8034 | nfields = 0; | |
1f704f76 | 8035 | while (nfields < type->num_fields () |
4c4b4cd2 PH |
8036 | && !ada_is_variant_part (type, nfields) |
8037 | && !is_dynamic_field (type, nfields)) | |
8038 | nfields++; | |
8039 | } | |
8040 | ||
e9bb382b | 8041 | rtype = alloc_type_copy (type); |
67607e24 | 8042 | rtype->set_code (TYPE_CODE_STRUCT); |
8ecb59f8 | 8043 | INIT_NONE_SPECIFIC (rtype); |
5e33d5f4 | 8044 | rtype->set_num_fields (nfields); |
3cabb6b0 SM |
8045 | rtype->set_fields |
8046 | ((struct field *) TYPE_ZALLOC (rtype, nfields * sizeof (struct field))); | |
d0e39ea2 | 8047 | rtype->set_name (ada_type_name (type)); |
876cecd0 | 8048 | TYPE_FIXED_INSTANCE (rtype) = 1; |
14f9c5c9 | 8049 | |
d2e4a39e AS |
8050 | off = 0; |
8051 | bit_len = 0; | |
4c4b4cd2 PH |
8052 | variant_field = -1; |
8053 | ||
14f9c5c9 AS |
8054 | for (f = 0; f < nfields; f += 1) |
8055 | { | |
a89febbd | 8056 | off = align_up (off, field_alignment (type, f)) |
6c038f32 | 8057 | + TYPE_FIELD_BITPOS (type, f); |
ceacbf6e | 8058 | SET_FIELD_BITPOS (rtype->field (f), off); |
d2e4a39e | 8059 | TYPE_FIELD_BITSIZE (rtype, f) = 0; |
14f9c5c9 | 8060 | |
d2e4a39e | 8061 | if (ada_is_variant_part (type, f)) |
4c4b4cd2 PH |
8062 | { |
8063 | variant_field = f; | |
d94e4f4f | 8064 | fld_bit_len = 0; |
4c4b4cd2 | 8065 | } |
14f9c5c9 | 8066 | else if (is_dynamic_field (type, f)) |
4c4b4cd2 | 8067 | { |
284614f0 JB |
8068 | const gdb_byte *field_valaddr = valaddr; |
8069 | CORE_ADDR field_address = address; | |
8070 | struct type *field_type = | |
8071 | TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f)); | |
8072 | ||
4c4b4cd2 | 8073 | if (dval0 == NULL) |
b5304971 JG |
8074 | { |
8075 | /* rtype's length is computed based on the run-time | |
8076 | value of discriminants. If the discriminants are not | |
8077 | initialized, the type size may be completely bogus and | |
0963b4bd | 8078 | GDB may fail to allocate a value for it. So check the |
b5304971 | 8079 | size first before creating the value. */ |
c1b5a1a6 | 8080 | ada_ensure_varsize_limit (rtype); |
012370f6 TT |
8081 | /* Using plain value_from_contents_and_address here |
8082 | causes problems because we will end up trying to | |
8083 | resolve a type that is currently being | |
8084 | constructed. */ | |
8085 | dval = value_from_contents_and_address_unresolved (rtype, | |
8086 | valaddr, | |
8087 | address); | |
9f1f738a | 8088 | rtype = value_type (dval); |
b5304971 | 8089 | } |
4c4b4cd2 PH |
8090 | else |
8091 | dval = dval0; | |
8092 | ||
284614f0 JB |
8093 | /* If the type referenced by this field is an aligner type, we need |
8094 | to unwrap that aligner type, because its size might not be set. | |
8095 | Keeping the aligner type would cause us to compute the wrong | |
8096 | size for this field, impacting the offset of the all the fields | |
8097 | that follow this one. */ | |
8098 | if (ada_is_aligner_type (field_type)) | |
8099 | { | |
8100 | long field_offset = TYPE_FIELD_BITPOS (field_type, f); | |
8101 | ||
8102 | field_valaddr = cond_offset_host (field_valaddr, field_offset); | |
8103 | field_address = cond_offset_target (field_address, field_offset); | |
8104 | field_type = ada_aligned_type (field_type); | |
8105 | } | |
8106 | ||
8107 | field_valaddr = cond_offset_host (field_valaddr, | |
8108 | off / TARGET_CHAR_BIT); | |
8109 | field_address = cond_offset_target (field_address, | |
8110 | off / TARGET_CHAR_BIT); | |
8111 | ||
8112 | /* Get the fixed type of the field. Note that, in this case, | |
8113 | we do not want to get the real type out of the tag: if | |
8114 | the current field is the parent part of a tagged record, | |
8115 | we will get the tag of the object. Clearly wrong: the real | |
8116 | type of the parent is not the real type of the child. We | |
8117 | would end up in an infinite loop. */ | |
8118 | field_type = ada_get_base_type (field_type); | |
8119 | field_type = ada_to_fixed_type (field_type, field_valaddr, | |
8120 | field_address, dval, 0); | |
27f2a97b JB |
8121 | /* If the field size is already larger than the maximum |
8122 | object size, then the record itself will necessarily | |
8123 | be larger than the maximum object size. We need to make | |
8124 | this check now, because the size might be so ridiculously | |
8125 | large (due to an uninitialized variable in the inferior) | |
8126 | that it would cause an overflow when adding it to the | |
8127 | record size. */ | |
c1b5a1a6 | 8128 | ada_ensure_varsize_limit (field_type); |
284614f0 JB |
8129 | |
8130 | TYPE_FIELD_TYPE (rtype, f) = field_type; | |
4c4b4cd2 | 8131 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
27f2a97b JB |
8132 | /* The multiplication can potentially overflow. But because |
8133 | the field length has been size-checked just above, and | |
8134 | assuming that the maximum size is a reasonable value, | |
8135 | an overflow should not happen in practice. So rather than | |
8136 | adding overflow recovery code to this already complex code, | |
8137 | we just assume that it's not going to happen. */ | |
d94e4f4f | 8138 | fld_bit_len = |
4c4b4cd2 PH |
8139 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT; |
8140 | } | |
14f9c5c9 | 8141 | else |
4c4b4cd2 | 8142 | { |
5ded5331 JB |
8143 | /* Note: If this field's type is a typedef, it is important |
8144 | to preserve the typedef layer. | |
8145 | ||
8146 | Otherwise, we might be transforming a typedef to a fat | |
8147 | pointer (encoding a pointer to an unconstrained array), | |
8148 | into a basic fat pointer (encoding an unconstrained | |
8149 | array). As both types are implemented using the same | |
8150 | structure, the typedef is the only clue which allows us | |
8151 | to distinguish between the two options. Stripping it | |
8152 | would prevent us from printing this field appropriately. */ | |
8153 | TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f); | |
4c4b4cd2 PH |
8154 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
8155 | if (TYPE_FIELD_BITSIZE (type, f) > 0) | |
d94e4f4f | 8156 | fld_bit_len = |
4c4b4cd2 PH |
8157 | TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f); |
8158 | else | |
5ded5331 JB |
8159 | { |
8160 | struct type *field_type = TYPE_FIELD_TYPE (type, f); | |
8161 | ||
8162 | /* We need to be careful of typedefs when computing | |
8163 | the length of our field. If this is a typedef, | |
8164 | get the length of the target type, not the length | |
8165 | of the typedef. */ | |
78134374 | 8166 | if (field_type->code () == TYPE_CODE_TYPEDEF) |
5ded5331 JB |
8167 | field_type = ada_typedef_target_type (field_type); |
8168 | ||
8169 | fld_bit_len = | |
8170 | TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT; | |
8171 | } | |
4c4b4cd2 | 8172 | } |
14f9c5c9 | 8173 | if (off + fld_bit_len > bit_len) |
4c4b4cd2 | 8174 | bit_len = off + fld_bit_len; |
d94e4f4f | 8175 | off += fld_bit_len; |
4c4b4cd2 | 8176 | TYPE_LENGTH (rtype) = |
a89febbd | 8177 | align_up (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT; |
14f9c5c9 | 8178 | } |
4c4b4cd2 PH |
8179 | |
8180 | /* We handle the variant part, if any, at the end because of certain | |
b1f33ddd | 8181 | odd cases in which it is re-ordered so as NOT to be the last field of |
4c4b4cd2 PH |
8182 | the record. This can happen in the presence of representation |
8183 | clauses. */ | |
8184 | if (variant_field >= 0) | |
8185 | { | |
8186 | struct type *branch_type; | |
8187 | ||
8188 | off = TYPE_FIELD_BITPOS (rtype, variant_field); | |
8189 | ||
8190 | if (dval0 == NULL) | |
9f1f738a | 8191 | { |
012370f6 TT |
8192 | /* Using plain value_from_contents_and_address here causes |
8193 | problems because we will end up trying to resolve a type | |
8194 | that is currently being constructed. */ | |
8195 | dval = value_from_contents_and_address_unresolved (rtype, valaddr, | |
8196 | address); | |
9f1f738a SA |
8197 | rtype = value_type (dval); |
8198 | } | |
4c4b4cd2 PH |
8199 | else |
8200 | dval = dval0; | |
8201 | ||
8202 | branch_type = | |
8203 | to_fixed_variant_branch_type | |
8204 | (TYPE_FIELD_TYPE (type, variant_field), | |
8205 | cond_offset_host (valaddr, off / TARGET_CHAR_BIT), | |
8206 | cond_offset_target (address, off / TARGET_CHAR_BIT), dval); | |
8207 | if (branch_type == NULL) | |
8208 | { | |
1f704f76 | 8209 | for (f = variant_field + 1; f < rtype->num_fields (); f += 1) |
80fc5e77 | 8210 | rtype->field (f - 1) = rtype->field (f); |
5e33d5f4 | 8211 | rtype->set_num_fields (rtype->num_fields () - 1); |
4c4b4cd2 PH |
8212 | } |
8213 | else | |
8214 | { | |
8215 | TYPE_FIELD_TYPE (rtype, variant_field) = branch_type; | |
8216 | TYPE_FIELD_NAME (rtype, variant_field) = "S"; | |
8217 | fld_bit_len = | |
8218 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) * | |
8219 | TARGET_CHAR_BIT; | |
8220 | if (off + fld_bit_len > bit_len) | |
8221 | bit_len = off + fld_bit_len; | |
8222 | TYPE_LENGTH (rtype) = | |
a89febbd | 8223 | align_up (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT; |
4c4b4cd2 PH |
8224 | } |
8225 | } | |
8226 | ||
714e53ab PH |
8227 | /* According to exp_dbug.ads, the size of TYPE for variable-size records |
8228 | should contain the alignment of that record, which should be a strictly | |
8229 | positive value. If null or negative, then something is wrong, most | |
8230 | probably in the debug info. In that case, we don't round up the size | |
0963b4bd | 8231 | of the resulting type. If this record is not part of another structure, |
714e53ab PH |
8232 | the current RTYPE length might be good enough for our purposes. */ |
8233 | if (TYPE_LENGTH (type) <= 0) | |
8234 | { | |
7d93a1e0 | 8235 | if (rtype->name ()) |
cc1defb1 | 8236 | warning (_("Invalid type size for `%s' detected: %s."), |
7d93a1e0 | 8237 | rtype->name (), pulongest (TYPE_LENGTH (type))); |
323e0a4a | 8238 | else |
cc1defb1 KS |
8239 | warning (_("Invalid type size for <unnamed> detected: %s."), |
8240 | pulongest (TYPE_LENGTH (type))); | |
714e53ab PH |
8241 | } |
8242 | else | |
8243 | { | |
a89febbd TT |
8244 | TYPE_LENGTH (rtype) = align_up (TYPE_LENGTH (rtype), |
8245 | TYPE_LENGTH (type)); | |
714e53ab | 8246 | } |
14f9c5c9 AS |
8247 | |
8248 | value_free_to_mark (mark); | |
d2e4a39e | 8249 | if (TYPE_LENGTH (rtype) > varsize_limit) |
323e0a4a | 8250 | error (_("record type with dynamic size is larger than varsize-limit")); |
14f9c5c9 AS |
8251 | return rtype; |
8252 | } | |
8253 | ||
4c4b4cd2 PH |
8254 | /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS |
8255 | of 1. */ | |
14f9c5c9 | 8256 | |
d2e4a39e | 8257 | static struct type * |
fc1a4b47 | 8258 | template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr, |
4c4b4cd2 PH |
8259 | CORE_ADDR address, struct value *dval0) |
8260 | { | |
8261 | return ada_template_to_fixed_record_type_1 (type, valaddr, | |
8262 | address, dval0, 1); | |
8263 | } | |
8264 | ||
8265 | /* An ordinary record type in which ___XVL-convention fields and | |
8266 | ___XVU- and ___XVN-convention field types in TYPE0 are replaced with | |
8267 | static approximations, containing all possible fields. Uses | |
8268 | no runtime values. Useless for use in values, but that's OK, | |
8269 | since the results are used only for type determinations. Works on both | |
8270 | structs and unions. Representation note: to save space, we memorize | |
8271 | the result of this function in the TYPE_TARGET_TYPE of the | |
8272 | template type. */ | |
8273 | ||
8274 | static struct type * | |
8275 | template_to_static_fixed_type (struct type *type0) | |
14f9c5c9 AS |
8276 | { |
8277 | struct type *type; | |
8278 | int nfields; | |
8279 | int f; | |
8280 | ||
9e195661 PMR |
8281 | /* No need no do anything if the input type is already fixed. */ |
8282 | if (TYPE_FIXED_INSTANCE (type0)) | |
8283 | return type0; | |
8284 | ||
8285 | /* Likewise if we already have computed the static approximation. */ | |
4c4b4cd2 PH |
8286 | if (TYPE_TARGET_TYPE (type0) != NULL) |
8287 | return TYPE_TARGET_TYPE (type0); | |
8288 | ||
9e195661 | 8289 | /* Don't clone TYPE0 until we are sure we are going to need a copy. */ |
4c4b4cd2 | 8290 | type = type0; |
1f704f76 | 8291 | nfields = type0->num_fields (); |
9e195661 PMR |
8292 | |
8293 | /* Whether or not we cloned TYPE0, cache the result so that we don't do | |
8294 | recompute all over next time. */ | |
8295 | TYPE_TARGET_TYPE (type0) = type; | |
14f9c5c9 AS |
8296 | |
8297 | for (f = 0; f < nfields; f += 1) | |
8298 | { | |
460efde1 | 8299 | struct type *field_type = TYPE_FIELD_TYPE (type0, f); |
4c4b4cd2 | 8300 | struct type *new_type; |
14f9c5c9 | 8301 | |
4c4b4cd2 | 8302 | if (is_dynamic_field (type0, f)) |
460efde1 JB |
8303 | { |
8304 | field_type = ada_check_typedef (field_type); | |
8305 | new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type)); | |
8306 | } | |
14f9c5c9 | 8307 | else |
f192137b | 8308 | new_type = static_unwrap_type (field_type); |
9e195661 PMR |
8309 | |
8310 | if (new_type != field_type) | |
8311 | { | |
8312 | /* Clone TYPE0 only the first time we get a new field type. */ | |
8313 | if (type == type0) | |
8314 | { | |
8315 | TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0); | |
78134374 | 8316 | type->set_code (type0->code ()); |
8ecb59f8 | 8317 | INIT_NONE_SPECIFIC (type); |
5e33d5f4 | 8318 | type->set_num_fields (nfields); |
3cabb6b0 SM |
8319 | |
8320 | field *fields = | |
8321 | ((struct field *) | |
8322 | TYPE_ALLOC (type, nfields * sizeof (struct field))); | |
80fc5e77 | 8323 | memcpy (fields, type0->fields (), |
9e195661 | 8324 | sizeof (struct field) * nfields); |
3cabb6b0 SM |
8325 | type->set_fields (fields); |
8326 | ||
d0e39ea2 | 8327 | type->set_name (ada_type_name (type0)); |
9e195661 PMR |
8328 | TYPE_FIXED_INSTANCE (type) = 1; |
8329 | TYPE_LENGTH (type) = 0; | |
8330 | } | |
8331 | TYPE_FIELD_TYPE (type, f) = new_type; | |
8332 | TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f); | |
8333 | } | |
14f9c5c9 | 8334 | } |
9e195661 | 8335 | |
14f9c5c9 AS |
8336 | return type; |
8337 | } | |
8338 | ||
4c4b4cd2 | 8339 | /* Given an object of type TYPE whose contents are at VALADDR and |
5823c3ef JB |
8340 | whose address in memory is ADDRESS, returns a revision of TYPE, |
8341 | which should be a non-dynamic-sized record, in which the variant | |
8342 | part, if any, is replaced with the appropriate branch. Looks | |
4c4b4cd2 PH |
8343 | for discriminant values in DVAL0, which can be NULL if the record |
8344 | contains the necessary discriminant values. */ | |
8345 | ||
d2e4a39e | 8346 | static struct type * |
fc1a4b47 | 8347 | to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr, |
4c4b4cd2 | 8348 | CORE_ADDR address, struct value *dval0) |
14f9c5c9 | 8349 | { |
d2e4a39e | 8350 | struct value *mark = value_mark (); |
4c4b4cd2 | 8351 | struct value *dval; |
d2e4a39e | 8352 | struct type *rtype; |
14f9c5c9 | 8353 | struct type *branch_type; |
1f704f76 | 8354 | int nfields = type->num_fields (); |
4c4b4cd2 | 8355 | int variant_field = variant_field_index (type); |
14f9c5c9 | 8356 | |
4c4b4cd2 | 8357 | if (variant_field == -1) |
14f9c5c9 AS |
8358 | return type; |
8359 | ||
4c4b4cd2 | 8360 | if (dval0 == NULL) |
9f1f738a SA |
8361 | { |
8362 | dval = value_from_contents_and_address (type, valaddr, address); | |
8363 | type = value_type (dval); | |
8364 | } | |
4c4b4cd2 PH |
8365 | else |
8366 | dval = dval0; | |
8367 | ||
e9bb382b | 8368 | rtype = alloc_type_copy (type); |
67607e24 | 8369 | rtype->set_code (TYPE_CODE_STRUCT); |
8ecb59f8 | 8370 | INIT_NONE_SPECIFIC (rtype); |
5e33d5f4 | 8371 | rtype->set_num_fields (nfields); |
3cabb6b0 SM |
8372 | |
8373 | field *fields = | |
d2e4a39e | 8374 | (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field)); |
80fc5e77 | 8375 | memcpy (fields, type->fields (), sizeof (struct field) * nfields); |
3cabb6b0 SM |
8376 | rtype->set_fields (fields); |
8377 | ||
d0e39ea2 | 8378 | rtype->set_name (ada_type_name (type)); |
876cecd0 | 8379 | TYPE_FIXED_INSTANCE (rtype) = 1; |
14f9c5c9 AS |
8380 | TYPE_LENGTH (rtype) = TYPE_LENGTH (type); |
8381 | ||
4c4b4cd2 PH |
8382 | branch_type = to_fixed_variant_branch_type |
8383 | (TYPE_FIELD_TYPE (type, variant_field), | |
d2e4a39e | 8384 | cond_offset_host (valaddr, |
4c4b4cd2 PH |
8385 | TYPE_FIELD_BITPOS (type, variant_field) |
8386 | / TARGET_CHAR_BIT), | |
d2e4a39e | 8387 | cond_offset_target (address, |
4c4b4cd2 PH |
8388 | TYPE_FIELD_BITPOS (type, variant_field) |
8389 | / TARGET_CHAR_BIT), dval); | |
d2e4a39e | 8390 | if (branch_type == NULL) |
14f9c5c9 | 8391 | { |
4c4b4cd2 | 8392 | int f; |
5b4ee69b | 8393 | |
4c4b4cd2 | 8394 | for (f = variant_field + 1; f < nfields; f += 1) |
80fc5e77 | 8395 | rtype->field (f - 1) = rtype->field (f); |
5e33d5f4 | 8396 | rtype->set_num_fields (rtype->num_fields () - 1); |
14f9c5c9 AS |
8397 | } |
8398 | else | |
8399 | { | |
4c4b4cd2 PH |
8400 | TYPE_FIELD_TYPE (rtype, variant_field) = branch_type; |
8401 | TYPE_FIELD_NAME (rtype, variant_field) = "S"; | |
8402 | TYPE_FIELD_BITSIZE (rtype, variant_field) = 0; | |
14f9c5c9 | 8403 | TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type); |
14f9c5c9 | 8404 | } |
4c4b4cd2 | 8405 | TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field)); |
d2e4a39e | 8406 | |
4c4b4cd2 | 8407 | value_free_to_mark (mark); |
14f9c5c9 AS |
8408 | return rtype; |
8409 | } | |
8410 | ||
8411 | /* An ordinary record type (with fixed-length fields) that describes | |
8412 | the value at (TYPE0, VALADDR, ADDRESS) [see explanation at | |
8413 | beginning of this section]. Any necessary discriminants' values | |
4c4b4cd2 PH |
8414 | should be in DVAL, a record value; it may be NULL if the object |
8415 | at ADDR itself contains any necessary discriminant values. | |
8416 | Additionally, VALADDR and ADDRESS may also be NULL if no discriminant | |
8417 | values from the record are needed. Except in the case that DVAL, | |
8418 | VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless | |
8419 | unchecked) is replaced by a particular branch of the variant. | |
8420 | ||
8421 | NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0 | |
8422 | is questionable and may be removed. It can arise during the | |
8423 | processing of an unconstrained-array-of-record type where all the | |
8424 | variant branches have exactly the same size. This is because in | |
8425 | such cases, the compiler does not bother to use the XVS convention | |
8426 | when encoding the record. I am currently dubious of this | |
8427 | shortcut and suspect the compiler should be altered. FIXME. */ | |
14f9c5c9 | 8428 | |
d2e4a39e | 8429 | static struct type * |
fc1a4b47 | 8430 | to_fixed_record_type (struct type *type0, const gdb_byte *valaddr, |
4c4b4cd2 | 8431 | CORE_ADDR address, struct value *dval) |
14f9c5c9 | 8432 | { |
d2e4a39e | 8433 | struct type *templ_type; |
14f9c5c9 | 8434 | |
876cecd0 | 8435 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 PH |
8436 | return type0; |
8437 | ||
d2e4a39e | 8438 | templ_type = dynamic_template_type (type0); |
14f9c5c9 AS |
8439 | |
8440 | if (templ_type != NULL) | |
8441 | return template_to_fixed_record_type (templ_type, valaddr, address, dval); | |
4c4b4cd2 PH |
8442 | else if (variant_field_index (type0) >= 0) |
8443 | { | |
8444 | if (dval == NULL && valaddr == NULL && address == 0) | |
8445 | return type0; | |
8446 | return to_record_with_fixed_variant_part (type0, valaddr, address, | |
8447 | dval); | |
8448 | } | |
14f9c5c9 AS |
8449 | else |
8450 | { | |
876cecd0 | 8451 | TYPE_FIXED_INSTANCE (type0) = 1; |
14f9c5c9 AS |
8452 | return type0; |
8453 | } | |
8454 | ||
8455 | } | |
8456 | ||
8457 | /* An ordinary record type (with fixed-length fields) that describes | |
8458 | the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a | |
8459 | union type. Any necessary discriminants' values should be in DVAL, | |
8460 | a record value. That is, this routine selects the appropriate | |
8461 | branch of the union at ADDR according to the discriminant value | |
b1f33ddd | 8462 | indicated in the union's type name. Returns VAR_TYPE0 itself if |
0963b4bd | 8463 | it represents a variant subject to a pragma Unchecked_Union. */ |
14f9c5c9 | 8464 | |
d2e4a39e | 8465 | static struct type * |
fc1a4b47 | 8466 | to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr, |
4c4b4cd2 | 8467 | CORE_ADDR address, struct value *dval) |
14f9c5c9 AS |
8468 | { |
8469 | int which; | |
d2e4a39e AS |
8470 | struct type *templ_type; |
8471 | struct type *var_type; | |
14f9c5c9 | 8472 | |
78134374 | 8473 | if (var_type0->code () == TYPE_CODE_PTR) |
14f9c5c9 | 8474 | var_type = TYPE_TARGET_TYPE (var_type0); |
d2e4a39e | 8475 | else |
14f9c5c9 AS |
8476 | var_type = var_type0; |
8477 | ||
8478 | templ_type = ada_find_parallel_type (var_type, "___XVU"); | |
8479 | ||
8480 | if (templ_type != NULL) | |
8481 | var_type = templ_type; | |
8482 | ||
b1f33ddd JB |
8483 | if (is_unchecked_variant (var_type, value_type (dval))) |
8484 | return var_type0; | |
d8af9068 | 8485 | which = ada_which_variant_applies (var_type, dval); |
14f9c5c9 AS |
8486 | |
8487 | if (which < 0) | |
e9bb382b | 8488 | return empty_record (var_type); |
14f9c5c9 | 8489 | else if (is_dynamic_field (var_type, which)) |
4c4b4cd2 | 8490 | return to_fixed_record_type |
d2e4a39e AS |
8491 | (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)), |
8492 | valaddr, address, dval); | |
4c4b4cd2 | 8493 | else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0) |
d2e4a39e AS |
8494 | return |
8495 | to_fixed_record_type | |
8496 | (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval); | |
14f9c5c9 AS |
8497 | else |
8498 | return TYPE_FIELD_TYPE (var_type, which); | |
8499 | } | |
8500 | ||
8908fca5 JB |
8501 | /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if |
8502 | ENCODING_TYPE, a type following the GNAT conventions for discrete | |
8503 | type encodings, only carries redundant information. */ | |
8504 | ||
8505 | static int | |
8506 | ada_is_redundant_range_encoding (struct type *range_type, | |
8507 | struct type *encoding_type) | |
8508 | { | |
108d56a4 | 8509 | const char *bounds_str; |
8908fca5 JB |
8510 | int n; |
8511 | LONGEST lo, hi; | |
8512 | ||
78134374 | 8513 | gdb_assert (range_type->code () == TYPE_CODE_RANGE); |
8908fca5 | 8514 | |
78134374 SM |
8515 | if (get_base_type (range_type)->code () |
8516 | != get_base_type (encoding_type)->code ()) | |
005e2509 JB |
8517 | { |
8518 | /* The compiler probably used a simple base type to describe | |
8519 | the range type instead of the range's actual base type, | |
8520 | expecting us to get the real base type from the encoding | |
8521 | anyway. In this situation, the encoding cannot be ignored | |
8522 | as redundant. */ | |
8523 | return 0; | |
8524 | } | |
8525 | ||
8908fca5 JB |
8526 | if (is_dynamic_type (range_type)) |
8527 | return 0; | |
8528 | ||
7d93a1e0 | 8529 | if (encoding_type->name () == NULL) |
8908fca5 JB |
8530 | return 0; |
8531 | ||
7d93a1e0 | 8532 | bounds_str = strstr (encoding_type->name (), "___XDLU_"); |
8908fca5 JB |
8533 | if (bounds_str == NULL) |
8534 | return 0; | |
8535 | ||
8536 | n = 8; /* Skip "___XDLU_". */ | |
8537 | if (!ada_scan_number (bounds_str, n, &lo, &n)) | |
8538 | return 0; | |
8539 | if (TYPE_LOW_BOUND (range_type) != lo) | |
8540 | return 0; | |
8541 | ||
8542 | n += 2; /* Skip the "__" separator between the two bounds. */ | |
8543 | if (!ada_scan_number (bounds_str, n, &hi, &n)) | |
8544 | return 0; | |
8545 | if (TYPE_HIGH_BOUND (range_type) != hi) | |
8546 | return 0; | |
8547 | ||
8548 | return 1; | |
8549 | } | |
8550 | ||
8551 | /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE, | |
8552 | a type following the GNAT encoding for describing array type | |
8553 | indices, only carries redundant information. */ | |
8554 | ||
8555 | static int | |
8556 | ada_is_redundant_index_type_desc (struct type *array_type, | |
8557 | struct type *desc_type) | |
8558 | { | |
8559 | struct type *this_layer = check_typedef (array_type); | |
8560 | int i; | |
8561 | ||
1f704f76 | 8562 | for (i = 0; i < desc_type->num_fields (); i++) |
8908fca5 JB |
8563 | { |
8564 | if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer), | |
8565 | TYPE_FIELD_TYPE (desc_type, i))) | |
8566 | return 0; | |
8567 | this_layer = check_typedef (TYPE_TARGET_TYPE (this_layer)); | |
8568 | } | |
8569 | ||
8570 | return 1; | |
8571 | } | |
8572 | ||
14f9c5c9 AS |
8573 | /* Assuming that TYPE0 is an array type describing the type of a value |
8574 | at ADDR, and that DVAL describes a record containing any | |
8575 | discriminants used in TYPE0, returns a type for the value that | |
8576 | contains no dynamic components (that is, no components whose sizes | |
8577 | are determined by run-time quantities). Unless IGNORE_TOO_BIG is | |
8578 | true, gives an error message if the resulting type's size is over | |
4c4b4cd2 | 8579 | varsize_limit. */ |
14f9c5c9 | 8580 | |
d2e4a39e AS |
8581 | static struct type * |
8582 | to_fixed_array_type (struct type *type0, struct value *dval, | |
4c4b4cd2 | 8583 | int ignore_too_big) |
14f9c5c9 | 8584 | { |
d2e4a39e AS |
8585 | struct type *index_type_desc; |
8586 | struct type *result; | |
ad82864c | 8587 | int constrained_packed_array_p; |
931e5bc3 | 8588 | static const char *xa_suffix = "___XA"; |
14f9c5c9 | 8589 | |
b0dd7688 | 8590 | type0 = ada_check_typedef (type0); |
284614f0 | 8591 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 | 8592 | return type0; |
14f9c5c9 | 8593 | |
ad82864c JB |
8594 | constrained_packed_array_p = ada_is_constrained_packed_array_type (type0); |
8595 | if (constrained_packed_array_p) | |
8596 | type0 = decode_constrained_packed_array_type (type0); | |
284614f0 | 8597 | |
931e5bc3 JG |
8598 | index_type_desc = ada_find_parallel_type (type0, xa_suffix); |
8599 | ||
8600 | /* As mentioned in exp_dbug.ads, for non bit-packed arrays an | |
8601 | encoding suffixed with 'P' may still be generated. If so, | |
8602 | it should be used to find the XA type. */ | |
8603 | ||
8604 | if (index_type_desc == NULL) | |
8605 | { | |
1da0522e | 8606 | const char *type_name = ada_type_name (type0); |
931e5bc3 | 8607 | |
1da0522e | 8608 | if (type_name != NULL) |
931e5bc3 | 8609 | { |
1da0522e | 8610 | const int len = strlen (type_name); |
931e5bc3 JG |
8611 | char *name = (char *) alloca (len + strlen (xa_suffix)); |
8612 | ||
1da0522e | 8613 | if (type_name[len - 1] == 'P') |
931e5bc3 | 8614 | { |
1da0522e | 8615 | strcpy (name, type_name); |
931e5bc3 JG |
8616 | strcpy (name + len - 1, xa_suffix); |
8617 | index_type_desc = ada_find_parallel_type_with_name (type0, name); | |
8618 | } | |
8619 | } | |
8620 | } | |
8621 | ||
28c85d6c | 8622 | ada_fixup_array_indexes_type (index_type_desc); |
8908fca5 JB |
8623 | if (index_type_desc != NULL |
8624 | && ada_is_redundant_index_type_desc (type0, index_type_desc)) | |
8625 | { | |
8626 | /* Ignore this ___XA parallel type, as it does not bring any | |
8627 | useful information. This allows us to avoid creating fixed | |
8628 | versions of the array's index types, which would be identical | |
8629 | to the original ones. This, in turn, can also help avoid | |
8630 | the creation of fixed versions of the array itself. */ | |
8631 | index_type_desc = NULL; | |
8632 | } | |
8633 | ||
14f9c5c9 AS |
8634 | if (index_type_desc == NULL) |
8635 | { | |
61ee279c | 8636 | struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0)); |
5b4ee69b | 8637 | |
14f9c5c9 | 8638 | /* NOTE: elt_type---the fixed version of elt_type0---should never |
4c4b4cd2 PH |
8639 | depend on the contents of the array in properly constructed |
8640 | debugging data. */ | |
529cad9c PH |
8641 | /* Create a fixed version of the array element type. |
8642 | We're not providing the address of an element here, | |
e1d5a0d2 | 8643 | and thus the actual object value cannot be inspected to do |
529cad9c PH |
8644 | the conversion. This should not be a problem, since arrays of |
8645 | unconstrained objects are not allowed. In particular, all | |
8646 | the elements of an array of a tagged type should all be of | |
8647 | the same type specified in the debugging info. No need to | |
8648 | consult the object tag. */ | |
1ed6ede0 | 8649 | struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1); |
14f9c5c9 | 8650 | |
284614f0 JB |
8651 | /* Make sure we always create a new array type when dealing with |
8652 | packed array types, since we're going to fix-up the array | |
8653 | type length and element bitsize a little further down. */ | |
ad82864c | 8654 | if (elt_type0 == elt_type && !constrained_packed_array_p) |
4c4b4cd2 | 8655 | result = type0; |
14f9c5c9 | 8656 | else |
e9bb382b | 8657 | result = create_array_type (alloc_type_copy (type0), |
4c4b4cd2 | 8658 | elt_type, TYPE_INDEX_TYPE (type0)); |
14f9c5c9 AS |
8659 | } |
8660 | else | |
8661 | { | |
8662 | int i; | |
8663 | struct type *elt_type0; | |
8664 | ||
8665 | elt_type0 = type0; | |
1f704f76 | 8666 | for (i = index_type_desc->num_fields (); i > 0; i -= 1) |
4c4b4cd2 | 8667 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); |
14f9c5c9 AS |
8668 | |
8669 | /* NOTE: result---the fixed version of elt_type0---should never | |
4c4b4cd2 PH |
8670 | depend on the contents of the array in properly constructed |
8671 | debugging data. */ | |
529cad9c PH |
8672 | /* Create a fixed version of the array element type. |
8673 | We're not providing the address of an element here, | |
e1d5a0d2 | 8674 | and thus the actual object value cannot be inspected to do |
529cad9c PH |
8675 | the conversion. This should not be a problem, since arrays of |
8676 | unconstrained objects are not allowed. In particular, all | |
8677 | the elements of an array of a tagged type should all be of | |
8678 | the same type specified in the debugging info. No need to | |
8679 | consult the object tag. */ | |
1ed6ede0 JB |
8680 | result = |
8681 | ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1); | |
1ce677a4 UW |
8682 | |
8683 | elt_type0 = type0; | |
1f704f76 | 8684 | for (i = index_type_desc->num_fields () - 1; i >= 0; i -= 1) |
4c4b4cd2 PH |
8685 | { |
8686 | struct type *range_type = | |
28c85d6c | 8687 | to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval); |
5b4ee69b | 8688 | |
e9bb382b | 8689 | result = create_array_type (alloc_type_copy (elt_type0), |
4c4b4cd2 | 8690 | result, range_type); |
1ce677a4 | 8691 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); |
4c4b4cd2 | 8692 | } |
d2e4a39e | 8693 | if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit) |
323e0a4a | 8694 | error (_("array type with dynamic size is larger than varsize-limit")); |
14f9c5c9 AS |
8695 | } |
8696 | ||
2e6fda7d JB |
8697 | /* We want to preserve the type name. This can be useful when |
8698 | trying to get the type name of a value that has already been | |
8699 | printed (for instance, if the user did "print VAR; whatis $". */ | |
7d93a1e0 | 8700 | result->set_name (type0->name ()); |
2e6fda7d | 8701 | |
ad82864c | 8702 | if (constrained_packed_array_p) |
284614f0 JB |
8703 | { |
8704 | /* So far, the resulting type has been created as if the original | |
8705 | type was a regular (non-packed) array type. As a result, the | |
8706 | bitsize of the array elements needs to be set again, and the array | |
8707 | length needs to be recomputed based on that bitsize. */ | |
8708 | int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result)); | |
8709 | int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0); | |
8710 | ||
8711 | TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0); | |
8712 | TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT; | |
8713 | if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize) | |
8714 | TYPE_LENGTH (result)++; | |
8715 | } | |
8716 | ||
876cecd0 | 8717 | TYPE_FIXED_INSTANCE (result) = 1; |
14f9c5c9 | 8718 | return result; |
d2e4a39e | 8719 | } |
14f9c5c9 AS |
8720 | |
8721 | ||
8722 | /* A standard type (containing no dynamically sized components) | |
8723 | corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS) | |
8724 | DVAL describes a record containing any discriminants used in TYPE0, | |
4c4b4cd2 | 8725 | and may be NULL if there are none, or if the object of type TYPE at |
529cad9c PH |
8726 | ADDRESS or in VALADDR contains these discriminants. |
8727 | ||
1ed6ede0 JB |
8728 | If CHECK_TAG is not null, in the case of tagged types, this function |
8729 | attempts to locate the object's tag and use it to compute the actual | |
8730 | type. However, when ADDRESS is null, we cannot use it to determine the | |
8731 | location of the tag, and therefore compute the tagged type's actual type. | |
8732 | So we return the tagged type without consulting the tag. */ | |
529cad9c | 8733 | |
f192137b JB |
8734 | static struct type * |
8735 | ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr, | |
1ed6ede0 | 8736 | CORE_ADDR address, struct value *dval, int check_tag) |
14f9c5c9 | 8737 | { |
61ee279c | 8738 | type = ada_check_typedef (type); |
8ecb59f8 TT |
8739 | |
8740 | /* Only un-fixed types need to be handled here. */ | |
8741 | if (!HAVE_GNAT_AUX_INFO (type)) | |
8742 | return type; | |
8743 | ||
78134374 | 8744 | switch (type->code ()) |
d2e4a39e AS |
8745 | { |
8746 | default: | |
14f9c5c9 | 8747 | return type; |
d2e4a39e | 8748 | case TYPE_CODE_STRUCT: |
4c4b4cd2 | 8749 | { |
76a01679 | 8750 | struct type *static_type = to_static_fixed_type (type); |
1ed6ede0 JB |
8751 | struct type *fixed_record_type = |
8752 | to_fixed_record_type (type, valaddr, address, NULL); | |
5b4ee69b | 8753 | |
529cad9c PH |
8754 | /* If STATIC_TYPE is a tagged type and we know the object's address, |
8755 | then we can determine its tag, and compute the object's actual | |
0963b4bd | 8756 | type from there. Note that we have to use the fixed record |
1ed6ede0 JB |
8757 | type (the parent part of the record may have dynamic fields |
8758 | and the way the location of _tag is expressed may depend on | |
8759 | them). */ | |
529cad9c | 8760 | |
1ed6ede0 | 8761 | if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0)) |
76a01679 | 8762 | { |
b50d69b5 JG |
8763 | struct value *tag = |
8764 | value_tag_from_contents_and_address | |
8765 | (fixed_record_type, | |
8766 | valaddr, | |
8767 | address); | |
8768 | struct type *real_type = type_from_tag (tag); | |
8769 | struct value *obj = | |
8770 | value_from_contents_and_address (fixed_record_type, | |
8771 | valaddr, | |
8772 | address); | |
9f1f738a | 8773 | fixed_record_type = value_type (obj); |
76a01679 | 8774 | if (real_type != NULL) |
b50d69b5 JG |
8775 | return to_fixed_record_type |
8776 | (real_type, NULL, | |
8777 | value_address (ada_tag_value_at_base_address (obj)), NULL); | |
76a01679 | 8778 | } |
4af88198 JB |
8779 | |
8780 | /* Check to see if there is a parallel ___XVZ variable. | |
8781 | If there is, then it provides the actual size of our type. */ | |
8782 | else if (ada_type_name (fixed_record_type) != NULL) | |
8783 | { | |
0d5cff50 | 8784 | const char *name = ada_type_name (fixed_record_type); |
224c3ddb SM |
8785 | char *xvz_name |
8786 | = (char *) alloca (strlen (name) + 7 /* "___XVZ\0" */); | |
eccab96d | 8787 | bool xvz_found = false; |
4af88198 JB |
8788 | LONGEST size; |
8789 | ||
88c15c34 | 8790 | xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name); |
a70b8144 | 8791 | try |
eccab96d JB |
8792 | { |
8793 | xvz_found = get_int_var_value (xvz_name, size); | |
8794 | } | |
230d2906 | 8795 | catch (const gdb_exception_error &except) |
eccab96d JB |
8796 | { |
8797 | /* We found the variable, but somehow failed to read | |
8798 | its value. Rethrow the same error, but with a little | |
8799 | bit more information, to help the user understand | |
8800 | what went wrong (Eg: the variable might have been | |
8801 | optimized out). */ | |
8802 | throw_error (except.error, | |
8803 | _("unable to read value of %s (%s)"), | |
3d6e9d23 | 8804 | xvz_name, except.what ()); |
eccab96d | 8805 | } |
eccab96d JB |
8806 | |
8807 | if (xvz_found && TYPE_LENGTH (fixed_record_type) != size) | |
4af88198 JB |
8808 | { |
8809 | fixed_record_type = copy_type (fixed_record_type); | |
8810 | TYPE_LENGTH (fixed_record_type) = size; | |
8811 | ||
8812 | /* The FIXED_RECORD_TYPE may have be a stub. We have | |
8813 | observed this when the debugging info is STABS, and | |
8814 | apparently it is something that is hard to fix. | |
8815 | ||
8816 | In practice, we don't need the actual type definition | |
8817 | at all, because the presence of the XVZ variable allows us | |
8818 | to assume that there must be a XVS type as well, which we | |
8819 | should be able to use later, when we need the actual type | |
8820 | definition. | |
8821 | ||
8822 | In the meantime, pretend that the "fixed" type we are | |
8823 | returning is NOT a stub, because this can cause trouble | |
8824 | when using this type to create new types targeting it. | |
8825 | Indeed, the associated creation routines often check | |
8826 | whether the target type is a stub and will try to replace | |
0963b4bd | 8827 | it, thus using a type with the wrong size. This, in turn, |
4af88198 JB |
8828 | might cause the new type to have the wrong size too. |
8829 | Consider the case of an array, for instance, where the size | |
8830 | of the array is computed from the number of elements in | |
8831 | our array multiplied by the size of its element. */ | |
8832 | TYPE_STUB (fixed_record_type) = 0; | |
8833 | } | |
8834 | } | |
1ed6ede0 | 8835 | return fixed_record_type; |
4c4b4cd2 | 8836 | } |
d2e4a39e | 8837 | case TYPE_CODE_ARRAY: |
4c4b4cd2 | 8838 | return to_fixed_array_type (type, dval, 1); |
d2e4a39e AS |
8839 | case TYPE_CODE_UNION: |
8840 | if (dval == NULL) | |
4c4b4cd2 | 8841 | return type; |
d2e4a39e | 8842 | else |
4c4b4cd2 | 8843 | return to_fixed_variant_branch_type (type, valaddr, address, dval); |
d2e4a39e | 8844 | } |
14f9c5c9 AS |
8845 | } |
8846 | ||
f192137b JB |
8847 | /* The same as ada_to_fixed_type_1, except that it preserves the type |
8848 | if it is a TYPE_CODE_TYPEDEF of a type that is already fixed. | |
96dbd2c1 JB |
8849 | |
8850 | The typedef layer needs be preserved in order to differentiate between | |
8851 | arrays and array pointers when both types are implemented using the same | |
8852 | fat pointer. In the array pointer case, the pointer is encoded as | |
8853 | a typedef of the pointer type. For instance, considering: | |
8854 | ||
8855 | type String_Access is access String; | |
8856 | S1 : String_Access := null; | |
8857 | ||
8858 | To the debugger, S1 is defined as a typedef of type String. But | |
8859 | to the user, it is a pointer. So if the user tries to print S1, | |
8860 | we should not dereference the array, but print the array address | |
8861 | instead. | |
8862 | ||
8863 | If we didn't preserve the typedef layer, we would lose the fact that | |
8864 | the type is to be presented as a pointer (needs de-reference before | |
8865 | being printed). And we would also use the source-level type name. */ | |
f192137b JB |
8866 | |
8867 | struct type * | |
8868 | ada_to_fixed_type (struct type *type, const gdb_byte *valaddr, | |
8869 | CORE_ADDR address, struct value *dval, int check_tag) | |
8870 | ||
8871 | { | |
8872 | struct type *fixed_type = | |
8873 | ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag); | |
8874 | ||
96dbd2c1 JB |
8875 | /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE, |
8876 | then preserve the typedef layer. | |
8877 | ||
8878 | Implementation note: We can only check the main-type portion of | |
8879 | the TYPE and FIXED_TYPE, because eliminating the typedef layer | |
8880 | from TYPE now returns a type that has the same instance flags | |
8881 | as TYPE. For instance, if TYPE is a "typedef const", and its | |
8882 | target type is a "struct", then the typedef elimination will return | |
8883 | a "const" version of the target type. See check_typedef for more | |
8884 | details about how the typedef layer elimination is done. | |
8885 | ||
8886 | brobecker/2010-11-19: It seems to me that the only case where it is | |
8887 | useful to preserve the typedef layer is when dealing with fat pointers. | |
8888 | Perhaps, we could add a check for that and preserve the typedef layer | |
85102364 | 8889 | only in that situation. But this seems unnecessary so far, probably |
96dbd2c1 JB |
8890 | because we call check_typedef/ada_check_typedef pretty much everywhere. |
8891 | */ | |
78134374 | 8892 | if (type->code () == TYPE_CODE_TYPEDEF |
720d1a40 | 8893 | && (TYPE_MAIN_TYPE (ada_typedef_target_type (type)) |
96dbd2c1 | 8894 | == TYPE_MAIN_TYPE (fixed_type))) |
f192137b JB |
8895 | return type; |
8896 | ||
8897 | return fixed_type; | |
8898 | } | |
8899 | ||
14f9c5c9 | 8900 | /* A standard (static-sized) type corresponding as well as possible to |
4c4b4cd2 | 8901 | TYPE0, but based on no runtime data. */ |
14f9c5c9 | 8902 | |
d2e4a39e AS |
8903 | static struct type * |
8904 | to_static_fixed_type (struct type *type0) | |
14f9c5c9 | 8905 | { |
d2e4a39e | 8906 | struct type *type; |
14f9c5c9 AS |
8907 | |
8908 | if (type0 == NULL) | |
8909 | return NULL; | |
8910 | ||
876cecd0 | 8911 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 PH |
8912 | return type0; |
8913 | ||
61ee279c | 8914 | type0 = ada_check_typedef (type0); |
d2e4a39e | 8915 | |
78134374 | 8916 | switch (type0->code ()) |
14f9c5c9 AS |
8917 | { |
8918 | default: | |
8919 | return type0; | |
8920 | case TYPE_CODE_STRUCT: | |
8921 | type = dynamic_template_type (type0); | |
d2e4a39e | 8922 | if (type != NULL) |
4c4b4cd2 PH |
8923 | return template_to_static_fixed_type (type); |
8924 | else | |
8925 | return template_to_static_fixed_type (type0); | |
14f9c5c9 AS |
8926 | case TYPE_CODE_UNION: |
8927 | type = ada_find_parallel_type (type0, "___XVU"); | |
8928 | if (type != NULL) | |
4c4b4cd2 PH |
8929 | return template_to_static_fixed_type (type); |
8930 | else | |
8931 | return template_to_static_fixed_type (type0); | |
14f9c5c9 AS |
8932 | } |
8933 | } | |
8934 | ||
4c4b4cd2 PH |
8935 | /* A static approximation of TYPE with all type wrappers removed. */ |
8936 | ||
d2e4a39e AS |
8937 | static struct type * |
8938 | static_unwrap_type (struct type *type) | |
14f9c5c9 AS |
8939 | { |
8940 | if (ada_is_aligner_type (type)) | |
8941 | { | |
61ee279c | 8942 | struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0); |
14f9c5c9 | 8943 | if (ada_type_name (type1) == NULL) |
d0e39ea2 | 8944 | type1->set_name (ada_type_name (type)); |
14f9c5c9 AS |
8945 | |
8946 | return static_unwrap_type (type1); | |
8947 | } | |
d2e4a39e | 8948 | else |
14f9c5c9 | 8949 | { |
d2e4a39e | 8950 | struct type *raw_real_type = ada_get_base_type (type); |
5b4ee69b | 8951 | |
d2e4a39e | 8952 | if (raw_real_type == type) |
4c4b4cd2 | 8953 | return type; |
14f9c5c9 | 8954 | else |
4c4b4cd2 | 8955 | return to_static_fixed_type (raw_real_type); |
14f9c5c9 AS |
8956 | } |
8957 | } | |
8958 | ||
8959 | /* In some cases, incomplete and private types require | |
4c4b4cd2 | 8960 | cross-references that are not resolved as records (for example, |
14f9c5c9 AS |
8961 | type Foo; |
8962 | type FooP is access Foo; | |
8963 | V: FooP; | |
8964 | type Foo is array ...; | |
4c4b4cd2 | 8965 | ). In these cases, since there is no mechanism for producing |
14f9c5c9 AS |
8966 | cross-references to such types, we instead substitute for FooP a |
8967 | stub enumeration type that is nowhere resolved, and whose tag is | |
4c4b4cd2 | 8968 | the name of the actual type. Call these types "non-record stubs". */ |
14f9c5c9 AS |
8969 | |
8970 | /* A type equivalent to TYPE that is not a non-record stub, if one | |
4c4b4cd2 PH |
8971 | exists, otherwise TYPE. */ |
8972 | ||
d2e4a39e | 8973 | struct type * |
61ee279c | 8974 | ada_check_typedef (struct type *type) |
14f9c5c9 | 8975 | { |
727e3d2e JB |
8976 | if (type == NULL) |
8977 | return NULL; | |
8978 | ||
736ade86 XR |
8979 | /* If our type is an access to an unconstrained array, which is encoded |
8980 | as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done. | |
720d1a40 JB |
8981 | We don't want to strip the TYPE_CODE_TYPDEF layer, because this is |
8982 | what allows us to distinguish between fat pointers that represent | |
8983 | array types, and fat pointers that represent array access types | |
8984 | (in both cases, the compiler implements them as fat pointers). */ | |
736ade86 | 8985 | if (ada_is_access_to_unconstrained_array (type)) |
720d1a40 JB |
8986 | return type; |
8987 | ||
f168693b | 8988 | type = check_typedef (type); |
78134374 | 8989 | if (type == NULL || type->code () != TYPE_CODE_ENUM |
529cad9c | 8990 | || !TYPE_STUB (type) |
7d93a1e0 | 8991 | || type->name () == NULL) |
14f9c5c9 | 8992 | return type; |
d2e4a39e | 8993 | else |
14f9c5c9 | 8994 | { |
7d93a1e0 | 8995 | const char *name = type->name (); |
d2e4a39e | 8996 | struct type *type1 = ada_find_any_type (name); |
5b4ee69b | 8997 | |
05e522ef JB |
8998 | if (type1 == NULL) |
8999 | return type; | |
9000 | ||
9001 | /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with | |
9002 | stubs pointing to arrays, as we don't create symbols for array | |
3a867c22 JB |
9003 | types, only for the typedef-to-array types). If that's the case, |
9004 | strip the typedef layer. */ | |
78134374 | 9005 | if (type1->code () == TYPE_CODE_TYPEDEF) |
3a867c22 JB |
9006 | type1 = ada_check_typedef (type1); |
9007 | ||
9008 | return type1; | |
14f9c5c9 AS |
9009 | } |
9010 | } | |
9011 | ||
9012 | /* A value representing the data at VALADDR/ADDRESS as described by | |
9013 | type TYPE0, but with a standard (static-sized) type that correctly | |
9014 | describes it. If VAL0 is not NULL and TYPE0 already is a standard | |
9015 | type, then return VAL0 [this feature is simply to avoid redundant | |
4c4b4cd2 | 9016 | creation of struct values]. */ |
14f9c5c9 | 9017 | |
4c4b4cd2 PH |
9018 | static struct value * |
9019 | ada_to_fixed_value_create (struct type *type0, CORE_ADDR address, | |
9020 | struct value *val0) | |
14f9c5c9 | 9021 | { |
1ed6ede0 | 9022 | struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1); |
5b4ee69b | 9023 | |
14f9c5c9 AS |
9024 | if (type == type0 && val0 != NULL) |
9025 | return val0; | |
cc0e770c JB |
9026 | |
9027 | if (VALUE_LVAL (val0) != lval_memory) | |
9028 | { | |
9029 | /* Our value does not live in memory; it could be a convenience | |
9030 | variable, for instance. Create a not_lval value using val0's | |
9031 | contents. */ | |
9032 | return value_from_contents (type, value_contents (val0)); | |
9033 | } | |
9034 | ||
9035 | return value_from_contents_and_address (type, 0, address); | |
4c4b4cd2 PH |
9036 | } |
9037 | ||
9038 | /* A value representing VAL, but with a standard (static-sized) type | |
9039 | that correctly describes it. Does not necessarily create a new | |
9040 | value. */ | |
9041 | ||
0c3acc09 | 9042 | struct value * |
4c4b4cd2 PH |
9043 | ada_to_fixed_value (struct value *val) |
9044 | { | |
c48db5ca | 9045 | val = unwrap_value (val); |
d8ce9127 | 9046 | val = ada_to_fixed_value_create (value_type (val), value_address (val), val); |
c48db5ca | 9047 | return val; |
14f9c5c9 | 9048 | } |
d2e4a39e | 9049 | \f |
14f9c5c9 | 9050 | |
14f9c5c9 AS |
9051 | /* Attributes */ |
9052 | ||
4c4b4cd2 PH |
9053 | /* Table mapping attribute numbers to names. |
9054 | NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */ | |
14f9c5c9 | 9055 | |
d2e4a39e | 9056 | static const char *attribute_names[] = { |
14f9c5c9 AS |
9057 | "<?>", |
9058 | ||
d2e4a39e | 9059 | "first", |
14f9c5c9 AS |
9060 | "last", |
9061 | "length", | |
9062 | "image", | |
14f9c5c9 AS |
9063 | "max", |
9064 | "min", | |
4c4b4cd2 PH |
9065 | "modulus", |
9066 | "pos", | |
9067 | "size", | |
9068 | "tag", | |
14f9c5c9 | 9069 | "val", |
14f9c5c9 AS |
9070 | 0 |
9071 | }; | |
9072 | ||
de93309a | 9073 | static const char * |
4c4b4cd2 | 9074 | ada_attribute_name (enum exp_opcode n) |
14f9c5c9 | 9075 | { |
4c4b4cd2 PH |
9076 | if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL) |
9077 | return attribute_names[n - OP_ATR_FIRST + 1]; | |
14f9c5c9 AS |
9078 | else |
9079 | return attribute_names[0]; | |
9080 | } | |
9081 | ||
4c4b4cd2 | 9082 | /* Evaluate the 'POS attribute applied to ARG. */ |
14f9c5c9 | 9083 | |
4c4b4cd2 PH |
9084 | static LONGEST |
9085 | pos_atr (struct value *arg) | |
14f9c5c9 | 9086 | { |
24209737 PH |
9087 | struct value *val = coerce_ref (arg); |
9088 | struct type *type = value_type (val); | |
aa715135 | 9089 | LONGEST result; |
14f9c5c9 | 9090 | |
d2e4a39e | 9091 | if (!discrete_type_p (type)) |
323e0a4a | 9092 | error (_("'POS only defined on discrete types")); |
14f9c5c9 | 9093 | |
aa715135 JG |
9094 | if (!discrete_position (type, value_as_long (val), &result)) |
9095 | error (_("enumeration value is invalid: can't find 'POS")); | |
14f9c5c9 | 9096 | |
aa715135 | 9097 | return result; |
4c4b4cd2 PH |
9098 | } |
9099 | ||
9100 | static struct value * | |
3cb382c9 | 9101 | value_pos_atr (struct type *type, struct value *arg) |
4c4b4cd2 | 9102 | { |
3cb382c9 | 9103 | return value_from_longest (type, pos_atr (arg)); |
14f9c5c9 AS |
9104 | } |
9105 | ||
4c4b4cd2 | 9106 | /* Evaluate the TYPE'VAL attribute applied to ARG. */ |
14f9c5c9 | 9107 | |
d2e4a39e | 9108 | static struct value * |
53a47a3e | 9109 | val_atr (struct type *type, LONGEST val) |
14f9c5c9 | 9110 | { |
53a47a3e | 9111 | gdb_assert (discrete_type_p (type)); |
0bc2354b TT |
9112 | if (type->code () == TYPE_CODE_RANGE) |
9113 | type = TYPE_TARGET_TYPE (type); | |
78134374 | 9114 | if (type->code () == TYPE_CODE_ENUM) |
14f9c5c9 | 9115 | { |
53a47a3e | 9116 | if (val < 0 || val >= type->num_fields ()) |
323e0a4a | 9117 | error (_("argument to 'VAL out of range")); |
53a47a3e | 9118 | val = TYPE_FIELD_ENUMVAL (type, val); |
14f9c5c9 | 9119 | } |
53a47a3e TT |
9120 | return value_from_longest (type, val); |
9121 | } | |
9122 | ||
9123 | static struct value * | |
9124 | value_val_atr (struct type *type, struct value *arg) | |
9125 | { | |
9126 | if (!discrete_type_p (type)) | |
9127 | error (_("'VAL only defined on discrete types")); | |
9128 | if (!integer_type_p (value_type (arg))) | |
9129 | error (_("'VAL requires integral argument")); | |
9130 | ||
9131 | return val_atr (type, value_as_long (arg)); | |
14f9c5c9 | 9132 | } |
14f9c5c9 | 9133 | \f |
d2e4a39e | 9134 | |
4c4b4cd2 | 9135 | /* Evaluation */ |
14f9c5c9 | 9136 | |
4c4b4cd2 PH |
9137 | /* True if TYPE appears to be an Ada character type. |
9138 | [At the moment, this is true only for Character and Wide_Character; | |
9139 | It is a heuristic test that could stand improvement]. */ | |
14f9c5c9 | 9140 | |
fc913e53 | 9141 | bool |
d2e4a39e | 9142 | ada_is_character_type (struct type *type) |
14f9c5c9 | 9143 | { |
7b9f71f2 JB |
9144 | const char *name; |
9145 | ||
9146 | /* If the type code says it's a character, then assume it really is, | |
9147 | and don't check any further. */ | |
78134374 | 9148 | if (type->code () == TYPE_CODE_CHAR) |
fc913e53 | 9149 | return true; |
7b9f71f2 JB |
9150 | |
9151 | /* Otherwise, assume it's a character type iff it is a discrete type | |
9152 | with a known character type name. */ | |
9153 | name = ada_type_name (type); | |
9154 | return (name != NULL | |
78134374 SM |
9155 | && (type->code () == TYPE_CODE_INT |
9156 | || type->code () == TYPE_CODE_RANGE) | |
7b9f71f2 JB |
9157 | && (strcmp (name, "character") == 0 |
9158 | || strcmp (name, "wide_character") == 0 | |
5a517ebd | 9159 | || strcmp (name, "wide_wide_character") == 0 |
7b9f71f2 | 9160 | || strcmp (name, "unsigned char") == 0)); |
14f9c5c9 AS |
9161 | } |
9162 | ||
4c4b4cd2 | 9163 | /* True if TYPE appears to be an Ada string type. */ |
14f9c5c9 | 9164 | |
fc913e53 | 9165 | bool |
ebf56fd3 | 9166 | ada_is_string_type (struct type *type) |
14f9c5c9 | 9167 | { |
61ee279c | 9168 | type = ada_check_typedef (type); |
d2e4a39e | 9169 | if (type != NULL |
78134374 | 9170 | && type->code () != TYPE_CODE_PTR |
76a01679 JB |
9171 | && (ada_is_simple_array_type (type) |
9172 | || ada_is_array_descriptor_type (type)) | |
14f9c5c9 AS |
9173 | && ada_array_arity (type) == 1) |
9174 | { | |
9175 | struct type *elttype = ada_array_element_type (type, 1); | |
9176 | ||
9177 | return ada_is_character_type (elttype); | |
9178 | } | |
d2e4a39e | 9179 | else |
fc913e53 | 9180 | return false; |
14f9c5c9 AS |
9181 | } |
9182 | ||
5bf03f13 JB |
9183 | /* The compiler sometimes provides a parallel XVS type for a given |
9184 | PAD type. Normally, it is safe to follow the PAD type directly, | |
9185 | but older versions of the compiler have a bug that causes the offset | |
9186 | of its "F" field to be wrong. Following that field in that case | |
9187 | would lead to incorrect results, but this can be worked around | |
9188 | by ignoring the PAD type and using the associated XVS type instead. | |
9189 | ||
9190 | Set to True if the debugger should trust the contents of PAD types. | |
9191 | Otherwise, ignore the PAD type if there is a parallel XVS type. */ | |
491144b5 | 9192 | static bool trust_pad_over_xvs = true; |
14f9c5c9 AS |
9193 | |
9194 | /* True if TYPE is a struct type introduced by the compiler to force the | |
9195 | alignment of a value. Such types have a single field with a | |
4c4b4cd2 | 9196 | distinctive name. */ |
14f9c5c9 AS |
9197 | |
9198 | int | |
ebf56fd3 | 9199 | ada_is_aligner_type (struct type *type) |
14f9c5c9 | 9200 | { |
61ee279c | 9201 | type = ada_check_typedef (type); |
714e53ab | 9202 | |
5bf03f13 | 9203 | if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL) |
714e53ab PH |
9204 | return 0; |
9205 | ||
78134374 | 9206 | return (type->code () == TYPE_CODE_STRUCT |
1f704f76 | 9207 | && type->num_fields () == 1 |
4c4b4cd2 | 9208 | && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0); |
14f9c5c9 AS |
9209 | } |
9210 | ||
9211 | /* If there is an ___XVS-convention type parallel to SUBTYPE, return | |
4c4b4cd2 | 9212 | the parallel type. */ |
14f9c5c9 | 9213 | |
d2e4a39e AS |
9214 | struct type * |
9215 | ada_get_base_type (struct type *raw_type) | |
14f9c5c9 | 9216 | { |
d2e4a39e AS |
9217 | struct type *real_type_namer; |
9218 | struct type *raw_real_type; | |
14f9c5c9 | 9219 | |
78134374 | 9220 | if (raw_type == NULL || raw_type->code () != TYPE_CODE_STRUCT) |
14f9c5c9 AS |
9221 | return raw_type; |
9222 | ||
284614f0 JB |
9223 | if (ada_is_aligner_type (raw_type)) |
9224 | /* The encoding specifies that we should always use the aligner type. | |
9225 | So, even if this aligner type has an associated XVS type, we should | |
9226 | simply ignore it. | |
9227 | ||
9228 | According to the compiler gurus, an XVS type parallel to an aligner | |
9229 | type may exist because of a stabs limitation. In stabs, aligner | |
9230 | types are empty because the field has a variable-sized type, and | |
9231 | thus cannot actually be used as an aligner type. As a result, | |
9232 | we need the associated parallel XVS type to decode the type. | |
9233 | Since the policy in the compiler is to not change the internal | |
9234 | representation based on the debugging info format, we sometimes | |
9235 | end up having a redundant XVS type parallel to the aligner type. */ | |
9236 | return raw_type; | |
9237 | ||
14f9c5c9 | 9238 | real_type_namer = ada_find_parallel_type (raw_type, "___XVS"); |
d2e4a39e | 9239 | if (real_type_namer == NULL |
78134374 | 9240 | || real_type_namer->code () != TYPE_CODE_STRUCT |
1f704f76 | 9241 | || real_type_namer->num_fields () != 1) |
14f9c5c9 AS |
9242 | return raw_type; |
9243 | ||
78134374 | 9244 | if (TYPE_FIELD_TYPE (real_type_namer, 0)->code () != TYPE_CODE_REF) |
f80d3ff2 JB |
9245 | { |
9246 | /* This is an older encoding form where the base type needs to be | |
85102364 | 9247 | looked up by name. We prefer the newer encoding because it is |
f80d3ff2 JB |
9248 | more efficient. */ |
9249 | raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0)); | |
9250 | if (raw_real_type == NULL) | |
9251 | return raw_type; | |
9252 | else | |
9253 | return raw_real_type; | |
9254 | } | |
9255 | ||
9256 | /* The field in our XVS type is a reference to the base type. */ | |
9257 | return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0)); | |
d2e4a39e | 9258 | } |
14f9c5c9 | 9259 | |
4c4b4cd2 | 9260 | /* The type of value designated by TYPE, with all aligners removed. */ |
14f9c5c9 | 9261 | |
d2e4a39e AS |
9262 | struct type * |
9263 | ada_aligned_type (struct type *type) | |
14f9c5c9 AS |
9264 | { |
9265 | if (ada_is_aligner_type (type)) | |
9266 | return ada_aligned_type (TYPE_FIELD_TYPE (type, 0)); | |
9267 | else | |
9268 | return ada_get_base_type (type); | |
9269 | } | |
9270 | ||
9271 | ||
9272 | /* The address of the aligned value in an object at address VALADDR | |
4c4b4cd2 | 9273 | having type TYPE. Assumes ada_is_aligner_type (TYPE). */ |
14f9c5c9 | 9274 | |
fc1a4b47 AC |
9275 | const gdb_byte * |
9276 | ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr) | |
14f9c5c9 | 9277 | { |
d2e4a39e | 9278 | if (ada_is_aligner_type (type)) |
14f9c5c9 | 9279 | return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0), |
4c4b4cd2 PH |
9280 | valaddr + |
9281 | TYPE_FIELD_BITPOS (type, | |
9282 | 0) / TARGET_CHAR_BIT); | |
14f9c5c9 AS |
9283 | else |
9284 | return valaddr; | |
9285 | } | |
9286 | ||
4c4b4cd2 PH |
9287 | |
9288 | ||
14f9c5c9 | 9289 | /* The printed representation of an enumeration literal with encoded |
4c4b4cd2 | 9290 | name NAME. The value is good to the next call of ada_enum_name. */ |
d2e4a39e AS |
9291 | const char * |
9292 | ada_enum_name (const char *name) | |
14f9c5c9 | 9293 | { |
4c4b4cd2 PH |
9294 | static char *result; |
9295 | static size_t result_len = 0; | |
e6a959d6 | 9296 | const char *tmp; |
14f9c5c9 | 9297 | |
4c4b4cd2 PH |
9298 | /* First, unqualify the enumeration name: |
9299 | 1. Search for the last '.' character. If we find one, then skip | |
177b42fe | 9300 | all the preceding characters, the unqualified name starts |
76a01679 | 9301 | right after that dot. |
4c4b4cd2 | 9302 | 2. Otherwise, we may be debugging on a target where the compiler |
76a01679 JB |
9303 | translates dots into "__". Search forward for double underscores, |
9304 | but stop searching when we hit an overloading suffix, which is | |
9305 | of the form "__" followed by digits. */ | |
4c4b4cd2 | 9306 | |
c3e5cd34 PH |
9307 | tmp = strrchr (name, '.'); |
9308 | if (tmp != NULL) | |
4c4b4cd2 PH |
9309 | name = tmp + 1; |
9310 | else | |
14f9c5c9 | 9311 | { |
4c4b4cd2 PH |
9312 | while ((tmp = strstr (name, "__")) != NULL) |
9313 | { | |
9314 | if (isdigit (tmp[2])) | |
9315 | break; | |
9316 | else | |
9317 | name = tmp + 2; | |
9318 | } | |
14f9c5c9 AS |
9319 | } |
9320 | ||
9321 | if (name[0] == 'Q') | |
9322 | { | |
14f9c5c9 | 9323 | int v; |
5b4ee69b | 9324 | |
14f9c5c9 | 9325 | if (name[1] == 'U' || name[1] == 'W') |
4c4b4cd2 PH |
9326 | { |
9327 | if (sscanf (name + 2, "%x", &v) != 1) | |
9328 | return name; | |
9329 | } | |
272560b5 TT |
9330 | else if (((name[1] >= '0' && name[1] <= '9') |
9331 | || (name[1] >= 'a' && name[1] <= 'z')) | |
9332 | && name[2] == '\0') | |
9333 | { | |
9334 | GROW_VECT (result, result_len, 4); | |
9335 | xsnprintf (result, result_len, "'%c'", name[1]); | |
9336 | return result; | |
9337 | } | |
14f9c5c9 | 9338 | else |
4c4b4cd2 | 9339 | return name; |
14f9c5c9 | 9340 | |
4c4b4cd2 | 9341 | GROW_VECT (result, result_len, 16); |
14f9c5c9 | 9342 | if (isascii (v) && isprint (v)) |
88c15c34 | 9343 | xsnprintf (result, result_len, "'%c'", v); |
14f9c5c9 | 9344 | else if (name[1] == 'U') |
88c15c34 | 9345 | xsnprintf (result, result_len, "[\"%02x\"]", v); |
14f9c5c9 | 9346 | else |
88c15c34 | 9347 | xsnprintf (result, result_len, "[\"%04x\"]", v); |
14f9c5c9 AS |
9348 | |
9349 | return result; | |
9350 | } | |
d2e4a39e | 9351 | else |
4c4b4cd2 | 9352 | { |
c3e5cd34 PH |
9353 | tmp = strstr (name, "__"); |
9354 | if (tmp == NULL) | |
9355 | tmp = strstr (name, "$"); | |
9356 | if (tmp != NULL) | |
4c4b4cd2 PH |
9357 | { |
9358 | GROW_VECT (result, result_len, tmp - name + 1); | |
9359 | strncpy (result, name, tmp - name); | |
9360 | result[tmp - name] = '\0'; | |
9361 | return result; | |
9362 | } | |
9363 | ||
9364 | return name; | |
9365 | } | |
14f9c5c9 AS |
9366 | } |
9367 | ||
14f9c5c9 AS |
9368 | /* Evaluate the subexpression of EXP starting at *POS as for |
9369 | evaluate_type, updating *POS to point just past the evaluated | |
4c4b4cd2 | 9370 | expression. */ |
14f9c5c9 | 9371 | |
d2e4a39e AS |
9372 | static struct value * |
9373 | evaluate_subexp_type (struct expression *exp, int *pos) | |
14f9c5c9 | 9374 | { |
4b27a620 | 9375 | return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); |
14f9c5c9 AS |
9376 | } |
9377 | ||
9378 | /* If VAL is wrapped in an aligner or subtype wrapper, return the | |
4c4b4cd2 | 9379 | value it wraps. */ |
14f9c5c9 | 9380 | |
d2e4a39e AS |
9381 | static struct value * |
9382 | unwrap_value (struct value *val) | |
14f9c5c9 | 9383 | { |
df407dfe | 9384 | struct type *type = ada_check_typedef (value_type (val)); |
5b4ee69b | 9385 | |
14f9c5c9 AS |
9386 | if (ada_is_aligner_type (type)) |
9387 | { | |
de4d072f | 9388 | struct value *v = ada_value_struct_elt (val, "F", 0); |
df407dfe | 9389 | struct type *val_type = ada_check_typedef (value_type (v)); |
5b4ee69b | 9390 | |
14f9c5c9 | 9391 | if (ada_type_name (val_type) == NULL) |
d0e39ea2 | 9392 | val_type->set_name (ada_type_name (type)); |
14f9c5c9 AS |
9393 | |
9394 | return unwrap_value (v); | |
9395 | } | |
d2e4a39e | 9396 | else |
14f9c5c9 | 9397 | { |
d2e4a39e | 9398 | struct type *raw_real_type = |
61ee279c | 9399 | ada_check_typedef (ada_get_base_type (type)); |
d2e4a39e | 9400 | |
5bf03f13 JB |
9401 | /* If there is no parallel XVS or XVE type, then the value is |
9402 | already unwrapped. Return it without further modification. */ | |
9403 | if ((type == raw_real_type) | |
9404 | && ada_find_parallel_type (type, "___XVE") == NULL) | |
9405 | return val; | |
14f9c5c9 | 9406 | |
d2e4a39e | 9407 | return |
4c4b4cd2 PH |
9408 | coerce_unspec_val_to_type |
9409 | (val, ada_to_fixed_type (raw_real_type, 0, | |
42ae5230 | 9410 | value_address (val), |
1ed6ede0 | 9411 | NULL, 1)); |
14f9c5c9 AS |
9412 | } |
9413 | } | |
d2e4a39e AS |
9414 | |
9415 | static struct value * | |
50eff16b | 9416 | cast_from_fixed (struct type *type, struct value *arg) |
14f9c5c9 | 9417 | { |
50eff16b UW |
9418 | struct value *scale = ada_scaling_factor (value_type (arg)); |
9419 | arg = value_cast (value_type (scale), arg); | |
14f9c5c9 | 9420 | |
50eff16b UW |
9421 | arg = value_binop (arg, scale, BINOP_MUL); |
9422 | return value_cast (type, arg); | |
14f9c5c9 AS |
9423 | } |
9424 | ||
d2e4a39e | 9425 | static struct value * |
50eff16b | 9426 | cast_to_fixed (struct type *type, struct value *arg) |
14f9c5c9 | 9427 | { |
50eff16b UW |
9428 | if (type == value_type (arg)) |
9429 | return arg; | |
5b4ee69b | 9430 | |
50eff16b | 9431 | struct value *scale = ada_scaling_factor (type); |
b2188a06 | 9432 | if (ada_is_gnat_encoded_fixed_point_type (value_type (arg))) |
50eff16b UW |
9433 | arg = cast_from_fixed (value_type (scale), arg); |
9434 | else | |
9435 | arg = value_cast (value_type (scale), arg); | |
9436 | ||
9437 | arg = value_binop (arg, scale, BINOP_DIV); | |
9438 | return value_cast (type, arg); | |
14f9c5c9 AS |
9439 | } |
9440 | ||
d99dcf51 JB |
9441 | /* Given two array types T1 and T2, return nonzero iff both arrays |
9442 | contain the same number of elements. */ | |
9443 | ||
9444 | static int | |
9445 | ada_same_array_size_p (struct type *t1, struct type *t2) | |
9446 | { | |
9447 | LONGEST lo1, hi1, lo2, hi2; | |
9448 | ||
9449 | /* Get the array bounds in order to verify that the size of | |
9450 | the two arrays match. */ | |
9451 | if (!get_array_bounds (t1, &lo1, &hi1) | |
9452 | || !get_array_bounds (t2, &lo2, &hi2)) | |
9453 | error (_("unable to determine array bounds")); | |
9454 | ||
9455 | /* To make things easier for size comparison, normalize a bit | |
9456 | the case of empty arrays by making sure that the difference | |
9457 | between upper bound and lower bound is always -1. */ | |
9458 | if (lo1 > hi1) | |
9459 | hi1 = lo1 - 1; | |
9460 | if (lo2 > hi2) | |
9461 | hi2 = lo2 - 1; | |
9462 | ||
9463 | return (hi1 - lo1 == hi2 - lo2); | |
9464 | } | |
9465 | ||
9466 | /* Assuming that VAL is an array of integrals, and TYPE represents | |
9467 | an array with the same number of elements, but with wider integral | |
9468 | elements, return an array "casted" to TYPE. In practice, this | |
9469 | means that the returned array is built by casting each element | |
9470 | of the original array into TYPE's (wider) element type. */ | |
9471 | ||
9472 | static struct value * | |
9473 | ada_promote_array_of_integrals (struct type *type, struct value *val) | |
9474 | { | |
9475 | struct type *elt_type = TYPE_TARGET_TYPE (type); | |
9476 | LONGEST lo, hi; | |
9477 | struct value *res; | |
9478 | LONGEST i; | |
9479 | ||
9480 | /* Verify that both val and type are arrays of scalars, and | |
9481 | that the size of val's elements is smaller than the size | |
9482 | of type's element. */ | |
78134374 | 9483 | gdb_assert (type->code () == TYPE_CODE_ARRAY); |
d99dcf51 | 9484 | gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type))); |
78134374 | 9485 | gdb_assert (value_type (val)->code () == TYPE_CODE_ARRAY); |
d99dcf51 JB |
9486 | gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val)))); |
9487 | gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type)) | |
9488 | > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val)))); | |
9489 | ||
9490 | if (!get_array_bounds (type, &lo, &hi)) | |
9491 | error (_("unable to determine array bounds")); | |
9492 | ||
9493 | res = allocate_value (type); | |
9494 | ||
9495 | /* Promote each array element. */ | |
9496 | for (i = 0; i < hi - lo + 1; i++) | |
9497 | { | |
9498 | struct value *elt = value_cast (elt_type, value_subscript (val, lo + i)); | |
9499 | ||
9500 | memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)), | |
9501 | value_contents_all (elt), TYPE_LENGTH (elt_type)); | |
9502 | } | |
9503 | ||
9504 | return res; | |
9505 | } | |
9506 | ||
4c4b4cd2 PH |
9507 | /* Coerce VAL as necessary for assignment to an lval of type TYPE, and |
9508 | return the converted value. */ | |
9509 | ||
d2e4a39e AS |
9510 | static struct value * |
9511 | coerce_for_assign (struct type *type, struct value *val) | |
14f9c5c9 | 9512 | { |
df407dfe | 9513 | struct type *type2 = value_type (val); |
5b4ee69b | 9514 | |
14f9c5c9 AS |
9515 | if (type == type2) |
9516 | return val; | |
9517 | ||
61ee279c PH |
9518 | type2 = ada_check_typedef (type2); |
9519 | type = ada_check_typedef (type); | |
14f9c5c9 | 9520 | |
78134374 SM |
9521 | if (type2->code () == TYPE_CODE_PTR |
9522 | && type->code () == TYPE_CODE_ARRAY) | |
14f9c5c9 AS |
9523 | { |
9524 | val = ada_value_ind (val); | |
df407dfe | 9525 | type2 = value_type (val); |
14f9c5c9 AS |
9526 | } |
9527 | ||
78134374 SM |
9528 | if (type2->code () == TYPE_CODE_ARRAY |
9529 | && type->code () == TYPE_CODE_ARRAY) | |
14f9c5c9 | 9530 | { |
d99dcf51 JB |
9531 | if (!ada_same_array_size_p (type, type2)) |
9532 | error (_("cannot assign arrays of different length")); | |
9533 | ||
9534 | if (is_integral_type (TYPE_TARGET_TYPE (type)) | |
9535 | && is_integral_type (TYPE_TARGET_TYPE (type2)) | |
9536 | && TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
9537 | < TYPE_LENGTH (TYPE_TARGET_TYPE (type))) | |
9538 | { | |
9539 | /* Allow implicit promotion of the array elements to | |
9540 | a wider type. */ | |
9541 | return ada_promote_array_of_integrals (type, val); | |
9542 | } | |
9543 | ||
9544 | if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
9545 | != TYPE_LENGTH (TYPE_TARGET_TYPE (type))) | |
323e0a4a | 9546 | error (_("Incompatible types in assignment")); |
04624583 | 9547 | deprecated_set_value_type (val, type); |
14f9c5c9 | 9548 | } |
d2e4a39e | 9549 | return val; |
14f9c5c9 AS |
9550 | } |
9551 | ||
4c4b4cd2 PH |
9552 | static struct value * |
9553 | ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op) | |
9554 | { | |
9555 | struct value *val; | |
9556 | struct type *type1, *type2; | |
9557 | LONGEST v, v1, v2; | |
9558 | ||
994b9211 AC |
9559 | arg1 = coerce_ref (arg1); |
9560 | arg2 = coerce_ref (arg2); | |
18af8284 JB |
9561 | type1 = get_base_type (ada_check_typedef (value_type (arg1))); |
9562 | type2 = get_base_type (ada_check_typedef (value_type (arg2))); | |
4c4b4cd2 | 9563 | |
78134374 SM |
9564 | if (type1->code () != TYPE_CODE_INT |
9565 | || type2->code () != TYPE_CODE_INT) | |
4c4b4cd2 PH |
9566 | return value_binop (arg1, arg2, op); |
9567 | ||
76a01679 | 9568 | switch (op) |
4c4b4cd2 PH |
9569 | { |
9570 | case BINOP_MOD: | |
9571 | case BINOP_DIV: | |
9572 | case BINOP_REM: | |
9573 | break; | |
9574 | default: | |
9575 | return value_binop (arg1, arg2, op); | |
9576 | } | |
9577 | ||
9578 | v2 = value_as_long (arg2); | |
9579 | if (v2 == 0) | |
323e0a4a | 9580 | error (_("second operand of %s must not be zero."), op_string (op)); |
4c4b4cd2 PH |
9581 | |
9582 | if (TYPE_UNSIGNED (type1) || op == BINOP_MOD) | |
9583 | return value_binop (arg1, arg2, op); | |
9584 | ||
9585 | v1 = value_as_long (arg1); | |
9586 | switch (op) | |
9587 | { | |
9588 | case BINOP_DIV: | |
9589 | v = v1 / v2; | |
76a01679 JB |
9590 | if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0) |
9591 | v += v > 0 ? -1 : 1; | |
4c4b4cd2 PH |
9592 | break; |
9593 | case BINOP_REM: | |
9594 | v = v1 % v2; | |
76a01679 JB |
9595 | if (v * v1 < 0) |
9596 | v -= v2; | |
4c4b4cd2 PH |
9597 | break; |
9598 | default: | |
9599 | /* Should not reach this point. */ | |
9600 | v = 0; | |
9601 | } | |
9602 | ||
9603 | val = allocate_value (type1); | |
990a07ab | 9604 | store_unsigned_integer (value_contents_raw (val), |
e17a4113 | 9605 | TYPE_LENGTH (value_type (val)), |
34877895 | 9606 | type_byte_order (type1), v); |
4c4b4cd2 PH |
9607 | return val; |
9608 | } | |
9609 | ||
9610 | static int | |
9611 | ada_value_equal (struct value *arg1, struct value *arg2) | |
9612 | { | |
df407dfe AC |
9613 | if (ada_is_direct_array_type (value_type (arg1)) |
9614 | || ada_is_direct_array_type (value_type (arg2))) | |
4c4b4cd2 | 9615 | { |
79e8fcaa JB |
9616 | struct type *arg1_type, *arg2_type; |
9617 | ||
f58b38bf JB |
9618 | /* Automatically dereference any array reference before |
9619 | we attempt to perform the comparison. */ | |
9620 | arg1 = ada_coerce_ref (arg1); | |
9621 | arg2 = ada_coerce_ref (arg2); | |
79e8fcaa | 9622 | |
4c4b4cd2 PH |
9623 | arg1 = ada_coerce_to_simple_array (arg1); |
9624 | arg2 = ada_coerce_to_simple_array (arg2); | |
79e8fcaa JB |
9625 | |
9626 | arg1_type = ada_check_typedef (value_type (arg1)); | |
9627 | arg2_type = ada_check_typedef (value_type (arg2)); | |
9628 | ||
78134374 SM |
9629 | if (arg1_type->code () != TYPE_CODE_ARRAY |
9630 | || arg2_type->code () != TYPE_CODE_ARRAY) | |
323e0a4a | 9631 | error (_("Attempt to compare array with non-array")); |
4c4b4cd2 | 9632 | /* FIXME: The following works only for types whose |
76a01679 JB |
9633 | representations use all bits (no padding or undefined bits) |
9634 | and do not have user-defined equality. */ | |
79e8fcaa JB |
9635 | return (TYPE_LENGTH (arg1_type) == TYPE_LENGTH (arg2_type) |
9636 | && memcmp (value_contents (arg1), value_contents (arg2), | |
9637 | TYPE_LENGTH (arg1_type)) == 0); | |
4c4b4cd2 PH |
9638 | } |
9639 | return value_equal (arg1, arg2); | |
9640 | } | |
9641 | ||
52ce6436 PH |
9642 | /* Total number of component associations in the aggregate starting at |
9643 | index PC in EXP. Assumes that index PC is the start of an | |
0963b4bd | 9644 | OP_AGGREGATE. */ |
52ce6436 PH |
9645 | |
9646 | static int | |
9647 | num_component_specs (struct expression *exp, int pc) | |
9648 | { | |
9649 | int n, m, i; | |
5b4ee69b | 9650 | |
52ce6436 PH |
9651 | m = exp->elts[pc + 1].longconst; |
9652 | pc += 3; | |
9653 | n = 0; | |
9654 | for (i = 0; i < m; i += 1) | |
9655 | { | |
9656 | switch (exp->elts[pc].opcode) | |
9657 | { | |
9658 | default: | |
9659 | n += 1; | |
9660 | break; | |
9661 | case OP_CHOICES: | |
9662 | n += exp->elts[pc + 1].longconst; | |
9663 | break; | |
9664 | } | |
9665 | ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP); | |
9666 | } | |
9667 | return n; | |
9668 | } | |
9669 | ||
9670 | /* Assign the result of evaluating EXP starting at *POS to the INDEXth | |
9671 | component of LHS (a simple array or a record), updating *POS past | |
9672 | the expression, assuming that LHS is contained in CONTAINER. Does | |
9673 | not modify the inferior's memory, nor does it modify LHS (unless | |
9674 | LHS == CONTAINER). */ | |
9675 | ||
9676 | static void | |
9677 | assign_component (struct value *container, struct value *lhs, LONGEST index, | |
9678 | struct expression *exp, int *pos) | |
9679 | { | |
9680 | struct value *mark = value_mark (); | |
9681 | struct value *elt; | |
0e2da9f0 | 9682 | struct type *lhs_type = check_typedef (value_type (lhs)); |
5b4ee69b | 9683 | |
78134374 | 9684 | if (lhs_type->code () == TYPE_CODE_ARRAY) |
52ce6436 | 9685 | { |
22601c15 UW |
9686 | struct type *index_type = builtin_type (exp->gdbarch)->builtin_int; |
9687 | struct value *index_val = value_from_longest (index_type, index); | |
5b4ee69b | 9688 | |
52ce6436 PH |
9689 | elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val)); |
9690 | } | |
9691 | else | |
9692 | { | |
9693 | elt = ada_index_struct_field (index, lhs, 0, value_type (lhs)); | |
c48db5ca | 9694 | elt = ada_to_fixed_value (elt); |
52ce6436 PH |
9695 | } |
9696 | ||
9697 | if (exp->elts[*pos].opcode == OP_AGGREGATE) | |
9698 | assign_aggregate (container, elt, exp, pos, EVAL_NORMAL); | |
9699 | else | |
9700 | value_assign_to_component (container, elt, | |
9701 | ada_evaluate_subexp (NULL, exp, pos, | |
9702 | EVAL_NORMAL)); | |
9703 | ||
9704 | value_free_to_mark (mark); | |
9705 | } | |
9706 | ||
9707 | /* Assuming that LHS represents an lvalue having a record or array | |
9708 | type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment | |
9709 | of that aggregate's value to LHS, advancing *POS past the | |
9710 | aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an | |
9711 | lvalue containing LHS (possibly LHS itself). Does not modify | |
9712 | the inferior's memory, nor does it modify the contents of | |
0963b4bd | 9713 | LHS (unless == CONTAINER). Returns the modified CONTAINER. */ |
52ce6436 PH |
9714 | |
9715 | static struct value * | |
9716 | assign_aggregate (struct value *container, | |
9717 | struct value *lhs, struct expression *exp, | |
9718 | int *pos, enum noside noside) | |
9719 | { | |
9720 | struct type *lhs_type; | |
9721 | int n = exp->elts[*pos+1].longconst; | |
9722 | LONGEST low_index, high_index; | |
9723 | int num_specs; | |
9724 | LONGEST *indices; | |
9725 | int max_indices, num_indices; | |
52ce6436 | 9726 | int i; |
52ce6436 PH |
9727 | |
9728 | *pos += 3; | |
9729 | if (noside != EVAL_NORMAL) | |
9730 | { | |
52ce6436 PH |
9731 | for (i = 0; i < n; i += 1) |
9732 | ada_evaluate_subexp (NULL, exp, pos, noside); | |
9733 | return container; | |
9734 | } | |
9735 | ||
9736 | container = ada_coerce_ref (container); | |
9737 | if (ada_is_direct_array_type (value_type (container))) | |
9738 | container = ada_coerce_to_simple_array (container); | |
9739 | lhs = ada_coerce_ref (lhs); | |
9740 | if (!deprecated_value_modifiable (lhs)) | |
9741 | error (_("Left operand of assignment is not a modifiable lvalue.")); | |
9742 | ||
0e2da9f0 | 9743 | lhs_type = check_typedef (value_type (lhs)); |
52ce6436 PH |
9744 | if (ada_is_direct_array_type (lhs_type)) |
9745 | { | |
9746 | lhs = ada_coerce_to_simple_array (lhs); | |
0e2da9f0 | 9747 | lhs_type = check_typedef (value_type (lhs)); |
52ce6436 PH |
9748 | low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type); |
9749 | high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type); | |
52ce6436 | 9750 | } |
78134374 | 9751 | else if (lhs_type->code () == TYPE_CODE_STRUCT) |
52ce6436 PH |
9752 | { |
9753 | low_index = 0; | |
9754 | high_index = num_visible_fields (lhs_type) - 1; | |
52ce6436 PH |
9755 | } |
9756 | else | |
9757 | error (_("Left-hand side must be array or record.")); | |
9758 | ||
9759 | num_specs = num_component_specs (exp, *pos - 3); | |
9760 | max_indices = 4 * num_specs + 4; | |
8d749320 | 9761 | indices = XALLOCAVEC (LONGEST, max_indices); |
52ce6436 PH |
9762 | indices[0] = indices[1] = low_index - 1; |
9763 | indices[2] = indices[3] = high_index + 1; | |
9764 | num_indices = 4; | |
9765 | ||
9766 | for (i = 0; i < n; i += 1) | |
9767 | { | |
9768 | switch (exp->elts[*pos].opcode) | |
9769 | { | |
1fbf5ada JB |
9770 | case OP_CHOICES: |
9771 | aggregate_assign_from_choices (container, lhs, exp, pos, indices, | |
9772 | &num_indices, max_indices, | |
9773 | low_index, high_index); | |
9774 | break; | |
9775 | case OP_POSITIONAL: | |
9776 | aggregate_assign_positional (container, lhs, exp, pos, indices, | |
52ce6436 PH |
9777 | &num_indices, max_indices, |
9778 | low_index, high_index); | |
1fbf5ada JB |
9779 | break; |
9780 | case OP_OTHERS: | |
9781 | if (i != n-1) | |
9782 | error (_("Misplaced 'others' clause")); | |
9783 | aggregate_assign_others (container, lhs, exp, pos, indices, | |
9784 | num_indices, low_index, high_index); | |
9785 | break; | |
9786 | default: | |
9787 | error (_("Internal error: bad aggregate clause")); | |
52ce6436 PH |
9788 | } |
9789 | } | |
9790 | ||
9791 | return container; | |
9792 | } | |
9793 | ||
9794 | /* Assign into the component of LHS indexed by the OP_POSITIONAL | |
9795 | construct at *POS, updating *POS past the construct, given that | |
9796 | the positions are relative to lower bound LOW, where HIGH is the | |
9797 | upper bound. Record the position in INDICES[0 .. MAX_INDICES-1] | |
9798 | updating *NUM_INDICES as needed. CONTAINER is as for | |
0963b4bd | 9799 | assign_aggregate. */ |
52ce6436 PH |
9800 | static void |
9801 | aggregate_assign_positional (struct value *container, | |
9802 | struct value *lhs, struct expression *exp, | |
9803 | int *pos, LONGEST *indices, int *num_indices, | |
9804 | int max_indices, LONGEST low, LONGEST high) | |
9805 | { | |
9806 | LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low; | |
9807 | ||
9808 | if (ind - 1 == high) | |
e1d5a0d2 | 9809 | warning (_("Extra components in aggregate ignored.")); |
52ce6436 PH |
9810 | if (ind <= high) |
9811 | { | |
9812 | add_component_interval (ind, ind, indices, num_indices, max_indices); | |
9813 | *pos += 3; | |
9814 | assign_component (container, lhs, ind, exp, pos); | |
9815 | } | |
9816 | else | |
9817 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
9818 | } | |
9819 | ||
9820 | /* Assign into the components of LHS indexed by the OP_CHOICES | |
9821 | construct at *POS, updating *POS past the construct, given that | |
9822 | the allowable indices are LOW..HIGH. Record the indices assigned | |
9823 | to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as | |
0963b4bd | 9824 | needed. CONTAINER is as for assign_aggregate. */ |
52ce6436 PH |
9825 | static void |
9826 | aggregate_assign_from_choices (struct value *container, | |
9827 | struct value *lhs, struct expression *exp, | |
9828 | int *pos, LONGEST *indices, int *num_indices, | |
9829 | int max_indices, LONGEST low, LONGEST high) | |
9830 | { | |
9831 | int j; | |
9832 | int n_choices = longest_to_int (exp->elts[*pos+1].longconst); | |
9833 | int choice_pos, expr_pc; | |
9834 | int is_array = ada_is_direct_array_type (value_type (lhs)); | |
9835 | ||
9836 | choice_pos = *pos += 3; | |
9837 | ||
9838 | for (j = 0; j < n_choices; j += 1) | |
9839 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
9840 | expr_pc = *pos; | |
9841 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
9842 | ||
9843 | for (j = 0; j < n_choices; j += 1) | |
9844 | { | |
9845 | LONGEST lower, upper; | |
9846 | enum exp_opcode op = exp->elts[choice_pos].opcode; | |
5b4ee69b | 9847 | |
52ce6436 PH |
9848 | if (op == OP_DISCRETE_RANGE) |
9849 | { | |
9850 | choice_pos += 1; | |
9851 | lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos, | |
9852 | EVAL_NORMAL)); | |
9853 | upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos, | |
9854 | EVAL_NORMAL)); | |
9855 | } | |
9856 | else if (is_array) | |
9857 | { | |
9858 | lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos, | |
9859 | EVAL_NORMAL)); | |
9860 | upper = lower; | |
9861 | } | |
9862 | else | |
9863 | { | |
9864 | int ind; | |
0d5cff50 | 9865 | const char *name; |
5b4ee69b | 9866 | |
52ce6436 PH |
9867 | switch (op) |
9868 | { | |
9869 | case OP_NAME: | |
9870 | name = &exp->elts[choice_pos + 2].string; | |
9871 | break; | |
9872 | case OP_VAR_VALUE: | |
987012b8 | 9873 | name = exp->elts[choice_pos + 2].symbol->natural_name (); |
52ce6436 PH |
9874 | break; |
9875 | default: | |
9876 | error (_("Invalid record component association.")); | |
9877 | } | |
9878 | ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP); | |
9879 | ind = 0; | |
9880 | if (! find_struct_field (name, value_type (lhs), 0, | |
9881 | NULL, NULL, NULL, NULL, &ind)) | |
9882 | error (_("Unknown component name: %s."), name); | |
9883 | lower = upper = ind; | |
9884 | } | |
9885 | ||
9886 | if (lower <= upper && (lower < low || upper > high)) | |
9887 | error (_("Index in component association out of bounds.")); | |
9888 | ||
9889 | add_component_interval (lower, upper, indices, num_indices, | |
9890 | max_indices); | |
9891 | while (lower <= upper) | |
9892 | { | |
9893 | int pos1; | |
5b4ee69b | 9894 | |
52ce6436 PH |
9895 | pos1 = expr_pc; |
9896 | assign_component (container, lhs, lower, exp, &pos1); | |
9897 | lower += 1; | |
9898 | } | |
9899 | } | |
9900 | } | |
9901 | ||
9902 | /* Assign the value of the expression in the OP_OTHERS construct in | |
9903 | EXP at *POS into the components of LHS indexed from LOW .. HIGH that | |
9904 | have not been previously assigned. The index intervals already assigned | |
9905 | are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the | |
0963b4bd | 9906 | OP_OTHERS clause. CONTAINER is as for assign_aggregate. */ |
52ce6436 PH |
9907 | static void |
9908 | aggregate_assign_others (struct value *container, | |
9909 | struct value *lhs, struct expression *exp, | |
9910 | int *pos, LONGEST *indices, int num_indices, | |
9911 | LONGEST low, LONGEST high) | |
9912 | { | |
9913 | int i; | |
5ce64950 | 9914 | int expr_pc = *pos + 1; |
52ce6436 PH |
9915 | |
9916 | for (i = 0; i < num_indices - 2; i += 2) | |
9917 | { | |
9918 | LONGEST ind; | |
5b4ee69b | 9919 | |
52ce6436 PH |
9920 | for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1) |
9921 | { | |
5ce64950 | 9922 | int localpos; |
5b4ee69b | 9923 | |
5ce64950 MS |
9924 | localpos = expr_pc; |
9925 | assign_component (container, lhs, ind, exp, &localpos); | |
52ce6436 PH |
9926 | } |
9927 | } | |
9928 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
9929 | } | |
9930 | ||
9931 | /* Add the interval [LOW .. HIGH] to the sorted set of intervals | |
9932 | [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ], | |
9933 | modifying *SIZE as needed. It is an error if *SIZE exceeds | |
9934 | MAX_SIZE. The resulting intervals do not overlap. */ | |
9935 | static void | |
9936 | add_component_interval (LONGEST low, LONGEST high, | |
9937 | LONGEST* indices, int *size, int max_size) | |
9938 | { | |
9939 | int i, j; | |
5b4ee69b | 9940 | |
52ce6436 PH |
9941 | for (i = 0; i < *size; i += 2) { |
9942 | if (high >= indices[i] && low <= indices[i + 1]) | |
9943 | { | |
9944 | int kh; | |
5b4ee69b | 9945 | |
52ce6436 PH |
9946 | for (kh = i + 2; kh < *size; kh += 2) |
9947 | if (high < indices[kh]) | |
9948 | break; | |
9949 | if (low < indices[i]) | |
9950 | indices[i] = low; | |
9951 | indices[i + 1] = indices[kh - 1]; | |
9952 | if (high > indices[i + 1]) | |
9953 | indices[i + 1] = high; | |
9954 | memcpy (indices + i + 2, indices + kh, *size - kh); | |
9955 | *size -= kh - i - 2; | |
9956 | return; | |
9957 | } | |
9958 | else if (high < indices[i]) | |
9959 | break; | |
9960 | } | |
9961 | ||
9962 | if (*size == max_size) | |
9963 | error (_("Internal error: miscounted aggregate components.")); | |
9964 | *size += 2; | |
9965 | for (j = *size-1; j >= i+2; j -= 1) | |
9966 | indices[j] = indices[j - 2]; | |
9967 | indices[i] = low; | |
9968 | indices[i + 1] = high; | |
9969 | } | |
9970 | ||
6e48bd2c JB |
9971 | /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2 |
9972 | is different. */ | |
9973 | ||
9974 | static struct value * | |
b7e22850 | 9975 | ada_value_cast (struct type *type, struct value *arg2) |
6e48bd2c JB |
9976 | { |
9977 | if (type == ada_check_typedef (value_type (arg2))) | |
9978 | return arg2; | |
9979 | ||
b2188a06 | 9980 | if (ada_is_gnat_encoded_fixed_point_type (type)) |
95f39a5b | 9981 | return cast_to_fixed (type, arg2); |
6e48bd2c | 9982 | |
b2188a06 | 9983 | if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2))) |
a53b7a21 | 9984 | return cast_from_fixed (type, arg2); |
6e48bd2c JB |
9985 | |
9986 | return value_cast (type, arg2); | |
9987 | } | |
9988 | ||
284614f0 JB |
9989 | /* Evaluating Ada expressions, and printing their result. |
9990 | ------------------------------------------------------ | |
9991 | ||
21649b50 JB |
9992 | 1. Introduction: |
9993 | ---------------- | |
9994 | ||
284614f0 JB |
9995 | We usually evaluate an Ada expression in order to print its value. |
9996 | We also evaluate an expression in order to print its type, which | |
9997 | happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation, | |
9998 | but we'll focus mostly on the EVAL_NORMAL phase. In practice, the | |
9999 | EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of | |
10000 | the evaluation compared to the EVAL_NORMAL, but is otherwise very | |
10001 | similar. | |
10002 | ||
10003 | Evaluating expressions is a little more complicated for Ada entities | |
10004 | than it is for entities in languages such as C. The main reason for | |
10005 | this is that Ada provides types whose definition might be dynamic. | |
10006 | One example of such types is variant records. Or another example | |
10007 | would be an array whose bounds can only be known at run time. | |
10008 | ||
10009 | The following description is a general guide as to what should be | |
10010 | done (and what should NOT be done) in order to evaluate an expression | |
10011 | involving such types, and when. This does not cover how the semantic | |
10012 | information is encoded by GNAT as this is covered separatly. For the | |
10013 | document used as the reference for the GNAT encoding, see exp_dbug.ads | |
10014 | in the GNAT sources. | |
10015 | ||
10016 | Ideally, we should embed each part of this description next to its | |
10017 | associated code. Unfortunately, the amount of code is so vast right | |
10018 | now that it's hard to see whether the code handling a particular | |
10019 | situation might be duplicated or not. One day, when the code is | |
10020 | cleaned up, this guide might become redundant with the comments | |
10021 | inserted in the code, and we might want to remove it. | |
10022 | ||
21649b50 JB |
10023 | 2. ``Fixing'' an Entity, the Simple Case: |
10024 | ----------------------------------------- | |
10025 | ||
284614f0 JB |
10026 | When evaluating Ada expressions, the tricky issue is that they may |
10027 | reference entities whose type contents and size are not statically | |
10028 | known. Consider for instance a variant record: | |
10029 | ||
10030 | type Rec (Empty : Boolean := True) is record | |
10031 | case Empty is | |
10032 | when True => null; | |
10033 | when False => Value : Integer; | |
10034 | end case; | |
10035 | end record; | |
10036 | Yes : Rec := (Empty => False, Value => 1); | |
10037 | No : Rec := (empty => True); | |
10038 | ||
10039 | The size and contents of that record depends on the value of the | |
10040 | descriminant (Rec.Empty). At this point, neither the debugging | |
10041 | information nor the associated type structure in GDB are able to | |
10042 | express such dynamic types. So what the debugger does is to create | |
10043 | "fixed" versions of the type that applies to the specific object. | |
30baf67b | 10044 | We also informally refer to this operation as "fixing" an object, |
284614f0 JB |
10045 | which means creating its associated fixed type. |
10046 | ||
10047 | Example: when printing the value of variable "Yes" above, its fixed | |
10048 | type would look like this: | |
10049 | ||
10050 | type Rec is record | |
10051 | Empty : Boolean; | |
10052 | Value : Integer; | |
10053 | end record; | |
10054 | ||
10055 | On the other hand, if we printed the value of "No", its fixed type | |
10056 | would become: | |
10057 | ||
10058 | type Rec is record | |
10059 | Empty : Boolean; | |
10060 | end record; | |
10061 | ||
10062 | Things become a little more complicated when trying to fix an entity | |
10063 | with a dynamic type that directly contains another dynamic type, | |
10064 | such as an array of variant records, for instance. There are | |
10065 | two possible cases: Arrays, and records. | |
10066 | ||
21649b50 JB |
10067 | 3. ``Fixing'' Arrays: |
10068 | --------------------- | |
10069 | ||
10070 | The type structure in GDB describes an array in terms of its bounds, | |
10071 | and the type of its elements. By design, all elements in the array | |
10072 | have the same type and we cannot represent an array of variant elements | |
10073 | using the current type structure in GDB. When fixing an array, | |
10074 | we cannot fix the array element, as we would potentially need one | |
10075 | fixed type per element of the array. As a result, the best we can do | |
10076 | when fixing an array is to produce an array whose bounds and size | |
10077 | are correct (allowing us to read it from memory), but without having | |
10078 | touched its element type. Fixing each element will be done later, | |
10079 | when (if) necessary. | |
10080 | ||
10081 | Arrays are a little simpler to handle than records, because the same | |
10082 | amount of memory is allocated for each element of the array, even if | |
1b536f04 | 10083 | the amount of space actually used by each element differs from element |
21649b50 | 10084 | to element. Consider for instance the following array of type Rec: |
284614f0 JB |
10085 | |
10086 | type Rec_Array is array (1 .. 2) of Rec; | |
10087 | ||
1b536f04 JB |
10088 | The actual amount of memory occupied by each element might be different |
10089 | from element to element, depending on the value of their discriminant. | |
21649b50 | 10090 | But the amount of space reserved for each element in the array remains |
1b536f04 | 10091 | fixed regardless. So we simply need to compute that size using |
21649b50 JB |
10092 | the debugging information available, from which we can then determine |
10093 | the array size (we multiply the number of elements of the array by | |
10094 | the size of each element). | |
10095 | ||
10096 | The simplest case is when we have an array of a constrained element | |
10097 | type. For instance, consider the following type declarations: | |
10098 | ||
10099 | type Bounded_String (Max_Size : Integer) is | |
10100 | Length : Integer; | |
10101 | Buffer : String (1 .. Max_Size); | |
10102 | end record; | |
10103 | type Bounded_String_Array is array (1 ..2) of Bounded_String (80); | |
10104 | ||
10105 | In this case, the compiler describes the array as an array of | |
10106 | variable-size elements (identified by its XVS suffix) for which | |
10107 | the size can be read in the parallel XVZ variable. | |
10108 | ||
10109 | In the case of an array of an unconstrained element type, the compiler | |
10110 | wraps the array element inside a private PAD type. This type should not | |
10111 | be shown to the user, and must be "unwrap"'ed before printing. Note | |
284614f0 JB |
10112 | that we also use the adjective "aligner" in our code to designate |
10113 | these wrapper types. | |
10114 | ||
1b536f04 | 10115 | In some cases, the size allocated for each element is statically |
21649b50 JB |
10116 | known. In that case, the PAD type already has the correct size, |
10117 | and the array element should remain unfixed. | |
10118 | ||
10119 | But there are cases when this size is not statically known. | |
10120 | For instance, assuming that "Five" is an integer variable: | |
284614f0 JB |
10121 | |
10122 | type Dynamic is array (1 .. Five) of Integer; | |
10123 | type Wrapper (Has_Length : Boolean := False) is record | |
10124 | Data : Dynamic; | |
10125 | case Has_Length is | |
10126 | when True => Length : Integer; | |
10127 | when False => null; | |
10128 | end case; | |
10129 | end record; | |
10130 | type Wrapper_Array is array (1 .. 2) of Wrapper; | |
10131 | ||
10132 | Hello : Wrapper_Array := (others => (Has_Length => True, | |
10133 | Data => (others => 17), | |
10134 | Length => 1)); | |
10135 | ||
10136 | ||
10137 | The debugging info would describe variable Hello as being an | |
10138 | array of a PAD type. The size of that PAD type is not statically | |
10139 | known, but can be determined using a parallel XVZ variable. | |
10140 | In that case, a copy of the PAD type with the correct size should | |
10141 | be used for the fixed array. | |
10142 | ||
21649b50 JB |
10143 | 3. ``Fixing'' record type objects: |
10144 | ---------------------------------- | |
10145 | ||
10146 | Things are slightly different from arrays in the case of dynamic | |
284614f0 JB |
10147 | record types. In this case, in order to compute the associated |
10148 | fixed type, we need to determine the size and offset of each of | |
10149 | its components. This, in turn, requires us to compute the fixed | |
10150 | type of each of these components. | |
10151 | ||
10152 | Consider for instance the example: | |
10153 | ||
10154 | type Bounded_String (Max_Size : Natural) is record | |
10155 | Str : String (1 .. Max_Size); | |
10156 | Length : Natural; | |
10157 | end record; | |
10158 | My_String : Bounded_String (Max_Size => 10); | |
10159 | ||
10160 | In that case, the position of field "Length" depends on the size | |
10161 | of field Str, which itself depends on the value of the Max_Size | |
21649b50 | 10162 | discriminant. In order to fix the type of variable My_String, |
284614f0 JB |
10163 | we need to fix the type of field Str. Therefore, fixing a variant |
10164 | record requires us to fix each of its components. | |
10165 | ||
10166 | However, if a component does not have a dynamic size, the component | |
10167 | should not be fixed. In particular, fields that use a PAD type | |
10168 | should not fixed. Here is an example where this might happen | |
10169 | (assuming type Rec above): | |
10170 | ||
10171 | type Container (Big : Boolean) is record | |
10172 | First : Rec; | |
10173 | After : Integer; | |
10174 | case Big is | |
10175 | when True => Another : Integer; | |
10176 | when False => null; | |
10177 | end case; | |
10178 | end record; | |
10179 | My_Container : Container := (Big => False, | |
10180 | First => (Empty => True), | |
10181 | After => 42); | |
10182 | ||
10183 | In that example, the compiler creates a PAD type for component First, | |
10184 | whose size is constant, and then positions the component After just | |
10185 | right after it. The offset of component After is therefore constant | |
10186 | in this case. | |
10187 | ||
10188 | The debugger computes the position of each field based on an algorithm | |
10189 | that uses, among other things, the actual position and size of the field | |
21649b50 JB |
10190 | preceding it. Let's now imagine that the user is trying to print |
10191 | the value of My_Container. If the type fixing was recursive, we would | |
284614f0 JB |
10192 | end up computing the offset of field After based on the size of the |
10193 | fixed version of field First. And since in our example First has | |
10194 | only one actual field, the size of the fixed type is actually smaller | |
10195 | than the amount of space allocated to that field, and thus we would | |
10196 | compute the wrong offset of field After. | |
10197 | ||
21649b50 JB |
10198 | To make things more complicated, we need to watch out for dynamic |
10199 | components of variant records (identified by the ___XVL suffix in | |
10200 | the component name). Even if the target type is a PAD type, the size | |
10201 | of that type might not be statically known. So the PAD type needs | |
10202 | to be unwrapped and the resulting type needs to be fixed. Otherwise, | |
10203 | we might end up with the wrong size for our component. This can be | |
10204 | observed with the following type declarations: | |
284614f0 JB |
10205 | |
10206 | type Octal is new Integer range 0 .. 7; | |
10207 | type Octal_Array is array (Positive range <>) of Octal; | |
10208 | pragma Pack (Octal_Array); | |
10209 | ||
10210 | type Octal_Buffer (Size : Positive) is record | |
10211 | Buffer : Octal_Array (1 .. Size); | |
10212 | Length : Integer; | |
10213 | end record; | |
10214 | ||
10215 | In that case, Buffer is a PAD type whose size is unset and needs | |
10216 | to be computed by fixing the unwrapped type. | |
10217 | ||
21649b50 JB |
10218 | 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity: |
10219 | ---------------------------------------------------------- | |
10220 | ||
10221 | Lastly, when should the sub-elements of an entity that remained unfixed | |
284614f0 JB |
10222 | thus far, be actually fixed? |
10223 | ||
10224 | The answer is: Only when referencing that element. For instance | |
10225 | when selecting one component of a record, this specific component | |
10226 | should be fixed at that point in time. Or when printing the value | |
10227 | of a record, each component should be fixed before its value gets | |
10228 | printed. Similarly for arrays, the element of the array should be | |
10229 | fixed when printing each element of the array, or when extracting | |
10230 | one element out of that array. On the other hand, fixing should | |
10231 | not be performed on the elements when taking a slice of an array! | |
10232 | ||
31432a67 | 10233 | Note that one of the side effects of miscomputing the offset and |
284614f0 JB |
10234 | size of each field is that we end up also miscomputing the size |
10235 | of the containing type. This can have adverse results when computing | |
10236 | the value of an entity. GDB fetches the value of an entity based | |
10237 | on the size of its type, and thus a wrong size causes GDB to fetch | |
10238 | the wrong amount of memory. In the case where the computed size is | |
10239 | too small, GDB fetches too little data to print the value of our | |
31432a67 | 10240 | entity. Results in this case are unpredictable, as we usually read |
284614f0 JB |
10241 | past the buffer containing the data =:-o. */ |
10242 | ||
ced9779b JB |
10243 | /* Evaluate a subexpression of EXP, at index *POS, and return a value |
10244 | for that subexpression cast to TO_TYPE. Advance *POS over the | |
10245 | subexpression. */ | |
10246 | ||
10247 | static value * | |
10248 | ada_evaluate_subexp_for_cast (expression *exp, int *pos, | |
10249 | enum noside noside, struct type *to_type) | |
10250 | { | |
10251 | int pc = *pos; | |
10252 | ||
10253 | if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE | |
10254 | || exp->elts[pc].opcode == OP_VAR_VALUE) | |
10255 | { | |
10256 | (*pos) += 4; | |
10257 | ||
10258 | value *val; | |
10259 | if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE) | |
10260 | { | |
10261 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10262 | return value_zero (to_type, not_lval); | |
10263 | ||
10264 | val = evaluate_var_msym_value (noside, | |
10265 | exp->elts[pc + 1].objfile, | |
10266 | exp->elts[pc + 2].msymbol); | |
10267 | } | |
10268 | else | |
10269 | val = evaluate_var_value (noside, | |
10270 | exp->elts[pc + 1].block, | |
10271 | exp->elts[pc + 2].symbol); | |
10272 | ||
10273 | if (noside == EVAL_SKIP) | |
10274 | return eval_skip_value (exp); | |
10275 | ||
10276 | val = ada_value_cast (to_type, val); | |
10277 | ||
10278 | /* Follow the Ada language semantics that do not allow taking | |
10279 | an address of the result of a cast (view conversion in Ada). */ | |
10280 | if (VALUE_LVAL (val) == lval_memory) | |
10281 | { | |
10282 | if (value_lazy (val)) | |
10283 | value_fetch_lazy (val); | |
10284 | VALUE_LVAL (val) = not_lval; | |
10285 | } | |
10286 | return val; | |
10287 | } | |
10288 | ||
10289 | value *val = evaluate_subexp (to_type, exp, pos, noside); | |
10290 | if (noside == EVAL_SKIP) | |
10291 | return eval_skip_value (exp); | |
10292 | return ada_value_cast (to_type, val); | |
10293 | } | |
10294 | ||
284614f0 JB |
10295 | /* Implement the evaluate_exp routine in the exp_descriptor structure |
10296 | for the Ada language. */ | |
10297 | ||
52ce6436 | 10298 | static struct value * |
ebf56fd3 | 10299 | ada_evaluate_subexp (struct type *expect_type, struct expression *exp, |
4c4b4cd2 | 10300 | int *pos, enum noside noside) |
14f9c5c9 AS |
10301 | { |
10302 | enum exp_opcode op; | |
b5385fc0 | 10303 | int tem; |
14f9c5c9 | 10304 | int pc; |
5ec18f2b | 10305 | int preeval_pos; |
14f9c5c9 AS |
10306 | struct value *arg1 = NULL, *arg2 = NULL, *arg3; |
10307 | struct type *type; | |
52ce6436 | 10308 | int nargs, oplen; |
d2e4a39e | 10309 | struct value **argvec; |
14f9c5c9 | 10310 | |
d2e4a39e AS |
10311 | pc = *pos; |
10312 | *pos += 1; | |
14f9c5c9 AS |
10313 | op = exp->elts[pc].opcode; |
10314 | ||
d2e4a39e | 10315 | switch (op) |
14f9c5c9 AS |
10316 | { |
10317 | default: | |
10318 | *pos -= 1; | |
6e48bd2c | 10319 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); |
ca1f964d JG |
10320 | |
10321 | if (noside == EVAL_NORMAL) | |
10322 | arg1 = unwrap_value (arg1); | |
6e48bd2c | 10323 | |
edd079d9 | 10324 | /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided, |
6e48bd2c JB |
10325 | then we need to perform the conversion manually, because |
10326 | evaluate_subexp_standard doesn't do it. This conversion is | |
10327 | necessary in Ada because the different kinds of float/fixed | |
10328 | types in Ada have different representations. | |
10329 | ||
10330 | Similarly, we need to perform the conversion from OP_LONG | |
10331 | ourselves. */ | |
edd079d9 | 10332 | if ((op == OP_FLOAT || op == OP_LONG) && expect_type != NULL) |
b7e22850 | 10333 | arg1 = ada_value_cast (expect_type, arg1); |
6e48bd2c JB |
10334 | |
10335 | return arg1; | |
4c4b4cd2 PH |
10336 | |
10337 | case OP_STRING: | |
10338 | { | |
76a01679 | 10339 | struct value *result; |
5b4ee69b | 10340 | |
76a01679 JB |
10341 | *pos -= 1; |
10342 | result = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10343 | /* The result type will have code OP_STRING, bashed there from | |
10344 | OP_ARRAY. Bash it back. */ | |
78134374 | 10345 | if (value_type (result)->code () == TYPE_CODE_STRING) |
67607e24 | 10346 | value_type (result)->set_code (TYPE_CODE_ARRAY); |
76a01679 | 10347 | return result; |
4c4b4cd2 | 10348 | } |
14f9c5c9 AS |
10349 | |
10350 | case UNOP_CAST: | |
10351 | (*pos) += 2; | |
10352 | type = exp->elts[pc + 1].type; | |
ced9779b | 10353 | return ada_evaluate_subexp_for_cast (exp, pos, noside, type); |
14f9c5c9 | 10354 | |
4c4b4cd2 PH |
10355 | case UNOP_QUAL: |
10356 | (*pos) += 2; | |
10357 | type = exp->elts[pc + 1].type; | |
10358 | return ada_evaluate_subexp (type, exp, pos, noside); | |
10359 | ||
14f9c5c9 AS |
10360 | case BINOP_ASSIGN: |
10361 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
52ce6436 PH |
10362 | if (exp->elts[*pos].opcode == OP_AGGREGATE) |
10363 | { | |
10364 | arg1 = assign_aggregate (arg1, arg1, exp, pos, noside); | |
10365 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
10366 | return arg1; | |
10367 | return ada_value_assign (arg1, arg1); | |
10368 | } | |
003f3813 JB |
10369 | /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1, |
10370 | except if the lhs of our assignment is a convenience variable. | |
10371 | In the case of assigning to a convenience variable, the lhs | |
10372 | should be exactly the result of the evaluation of the rhs. */ | |
10373 | type = value_type (arg1); | |
10374 | if (VALUE_LVAL (arg1) == lval_internalvar) | |
10375 | type = NULL; | |
10376 | arg2 = evaluate_subexp (type, exp, pos, noside); | |
14f9c5c9 | 10377 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) |
4c4b4cd2 | 10378 | return arg1; |
f411722c TT |
10379 | if (VALUE_LVAL (arg1) == lval_internalvar) |
10380 | { | |
10381 | /* Nothing. */ | |
10382 | } | |
b2188a06 | 10383 | else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1))) |
df407dfe | 10384 | arg2 = cast_to_fixed (value_type (arg1), arg2); |
b2188a06 | 10385 | else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2))) |
76a01679 | 10386 | error |
323e0a4a | 10387 | (_("Fixed-point values must be assigned to fixed-point variables")); |
d2e4a39e | 10388 | else |
df407dfe | 10389 | arg2 = coerce_for_assign (value_type (arg1), arg2); |
4c4b4cd2 | 10390 | return ada_value_assign (arg1, arg2); |
14f9c5c9 AS |
10391 | |
10392 | case BINOP_ADD: | |
10393 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10394 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10395 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10396 | goto nosideret; |
78134374 | 10397 | if (value_type (arg1)->code () == TYPE_CODE_PTR) |
2ac8a782 JB |
10398 | return (value_from_longest |
10399 | (value_type (arg1), | |
10400 | value_as_long (arg1) + value_as_long (arg2))); | |
78134374 | 10401 | if (value_type (arg2)->code () == TYPE_CODE_PTR) |
c40cc657 JB |
10402 | return (value_from_longest |
10403 | (value_type (arg2), | |
10404 | value_as_long (arg1) + value_as_long (arg2))); | |
b2188a06 JB |
10405 | if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1)) |
10406 | || ada_is_gnat_encoded_fixed_point_type (value_type (arg2))) | |
df407dfe | 10407 | && value_type (arg1) != value_type (arg2)) |
323e0a4a | 10408 | error (_("Operands of fixed-point addition must have the same type")); |
b7789565 JB |
10409 | /* Do the addition, and cast the result to the type of the first |
10410 | argument. We cannot cast the result to a reference type, so if | |
10411 | ARG1 is a reference type, find its underlying type. */ | |
10412 | type = value_type (arg1); | |
78134374 | 10413 | while (type->code () == TYPE_CODE_REF) |
b7789565 | 10414 | type = TYPE_TARGET_TYPE (type); |
f44316fa | 10415 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
89eef114 | 10416 | return value_cast (type, value_binop (arg1, arg2, BINOP_ADD)); |
14f9c5c9 AS |
10417 | |
10418 | case BINOP_SUB: | |
10419 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10420 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10421 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10422 | goto nosideret; |
78134374 | 10423 | if (value_type (arg1)->code () == TYPE_CODE_PTR) |
2ac8a782 JB |
10424 | return (value_from_longest |
10425 | (value_type (arg1), | |
10426 | value_as_long (arg1) - value_as_long (arg2))); | |
78134374 | 10427 | if (value_type (arg2)->code () == TYPE_CODE_PTR) |
c40cc657 JB |
10428 | return (value_from_longest |
10429 | (value_type (arg2), | |
10430 | value_as_long (arg1) - value_as_long (arg2))); | |
b2188a06 JB |
10431 | if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1)) |
10432 | || ada_is_gnat_encoded_fixed_point_type (value_type (arg2))) | |
df407dfe | 10433 | && value_type (arg1) != value_type (arg2)) |
0963b4bd MS |
10434 | error (_("Operands of fixed-point subtraction " |
10435 | "must have the same type")); | |
b7789565 JB |
10436 | /* Do the substraction, and cast the result to the type of the first |
10437 | argument. We cannot cast the result to a reference type, so if | |
10438 | ARG1 is a reference type, find its underlying type. */ | |
10439 | type = value_type (arg1); | |
78134374 | 10440 | while (type->code () == TYPE_CODE_REF) |
b7789565 | 10441 | type = TYPE_TARGET_TYPE (type); |
f44316fa | 10442 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
89eef114 | 10443 | return value_cast (type, value_binop (arg1, arg2, BINOP_SUB)); |
14f9c5c9 AS |
10444 | |
10445 | case BINOP_MUL: | |
10446 | case BINOP_DIV: | |
e1578042 JB |
10447 | case BINOP_REM: |
10448 | case BINOP_MOD: | |
14f9c5c9 AS |
10449 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
10450 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10451 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10452 | goto nosideret; |
e1578042 | 10453 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
9c2be529 JB |
10454 | { |
10455 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
10456 | return value_zero (value_type (arg1), not_lval); | |
10457 | } | |
14f9c5c9 | 10458 | else |
4c4b4cd2 | 10459 | { |
a53b7a21 | 10460 | type = builtin_type (exp->gdbarch)->builtin_double; |
b2188a06 | 10461 | if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1))) |
a53b7a21 | 10462 | arg1 = cast_from_fixed (type, arg1); |
b2188a06 | 10463 | if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2))) |
a53b7a21 | 10464 | arg2 = cast_from_fixed (type, arg2); |
f44316fa | 10465 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
4c4b4cd2 PH |
10466 | return ada_value_binop (arg1, arg2, op); |
10467 | } | |
10468 | ||
4c4b4cd2 PH |
10469 | case BINOP_EQUAL: |
10470 | case BINOP_NOTEQUAL: | |
14f9c5c9 | 10471 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
df407dfe | 10472 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
14f9c5c9 | 10473 | if (noside == EVAL_SKIP) |
76a01679 | 10474 | goto nosideret; |
4c4b4cd2 | 10475 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 10476 | tem = 0; |
4c4b4cd2 | 10477 | else |
f44316fa UW |
10478 | { |
10479 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
10480 | tem = ada_value_equal (arg1, arg2); | |
10481 | } | |
4c4b4cd2 | 10482 | if (op == BINOP_NOTEQUAL) |
76a01679 | 10483 | tem = !tem; |
fbb06eb1 UW |
10484 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10485 | return value_from_longest (type, (LONGEST) tem); | |
4c4b4cd2 PH |
10486 | |
10487 | case UNOP_NEG: | |
10488 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10489 | if (noside == EVAL_SKIP) | |
10490 | goto nosideret; | |
b2188a06 | 10491 | else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1))) |
df407dfe | 10492 | return value_cast (value_type (arg1), value_neg (arg1)); |
14f9c5c9 | 10493 | else |
f44316fa UW |
10494 | { |
10495 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
10496 | return value_neg (arg1); | |
10497 | } | |
4c4b4cd2 | 10498 | |
2330c6c6 JB |
10499 | case BINOP_LOGICAL_AND: |
10500 | case BINOP_LOGICAL_OR: | |
10501 | case UNOP_LOGICAL_NOT: | |
000d5124 JB |
10502 | { |
10503 | struct value *val; | |
10504 | ||
10505 | *pos -= 1; | |
10506 | val = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
fbb06eb1 UW |
10507 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10508 | return value_cast (type, val); | |
000d5124 | 10509 | } |
2330c6c6 JB |
10510 | |
10511 | case BINOP_BITWISE_AND: | |
10512 | case BINOP_BITWISE_IOR: | |
10513 | case BINOP_BITWISE_XOR: | |
000d5124 JB |
10514 | { |
10515 | struct value *val; | |
10516 | ||
10517 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
10518 | *pos = pc; | |
10519 | val = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10520 | ||
10521 | return value_cast (value_type (arg1), val); | |
10522 | } | |
2330c6c6 | 10523 | |
14f9c5c9 AS |
10524 | case OP_VAR_VALUE: |
10525 | *pos -= 1; | |
6799def4 | 10526 | |
14f9c5c9 | 10527 | if (noside == EVAL_SKIP) |
4c4b4cd2 PH |
10528 | { |
10529 | *pos += 4; | |
10530 | goto nosideret; | |
10531 | } | |
da5c522f JB |
10532 | |
10533 | if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN) | |
76a01679 JB |
10534 | /* Only encountered when an unresolved symbol occurs in a |
10535 | context other than a function call, in which case, it is | |
52ce6436 | 10536 | invalid. */ |
323e0a4a | 10537 | error (_("Unexpected unresolved symbol, %s, during evaluation"), |
987012b8 | 10538 | exp->elts[pc + 2].symbol->print_name ()); |
da5c522f JB |
10539 | |
10540 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
4c4b4cd2 | 10541 | { |
0c1f74cf | 10542 | type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol)); |
31dbc1c5 JB |
10543 | /* Check to see if this is a tagged type. We also need to handle |
10544 | the case where the type is a reference to a tagged type, but | |
10545 | we have to be careful to exclude pointers to tagged types. | |
10546 | The latter should be shown as usual (as a pointer), whereas | |
10547 | a reference should mostly be transparent to the user. */ | |
10548 | if (ada_is_tagged_type (type, 0) | |
78134374 | 10549 | || (type->code () == TYPE_CODE_REF |
31dbc1c5 | 10550 | && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0))) |
0d72a7c3 JB |
10551 | { |
10552 | /* Tagged types are a little special in the fact that the real | |
10553 | type is dynamic and can only be determined by inspecting the | |
10554 | object's tag. This means that we need to get the object's | |
10555 | value first (EVAL_NORMAL) and then extract the actual object | |
10556 | type from its tag. | |
10557 | ||
10558 | Note that we cannot skip the final step where we extract | |
10559 | the object type from its tag, because the EVAL_NORMAL phase | |
10560 | results in dynamic components being resolved into fixed ones. | |
10561 | This can cause problems when trying to print the type | |
10562 | description of tagged types whose parent has a dynamic size: | |
10563 | We use the type name of the "_parent" component in order | |
10564 | to print the name of the ancestor type in the type description. | |
10565 | If that component had a dynamic size, the resolution into | |
10566 | a fixed type would result in the loss of that type name, | |
10567 | thus preventing us from printing the name of the ancestor | |
10568 | type in the type description. */ | |
10569 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL); | |
10570 | ||
78134374 | 10571 | if (type->code () != TYPE_CODE_REF) |
0d72a7c3 JB |
10572 | { |
10573 | struct type *actual_type; | |
10574 | ||
10575 | actual_type = type_from_tag (ada_value_tag (arg1)); | |
10576 | if (actual_type == NULL) | |
10577 | /* If, for some reason, we were unable to determine | |
10578 | the actual type from the tag, then use the static | |
10579 | approximation that we just computed as a fallback. | |
10580 | This can happen if the debugging information is | |
10581 | incomplete, for instance. */ | |
10582 | actual_type = type; | |
10583 | return value_zero (actual_type, not_lval); | |
10584 | } | |
10585 | else | |
10586 | { | |
10587 | /* In the case of a ref, ada_coerce_ref takes care | |
10588 | of determining the actual type. But the evaluation | |
10589 | should return a ref as it should be valid to ask | |
10590 | for its address; so rebuild a ref after coerce. */ | |
10591 | arg1 = ada_coerce_ref (arg1); | |
a65cfae5 | 10592 | return value_ref (arg1, TYPE_CODE_REF); |
0d72a7c3 JB |
10593 | } |
10594 | } | |
0c1f74cf | 10595 | |
84754697 JB |
10596 | /* Records and unions for which GNAT encodings have been |
10597 | generated need to be statically fixed as well. | |
10598 | Otherwise, non-static fixing produces a type where | |
10599 | all dynamic properties are removed, which prevents "ptype" | |
10600 | from being able to completely describe the type. | |
10601 | For instance, a case statement in a variant record would be | |
10602 | replaced by the relevant components based on the actual | |
10603 | value of the discriminants. */ | |
78134374 | 10604 | if ((type->code () == TYPE_CODE_STRUCT |
84754697 | 10605 | && dynamic_template_type (type) != NULL) |
78134374 | 10606 | || (type->code () == TYPE_CODE_UNION |
84754697 JB |
10607 | && ada_find_parallel_type (type, "___XVU") != NULL)) |
10608 | { | |
10609 | *pos += 4; | |
10610 | return value_zero (to_static_fixed_type (type), not_lval); | |
10611 | } | |
4c4b4cd2 | 10612 | } |
da5c522f JB |
10613 | |
10614 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10615 | return ada_to_fixed_value (arg1); | |
4c4b4cd2 PH |
10616 | |
10617 | case OP_FUNCALL: | |
10618 | (*pos) += 2; | |
10619 | ||
10620 | /* Allocate arg vector, including space for the function to be | |
10621 | called in argvec[0] and a terminating NULL. */ | |
10622 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
8d749320 | 10623 | argvec = XALLOCAVEC (struct value *, nargs + 2); |
4c4b4cd2 PH |
10624 | |
10625 | if (exp->elts[*pos].opcode == OP_VAR_VALUE | |
76a01679 | 10626 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
323e0a4a | 10627 | error (_("Unexpected unresolved symbol, %s, during evaluation"), |
987012b8 | 10628 | exp->elts[pc + 5].symbol->print_name ()); |
4c4b4cd2 PH |
10629 | else |
10630 | { | |
10631 | for (tem = 0; tem <= nargs; tem += 1) | |
10632 | argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10633 | argvec[tem] = 0; | |
10634 | ||
10635 | if (noside == EVAL_SKIP) | |
10636 | goto nosideret; | |
10637 | } | |
10638 | ||
ad82864c JB |
10639 | if (ada_is_constrained_packed_array_type |
10640 | (desc_base_type (value_type (argvec[0])))) | |
4c4b4cd2 | 10641 | argvec[0] = ada_coerce_to_simple_array (argvec[0]); |
78134374 | 10642 | else if (value_type (argvec[0])->code () == TYPE_CODE_ARRAY |
284614f0 JB |
10643 | && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0) |
10644 | /* This is a packed array that has already been fixed, and | |
10645 | therefore already coerced to a simple array. Nothing further | |
10646 | to do. */ | |
10647 | ; | |
78134374 | 10648 | else if (value_type (argvec[0])->code () == TYPE_CODE_REF) |
e6c2c623 PMR |
10649 | { |
10650 | /* Make sure we dereference references so that all the code below | |
10651 | feels like it's really handling the referenced value. Wrapping | |
10652 | types (for alignment) may be there, so make sure we strip them as | |
10653 | well. */ | |
10654 | argvec[0] = ada_to_fixed_value (coerce_ref (argvec[0])); | |
10655 | } | |
78134374 | 10656 | else if (value_type (argvec[0])->code () == TYPE_CODE_ARRAY |
e6c2c623 PMR |
10657 | && VALUE_LVAL (argvec[0]) == lval_memory) |
10658 | argvec[0] = value_addr (argvec[0]); | |
4c4b4cd2 | 10659 | |
df407dfe | 10660 | type = ada_check_typedef (value_type (argvec[0])); |
720d1a40 JB |
10661 | |
10662 | /* Ada allows us to implicitly dereference arrays when subscripting | |
8f465ea7 JB |
10663 | them. So, if this is an array typedef (encoding use for array |
10664 | access types encoded as fat pointers), strip it now. */ | |
78134374 | 10665 | if (type->code () == TYPE_CODE_TYPEDEF) |
720d1a40 JB |
10666 | type = ada_typedef_target_type (type); |
10667 | ||
78134374 | 10668 | if (type->code () == TYPE_CODE_PTR) |
4c4b4cd2 | 10669 | { |
78134374 | 10670 | switch (ada_check_typedef (TYPE_TARGET_TYPE (type))->code ()) |
4c4b4cd2 PH |
10671 | { |
10672 | case TYPE_CODE_FUNC: | |
61ee279c | 10673 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
4c4b4cd2 PH |
10674 | break; |
10675 | case TYPE_CODE_ARRAY: | |
10676 | break; | |
10677 | case TYPE_CODE_STRUCT: | |
10678 | if (noside != EVAL_AVOID_SIDE_EFFECTS) | |
10679 | argvec[0] = ada_value_ind (argvec[0]); | |
61ee279c | 10680 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
4c4b4cd2 PH |
10681 | break; |
10682 | default: | |
323e0a4a | 10683 | error (_("cannot subscript or call something of type `%s'"), |
df407dfe | 10684 | ada_type_name (value_type (argvec[0]))); |
4c4b4cd2 PH |
10685 | break; |
10686 | } | |
10687 | } | |
10688 | ||
78134374 | 10689 | switch (type->code ()) |
4c4b4cd2 PH |
10690 | { |
10691 | case TYPE_CODE_FUNC: | |
10692 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
c8ea1972 | 10693 | { |
7022349d PA |
10694 | if (TYPE_TARGET_TYPE (type) == NULL) |
10695 | error_call_unknown_return_type (NULL); | |
10696 | return allocate_value (TYPE_TARGET_TYPE (type)); | |
c8ea1972 | 10697 | } |
e71585ff PA |
10698 | return call_function_by_hand (argvec[0], NULL, |
10699 | gdb::make_array_view (argvec + 1, | |
10700 | nargs)); | |
c8ea1972 PH |
10701 | case TYPE_CODE_INTERNAL_FUNCTION: |
10702 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10703 | /* We don't know anything about what the internal | |
10704 | function might return, but we have to return | |
10705 | something. */ | |
10706 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
10707 | not_lval); | |
10708 | else | |
10709 | return call_internal_function (exp->gdbarch, exp->language_defn, | |
10710 | argvec[0], nargs, argvec + 1); | |
10711 | ||
4c4b4cd2 PH |
10712 | case TYPE_CODE_STRUCT: |
10713 | { | |
10714 | int arity; | |
10715 | ||
4c4b4cd2 PH |
10716 | arity = ada_array_arity (type); |
10717 | type = ada_array_element_type (type, nargs); | |
10718 | if (type == NULL) | |
323e0a4a | 10719 | error (_("cannot subscript or call a record")); |
4c4b4cd2 | 10720 | if (arity != nargs) |
323e0a4a | 10721 | error (_("wrong number of subscripts; expecting %d"), arity); |
4c4b4cd2 | 10722 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
0a07e705 | 10723 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10724 | return |
10725 | unwrap_value (ada_value_subscript | |
10726 | (argvec[0], nargs, argvec + 1)); | |
10727 | } | |
10728 | case TYPE_CODE_ARRAY: | |
10729 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10730 | { | |
10731 | type = ada_array_element_type (type, nargs); | |
10732 | if (type == NULL) | |
323e0a4a | 10733 | error (_("element type of array unknown")); |
4c4b4cd2 | 10734 | else |
0a07e705 | 10735 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10736 | } |
10737 | return | |
10738 | unwrap_value (ada_value_subscript | |
10739 | (ada_coerce_to_simple_array (argvec[0]), | |
10740 | nargs, argvec + 1)); | |
10741 | case TYPE_CODE_PTR: /* Pointer to array */ | |
4c4b4cd2 PH |
10742 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
10743 | { | |
deede10c | 10744 | type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1); |
4c4b4cd2 PH |
10745 | type = ada_array_element_type (type, nargs); |
10746 | if (type == NULL) | |
323e0a4a | 10747 | error (_("element type of array unknown")); |
4c4b4cd2 | 10748 | else |
0a07e705 | 10749 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
10750 | } |
10751 | return | |
deede10c JB |
10752 | unwrap_value (ada_value_ptr_subscript (argvec[0], |
10753 | nargs, argvec + 1)); | |
4c4b4cd2 PH |
10754 | |
10755 | default: | |
e1d5a0d2 PH |
10756 | error (_("Attempt to index or call something other than an " |
10757 | "array or function")); | |
4c4b4cd2 PH |
10758 | } |
10759 | ||
10760 | case TERNOP_SLICE: | |
10761 | { | |
10762 | struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10763 | struct value *low_bound_val = | |
10764 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
714e53ab PH |
10765 | struct value *high_bound_val = |
10766 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10767 | LONGEST low_bound; | |
10768 | LONGEST high_bound; | |
5b4ee69b | 10769 | |
994b9211 AC |
10770 | low_bound_val = coerce_ref (low_bound_val); |
10771 | high_bound_val = coerce_ref (high_bound_val); | |
aa715135 JG |
10772 | low_bound = value_as_long (low_bound_val); |
10773 | high_bound = value_as_long (high_bound_val); | |
963a6417 | 10774 | |
4c4b4cd2 PH |
10775 | if (noside == EVAL_SKIP) |
10776 | goto nosideret; | |
10777 | ||
4c4b4cd2 PH |
10778 | /* If this is a reference to an aligner type, then remove all |
10779 | the aligners. */ | |
78134374 | 10780 | if (value_type (array)->code () == TYPE_CODE_REF |
df407dfe AC |
10781 | && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array)))) |
10782 | TYPE_TARGET_TYPE (value_type (array)) = | |
10783 | ada_aligned_type (TYPE_TARGET_TYPE (value_type (array))); | |
4c4b4cd2 | 10784 | |
ad82864c | 10785 | if (ada_is_constrained_packed_array_type (value_type (array))) |
323e0a4a | 10786 | error (_("cannot slice a packed array")); |
4c4b4cd2 PH |
10787 | |
10788 | /* If this is a reference to an array or an array lvalue, | |
10789 | convert to a pointer. */ | |
78134374 SM |
10790 | if (value_type (array)->code () == TYPE_CODE_REF |
10791 | || (value_type (array)->code () == TYPE_CODE_ARRAY | |
4c4b4cd2 PH |
10792 | && VALUE_LVAL (array) == lval_memory)) |
10793 | array = value_addr (array); | |
10794 | ||
1265e4aa | 10795 | if (noside == EVAL_AVOID_SIDE_EFFECTS |
61ee279c | 10796 | && ada_is_array_descriptor_type (ada_check_typedef |
df407dfe | 10797 | (value_type (array)))) |
bff8c71f TT |
10798 | return empty_array (ada_type_of_array (array, 0), low_bound, |
10799 | high_bound); | |
4c4b4cd2 PH |
10800 | |
10801 | array = ada_coerce_to_simple_array_ptr (array); | |
10802 | ||
714e53ab PH |
10803 | /* If we have more than one level of pointer indirection, |
10804 | dereference the value until we get only one level. */ | |
78134374 SM |
10805 | while (value_type (array)->code () == TYPE_CODE_PTR |
10806 | && (TYPE_TARGET_TYPE (value_type (array))->code () | |
714e53ab PH |
10807 | == TYPE_CODE_PTR)) |
10808 | array = value_ind (array); | |
10809 | ||
10810 | /* Make sure we really do have an array type before going further, | |
10811 | to avoid a SEGV when trying to get the index type or the target | |
10812 | type later down the road if the debug info generated by | |
10813 | the compiler is incorrect or incomplete. */ | |
df407dfe | 10814 | if (!ada_is_simple_array_type (value_type (array))) |
323e0a4a | 10815 | error (_("cannot take slice of non-array")); |
714e53ab | 10816 | |
78134374 | 10817 | if (ada_check_typedef (value_type (array))->code () |
828292f2 | 10818 | == TYPE_CODE_PTR) |
4c4b4cd2 | 10819 | { |
828292f2 JB |
10820 | struct type *type0 = ada_check_typedef (value_type (array)); |
10821 | ||
0b5d8877 | 10822 | if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS) |
bff8c71f | 10823 | return empty_array (TYPE_TARGET_TYPE (type0), low_bound, high_bound); |
4c4b4cd2 PH |
10824 | else |
10825 | { | |
10826 | struct type *arr_type0 = | |
828292f2 | 10827 | to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1); |
5b4ee69b | 10828 | |
f5938064 JG |
10829 | return ada_value_slice_from_ptr (array, arr_type0, |
10830 | longest_to_int (low_bound), | |
10831 | longest_to_int (high_bound)); | |
4c4b4cd2 PH |
10832 | } |
10833 | } | |
10834 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10835 | return array; | |
10836 | else if (high_bound < low_bound) | |
bff8c71f | 10837 | return empty_array (value_type (array), low_bound, high_bound); |
4c4b4cd2 | 10838 | else |
529cad9c PH |
10839 | return ada_value_slice (array, longest_to_int (low_bound), |
10840 | longest_to_int (high_bound)); | |
4c4b4cd2 | 10841 | } |
14f9c5c9 | 10842 | |
4c4b4cd2 PH |
10843 | case UNOP_IN_RANGE: |
10844 | (*pos) += 2; | |
10845 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
8008e265 | 10846 | type = check_typedef (exp->elts[pc + 1].type); |
14f9c5c9 | 10847 | |
14f9c5c9 | 10848 | if (noside == EVAL_SKIP) |
4c4b4cd2 | 10849 | goto nosideret; |
14f9c5c9 | 10850 | |
78134374 | 10851 | switch (type->code ()) |
4c4b4cd2 PH |
10852 | { |
10853 | default: | |
e1d5a0d2 PH |
10854 | lim_warning (_("Membership test incompletely implemented; " |
10855 | "always returns true")); | |
fbb06eb1 UW |
10856 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10857 | return value_from_longest (type, (LONGEST) 1); | |
4c4b4cd2 PH |
10858 | |
10859 | case TYPE_CODE_RANGE: | |
030b4912 UW |
10860 | arg2 = value_from_longest (type, TYPE_LOW_BOUND (type)); |
10861 | arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type)); | |
f44316fa UW |
10862 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
10863 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 UW |
10864 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10865 | return | |
10866 | value_from_longest (type, | |
4c4b4cd2 PH |
10867 | (value_less (arg1, arg3) |
10868 | || value_equal (arg1, arg3)) | |
10869 | && (value_less (arg2, arg1) | |
10870 | || value_equal (arg2, arg1))); | |
10871 | } | |
10872 | ||
10873 | case BINOP_IN_BOUNDS: | |
14f9c5c9 | 10874 | (*pos) += 2; |
4c4b4cd2 PH |
10875 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
10876 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
14f9c5c9 | 10877 | |
4c4b4cd2 PH |
10878 | if (noside == EVAL_SKIP) |
10879 | goto nosideret; | |
14f9c5c9 | 10880 | |
4c4b4cd2 | 10881 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
fbb06eb1 UW |
10882 | { |
10883 | type = language_bool_type (exp->language_defn, exp->gdbarch); | |
10884 | return value_zero (type, not_lval); | |
10885 | } | |
14f9c5c9 | 10886 | |
4c4b4cd2 | 10887 | tem = longest_to_int (exp->elts[pc + 1].longconst); |
14f9c5c9 | 10888 | |
1eea4ebd UW |
10889 | type = ada_index_type (value_type (arg2), tem, "range"); |
10890 | if (!type) | |
10891 | type = value_type (arg1); | |
14f9c5c9 | 10892 | |
1eea4ebd UW |
10893 | arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1)); |
10894 | arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0)); | |
d2e4a39e | 10895 | |
f44316fa UW |
10896 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
10897 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 | 10898 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
4c4b4cd2 | 10899 | return |
fbb06eb1 | 10900 | value_from_longest (type, |
4c4b4cd2 PH |
10901 | (value_less (arg1, arg3) |
10902 | || value_equal (arg1, arg3)) | |
10903 | && (value_less (arg2, arg1) | |
10904 | || value_equal (arg2, arg1))); | |
10905 | ||
10906 | case TERNOP_IN_RANGE: | |
10907 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10908 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10909 | arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10910 | ||
10911 | if (noside == EVAL_SKIP) | |
10912 | goto nosideret; | |
10913 | ||
f44316fa UW |
10914 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
10915 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 | 10916 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
4c4b4cd2 | 10917 | return |
fbb06eb1 | 10918 | value_from_longest (type, |
4c4b4cd2 PH |
10919 | (value_less (arg1, arg3) |
10920 | || value_equal (arg1, arg3)) | |
10921 | && (value_less (arg2, arg1) | |
10922 | || value_equal (arg2, arg1))); | |
10923 | ||
10924 | case OP_ATR_FIRST: | |
10925 | case OP_ATR_LAST: | |
10926 | case OP_ATR_LENGTH: | |
10927 | { | |
76a01679 | 10928 | struct type *type_arg; |
5b4ee69b | 10929 | |
76a01679 JB |
10930 | if (exp->elts[*pos].opcode == OP_TYPE) |
10931 | { | |
10932 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
10933 | arg1 = NULL; | |
5bc23cb3 | 10934 | type_arg = check_typedef (exp->elts[pc + 2].type); |
76a01679 JB |
10935 | } |
10936 | else | |
10937 | { | |
10938 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10939 | type_arg = NULL; | |
10940 | } | |
10941 | ||
10942 | if (exp->elts[*pos].opcode != OP_LONG) | |
323e0a4a | 10943 | error (_("Invalid operand to '%s"), ada_attribute_name (op)); |
76a01679 JB |
10944 | tem = longest_to_int (exp->elts[*pos + 2].longconst); |
10945 | *pos += 4; | |
10946 | ||
10947 | if (noside == EVAL_SKIP) | |
10948 | goto nosideret; | |
680e1bee TT |
10949 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
10950 | { | |
10951 | if (type_arg == NULL) | |
10952 | type_arg = value_type (arg1); | |
76a01679 | 10953 | |
680e1bee TT |
10954 | if (ada_is_constrained_packed_array_type (type_arg)) |
10955 | type_arg = decode_constrained_packed_array_type (type_arg); | |
10956 | ||
10957 | if (!discrete_type_p (type_arg)) | |
10958 | { | |
10959 | switch (op) | |
10960 | { | |
10961 | default: /* Should never happen. */ | |
10962 | error (_("unexpected attribute encountered")); | |
10963 | case OP_ATR_FIRST: | |
10964 | case OP_ATR_LAST: | |
10965 | type_arg = ada_index_type (type_arg, tem, | |
10966 | ada_attribute_name (op)); | |
10967 | break; | |
10968 | case OP_ATR_LENGTH: | |
10969 | type_arg = builtin_type (exp->gdbarch)->builtin_int; | |
10970 | break; | |
10971 | } | |
10972 | } | |
10973 | ||
10974 | return value_zero (type_arg, not_lval); | |
10975 | } | |
10976 | else if (type_arg == NULL) | |
76a01679 JB |
10977 | { |
10978 | arg1 = ada_coerce_ref (arg1); | |
10979 | ||
ad82864c | 10980 | if (ada_is_constrained_packed_array_type (value_type (arg1))) |
76a01679 JB |
10981 | arg1 = ada_coerce_to_simple_array (arg1); |
10982 | ||
aa4fb036 | 10983 | if (op == OP_ATR_LENGTH) |
1eea4ebd | 10984 | type = builtin_type (exp->gdbarch)->builtin_int; |
aa4fb036 JB |
10985 | else |
10986 | { | |
10987 | type = ada_index_type (value_type (arg1), tem, | |
10988 | ada_attribute_name (op)); | |
10989 | if (type == NULL) | |
10990 | type = builtin_type (exp->gdbarch)->builtin_int; | |
10991 | } | |
76a01679 | 10992 | |
76a01679 JB |
10993 | switch (op) |
10994 | { | |
10995 | default: /* Should never happen. */ | |
323e0a4a | 10996 | error (_("unexpected attribute encountered")); |
76a01679 | 10997 | case OP_ATR_FIRST: |
1eea4ebd UW |
10998 | return value_from_longest |
10999 | (type, ada_array_bound (arg1, tem, 0)); | |
76a01679 | 11000 | case OP_ATR_LAST: |
1eea4ebd UW |
11001 | return value_from_longest |
11002 | (type, ada_array_bound (arg1, tem, 1)); | |
76a01679 | 11003 | case OP_ATR_LENGTH: |
1eea4ebd UW |
11004 | return value_from_longest |
11005 | (type, ada_array_length (arg1, tem)); | |
76a01679 JB |
11006 | } |
11007 | } | |
11008 | else if (discrete_type_p (type_arg)) | |
11009 | { | |
11010 | struct type *range_type; | |
0d5cff50 | 11011 | const char *name = ada_type_name (type_arg); |
5b4ee69b | 11012 | |
76a01679 | 11013 | range_type = NULL; |
78134374 | 11014 | if (name != NULL && type_arg->code () != TYPE_CODE_ENUM) |
28c85d6c | 11015 | range_type = to_fixed_range_type (type_arg, NULL); |
76a01679 JB |
11016 | if (range_type == NULL) |
11017 | range_type = type_arg; | |
11018 | switch (op) | |
11019 | { | |
11020 | default: | |
323e0a4a | 11021 | error (_("unexpected attribute encountered")); |
76a01679 | 11022 | case OP_ATR_FIRST: |
690cc4eb | 11023 | return value_from_longest |
43bbcdc2 | 11024 | (range_type, ada_discrete_type_low_bound (range_type)); |
76a01679 | 11025 | case OP_ATR_LAST: |
690cc4eb | 11026 | return value_from_longest |
43bbcdc2 | 11027 | (range_type, ada_discrete_type_high_bound (range_type)); |
76a01679 | 11028 | case OP_ATR_LENGTH: |
323e0a4a | 11029 | error (_("the 'length attribute applies only to array types")); |
76a01679 JB |
11030 | } |
11031 | } | |
78134374 | 11032 | else if (type_arg->code () == TYPE_CODE_FLT) |
323e0a4a | 11033 | error (_("unimplemented type attribute")); |
76a01679 JB |
11034 | else |
11035 | { | |
11036 | LONGEST low, high; | |
11037 | ||
ad82864c JB |
11038 | if (ada_is_constrained_packed_array_type (type_arg)) |
11039 | type_arg = decode_constrained_packed_array_type (type_arg); | |
76a01679 | 11040 | |
aa4fb036 | 11041 | if (op == OP_ATR_LENGTH) |
1eea4ebd | 11042 | type = builtin_type (exp->gdbarch)->builtin_int; |
aa4fb036 JB |
11043 | else |
11044 | { | |
11045 | type = ada_index_type (type_arg, tem, ada_attribute_name (op)); | |
11046 | if (type == NULL) | |
11047 | type = builtin_type (exp->gdbarch)->builtin_int; | |
11048 | } | |
1eea4ebd | 11049 | |
76a01679 JB |
11050 | switch (op) |
11051 | { | |
11052 | default: | |
323e0a4a | 11053 | error (_("unexpected attribute encountered")); |
76a01679 | 11054 | case OP_ATR_FIRST: |
1eea4ebd | 11055 | low = ada_array_bound_from_type (type_arg, tem, 0); |
76a01679 JB |
11056 | return value_from_longest (type, low); |
11057 | case OP_ATR_LAST: | |
1eea4ebd | 11058 | high = ada_array_bound_from_type (type_arg, tem, 1); |
76a01679 JB |
11059 | return value_from_longest (type, high); |
11060 | case OP_ATR_LENGTH: | |
1eea4ebd UW |
11061 | low = ada_array_bound_from_type (type_arg, tem, 0); |
11062 | high = ada_array_bound_from_type (type_arg, tem, 1); | |
76a01679 JB |
11063 | return value_from_longest (type, high - low + 1); |
11064 | } | |
11065 | } | |
14f9c5c9 AS |
11066 | } |
11067 | ||
4c4b4cd2 PH |
11068 | case OP_ATR_TAG: |
11069 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11070 | if (noside == EVAL_SKIP) | |
76a01679 | 11071 | goto nosideret; |
4c4b4cd2 PH |
11072 | |
11073 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
76a01679 | 11074 | return value_zero (ada_tag_type (arg1), not_lval); |
4c4b4cd2 PH |
11075 | |
11076 | return ada_value_tag (arg1); | |
11077 | ||
11078 | case OP_ATR_MIN: | |
11079 | case OP_ATR_MAX: | |
11080 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 AS |
11081 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11082 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11083 | if (noside == EVAL_SKIP) | |
76a01679 | 11084 | goto nosideret; |
d2e4a39e | 11085 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
df407dfe | 11086 | return value_zero (value_type (arg1), not_lval); |
14f9c5c9 | 11087 | else |
f44316fa UW |
11088 | { |
11089 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
11090 | return value_binop (arg1, arg2, | |
11091 | op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX); | |
11092 | } | |
14f9c5c9 | 11093 | |
4c4b4cd2 PH |
11094 | case OP_ATR_MODULUS: |
11095 | { | |
31dedfee | 11096 | struct type *type_arg = check_typedef (exp->elts[pc + 2].type); |
4c4b4cd2 | 11097 | |
5b4ee69b | 11098 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); |
76a01679 JB |
11099 | if (noside == EVAL_SKIP) |
11100 | goto nosideret; | |
4c4b4cd2 | 11101 | |
76a01679 | 11102 | if (!ada_is_modular_type (type_arg)) |
323e0a4a | 11103 | error (_("'modulus must be applied to modular type")); |
4c4b4cd2 | 11104 | |
76a01679 JB |
11105 | return value_from_longest (TYPE_TARGET_TYPE (type_arg), |
11106 | ada_modulus (type_arg)); | |
4c4b4cd2 PH |
11107 | } |
11108 | ||
11109 | ||
11110 | case OP_ATR_POS: | |
11111 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 AS |
11112 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11113 | if (noside == EVAL_SKIP) | |
76a01679 | 11114 | goto nosideret; |
3cb382c9 UW |
11115 | type = builtin_type (exp->gdbarch)->builtin_int; |
11116 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
11117 | return value_zero (type, not_lval); | |
14f9c5c9 | 11118 | else |
3cb382c9 | 11119 | return value_pos_atr (type, arg1); |
14f9c5c9 | 11120 | |
4c4b4cd2 PH |
11121 | case OP_ATR_SIZE: |
11122 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
8c1c099f JB |
11123 | type = value_type (arg1); |
11124 | ||
11125 | /* If the argument is a reference, then dereference its type, since | |
11126 | the user is really asking for the size of the actual object, | |
11127 | not the size of the pointer. */ | |
78134374 | 11128 | if (type->code () == TYPE_CODE_REF) |
8c1c099f JB |
11129 | type = TYPE_TARGET_TYPE (type); |
11130 | ||
4c4b4cd2 | 11131 | if (noside == EVAL_SKIP) |
76a01679 | 11132 | goto nosideret; |
4c4b4cd2 | 11133 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
22601c15 | 11134 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval); |
4c4b4cd2 | 11135 | else |
22601c15 | 11136 | return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, |
8c1c099f | 11137 | TARGET_CHAR_BIT * TYPE_LENGTH (type)); |
4c4b4cd2 PH |
11138 | |
11139 | case OP_ATR_VAL: | |
11140 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 | 11141 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
4c4b4cd2 | 11142 | type = exp->elts[pc + 2].type; |
14f9c5c9 | 11143 | if (noside == EVAL_SKIP) |
76a01679 | 11144 | goto nosideret; |
4c4b4cd2 | 11145 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 11146 | return value_zero (type, not_lval); |
4c4b4cd2 | 11147 | else |
76a01679 | 11148 | return value_val_atr (type, arg1); |
4c4b4cd2 PH |
11149 | |
11150 | case BINOP_EXP: | |
11151 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11152 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11153 | if (noside == EVAL_SKIP) | |
11154 | goto nosideret; | |
11155 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
df407dfe | 11156 | return value_zero (value_type (arg1), not_lval); |
4c4b4cd2 | 11157 | else |
f44316fa UW |
11158 | { |
11159 | /* For integer exponentiation operations, | |
11160 | only promote the first argument. */ | |
11161 | if (is_integral_type (value_type (arg2))) | |
11162 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
11163 | else | |
11164 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
11165 | ||
11166 | return value_binop (arg1, arg2, op); | |
11167 | } | |
4c4b4cd2 PH |
11168 | |
11169 | case UNOP_PLUS: | |
11170 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11171 | if (noside == EVAL_SKIP) | |
11172 | goto nosideret; | |
11173 | else | |
11174 | return arg1; | |
11175 | ||
11176 | case UNOP_ABS: | |
11177 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11178 | if (noside == EVAL_SKIP) | |
11179 | goto nosideret; | |
f44316fa | 11180 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); |
df407dfe | 11181 | if (value_less (arg1, value_zero (value_type (arg1), not_lval))) |
4c4b4cd2 | 11182 | return value_neg (arg1); |
14f9c5c9 | 11183 | else |
4c4b4cd2 | 11184 | return arg1; |
14f9c5c9 AS |
11185 | |
11186 | case UNOP_IND: | |
5ec18f2b | 11187 | preeval_pos = *pos; |
6b0d7253 | 11188 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
14f9c5c9 | 11189 | if (noside == EVAL_SKIP) |
4c4b4cd2 | 11190 | goto nosideret; |
df407dfe | 11191 | type = ada_check_typedef (value_type (arg1)); |
14f9c5c9 | 11192 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
4c4b4cd2 PH |
11193 | { |
11194 | if (ada_is_array_descriptor_type (type)) | |
11195 | /* GDB allows dereferencing GNAT array descriptors. */ | |
11196 | { | |
11197 | struct type *arrType = ada_type_of_array (arg1, 0); | |
5b4ee69b | 11198 | |
4c4b4cd2 | 11199 | if (arrType == NULL) |
323e0a4a | 11200 | error (_("Attempt to dereference null array pointer.")); |
00a4c844 | 11201 | return value_at_lazy (arrType, 0); |
4c4b4cd2 | 11202 | } |
78134374 SM |
11203 | else if (type->code () == TYPE_CODE_PTR |
11204 | || type->code () == TYPE_CODE_REF | |
4c4b4cd2 | 11205 | /* In C you can dereference an array to get the 1st elt. */ |
78134374 | 11206 | || type->code () == TYPE_CODE_ARRAY) |
714e53ab | 11207 | { |
5ec18f2b JG |
11208 | /* As mentioned in the OP_VAR_VALUE case, tagged types can |
11209 | only be determined by inspecting the object's tag. | |
11210 | This means that we need to evaluate completely the | |
11211 | expression in order to get its type. */ | |
11212 | ||
78134374 SM |
11213 | if ((type->code () == TYPE_CODE_REF |
11214 | || type->code () == TYPE_CODE_PTR) | |
5ec18f2b JG |
11215 | && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)) |
11216 | { | |
11217 | arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos, | |
11218 | EVAL_NORMAL); | |
11219 | type = value_type (ada_value_ind (arg1)); | |
11220 | } | |
11221 | else | |
11222 | { | |
11223 | type = to_static_fixed_type | |
11224 | (ada_aligned_type | |
11225 | (ada_check_typedef (TYPE_TARGET_TYPE (type)))); | |
11226 | } | |
c1b5a1a6 | 11227 | ada_ensure_varsize_limit (type); |
714e53ab PH |
11228 | return value_zero (type, lval_memory); |
11229 | } | |
78134374 | 11230 | else if (type->code () == TYPE_CODE_INT) |
6b0d7253 JB |
11231 | { |
11232 | /* GDB allows dereferencing an int. */ | |
11233 | if (expect_type == NULL) | |
11234 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
11235 | lval_memory); | |
11236 | else | |
11237 | { | |
11238 | expect_type = | |
11239 | to_static_fixed_type (ada_aligned_type (expect_type)); | |
11240 | return value_zero (expect_type, lval_memory); | |
11241 | } | |
11242 | } | |
4c4b4cd2 | 11243 | else |
323e0a4a | 11244 | error (_("Attempt to take contents of a non-pointer value.")); |
4c4b4cd2 | 11245 | } |
0963b4bd | 11246 | arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */ |
df407dfe | 11247 | type = ada_check_typedef (value_type (arg1)); |
d2e4a39e | 11248 | |
78134374 | 11249 | if (type->code () == TYPE_CODE_INT) |
96967637 JB |
11250 | /* GDB allows dereferencing an int. If we were given |
11251 | the expect_type, then use that as the target type. | |
11252 | Otherwise, assume that the target type is an int. */ | |
11253 | { | |
11254 | if (expect_type != NULL) | |
11255 | return ada_value_ind (value_cast (lookup_pointer_type (expect_type), | |
11256 | arg1)); | |
11257 | else | |
11258 | return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int, | |
11259 | (CORE_ADDR) value_as_address (arg1)); | |
11260 | } | |
6b0d7253 | 11261 | |
4c4b4cd2 PH |
11262 | if (ada_is_array_descriptor_type (type)) |
11263 | /* GDB allows dereferencing GNAT array descriptors. */ | |
11264 | return ada_coerce_to_simple_array (arg1); | |
14f9c5c9 | 11265 | else |
4c4b4cd2 | 11266 | return ada_value_ind (arg1); |
14f9c5c9 AS |
11267 | |
11268 | case STRUCTOP_STRUCT: | |
11269 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
11270 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
5ec18f2b | 11271 | preeval_pos = *pos; |
14f9c5c9 AS |
11272 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11273 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 11274 | goto nosideret; |
14f9c5c9 | 11275 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 11276 | { |
df407dfe | 11277 | struct type *type1 = value_type (arg1); |
5b4ee69b | 11278 | |
76a01679 JB |
11279 | if (ada_is_tagged_type (type1, 1)) |
11280 | { | |
11281 | type = ada_lookup_struct_elt_type (type1, | |
11282 | &exp->elts[pc + 2].string, | |
988f6b3d | 11283 | 1, 1); |
5ec18f2b JG |
11284 | |
11285 | /* If the field is not found, check if it exists in the | |
11286 | extension of this object's type. This means that we | |
11287 | need to evaluate completely the expression. */ | |
11288 | ||
76a01679 | 11289 | if (type == NULL) |
5ec18f2b JG |
11290 | { |
11291 | arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos, | |
11292 | EVAL_NORMAL); | |
11293 | arg1 = ada_value_struct_elt (arg1, | |
11294 | &exp->elts[pc + 2].string, | |
11295 | 0); | |
11296 | arg1 = unwrap_value (arg1); | |
11297 | type = value_type (ada_to_fixed_value (arg1)); | |
11298 | } | |
76a01679 JB |
11299 | } |
11300 | else | |
11301 | type = | |
11302 | ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1, | |
988f6b3d | 11303 | 0); |
76a01679 JB |
11304 | |
11305 | return value_zero (ada_aligned_type (type), lval_memory); | |
11306 | } | |
14f9c5c9 | 11307 | else |
a579cd9a MW |
11308 | { |
11309 | arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0); | |
11310 | arg1 = unwrap_value (arg1); | |
11311 | return ada_to_fixed_value (arg1); | |
11312 | } | |
284614f0 | 11313 | |
14f9c5c9 | 11314 | case OP_TYPE: |
4c4b4cd2 PH |
11315 | /* The value is not supposed to be used. This is here to make it |
11316 | easier to accommodate expressions that contain types. */ | |
14f9c5c9 AS |
11317 | (*pos) += 2; |
11318 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 11319 | goto nosideret; |
14f9c5c9 | 11320 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
a6cfbe68 | 11321 | return allocate_value (exp->elts[pc + 1].type); |
14f9c5c9 | 11322 | else |
323e0a4a | 11323 | error (_("Attempt to use a type name as an expression")); |
52ce6436 PH |
11324 | |
11325 | case OP_AGGREGATE: | |
11326 | case OP_CHOICES: | |
11327 | case OP_OTHERS: | |
11328 | case OP_DISCRETE_RANGE: | |
11329 | case OP_POSITIONAL: | |
11330 | case OP_NAME: | |
11331 | if (noside == EVAL_NORMAL) | |
11332 | switch (op) | |
11333 | { | |
11334 | case OP_NAME: | |
11335 | error (_("Undefined name, ambiguous name, or renaming used in " | |
e1d5a0d2 | 11336 | "component association: %s."), &exp->elts[pc+2].string); |
52ce6436 PH |
11337 | case OP_AGGREGATE: |
11338 | error (_("Aggregates only allowed on the right of an assignment")); | |
11339 | default: | |
0963b4bd MS |
11340 | internal_error (__FILE__, __LINE__, |
11341 | _("aggregate apparently mangled")); | |
52ce6436 PH |
11342 | } |
11343 | ||
11344 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
11345 | *pos += oplen - 1; | |
11346 | for (tem = 0; tem < nargs; tem += 1) | |
11347 | ada_evaluate_subexp (NULL, exp, pos, noside); | |
11348 | goto nosideret; | |
14f9c5c9 AS |
11349 | } |
11350 | ||
11351 | nosideret: | |
ced9779b | 11352 | return eval_skip_value (exp); |
14f9c5c9 | 11353 | } |
14f9c5c9 | 11354 | \f |
d2e4a39e | 11355 | |
4c4b4cd2 | 11356 | /* Fixed point */ |
14f9c5c9 AS |
11357 | |
11358 | /* If TYPE encodes an Ada fixed-point type, return the suffix of the | |
11359 | type name that encodes the 'small and 'delta information. | |
4c4b4cd2 | 11360 | Otherwise, return NULL. */ |
14f9c5c9 | 11361 | |
d2e4a39e | 11362 | static const char * |
b2188a06 | 11363 | gnat_encoded_fixed_type_info (struct type *type) |
14f9c5c9 | 11364 | { |
d2e4a39e | 11365 | const char *name = ada_type_name (type); |
78134374 | 11366 | enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : type->code (); |
14f9c5c9 | 11367 | |
d2e4a39e AS |
11368 | if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL) |
11369 | { | |
14f9c5c9 | 11370 | const char *tail = strstr (name, "___XF_"); |
5b4ee69b | 11371 | |
14f9c5c9 | 11372 | if (tail == NULL) |
4c4b4cd2 | 11373 | return NULL; |
d2e4a39e | 11374 | else |
4c4b4cd2 | 11375 | return tail + 5; |
14f9c5c9 AS |
11376 | } |
11377 | else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type) | |
b2188a06 | 11378 | return gnat_encoded_fixed_type_info (TYPE_TARGET_TYPE (type)); |
14f9c5c9 AS |
11379 | else |
11380 | return NULL; | |
11381 | } | |
11382 | ||
4c4b4cd2 | 11383 | /* Returns non-zero iff TYPE represents an Ada fixed-point type. */ |
14f9c5c9 AS |
11384 | |
11385 | int | |
b2188a06 | 11386 | ada_is_gnat_encoded_fixed_point_type (struct type *type) |
14f9c5c9 | 11387 | { |
b2188a06 | 11388 | return gnat_encoded_fixed_type_info (type) != NULL; |
14f9c5c9 AS |
11389 | } |
11390 | ||
4c4b4cd2 PH |
11391 | /* Return non-zero iff TYPE represents a System.Address type. */ |
11392 | ||
11393 | int | |
11394 | ada_is_system_address_type (struct type *type) | |
11395 | { | |
7d93a1e0 | 11396 | return (type->name () && strcmp (type->name (), "system__address") == 0); |
4c4b4cd2 PH |
11397 | } |
11398 | ||
14f9c5c9 | 11399 | /* Assuming that TYPE is the representation of an Ada fixed-point |
50eff16b UW |
11400 | type, return the target floating-point type to be used to represent |
11401 | of this type during internal computation. */ | |
11402 | ||
11403 | static struct type * | |
11404 | ada_scaling_type (struct type *type) | |
11405 | { | |
11406 | return builtin_type (get_type_arch (type))->builtin_long_double; | |
11407 | } | |
11408 | ||
11409 | /* Assuming that TYPE is the representation of an Ada fixed-point | |
11410 | type, return its delta, or NULL if the type is malformed and the | |
4c4b4cd2 | 11411 | delta cannot be determined. */ |
14f9c5c9 | 11412 | |
50eff16b | 11413 | struct value * |
b2188a06 | 11414 | gnat_encoded_fixed_point_delta (struct type *type) |
14f9c5c9 | 11415 | { |
b2188a06 | 11416 | const char *encoding = gnat_encoded_fixed_type_info (type); |
50eff16b UW |
11417 | struct type *scale_type = ada_scaling_type (type); |
11418 | ||
11419 | long long num, den; | |
11420 | ||
11421 | if (sscanf (encoding, "_%lld_%lld", &num, &den) < 2) | |
11422 | return nullptr; | |
d2e4a39e | 11423 | else |
50eff16b UW |
11424 | return value_binop (value_from_longest (scale_type, num), |
11425 | value_from_longest (scale_type, den), BINOP_DIV); | |
14f9c5c9 AS |
11426 | } |
11427 | ||
b2188a06 JB |
11428 | /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return |
11429 | the scaling factor ('SMALL value) associated with the type. */ | |
14f9c5c9 | 11430 | |
50eff16b UW |
11431 | struct value * |
11432 | ada_scaling_factor (struct type *type) | |
14f9c5c9 | 11433 | { |
b2188a06 | 11434 | const char *encoding = gnat_encoded_fixed_type_info (type); |
50eff16b UW |
11435 | struct type *scale_type = ada_scaling_type (type); |
11436 | ||
11437 | long long num0, den0, num1, den1; | |
14f9c5c9 | 11438 | int n; |
d2e4a39e | 11439 | |
50eff16b | 11440 | n = sscanf (encoding, "_%lld_%lld_%lld_%lld", |
facc390f | 11441 | &num0, &den0, &num1, &den1); |
14f9c5c9 AS |
11442 | |
11443 | if (n < 2) | |
50eff16b | 11444 | return value_from_longest (scale_type, 1); |
14f9c5c9 | 11445 | else if (n == 4) |
50eff16b UW |
11446 | return value_binop (value_from_longest (scale_type, num1), |
11447 | value_from_longest (scale_type, den1), BINOP_DIV); | |
d2e4a39e | 11448 | else |
50eff16b UW |
11449 | return value_binop (value_from_longest (scale_type, num0), |
11450 | value_from_longest (scale_type, den0), BINOP_DIV); | |
14f9c5c9 AS |
11451 | } |
11452 | ||
14f9c5c9 | 11453 | \f |
d2e4a39e | 11454 | |
4c4b4cd2 | 11455 | /* Range types */ |
14f9c5c9 AS |
11456 | |
11457 | /* Scan STR beginning at position K for a discriminant name, and | |
11458 | return the value of that discriminant field of DVAL in *PX. If | |
11459 | PNEW_K is not null, put the position of the character beyond the | |
11460 | name scanned in *PNEW_K. Return 1 if successful; return 0 and do | |
4c4b4cd2 | 11461 | not alter *PX and *PNEW_K if unsuccessful. */ |
14f9c5c9 AS |
11462 | |
11463 | static int | |
108d56a4 | 11464 | scan_discrim_bound (const char *str, int k, struct value *dval, LONGEST * px, |
76a01679 | 11465 | int *pnew_k) |
14f9c5c9 AS |
11466 | { |
11467 | static char *bound_buffer = NULL; | |
11468 | static size_t bound_buffer_len = 0; | |
5da1a4d3 | 11469 | const char *pstart, *pend, *bound; |
d2e4a39e | 11470 | struct value *bound_val; |
14f9c5c9 AS |
11471 | |
11472 | if (dval == NULL || str == NULL || str[k] == '\0') | |
11473 | return 0; | |
11474 | ||
5da1a4d3 SM |
11475 | pstart = str + k; |
11476 | pend = strstr (pstart, "__"); | |
14f9c5c9 AS |
11477 | if (pend == NULL) |
11478 | { | |
5da1a4d3 | 11479 | bound = pstart; |
14f9c5c9 AS |
11480 | k += strlen (bound); |
11481 | } | |
d2e4a39e | 11482 | else |
14f9c5c9 | 11483 | { |
5da1a4d3 SM |
11484 | int len = pend - pstart; |
11485 | ||
11486 | /* Strip __ and beyond. */ | |
11487 | GROW_VECT (bound_buffer, bound_buffer_len, len + 1); | |
11488 | strncpy (bound_buffer, pstart, len); | |
11489 | bound_buffer[len] = '\0'; | |
11490 | ||
14f9c5c9 | 11491 | bound = bound_buffer; |
d2e4a39e | 11492 | k = pend - str; |
14f9c5c9 | 11493 | } |
d2e4a39e | 11494 | |
df407dfe | 11495 | bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval)); |
14f9c5c9 AS |
11496 | if (bound_val == NULL) |
11497 | return 0; | |
11498 | ||
11499 | *px = value_as_long (bound_val); | |
11500 | if (pnew_k != NULL) | |
11501 | *pnew_k = k; | |
11502 | return 1; | |
11503 | } | |
11504 | ||
11505 | /* Value of variable named NAME in the current environment. If | |
11506 | no such variable found, then if ERR_MSG is null, returns 0, and | |
4c4b4cd2 PH |
11507 | otherwise causes an error with message ERR_MSG. */ |
11508 | ||
d2e4a39e | 11509 | static struct value * |
edb0c9cb | 11510 | get_var_value (const char *name, const char *err_msg) |
14f9c5c9 | 11511 | { |
b5ec771e | 11512 | lookup_name_info lookup_name (name, symbol_name_match_type::FULL); |
14f9c5c9 | 11513 | |
54d343a2 | 11514 | std::vector<struct block_symbol> syms; |
b5ec771e PA |
11515 | int nsyms = ada_lookup_symbol_list_worker (lookup_name, |
11516 | get_selected_block (0), | |
11517 | VAR_DOMAIN, &syms, 1); | |
14f9c5c9 AS |
11518 | |
11519 | if (nsyms != 1) | |
11520 | { | |
11521 | if (err_msg == NULL) | |
4c4b4cd2 | 11522 | return 0; |
14f9c5c9 | 11523 | else |
8a3fe4f8 | 11524 | error (("%s"), err_msg); |
14f9c5c9 AS |
11525 | } |
11526 | ||
54d343a2 | 11527 | return value_of_variable (syms[0].symbol, syms[0].block); |
14f9c5c9 | 11528 | } |
d2e4a39e | 11529 | |
edb0c9cb PA |
11530 | /* Value of integer variable named NAME in the current environment. |
11531 | If no such variable is found, returns false. Otherwise, sets VALUE | |
11532 | to the variable's value and returns true. */ | |
4c4b4cd2 | 11533 | |
edb0c9cb PA |
11534 | bool |
11535 | get_int_var_value (const char *name, LONGEST &value) | |
14f9c5c9 | 11536 | { |
4c4b4cd2 | 11537 | struct value *var_val = get_var_value (name, 0); |
d2e4a39e | 11538 | |
14f9c5c9 | 11539 | if (var_val == 0) |
edb0c9cb PA |
11540 | return false; |
11541 | ||
11542 | value = value_as_long (var_val); | |
11543 | return true; | |
14f9c5c9 | 11544 | } |
d2e4a39e | 11545 | |
14f9c5c9 AS |
11546 | |
11547 | /* Return a range type whose base type is that of the range type named | |
11548 | NAME in the current environment, and whose bounds are calculated | |
4c4b4cd2 | 11549 | from NAME according to the GNAT range encoding conventions. |
1ce677a4 UW |
11550 | Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the |
11551 | corresponding range type from debug information; fall back to using it | |
11552 | if symbol lookup fails. If a new type must be created, allocate it | |
11553 | like ORIG_TYPE was. The bounds information, in general, is encoded | |
11554 | in NAME, the base type given in the named range type. */ | |
14f9c5c9 | 11555 | |
d2e4a39e | 11556 | static struct type * |
28c85d6c | 11557 | to_fixed_range_type (struct type *raw_type, struct value *dval) |
14f9c5c9 | 11558 | { |
0d5cff50 | 11559 | const char *name; |
14f9c5c9 | 11560 | struct type *base_type; |
108d56a4 | 11561 | const char *subtype_info; |
14f9c5c9 | 11562 | |
28c85d6c | 11563 | gdb_assert (raw_type != NULL); |
7d93a1e0 | 11564 | gdb_assert (raw_type->name () != NULL); |
dddfab26 | 11565 | |
78134374 | 11566 | if (raw_type->code () == TYPE_CODE_RANGE) |
14f9c5c9 AS |
11567 | base_type = TYPE_TARGET_TYPE (raw_type); |
11568 | else | |
11569 | base_type = raw_type; | |
11570 | ||
7d93a1e0 | 11571 | name = raw_type->name (); |
14f9c5c9 AS |
11572 | subtype_info = strstr (name, "___XD"); |
11573 | if (subtype_info == NULL) | |
690cc4eb | 11574 | { |
43bbcdc2 PH |
11575 | LONGEST L = ada_discrete_type_low_bound (raw_type); |
11576 | LONGEST U = ada_discrete_type_high_bound (raw_type); | |
5b4ee69b | 11577 | |
690cc4eb PH |
11578 | if (L < INT_MIN || U > INT_MAX) |
11579 | return raw_type; | |
11580 | else | |
0c9c3474 SA |
11581 | return create_static_range_type (alloc_type_copy (raw_type), raw_type, |
11582 | L, U); | |
690cc4eb | 11583 | } |
14f9c5c9 AS |
11584 | else |
11585 | { | |
11586 | static char *name_buf = NULL; | |
11587 | static size_t name_len = 0; | |
11588 | int prefix_len = subtype_info - name; | |
11589 | LONGEST L, U; | |
11590 | struct type *type; | |
108d56a4 | 11591 | const char *bounds_str; |
14f9c5c9 AS |
11592 | int n; |
11593 | ||
11594 | GROW_VECT (name_buf, name_len, prefix_len + 5); | |
11595 | strncpy (name_buf, name, prefix_len); | |
11596 | name_buf[prefix_len] = '\0'; | |
11597 | ||
11598 | subtype_info += 5; | |
11599 | bounds_str = strchr (subtype_info, '_'); | |
11600 | n = 1; | |
11601 | ||
d2e4a39e | 11602 | if (*subtype_info == 'L') |
4c4b4cd2 PH |
11603 | { |
11604 | if (!ada_scan_number (bounds_str, n, &L, &n) | |
11605 | && !scan_discrim_bound (bounds_str, n, dval, &L, &n)) | |
11606 | return raw_type; | |
11607 | if (bounds_str[n] == '_') | |
11608 | n += 2; | |
0963b4bd | 11609 | else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */ |
4c4b4cd2 PH |
11610 | n += 1; |
11611 | subtype_info += 1; | |
11612 | } | |
d2e4a39e | 11613 | else |
4c4b4cd2 | 11614 | { |
4c4b4cd2 | 11615 | strcpy (name_buf + prefix_len, "___L"); |
edb0c9cb | 11616 | if (!get_int_var_value (name_buf, L)) |
4c4b4cd2 | 11617 | { |
323e0a4a | 11618 | lim_warning (_("Unknown lower bound, using 1.")); |
4c4b4cd2 PH |
11619 | L = 1; |
11620 | } | |
11621 | } | |
14f9c5c9 | 11622 | |
d2e4a39e | 11623 | if (*subtype_info == 'U') |
4c4b4cd2 PH |
11624 | { |
11625 | if (!ada_scan_number (bounds_str, n, &U, &n) | |
11626 | && !scan_discrim_bound (bounds_str, n, dval, &U, &n)) | |
11627 | return raw_type; | |
11628 | } | |
d2e4a39e | 11629 | else |
4c4b4cd2 | 11630 | { |
4c4b4cd2 | 11631 | strcpy (name_buf + prefix_len, "___U"); |
edb0c9cb | 11632 | if (!get_int_var_value (name_buf, U)) |
4c4b4cd2 | 11633 | { |
323e0a4a | 11634 | lim_warning (_("Unknown upper bound, using %ld."), (long) L); |
4c4b4cd2 PH |
11635 | U = L; |
11636 | } | |
11637 | } | |
14f9c5c9 | 11638 | |
0c9c3474 SA |
11639 | type = create_static_range_type (alloc_type_copy (raw_type), |
11640 | base_type, L, U); | |
f5a91472 JB |
11641 | /* create_static_range_type alters the resulting type's length |
11642 | to match the size of the base_type, which is not what we want. | |
11643 | Set it back to the original range type's length. */ | |
11644 | TYPE_LENGTH (type) = TYPE_LENGTH (raw_type); | |
d0e39ea2 | 11645 | type->set_name (name); |
14f9c5c9 AS |
11646 | return type; |
11647 | } | |
11648 | } | |
11649 | ||
4c4b4cd2 PH |
11650 | /* True iff NAME is the name of a range type. */ |
11651 | ||
14f9c5c9 | 11652 | int |
d2e4a39e | 11653 | ada_is_range_type_name (const char *name) |
14f9c5c9 AS |
11654 | { |
11655 | return (name != NULL && strstr (name, "___XD")); | |
d2e4a39e | 11656 | } |
14f9c5c9 | 11657 | \f |
d2e4a39e | 11658 | |
4c4b4cd2 PH |
11659 | /* Modular types */ |
11660 | ||
11661 | /* True iff TYPE is an Ada modular type. */ | |
14f9c5c9 | 11662 | |
14f9c5c9 | 11663 | int |
d2e4a39e | 11664 | ada_is_modular_type (struct type *type) |
14f9c5c9 | 11665 | { |
18af8284 | 11666 | struct type *subranged_type = get_base_type (type); |
14f9c5c9 | 11667 | |
78134374 SM |
11668 | return (subranged_type != NULL && type->code () == TYPE_CODE_RANGE |
11669 | && subranged_type->code () == TYPE_CODE_INT | |
4c4b4cd2 | 11670 | && TYPE_UNSIGNED (subranged_type)); |
14f9c5c9 AS |
11671 | } |
11672 | ||
4c4b4cd2 PH |
11673 | /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */ |
11674 | ||
61ee279c | 11675 | ULONGEST |
0056e4d5 | 11676 | ada_modulus (struct type *type) |
14f9c5c9 | 11677 | { |
43bbcdc2 | 11678 | return (ULONGEST) TYPE_HIGH_BOUND (type) + 1; |
14f9c5c9 | 11679 | } |
d2e4a39e | 11680 | \f |
f7f9143b JB |
11681 | |
11682 | /* Ada exception catchpoint support: | |
11683 | --------------------------------- | |
11684 | ||
11685 | We support 3 kinds of exception catchpoints: | |
11686 | . catchpoints on Ada exceptions | |
11687 | . catchpoints on unhandled Ada exceptions | |
11688 | . catchpoints on failed assertions | |
11689 | ||
11690 | Exceptions raised during failed assertions, or unhandled exceptions | |
11691 | could perfectly be caught with the general catchpoint on Ada exceptions. | |
11692 | However, we can easily differentiate these two special cases, and having | |
11693 | the option to distinguish these two cases from the rest can be useful | |
11694 | to zero-in on certain situations. | |
11695 | ||
11696 | Exception catchpoints are a specialized form of breakpoint, | |
11697 | since they rely on inserting breakpoints inside known routines | |
11698 | of the GNAT runtime. The implementation therefore uses a standard | |
11699 | breakpoint structure of the BP_BREAKPOINT type, but with its own set | |
11700 | of breakpoint_ops. | |
11701 | ||
0259addd JB |
11702 | Support in the runtime for exception catchpoints have been changed |
11703 | a few times already, and these changes affect the implementation | |
11704 | of these catchpoints. In order to be able to support several | |
11705 | variants of the runtime, we use a sniffer that will determine | |
28010a5d | 11706 | the runtime variant used by the program being debugged. */ |
f7f9143b | 11707 | |
82eacd52 JB |
11708 | /* Ada's standard exceptions. |
11709 | ||
11710 | The Ada 83 standard also defined Numeric_Error. But there so many | |
11711 | situations where it was unclear from the Ada 83 Reference Manual | |
11712 | (RM) whether Constraint_Error or Numeric_Error should be raised, | |
11713 | that the ARG (Ada Rapporteur Group) eventually issued a Binding | |
11714 | Interpretation saying that anytime the RM says that Numeric_Error | |
11715 | should be raised, the implementation may raise Constraint_Error. | |
11716 | Ada 95 went one step further and pretty much removed Numeric_Error | |
11717 | from the list of standard exceptions (it made it a renaming of | |
11718 | Constraint_Error, to help preserve compatibility when compiling | |
11719 | an Ada83 compiler). As such, we do not include Numeric_Error from | |
11720 | this list of standard exceptions. */ | |
3d0b0fa3 | 11721 | |
a121b7c1 | 11722 | static const char *standard_exc[] = { |
3d0b0fa3 JB |
11723 | "constraint_error", |
11724 | "program_error", | |
11725 | "storage_error", | |
11726 | "tasking_error" | |
11727 | }; | |
11728 | ||
0259addd JB |
11729 | typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void); |
11730 | ||
11731 | /* A structure that describes how to support exception catchpoints | |
11732 | for a given executable. */ | |
11733 | ||
11734 | struct exception_support_info | |
11735 | { | |
11736 | /* The name of the symbol to break on in order to insert | |
11737 | a catchpoint on exceptions. */ | |
11738 | const char *catch_exception_sym; | |
11739 | ||
11740 | /* The name of the symbol to break on in order to insert | |
11741 | a catchpoint on unhandled exceptions. */ | |
11742 | const char *catch_exception_unhandled_sym; | |
11743 | ||
11744 | /* The name of the symbol to break on in order to insert | |
11745 | a catchpoint on failed assertions. */ | |
11746 | const char *catch_assert_sym; | |
11747 | ||
9f757bf7 XR |
11748 | /* The name of the symbol to break on in order to insert |
11749 | a catchpoint on exception handling. */ | |
11750 | const char *catch_handlers_sym; | |
11751 | ||
0259addd JB |
11752 | /* Assuming that the inferior just triggered an unhandled exception |
11753 | catchpoint, this function is responsible for returning the address | |
11754 | in inferior memory where the name of that exception is stored. | |
11755 | Return zero if the address could not be computed. */ | |
11756 | ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr; | |
11757 | }; | |
11758 | ||
11759 | static CORE_ADDR ada_unhandled_exception_name_addr (void); | |
11760 | static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void); | |
11761 | ||
11762 | /* The following exception support info structure describes how to | |
11763 | implement exception catchpoints with the latest version of the | |
ca683e3a | 11764 | Ada runtime (as of 2019-08-??). */ |
0259addd JB |
11765 | |
11766 | static const struct exception_support_info default_exception_support_info = | |
ca683e3a AO |
11767 | { |
11768 | "__gnat_debug_raise_exception", /* catch_exception_sym */ | |
11769 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
11770 | "__gnat_debug_raise_assert_failure", /* catch_assert_sym */ | |
11771 | "__gnat_begin_handler_v1", /* catch_handlers_sym */ | |
11772 | ada_unhandled_exception_name_addr | |
11773 | }; | |
11774 | ||
11775 | /* The following exception support info structure describes how to | |
11776 | implement exception catchpoints with an earlier version of the | |
11777 | Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */ | |
11778 | ||
11779 | static const struct exception_support_info exception_support_info_v0 = | |
0259addd JB |
11780 | { |
11781 | "__gnat_debug_raise_exception", /* catch_exception_sym */ | |
11782 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
11783 | "__gnat_debug_raise_assert_failure", /* catch_assert_sym */ | |
9f757bf7 | 11784 | "__gnat_begin_handler", /* catch_handlers_sym */ |
0259addd JB |
11785 | ada_unhandled_exception_name_addr |
11786 | }; | |
11787 | ||
11788 | /* The following exception support info structure describes how to | |
11789 | implement exception catchpoints with a slightly older version | |
11790 | of the Ada runtime. */ | |
11791 | ||
11792 | static const struct exception_support_info exception_support_info_fallback = | |
11793 | { | |
11794 | "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */ | |
11795 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
11796 | "system__assertions__raise_assert_failure", /* catch_assert_sym */ | |
9f757bf7 | 11797 | "__gnat_begin_handler", /* catch_handlers_sym */ |
0259addd JB |
11798 | ada_unhandled_exception_name_addr_from_raise |
11799 | }; | |
11800 | ||
f17011e0 JB |
11801 | /* Return nonzero if we can detect the exception support routines |
11802 | described in EINFO. | |
11803 | ||
11804 | This function errors out if an abnormal situation is detected | |
11805 | (for instance, if we find the exception support routines, but | |
11806 | that support is found to be incomplete). */ | |
11807 | ||
11808 | static int | |
11809 | ada_has_this_exception_support (const struct exception_support_info *einfo) | |
11810 | { | |
11811 | struct symbol *sym; | |
11812 | ||
11813 | /* The symbol we're looking up is provided by a unit in the GNAT runtime | |
11814 | that should be compiled with debugging information. As a result, we | |
11815 | expect to find that symbol in the symtabs. */ | |
11816 | ||
11817 | sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN); | |
11818 | if (sym == NULL) | |
a6af7abe JB |
11819 | { |
11820 | /* Perhaps we did not find our symbol because the Ada runtime was | |
11821 | compiled without debugging info, or simply stripped of it. | |
11822 | It happens on some GNU/Linux distributions for instance, where | |
11823 | users have to install a separate debug package in order to get | |
11824 | the runtime's debugging info. In that situation, let the user | |
11825 | know why we cannot insert an Ada exception catchpoint. | |
11826 | ||
11827 | Note: Just for the purpose of inserting our Ada exception | |
11828 | catchpoint, we could rely purely on the associated minimal symbol. | |
11829 | But we would be operating in degraded mode anyway, since we are | |
11830 | still lacking the debugging info needed later on to extract | |
11831 | the name of the exception being raised (this name is printed in | |
11832 | the catchpoint message, and is also used when trying to catch | |
11833 | a specific exception). We do not handle this case for now. */ | |
3b7344d5 | 11834 | struct bound_minimal_symbol msym |
1c8e84b0 JB |
11835 | = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL); |
11836 | ||
3b7344d5 | 11837 | if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline) |
a6af7abe JB |
11838 | error (_("Your Ada runtime appears to be missing some debugging " |
11839 | "information.\nCannot insert Ada exception catchpoint " | |
11840 | "in this configuration.")); | |
11841 | ||
11842 | return 0; | |
11843 | } | |
f17011e0 JB |
11844 | |
11845 | /* Make sure that the symbol we found corresponds to a function. */ | |
11846 | ||
11847 | if (SYMBOL_CLASS (sym) != LOC_BLOCK) | |
ca683e3a AO |
11848 | { |
11849 | error (_("Symbol \"%s\" is not a function (class = %d)"), | |
987012b8 | 11850 | sym->linkage_name (), SYMBOL_CLASS (sym)); |
ca683e3a AO |
11851 | return 0; |
11852 | } | |
11853 | ||
11854 | sym = standard_lookup (einfo->catch_handlers_sym, NULL, VAR_DOMAIN); | |
11855 | if (sym == NULL) | |
11856 | { | |
11857 | struct bound_minimal_symbol msym | |
11858 | = lookup_minimal_symbol (einfo->catch_handlers_sym, NULL, NULL); | |
11859 | ||
11860 | if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline) | |
11861 | error (_("Your Ada runtime appears to be missing some debugging " | |
11862 | "information.\nCannot insert Ada exception catchpoint " | |
11863 | "in this configuration.")); | |
11864 | ||
11865 | return 0; | |
11866 | } | |
11867 | ||
11868 | /* Make sure that the symbol we found corresponds to a function. */ | |
11869 | ||
11870 | if (SYMBOL_CLASS (sym) != LOC_BLOCK) | |
11871 | { | |
11872 | error (_("Symbol \"%s\" is not a function (class = %d)"), | |
987012b8 | 11873 | sym->linkage_name (), SYMBOL_CLASS (sym)); |
ca683e3a AO |
11874 | return 0; |
11875 | } | |
f17011e0 JB |
11876 | |
11877 | return 1; | |
11878 | } | |
11879 | ||
0259addd JB |
11880 | /* Inspect the Ada runtime and determine which exception info structure |
11881 | should be used to provide support for exception catchpoints. | |
11882 | ||
3eecfa55 JB |
11883 | This function will always set the per-inferior exception_info, |
11884 | or raise an error. */ | |
0259addd JB |
11885 | |
11886 | static void | |
11887 | ada_exception_support_info_sniffer (void) | |
11888 | { | |
3eecfa55 | 11889 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
0259addd JB |
11890 | |
11891 | /* If the exception info is already known, then no need to recompute it. */ | |
3eecfa55 | 11892 | if (data->exception_info != NULL) |
0259addd JB |
11893 | return; |
11894 | ||
11895 | /* Check the latest (default) exception support info. */ | |
f17011e0 | 11896 | if (ada_has_this_exception_support (&default_exception_support_info)) |
0259addd | 11897 | { |
3eecfa55 | 11898 | data->exception_info = &default_exception_support_info; |
0259addd JB |
11899 | return; |
11900 | } | |
11901 | ||
ca683e3a AO |
11902 | /* Try the v0 exception suport info. */ |
11903 | if (ada_has_this_exception_support (&exception_support_info_v0)) | |
11904 | { | |
11905 | data->exception_info = &exception_support_info_v0; | |
11906 | return; | |
11907 | } | |
11908 | ||
0259addd | 11909 | /* Try our fallback exception suport info. */ |
f17011e0 | 11910 | if (ada_has_this_exception_support (&exception_support_info_fallback)) |
0259addd | 11911 | { |
3eecfa55 | 11912 | data->exception_info = &exception_support_info_fallback; |
0259addd JB |
11913 | return; |
11914 | } | |
11915 | ||
11916 | /* Sometimes, it is normal for us to not be able to find the routine | |
11917 | we are looking for. This happens when the program is linked with | |
11918 | the shared version of the GNAT runtime, and the program has not been | |
11919 | started yet. Inform the user of these two possible causes if | |
11920 | applicable. */ | |
11921 | ||
ccefe4c4 | 11922 | if (ada_update_initial_language (language_unknown) != language_ada) |
0259addd JB |
11923 | error (_("Unable to insert catchpoint. Is this an Ada main program?")); |
11924 | ||
11925 | /* If the symbol does not exist, then check that the program is | |
11926 | already started, to make sure that shared libraries have been | |
11927 | loaded. If it is not started, this may mean that the symbol is | |
11928 | in a shared library. */ | |
11929 | ||
e99b03dc | 11930 | if (inferior_ptid.pid () == 0) |
0259addd JB |
11931 | error (_("Unable to insert catchpoint. Try to start the program first.")); |
11932 | ||
11933 | /* At this point, we know that we are debugging an Ada program and | |
11934 | that the inferior has been started, but we still are not able to | |
0963b4bd | 11935 | find the run-time symbols. That can mean that we are in |
0259addd JB |
11936 | configurable run time mode, or that a-except as been optimized |
11937 | out by the linker... In any case, at this point it is not worth | |
11938 | supporting this feature. */ | |
11939 | ||
7dda8cff | 11940 | error (_("Cannot insert Ada exception catchpoints in this configuration.")); |
0259addd JB |
11941 | } |
11942 | ||
f7f9143b JB |
11943 | /* True iff FRAME is very likely to be that of a function that is |
11944 | part of the runtime system. This is all very heuristic, but is | |
11945 | intended to be used as advice as to what frames are uninteresting | |
11946 | to most users. */ | |
11947 | ||
11948 | static int | |
11949 | is_known_support_routine (struct frame_info *frame) | |
11950 | { | |
692465f1 | 11951 | enum language func_lang; |
f7f9143b | 11952 | int i; |
f35a17b5 | 11953 | const char *fullname; |
f7f9143b | 11954 | |
4ed6b5be JB |
11955 | /* If this code does not have any debugging information (no symtab), |
11956 | This cannot be any user code. */ | |
f7f9143b | 11957 | |
51abb421 | 11958 | symtab_and_line sal = find_frame_sal (frame); |
f7f9143b JB |
11959 | if (sal.symtab == NULL) |
11960 | return 1; | |
11961 | ||
4ed6b5be JB |
11962 | /* If there is a symtab, but the associated source file cannot be |
11963 | located, then assume this is not user code: Selecting a frame | |
11964 | for which we cannot display the code would not be very helpful | |
11965 | for the user. This should also take care of case such as VxWorks | |
11966 | where the kernel has some debugging info provided for a few units. */ | |
f7f9143b | 11967 | |
f35a17b5 JK |
11968 | fullname = symtab_to_fullname (sal.symtab); |
11969 | if (access (fullname, R_OK) != 0) | |
f7f9143b JB |
11970 | return 1; |
11971 | ||
85102364 | 11972 | /* Check the unit filename against the Ada runtime file naming. |
4ed6b5be JB |
11973 | We also check the name of the objfile against the name of some |
11974 | known system libraries that sometimes come with debugging info | |
11975 | too. */ | |
11976 | ||
f7f9143b JB |
11977 | for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1) |
11978 | { | |
11979 | re_comp (known_runtime_file_name_patterns[i]); | |
f69c91ad | 11980 | if (re_exec (lbasename (sal.symtab->filename))) |
f7f9143b | 11981 | return 1; |
eb822aa6 DE |
11982 | if (SYMTAB_OBJFILE (sal.symtab) != NULL |
11983 | && re_exec (objfile_name (SYMTAB_OBJFILE (sal.symtab)))) | |
4ed6b5be | 11984 | return 1; |
f7f9143b JB |
11985 | } |
11986 | ||
4ed6b5be | 11987 | /* Check whether the function is a GNAT-generated entity. */ |
f7f9143b | 11988 | |
c6dc63a1 TT |
11989 | gdb::unique_xmalloc_ptr<char> func_name |
11990 | = find_frame_funname (frame, &func_lang, NULL); | |
f7f9143b JB |
11991 | if (func_name == NULL) |
11992 | return 1; | |
11993 | ||
11994 | for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1) | |
11995 | { | |
11996 | re_comp (known_auxiliary_function_name_patterns[i]); | |
c6dc63a1 TT |
11997 | if (re_exec (func_name.get ())) |
11998 | return 1; | |
f7f9143b JB |
11999 | } |
12000 | ||
12001 | return 0; | |
12002 | } | |
12003 | ||
12004 | /* Find the first frame that contains debugging information and that is not | |
12005 | part of the Ada run-time, starting from FI and moving upward. */ | |
12006 | ||
0ef643c8 | 12007 | void |
f7f9143b JB |
12008 | ada_find_printable_frame (struct frame_info *fi) |
12009 | { | |
12010 | for (; fi != NULL; fi = get_prev_frame (fi)) | |
12011 | { | |
12012 | if (!is_known_support_routine (fi)) | |
12013 | { | |
12014 | select_frame (fi); | |
12015 | break; | |
12016 | } | |
12017 | } | |
12018 | ||
12019 | } | |
12020 | ||
12021 | /* Assuming that the inferior just triggered an unhandled exception | |
12022 | catchpoint, return the address in inferior memory where the name | |
12023 | of the exception is stored. | |
12024 | ||
12025 | Return zero if the address could not be computed. */ | |
12026 | ||
12027 | static CORE_ADDR | |
12028 | ada_unhandled_exception_name_addr (void) | |
0259addd JB |
12029 | { |
12030 | return parse_and_eval_address ("e.full_name"); | |
12031 | } | |
12032 | ||
12033 | /* Same as ada_unhandled_exception_name_addr, except that this function | |
12034 | should be used when the inferior uses an older version of the runtime, | |
12035 | where the exception name needs to be extracted from a specific frame | |
12036 | several frames up in the callstack. */ | |
12037 | ||
12038 | static CORE_ADDR | |
12039 | ada_unhandled_exception_name_addr_from_raise (void) | |
f7f9143b JB |
12040 | { |
12041 | int frame_level; | |
12042 | struct frame_info *fi; | |
3eecfa55 | 12043 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
f7f9143b JB |
12044 | |
12045 | /* To determine the name of this exception, we need to select | |
12046 | the frame corresponding to RAISE_SYM_NAME. This frame is | |
12047 | at least 3 levels up, so we simply skip the first 3 frames | |
12048 | without checking the name of their associated function. */ | |
12049 | fi = get_current_frame (); | |
12050 | for (frame_level = 0; frame_level < 3; frame_level += 1) | |
12051 | if (fi != NULL) | |
12052 | fi = get_prev_frame (fi); | |
12053 | ||
12054 | while (fi != NULL) | |
12055 | { | |
692465f1 JB |
12056 | enum language func_lang; |
12057 | ||
c6dc63a1 TT |
12058 | gdb::unique_xmalloc_ptr<char> func_name |
12059 | = find_frame_funname (fi, &func_lang, NULL); | |
55b87a52 KS |
12060 | if (func_name != NULL) |
12061 | { | |
c6dc63a1 | 12062 | if (strcmp (func_name.get (), |
55b87a52 KS |
12063 | data->exception_info->catch_exception_sym) == 0) |
12064 | break; /* We found the frame we were looking for... */ | |
55b87a52 | 12065 | } |
fb44b1a7 | 12066 | fi = get_prev_frame (fi); |
f7f9143b JB |
12067 | } |
12068 | ||
12069 | if (fi == NULL) | |
12070 | return 0; | |
12071 | ||
12072 | select_frame (fi); | |
12073 | return parse_and_eval_address ("id.full_name"); | |
12074 | } | |
12075 | ||
12076 | /* Assuming the inferior just triggered an Ada exception catchpoint | |
12077 | (of any type), return the address in inferior memory where the name | |
12078 | of the exception is stored, if applicable. | |
12079 | ||
45db7c09 PA |
12080 | Assumes the selected frame is the current frame. |
12081 | ||
f7f9143b JB |
12082 | Return zero if the address could not be computed, or if not relevant. */ |
12083 | ||
12084 | static CORE_ADDR | |
761269c8 | 12085 | ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12086 | struct breakpoint *b) |
12087 | { | |
3eecfa55 JB |
12088 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
12089 | ||
f7f9143b JB |
12090 | switch (ex) |
12091 | { | |
761269c8 | 12092 | case ada_catch_exception: |
f7f9143b JB |
12093 | return (parse_and_eval_address ("e.full_name")); |
12094 | break; | |
12095 | ||
761269c8 | 12096 | case ada_catch_exception_unhandled: |
3eecfa55 | 12097 | return data->exception_info->unhandled_exception_name_addr (); |
f7f9143b | 12098 | break; |
9f757bf7 XR |
12099 | |
12100 | case ada_catch_handlers: | |
12101 | return 0; /* The runtimes does not provide access to the exception | |
12102 | name. */ | |
12103 | break; | |
12104 | ||
761269c8 | 12105 | case ada_catch_assert: |
f7f9143b JB |
12106 | return 0; /* Exception name is not relevant in this case. */ |
12107 | break; | |
12108 | ||
12109 | default: | |
12110 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12111 | break; | |
12112 | } | |
12113 | ||
12114 | return 0; /* Should never be reached. */ | |
12115 | } | |
12116 | ||
e547c119 JB |
12117 | /* Assuming the inferior is stopped at an exception catchpoint, |
12118 | return the message which was associated to the exception, if | |
12119 | available. Return NULL if the message could not be retrieved. | |
12120 | ||
e547c119 JB |
12121 | Note: The exception message can be associated to an exception |
12122 | either through the use of the Raise_Exception function, or | |
12123 | more simply (Ada 2005 and later), via: | |
12124 | ||
12125 | raise Exception_Name with "exception message"; | |
12126 | ||
12127 | */ | |
12128 | ||
6f46ac85 | 12129 | static gdb::unique_xmalloc_ptr<char> |
e547c119 JB |
12130 | ada_exception_message_1 (void) |
12131 | { | |
12132 | struct value *e_msg_val; | |
e547c119 | 12133 | int e_msg_len; |
e547c119 JB |
12134 | |
12135 | /* For runtimes that support this feature, the exception message | |
12136 | is passed as an unbounded string argument called "message". */ | |
12137 | e_msg_val = parse_and_eval ("message"); | |
12138 | if (e_msg_val == NULL) | |
12139 | return NULL; /* Exception message not supported. */ | |
12140 | ||
12141 | e_msg_val = ada_coerce_to_simple_array (e_msg_val); | |
12142 | gdb_assert (e_msg_val != NULL); | |
12143 | e_msg_len = TYPE_LENGTH (value_type (e_msg_val)); | |
12144 | ||
12145 | /* If the message string is empty, then treat it as if there was | |
12146 | no exception message. */ | |
12147 | if (e_msg_len <= 0) | |
12148 | return NULL; | |
12149 | ||
6f46ac85 TT |
12150 | gdb::unique_xmalloc_ptr<char> e_msg ((char *) xmalloc (e_msg_len + 1)); |
12151 | read_memory_string (value_address (e_msg_val), e_msg.get (), e_msg_len + 1); | |
12152 | e_msg.get ()[e_msg_len] = '\0'; | |
e547c119 | 12153 | |
e547c119 JB |
12154 | return e_msg; |
12155 | } | |
12156 | ||
12157 | /* Same as ada_exception_message_1, except that all exceptions are | |
12158 | contained here (returning NULL instead). */ | |
12159 | ||
6f46ac85 | 12160 | static gdb::unique_xmalloc_ptr<char> |
e547c119 JB |
12161 | ada_exception_message (void) |
12162 | { | |
6f46ac85 | 12163 | gdb::unique_xmalloc_ptr<char> e_msg; |
e547c119 | 12164 | |
a70b8144 | 12165 | try |
e547c119 JB |
12166 | { |
12167 | e_msg = ada_exception_message_1 (); | |
12168 | } | |
230d2906 | 12169 | catch (const gdb_exception_error &e) |
e547c119 | 12170 | { |
6f46ac85 | 12171 | e_msg.reset (nullptr); |
e547c119 | 12172 | } |
e547c119 JB |
12173 | |
12174 | return e_msg; | |
12175 | } | |
12176 | ||
f7f9143b JB |
12177 | /* Same as ada_exception_name_addr_1, except that it intercepts and contains |
12178 | any error that ada_exception_name_addr_1 might cause to be thrown. | |
12179 | When an error is intercepted, a warning with the error message is printed, | |
12180 | and zero is returned. */ | |
12181 | ||
12182 | static CORE_ADDR | |
761269c8 | 12183 | ada_exception_name_addr (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12184 | struct breakpoint *b) |
12185 | { | |
f7f9143b JB |
12186 | CORE_ADDR result = 0; |
12187 | ||
a70b8144 | 12188 | try |
f7f9143b JB |
12189 | { |
12190 | result = ada_exception_name_addr_1 (ex, b); | |
12191 | } | |
12192 | ||
230d2906 | 12193 | catch (const gdb_exception_error &e) |
f7f9143b | 12194 | { |
3d6e9d23 | 12195 | warning (_("failed to get exception name: %s"), e.what ()); |
f7f9143b JB |
12196 | return 0; |
12197 | } | |
12198 | ||
12199 | return result; | |
12200 | } | |
12201 | ||
cb7de75e | 12202 | static std::string ada_exception_catchpoint_cond_string |
9f757bf7 XR |
12203 | (const char *excep_string, |
12204 | enum ada_exception_catchpoint_kind ex); | |
28010a5d PA |
12205 | |
12206 | /* Ada catchpoints. | |
12207 | ||
12208 | In the case of catchpoints on Ada exceptions, the catchpoint will | |
12209 | stop the target on every exception the program throws. When a user | |
12210 | specifies the name of a specific exception, we translate this | |
12211 | request into a condition expression (in text form), and then parse | |
12212 | it into an expression stored in each of the catchpoint's locations. | |
12213 | We then use this condition to check whether the exception that was | |
12214 | raised is the one the user is interested in. If not, then the | |
12215 | target is resumed again. We store the name of the requested | |
12216 | exception, in order to be able to re-set the condition expression | |
12217 | when symbols change. */ | |
12218 | ||
12219 | /* An instance of this type is used to represent an Ada catchpoint | |
5625a286 | 12220 | breakpoint location. */ |
28010a5d | 12221 | |
5625a286 | 12222 | class ada_catchpoint_location : public bp_location |
28010a5d | 12223 | { |
5625a286 | 12224 | public: |
5f486660 | 12225 | ada_catchpoint_location (breakpoint *owner) |
f06f1252 | 12226 | : bp_location (owner, bp_loc_software_breakpoint) |
5625a286 | 12227 | {} |
28010a5d PA |
12228 | |
12229 | /* The condition that checks whether the exception that was raised | |
12230 | is the specific exception the user specified on catchpoint | |
12231 | creation. */ | |
4d01a485 | 12232 | expression_up excep_cond_expr; |
28010a5d PA |
12233 | }; |
12234 | ||
c1fc2657 | 12235 | /* An instance of this type is used to represent an Ada catchpoint. */ |
28010a5d | 12236 | |
c1fc2657 | 12237 | struct ada_catchpoint : public breakpoint |
28010a5d | 12238 | { |
37f6a7f4 TT |
12239 | explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind) |
12240 | : m_kind (kind) | |
12241 | { | |
12242 | } | |
12243 | ||
28010a5d | 12244 | /* The name of the specific exception the user specified. */ |
bc18fbb5 | 12245 | std::string excep_string; |
37f6a7f4 TT |
12246 | |
12247 | /* What kind of catchpoint this is. */ | |
12248 | enum ada_exception_catchpoint_kind m_kind; | |
28010a5d PA |
12249 | }; |
12250 | ||
12251 | /* Parse the exception condition string in the context of each of the | |
12252 | catchpoint's locations, and store them for later evaluation. */ | |
12253 | ||
12254 | static void | |
9f757bf7 XR |
12255 | create_excep_cond_exprs (struct ada_catchpoint *c, |
12256 | enum ada_exception_catchpoint_kind ex) | |
28010a5d | 12257 | { |
fccf9de1 TT |
12258 | struct bp_location *bl; |
12259 | ||
28010a5d | 12260 | /* Nothing to do if there's no specific exception to catch. */ |
bc18fbb5 | 12261 | if (c->excep_string.empty ()) |
28010a5d PA |
12262 | return; |
12263 | ||
12264 | /* Same if there are no locations... */ | |
c1fc2657 | 12265 | if (c->loc == NULL) |
28010a5d PA |
12266 | return; |
12267 | ||
fccf9de1 TT |
12268 | /* Compute the condition expression in text form, from the specific |
12269 | expection we want to catch. */ | |
12270 | std::string cond_string | |
12271 | = ada_exception_catchpoint_cond_string (c->excep_string.c_str (), ex); | |
28010a5d | 12272 | |
fccf9de1 TT |
12273 | /* Iterate over all the catchpoint's locations, and parse an |
12274 | expression for each. */ | |
12275 | for (bl = c->loc; bl != NULL; bl = bl->next) | |
28010a5d PA |
12276 | { |
12277 | struct ada_catchpoint_location *ada_loc | |
fccf9de1 | 12278 | = (struct ada_catchpoint_location *) bl; |
4d01a485 | 12279 | expression_up exp; |
28010a5d | 12280 | |
fccf9de1 | 12281 | if (!bl->shlib_disabled) |
28010a5d | 12282 | { |
bbc13ae3 | 12283 | const char *s; |
28010a5d | 12284 | |
cb7de75e | 12285 | s = cond_string.c_str (); |
a70b8144 | 12286 | try |
28010a5d | 12287 | { |
fccf9de1 TT |
12288 | exp = parse_exp_1 (&s, bl->address, |
12289 | block_for_pc (bl->address), | |
036e657b | 12290 | 0); |
28010a5d | 12291 | } |
230d2906 | 12292 | catch (const gdb_exception_error &e) |
849f2b52 JB |
12293 | { |
12294 | warning (_("failed to reevaluate internal exception condition " | |
12295 | "for catchpoint %d: %s"), | |
3d6e9d23 | 12296 | c->number, e.what ()); |
849f2b52 | 12297 | } |
28010a5d PA |
12298 | } |
12299 | ||
b22e99fd | 12300 | ada_loc->excep_cond_expr = std::move (exp); |
28010a5d | 12301 | } |
28010a5d PA |
12302 | } |
12303 | ||
28010a5d PA |
12304 | /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops |
12305 | structure for all exception catchpoint kinds. */ | |
12306 | ||
12307 | static struct bp_location * | |
37f6a7f4 | 12308 | allocate_location_exception (struct breakpoint *self) |
28010a5d | 12309 | { |
5f486660 | 12310 | return new ada_catchpoint_location (self); |
28010a5d PA |
12311 | } |
12312 | ||
12313 | /* Implement the RE_SET method in the breakpoint_ops structure for all | |
12314 | exception catchpoint kinds. */ | |
12315 | ||
12316 | static void | |
37f6a7f4 | 12317 | re_set_exception (struct breakpoint *b) |
28010a5d PA |
12318 | { |
12319 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; | |
12320 | ||
12321 | /* Call the base class's method. This updates the catchpoint's | |
12322 | locations. */ | |
2060206e | 12323 | bkpt_breakpoint_ops.re_set (b); |
28010a5d PA |
12324 | |
12325 | /* Reparse the exception conditional expressions. One for each | |
12326 | location. */ | |
37f6a7f4 | 12327 | create_excep_cond_exprs (c, c->m_kind); |
28010a5d PA |
12328 | } |
12329 | ||
12330 | /* Returns true if we should stop for this breakpoint hit. If the | |
12331 | user specified a specific exception, we only want to cause a stop | |
12332 | if the program thrown that exception. */ | |
12333 | ||
12334 | static int | |
12335 | should_stop_exception (const struct bp_location *bl) | |
12336 | { | |
12337 | struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner; | |
12338 | const struct ada_catchpoint_location *ada_loc | |
12339 | = (const struct ada_catchpoint_location *) bl; | |
28010a5d PA |
12340 | int stop; |
12341 | ||
37f6a7f4 TT |
12342 | struct internalvar *var = lookup_internalvar ("_ada_exception"); |
12343 | if (c->m_kind == ada_catch_assert) | |
12344 | clear_internalvar (var); | |
12345 | else | |
12346 | { | |
12347 | try | |
12348 | { | |
12349 | const char *expr; | |
12350 | ||
12351 | if (c->m_kind == ada_catch_handlers) | |
12352 | expr = ("GNAT_GCC_exception_Access(gcc_exception)" | |
12353 | ".all.occurrence.id"); | |
12354 | else | |
12355 | expr = "e"; | |
12356 | ||
12357 | struct value *exc = parse_and_eval (expr); | |
12358 | set_internalvar (var, exc); | |
12359 | } | |
12360 | catch (const gdb_exception_error &ex) | |
12361 | { | |
12362 | clear_internalvar (var); | |
12363 | } | |
12364 | } | |
12365 | ||
28010a5d | 12366 | /* With no specific exception, should always stop. */ |
bc18fbb5 | 12367 | if (c->excep_string.empty ()) |
28010a5d PA |
12368 | return 1; |
12369 | ||
12370 | if (ada_loc->excep_cond_expr == NULL) | |
12371 | { | |
12372 | /* We will have a NULL expression if back when we were creating | |
12373 | the expressions, this location's had failed to parse. */ | |
12374 | return 1; | |
12375 | } | |
12376 | ||
12377 | stop = 1; | |
a70b8144 | 12378 | try |
28010a5d PA |
12379 | { |
12380 | struct value *mark; | |
12381 | ||
12382 | mark = value_mark (); | |
4d01a485 | 12383 | stop = value_true (evaluate_expression (ada_loc->excep_cond_expr.get ())); |
28010a5d PA |
12384 | value_free_to_mark (mark); |
12385 | } | |
230d2906 | 12386 | catch (const gdb_exception &ex) |
492d29ea PA |
12387 | { |
12388 | exception_fprintf (gdb_stderr, ex, | |
12389 | _("Error in testing exception condition:\n")); | |
12390 | } | |
492d29ea | 12391 | |
28010a5d PA |
12392 | return stop; |
12393 | } | |
12394 | ||
12395 | /* Implement the CHECK_STATUS method in the breakpoint_ops structure | |
12396 | for all exception catchpoint kinds. */ | |
12397 | ||
12398 | static void | |
37f6a7f4 | 12399 | check_status_exception (bpstat bs) |
28010a5d PA |
12400 | { |
12401 | bs->stop = should_stop_exception (bs->bp_location_at); | |
12402 | } | |
12403 | ||
f7f9143b JB |
12404 | /* Implement the PRINT_IT method in the breakpoint_ops structure |
12405 | for all exception catchpoint kinds. */ | |
12406 | ||
12407 | static enum print_stop_action | |
37f6a7f4 | 12408 | print_it_exception (bpstat bs) |
f7f9143b | 12409 | { |
79a45e25 | 12410 | struct ui_out *uiout = current_uiout; |
348d480f PA |
12411 | struct breakpoint *b = bs->breakpoint_at; |
12412 | ||
956a9fb9 | 12413 | annotate_catchpoint (b->number); |
f7f9143b | 12414 | |
112e8700 | 12415 | if (uiout->is_mi_like_p ()) |
f7f9143b | 12416 | { |
112e8700 | 12417 | uiout->field_string ("reason", |
956a9fb9 | 12418 | async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT)); |
112e8700 | 12419 | uiout->field_string ("disp", bpdisp_text (b->disposition)); |
f7f9143b JB |
12420 | } |
12421 | ||
112e8700 SM |
12422 | uiout->text (b->disposition == disp_del |
12423 | ? "\nTemporary catchpoint " : "\nCatchpoint "); | |
381befee | 12424 | uiout->field_signed ("bkptno", b->number); |
112e8700 | 12425 | uiout->text (", "); |
f7f9143b | 12426 | |
45db7c09 PA |
12427 | /* ada_exception_name_addr relies on the selected frame being the |
12428 | current frame. Need to do this here because this function may be | |
12429 | called more than once when printing a stop, and below, we'll | |
12430 | select the first frame past the Ada run-time (see | |
12431 | ada_find_printable_frame). */ | |
12432 | select_frame (get_current_frame ()); | |
12433 | ||
37f6a7f4 TT |
12434 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
12435 | switch (c->m_kind) | |
f7f9143b | 12436 | { |
761269c8 JB |
12437 | case ada_catch_exception: |
12438 | case ada_catch_exception_unhandled: | |
9f757bf7 | 12439 | case ada_catch_handlers: |
956a9fb9 | 12440 | { |
37f6a7f4 | 12441 | const CORE_ADDR addr = ada_exception_name_addr (c->m_kind, b); |
956a9fb9 JB |
12442 | char exception_name[256]; |
12443 | ||
12444 | if (addr != 0) | |
12445 | { | |
c714b426 PA |
12446 | read_memory (addr, (gdb_byte *) exception_name, |
12447 | sizeof (exception_name) - 1); | |
956a9fb9 JB |
12448 | exception_name [sizeof (exception_name) - 1] = '\0'; |
12449 | } | |
12450 | else | |
12451 | { | |
12452 | /* For some reason, we were unable to read the exception | |
12453 | name. This could happen if the Runtime was compiled | |
12454 | without debugging info, for instance. In that case, | |
12455 | just replace the exception name by the generic string | |
12456 | "exception" - it will read as "an exception" in the | |
12457 | notification we are about to print. */ | |
967cff16 | 12458 | memcpy (exception_name, "exception", sizeof ("exception")); |
956a9fb9 JB |
12459 | } |
12460 | /* In the case of unhandled exception breakpoints, we print | |
12461 | the exception name as "unhandled EXCEPTION_NAME", to make | |
12462 | it clearer to the user which kind of catchpoint just got | |
12463 | hit. We used ui_out_text to make sure that this extra | |
12464 | info does not pollute the exception name in the MI case. */ | |
37f6a7f4 | 12465 | if (c->m_kind == ada_catch_exception_unhandled) |
112e8700 SM |
12466 | uiout->text ("unhandled "); |
12467 | uiout->field_string ("exception-name", exception_name); | |
956a9fb9 JB |
12468 | } |
12469 | break; | |
761269c8 | 12470 | case ada_catch_assert: |
956a9fb9 JB |
12471 | /* In this case, the name of the exception is not really |
12472 | important. Just print "failed assertion" to make it clearer | |
12473 | that his program just hit an assertion-failure catchpoint. | |
12474 | We used ui_out_text because this info does not belong in | |
12475 | the MI output. */ | |
112e8700 | 12476 | uiout->text ("failed assertion"); |
956a9fb9 | 12477 | break; |
f7f9143b | 12478 | } |
e547c119 | 12479 | |
6f46ac85 | 12480 | gdb::unique_xmalloc_ptr<char> exception_message = ada_exception_message (); |
e547c119 JB |
12481 | if (exception_message != NULL) |
12482 | { | |
e547c119 | 12483 | uiout->text (" ("); |
6f46ac85 | 12484 | uiout->field_string ("exception-message", exception_message.get ()); |
e547c119 | 12485 | uiout->text (")"); |
e547c119 JB |
12486 | } |
12487 | ||
112e8700 | 12488 | uiout->text (" at "); |
956a9fb9 | 12489 | ada_find_printable_frame (get_current_frame ()); |
f7f9143b JB |
12490 | |
12491 | return PRINT_SRC_AND_LOC; | |
12492 | } | |
12493 | ||
12494 | /* Implement the PRINT_ONE method in the breakpoint_ops structure | |
12495 | for all exception catchpoint kinds. */ | |
12496 | ||
12497 | static void | |
37f6a7f4 | 12498 | print_one_exception (struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12499 | { |
79a45e25 | 12500 | struct ui_out *uiout = current_uiout; |
28010a5d | 12501 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
79a45b7d TT |
12502 | struct value_print_options opts; |
12503 | ||
12504 | get_user_print_options (&opts); | |
f06f1252 | 12505 | |
79a45b7d | 12506 | if (opts.addressprint) |
f06f1252 | 12507 | uiout->field_skip ("addr"); |
f7f9143b JB |
12508 | |
12509 | annotate_field (5); | |
37f6a7f4 | 12510 | switch (c->m_kind) |
f7f9143b | 12511 | { |
761269c8 | 12512 | case ada_catch_exception: |
bc18fbb5 | 12513 | if (!c->excep_string.empty ()) |
f7f9143b | 12514 | { |
bc18fbb5 TT |
12515 | std::string msg = string_printf (_("`%s' Ada exception"), |
12516 | c->excep_string.c_str ()); | |
28010a5d | 12517 | |
112e8700 | 12518 | uiout->field_string ("what", msg); |
f7f9143b JB |
12519 | } |
12520 | else | |
112e8700 | 12521 | uiout->field_string ("what", "all Ada exceptions"); |
f7f9143b JB |
12522 | |
12523 | break; | |
12524 | ||
761269c8 | 12525 | case ada_catch_exception_unhandled: |
112e8700 | 12526 | uiout->field_string ("what", "unhandled Ada exceptions"); |
f7f9143b JB |
12527 | break; |
12528 | ||
9f757bf7 | 12529 | case ada_catch_handlers: |
bc18fbb5 | 12530 | if (!c->excep_string.empty ()) |
9f757bf7 XR |
12531 | { |
12532 | uiout->field_fmt ("what", | |
12533 | _("`%s' Ada exception handlers"), | |
bc18fbb5 | 12534 | c->excep_string.c_str ()); |
9f757bf7 XR |
12535 | } |
12536 | else | |
12537 | uiout->field_string ("what", "all Ada exceptions handlers"); | |
12538 | break; | |
12539 | ||
761269c8 | 12540 | case ada_catch_assert: |
112e8700 | 12541 | uiout->field_string ("what", "failed Ada assertions"); |
f7f9143b JB |
12542 | break; |
12543 | ||
12544 | default: | |
12545 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12546 | break; | |
12547 | } | |
12548 | } | |
12549 | ||
12550 | /* Implement the PRINT_MENTION method in the breakpoint_ops structure | |
12551 | for all exception catchpoint kinds. */ | |
12552 | ||
12553 | static void | |
37f6a7f4 | 12554 | print_mention_exception (struct breakpoint *b) |
f7f9143b | 12555 | { |
28010a5d | 12556 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
79a45e25 | 12557 | struct ui_out *uiout = current_uiout; |
28010a5d | 12558 | |
112e8700 | 12559 | uiout->text (b->disposition == disp_del ? _("Temporary catchpoint ") |
00eb2c4a | 12560 | : _("Catchpoint ")); |
381befee | 12561 | uiout->field_signed ("bkptno", b->number); |
112e8700 | 12562 | uiout->text (": "); |
00eb2c4a | 12563 | |
37f6a7f4 | 12564 | switch (c->m_kind) |
f7f9143b | 12565 | { |
761269c8 | 12566 | case ada_catch_exception: |
bc18fbb5 | 12567 | if (!c->excep_string.empty ()) |
00eb2c4a | 12568 | { |
862d101a | 12569 | std::string info = string_printf (_("`%s' Ada exception"), |
bc18fbb5 | 12570 | c->excep_string.c_str ()); |
862d101a | 12571 | uiout->text (info.c_str ()); |
00eb2c4a | 12572 | } |
f7f9143b | 12573 | else |
112e8700 | 12574 | uiout->text (_("all Ada exceptions")); |
f7f9143b JB |
12575 | break; |
12576 | ||
761269c8 | 12577 | case ada_catch_exception_unhandled: |
112e8700 | 12578 | uiout->text (_("unhandled Ada exceptions")); |
f7f9143b | 12579 | break; |
9f757bf7 XR |
12580 | |
12581 | case ada_catch_handlers: | |
bc18fbb5 | 12582 | if (!c->excep_string.empty ()) |
9f757bf7 XR |
12583 | { |
12584 | std::string info | |
12585 | = string_printf (_("`%s' Ada exception handlers"), | |
bc18fbb5 | 12586 | c->excep_string.c_str ()); |
9f757bf7 XR |
12587 | uiout->text (info.c_str ()); |
12588 | } | |
12589 | else | |
12590 | uiout->text (_("all Ada exceptions handlers")); | |
12591 | break; | |
12592 | ||
761269c8 | 12593 | case ada_catch_assert: |
112e8700 | 12594 | uiout->text (_("failed Ada assertions")); |
f7f9143b JB |
12595 | break; |
12596 | ||
12597 | default: | |
12598 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12599 | break; | |
12600 | } | |
12601 | } | |
12602 | ||
6149aea9 PA |
12603 | /* Implement the PRINT_RECREATE method in the breakpoint_ops structure |
12604 | for all exception catchpoint kinds. */ | |
12605 | ||
12606 | static void | |
37f6a7f4 | 12607 | print_recreate_exception (struct breakpoint *b, struct ui_file *fp) |
6149aea9 | 12608 | { |
28010a5d PA |
12609 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
12610 | ||
37f6a7f4 | 12611 | switch (c->m_kind) |
6149aea9 | 12612 | { |
761269c8 | 12613 | case ada_catch_exception: |
6149aea9 | 12614 | fprintf_filtered (fp, "catch exception"); |
bc18fbb5 TT |
12615 | if (!c->excep_string.empty ()) |
12616 | fprintf_filtered (fp, " %s", c->excep_string.c_str ()); | |
6149aea9 PA |
12617 | break; |
12618 | ||
761269c8 | 12619 | case ada_catch_exception_unhandled: |
78076abc | 12620 | fprintf_filtered (fp, "catch exception unhandled"); |
6149aea9 PA |
12621 | break; |
12622 | ||
9f757bf7 XR |
12623 | case ada_catch_handlers: |
12624 | fprintf_filtered (fp, "catch handlers"); | |
12625 | break; | |
12626 | ||
761269c8 | 12627 | case ada_catch_assert: |
6149aea9 PA |
12628 | fprintf_filtered (fp, "catch assert"); |
12629 | break; | |
12630 | ||
12631 | default: | |
12632 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12633 | } | |
d9b3f62e | 12634 | print_recreate_thread (b, fp); |
6149aea9 PA |
12635 | } |
12636 | ||
37f6a7f4 | 12637 | /* Virtual tables for various breakpoint types. */ |
2060206e | 12638 | static struct breakpoint_ops catch_exception_breakpoint_ops; |
2060206e | 12639 | static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops; |
2060206e | 12640 | static struct breakpoint_ops catch_assert_breakpoint_ops; |
9f757bf7 XR |
12641 | static struct breakpoint_ops catch_handlers_breakpoint_ops; |
12642 | ||
f06f1252 TT |
12643 | /* See ada-lang.h. */ |
12644 | ||
12645 | bool | |
12646 | is_ada_exception_catchpoint (breakpoint *bp) | |
12647 | { | |
12648 | return (bp->ops == &catch_exception_breakpoint_ops | |
12649 | || bp->ops == &catch_exception_unhandled_breakpoint_ops | |
12650 | || bp->ops == &catch_assert_breakpoint_ops | |
12651 | || bp->ops == &catch_handlers_breakpoint_ops); | |
12652 | } | |
12653 | ||
f7f9143b JB |
12654 | /* Split the arguments specified in a "catch exception" command. |
12655 | Set EX to the appropriate catchpoint type. | |
28010a5d | 12656 | Set EXCEP_STRING to the name of the specific exception if |
5845583d | 12657 | specified by the user. |
9f757bf7 XR |
12658 | IS_CATCH_HANDLERS_CMD: True if the arguments are for a |
12659 | "catch handlers" command. False otherwise. | |
5845583d JB |
12660 | If a condition is found at the end of the arguments, the condition |
12661 | expression is stored in COND_STRING (memory must be deallocated | |
12662 | after use). Otherwise COND_STRING is set to NULL. */ | |
f7f9143b JB |
12663 | |
12664 | static void | |
a121b7c1 | 12665 | catch_ada_exception_command_split (const char *args, |
9f757bf7 | 12666 | bool is_catch_handlers_cmd, |
761269c8 | 12667 | enum ada_exception_catchpoint_kind *ex, |
bc18fbb5 TT |
12668 | std::string *excep_string, |
12669 | std::string *cond_string) | |
f7f9143b | 12670 | { |
bc18fbb5 | 12671 | std::string exception_name; |
f7f9143b | 12672 | |
bc18fbb5 TT |
12673 | exception_name = extract_arg (&args); |
12674 | if (exception_name == "if") | |
5845583d JB |
12675 | { |
12676 | /* This is not an exception name; this is the start of a condition | |
12677 | expression for a catchpoint on all exceptions. So, "un-get" | |
12678 | this token, and set exception_name to NULL. */ | |
bc18fbb5 | 12679 | exception_name.clear (); |
5845583d JB |
12680 | args -= 2; |
12681 | } | |
f7f9143b | 12682 | |
5845583d | 12683 | /* Check to see if we have a condition. */ |
f7f9143b | 12684 | |
f1735a53 | 12685 | args = skip_spaces (args); |
61012eef | 12686 | if (startswith (args, "if") |
5845583d JB |
12687 | && (isspace (args[2]) || args[2] == '\0')) |
12688 | { | |
12689 | args += 2; | |
f1735a53 | 12690 | args = skip_spaces (args); |
5845583d JB |
12691 | |
12692 | if (args[0] == '\0') | |
12693 | error (_("Condition missing after `if' keyword")); | |
bc18fbb5 | 12694 | *cond_string = args; |
5845583d JB |
12695 | |
12696 | args += strlen (args); | |
12697 | } | |
12698 | ||
12699 | /* Check that we do not have any more arguments. Anything else | |
12700 | is unexpected. */ | |
f7f9143b JB |
12701 | |
12702 | if (args[0] != '\0') | |
12703 | error (_("Junk at end of expression")); | |
12704 | ||
9f757bf7 XR |
12705 | if (is_catch_handlers_cmd) |
12706 | { | |
12707 | /* Catch handling of exceptions. */ | |
12708 | *ex = ada_catch_handlers; | |
12709 | *excep_string = exception_name; | |
12710 | } | |
bc18fbb5 | 12711 | else if (exception_name.empty ()) |
f7f9143b JB |
12712 | { |
12713 | /* Catch all exceptions. */ | |
761269c8 | 12714 | *ex = ada_catch_exception; |
bc18fbb5 | 12715 | excep_string->clear (); |
f7f9143b | 12716 | } |
bc18fbb5 | 12717 | else if (exception_name == "unhandled") |
f7f9143b JB |
12718 | { |
12719 | /* Catch unhandled exceptions. */ | |
761269c8 | 12720 | *ex = ada_catch_exception_unhandled; |
bc18fbb5 | 12721 | excep_string->clear (); |
f7f9143b JB |
12722 | } |
12723 | else | |
12724 | { | |
12725 | /* Catch a specific exception. */ | |
761269c8 | 12726 | *ex = ada_catch_exception; |
28010a5d | 12727 | *excep_string = exception_name; |
f7f9143b JB |
12728 | } |
12729 | } | |
12730 | ||
12731 | /* Return the name of the symbol on which we should break in order to | |
12732 | implement a catchpoint of the EX kind. */ | |
12733 | ||
12734 | static const char * | |
761269c8 | 12735 | ada_exception_sym_name (enum ada_exception_catchpoint_kind ex) |
f7f9143b | 12736 | { |
3eecfa55 JB |
12737 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
12738 | ||
12739 | gdb_assert (data->exception_info != NULL); | |
0259addd | 12740 | |
f7f9143b JB |
12741 | switch (ex) |
12742 | { | |
761269c8 | 12743 | case ada_catch_exception: |
3eecfa55 | 12744 | return (data->exception_info->catch_exception_sym); |
f7f9143b | 12745 | break; |
761269c8 | 12746 | case ada_catch_exception_unhandled: |
3eecfa55 | 12747 | return (data->exception_info->catch_exception_unhandled_sym); |
f7f9143b | 12748 | break; |
761269c8 | 12749 | case ada_catch_assert: |
3eecfa55 | 12750 | return (data->exception_info->catch_assert_sym); |
f7f9143b | 12751 | break; |
9f757bf7 XR |
12752 | case ada_catch_handlers: |
12753 | return (data->exception_info->catch_handlers_sym); | |
12754 | break; | |
f7f9143b JB |
12755 | default: |
12756 | internal_error (__FILE__, __LINE__, | |
12757 | _("unexpected catchpoint kind (%d)"), ex); | |
12758 | } | |
12759 | } | |
12760 | ||
12761 | /* Return the breakpoint ops "virtual table" used for catchpoints | |
12762 | of the EX kind. */ | |
12763 | ||
c0a91b2b | 12764 | static const struct breakpoint_ops * |
761269c8 | 12765 | ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex) |
f7f9143b JB |
12766 | { |
12767 | switch (ex) | |
12768 | { | |
761269c8 | 12769 | case ada_catch_exception: |
f7f9143b JB |
12770 | return (&catch_exception_breakpoint_ops); |
12771 | break; | |
761269c8 | 12772 | case ada_catch_exception_unhandled: |
f7f9143b JB |
12773 | return (&catch_exception_unhandled_breakpoint_ops); |
12774 | break; | |
761269c8 | 12775 | case ada_catch_assert: |
f7f9143b JB |
12776 | return (&catch_assert_breakpoint_ops); |
12777 | break; | |
9f757bf7 XR |
12778 | case ada_catch_handlers: |
12779 | return (&catch_handlers_breakpoint_ops); | |
12780 | break; | |
f7f9143b JB |
12781 | default: |
12782 | internal_error (__FILE__, __LINE__, | |
12783 | _("unexpected catchpoint kind (%d)"), ex); | |
12784 | } | |
12785 | } | |
12786 | ||
12787 | /* Return the condition that will be used to match the current exception | |
12788 | being raised with the exception that the user wants to catch. This | |
12789 | assumes that this condition is used when the inferior just triggered | |
12790 | an exception catchpoint. | |
cb7de75e | 12791 | EX: the type of catchpoints used for catching Ada exceptions. */ |
f7f9143b | 12792 | |
cb7de75e | 12793 | static std::string |
9f757bf7 XR |
12794 | ada_exception_catchpoint_cond_string (const char *excep_string, |
12795 | enum ada_exception_catchpoint_kind ex) | |
f7f9143b | 12796 | { |
3d0b0fa3 | 12797 | int i; |
fccf9de1 | 12798 | bool is_standard_exc = false; |
cb7de75e | 12799 | std::string result; |
9f757bf7 XR |
12800 | |
12801 | if (ex == ada_catch_handlers) | |
12802 | { | |
12803 | /* For exception handlers catchpoints, the condition string does | |
12804 | not use the same parameter as for the other exceptions. */ | |
fccf9de1 TT |
12805 | result = ("long_integer (GNAT_GCC_exception_Access" |
12806 | "(gcc_exception).all.occurrence.id)"); | |
9f757bf7 XR |
12807 | } |
12808 | else | |
fccf9de1 | 12809 | result = "long_integer (e)"; |
3d0b0fa3 | 12810 | |
0963b4bd | 12811 | /* The standard exceptions are a special case. They are defined in |
3d0b0fa3 | 12812 | runtime units that have been compiled without debugging info; if |
28010a5d | 12813 | EXCEP_STRING is the not-fully-qualified name of a standard |
3d0b0fa3 JB |
12814 | exception (e.g. "constraint_error") then, during the evaluation |
12815 | of the condition expression, the symbol lookup on this name would | |
0963b4bd | 12816 | *not* return this standard exception. The catchpoint condition |
3d0b0fa3 JB |
12817 | may then be set only on user-defined exceptions which have the |
12818 | same not-fully-qualified name (e.g. my_package.constraint_error). | |
12819 | ||
12820 | To avoid this unexcepted behavior, these standard exceptions are | |
0963b4bd | 12821 | systematically prefixed by "standard". This means that "catch |
3d0b0fa3 JB |
12822 | exception constraint_error" is rewritten into "catch exception |
12823 | standard.constraint_error". | |
12824 | ||
85102364 | 12825 | If an exception named constraint_error is defined in another package of |
3d0b0fa3 JB |
12826 | the inferior program, then the only way to specify this exception as a |
12827 | breakpoint condition is to use its fully-qualified named: | |
fccf9de1 | 12828 | e.g. my_package.constraint_error. */ |
3d0b0fa3 JB |
12829 | |
12830 | for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++) | |
12831 | { | |
28010a5d | 12832 | if (strcmp (standard_exc [i], excep_string) == 0) |
3d0b0fa3 | 12833 | { |
fccf9de1 | 12834 | is_standard_exc = true; |
9f757bf7 | 12835 | break; |
3d0b0fa3 JB |
12836 | } |
12837 | } | |
9f757bf7 | 12838 | |
fccf9de1 TT |
12839 | result += " = "; |
12840 | ||
12841 | if (is_standard_exc) | |
12842 | string_appendf (result, "long_integer (&standard.%s)", excep_string); | |
12843 | else | |
12844 | string_appendf (result, "long_integer (&%s)", excep_string); | |
9f757bf7 | 12845 | |
9f757bf7 | 12846 | return result; |
f7f9143b JB |
12847 | } |
12848 | ||
12849 | /* Return the symtab_and_line that should be used to insert an exception | |
12850 | catchpoint of the TYPE kind. | |
12851 | ||
28010a5d PA |
12852 | ADDR_STRING returns the name of the function where the real |
12853 | breakpoint that implements the catchpoints is set, depending on the | |
12854 | type of catchpoint we need to create. */ | |
f7f9143b JB |
12855 | |
12856 | static struct symtab_and_line | |
bc18fbb5 | 12857 | ada_exception_sal (enum ada_exception_catchpoint_kind ex, |
cc12f4a8 | 12858 | std::string *addr_string, const struct breakpoint_ops **ops) |
f7f9143b JB |
12859 | { |
12860 | const char *sym_name; | |
12861 | struct symbol *sym; | |
f7f9143b | 12862 | |
0259addd JB |
12863 | /* First, find out which exception support info to use. */ |
12864 | ada_exception_support_info_sniffer (); | |
12865 | ||
12866 | /* Then lookup the function on which we will break in order to catch | |
f7f9143b | 12867 | the Ada exceptions requested by the user. */ |
f7f9143b JB |
12868 | sym_name = ada_exception_sym_name (ex); |
12869 | sym = standard_lookup (sym_name, NULL, VAR_DOMAIN); | |
12870 | ||
57aff202 JB |
12871 | if (sym == NULL) |
12872 | error (_("Catchpoint symbol not found: %s"), sym_name); | |
12873 | ||
12874 | if (SYMBOL_CLASS (sym) != LOC_BLOCK) | |
12875 | error (_("Unable to insert catchpoint. %s is not a function."), sym_name); | |
f7f9143b JB |
12876 | |
12877 | /* Set ADDR_STRING. */ | |
cc12f4a8 | 12878 | *addr_string = sym_name; |
f7f9143b | 12879 | |
f7f9143b | 12880 | /* Set OPS. */ |
4b9eee8c | 12881 | *ops = ada_exception_breakpoint_ops (ex); |
f7f9143b | 12882 | |
f17011e0 | 12883 | return find_function_start_sal (sym, 1); |
f7f9143b JB |
12884 | } |
12885 | ||
b4a5b78b | 12886 | /* Create an Ada exception catchpoint. |
f7f9143b | 12887 | |
b4a5b78b | 12888 | EX_KIND is the kind of exception catchpoint to be created. |
5845583d | 12889 | |
bc18fbb5 | 12890 | If EXCEPT_STRING is empty, this catchpoint is expected to trigger |
2df4d1d5 | 12891 | for all exceptions. Otherwise, EXCEPT_STRING indicates the name |
bc18fbb5 | 12892 | of the exception to which this catchpoint applies. |
2df4d1d5 | 12893 | |
bc18fbb5 | 12894 | COND_STRING, if not empty, is the catchpoint condition. |
f7f9143b | 12895 | |
b4a5b78b JB |
12896 | TEMPFLAG, if nonzero, means that the underlying breakpoint |
12897 | should be temporary. | |
28010a5d | 12898 | |
b4a5b78b | 12899 | FROM_TTY is the usual argument passed to all commands implementations. */ |
28010a5d | 12900 | |
349774ef | 12901 | void |
28010a5d | 12902 | create_ada_exception_catchpoint (struct gdbarch *gdbarch, |
761269c8 | 12903 | enum ada_exception_catchpoint_kind ex_kind, |
bc18fbb5 | 12904 | const std::string &excep_string, |
56ecd069 | 12905 | const std::string &cond_string, |
28010a5d | 12906 | int tempflag, |
349774ef | 12907 | int disabled, |
28010a5d PA |
12908 | int from_tty) |
12909 | { | |
cc12f4a8 | 12910 | std::string addr_string; |
b4a5b78b | 12911 | const struct breakpoint_ops *ops = NULL; |
bc18fbb5 | 12912 | struct symtab_and_line sal = ada_exception_sal (ex_kind, &addr_string, &ops); |
28010a5d | 12913 | |
37f6a7f4 | 12914 | std::unique_ptr<ada_catchpoint> c (new ada_catchpoint (ex_kind)); |
cc12f4a8 | 12915 | init_ada_exception_breakpoint (c.get (), gdbarch, sal, addr_string.c_str (), |
349774ef | 12916 | ops, tempflag, disabled, from_tty); |
28010a5d | 12917 | c->excep_string = excep_string; |
9f757bf7 | 12918 | create_excep_cond_exprs (c.get (), ex_kind); |
56ecd069 XR |
12919 | if (!cond_string.empty ()) |
12920 | set_breakpoint_condition (c.get (), cond_string.c_str (), from_tty); | |
b270e6f9 | 12921 | install_breakpoint (0, std::move (c), 1); |
f7f9143b JB |
12922 | } |
12923 | ||
9ac4176b PA |
12924 | /* Implement the "catch exception" command. */ |
12925 | ||
12926 | static void | |
eb4c3f4a | 12927 | catch_ada_exception_command (const char *arg_entry, int from_tty, |
9ac4176b PA |
12928 | struct cmd_list_element *command) |
12929 | { | |
a121b7c1 | 12930 | const char *arg = arg_entry; |
9ac4176b PA |
12931 | struct gdbarch *gdbarch = get_current_arch (); |
12932 | int tempflag; | |
761269c8 | 12933 | enum ada_exception_catchpoint_kind ex_kind; |
bc18fbb5 | 12934 | std::string excep_string; |
56ecd069 | 12935 | std::string cond_string; |
9ac4176b PA |
12936 | |
12937 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
12938 | ||
12939 | if (!arg) | |
12940 | arg = ""; | |
9f757bf7 | 12941 | catch_ada_exception_command_split (arg, false, &ex_kind, &excep_string, |
bc18fbb5 | 12942 | &cond_string); |
9f757bf7 XR |
12943 | create_ada_exception_catchpoint (gdbarch, ex_kind, |
12944 | excep_string, cond_string, | |
12945 | tempflag, 1 /* enabled */, | |
12946 | from_tty); | |
12947 | } | |
12948 | ||
12949 | /* Implement the "catch handlers" command. */ | |
12950 | ||
12951 | static void | |
12952 | catch_ada_handlers_command (const char *arg_entry, int from_tty, | |
12953 | struct cmd_list_element *command) | |
12954 | { | |
12955 | const char *arg = arg_entry; | |
12956 | struct gdbarch *gdbarch = get_current_arch (); | |
12957 | int tempflag; | |
12958 | enum ada_exception_catchpoint_kind ex_kind; | |
bc18fbb5 | 12959 | std::string excep_string; |
56ecd069 | 12960 | std::string cond_string; |
9f757bf7 XR |
12961 | |
12962 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
12963 | ||
12964 | if (!arg) | |
12965 | arg = ""; | |
12966 | catch_ada_exception_command_split (arg, true, &ex_kind, &excep_string, | |
bc18fbb5 | 12967 | &cond_string); |
b4a5b78b JB |
12968 | create_ada_exception_catchpoint (gdbarch, ex_kind, |
12969 | excep_string, cond_string, | |
349774ef JB |
12970 | tempflag, 1 /* enabled */, |
12971 | from_tty); | |
9ac4176b PA |
12972 | } |
12973 | ||
71bed2db TT |
12974 | /* Completion function for the Ada "catch" commands. */ |
12975 | ||
12976 | static void | |
12977 | catch_ada_completer (struct cmd_list_element *cmd, completion_tracker &tracker, | |
12978 | const char *text, const char *word) | |
12979 | { | |
12980 | std::vector<ada_exc_info> exceptions = ada_exceptions_list (NULL); | |
12981 | ||
12982 | for (const ada_exc_info &info : exceptions) | |
12983 | { | |
12984 | if (startswith (info.name, word)) | |
b02f78f9 | 12985 | tracker.add_completion (make_unique_xstrdup (info.name)); |
71bed2db TT |
12986 | } |
12987 | } | |
12988 | ||
b4a5b78b | 12989 | /* Split the arguments specified in a "catch assert" command. |
5845583d | 12990 | |
b4a5b78b JB |
12991 | ARGS contains the command's arguments (or the empty string if |
12992 | no arguments were passed). | |
5845583d JB |
12993 | |
12994 | If ARGS contains a condition, set COND_STRING to that condition | |
b4a5b78b | 12995 | (the memory needs to be deallocated after use). */ |
5845583d | 12996 | |
b4a5b78b | 12997 | static void |
56ecd069 | 12998 | catch_ada_assert_command_split (const char *args, std::string &cond_string) |
f7f9143b | 12999 | { |
f1735a53 | 13000 | args = skip_spaces (args); |
f7f9143b | 13001 | |
5845583d | 13002 | /* Check whether a condition was provided. */ |
61012eef | 13003 | if (startswith (args, "if") |
5845583d | 13004 | && (isspace (args[2]) || args[2] == '\0')) |
f7f9143b | 13005 | { |
5845583d | 13006 | args += 2; |
f1735a53 | 13007 | args = skip_spaces (args); |
5845583d JB |
13008 | if (args[0] == '\0') |
13009 | error (_("condition missing after `if' keyword")); | |
56ecd069 | 13010 | cond_string.assign (args); |
f7f9143b JB |
13011 | } |
13012 | ||
5845583d JB |
13013 | /* Otherwise, there should be no other argument at the end of |
13014 | the command. */ | |
13015 | else if (args[0] != '\0') | |
13016 | error (_("Junk at end of arguments.")); | |
f7f9143b JB |
13017 | } |
13018 | ||
9ac4176b PA |
13019 | /* Implement the "catch assert" command. */ |
13020 | ||
13021 | static void | |
eb4c3f4a | 13022 | catch_assert_command (const char *arg_entry, int from_tty, |
9ac4176b PA |
13023 | struct cmd_list_element *command) |
13024 | { | |
a121b7c1 | 13025 | const char *arg = arg_entry; |
9ac4176b PA |
13026 | struct gdbarch *gdbarch = get_current_arch (); |
13027 | int tempflag; | |
56ecd069 | 13028 | std::string cond_string; |
9ac4176b PA |
13029 | |
13030 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
13031 | ||
13032 | if (!arg) | |
13033 | arg = ""; | |
56ecd069 | 13034 | catch_ada_assert_command_split (arg, cond_string); |
761269c8 | 13035 | create_ada_exception_catchpoint (gdbarch, ada_catch_assert, |
241db429 | 13036 | "", cond_string, |
349774ef JB |
13037 | tempflag, 1 /* enabled */, |
13038 | from_tty); | |
9ac4176b | 13039 | } |
778865d3 JB |
13040 | |
13041 | /* Return non-zero if the symbol SYM is an Ada exception object. */ | |
13042 | ||
13043 | static int | |
13044 | ada_is_exception_sym (struct symbol *sym) | |
13045 | { | |
7d93a1e0 | 13046 | const char *type_name = SYMBOL_TYPE (sym)->name (); |
778865d3 JB |
13047 | |
13048 | return (SYMBOL_CLASS (sym) != LOC_TYPEDEF | |
13049 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
13050 | && SYMBOL_CLASS (sym) != LOC_CONST | |
13051 | && SYMBOL_CLASS (sym) != LOC_UNRESOLVED | |
13052 | && type_name != NULL && strcmp (type_name, "exception") == 0); | |
13053 | } | |
13054 | ||
13055 | /* Given a global symbol SYM, return non-zero iff SYM is a non-standard | |
13056 | Ada exception object. This matches all exceptions except the ones | |
13057 | defined by the Ada language. */ | |
13058 | ||
13059 | static int | |
13060 | ada_is_non_standard_exception_sym (struct symbol *sym) | |
13061 | { | |
13062 | int i; | |
13063 | ||
13064 | if (!ada_is_exception_sym (sym)) | |
13065 | return 0; | |
13066 | ||
13067 | for (i = 0; i < ARRAY_SIZE (standard_exc); i++) | |
987012b8 | 13068 | if (strcmp (sym->linkage_name (), standard_exc[i]) == 0) |
778865d3 JB |
13069 | return 0; /* A standard exception. */ |
13070 | ||
13071 | /* Numeric_Error is also a standard exception, so exclude it. | |
13072 | See the STANDARD_EXC description for more details as to why | |
13073 | this exception is not listed in that array. */ | |
987012b8 | 13074 | if (strcmp (sym->linkage_name (), "numeric_error") == 0) |
778865d3 JB |
13075 | return 0; |
13076 | ||
13077 | return 1; | |
13078 | } | |
13079 | ||
ab816a27 | 13080 | /* A helper function for std::sort, comparing two struct ada_exc_info |
778865d3 JB |
13081 | objects. |
13082 | ||
13083 | The comparison is determined first by exception name, and then | |
13084 | by exception address. */ | |
13085 | ||
ab816a27 | 13086 | bool |
cc536b21 | 13087 | ada_exc_info::operator< (const ada_exc_info &other) const |
778865d3 | 13088 | { |
778865d3 JB |
13089 | int result; |
13090 | ||
ab816a27 TT |
13091 | result = strcmp (name, other.name); |
13092 | if (result < 0) | |
13093 | return true; | |
13094 | if (result == 0 && addr < other.addr) | |
13095 | return true; | |
13096 | return false; | |
13097 | } | |
778865d3 | 13098 | |
ab816a27 | 13099 | bool |
cc536b21 | 13100 | ada_exc_info::operator== (const ada_exc_info &other) const |
ab816a27 TT |
13101 | { |
13102 | return addr == other.addr && strcmp (name, other.name) == 0; | |
778865d3 JB |
13103 | } |
13104 | ||
13105 | /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison | |
13106 | routine, but keeping the first SKIP elements untouched. | |
13107 | ||
13108 | All duplicates are also removed. */ | |
13109 | ||
13110 | static void | |
ab816a27 | 13111 | sort_remove_dups_ada_exceptions_list (std::vector<ada_exc_info> *exceptions, |
778865d3 JB |
13112 | int skip) |
13113 | { | |
ab816a27 TT |
13114 | std::sort (exceptions->begin () + skip, exceptions->end ()); |
13115 | exceptions->erase (std::unique (exceptions->begin () + skip, exceptions->end ()), | |
13116 | exceptions->end ()); | |
778865d3 JB |
13117 | } |
13118 | ||
778865d3 JB |
13119 | /* Add all exceptions defined by the Ada standard whose name match |
13120 | a regular expression. | |
13121 | ||
13122 | If PREG is not NULL, then this regexp_t object is used to | |
13123 | perform the symbol name matching. Otherwise, no name-based | |
13124 | filtering is performed. | |
13125 | ||
13126 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13127 | gets pushed. */ | |
13128 | ||
13129 | static void | |
2d7cc5c7 | 13130 | ada_add_standard_exceptions (compiled_regex *preg, |
ab816a27 | 13131 | std::vector<ada_exc_info> *exceptions) |
778865d3 JB |
13132 | { |
13133 | int i; | |
13134 | ||
13135 | for (i = 0; i < ARRAY_SIZE (standard_exc); i++) | |
13136 | { | |
13137 | if (preg == NULL | |
2d7cc5c7 | 13138 | || preg->exec (standard_exc[i], 0, NULL, 0) == 0) |
778865d3 JB |
13139 | { |
13140 | struct bound_minimal_symbol msymbol | |
13141 | = ada_lookup_simple_minsym (standard_exc[i]); | |
13142 | ||
13143 | if (msymbol.minsym != NULL) | |
13144 | { | |
13145 | struct ada_exc_info info | |
77e371c0 | 13146 | = {standard_exc[i], BMSYMBOL_VALUE_ADDRESS (msymbol)}; |
778865d3 | 13147 | |
ab816a27 | 13148 | exceptions->push_back (info); |
778865d3 JB |
13149 | } |
13150 | } | |
13151 | } | |
13152 | } | |
13153 | ||
13154 | /* Add all Ada exceptions defined locally and accessible from the given | |
13155 | FRAME. | |
13156 | ||
13157 | If PREG is not NULL, then this regexp_t object is used to | |
13158 | perform the symbol name matching. Otherwise, no name-based | |
13159 | filtering is performed. | |
13160 | ||
13161 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13162 | gets pushed. */ | |
13163 | ||
13164 | static void | |
2d7cc5c7 PA |
13165 | ada_add_exceptions_from_frame (compiled_regex *preg, |
13166 | struct frame_info *frame, | |
ab816a27 | 13167 | std::vector<ada_exc_info> *exceptions) |
778865d3 | 13168 | { |
3977b71f | 13169 | const struct block *block = get_frame_block (frame, 0); |
778865d3 JB |
13170 | |
13171 | while (block != 0) | |
13172 | { | |
13173 | struct block_iterator iter; | |
13174 | struct symbol *sym; | |
13175 | ||
13176 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
13177 | { | |
13178 | switch (SYMBOL_CLASS (sym)) | |
13179 | { | |
13180 | case LOC_TYPEDEF: | |
13181 | case LOC_BLOCK: | |
13182 | case LOC_CONST: | |
13183 | break; | |
13184 | default: | |
13185 | if (ada_is_exception_sym (sym)) | |
13186 | { | |
987012b8 | 13187 | struct ada_exc_info info = {sym->print_name (), |
778865d3 JB |
13188 | SYMBOL_VALUE_ADDRESS (sym)}; |
13189 | ||
ab816a27 | 13190 | exceptions->push_back (info); |
778865d3 JB |
13191 | } |
13192 | } | |
13193 | } | |
13194 | if (BLOCK_FUNCTION (block) != NULL) | |
13195 | break; | |
13196 | block = BLOCK_SUPERBLOCK (block); | |
13197 | } | |
13198 | } | |
13199 | ||
14bc53a8 PA |
13200 | /* Return true if NAME matches PREG or if PREG is NULL. */ |
13201 | ||
13202 | static bool | |
2d7cc5c7 | 13203 | name_matches_regex (const char *name, compiled_regex *preg) |
14bc53a8 PA |
13204 | { |
13205 | return (preg == NULL | |
f945dedf | 13206 | || preg->exec (ada_decode (name).c_str (), 0, NULL, 0) == 0); |
14bc53a8 PA |
13207 | } |
13208 | ||
778865d3 JB |
13209 | /* Add all exceptions defined globally whose name name match |
13210 | a regular expression, excluding standard exceptions. | |
13211 | ||
13212 | The reason we exclude standard exceptions is that they need | |
13213 | to be handled separately: Standard exceptions are defined inside | |
13214 | a runtime unit which is normally not compiled with debugging info, | |
13215 | and thus usually do not show up in our symbol search. However, | |
13216 | if the unit was in fact built with debugging info, we need to | |
13217 | exclude them because they would duplicate the entry we found | |
13218 | during the special loop that specifically searches for those | |
13219 | standard exceptions. | |
13220 | ||
13221 | If PREG is not NULL, then this regexp_t object is used to | |
13222 | perform the symbol name matching. Otherwise, no name-based | |
13223 | filtering is performed. | |
13224 | ||
13225 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13226 | gets pushed. */ | |
13227 | ||
13228 | static void | |
2d7cc5c7 | 13229 | ada_add_global_exceptions (compiled_regex *preg, |
ab816a27 | 13230 | std::vector<ada_exc_info> *exceptions) |
778865d3 | 13231 | { |
14bc53a8 PA |
13232 | /* In Ada, the symbol "search name" is a linkage name, whereas the |
13233 | regular expression used to do the matching refers to the natural | |
13234 | name. So match against the decoded name. */ | |
13235 | expand_symtabs_matching (NULL, | |
b5ec771e | 13236 | lookup_name_info::match_any (), |
14bc53a8 PA |
13237 | [&] (const char *search_name) |
13238 | { | |
f945dedf CB |
13239 | std::string decoded = ada_decode (search_name); |
13240 | return name_matches_regex (decoded.c_str (), preg); | |
14bc53a8 PA |
13241 | }, |
13242 | NULL, | |
13243 | VARIABLES_DOMAIN); | |
778865d3 | 13244 | |
2030c079 | 13245 | for (objfile *objfile : current_program_space->objfiles ()) |
778865d3 | 13246 | { |
b669c953 | 13247 | for (compunit_symtab *s : objfile->compunits ()) |
778865d3 | 13248 | { |
d8aeb77f TT |
13249 | const struct blockvector *bv = COMPUNIT_BLOCKVECTOR (s); |
13250 | int i; | |
778865d3 | 13251 | |
d8aeb77f TT |
13252 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) |
13253 | { | |
582942f4 | 13254 | const struct block *b = BLOCKVECTOR_BLOCK (bv, i); |
d8aeb77f TT |
13255 | struct block_iterator iter; |
13256 | struct symbol *sym; | |
778865d3 | 13257 | |
d8aeb77f TT |
13258 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
13259 | if (ada_is_non_standard_exception_sym (sym) | |
987012b8 | 13260 | && name_matches_regex (sym->natural_name (), preg)) |
d8aeb77f TT |
13261 | { |
13262 | struct ada_exc_info info | |
987012b8 | 13263 | = {sym->print_name (), SYMBOL_VALUE_ADDRESS (sym)}; |
d8aeb77f TT |
13264 | |
13265 | exceptions->push_back (info); | |
13266 | } | |
13267 | } | |
778865d3 JB |
13268 | } |
13269 | } | |
13270 | } | |
13271 | ||
13272 | /* Implements ada_exceptions_list with the regular expression passed | |
13273 | as a regex_t, rather than a string. | |
13274 | ||
13275 | If not NULL, PREG is used to filter out exceptions whose names | |
13276 | do not match. Otherwise, all exceptions are listed. */ | |
13277 | ||
ab816a27 | 13278 | static std::vector<ada_exc_info> |
2d7cc5c7 | 13279 | ada_exceptions_list_1 (compiled_regex *preg) |
778865d3 | 13280 | { |
ab816a27 | 13281 | std::vector<ada_exc_info> result; |
778865d3 JB |
13282 | int prev_len; |
13283 | ||
13284 | /* First, list the known standard exceptions. These exceptions | |
13285 | need to be handled separately, as they are usually defined in | |
13286 | runtime units that have been compiled without debugging info. */ | |
13287 | ||
13288 | ada_add_standard_exceptions (preg, &result); | |
13289 | ||
13290 | /* Next, find all exceptions whose scope is local and accessible | |
13291 | from the currently selected frame. */ | |
13292 | ||
13293 | if (has_stack_frames ()) | |
13294 | { | |
ab816a27 | 13295 | prev_len = result.size (); |
778865d3 JB |
13296 | ada_add_exceptions_from_frame (preg, get_selected_frame (NULL), |
13297 | &result); | |
ab816a27 | 13298 | if (result.size () > prev_len) |
778865d3 JB |
13299 | sort_remove_dups_ada_exceptions_list (&result, prev_len); |
13300 | } | |
13301 | ||
13302 | /* Add all exceptions whose scope is global. */ | |
13303 | ||
ab816a27 | 13304 | prev_len = result.size (); |
778865d3 | 13305 | ada_add_global_exceptions (preg, &result); |
ab816a27 | 13306 | if (result.size () > prev_len) |
778865d3 JB |
13307 | sort_remove_dups_ada_exceptions_list (&result, prev_len); |
13308 | ||
778865d3 JB |
13309 | return result; |
13310 | } | |
13311 | ||
13312 | /* Return a vector of ada_exc_info. | |
13313 | ||
13314 | If REGEXP is NULL, all exceptions are included in the result. | |
13315 | Otherwise, it should contain a valid regular expression, | |
13316 | and only the exceptions whose names match that regular expression | |
13317 | are included in the result. | |
13318 | ||
13319 | The exceptions are sorted in the following order: | |
13320 | - Standard exceptions (defined by the Ada language), in | |
13321 | alphabetical order; | |
13322 | - Exceptions only visible from the current frame, in | |
13323 | alphabetical order; | |
13324 | - Exceptions whose scope is global, in alphabetical order. */ | |
13325 | ||
ab816a27 | 13326 | std::vector<ada_exc_info> |
778865d3 JB |
13327 | ada_exceptions_list (const char *regexp) |
13328 | { | |
2d7cc5c7 PA |
13329 | if (regexp == NULL) |
13330 | return ada_exceptions_list_1 (NULL); | |
778865d3 | 13331 | |
2d7cc5c7 PA |
13332 | compiled_regex reg (regexp, REG_NOSUB, _("invalid regular expression")); |
13333 | return ada_exceptions_list_1 (®); | |
778865d3 JB |
13334 | } |
13335 | ||
13336 | /* Implement the "info exceptions" command. */ | |
13337 | ||
13338 | static void | |
1d12d88f | 13339 | info_exceptions_command (const char *regexp, int from_tty) |
778865d3 | 13340 | { |
778865d3 | 13341 | struct gdbarch *gdbarch = get_current_arch (); |
778865d3 | 13342 | |
ab816a27 | 13343 | std::vector<ada_exc_info> exceptions = ada_exceptions_list (regexp); |
778865d3 JB |
13344 | |
13345 | if (regexp != NULL) | |
13346 | printf_filtered | |
13347 | (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp); | |
13348 | else | |
13349 | printf_filtered (_("All defined Ada exceptions:\n")); | |
13350 | ||
ab816a27 TT |
13351 | for (const ada_exc_info &info : exceptions) |
13352 | printf_filtered ("%s: %s\n", info.name, paddress (gdbarch, info.addr)); | |
778865d3 JB |
13353 | } |
13354 | ||
4c4b4cd2 PH |
13355 | /* Operators */ |
13356 | /* Information about operators given special treatment in functions | |
13357 | below. */ | |
13358 | /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */ | |
13359 | ||
13360 | #define ADA_OPERATORS \ | |
13361 | OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \ | |
13362 | OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \ | |
13363 | OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \ | |
13364 | OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \ | |
13365 | OP_DEFN (OP_ATR_LAST, 1, 2, 0) \ | |
13366 | OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \ | |
13367 | OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \ | |
13368 | OP_DEFN (OP_ATR_MAX, 1, 3, 0) \ | |
13369 | OP_DEFN (OP_ATR_MIN, 1, 3, 0) \ | |
13370 | OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \ | |
13371 | OP_DEFN (OP_ATR_POS, 1, 2, 0) \ | |
13372 | OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \ | |
13373 | OP_DEFN (OP_ATR_TAG, 1, 1, 0) \ | |
13374 | OP_DEFN (OP_ATR_VAL, 1, 2, 0) \ | |
13375 | OP_DEFN (UNOP_QUAL, 3, 1, 0) \ | |
52ce6436 PH |
13376 | OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \ |
13377 | OP_DEFN (OP_OTHERS, 1, 1, 0) \ | |
13378 | OP_DEFN (OP_POSITIONAL, 3, 1, 0) \ | |
13379 | OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0) | |
4c4b4cd2 PH |
13380 | |
13381 | static void | |
554794dc SDJ |
13382 | ada_operator_length (const struct expression *exp, int pc, int *oplenp, |
13383 | int *argsp) | |
4c4b4cd2 PH |
13384 | { |
13385 | switch (exp->elts[pc - 1].opcode) | |
13386 | { | |
76a01679 | 13387 | default: |
4c4b4cd2 PH |
13388 | operator_length_standard (exp, pc, oplenp, argsp); |
13389 | break; | |
13390 | ||
13391 | #define OP_DEFN(op, len, args, binop) \ | |
13392 | case op: *oplenp = len; *argsp = args; break; | |
13393 | ADA_OPERATORS; | |
13394 | #undef OP_DEFN | |
52ce6436 PH |
13395 | |
13396 | case OP_AGGREGATE: | |
13397 | *oplenp = 3; | |
13398 | *argsp = longest_to_int (exp->elts[pc - 2].longconst); | |
13399 | break; | |
13400 | ||
13401 | case OP_CHOICES: | |
13402 | *oplenp = 3; | |
13403 | *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1; | |
13404 | break; | |
4c4b4cd2 PH |
13405 | } |
13406 | } | |
13407 | ||
c0201579 JK |
13408 | /* Implementation of the exp_descriptor method operator_check. */ |
13409 | ||
13410 | static int | |
13411 | ada_operator_check (struct expression *exp, int pos, | |
13412 | int (*objfile_func) (struct objfile *objfile, void *data), | |
13413 | void *data) | |
13414 | { | |
13415 | const union exp_element *const elts = exp->elts; | |
13416 | struct type *type = NULL; | |
13417 | ||
13418 | switch (elts[pos].opcode) | |
13419 | { | |
13420 | case UNOP_IN_RANGE: | |
13421 | case UNOP_QUAL: | |
13422 | type = elts[pos + 1].type; | |
13423 | break; | |
13424 | ||
13425 | default: | |
13426 | return operator_check_standard (exp, pos, objfile_func, data); | |
13427 | } | |
13428 | ||
13429 | /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */ | |
13430 | ||
13431 | if (type && TYPE_OBJFILE (type) | |
13432 | && (*objfile_func) (TYPE_OBJFILE (type), data)) | |
13433 | return 1; | |
13434 | ||
13435 | return 0; | |
13436 | } | |
13437 | ||
a121b7c1 | 13438 | static const char * |
4c4b4cd2 PH |
13439 | ada_op_name (enum exp_opcode opcode) |
13440 | { | |
13441 | switch (opcode) | |
13442 | { | |
76a01679 | 13443 | default: |
4c4b4cd2 | 13444 | return op_name_standard (opcode); |
52ce6436 | 13445 | |
4c4b4cd2 PH |
13446 | #define OP_DEFN(op, len, args, binop) case op: return #op; |
13447 | ADA_OPERATORS; | |
13448 | #undef OP_DEFN | |
52ce6436 PH |
13449 | |
13450 | case OP_AGGREGATE: | |
13451 | return "OP_AGGREGATE"; | |
13452 | case OP_CHOICES: | |
13453 | return "OP_CHOICES"; | |
13454 | case OP_NAME: | |
13455 | return "OP_NAME"; | |
4c4b4cd2 PH |
13456 | } |
13457 | } | |
13458 | ||
13459 | /* As for operator_length, but assumes PC is pointing at the first | |
13460 | element of the operator, and gives meaningful results only for the | |
52ce6436 | 13461 | Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */ |
4c4b4cd2 PH |
13462 | |
13463 | static void | |
76a01679 JB |
13464 | ada_forward_operator_length (struct expression *exp, int pc, |
13465 | int *oplenp, int *argsp) | |
4c4b4cd2 | 13466 | { |
76a01679 | 13467 | switch (exp->elts[pc].opcode) |
4c4b4cd2 PH |
13468 | { |
13469 | default: | |
13470 | *oplenp = *argsp = 0; | |
13471 | break; | |
52ce6436 | 13472 | |
4c4b4cd2 PH |
13473 | #define OP_DEFN(op, len, args, binop) \ |
13474 | case op: *oplenp = len; *argsp = args; break; | |
13475 | ADA_OPERATORS; | |
13476 | #undef OP_DEFN | |
52ce6436 PH |
13477 | |
13478 | case OP_AGGREGATE: | |
13479 | *oplenp = 3; | |
13480 | *argsp = longest_to_int (exp->elts[pc + 1].longconst); | |
13481 | break; | |
13482 | ||
13483 | case OP_CHOICES: | |
13484 | *oplenp = 3; | |
13485 | *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1; | |
13486 | break; | |
13487 | ||
13488 | case OP_STRING: | |
13489 | case OP_NAME: | |
13490 | { | |
13491 | int len = longest_to_int (exp->elts[pc + 1].longconst); | |
5b4ee69b | 13492 | |
52ce6436 PH |
13493 | *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1); |
13494 | *argsp = 0; | |
13495 | break; | |
13496 | } | |
4c4b4cd2 PH |
13497 | } |
13498 | } | |
13499 | ||
13500 | static int | |
13501 | ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt) | |
13502 | { | |
13503 | enum exp_opcode op = exp->elts[elt].opcode; | |
13504 | int oplen, nargs; | |
13505 | int pc = elt; | |
13506 | int i; | |
76a01679 | 13507 | |
4c4b4cd2 PH |
13508 | ada_forward_operator_length (exp, elt, &oplen, &nargs); |
13509 | ||
76a01679 | 13510 | switch (op) |
4c4b4cd2 | 13511 | { |
76a01679 | 13512 | /* Ada attributes ('Foo). */ |
4c4b4cd2 PH |
13513 | case OP_ATR_FIRST: |
13514 | case OP_ATR_LAST: | |
13515 | case OP_ATR_LENGTH: | |
13516 | case OP_ATR_IMAGE: | |
13517 | case OP_ATR_MAX: | |
13518 | case OP_ATR_MIN: | |
13519 | case OP_ATR_MODULUS: | |
13520 | case OP_ATR_POS: | |
13521 | case OP_ATR_SIZE: | |
13522 | case OP_ATR_TAG: | |
13523 | case OP_ATR_VAL: | |
13524 | break; | |
13525 | ||
13526 | case UNOP_IN_RANGE: | |
13527 | case UNOP_QUAL: | |
323e0a4a AC |
13528 | /* XXX: gdb_sprint_host_address, type_sprint */ |
13529 | fprintf_filtered (stream, _("Type @")); | |
4c4b4cd2 PH |
13530 | gdb_print_host_address (exp->elts[pc + 1].type, stream); |
13531 | fprintf_filtered (stream, " ("); | |
13532 | type_print (exp->elts[pc + 1].type, NULL, stream, 0); | |
13533 | fprintf_filtered (stream, ")"); | |
13534 | break; | |
13535 | case BINOP_IN_BOUNDS: | |
52ce6436 PH |
13536 | fprintf_filtered (stream, " (%d)", |
13537 | longest_to_int (exp->elts[pc + 2].longconst)); | |
4c4b4cd2 PH |
13538 | break; |
13539 | case TERNOP_IN_RANGE: | |
13540 | break; | |
13541 | ||
52ce6436 PH |
13542 | case OP_AGGREGATE: |
13543 | case OP_OTHERS: | |
13544 | case OP_DISCRETE_RANGE: | |
13545 | case OP_POSITIONAL: | |
13546 | case OP_CHOICES: | |
13547 | break; | |
13548 | ||
13549 | case OP_NAME: | |
13550 | case OP_STRING: | |
13551 | { | |
13552 | char *name = &exp->elts[elt + 2].string; | |
13553 | int len = longest_to_int (exp->elts[elt + 1].longconst); | |
5b4ee69b | 13554 | |
52ce6436 PH |
13555 | fprintf_filtered (stream, "Text: `%.*s'", len, name); |
13556 | break; | |
13557 | } | |
13558 | ||
4c4b4cd2 PH |
13559 | default: |
13560 | return dump_subexp_body_standard (exp, stream, elt); | |
13561 | } | |
13562 | ||
13563 | elt += oplen; | |
13564 | for (i = 0; i < nargs; i += 1) | |
13565 | elt = dump_subexp (exp, stream, elt); | |
13566 | ||
13567 | return elt; | |
13568 | } | |
13569 | ||
13570 | /* The Ada extension of print_subexp (q.v.). */ | |
13571 | ||
76a01679 JB |
13572 | static void |
13573 | ada_print_subexp (struct expression *exp, int *pos, | |
13574 | struct ui_file *stream, enum precedence prec) | |
4c4b4cd2 | 13575 | { |
52ce6436 | 13576 | int oplen, nargs, i; |
4c4b4cd2 PH |
13577 | int pc = *pos; |
13578 | enum exp_opcode op = exp->elts[pc].opcode; | |
13579 | ||
13580 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
13581 | ||
52ce6436 | 13582 | *pos += oplen; |
4c4b4cd2 PH |
13583 | switch (op) |
13584 | { | |
13585 | default: | |
52ce6436 | 13586 | *pos -= oplen; |
4c4b4cd2 PH |
13587 | print_subexp_standard (exp, pos, stream, prec); |
13588 | return; | |
13589 | ||
13590 | case OP_VAR_VALUE: | |
987012b8 | 13591 | fputs_filtered (exp->elts[pc + 2].symbol->natural_name (), stream); |
4c4b4cd2 PH |
13592 | return; |
13593 | ||
13594 | case BINOP_IN_BOUNDS: | |
323e0a4a | 13595 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13596 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13597 | fputs_filtered (" in ", stream); |
4c4b4cd2 | 13598 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13599 | fputs_filtered ("'range", stream); |
4c4b4cd2 | 13600 | if (exp->elts[pc + 1].longconst > 1) |
76a01679 JB |
13601 | fprintf_filtered (stream, "(%ld)", |
13602 | (long) exp->elts[pc + 1].longconst); | |
4c4b4cd2 PH |
13603 | return; |
13604 | ||
13605 | case TERNOP_IN_RANGE: | |
4c4b4cd2 | 13606 | if (prec >= PREC_EQUAL) |
76a01679 | 13607 | fputs_filtered ("(", stream); |
323e0a4a | 13608 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13609 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13610 | fputs_filtered (" in ", stream); |
4c4b4cd2 PH |
13611 | print_subexp (exp, pos, stream, PREC_EQUAL); |
13612 | fputs_filtered (" .. ", stream); | |
13613 | print_subexp (exp, pos, stream, PREC_EQUAL); | |
13614 | if (prec >= PREC_EQUAL) | |
76a01679 JB |
13615 | fputs_filtered (")", stream); |
13616 | return; | |
4c4b4cd2 PH |
13617 | |
13618 | case OP_ATR_FIRST: | |
13619 | case OP_ATR_LAST: | |
13620 | case OP_ATR_LENGTH: | |
13621 | case OP_ATR_IMAGE: | |
13622 | case OP_ATR_MAX: | |
13623 | case OP_ATR_MIN: | |
13624 | case OP_ATR_MODULUS: | |
13625 | case OP_ATR_POS: | |
13626 | case OP_ATR_SIZE: | |
13627 | case OP_ATR_TAG: | |
13628 | case OP_ATR_VAL: | |
4c4b4cd2 | 13629 | if (exp->elts[*pos].opcode == OP_TYPE) |
76a01679 | 13630 | { |
78134374 | 13631 | if (exp->elts[*pos + 1].type->code () != TYPE_CODE_VOID) |
79d43c61 TT |
13632 | LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0, |
13633 | &type_print_raw_options); | |
76a01679 JB |
13634 | *pos += 3; |
13635 | } | |
4c4b4cd2 | 13636 | else |
76a01679 | 13637 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
4c4b4cd2 PH |
13638 | fprintf_filtered (stream, "'%s", ada_attribute_name (op)); |
13639 | if (nargs > 1) | |
76a01679 JB |
13640 | { |
13641 | int tem; | |
5b4ee69b | 13642 | |
76a01679 JB |
13643 | for (tem = 1; tem < nargs; tem += 1) |
13644 | { | |
13645 | fputs_filtered ((tem == 1) ? " (" : ", ", stream); | |
13646 | print_subexp (exp, pos, stream, PREC_ABOVE_COMMA); | |
13647 | } | |
13648 | fputs_filtered (")", stream); | |
13649 | } | |
4c4b4cd2 | 13650 | return; |
14f9c5c9 | 13651 | |
4c4b4cd2 | 13652 | case UNOP_QUAL: |
4c4b4cd2 PH |
13653 | type_print (exp->elts[pc + 1].type, "", stream, 0); |
13654 | fputs_filtered ("'(", stream); | |
13655 | print_subexp (exp, pos, stream, PREC_PREFIX); | |
13656 | fputs_filtered (")", stream); | |
13657 | return; | |
14f9c5c9 | 13658 | |
4c4b4cd2 | 13659 | case UNOP_IN_RANGE: |
323e0a4a | 13660 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 13661 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 13662 | fputs_filtered (" in ", stream); |
79d43c61 TT |
13663 | LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0, |
13664 | &type_print_raw_options); | |
4c4b4cd2 | 13665 | return; |
52ce6436 PH |
13666 | |
13667 | case OP_DISCRETE_RANGE: | |
13668 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13669 | fputs_filtered ("..", stream); | |
13670 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13671 | return; | |
13672 | ||
13673 | case OP_OTHERS: | |
13674 | fputs_filtered ("others => ", stream); | |
13675 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13676 | return; | |
13677 | ||
13678 | case OP_CHOICES: | |
13679 | for (i = 0; i < nargs-1; i += 1) | |
13680 | { | |
13681 | if (i > 0) | |
13682 | fputs_filtered ("|", stream); | |
13683 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13684 | } | |
13685 | fputs_filtered (" => ", stream); | |
13686 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13687 | return; | |
13688 | ||
13689 | case OP_POSITIONAL: | |
13690 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13691 | return; | |
13692 | ||
13693 | case OP_AGGREGATE: | |
13694 | fputs_filtered ("(", stream); | |
13695 | for (i = 0; i < nargs; i += 1) | |
13696 | { | |
13697 | if (i > 0) | |
13698 | fputs_filtered (", ", stream); | |
13699 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
13700 | } | |
13701 | fputs_filtered (")", stream); | |
13702 | return; | |
4c4b4cd2 PH |
13703 | } |
13704 | } | |
14f9c5c9 AS |
13705 | |
13706 | /* Table mapping opcodes into strings for printing operators | |
13707 | and precedences of the operators. */ | |
13708 | ||
d2e4a39e AS |
13709 | static const struct op_print ada_op_print_tab[] = { |
13710 | {":=", BINOP_ASSIGN, PREC_ASSIGN, 1}, | |
13711 | {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0}, | |
13712 | {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0}, | |
13713 | {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0}, | |
13714 | {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0}, | |
13715 | {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0}, | |
13716 | {"=", BINOP_EQUAL, PREC_EQUAL, 0}, | |
13717 | {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0}, | |
13718 | {"<=", BINOP_LEQ, PREC_ORDER, 0}, | |
13719 | {">=", BINOP_GEQ, PREC_ORDER, 0}, | |
13720 | {">", BINOP_GTR, PREC_ORDER, 0}, | |
13721 | {"<", BINOP_LESS, PREC_ORDER, 0}, | |
13722 | {">>", BINOP_RSH, PREC_SHIFT, 0}, | |
13723 | {"<<", BINOP_LSH, PREC_SHIFT, 0}, | |
13724 | {"+", BINOP_ADD, PREC_ADD, 0}, | |
13725 | {"-", BINOP_SUB, PREC_ADD, 0}, | |
13726 | {"&", BINOP_CONCAT, PREC_ADD, 0}, | |
13727 | {"*", BINOP_MUL, PREC_MUL, 0}, | |
13728 | {"/", BINOP_DIV, PREC_MUL, 0}, | |
13729 | {"rem", BINOP_REM, PREC_MUL, 0}, | |
13730 | {"mod", BINOP_MOD, PREC_MUL, 0}, | |
13731 | {"**", BINOP_EXP, PREC_REPEAT, 0}, | |
13732 | {"@", BINOP_REPEAT, PREC_REPEAT, 0}, | |
13733 | {"-", UNOP_NEG, PREC_PREFIX, 0}, | |
13734 | {"+", UNOP_PLUS, PREC_PREFIX, 0}, | |
13735 | {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0}, | |
13736 | {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0}, | |
13737 | {"abs ", UNOP_ABS, PREC_PREFIX, 0}, | |
4c4b4cd2 PH |
13738 | {".all", UNOP_IND, PREC_SUFFIX, 1}, |
13739 | {"'access", UNOP_ADDR, PREC_SUFFIX, 1}, | |
13740 | {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1}, | |
f486487f | 13741 | {NULL, OP_NULL, PREC_SUFFIX, 0} |
14f9c5c9 AS |
13742 | }; |
13743 | \f | |
72d5681a PH |
13744 | enum ada_primitive_types { |
13745 | ada_primitive_type_int, | |
13746 | ada_primitive_type_long, | |
13747 | ada_primitive_type_short, | |
13748 | ada_primitive_type_char, | |
13749 | ada_primitive_type_float, | |
13750 | ada_primitive_type_double, | |
13751 | ada_primitive_type_void, | |
13752 | ada_primitive_type_long_long, | |
13753 | ada_primitive_type_long_double, | |
13754 | ada_primitive_type_natural, | |
13755 | ada_primitive_type_positive, | |
13756 | ada_primitive_type_system_address, | |
08f49010 | 13757 | ada_primitive_type_storage_offset, |
72d5681a PH |
13758 | nr_ada_primitive_types |
13759 | }; | |
6c038f32 | 13760 | |
6c038f32 PH |
13761 | \f |
13762 | /* Language vector */ | |
13763 | ||
13764 | /* Not really used, but needed in the ada_language_defn. */ | |
13765 | ||
13766 | static void | |
6c7a06a3 | 13767 | emit_char (int c, struct type *type, struct ui_file *stream, int quoter) |
6c038f32 | 13768 | { |
6c7a06a3 | 13769 | ada_emit_char (c, type, stream, quoter, 1); |
6c038f32 PH |
13770 | } |
13771 | ||
13772 | static int | |
410a0ff2 | 13773 | parse (struct parser_state *ps) |
6c038f32 PH |
13774 | { |
13775 | warnings_issued = 0; | |
410a0ff2 | 13776 | return ada_parse (ps); |
6c038f32 PH |
13777 | } |
13778 | ||
13779 | static const struct exp_descriptor ada_exp_descriptor = { | |
13780 | ada_print_subexp, | |
13781 | ada_operator_length, | |
c0201579 | 13782 | ada_operator_check, |
6c038f32 PH |
13783 | ada_op_name, |
13784 | ada_dump_subexp_body, | |
13785 | ada_evaluate_subexp | |
13786 | }; | |
13787 | ||
b5ec771e PA |
13788 | /* symbol_name_matcher_ftype adapter for wild_match. */ |
13789 | ||
13790 | static bool | |
13791 | do_wild_match (const char *symbol_search_name, | |
13792 | const lookup_name_info &lookup_name, | |
a207cff2 | 13793 | completion_match_result *comp_match_res) |
b5ec771e PA |
13794 | { |
13795 | return wild_match (symbol_search_name, ada_lookup_name (lookup_name)); | |
13796 | } | |
13797 | ||
13798 | /* symbol_name_matcher_ftype adapter for full_match. */ | |
13799 | ||
13800 | static bool | |
13801 | do_full_match (const char *symbol_search_name, | |
13802 | const lookup_name_info &lookup_name, | |
a207cff2 | 13803 | completion_match_result *comp_match_res) |
b5ec771e PA |
13804 | { |
13805 | return full_match (symbol_search_name, ada_lookup_name (lookup_name)); | |
13806 | } | |
13807 | ||
a2cd4f14 JB |
13808 | /* symbol_name_matcher_ftype for exact (verbatim) matches. */ |
13809 | ||
13810 | static bool | |
13811 | do_exact_match (const char *symbol_search_name, | |
13812 | const lookup_name_info &lookup_name, | |
13813 | completion_match_result *comp_match_res) | |
13814 | { | |
13815 | return strcmp (symbol_search_name, ada_lookup_name (lookup_name)) == 0; | |
13816 | } | |
13817 | ||
b5ec771e PA |
13818 | /* Build the Ada lookup name for LOOKUP_NAME. */ |
13819 | ||
13820 | ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info &lookup_name) | |
13821 | { | |
e0802d59 | 13822 | gdb::string_view user_name = lookup_name.name (); |
b5ec771e PA |
13823 | |
13824 | if (user_name[0] == '<') | |
13825 | { | |
13826 | if (user_name.back () == '>') | |
e0802d59 TT |
13827 | m_encoded_name |
13828 | = user_name.substr (1, user_name.size () - 2).to_string (); | |
b5ec771e | 13829 | else |
e0802d59 TT |
13830 | m_encoded_name |
13831 | = user_name.substr (1, user_name.size () - 1).to_string (); | |
b5ec771e PA |
13832 | m_encoded_p = true; |
13833 | m_verbatim_p = true; | |
13834 | m_wild_match_p = false; | |
13835 | m_standard_p = false; | |
13836 | } | |
13837 | else | |
13838 | { | |
13839 | m_verbatim_p = false; | |
13840 | ||
e0802d59 | 13841 | m_encoded_p = user_name.find ("__") != gdb::string_view::npos; |
b5ec771e PA |
13842 | |
13843 | if (!m_encoded_p) | |
13844 | { | |
e0802d59 | 13845 | const char *folded = ada_fold_name (user_name); |
b5ec771e PA |
13846 | const char *encoded = ada_encode_1 (folded, false); |
13847 | if (encoded != NULL) | |
13848 | m_encoded_name = encoded; | |
13849 | else | |
e0802d59 | 13850 | m_encoded_name = user_name.to_string (); |
b5ec771e PA |
13851 | } |
13852 | else | |
e0802d59 | 13853 | m_encoded_name = user_name.to_string (); |
b5ec771e PA |
13854 | |
13855 | /* Handle the 'package Standard' special case. See description | |
13856 | of m_standard_p. */ | |
13857 | if (startswith (m_encoded_name.c_str (), "standard__")) | |
13858 | { | |
13859 | m_encoded_name = m_encoded_name.substr (sizeof ("standard__") - 1); | |
13860 | m_standard_p = true; | |
13861 | } | |
13862 | else | |
13863 | m_standard_p = false; | |
74ccd7f5 | 13864 | |
b5ec771e PA |
13865 | /* If the name contains a ".", then the user is entering a fully |
13866 | qualified entity name, and the match must not be done in wild | |
13867 | mode. Similarly, if the user wants to complete what looks | |
13868 | like an encoded name, the match must not be done in wild | |
13869 | mode. Also, in the standard__ special case always do | |
13870 | non-wild matching. */ | |
13871 | m_wild_match_p | |
13872 | = (lookup_name.match_type () != symbol_name_match_type::FULL | |
13873 | && !m_encoded_p | |
13874 | && !m_standard_p | |
13875 | && user_name.find ('.') == std::string::npos); | |
13876 | } | |
13877 | } | |
13878 | ||
13879 | /* symbol_name_matcher_ftype method for Ada. This only handles | |
13880 | completion mode. */ | |
13881 | ||
13882 | static bool | |
13883 | ada_symbol_name_matches (const char *symbol_search_name, | |
13884 | const lookup_name_info &lookup_name, | |
a207cff2 | 13885 | completion_match_result *comp_match_res) |
74ccd7f5 | 13886 | { |
b5ec771e PA |
13887 | return lookup_name.ada ().matches (symbol_search_name, |
13888 | lookup_name.match_type (), | |
a207cff2 | 13889 | comp_match_res); |
b5ec771e PA |
13890 | } |
13891 | ||
de63c46b PA |
13892 | /* A name matcher that matches the symbol name exactly, with |
13893 | strcmp. */ | |
13894 | ||
13895 | static bool | |
13896 | literal_symbol_name_matcher (const char *symbol_search_name, | |
13897 | const lookup_name_info &lookup_name, | |
13898 | completion_match_result *comp_match_res) | |
13899 | { | |
e0802d59 | 13900 | gdb::string_view name_view = lookup_name.name (); |
de63c46b | 13901 | |
e0802d59 TT |
13902 | if (lookup_name.completion_mode () |
13903 | ? (strncmp (symbol_search_name, name_view.data (), | |
13904 | name_view.size ()) == 0) | |
13905 | : symbol_search_name == name_view) | |
de63c46b PA |
13906 | { |
13907 | if (comp_match_res != NULL) | |
13908 | comp_match_res->set_match (symbol_search_name); | |
13909 | return true; | |
13910 | } | |
13911 | else | |
13912 | return false; | |
13913 | } | |
13914 | ||
b5ec771e PA |
13915 | /* Implement the "la_get_symbol_name_matcher" language_defn method for |
13916 | Ada. */ | |
13917 | ||
13918 | static symbol_name_matcher_ftype * | |
13919 | ada_get_symbol_name_matcher (const lookup_name_info &lookup_name) | |
13920 | { | |
de63c46b PA |
13921 | if (lookup_name.match_type () == symbol_name_match_type::SEARCH_NAME) |
13922 | return literal_symbol_name_matcher; | |
13923 | ||
b5ec771e PA |
13924 | if (lookup_name.completion_mode ()) |
13925 | return ada_symbol_name_matches; | |
74ccd7f5 | 13926 | else |
b5ec771e PA |
13927 | { |
13928 | if (lookup_name.ada ().wild_match_p ()) | |
13929 | return do_wild_match; | |
a2cd4f14 JB |
13930 | else if (lookup_name.ada ().verbatim_p ()) |
13931 | return do_exact_match; | |
b5ec771e PA |
13932 | else |
13933 | return do_full_match; | |
13934 | } | |
74ccd7f5 JB |
13935 | } |
13936 | ||
56618e20 TT |
13937 | static const char *ada_extensions[] = |
13938 | { | |
13939 | ".adb", ".ads", ".a", ".ada", ".dg", NULL | |
13940 | }; | |
13941 | ||
0874fd07 AB |
13942 | /* Constant data that describes the Ada language. */ |
13943 | ||
13944 | extern const struct language_data ada_language_data = | |
13945 | { | |
6c038f32 | 13946 | "ada", /* Language name */ |
6abde28f | 13947 | "Ada", |
6c038f32 | 13948 | language_ada, |
6c038f32 | 13949 | range_check_off, |
6c038f32 PH |
13950 | case_sensitive_on, /* Yes, Ada is case-insensitive, but |
13951 | that's not quite what this means. */ | |
6c038f32 | 13952 | array_row_major, |
9a044a89 | 13953 | macro_expansion_no, |
56618e20 | 13954 | ada_extensions, |
6c038f32 PH |
13955 | &ada_exp_descriptor, |
13956 | parse, | |
6c038f32 PH |
13957 | resolve, |
13958 | ada_printchar, /* Print a character constant */ | |
13959 | ada_printstr, /* Function to print string constant */ | |
13960 | emit_char, /* Function to print single char (not used) */ | |
6c038f32 | 13961 | ada_print_type, /* Print a type using appropriate syntax */ |
be942545 | 13962 | ada_print_typedef, /* Print a typedef using appropriate syntax */ |
26792ee0 | 13963 | ada_value_print_inner, /* la_value_print_inner */ |
6c038f32 PH |
13964 | ada_value_print, /* Print a top-level value */ |
13965 | NULL, /* Language specific skip_trampoline */ | |
2b2d9e11 | 13966 | NULL, /* name_of_this */ |
59cc4834 | 13967 | true, /* la_store_sym_names_in_linkage_form_p */ |
6c038f32 | 13968 | ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */ |
6c038f32 | 13969 | ada_la_decode, /* Language specific symbol demangler */ |
8b302db8 | 13970 | ada_sniff_from_mangled_name, |
0963b4bd MS |
13971 | NULL, /* Language specific |
13972 | class_name_from_physname */ | |
6c038f32 PH |
13973 | ada_op_print_tab, /* expression operators for printing */ |
13974 | 0, /* c-style arrays */ | |
13975 | 1, /* String lower bound */ | |
6c038f32 | 13976 | ada_get_gdb_completer_word_break_characters, |
eb3ff9a5 | 13977 | ada_collect_symbol_completion_matches, |
e2b7af72 | 13978 | ada_watch_location_expression, |
b5ec771e | 13979 | ada_get_symbol_name_matcher, /* la_get_symbol_name_matcher */ |
5ffa0793 | 13980 | default_search_name_hash, |
a53b64ea | 13981 | &ada_varobj_ops, |
bb2ec1b3 | 13982 | NULL, |
4be290b2 | 13983 | ada_is_string_type, |
721b08c6 | 13984 | "(...)" /* la_struct_too_deep_ellipsis */ |
6c038f32 PH |
13985 | }; |
13986 | ||
0874fd07 AB |
13987 | /* Class representing the Ada language. */ |
13988 | ||
13989 | class ada_language : public language_defn | |
13990 | { | |
13991 | public: | |
13992 | ada_language () | |
13993 | : language_defn (language_ada, ada_language_data) | |
13994 | { /* Nothing. */ } | |
5bd40f2a AB |
13995 | |
13996 | /* Print an array element index using the Ada syntax. */ | |
13997 | ||
13998 | void print_array_index (struct type *index_type, | |
13999 | LONGEST index, | |
14000 | struct ui_file *stream, | |
14001 | const value_print_options *options) const override | |
14002 | { | |
14003 | struct value *index_value = val_atr (index_type, index); | |
14004 | ||
14005 | LA_VALUE_PRINT (index_value, stream, options); | |
14006 | fprintf_filtered (stream, " => "); | |
14007 | } | |
15e5fd35 AB |
14008 | |
14009 | /* Implement the "read_var_value" language_defn method for Ada. */ | |
14010 | ||
14011 | struct value *read_var_value (struct symbol *var, | |
14012 | const struct block *var_block, | |
14013 | struct frame_info *frame) const override | |
14014 | { | |
14015 | /* The only case where default_read_var_value is not sufficient | |
14016 | is when VAR is a renaming... */ | |
14017 | if (frame != nullptr) | |
14018 | { | |
14019 | const struct block *frame_block = get_frame_block (frame, NULL); | |
14020 | if (frame_block != nullptr && ada_is_renaming_symbol (var)) | |
14021 | return ada_read_renaming_var_value (var, frame_block); | |
14022 | } | |
14023 | ||
14024 | /* This is a typical case where we expect the default_read_var_value | |
14025 | function to work. */ | |
14026 | return language_defn::read_var_value (var, var_block, frame); | |
14027 | } | |
1fb314aa AB |
14028 | |
14029 | /* See language.h. */ | |
14030 | void language_arch_info (struct gdbarch *gdbarch, | |
14031 | struct language_arch_info *lai) const override | |
14032 | { | |
14033 | const struct builtin_type *builtin = builtin_type (gdbarch); | |
14034 | ||
14035 | lai->primitive_type_vector | |
14036 | = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1, | |
14037 | struct type *); | |
14038 | ||
14039 | lai->primitive_type_vector [ada_primitive_type_int] | |
14040 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
14041 | 0, "integer"); | |
14042 | lai->primitive_type_vector [ada_primitive_type_long] | |
14043 | = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch), | |
14044 | 0, "long_integer"); | |
14045 | lai->primitive_type_vector [ada_primitive_type_short] | |
14046 | = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch), | |
14047 | 0, "short_integer"); | |
14048 | lai->string_char_type | |
14049 | = lai->primitive_type_vector [ada_primitive_type_char] | |
14050 | = arch_character_type (gdbarch, TARGET_CHAR_BIT, 0, "character"); | |
14051 | lai->primitive_type_vector [ada_primitive_type_float] | |
14052 | = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch), | |
14053 | "float", gdbarch_float_format (gdbarch)); | |
14054 | lai->primitive_type_vector [ada_primitive_type_double] | |
14055 | = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch), | |
14056 | "long_float", gdbarch_double_format (gdbarch)); | |
14057 | lai->primitive_type_vector [ada_primitive_type_long_long] | |
14058 | = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch), | |
14059 | 0, "long_long_integer"); | |
14060 | lai->primitive_type_vector [ada_primitive_type_long_double] | |
14061 | = arch_float_type (gdbarch, gdbarch_long_double_bit (gdbarch), | |
14062 | "long_long_float", gdbarch_long_double_format (gdbarch)); | |
14063 | lai->primitive_type_vector [ada_primitive_type_natural] | |
14064 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
14065 | 0, "natural"); | |
14066 | lai->primitive_type_vector [ada_primitive_type_positive] | |
14067 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
14068 | 0, "positive"); | |
14069 | lai->primitive_type_vector [ada_primitive_type_void] | |
14070 | = builtin->builtin_void; | |
14071 | ||
14072 | lai->primitive_type_vector [ada_primitive_type_system_address] | |
14073 | = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, TARGET_CHAR_BIT, | |
14074 | "void")); | |
14075 | lai->primitive_type_vector [ada_primitive_type_system_address] | |
14076 | ->set_name ("system__address"); | |
14077 | ||
14078 | /* Create the equivalent of the System.Storage_Elements.Storage_Offset | |
14079 | type. This is a signed integral type whose size is the same as | |
14080 | the size of addresses. */ | |
14081 | { | |
14082 | unsigned int addr_length = TYPE_LENGTH | |
14083 | (lai->primitive_type_vector [ada_primitive_type_system_address]); | |
14084 | ||
14085 | lai->primitive_type_vector [ada_primitive_type_storage_offset] | |
14086 | = arch_integer_type (gdbarch, addr_length * HOST_CHAR_BIT, 0, | |
14087 | "storage_offset"); | |
14088 | } | |
14089 | ||
14090 | lai->bool_type_symbol = NULL; | |
14091 | lai->bool_type_default = builtin->builtin_bool; | |
14092 | } | |
4009ee92 AB |
14093 | |
14094 | /* See language.h. */ | |
14095 | ||
14096 | bool iterate_over_symbols | |
14097 | (const struct block *block, const lookup_name_info &name, | |
14098 | domain_enum domain, | |
14099 | gdb::function_view<symbol_found_callback_ftype> callback) const override | |
14100 | { | |
14101 | std::vector<struct block_symbol> results; | |
14102 | ||
14103 | ada_lookup_symbol_list_worker (name, block, domain, &results, 0); | |
14104 | for (block_symbol &sym : results) | |
14105 | { | |
14106 | if (!callback (&sym)) | |
14107 | return false; | |
14108 | } | |
14109 | ||
14110 | return true; | |
14111 | } | |
0874fd07 AB |
14112 | }; |
14113 | ||
14114 | /* Single instance of the Ada language class. */ | |
14115 | ||
14116 | static ada_language ada_language_defn; | |
14117 | ||
5bf03f13 JB |
14118 | /* Command-list for the "set/show ada" prefix command. */ |
14119 | static struct cmd_list_element *set_ada_list; | |
14120 | static struct cmd_list_element *show_ada_list; | |
14121 | ||
2060206e PA |
14122 | static void |
14123 | initialize_ada_catchpoint_ops (void) | |
14124 | { | |
14125 | struct breakpoint_ops *ops; | |
14126 | ||
14127 | initialize_breakpoint_ops (); | |
14128 | ||
14129 | ops = &catch_exception_breakpoint_ops; | |
14130 | *ops = bkpt_breakpoint_ops; | |
37f6a7f4 TT |
14131 | ops->allocate_location = allocate_location_exception; |
14132 | ops->re_set = re_set_exception; | |
14133 | ops->check_status = check_status_exception; | |
14134 | ops->print_it = print_it_exception; | |
14135 | ops->print_one = print_one_exception; | |
14136 | ops->print_mention = print_mention_exception; | |
14137 | ops->print_recreate = print_recreate_exception; | |
2060206e PA |
14138 | |
14139 | ops = &catch_exception_unhandled_breakpoint_ops; | |
14140 | *ops = bkpt_breakpoint_ops; | |
37f6a7f4 TT |
14141 | ops->allocate_location = allocate_location_exception; |
14142 | ops->re_set = re_set_exception; | |
14143 | ops->check_status = check_status_exception; | |
14144 | ops->print_it = print_it_exception; | |
14145 | ops->print_one = print_one_exception; | |
14146 | ops->print_mention = print_mention_exception; | |
14147 | ops->print_recreate = print_recreate_exception; | |
2060206e PA |
14148 | |
14149 | ops = &catch_assert_breakpoint_ops; | |
14150 | *ops = bkpt_breakpoint_ops; | |
37f6a7f4 TT |
14151 | ops->allocate_location = allocate_location_exception; |
14152 | ops->re_set = re_set_exception; | |
14153 | ops->check_status = check_status_exception; | |
14154 | ops->print_it = print_it_exception; | |
14155 | ops->print_one = print_one_exception; | |
14156 | ops->print_mention = print_mention_exception; | |
14157 | ops->print_recreate = print_recreate_exception; | |
9f757bf7 XR |
14158 | |
14159 | ops = &catch_handlers_breakpoint_ops; | |
14160 | *ops = bkpt_breakpoint_ops; | |
37f6a7f4 TT |
14161 | ops->allocate_location = allocate_location_exception; |
14162 | ops->re_set = re_set_exception; | |
14163 | ops->check_status = check_status_exception; | |
14164 | ops->print_it = print_it_exception; | |
14165 | ops->print_one = print_one_exception; | |
14166 | ops->print_mention = print_mention_exception; | |
14167 | ops->print_recreate = print_recreate_exception; | |
2060206e PA |
14168 | } |
14169 | ||
3d9434b5 JB |
14170 | /* This module's 'new_objfile' observer. */ |
14171 | ||
14172 | static void | |
14173 | ada_new_objfile_observer (struct objfile *objfile) | |
14174 | { | |
14175 | ada_clear_symbol_cache (); | |
14176 | } | |
14177 | ||
14178 | /* This module's 'free_objfile' observer. */ | |
14179 | ||
14180 | static void | |
14181 | ada_free_objfile_observer (struct objfile *objfile) | |
14182 | { | |
14183 | ada_clear_symbol_cache (); | |
14184 | } | |
14185 | ||
6c265988 | 14186 | void _initialize_ada_language (); |
d2e4a39e | 14187 | void |
6c265988 | 14188 | _initialize_ada_language () |
14f9c5c9 | 14189 | { |
2060206e PA |
14190 | initialize_ada_catchpoint_ops (); |
14191 | ||
0743fc83 TT |
14192 | add_basic_prefix_cmd ("ada", no_class, |
14193 | _("Prefix command for changing Ada-specific settings."), | |
14194 | &set_ada_list, "set ada ", 0, &setlist); | |
5bf03f13 | 14195 | |
0743fc83 TT |
14196 | add_show_prefix_cmd ("ada", no_class, |
14197 | _("Generic command for showing Ada-specific settings."), | |
14198 | &show_ada_list, "show ada ", 0, &showlist); | |
5bf03f13 JB |
14199 | |
14200 | add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure, | |
14201 | &trust_pad_over_xvs, _("\ | |
590042fc PW |
14202 | Enable or disable an optimization trusting PAD types over XVS types."), _("\ |
14203 | Show whether an optimization trusting PAD types over XVS types is activated."), | |
5bf03f13 JB |
14204 | _("\ |
14205 | This is related to the encoding used by the GNAT compiler. The debugger\n\ | |
14206 | should normally trust the contents of PAD types, but certain older versions\n\ | |
14207 | of GNAT have a bug that sometimes causes the information in the PAD type\n\ | |
14208 | to be incorrect. Turning this setting \"off\" allows the debugger to\n\ | |
14209 | work around this bug. It is always safe to turn this option \"off\", but\n\ | |
14210 | this incurs a slight performance penalty, so it is recommended to NOT change\n\ | |
14211 | this option to \"off\" unless necessary."), | |
14212 | NULL, NULL, &set_ada_list, &show_ada_list); | |
14213 | ||
d72413e6 PMR |
14214 | add_setshow_boolean_cmd ("print-signatures", class_vars, |
14215 | &print_signatures, _("\ | |
14216 | Enable or disable the output of formal and return types for functions in the \ | |
590042fc | 14217 | overloads selection menu."), _("\ |
d72413e6 | 14218 | Show whether the output of formal and return types for functions in the \ |
590042fc | 14219 | overloads selection menu is activated."), |
d72413e6 PMR |
14220 | NULL, NULL, NULL, &set_ada_list, &show_ada_list); |
14221 | ||
9ac4176b PA |
14222 | add_catch_command ("exception", _("\ |
14223 | Catch Ada exceptions, when raised.\n\ | |
9bf7038b | 14224 | Usage: catch exception [ARG] [if CONDITION]\n\ |
60a90376 JB |
14225 | Without any argument, stop when any Ada exception is raised.\n\ |
14226 | If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\ | |
14227 | being raised does not have a handler (and will therefore lead to the task's\n\ | |
14228 | termination).\n\ | |
14229 | Otherwise, the catchpoint only stops when the name of the exception being\n\ | |
9bf7038b TT |
14230 | raised is the same as ARG.\n\ |
14231 | CONDITION is a boolean expression that is evaluated to see whether the\n\ | |
14232 | exception should cause a stop."), | |
9ac4176b | 14233 | catch_ada_exception_command, |
71bed2db | 14234 | catch_ada_completer, |
9ac4176b PA |
14235 | CATCH_PERMANENT, |
14236 | CATCH_TEMPORARY); | |
9f757bf7 XR |
14237 | |
14238 | add_catch_command ("handlers", _("\ | |
14239 | Catch Ada exceptions, when handled.\n\ | |
9bf7038b TT |
14240 | Usage: catch handlers [ARG] [if CONDITION]\n\ |
14241 | Without any argument, stop when any Ada exception is handled.\n\ | |
14242 | With an argument, catch only exceptions with the given name.\n\ | |
14243 | CONDITION is a boolean expression that is evaluated to see whether the\n\ | |
14244 | exception should cause a stop."), | |
9f757bf7 | 14245 | catch_ada_handlers_command, |
71bed2db | 14246 | catch_ada_completer, |
9f757bf7 XR |
14247 | CATCH_PERMANENT, |
14248 | CATCH_TEMPORARY); | |
9ac4176b PA |
14249 | add_catch_command ("assert", _("\ |
14250 | Catch failed Ada assertions, when raised.\n\ | |
9bf7038b TT |
14251 | Usage: catch assert [if CONDITION]\n\ |
14252 | CONDITION is a boolean expression that is evaluated to see whether the\n\ | |
14253 | exception should cause a stop."), | |
9ac4176b PA |
14254 | catch_assert_command, |
14255 | NULL, | |
14256 | CATCH_PERMANENT, | |
14257 | CATCH_TEMPORARY); | |
14258 | ||
6c038f32 | 14259 | varsize_limit = 65536; |
3fcded8f JB |
14260 | add_setshow_uinteger_cmd ("varsize-limit", class_support, |
14261 | &varsize_limit, _("\ | |
14262 | Set the maximum number of bytes allowed in a variable-size object."), _("\ | |
14263 | Show the maximum number of bytes allowed in a variable-size object."), _("\ | |
14264 | Attempts to access an object whose size is not a compile-time constant\n\ | |
14265 | and exceeds this limit will cause an error."), | |
14266 | NULL, NULL, &setlist, &showlist); | |
6c038f32 | 14267 | |
778865d3 JB |
14268 | add_info ("exceptions", info_exceptions_command, |
14269 | _("\ | |
14270 | List all Ada exception names.\n\ | |
9bf7038b | 14271 | Usage: info exceptions [REGEXP]\n\ |
778865d3 JB |
14272 | If a regular expression is passed as an argument, only those matching\n\ |
14273 | the regular expression are listed.")); | |
14274 | ||
0743fc83 TT |
14275 | add_basic_prefix_cmd ("ada", class_maintenance, |
14276 | _("Set Ada maintenance-related variables."), | |
14277 | &maint_set_ada_cmdlist, "maintenance set ada ", | |
14278 | 0/*allow-unknown*/, &maintenance_set_cmdlist); | |
c6044dd1 | 14279 | |
0743fc83 TT |
14280 | add_show_prefix_cmd ("ada", class_maintenance, |
14281 | _("Show Ada maintenance-related variables."), | |
14282 | &maint_show_ada_cmdlist, "maintenance show ada ", | |
14283 | 0/*allow-unknown*/, &maintenance_show_cmdlist); | |
c6044dd1 JB |
14284 | |
14285 | add_setshow_boolean_cmd | |
14286 | ("ignore-descriptive-types", class_maintenance, | |
14287 | &ada_ignore_descriptive_types_p, | |
14288 | _("Set whether descriptive types generated by GNAT should be ignored."), | |
14289 | _("Show whether descriptive types generated by GNAT should be ignored."), | |
14290 | _("\ | |
14291 | When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\ | |
14292 | DWARF attribute."), | |
14293 | NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist); | |
14294 | ||
459a2e4c TT |
14295 | decoded_names_store = htab_create_alloc (256, htab_hash_string, streq_hash, |
14296 | NULL, xcalloc, xfree); | |
6b69afc4 | 14297 | |
3d9434b5 | 14298 | /* The ada-lang observers. */ |
76727919 TT |
14299 | gdb::observers::new_objfile.attach (ada_new_objfile_observer); |
14300 | gdb::observers::free_objfile.attach (ada_free_objfile_observer); | |
14301 | gdb::observers::inferior_exit.attach (ada_inferior_exit); | |
14f9c5c9 | 14302 | } |