Commit | Line | Data |
---|---|---|
14f9c5c9 | 1 | /* Ada language support routines for GDB, the GNU debugger. Copyright |
de5ad195 DC |
2 | 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003 |
3 | Free Software Foundation, Inc. | |
14f9c5c9 AS |
4 | |
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2 of the License, or | |
10 | (at your option) any later version. | |
11 | ||
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. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with this program; if not, write to the Free Software | |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
20 | ||
21 | #include <stdio.h> | |
0c30c098 | 22 | #include "gdb_string.h" |
14f9c5c9 AS |
23 | #include <ctype.h> |
24 | #include <stdarg.h> | |
25 | #include "demangle.h" | |
26 | #include "defs.h" | |
27 | #include "symtab.h" | |
28 | #include "gdbtypes.h" | |
29 | #include "gdbcmd.h" | |
30 | #include "expression.h" | |
31 | #include "parser-defs.h" | |
32 | #include "language.h" | |
33 | #include "c-lang.h" | |
34 | #include "inferior.h" | |
35 | #include "symfile.h" | |
36 | #include "objfiles.h" | |
37 | #include "breakpoint.h" | |
38 | #include "gdbcore.h" | |
39 | #include "ada-lang.h" | |
14f9c5c9 | 40 | #include "ui-out.h" |
fe898f56 | 41 | #include "block.h" |
04714b91 | 42 | #include "infcall.h" |
de4f826b | 43 | #include "dictionary.h" |
14f9c5c9 | 44 | |
d2e4a39e | 45 | struct cleanup *unresolved_names; |
14f9c5c9 AS |
46 | |
47 | void extract_string (CORE_ADDR addr, char *buf); | |
48 | ||
d2e4a39e | 49 | static struct type *ada_create_fundamental_type (struct objfile *, int); |
14f9c5c9 AS |
50 | |
51 | static void modify_general_field (char *, LONGEST, int, int); | |
52 | ||
d2e4a39e | 53 | static struct type *desc_base_type (struct type *); |
14f9c5c9 | 54 | |
d2e4a39e | 55 | static struct type *desc_bounds_type (struct type *); |
14f9c5c9 | 56 | |
d2e4a39e | 57 | static struct value *desc_bounds (struct value *); |
14f9c5c9 | 58 | |
d2e4a39e | 59 | static int fat_pntr_bounds_bitpos (struct type *); |
14f9c5c9 | 60 | |
d2e4a39e | 61 | static int fat_pntr_bounds_bitsize (struct type *); |
14f9c5c9 | 62 | |
d2e4a39e | 63 | static struct type *desc_data_type (struct type *); |
14f9c5c9 | 64 | |
d2e4a39e | 65 | static struct value *desc_data (struct value *); |
14f9c5c9 | 66 | |
d2e4a39e | 67 | static int fat_pntr_data_bitpos (struct type *); |
14f9c5c9 | 68 | |
d2e4a39e | 69 | static int fat_pntr_data_bitsize (struct type *); |
14f9c5c9 | 70 | |
d2e4a39e | 71 | static struct value *desc_one_bound (struct value *, int, int); |
14f9c5c9 | 72 | |
d2e4a39e | 73 | static int desc_bound_bitpos (struct type *, int, int); |
14f9c5c9 | 74 | |
d2e4a39e | 75 | static int desc_bound_bitsize (struct type *, int, int); |
14f9c5c9 | 76 | |
d2e4a39e | 77 | static struct type *desc_index_type (struct type *, int); |
14f9c5c9 | 78 | |
d2e4a39e | 79 | static int desc_arity (struct type *); |
14f9c5c9 | 80 | |
d2e4a39e | 81 | static int ada_type_match (struct type *, struct type *, int); |
14f9c5c9 | 82 | |
d2e4a39e | 83 | static int ada_args_match (struct symbol *, struct value **, int); |
14f9c5c9 | 84 | |
d2e4a39e | 85 | static struct value *place_on_stack (struct value *, CORE_ADDR *); |
14f9c5c9 | 86 | |
d2e4a39e AS |
87 | static struct value *convert_actual (struct value *, struct type *, |
88 | CORE_ADDR *); | |
14f9c5c9 | 89 | |
d2e4a39e AS |
90 | static struct value *make_array_descriptor (struct type *, struct value *, |
91 | CORE_ADDR *); | |
14f9c5c9 | 92 | |
d2e4a39e | 93 | static void ada_add_block_symbols (struct block *, const char *, |
176620f1 | 94 | domain_enum, struct objfile *, int); |
14f9c5c9 | 95 | |
d2e4a39e | 96 | static void fill_in_ada_prototype (struct symbol *); |
14f9c5c9 | 97 | |
d2e4a39e | 98 | static int is_nonfunction (struct symbol **, int); |
14f9c5c9 | 99 | |
d2e4a39e | 100 | static void add_defn_to_vec (struct symbol *, struct block *); |
14f9c5c9 | 101 | |
d2e4a39e AS |
102 | static struct partial_symbol *ada_lookup_partial_symbol (struct partial_symtab |
103 | *, const char *, int, | |
176620f1 | 104 | domain_enum, int); |
14f9c5c9 | 105 | |
d2e4a39e | 106 | static struct symtab *symtab_for_sym (struct symbol *); |
14f9c5c9 | 107 | |
d2e4a39e AS |
108 | static struct value *ada_resolve_subexp (struct expression **, int *, int, |
109 | struct type *); | |
14f9c5c9 | 110 | |
d2e4a39e AS |
111 | static void replace_operator_with_call (struct expression **, int, int, int, |
112 | struct symbol *, struct block *); | |
14f9c5c9 | 113 | |
d2e4a39e | 114 | static int possible_user_operator_p (enum exp_opcode, struct value **); |
14f9c5c9 | 115 | |
d2e4a39e | 116 | static const char *ada_op_name (enum exp_opcode); |
14f9c5c9 | 117 | |
d2e4a39e | 118 | static int numeric_type_p (struct type *); |
14f9c5c9 | 119 | |
d2e4a39e | 120 | static int integer_type_p (struct type *); |
14f9c5c9 | 121 | |
d2e4a39e | 122 | static int scalar_type_p (struct type *); |
14f9c5c9 | 123 | |
d2e4a39e | 124 | static int discrete_type_p (struct type *); |
14f9c5c9 | 125 | |
d2e4a39e AS |
126 | static char *extended_canonical_line_spec (struct symtab_and_line, |
127 | const char *); | |
14f9c5c9 | 128 | |
d2e4a39e AS |
129 | static struct value *evaluate_subexp (struct type *, struct expression *, |
130 | int *, enum noside); | |
14f9c5c9 | 131 | |
d2e4a39e | 132 | static struct value *evaluate_subexp_type (struct expression *, int *); |
14f9c5c9 | 133 | |
d2e4a39e | 134 | static struct type *ada_create_fundamental_type (struct objfile *, int); |
14f9c5c9 | 135 | |
d2e4a39e | 136 | static int is_dynamic_field (struct type *, int); |
14f9c5c9 | 137 | |
d2e4a39e AS |
138 | static struct type *to_fixed_variant_branch_type (struct type *, char *, |
139 | CORE_ADDR, struct value *); | |
14f9c5c9 | 140 | |
d2e4a39e AS |
141 | static struct type *to_fixed_range_type (char *, struct value *, |
142 | struct objfile *); | |
14f9c5c9 | 143 | |
d2e4a39e | 144 | static struct type *to_static_fixed_type (struct type *); |
14f9c5c9 | 145 | |
d2e4a39e | 146 | static struct value *unwrap_value (struct value *); |
14f9c5c9 | 147 | |
d2e4a39e | 148 | static struct type *packed_array_type (struct type *, long *); |
14f9c5c9 | 149 | |
d2e4a39e | 150 | static struct type *decode_packed_array_type (struct type *); |
14f9c5c9 | 151 | |
d2e4a39e | 152 | static struct value *decode_packed_array (struct value *); |
14f9c5c9 | 153 | |
d2e4a39e AS |
154 | static struct value *value_subscript_packed (struct value *, int, |
155 | struct value **); | |
14f9c5c9 | 156 | |
d2e4a39e AS |
157 | static struct value *coerce_unspec_val_to_type (struct value *, long, |
158 | struct type *); | |
14f9c5c9 | 159 | |
d2e4a39e | 160 | static struct value *get_var_value (char *, char *); |
14f9c5c9 | 161 | |
d2e4a39e | 162 | static int lesseq_defined_than (struct symbol *, struct symbol *); |
14f9c5c9 | 163 | |
d2e4a39e | 164 | static int equiv_types (struct type *, struct type *); |
14f9c5c9 | 165 | |
d2e4a39e | 166 | static int is_name_suffix (const char *); |
14f9c5c9 | 167 | |
d2e4a39e | 168 | static int wild_match (const char *, int, const char *); |
14f9c5c9 | 169 | |
d2e4a39e AS |
170 | static struct symtabs_and_lines find_sal_from_funcs_and_line (const char *, |
171 | int, | |
172 | struct symbol | |
173 | **, int); | |
14f9c5c9 | 174 | |
d2e4a39e AS |
175 | static int find_line_in_linetable (struct linetable *, int, struct symbol **, |
176 | int, int *); | |
14f9c5c9 | 177 | |
d2e4a39e | 178 | static int find_next_line_in_linetable (struct linetable *, int, int, int); |
14f9c5c9 | 179 | |
d2e4a39e AS |
180 | static struct symtabs_and_lines all_sals_for_line (const char *, int, |
181 | char ***); | |
14f9c5c9 | 182 | |
d2e4a39e | 183 | static void read_all_symtabs (const char *); |
14f9c5c9 | 184 | |
d2e4a39e | 185 | static int is_plausible_func_for_line (struct symbol *, int); |
14f9c5c9 | 186 | |
d2e4a39e | 187 | static struct value *ada_coerce_ref (struct value *); |
14f9c5c9 | 188 | |
d2e4a39e | 189 | static struct value *value_pos_atr (struct value *); |
14f9c5c9 | 190 | |
d2e4a39e | 191 | static struct value *value_val_atr (struct type *, struct value *); |
14f9c5c9 | 192 | |
176620f1 | 193 | static struct symbol *standard_lookup (const char *, domain_enum); |
14f9c5c9 AS |
194 | |
195 | extern void markTimeStart (int index); | |
196 | extern void markTimeStop (int index); | |
14f9c5c9 AS |
197 | \f |
198 | ||
d2e4a39e | 199 | |
14f9c5c9 AS |
200 | /* Maximum-sized dynamic type. */ |
201 | static unsigned int varsize_limit; | |
202 | ||
d2e4a39e | 203 | static const char *ada_completer_word_break_characters = |
14f9c5c9 AS |
204 | " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-"; |
205 | ||
206 | /* The name of the symbol to use to get the name of the main subprogram */ | |
207 | #define ADA_MAIN_PROGRAM_SYMBOL_NAME "__gnat_ada_main_program_name" | |
208 | ||
209 | /* Utilities */ | |
210 | ||
211 | /* extract_string | |
212 | * | |
213 | * read the string located at ADDR from the inferior and store the | |
214 | * result into BUF | |
215 | */ | |
216 | void | |
217 | extract_string (CORE_ADDR addr, char *buf) | |
218 | { | |
d2e4a39e | 219 | int char_index = 0; |
14f9c5c9 | 220 | |
d2e4a39e AS |
221 | /* Loop, reading one byte at a time, until we reach the '\000' |
222 | end-of-string marker */ | |
223 | do | |
224 | { | |
225 | target_read_memory (addr + char_index * sizeof (char), | |
226 | buf + char_index * sizeof (char), sizeof (char)); | |
227 | char_index++; | |
228 | } | |
229 | while (buf[char_index - 1] != '\000'); | |
14f9c5c9 AS |
230 | } |
231 | ||
232 | /* Assuming *OLD_VECT points to an array of *SIZE objects of size | |
233 | ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects, | |
234 | updating *OLD_VECT and *SIZE as necessary. */ | |
235 | ||
236 | void | |
d2e4a39e | 237 | grow_vect (void **old_vect, size_t * size, size_t min_size, int element_size) |
14f9c5c9 | 238 | { |
d2e4a39e AS |
239 | if (*size < min_size) |
240 | { | |
241 | *size *= 2; | |
242 | if (*size < min_size) | |
243 | *size = min_size; | |
244 | *old_vect = xrealloc (*old_vect, *size * element_size); | |
245 | } | |
14f9c5c9 AS |
246 | } |
247 | ||
248 | /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing | |
249 | suffix of FIELD_NAME beginning "___" */ | |
250 | ||
251 | static int | |
ebf56fd3 | 252 | field_name_match (const char *field_name, const char *target) |
14f9c5c9 AS |
253 | { |
254 | int len = strlen (target); | |
d2e4a39e AS |
255 | return |
256 | STREQN (field_name, target, len) | |
257 | && (field_name[len] == '\0' | |
14f9c5c9 | 258 | || (STREQN (field_name + len, "___", 3) |
d2e4a39e | 259 | && !STREQ (field_name + strlen (field_name) - 6, "___XVN"))); |
14f9c5c9 AS |
260 | } |
261 | ||
262 | ||
263 | /* The length of the prefix of NAME prior to any "___" suffix. */ | |
264 | ||
265 | int | |
d2e4a39e | 266 | ada_name_prefix_len (const char *name) |
14f9c5c9 AS |
267 | { |
268 | if (name == NULL) | |
269 | return 0; | |
d2e4a39e | 270 | else |
14f9c5c9 | 271 | { |
d2e4a39e | 272 | const char *p = strstr (name, "___"); |
14f9c5c9 AS |
273 | if (p == NULL) |
274 | return strlen (name); | |
275 | else | |
276 | return p - name; | |
277 | } | |
278 | } | |
279 | ||
280 | /* SUFFIX is a suffix of STR. False if STR is null. */ | |
281 | static int | |
d2e4a39e | 282 | is_suffix (const char *str, const char *suffix) |
14f9c5c9 AS |
283 | { |
284 | int len1, len2; | |
285 | if (str == NULL) | |
286 | return 0; | |
287 | len1 = strlen (str); | |
288 | len2 = strlen (suffix); | |
289 | return (len1 >= len2 && STREQ (str + len1 - len2, suffix)); | |
290 | } | |
291 | ||
292 | /* Create a value of type TYPE whose contents come from VALADDR, if it | |
293 | * is non-null, and whose memory address (in the inferior) is | |
294 | * ADDRESS. */ | |
d2e4a39e AS |
295 | struct value * |
296 | value_from_contents_and_address (struct type *type, char *valaddr, | |
297 | CORE_ADDR address) | |
14f9c5c9 | 298 | { |
d2e4a39e AS |
299 | struct value *v = allocate_value (type); |
300 | if (valaddr == NULL) | |
14f9c5c9 AS |
301 | VALUE_LAZY (v) = 1; |
302 | else | |
303 | memcpy (VALUE_CONTENTS_RAW (v), valaddr, TYPE_LENGTH (type)); | |
304 | VALUE_ADDRESS (v) = address; | |
305 | if (address != 0) | |
306 | VALUE_LVAL (v) = lval_memory; | |
307 | return v; | |
308 | } | |
309 | ||
310 | /* The contents of value VAL, beginning at offset OFFSET, treated as a | |
311 | value of type TYPE. The result is an lval in memory if VAL is. */ | |
312 | ||
d2e4a39e AS |
313 | static struct value * |
314 | coerce_unspec_val_to_type (struct value *val, long offset, struct type *type) | |
14f9c5c9 AS |
315 | { |
316 | CHECK_TYPEDEF (type); | |
317 | if (VALUE_LVAL (val) == lval_memory) | |
318 | return value_at_lazy (type, | |
d2e4a39e AS |
319 | VALUE_ADDRESS (val) + VALUE_OFFSET (val) + offset, |
320 | NULL); | |
321 | else | |
14f9c5c9 | 322 | { |
d2e4a39e | 323 | struct value *result = allocate_value (type); |
14f9c5c9 | 324 | VALUE_LVAL (result) = not_lval; |
d2e4a39e | 325 | if (VALUE_ADDRESS (val) == 0) |
14f9c5c9 | 326 | memcpy (VALUE_CONTENTS_RAW (result), VALUE_CONTENTS (val) + offset, |
d2e4a39e | 327 | TYPE_LENGTH (type) > TYPE_LENGTH (VALUE_TYPE (val)) |
14f9c5c9 | 328 | ? TYPE_LENGTH (VALUE_TYPE (val)) : TYPE_LENGTH (type)); |
d2e4a39e | 329 | else |
14f9c5c9 | 330 | { |
d2e4a39e | 331 | VALUE_ADDRESS (result) = |
14f9c5c9 AS |
332 | VALUE_ADDRESS (val) + VALUE_OFFSET (val) + offset; |
333 | VALUE_LAZY (result) = 1; | |
334 | } | |
335 | return result; | |
336 | } | |
337 | } | |
338 | ||
d2e4a39e AS |
339 | static char * |
340 | cond_offset_host (char *valaddr, long offset) | |
14f9c5c9 AS |
341 | { |
342 | if (valaddr == NULL) | |
343 | return NULL; | |
344 | else | |
345 | return valaddr + offset; | |
346 | } | |
347 | ||
348 | static CORE_ADDR | |
ebf56fd3 | 349 | cond_offset_target (CORE_ADDR address, long offset) |
14f9c5c9 AS |
350 | { |
351 | if (address == 0) | |
352 | return 0; | |
d2e4a39e | 353 | else |
14f9c5c9 AS |
354 | return address + offset; |
355 | } | |
356 | ||
357 | /* Perform execute_command on the result of concatenating all | |
358 | arguments up to NULL. */ | |
359 | static void | |
d2e4a39e | 360 | do_command (const char *arg, ...) |
14f9c5c9 AS |
361 | { |
362 | int len; | |
d2e4a39e AS |
363 | char *cmd; |
364 | const char *s; | |
14f9c5c9 AS |
365 | va_list ap; |
366 | ||
367 | va_start (ap, arg); | |
368 | len = 0; | |
369 | s = arg; | |
370 | cmd = ""; | |
d2e4a39e | 371 | for (; s != NULL; s = va_arg (ap, const char *)) |
14f9c5c9 | 372 | { |
d2e4a39e | 373 | char *cmd1; |
14f9c5c9 | 374 | len += strlen (s); |
d2e4a39e | 375 | cmd1 = alloca (len + 1); |
14f9c5c9 AS |
376 | strcpy (cmd1, cmd); |
377 | strcat (cmd1, s); | |
378 | cmd = cmd1; | |
379 | } | |
380 | va_end (ap); | |
381 | execute_command (cmd, 0); | |
382 | } | |
14f9c5c9 | 383 | \f |
d2e4a39e | 384 | |
14f9c5c9 AS |
385 | /* Language Selection */ |
386 | ||
387 | /* If the main program is in Ada, return language_ada, otherwise return LANG | |
388 | (the main program is in Ada iif the adainit symbol is found). | |
389 | ||
390 | MAIN_PST is not used. */ | |
d2e4a39e | 391 | |
14f9c5c9 | 392 | enum language |
d2e4a39e AS |
393 | ada_update_initial_language (enum language lang, |
394 | struct partial_symtab *main_pst) | |
14f9c5c9 | 395 | { |
d2e4a39e AS |
396 | if (lookup_minimal_symbol ("adainit", (const char *) NULL, |
397 | (struct objfile *) NULL) != NULL) | |
14f9c5c9 AS |
398 | /* return language_ada; */ |
399 | /* FIXME: language_ada should be defined in defs.h */ | |
400 | return language_unknown; | |
401 | ||
402 | return lang; | |
403 | } | |
14f9c5c9 | 404 | \f |
d2e4a39e | 405 | |
14f9c5c9 AS |
406 | /* Symbols */ |
407 | ||
408 | /* Table of Ada operators and their GNAT-mangled names. Last entry is pair | |
409 | of NULLs. */ | |
410 | ||
d2e4a39e AS |
411 | const struct ada_opname_map ada_opname_table[] = { |
412 | {"Oadd", "\"+\"", BINOP_ADD}, | |
413 | {"Osubtract", "\"-\"", BINOP_SUB}, | |
414 | {"Omultiply", "\"*\"", BINOP_MUL}, | |
415 | {"Odivide", "\"/\"", BINOP_DIV}, | |
416 | {"Omod", "\"mod\"", BINOP_MOD}, | |
417 | {"Orem", "\"rem\"", BINOP_REM}, | |
418 | {"Oexpon", "\"**\"", BINOP_EXP}, | |
419 | {"Olt", "\"<\"", BINOP_LESS}, | |
420 | {"Ole", "\"<=\"", BINOP_LEQ}, | |
421 | {"Ogt", "\">\"", BINOP_GTR}, | |
422 | {"Oge", "\">=\"", BINOP_GEQ}, | |
423 | {"Oeq", "\"=\"", BINOP_EQUAL}, | |
424 | {"One", "\"/=\"", BINOP_NOTEQUAL}, | |
425 | {"Oand", "\"and\"", BINOP_BITWISE_AND}, | |
426 | {"Oor", "\"or\"", BINOP_BITWISE_IOR}, | |
427 | {"Oxor", "\"xor\"", BINOP_BITWISE_XOR}, | |
428 | {"Oconcat", "\"&\"", BINOP_CONCAT}, | |
429 | {"Oabs", "\"abs\"", UNOP_ABS}, | |
430 | {"Onot", "\"not\"", UNOP_LOGICAL_NOT}, | |
431 | {"Oadd", "\"+\"", UNOP_PLUS}, | |
432 | {"Osubtract", "\"-\"", UNOP_NEG}, | |
433 | {NULL, NULL} | |
14f9c5c9 AS |
434 | }; |
435 | ||
436 | /* True if STR should be suppressed in info listings. */ | |
437 | static int | |
d2e4a39e | 438 | is_suppressed_name (const char *str) |
14f9c5c9 AS |
439 | { |
440 | if (STREQN (str, "_ada_", 5)) | |
441 | str += 5; | |
442 | if (str[0] == '_' || str[0] == '\000') | |
443 | return 1; | |
444 | else | |
445 | { | |
d2e4a39e AS |
446 | const char *p; |
447 | const char *suffix = strstr (str, "___"); | |
14f9c5c9 AS |
448 | if (suffix != NULL && suffix[3] != 'X') |
449 | return 1; | |
450 | if (suffix == NULL) | |
451 | suffix = str + strlen (str); | |
d2e4a39e | 452 | for (p = suffix - 1; p != str; p -= 1) |
14f9c5c9 AS |
453 | if (isupper (*p)) |
454 | { | |
455 | int i; | |
456 | if (p[0] == 'X' && p[-1] != '_') | |
457 | goto OK; | |
458 | if (*p != 'O') | |
459 | return 1; | |
460 | for (i = 0; ada_opname_table[i].mangled != NULL; i += 1) | |
d2e4a39e | 461 | if (STREQN (ada_opname_table[i].mangled, p, |
14f9c5c9 AS |
462 | strlen (ada_opname_table[i].mangled))) |
463 | goto OK; | |
464 | return 1; | |
d2e4a39e | 465 | OK:; |
14f9c5c9 AS |
466 | } |
467 | return 0; | |
468 | } | |
469 | } | |
470 | ||
471 | /* The "mangled" form of DEMANGLED, according to GNAT conventions. | |
472 | * The result is valid until the next call to ada_mangle. */ | |
473 | char * | |
d2e4a39e | 474 | ada_mangle (const char *demangled) |
14f9c5c9 | 475 | { |
d2e4a39e | 476 | static char *mangling_buffer = NULL; |
14f9c5c9 | 477 | static size_t mangling_buffer_size = 0; |
d2e4a39e | 478 | const char *p; |
14f9c5c9 | 479 | int k; |
d2e4a39e | 480 | |
14f9c5c9 AS |
481 | if (demangled == NULL) |
482 | return NULL; | |
483 | ||
d2e4a39e AS |
484 | GROW_VECT (mangling_buffer, mangling_buffer_size, |
485 | 2 * strlen (demangled) + 10); | |
14f9c5c9 AS |
486 | |
487 | k = 0; | |
488 | for (p = demangled; *p != '\0'; p += 1) | |
489 | { | |
d2e4a39e | 490 | if (*p == '.') |
14f9c5c9 | 491 | { |
d2e4a39e | 492 | mangling_buffer[k] = mangling_buffer[k + 1] = '_'; |
14f9c5c9 AS |
493 | k += 2; |
494 | } | |
495 | else if (*p == '"') | |
496 | { | |
d2e4a39e | 497 | const struct ada_opname_map *mapping; |
14f9c5c9 AS |
498 | |
499 | for (mapping = ada_opname_table; | |
d2e4a39e AS |
500 | mapping->mangled != NULL && |
501 | !STREQN (mapping->demangled, p, strlen (mapping->demangled)); | |
14f9c5c9 AS |
502 | p += 1) |
503 | ; | |
504 | if (mapping->mangled == NULL) | |
505 | error ("invalid Ada operator name: %s", p); | |
d2e4a39e | 506 | strcpy (mangling_buffer + k, mapping->mangled); |
14f9c5c9 AS |
507 | k += strlen (mapping->mangled); |
508 | break; | |
509 | } | |
d2e4a39e | 510 | else |
14f9c5c9 AS |
511 | { |
512 | mangling_buffer[k] = *p; | |
513 | k += 1; | |
514 | } | |
515 | } | |
516 | ||
517 | mangling_buffer[k] = '\0'; | |
518 | return mangling_buffer; | |
519 | } | |
520 | ||
521 | /* Return NAME folded to lower case, or, if surrounded by single | |
522 | * quotes, unfolded, but with the quotes stripped away. Result good | |
523 | * to next call. */ | |
d2e4a39e AS |
524 | char * |
525 | ada_fold_name (const char *name) | |
14f9c5c9 | 526 | { |
d2e4a39e | 527 | static char *fold_buffer = NULL; |
14f9c5c9 AS |
528 | static size_t fold_buffer_size = 0; |
529 | ||
530 | int len = strlen (name); | |
d2e4a39e | 531 | GROW_VECT (fold_buffer, fold_buffer_size, len + 1); |
14f9c5c9 AS |
532 | |
533 | if (name[0] == '\'') | |
534 | { | |
d2e4a39e AS |
535 | strncpy (fold_buffer, name + 1, len - 2); |
536 | fold_buffer[len - 2] = '\000'; | |
14f9c5c9 AS |
537 | } |
538 | else | |
539 | { | |
540 | int i; | |
541 | for (i = 0; i <= len; i += 1) | |
542 | fold_buffer[i] = tolower (name[i]); | |
543 | } | |
544 | ||
545 | return fold_buffer; | |
546 | } | |
547 | ||
548 | /* Demangle: | |
549 | 1. Discard final __{DIGIT}+ or ${DIGIT}+ | |
550 | 2. Convert other instances of embedded "__" to `.'. | |
551 | 3. Discard leading _ada_. | |
552 | 4. Convert operator names to the appropriate quoted symbols. | |
553 | 5. Remove everything after first ___ if it is followed by | |
554 | 'X'. | |
555 | 6. Replace TK__ with __, and a trailing B or TKB with nothing. | |
556 | 7. Put symbols that should be suppressed in <...> brackets. | |
557 | 8. Remove trailing X[bn]* suffix (indicating names in package bodies). | |
558 | The resulting string is valid until the next call of ada_demangle. | |
559 | */ | |
560 | ||
561 | char * | |
d2e4a39e | 562 | ada_demangle (const char *mangled) |
14f9c5c9 AS |
563 | { |
564 | int i, j; | |
565 | int len0; | |
d2e4a39e AS |
566 | const char *p; |
567 | char *demangled; | |
14f9c5c9 | 568 | int at_start_name; |
d2e4a39e | 569 | static char *demangling_buffer = NULL; |
14f9c5c9 | 570 | static size_t demangling_buffer_size = 0; |
d2e4a39e | 571 | |
14f9c5c9 AS |
572 | if (STREQN (mangled, "_ada_", 5)) |
573 | mangled += 5; | |
574 | ||
575 | if (mangled[0] == '_' || mangled[0] == '<') | |
576 | goto Suppress; | |
577 | ||
578 | p = strstr (mangled, "___"); | |
579 | if (p == NULL) | |
580 | len0 = strlen (mangled); | |
d2e4a39e | 581 | else |
14f9c5c9 AS |
582 | { |
583 | if (p[3] == 'X') | |
584 | len0 = p - mangled; | |
585 | else | |
586 | goto Suppress; | |
587 | } | |
588 | if (len0 > 3 && STREQ (mangled + len0 - 3, "TKB")) | |
589 | len0 -= 3; | |
590 | if (len0 > 1 && STREQ (mangled + len0 - 1, "B")) | |
591 | len0 -= 1; | |
592 | ||
593 | /* Make demangled big enough for possible expansion by operator name. */ | |
d2e4a39e | 594 | GROW_VECT (demangling_buffer, demangling_buffer_size, 2 * len0 + 1); |
14f9c5c9 AS |
595 | demangled = demangling_buffer; |
596 | ||
d2e4a39e AS |
597 | if (isdigit (mangled[len0 - 1])) |
598 | { | |
599 | for (i = len0 - 2; i >= 0 && isdigit (mangled[i]); i -= 1) | |
600 | ; | |
601 | if (i > 1 && mangled[i] == '_' && mangled[i - 1] == '_') | |
602 | len0 = i - 1; | |
603 | else if (mangled[i] == '$') | |
604 | len0 = i; | |
605 | } | |
14f9c5c9 | 606 | |
d2e4a39e | 607 | for (i = 0, j = 0; i < len0 && !isalpha (mangled[i]); i += 1, j += 1) |
14f9c5c9 AS |
608 | demangled[j] = mangled[i]; |
609 | ||
610 | at_start_name = 1; | |
611 | while (i < len0) | |
612 | { | |
613 | if (at_start_name && mangled[i] == 'O') | |
614 | { | |
615 | int k; | |
616 | for (k = 0; ada_opname_table[k].mangled != NULL; k += 1) | |
617 | { | |
d2e4a39e AS |
618 | int op_len = strlen (ada_opname_table[k].mangled); |
619 | if (STREQN | |
620 | (ada_opname_table[k].mangled + 1, mangled + i + 1, | |
621 | op_len - 1) && !isalnum (mangled[i + op_len])) | |
14f9c5c9 AS |
622 | { |
623 | strcpy (demangled + j, ada_opname_table[k].demangled); | |
624 | at_start_name = 0; | |
625 | i += op_len; | |
626 | j += strlen (ada_opname_table[k].demangled); | |
627 | break; | |
628 | } | |
629 | } | |
630 | if (ada_opname_table[k].mangled != NULL) | |
631 | continue; | |
632 | } | |
633 | at_start_name = 0; | |
634 | ||
d2e4a39e | 635 | if (i < len0 - 4 && STREQN (mangled + i, "TK__", 4)) |
14f9c5c9 | 636 | i += 2; |
d2e4a39e | 637 | if (mangled[i] == 'X' && i != 0 && isalnum (mangled[i - 1])) |
14f9c5c9 AS |
638 | { |
639 | do | |
640 | i += 1; | |
641 | while (i < len0 && (mangled[i] == 'b' || mangled[i] == 'n')); | |
642 | if (i < len0) | |
643 | goto Suppress; | |
644 | } | |
d2e4a39e | 645 | else if (i < len0 - 2 && mangled[i] == '_' && mangled[i + 1] == '_') |
14f9c5c9 AS |
646 | { |
647 | demangled[j] = '.'; | |
648 | at_start_name = 1; | |
d2e4a39e AS |
649 | i += 2; |
650 | j += 1; | |
14f9c5c9 AS |
651 | } |
652 | else | |
653 | { | |
654 | demangled[j] = mangled[i]; | |
d2e4a39e AS |
655 | i += 1; |
656 | j += 1; | |
14f9c5c9 AS |
657 | } |
658 | } | |
659 | demangled[j] = '\000'; | |
660 | ||
661 | for (i = 0; demangled[i] != '\0'; i += 1) | |
662 | if (isupper (demangled[i]) || demangled[i] == ' ') | |
663 | goto Suppress; | |
664 | ||
665 | return demangled; | |
666 | ||
667 | Suppress: | |
d2e4a39e | 668 | GROW_VECT (demangling_buffer, demangling_buffer_size, strlen (mangled) + 3); |
14f9c5c9 AS |
669 | demangled = demangling_buffer; |
670 | if (mangled[0] == '<') | |
671 | strcpy (demangled, mangled); | |
672 | else | |
673 | sprintf (demangled, "<%s>", mangled); | |
674 | return demangled; | |
675 | ||
676 | } | |
677 | ||
678 | /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing | |
679 | * suffixes that encode debugging information or leading _ada_ on | |
680 | * SYM_NAME (see is_name_suffix commentary for the debugging | |
681 | * information that is ignored). If WILD, then NAME need only match a | |
682 | * suffix of SYM_NAME minus the same suffixes. Also returns 0 if | |
683 | * either argument is NULL. */ | |
684 | ||
685 | int | |
d2e4a39e | 686 | ada_match_name (const char *sym_name, const char *name, int wild) |
14f9c5c9 AS |
687 | { |
688 | if (sym_name == NULL || name == NULL) | |
689 | return 0; | |
690 | else if (wild) | |
691 | return wild_match (name, strlen (name), sym_name); | |
d2e4a39e AS |
692 | else |
693 | { | |
694 | int len_name = strlen (name); | |
695 | return (STREQN (sym_name, name, len_name) | |
696 | && is_name_suffix (sym_name + len_name)) | |
697 | || (STREQN (sym_name, "_ada_", 5) | |
698 | && STREQN (sym_name + 5, name, len_name) | |
699 | && is_name_suffix (sym_name + len_name + 5)); | |
700 | } | |
14f9c5c9 AS |
701 | } |
702 | ||
703 | /* True (non-zero) iff in Ada mode, the symbol SYM should be | |
704 | suppressed in info listings. */ | |
705 | ||
706 | int | |
ebf56fd3 | 707 | ada_suppress_symbol_printing (struct symbol *sym) |
14f9c5c9 | 708 | { |
176620f1 | 709 | if (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN) |
14f9c5c9 | 710 | return 1; |
d2e4a39e | 711 | else |
22abf04a | 712 | return is_suppressed_name (DEPRECATED_SYMBOL_NAME (sym)); |
14f9c5c9 | 713 | } |
14f9c5c9 | 714 | \f |
d2e4a39e | 715 | |
14f9c5c9 AS |
716 | /* Arrays */ |
717 | ||
718 | /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of | |
719 | array descriptors. */ | |
720 | ||
d2e4a39e AS |
721 | static char *bound_name[] = { |
722 | "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3", | |
14f9c5c9 AS |
723 | "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7" |
724 | }; | |
725 | ||
726 | /* Maximum number of array dimensions we are prepared to handle. */ | |
727 | ||
728 | #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char*))) | |
729 | ||
730 | /* Like modify_field, but allows bitpos > wordlength. */ | |
731 | ||
732 | static void | |
ebf56fd3 | 733 | modify_general_field (char *addr, LONGEST fieldval, int bitpos, int bitsize) |
14f9c5c9 | 734 | { |
d2e4a39e AS |
735 | modify_field (addr + sizeof (LONGEST) * bitpos / (8 * sizeof (LONGEST)), |
736 | fieldval, bitpos % (8 * sizeof (LONGEST)), bitsize); | |
14f9c5c9 AS |
737 | } |
738 | ||
739 | ||
740 | /* The desc_* routines return primitive portions of array descriptors | |
741 | (fat pointers). */ | |
742 | ||
743 | /* The descriptor or array type, if any, indicated by TYPE; removes | |
744 | level of indirection, if needed. */ | |
d2e4a39e AS |
745 | static struct type * |
746 | desc_base_type (struct type *type) | |
14f9c5c9 AS |
747 | { |
748 | if (type == NULL) | |
749 | return NULL; | |
750 | CHECK_TYPEDEF (type); | |
751 | if (type != NULL && TYPE_CODE (type) == TYPE_CODE_PTR) | |
752 | return check_typedef (TYPE_TARGET_TYPE (type)); | |
753 | else | |
754 | return type; | |
755 | } | |
756 | ||
757 | /* True iff TYPE indicates a "thin" array pointer type. */ | |
758 | static int | |
d2e4a39e | 759 | is_thin_pntr (struct type *type) |
14f9c5c9 | 760 | { |
d2e4a39e | 761 | return |
14f9c5c9 AS |
762 | is_suffix (ada_type_name (desc_base_type (type)), "___XUT") |
763 | || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE"); | |
764 | } | |
765 | ||
766 | /* The descriptor type for thin pointer type TYPE. */ | |
d2e4a39e AS |
767 | static struct type * |
768 | thin_descriptor_type (struct type *type) | |
14f9c5c9 | 769 | { |
d2e4a39e | 770 | struct type *base_type = desc_base_type (type); |
14f9c5c9 AS |
771 | if (base_type == NULL) |
772 | return NULL; | |
773 | if (is_suffix (ada_type_name (base_type), "___XVE")) | |
774 | return base_type; | |
d2e4a39e | 775 | else |
14f9c5c9 | 776 | { |
d2e4a39e | 777 | struct type *alt_type = ada_find_parallel_type (base_type, "___XVE"); |
14f9c5c9 AS |
778 | if (alt_type == NULL) |
779 | return base_type; | |
780 | else | |
781 | return alt_type; | |
782 | } | |
783 | } | |
784 | ||
785 | /* A pointer to the array data for thin-pointer value VAL. */ | |
d2e4a39e AS |
786 | static struct value * |
787 | thin_data_pntr (struct value *val) | |
14f9c5c9 | 788 | { |
d2e4a39e | 789 | struct type *type = VALUE_TYPE (val); |
14f9c5c9 | 790 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
d2e4a39e | 791 | return value_cast (desc_data_type (thin_descriptor_type (type)), |
14f9c5c9 | 792 | value_copy (val)); |
d2e4a39e | 793 | else |
14f9c5c9 AS |
794 | return value_from_longest (desc_data_type (thin_descriptor_type (type)), |
795 | VALUE_ADDRESS (val) + VALUE_OFFSET (val)); | |
796 | } | |
797 | ||
798 | /* True iff TYPE indicates a "thick" array pointer type. */ | |
799 | static int | |
d2e4a39e | 800 | is_thick_pntr (struct type *type) |
14f9c5c9 AS |
801 | { |
802 | type = desc_base_type (type); | |
803 | return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT | |
804 | && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL); | |
805 | } | |
806 | ||
807 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a | |
808 | pointer to one, the type of its bounds data; otherwise, NULL. */ | |
d2e4a39e AS |
809 | static struct type * |
810 | desc_bounds_type (struct type *type) | |
14f9c5c9 | 811 | { |
d2e4a39e | 812 | struct type *r; |
14f9c5c9 AS |
813 | |
814 | type = desc_base_type (type); | |
815 | ||
816 | if (type == NULL) | |
817 | return NULL; | |
818 | else if (is_thin_pntr (type)) | |
819 | { | |
820 | type = thin_descriptor_type (type); | |
821 | if (type == NULL) | |
822 | return NULL; | |
823 | r = lookup_struct_elt_type (type, "BOUNDS", 1); | |
824 | if (r != NULL) | |
825 | return check_typedef (r); | |
826 | } | |
827 | else if (TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
828 | { | |
829 | r = lookup_struct_elt_type (type, "P_BOUNDS", 1); | |
830 | if (r != NULL) | |
831 | return check_typedef (TYPE_TARGET_TYPE (check_typedef (r))); | |
832 | } | |
833 | return NULL; | |
834 | } | |
835 | ||
836 | /* If ARR is an array descriptor (fat or thin pointer), or pointer to | |
837 | one, a pointer to its bounds data. Otherwise NULL. */ | |
d2e4a39e AS |
838 | static struct value * |
839 | desc_bounds (struct value *arr) | |
14f9c5c9 | 840 | { |
d2e4a39e AS |
841 | struct type *type = check_typedef (VALUE_TYPE (arr)); |
842 | if (is_thin_pntr (type)) | |
14f9c5c9 | 843 | { |
d2e4a39e AS |
844 | struct type *bounds_type = |
845 | desc_bounds_type (thin_descriptor_type (type)); | |
14f9c5c9 AS |
846 | LONGEST addr; |
847 | ||
848 | if (desc_bounds_type == NULL) | |
849 | error ("Bad GNAT array descriptor"); | |
850 | ||
851 | /* NOTE: The following calculation is not really kosher, but | |
d2e4a39e AS |
852 | since desc_type is an XVE-encoded type (and shouldn't be), |
853 | the correct calculation is a real pain. FIXME (and fix GCC). */ | |
14f9c5c9 AS |
854 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
855 | addr = value_as_long (arr); | |
d2e4a39e | 856 | else |
14f9c5c9 AS |
857 | addr = VALUE_ADDRESS (arr) + VALUE_OFFSET (arr); |
858 | ||
d2e4a39e AS |
859 | return |
860 | value_from_longest (lookup_pointer_type (bounds_type), | |
861 | addr - TYPE_LENGTH (bounds_type)); | |
14f9c5c9 AS |
862 | } |
863 | ||
864 | else if (is_thick_pntr (type)) | |
d2e4a39e | 865 | return value_struct_elt (&arr, NULL, "P_BOUNDS", NULL, |
14f9c5c9 AS |
866 | "Bad GNAT array descriptor"); |
867 | else | |
868 | return NULL; | |
869 | } | |
870 | ||
871 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
872 | position of the field containing the address of the bounds data. */ | |
873 | static int | |
d2e4a39e | 874 | fat_pntr_bounds_bitpos (struct type *type) |
14f9c5c9 AS |
875 | { |
876 | return TYPE_FIELD_BITPOS (desc_base_type (type), 1); | |
877 | } | |
878 | ||
879 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
880 | size of the field containing the address of the bounds data. */ | |
881 | static int | |
d2e4a39e | 882 | fat_pntr_bounds_bitsize (struct type *type) |
14f9c5c9 AS |
883 | { |
884 | type = desc_base_type (type); | |
885 | ||
d2e4a39e | 886 | if (TYPE_FIELD_BITSIZE (type, 1) > 0) |
14f9c5c9 AS |
887 | return TYPE_FIELD_BITSIZE (type, 1); |
888 | else | |
889 | return 8 * TYPE_LENGTH (check_typedef (TYPE_FIELD_TYPE (type, 1))); | |
890 | } | |
891 | ||
892 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a | |
893 | pointer to one, the type of its array data (a | |
894 | pointer-to-array-with-no-bounds type); otherwise, NULL. Use | |
895 | ada_type_of_array to get an array type with bounds data. */ | |
d2e4a39e AS |
896 | static struct type * |
897 | desc_data_type (struct type *type) | |
14f9c5c9 AS |
898 | { |
899 | type = desc_base_type (type); | |
900 | ||
901 | /* NOTE: The following is bogus; see comment in desc_bounds. */ | |
902 | if (is_thin_pntr (type)) | |
d2e4a39e AS |
903 | return lookup_pointer_type |
904 | (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1))); | |
14f9c5c9 AS |
905 | else if (is_thick_pntr (type)) |
906 | return lookup_struct_elt_type (type, "P_ARRAY", 1); | |
907 | else | |
908 | return NULL; | |
909 | } | |
910 | ||
911 | /* If ARR is an array descriptor (fat or thin pointer), a pointer to | |
912 | its array data. */ | |
d2e4a39e AS |
913 | static struct value * |
914 | desc_data (struct value *arr) | |
14f9c5c9 | 915 | { |
d2e4a39e | 916 | struct type *type = VALUE_TYPE (arr); |
14f9c5c9 AS |
917 | if (is_thin_pntr (type)) |
918 | return thin_data_pntr (arr); | |
919 | else if (is_thick_pntr (type)) | |
d2e4a39e | 920 | return value_struct_elt (&arr, NULL, "P_ARRAY", NULL, |
14f9c5c9 AS |
921 | "Bad GNAT array descriptor"); |
922 | else | |
923 | return NULL; | |
924 | } | |
925 | ||
926 | ||
927 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
928 | position of the field containing the address of the data. */ | |
929 | static int | |
d2e4a39e | 930 | fat_pntr_data_bitpos (struct type *type) |
14f9c5c9 AS |
931 | { |
932 | return TYPE_FIELD_BITPOS (desc_base_type (type), 0); | |
933 | } | |
934 | ||
935 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
936 | size of the field containing the address of the data. */ | |
937 | static int | |
d2e4a39e | 938 | fat_pntr_data_bitsize (struct type *type) |
14f9c5c9 AS |
939 | { |
940 | type = desc_base_type (type); | |
941 | ||
942 | if (TYPE_FIELD_BITSIZE (type, 0) > 0) | |
943 | return TYPE_FIELD_BITSIZE (type, 0); | |
d2e4a39e | 944 | else |
14f9c5c9 AS |
945 | return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)); |
946 | } | |
947 | ||
948 | /* If BOUNDS is an array-bounds structure (or pointer to one), return | |
949 | the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
950 | bound, if WHICH is 1. The first bound is I=1. */ | |
d2e4a39e AS |
951 | static struct value * |
952 | desc_one_bound (struct value *bounds, int i, int which) | |
14f9c5c9 | 953 | { |
d2e4a39e | 954 | return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL, |
14f9c5c9 AS |
955 | "Bad GNAT array descriptor bounds"); |
956 | } | |
957 | ||
958 | /* If BOUNDS is an array-bounds structure type, return the bit position | |
959 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
960 | bound, if WHICH is 1. The first bound is I=1. */ | |
961 | static int | |
d2e4a39e | 962 | desc_bound_bitpos (struct type *type, int i, int which) |
14f9c5c9 | 963 | { |
d2e4a39e | 964 | return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2); |
14f9c5c9 AS |
965 | } |
966 | ||
967 | /* If BOUNDS is an array-bounds structure type, return the bit field size | |
968 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
969 | bound, if WHICH is 1. The first bound is I=1. */ | |
970 | static int | |
d2e4a39e | 971 | desc_bound_bitsize (struct type *type, int i, int which) |
14f9c5c9 AS |
972 | { |
973 | type = desc_base_type (type); | |
974 | ||
d2e4a39e AS |
975 | if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0) |
976 | return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2); | |
977 | else | |
978 | return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2)); | |
14f9c5c9 AS |
979 | } |
980 | ||
981 | /* If TYPE is the type of an array-bounds structure, the type of its | |
d2e4a39e AS |
982 | Ith bound (numbering from 1). Otherwise, NULL. */ |
983 | static struct type * | |
984 | desc_index_type (struct type *type, int i) | |
14f9c5c9 AS |
985 | { |
986 | type = desc_base_type (type); | |
987 | ||
988 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
d2e4a39e AS |
989 | return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1); |
990 | else | |
14f9c5c9 AS |
991 | return NULL; |
992 | } | |
993 | ||
994 | /* The number of index positions in the array-bounds type TYPE. 0 | |
995 | if TYPE is NULL. */ | |
996 | static int | |
d2e4a39e | 997 | desc_arity (struct type *type) |
14f9c5c9 AS |
998 | { |
999 | type = desc_base_type (type); | |
1000 | ||
1001 | if (type != NULL) | |
1002 | return TYPE_NFIELDS (type) / 2; | |
1003 | return 0; | |
1004 | } | |
1005 | ||
1006 | ||
1007 | /* Non-zero iff type is a simple array type (or pointer to one). */ | |
1008 | int | |
d2e4a39e | 1009 | ada_is_simple_array (struct type *type) |
14f9c5c9 AS |
1010 | { |
1011 | if (type == NULL) | |
1012 | return 0; | |
1013 | CHECK_TYPEDEF (type); | |
1014 | return (TYPE_CODE (type) == TYPE_CODE_ARRAY | |
1015 | || (TYPE_CODE (type) == TYPE_CODE_PTR | |
1016 | && TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY)); | |
1017 | } | |
1018 | ||
1019 | /* Non-zero iff type belongs to a GNAT array descriptor. */ | |
1020 | int | |
d2e4a39e | 1021 | ada_is_array_descriptor (struct type *type) |
14f9c5c9 | 1022 | { |
d2e4a39e | 1023 | struct type *data_type = desc_data_type (type); |
14f9c5c9 AS |
1024 | |
1025 | if (type == NULL) | |
1026 | return 0; | |
1027 | CHECK_TYPEDEF (type); | |
d2e4a39e | 1028 | return |
14f9c5c9 AS |
1029 | data_type != NULL |
1030 | && ((TYPE_CODE (data_type) == TYPE_CODE_PTR | |
1031 | && TYPE_TARGET_TYPE (data_type) != NULL | |
1032 | && TYPE_CODE (TYPE_TARGET_TYPE (data_type)) == TYPE_CODE_ARRAY) | |
d2e4a39e | 1033 | || |
14f9c5c9 AS |
1034 | TYPE_CODE (data_type) == TYPE_CODE_ARRAY) |
1035 | && desc_arity (desc_bounds_type (type)) > 0; | |
1036 | } | |
1037 | ||
1038 | /* Non-zero iff type is a partially mal-formed GNAT array | |
1039 | descriptor. (FIXME: This is to compensate for some problems with | |
1040 | debugging output from GNAT. Re-examine periodically to see if it | |
1041 | is still needed. */ | |
1042 | int | |
ebf56fd3 | 1043 | ada_is_bogus_array_descriptor (struct type *type) |
14f9c5c9 | 1044 | { |
d2e4a39e | 1045 | return |
14f9c5c9 AS |
1046 | type != NULL |
1047 | && TYPE_CODE (type) == TYPE_CODE_STRUCT | |
1048 | && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL | |
1049 | || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL) | |
d2e4a39e | 1050 | && !ada_is_array_descriptor (type); |
14f9c5c9 AS |
1051 | } |
1052 | ||
1053 | ||
1054 | /* If ARR has a record type in the form of a standard GNAT array descriptor, | |
1055 | (fat pointer) returns the type of the array data described---specifically, | |
1056 | a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled | |
1057 | in from the descriptor; otherwise, they are left unspecified. If | |
1058 | the ARR denotes a null array descriptor and BOUNDS is non-zero, | |
1059 | returns NULL. The result is simply the type of ARR if ARR is not | |
1060 | a descriptor. */ | |
d2e4a39e AS |
1061 | struct type * |
1062 | ada_type_of_array (struct value *arr, int bounds) | |
14f9c5c9 AS |
1063 | { |
1064 | if (ada_is_packed_array_type (VALUE_TYPE (arr))) | |
1065 | return decode_packed_array_type (VALUE_TYPE (arr)); | |
1066 | ||
d2e4a39e | 1067 | if (!ada_is_array_descriptor (VALUE_TYPE (arr))) |
14f9c5c9 | 1068 | return VALUE_TYPE (arr); |
d2e4a39e AS |
1069 | |
1070 | if (!bounds) | |
1071 | return | |
1072 | check_typedef (TYPE_TARGET_TYPE (desc_data_type (VALUE_TYPE (arr)))); | |
14f9c5c9 AS |
1073 | else |
1074 | { | |
d2e4a39e | 1075 | struct type *elt_type; |
14f9c5c9 | 1076 | int arity; |
d2e4a39e | 1077 | struct value *descriptor; |
14f9c5c9 AS |
1078 | struct objfile *objf = TYPE_OBJFILE (VALUE_TYPE (arr)); |
1079 | ||
1080 | elt_type = ada_array_element_type (VALUE_TYPE (arr), -1); | |
1081 | arity = ada_array_arity (VALUE_TYPE (arr)); | |
1082 | ||
d2e4a39e | 1083 | if (elt_type == NULL || arity == 0) |
14f9c5c9 AS |
1084 | return check_typedef (VALUE_TYPE (arr)); |
1085 | ||
1086 | descriptor = desc_bounds (arr); | |
d2e4a39e | 1087 | if (value_as_long (descriptor) == 0) |
14f9c5c9 | 1088 | return NULL; |
d2e4a39e AS |
1089 | while (arity > 0) |
1090 | { | |
1091 | struct type *range_type = alloc_type (objf); | |
1092 | struct type *array_type = alloc_type (objf); | |
1093 | struct value *low = desc_one_bound (descriptor, arity, 0); | |
1094 | struct value *high = desc_one_bound (descriptor, arity, 1); | |
1095 | arity -= 1; | |
1096 | ||
1097 | create_range_type (range_type, VALUE_TYPE (low), | |
1098 | (int) value_as_long (low), | |
1099 | (int) value_as_long (high)); | |
1100 | elt_type = create_array_type (array_type, elt_type, range_type); | |
1101 | } | |
14f9c5c9 AS |
1102 | |
1103 | return lookup_pointer_type (elt_type); | |
1104 | } | |
1105 | } | |
1106 | ||
1107 | /* If ARR does not represent an array, returns ARR unchanged. | |
1108 | Otherwise, returns either a standard GDB array with bounds set | |
1109 | appropriately or, if ARR is a non-null fat pointer, a pointer to a standard | |
1110 | GDB array. Returns NULL if ARR is a null fat pointer. */ | |
d2e4a39e AS |
1111 | struct value * |
1112 | ada_coerce_to_simple_array_ptr (struct value *arr) | |
14f9c5c9 AS |
1113 | { |
1114 | if (ada_is_array_descriptor (VALUE_TYPE (arr))) | |
1115 | { | |
d2e4a39e | 1116 | struct type *arrType = ada_type_of_array (arr, 1); |
14f9c5c9 AS |
1117 | if (arrType == NULL) |
1118 | return NULL; | |
1119 | return value_cast (arrType, value_copy (desc_data (arr))); | |
1120 | } | |
1121 | else if (ada_is_packed_array_type (VALUE_TYPE (arr))) | |
1122 | return decode_packed_array (arr); | |
1123 | else | |
1124 | return arr; | |
1125 | } | |
1126 | ||
1127 | /* If ARR does not represent an array, returns ARR unchanged. | |
1128 | Otherwise, returns a standard GDB array describing ARR (which may | |
1129 | be ARR itself if it already is in the proper form). */ | |
d2e4a39e AS |
1130 | struct value * |
1131 | ada_coerce_to_simple_array (struct value *arr) | |
14f9c5c9 AS |
1132 | { |
1133 | if (ada_is_array_descriptor (VALUE_TYPE (arr))) | |
1134 | { | |
d2e4a39e | 1135 | struct value *arrVal = ada_coerce_to_simple_array_ptr (arr); |
14f9c5c9 AS |
1136 | if (arrVal == NULL) |
1137 | error ("Bounds unavailable for null array pointer."); | |
1138 | return value_ind (arrVal); | |
1139 | } | |
1140 | else if (ada_is_packed_array_type (VALUE_TYPE (arr))) | |
1141 | return decode_packed_array (arr); | |
d2e4a39e | 1142 | else |
14f9c5c9 AS |
1143 | return arr; |
1144 | } | |
1145 | ||
1146 | /* If TYPE represents a GNAT array type, return it translated to an | |
1147 | ordinary GDB array type (possibly with BITSIZE fields indicating | |
1148 | packing). For other types, is the identity. */ | |
d2e4a39e AS |
1149 | struct type * |
1150 | ada_coerce_to_simple_array_type (struct type *type) | |
14f9c5c9 | 1151 | { |
d2e4a39e AS |
1152 | struct value *mark = value_mark (); |
1153 | struct value *dummy = value_from_longest (builtin_type_long, 0); | |
1154 | struct type *result; | |
14f9c5c9 AS |
1155 | VALUE_TYPE (dummy) = type; |
1156 | result = ada_type_of_array (dummy, 0); | |
1157 | value_free_to_mark (dummy); | |
1158 | return result; | |
1159 | } | |
1160 | ||
1161 | /* Non-zero iff TYPE represents a standard GNAT packed-array type. */ | |
1162 | int | |
d2e4a39e | 1163 | ada_is_packed_array_type (struct type *type) |
14f9c5c9 AS |
1164 | { |
1165 | if (type == NULL) | |
1166 | return 0; | |
1167 | CHECK_TYPEDEF (type); | |
d2e4a39e | 1168 | return |
14f9c5c9 AS |
1169 | ada_type_name (type) != NULL |
1170 | && strstr (ada_type_name (type), "___XP") != NULL; | |
1171 | } | |
1172 | ||
1173 | /* Given that TYPE is a standard GDB array type with all bounds filled | |
1174 | in, and that the element size of its ultimate scalar constituents | |
1175 | (that is, either its elements, or, if it is an array of arrays, its | |
1176 | elements' elements, etc.) is *ELT_BITS, return an identical type, | |
1177 | but with the bit sizes of its elements (and those of any | |
1178 | constituent arrays) recorded in the BITSIZE components of its | |
1179 | TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size | |
1180 | in bits. */ | |
d2e4a39e AS |
1181 | static struct type * |
1182 | packed_array_type (struct type *type, long *elt_bits) | |
14f9c5c9 | 1183 | { |
d2e4a39e AS |
1184 | struct type *new_elt_type; |
1185 | struct type *new_type; | |
14f9c5c9 AS |
1186 | LONGEST low_bound, high_bound; |
1187 | ||
1188 | CHECK_TYPEDEF (type); | |
1189 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY) | |
1190 | return type; | |
1191 | ||
1192 | new_type = alloc_type (TYPE_OBJFILE (type)); | |
1193 | new_elt_type = packed_array_type (check_typedef (TYPE_TARGET_TYPE (type)), | |
1194 | elt_bits); | |
1195 | create_array_type (new_type, new_elt_type, TYPE_FIELD_TYPE (type, 0)); | |
1196 | TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits; | |
1197 | TYPE_NAME (new_type) = ada_type_name (type); | |
1198 | ||
d2e4a39e | 1199 | if (get_discrete_bounds (TYPE_FIELD_TYPE (type, 0), |
14f9c5c9 AS |
1200 | &low_bound, &high_bound) < 0) |
1201 | low_bound = high_bound = 0; | |
1202 | if (high_bound < low_bound) | |
1203 | *elt_bits = TYPE_LENGTH (new_type) = 0; | |
d2e4a39e | 1204 | else |
14f9c5c9 AS |
1205 | { |
1206 | *elt_bits *= (high_bound - low_bound + 1); | |
d2e4a39e | 1207 | TYPE_LENGTH (new_type) = |
14f9c5c9 AS |
1208 | (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; |
1209 | } | |
1210 | ||
1211 | /* TYPE_FLAGS (new_type) |= TYPE_FLAG_FIXED_INSTANCE; */ | |
1212 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in gdbtypes.h */ | |
1213 | return new_type; | |
1214 | } | |
1215 | ||
1216 | /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). | |
1217 | */ | |
d2e4a39e AS |
1218 | static struct type * |
1219 | decode_packed_array_type (struct type *type) | |
1220 | { | |
1221 | struct symbol **syms; | |
1222 | struct block **blocks; | |
1223 | const char *raw_name = ada_type_name (check_typedef (type)); | |
1224 | char *name = (char *) alloca (strlen (raw_name) + 1); | |
1225 | char *tail = strstr (raw_name, "___XP"); | |
1226 | struct type *shadow_type; | |
14f9c5c9 AS |
1227 | long bits; |
1228 | int i, n; | |
1229 | ||
1230 | memcpy (name, raw_name, tail - raw_name); | |
1231 | name[tail - raw_name] = '\000'; | |
1232 | ||
1233 | /* NOTE: Use ada_lookup_symbol_list because of bug in some versions | |
1234 | * of gcc (Solaris, e.g.). FIXME when compiler is fixed. */ | |
d2e4a39e | 1235 | n = ada_lookup_symbol_list (name, get_selected_block (NULL), |
176620f1 | 1236 | VAR_DOMAIN, &syms, &blocks); |
14f9c5c9 AS |
1237 | for (i = 0; i < n; i += 1) |
1238 | if (syms[i] != NULL && SYMBOL_CLASS (syms[i]) == LOC_TYPEDEF | |
1239 | && STREQ (name, ada_type_name (SYMBOL_TYPE (syms[i])))) | |
1240 | break; | |
1241 | if (i >= n) | |
1242 | { | |
1243 | warning ("could not find bounds information on packed array"); | |
1244 | return NULL; | |
1245 | } | |
1246 | shadow_type = SYMBOL_TYPE (syms[i]); | |
1247 | ||
1248 | if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY) | |
1249 | { | |
1250 | warning ("could not understand bounds information on packed array"); | |
1251 | return NULL; | |
1252 | } | |
d2e4a39e | 1253 | |
14f9c5c9 AS |
1254 | if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1) |
1255 | { | |
1256 | warning ("could not understand bit size information on packed array"); | |
1257 | return NULL; | |
1258 | } | |
d2e4a39e | 1259 | |
14f9c5c9 AS |
1260 | return packed_array_type (shadow_type, &bits); |
1261 | } | |
1262 | ||
1263 | /* Given that ARR is a struct value* indicating a GNAT packed array, | |
1264 | returns a simple array that denotes that array. Its type is a | |
1265 | standard GDB array type except that the BITSIZEs of the array | |
1266 | target types are set to the number of bits in each element, and the | |
1267 | type length is set appropriately. */ | |
1268 | ||
d2e4a39e AS |
1269 | static struct value * |
1270 | decode_packed_array (struct value *arr) | |
14f9c5c9 | 1271 | { |
d2e4a39e | 1272 | struct type *type = decode_packed_array_type (VALUE_TYPE (arr)); |
14f9c5c9 AS |
1273 | |
1274 | if (type == NULL) | |
1275 | { | |
1276 | error ("can't unpack array"); | |
1277 | return NULL; | |
1278 | } | |
1279 | else | |
1280 | return coerce_unspec_val_to_type (arr, 0, type); | |
1281 | } | |
1282 | ||
1283 | ||
1284 | /* The value of the element of packed array ARR at the ARITY indices | |
1285 | given in IND. ARR must be a simple array. */ | |
1286 | ||
d2e4a39e AS |
1287 | static struct value * |
1288 | value_subscript_packed (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
1289 | { |
1290 | int i; | |
1291 | int bits, elt_off, bit_off; | |
1292 | long elt_total_bit_offset; | |
d2e4a39e AS |
1293 | struct type *elt_type; |
1294 | struct value *v; | |
14f9c5c9 AS |
1295 | |
1296 | bits = 0; | |
1297 | elt_total_bit_offset = 0; | |
1298 | elt_type = check_typedef (VALUE_TYPE (arr)); | |
d2e4a39e | 1299 | for (i = 0; i < arity; i += 1) |
14f9c5c9 | 1300 | { |
d2e4a39e | 1301 | if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY |
14f9c5c9 | 1302 | || TYPE_FIELD_BITSIZE (elt_type, 0) == 0) |
d2e4a39e AS |
1303 | error |
1304 | ("attempt to do packed indexing of something other than a packed array"); | |
14f9c5c9 AS |
1305 | else |
1306 | { | |
1307 | struct type *range_type = TYPE_INDEX_TYPE (elt_type); | |
1308 | LONGEST lowerbound, upperbound; | |
1309 | LONGEST idx; | |
1310 | ||
d2e4a39e | 1311 | if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0) |
14f9c5c9 AS |
1312 | { |
1313 | warning ("don't know bounds of array"); | |
1314 | lowerbound = upperbound = 0; | |
1315 | } | |
d2e4a39e | 1316 | |
14f9c5c9 AS |
1317 | idx = value_as_long (value_pos_atr (ind[i])); |
1318 | if (idx < lowerbound || idx > upperbound) | |
1319 | warning ("packed array index %ld out of bounds", (long) idx); | |
1320 | bits = TYPE_FIELD_BITSIZE (elt_type, 0); | |
1321 | elt_total_bit_offset += (idx - lowerbound) * bits; | |
1322 | elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type)); | |
1323 | } | |
1324 | } | |
1325 | elt_off = elt_total_bit_offset / HOST_CHAR_BIT; | |
1326 | bit_off = elt_total_bit_offset % HOST_CHAR_BIT; | |
d2e4a39e AS |
1327 | |
1328 | v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off, | |
14f9c5c9 AS |
1329 | bits, elt_type); |
1330 | if (VALUE_LVAL (arr) == lval_internalvar) | |
1331 | VALUE_LVAL (v) = lval_internalvar_component; | |
1332 | else | |
1333 | VALUE_LVAL (v) = VALUE_LVAL (arr); | |
1334 | return v; | |
1335 | } | |
1336 | ||
1337 | /* Non-zero iff TYPE includes negative integer values. */ | |
1338 | ||
1339 | static int | |
d2e4a39e | 1340 | has_negatives (struct type *type) |
14f9c5c9 | 1341 | { |
d2e4a39e AS |
1342 | switch (TYPE_CODE (type)) |
1343 | { | |
1344 | default: | |
1345 | return 0; | |
1346 | case TYPE_CODE_INT: | |
1347 | return !TYPE_UNSIGNED (type); | |
1348 | case TYPE_CODE_RANGE: | |
1349 | return TYPE_LOW_BOUND (type) < 0; | |
1350 | } | |
14f9c5c9 | 1351 | } |
d2e4a39e | 1352 | |
14f9c5c9 AS |
1353 | |
1354 | /* Create a new value of type TYPE from the contents of OBJ starting | |
1355 | at byte OFFSET, and bit offset BIT_OFFSET within that byte, | |
1356 | proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then | |
1357 | assigning through the result will set the field fetched from. OBJ | |
1358 | may also be NULL, in which case, VALADDR+OFFSET must address the | |
1359 | start of storage containing the packed value. The value returned | |
1360 | in this case is never an lval. | |
1361 | Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */ | |
1362 | ||
d2e4a39e AS |
1363 | struct value * |
1364 | ada_value_primitive_packed_val (struct value *obj, char *valaddr, long offset, | |
1365 | int bit_offset, int bit_size, | |
1366 | struct type *type) | |
14f9c5c9 | 1367 | { |
d2e4a39e | 1368 | struct value *v; |
14f9c5c9 AS |
1369 | int src, /* Index into the source area. */ |
1370 | targ, /* Index into the target area. */ | |
d2e4a39e | 1371 | i, srcBitsLeft, /* Number of source bits left to move. */ |
14f9c5c9 AS |
1372 | nsrc, ntarg, /* Number of source and target bytes. */ |
1373 | unusedLS, /* Number of bits in next significant | |
1374 | * byte of source that are unused. */ | |
1375 | accumSize; /* Number of meaningful bits in accum */ | |
d2e4a39e AS |
1376 | unsigned char *bytes; /* First byte containing data to unpack. */ |
1377 | unsigned char *unpacked; | |
14f9c5c9 AS |
1378 | unsigned long accum; /* Staging area for bits being transferred */ |
1379 | unsigned char sign; | |
1380 | int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8; | |
1381 | /* Transmit bytes from least to most significant; delta is the | |
d2e4a39e | 1382 | * direction the indices move. */ |
14f9c5c9 AS |
1383 | int delta = BITS_BIG_ENDIAN ? -1 : 1; |
1384 | ||
1385 | CHECK_TYPEDEF (type); | |
1386 | ||
1387 | if (obj == NULL) | |
1388 | { | |
1389 | v = allocate_value (type); | |
d2e4a39e | 1390 | bytes = (unsigned char *) (valaddr + offset); |
14f9c5c9 AS |
1391 | } |
1392 | else if (VALUE_LAZY (obj)) | |
1393 | { | |
1394 | v = value_at (type, | |
1395 | VALUE_ADDRESS (obj) + VALUE_OFFSET (obj) + offset, NULL); | |
d2e4a39e | 1396 | bytes = (unsigned char *) alloca (len); |
14f9c5c9 AS |
1397 | read_memory (VALUE_ADDRESS (v), bytes, len); |
1398 | } | |
d2e4a39e | 1399 | else |
14f9c5c9 AS |
1400 | { |
1401 | v = allocate_value (type); | |
d2e4a39e | 1402 | bytes = (unsigned char *) VALUE_CONTENTS (obj) + offset; |
14f9c5c9 | 1403 | } |
d2e4a39e AS |
1404 | |
1405 | if (obj != NULL) | |
14f9c5c9 AS |
1406 | { |
1407 | VALUE_LVAL (v) = VALUE_LVAL (obj); | |
1408 | if (VALUE_LVAL (obj) == lval_internalvar) | |
1409 | VALUE_LVAL (v) = lval_internalvar_component; | |
1410 | VALUE_ADDRESS (v) = VALUE_ADDRESS (obj) + VALUE_OFFSET (obj) + offset; | |
1411 | VALUE_BITPOS (v) = bit_offset + VALUE_BITPOS (obj); | |
1412 | VALUE_BITSIZE (v) = bit_size; | |
1413 | if (VALUE_BITPOS (v) >= HOST_CHAR_BIT) | |
d2e4a39e AS |
1414 | { |
1415 | VALUE_ADDRESS (v) += 1; | |
1416 | VALUE_BITPOS (v) -= HOST_CHAR_BIT; | |
1417 | } | |
14f9c5c9 AS |
1418 | } |
1419 | else | |
1420 | VALUE_BITSIZE (v) = bit_size; | |
d2e4a39e | 1421 | unpacked = (unsigned char *) VALUE_CONTENTS (v); |
14f9c5c9 AS |
1422 | |
1423 | srcBitsLeft = bit_size; | |
1424 | nsrc = len; | |
1425 | ntarg = TYPE_LENGTH (type); | |
1426 | sign = 0; | |
1427 | if (bit_size == 0) | |
1428 | { | |
1429 | memset (unpacked, 0, TYPE_LENGTH (type)); | |
1430 | return v; | |
1431 | } | |
1432 | else if (BITS_BIG_ENDIAN) | |
1433 | { | |
d2e4a39e AS |
1434 | src = len - 1; |
1435 | if (has_negatives (type) && | |
1436 | ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1)))) | |
14f9c5c9 | 1437 | sign = ~0; |
d2e4a39e AS |
1438 | |
1439 | unusedLS = | |
14f9c5c9 AS |
1440 | (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT) |
1441 | % HOST_CHAR_BIT; | |
1442 | ||
1443 | switch (TYPE_CODE (type)) | |
d2e4a39e AS |
1444 | { |
1445 | case TYPE_CODE_ARRAY: | |
1446 | case TYPE_CODE_UNION: | |
1447 | case TYPE_CODE_STRUCT: | |
1448 | /* Non-scalar values must be aligned at a byte boundary. */ | |
1449 | accumSize = | |
1450 | (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT; | |
14f9c5c9 AS |
1451 | /* And are placed at the beginning (most-significant) bytes |
1452 | * of the target. */ | |
1453 | targ = src; | |
d2e4a39e AS |
1454 | break; |
1455 | default: | |
14f9c5c9 AS |
1456 | accumSize = 0; |
1457 | targ = TYPE_LENGTH (type) - 1; | |
d2e4a39e AS |
1458 | break; |
1459 | } | |
14f9c5c9 | 1460 | } |
d2e4a39e | 1461 | else |
14f9c5c9 AS |
1462 | { |
1463 | int sign_bit_offset = (bit_size + bit_offset - 1) % 8; | |
1464 | ||
1465 | src = targ = 0; | |
1466 | unusedLS = bit_offset; | |
1467 | accumSize = 0; | |
1468 | ||
d2e4a39e | 1469 | if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset))) |
14f9c5c9 AS |
1470 | sign = ~0; |
1471 | } | |
d2e4a39e | 1472 | |
14f9c5c9 AS |
1473 | accum = 0; |
1474 | while (nsrc > 0) | |
1475 | { | |
1476 | /* Mask for removing bits of the next source byte that are not | |
1477 | * part of the value. */ | |
d2e4a39e AS |
1478 | unsigned int unusedMSMask = |
1479 | (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) - | |
1480 | 1; | |
14f9c5c9 AS |
1481 | /* Sign-extend bits for this byte. */ |
1482 | unsigned int signMask = sign & ~unusedMSMask; | |
d2e4a39e | 1483 | accum |= |
14f9c5c9 AS |
1484 | (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize; |
1485 | accumSize += HOST_CHAR_BIT - unusedLS; | |
d2e4a39e | 1486 | if (accumSize >= HOST_CHAR_BIT) |
14f9c5c9 AS |
1487 | { |
1488 | unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT); | |
1489 | accumSize -= HOST_CHAR_BIT; | |
1490 | accum >>= HOST_CHAR_BIT; | |
1491 | ntarg -= 1; | |
1492 | targ += delta; | |
1493 | } | |
1494 | srcBitsLeft -= HOST_CHAR_BIT - unusedLS; | |
1495 | unusedLS = 0; | |
1496 | nsrc -= 1; | |
1497 | src += delta; | |
1498 | } | |
1499 | while (ntarg > 0) | |
1500 | { | |
1501 | accum |= sign << accumSize; | |
1502 | unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT); | |
1503 | accumSize -= HOST_CHAR_BIT; | |
1504 | accum >>= HOST_CHAR_BIT; | |
1505 | ntarg -= 1; | |
1506 | targ += delta; | |
1507 | } | |
1508 | ||
1509 | return v; | |
1510 | } | |
d2e4a39e | 1511 | |
14f9c5c9 AS |
1512 | /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to |
1513 | TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must | |
1514 | not overlap. */ | |
1515 | static void | |
d2e4a39e | 1516 | move_bits (char *target, int targ_offset, char *source, int src_offset, int n) |
14f9c5c9 AS |
1517 | { |
1518 | unsigned int accum, mask; | |
1519 | int accum_bits, chunk_size; | |
1520 | ||
1521 | target += targ_offset / HOST_CHAR_BIT; | |
1522 | targ_offset %= HOST_CHAR_BIT; | |
1523 | source += src_offset / HOST_CHAR_BIT; | |
1524 | src_offset %= HOST_CHAR_BIT; | |
d2e4a39e | 1525 | if (BITS_BIG_ENDIAN) |
14f9c5c9 AS |
1526 | { |
1527 | accum = (unsigned char) *source; | |
1528 | source += 1; | |
1529 | accum_bits = HOST_CHAR_BIT - src_offset; | |
1530 | ||
d2e4a39e | 1531 | while (n > 0) |
14f9c5c9 AS |
1532 | { |
1533 | int unused_right; | |
1534 | accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source; | |
1535 | accum_bits += HOST_CHAR_BIT; | |
1536 | source += 1; | |
1537 | chunk_size = HOST_CHAR_BIT - targ_offset; | |
1538 | if (chunk_size > n) | |
1539 | chunk_size = n; | |
1540 | unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset); | |
1541 | mask = ((1 << chunk_size) - 1) << unused_right; | |
d2e4a39e AS |
1542 | *target = |
1543 | (*target & ~mask) | |
14f9c5c9 AS |
1544 | | ((accum >> (accum_bits - chunk_size - unused_right)) & mask); |
1545 | n -= chunk_size; | |
1546 | accum_bits -= chunk_size; | |
1547 | target += 1; | |
1548 | targ_offset = 0; | |
1549 | } | |
1550 | } | |
1551 | else | |
1552 | { | |
1553 | accum = (unsigned char) *source >> src_offset; | |
1554 | source += 1; | |
1555 | accum_bits = HOST_CHAR_BIT - src_offset; | |
1556 | ||
d2e4a39e | 1557 | while (n > 0) |
14f9c5c9 AS |
1558 | { |
1559 | accum = accum + ((unsigned char) *source << accum_bits); | |
1560 | accum_bits += HOST_CHAR_BIT; | |
1561 | source += 1; | |
1562 | chunk_size = HOST_CHAR_BIT - targ_offset; | |
1563 | if (chunk_size > n) | |
1564 | chunk_size = n; | |
1565 | mask = ((1 << chunk_size) - 1) << targ_offset; | |
d2e4a39e | 1566 | *target = (*target & ~mask) | ((accum << targ_offset) & mask); |
14f9c5c9 AS |
1567 | n -= chunk_size; |
1568 | accum_bits -= chunk_size; | |
1569 | accum >>= chunk_size; | |
1570 | target += 1; | |
1571 | targ_offset = 0; | |
1572 | } | |
1573 | } | |
1574 | } | |
1575 | ||
1576 | ||
1577 | /* Store the contents of FROMVAL into the location of TOVAL. | |
1578 | Return a new value with the location of TOVAL and contents of | |
1579 | FROMVAL. Handles assignment into packed fields that have | |
1580 | floating-point or non-scalar types. */ | |
1581 | ||
d2e4a39e AS |
1582 | static struct value * |
1583 | ada_value_assign (struct value *toval, struct value *fromval) | |
14f9c5c9 | 1584 | { |
d2e4a39e | 1585 | struct type *type = VALUE_TYPE (toval); |
14f9c5c9 AS |
1586 | int bits = VALUE_BITSIZE (toval); |
1587 | ||
1588 | if (!toval->modifiable) | |
1589 | error ("Left operand of assignment is not a modifiable lvalue."); | |
1590 | ||
1591 | COERCE_REF (toval); | |
1592 | ||
d2e4a39e | 1593 | if (VALUE_LVAL (toval) == lval_memory |
14f9c5c9 | 1594 | && bits > 0 |
d2e4a39e | 1595 | && (TYPE_CODE (type) == TYPE_CODE_FLT |
14f9c5c9 AS |
1596 | || TYPE_CODE (type) == TYPE_CODE_STRUCT)) |
1597 | { | |
d2e4a39e AS |
1598 | int len = |
1599 | (VALUE_BITPOS (toval) + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
1600 | char *buffer = (char *) alloca (len); | |
1601 | struct value *val; | |
14f9c5c9 AS |
1602 | |
1603 | if (TYPE_CODE (type) == TYPE_CODE_FLT) | |
1604 | fromval = value_cast (type, fromval); | |
1605 | ||
1606 | read_memory (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval), buffer, len); | |
1607 | if (BITS_BIG_ENDIAN) | |
d2e4a39e AS |
1608 | move_bits (buffer, VALUE_BITPOS (toval), |
1609 | VALUE_CONTENTS (fromval), | |
1610 | TYPE_LENGTH (VALUE_TYPE (fromval)) * TARGET_CHAR_BIT - | |
1611 | bits, bits); | |
14f9c5c9 | 1612 | else |
d2e4a39e | 1613 | move_bits (buffer, VALUE_BITPOS (toval), VALUE_CONTENTS (fromval), |
14f9c5c9 | 1614 | 0, bits); |
d2e4a39e AS |
1615 | write_memory (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval), buffer, |
1616 | len); | |
14f9c5c9 AS |
1617 | |
1618 | val = value_copy (toval); | |
1619 | memcpy (VALUE_CONTENTS_RAW (val), VALUE_CONTENTS (fromval), | |
1620 | TYPE_LENGTH (type)); | |
1621 | VALUE_TYPE (val) = type; | |
d2e4a39e | 1622 | |
14f9c5c9 AS |
1623 | return val; |
1624 | } | |
1625 | ||
1626 | return value_assign (toval, fromval); | |
1627 | } | |
1628 | ||
1629 | ||
1630 | /* The value of the element of array ARR at the ARITY indices given in IND. | |
1631 | ARR may be either a simple array, GNAT array descriptor, or pointer | |
1632 | thereto. */ | |
1633 | ||
d2e4a39e AS |
1634 | struct value * |
1635 | ada_value_subscript (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
1636 | { |
1637 | int k; | |
d2e4a39e AS |
1638 | struct value *elt; |
1639 | struct type *elt_type; | |
14f9c5c9 AS |
1640 | |
1641 | elt = ada_coerce_to_simple_array (arr); | |
1642 | ||
1643 | elt_type = check_typedef (VALUE_TYPE (elt)); | |
d2e4a39e | 1644 | if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
1645 | && TYPE_FIELD_BITSIZE (elt_type, 0) > 0) |
1646 | return value_subscript_packed (elt, arity, ind); | |
1647 | ||
1648 | for (k = 0; k < arity; k += 1) | |
1649 | { | |
1650 | if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY) | |
d2e4a39e | 1651 | error ("too many subscripts (%d expected)", k); |
14f9c5c9 AS |
1652 | elt = value_subscript (elt, value_pos_atr (ind[k])); |
1653 | } | |
1654 | return elt; | |
1655 | } | |
1656 | ||
1657 | /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the | |
1658 | value of the element of *ARR at the ARITY indices given in | |
1659 | IND. Does not read the entire array into memory. */ | |
1660 | ||
d2e4a39e AS |
1661 | struct value * |
1662 | ada_value_ptr_subscript (struct value *arr, struct type *type, int arity, | |
1663 | struct value **ind) | |
14f9c5c9 AS |
1664 | { |
1665 | int k; | |
1666 | ||
1667 | for (k = 0; k < arity; k += 1) | |
1668 | { | |
1669 | LONGEST lwb, upb; | |
d2e4a39e | 1670 | struct value *idx; |
14f9c5c9 AS |
1671 | |
1672 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY) | |
d2e4a39e AS |
1673 | error ("too many subscripts (%d expected)", k); |
1674 | arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)), | |
14f9c5c9 AS |
1675 | value_copy (arr)); |
1676 | get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb); | |
d2e4a39e | 1677 | if (lwb == 0) |
14f9c5c9 AS |
1678 | idx = ind[k]; |
1679 | else | |
1680 | idx = value_sub (ind[k], value_from_longest (builtin_type_int, lwb)); | |
1681 | arr = value_add (arr, idx); | |
1682 | type = TYPE_TARGET_TYPE (type); | |
1683 | } | |
1684 | ||
1685 | return value_ind (arr); | |
1686 | } | |
1687 | ||
1688 | /* If type is a record type in the form of a standard GNAT array | |
1689 | descriptor, returns the number of dimensions for type. If arr is a | |
1690 | simple array, returns the number of "array of"s that prefix its | |
1691 | type designation. Otherwise, returns 0. */ | |
1692 | ||
1693 | int | |
d2e4a39e | 1694 | ada_array_arity (struct type *type) |
14f9c5c9 AS |
1695 | { |
1696 | int arity; | |
1697 | ||
1698 | if (type == NULL) | |
1699 | return 0; | |
1700 | ||
1701 | type = desc_base_type (type); | |
1702 | ||
1703 | arity = 0; | |
d2e4a39e | 1704 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
14f9c5c9 | 1705 | return desc_arity (desc_bounds_type (type)); |
d2e4a39e AS |
1706 | else |
1707 | while (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
14f9c5c9 AS |
1708 | { |
1709 | arity += 1; | |
1710 | type = check_typedef (TYPE_TARGET_TYPE (type)); | |
1711 | } | |
d2e4a39e | 1712 | |
14f9c5c9 AS |
1713 | return arity; |
1714 | } | |
1715 | ||
1716 | /* If TYPE is a record type in the form of a standard GNAT array | |
1717 | descriptor or a simple array type, returns the element type for | |
1718 | TYPE after indexing by NINDICES indices, or by all indices if | |
1719 | NINDICES is -1. Otherwise, returns NULL. */ | |
1720 | ||
d2e4a39e AS |
1721 | struct type * |
1722 | ada_array_element_type (struct type *type, int nindices) | |
14f9c5c9 AS |
1723 | { |
1724 | type = desc_base_type (type); | |
1725 | ||
d2e4a39e | 1726 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
14f9c5c9 AS |
1727 | { |
1728 | int k; | |
d2e4a39e | 1729 | struct type *p_array_type; |
14f9c5c9 AS |
1730 | |
1731 | p_array_type = desc_data_type (type); | |
1732 | ||
1733 | k = ada_array_arity (type); | |
1734 | if (k == 0) | |
1735 | return NULL; | |
d2e4a39e | 1736 | |
14f9c5c9 AS |
1737 | /* Initially p_array_type = elt_type(*)[]...(k times)...[] */ |
1738 | if (nindices >= 0 && k > nindices) | |
1739 | k = nindices; | |
1740 | p_array_type = TYPE_TARGET_TYPE (p_array_type); | |
d2e4a39e | 1741 | while (k > 0 && p_array_type != NULL) |
14f9c5c9 AS |
1742 | { |
1743 | p_array_type = check_typedef (TYPE_TARGET_TYPE (p_array_type)); | |
1744 | k -= 1; | |
1745 | } | |
1746 | return p_array_type; | |
1747 | } | |
1748 | else if (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
1749 | { | |
1750 | while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
1751 | { | |
1752 | type = TYPE_TARGET_TYPE (type); | |
1753 | nindices -= 1; | |
1754 | } | |
1755 | return type; | |
1756 | } | |
1757 | ||
1758 | return NULL; | |
1759 | } | |
1760 | ||
1761 | /* The type of nth index in arrays of given type (n numbering from 1). Does | |
1762 | not examine memory. */ | |
1763 | ||
d2e4a39e AS |
1764 | struct type * |
1765 | ada_index_type (struct type *type, int n) | |
14f9c5c9 AS |
1766 | { |
1767 | type = desc_base_type (type); | |
1768 | ||
1769 | if (n > ada_array_arity (type)) | |
1770 | return NULL; | |
1771 | ||
1772 | if (ada_is_simple_array (type)) | |
1773 | { | |
1774 | int i; | |
1775 | ||
1776 | for (i = 1; i < n; i += 1) | |
1777 | type = TYPE_TARGET_TYPE (type); | |
1778 | ||
1779 | return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 0)); | |
1780 | } | |
d2e4a39e | 1781 | else |
14f9c5c9 AS |
1782 | return desc_index_type (desc_bounds_type (type), n); |
1783 | } | |
1784 | ||
1785 | /* Given that arr is an array type, returns the lower bound of the | |
1786 | Nth index (numbering from 1) if WHICH is 0, and the upper bound if | |
1787 | WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an | |
1788 | array-descriptor type. If TYPEP is non-null, *TYPEP is set to the | |
1789 | bounds type. It works for other arrays with bounds supplied by | |
1790 | run-time quantities other than discriminants. */ | |
1791 | ||
1792 | LONGEST | |
d2e4a39e AS |
1793 | ada_array_bound_from_type (struct type * arr_type, int n, int which, |
1794 | struct type ** typep) | |
14f9c5c9 | 1795 | { |
d2e4a39e AS |
1796 | struct type *type; |
1797 | struct type *index_type_desc; | |
14f9c5c9 AS |
1798 | |
1799 | if (ada_is_packed_array_type (arr_type)) | |
1800 | arr_type = decode_packed_array_type (arr_type); | |
1801 | ||
d2e4a39e | 1802 | if (arr_type == NULL || !ada_is_simple_array (arr_type)) |
14f9c5c9 AS |
1803 | { |
1804 | if (typep != NULL) | |
1805 | *typep = builtin_type_int; | |
d2e4a39e | 1806 | return (LONGEST) - which; |
14f9c5c9 AS |
1807 | } |
1808 | ||
1809 | if (TYPE_CODE (arr_type) == TYPE_CODE_PTR) | |
1810 | type = TYPE_TARGET_TYPE (arr_type); | |
1811 | else | |
1812 | type = arr_type; | |
1813 | ||
1814 | index_type_desc = ada_find_parallel_type (type, "___XA"); | |
d2e4a39e | 1815 | if (index_type_desc == NULL) |
14f9c5c9 | 1816 | { |
d2e4a39e AS |
1817 | struct type *range_type; |
1818 | struct type *index_type; | |
14f9c5c9 | 1819 | |
d2e4a39e | 1820 | while (n > 1) |
14f9c5c9 AS |
1821 | { |
1822 | type = TYPE_TARGET_TYPE (type); | |
1823 | n -= 1; | |
1824 | } | |
1825 | ||
1826 | range_type = TYPE_INDEX_TYPE (type); | |
1827 | index_type = TYPE_TARGET_TYPE (range_type); | |
1828 | if (TYPE_CODE (index_type) == TYPE_CODE_UNDEF) | |
d2e4a39e | 1829 | index_type = builtin_type_long; |
14f9c5c9 AS |
1830 | if (typep != NULL) |
1831 | *typep = index_type; | |
d2e4a39e AS |
1832 | return |
1833 | (LONGEST) (which == 0 | |
14f9c5c9 AS |
1834 | ? TYPE_LOW_BOUND (range_type) |
1835 | : TYPE_HIGH_BOUND (range_type)); | |
1836 | } | |
d2e4a39e | 1837 | else |
14f9c5c9 | 1838 | { |
d2e4a39e AS |
1839 | struct type *index_type = |
1840 | to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, n - 1), | |
14f9c5c9 AS |
1841 | NULL, TYPE_OBJFILE (arr_type)); |
1842 | if (typep != NULL) | |
1843 | *typep = TYPE_TARGET_TYPE (index_type); | |
d2e4a39e AS |
1844 | return |
1845 | (LONGEST) (which == 0 | |
14f9c5c9 AS |
1846 | ? TYPE_LOW_BOUND (index_type) |
1847 | : TYPE_HIGH_BOUND (index_type)); | |
1848 | } | |
1849 | } | |
1850 | ||
1851 | /* Given that arr is an array value, returns the lower bound of the | |
1852 | nth index (numbering from 1) if which is 0, and the upper bound if | |
1853 | which is 1. This routine will also work for arrays with bounds | |
1854 | supplied by run-time quantities other than discriminants. */ | |
1855 | ||
d2e4a39e | 1856 | struct value * |
4dc81987 | 1857 | ada_array_bound (struct value *arr, int n, int which) |
14f9c5c9 | 1858 | { |
d2e4a39e | 1859 | struct type *arr_type = VALUE_TYPE (arr); |
14f9c5c9 AS |
1860 | |
1861 | if (ada_is_packed_array_type (arr_type)) | |
1862 | return ada_array_bound (decode_packed_array (arr), n, which); | |
d2e4a39e | 1863 | else if (ada_is_simple_array (arr_type)) |
14f9c5c9 | 1864 | { |
d2e4a39e | 1865 | struct type *type; |
14f9c5c9 AS |
1866 | LONGEST v = ada_array_bound_from_type (arr_type, n, which, &type); |
1867 | return value_from_longest (type, v); | |
1868 | } | |
1869 | else | |
1870 | return desc_one_bound (desc_bounds (arr), n, which); | |
1871 | } | |
1872 | ||
1873 | /* Given that arr is an array value, returns the length of the | |
1874 | nth index. This routine will also work for arrays with bounds | |
1875 | supplied by run-time quantities other than discriminants. Does not | |
1876 | work for arrays indexed by enumeration types with representation | |
d2e4a39e | 1877 | clauses at the moment. */ |
14f9c5c9 | 1878 | |
d2e4a39e AS |
1879 | struct value * |
1880 | ada_array_length (struct value *arr, int n) | |
14f9c5c9 | 1881 | { |
d2e4a39e AS |
1882 | struct type *arr_type = check_typedef (VALUE_TYPE (arr)); |
1883 | struct type *index_type_desc; | |
14f9c5c9 AS |
1884 | |
1885 | if (ada_is_packed_array_type (arr_type)) | |
1886 | return ada_array_length (decode_packed_array (arr), n); | |
1887 | ||
1888 | if (ada_is_simple_array (arr_type)) | |
1889 | { | |
d2e4a39e | 1890 | struct type *type; |
14f9c5c9 AS |
1891 | LONGEST v = |
1892 | ada_array_bound_from_type (arr_type, n, 1, &type) - | |
1893 | ada_array_bound_from_type (arr_type, n, 0, NULL) + 1; | |
1894 | return value_from_longest (type, v); | |
1895 | } | |
1896 | else | |
d2e4a39e | 1897 | return |
14f9c5c9 AS |
1898 | value_from_longest (builtin_type_ada_int, |
1899 | value_as_long (desc_one_bound (desc_bounds (arr), | |
1900 | n, 1)) | |
1901 | - value_as_long (desc_one_bound (desc_bounds (arr), | |
d2e4a39e | 1902 | n, 0)) + 1); |
14f9c5c9 | 1903 | } |
14f9c5c9 | 1904 | \f |
d2e4a39e | 1905 | |
14f9c5c9 AS |
1906 | /* Name resolution */ |
1907 | ||
1908 | /* The "demangled" name for the user-definable Ada operator corresponding | |
1909 | to op. */ | |
1910 | ||
d2e4a39e | 1911 | static const char * |
ebf56fd3 | 1912 | ada_op_name (enum exp_opcode op) |
14f9c5c9 AS |
1913 | { |
1914 | int i; | |
1915 | ||
1916 | for (i = 0; ada_opname_table[i].mangled != NULL; i += 1) | |
1917 | { | |
1918 | if (ada_opname_table[i].op == op) | |
1919 | return ada_opname_table[i].demangled; | |
1920 | } | |
1921 | error ("Could not find operator name for opcode"); | |
1922 | } | |
1923 | ||
1924 | ||
1925 | /* Same as evaluate_type (*EXP), but resolves ambiguous symbol | |
1926 | references (OP_UNRESOLVED_VALUES) and converts operators that are | |
1927 | user-defined into appropriate function calls. If CONTEXT_TYPE is | |
1928 | non-null, it provides a preferred result type [at the moment, only | |
1929 | type void has any effect---causing procedures to be preferred over | |
1930 | functions in calls]. A null CONTEXT_TYPE indicates that a non-void | |
1931 | return type is preferred. The variable unresolved_names contains a list | |
1932 | of character strings referenced by expout that should be freed. | |
1933 | May change (expand) *EXP. */ | |
1934 | ||
1935 | void | |
d2e4a39e | 1936 | ada_resolve (struct expression **expp, struct type *context_type) |
14f9c5c9 AS |
1937 | { |
1938 | int pc; | |
1939 | pc = 0; | |
1940 | ada_resolve_subexp (expp, &pc, 1, context_type); | |
1941 | } | |
1942 | ||
1943 | /* Resolve the operator of the subexpression beginning at | |
1944 | position *POS of *EXPP. "Resolving" consists of replacing | |
1945 | OP_UNRESOLVED_VALUE with an appropriate OP_VAR_VALUE, replacing | |
1946 | built-in operators with function calls to user-defined operators, | |
1947 | where appropriate, and (when DEPROCEDURE_P is non-zero), converting | |
1948 | function-valued variables into parameterless calls. May expand | |
1949 | EXP. The CONTEXT_TYPE functions as in ada_resolve, above. */ | |
1950 | ||
d2e4a39e AS |
1951 | static struct value * |
1952 | ada_resolve_subexp (struct expression **expp, int *pos, int deprocedure_p, | |
1953 | struct type *context_type) | |
14f9c5c9 AS |
1954 | { |
1955 | int pc = *pos; | |
1956 | int i; | |
d2e4a39e | 1957 | struct expression *exp; /* Convenience: == *expp */ |
14f9c5c9 | 1958 | enum exp_opcode op = (*expp)->elts[pc].opcode; |
d2e4a39e | 1959 | struct value **argvec; /* Vector of operand types (alloca'ed). */ |
14f9c5c9 AS |
1960 | int nargs; /* Number of operands */ |
1961 | ||
1962 | argvec = NULL; | |
1963 | nargs = 0; | |
1964 | exp = *expp; | |
1965 | ||
1966 | /* Pass one: resolve operands, saving their types and updating *pos. */ | |
1967 | switch (op) | |
1968 | { | |
1969 | case OP_VAR_VALUE: | |
d2e4a39e | 1970 | /* case OP_UNRESOLVED_VALUE: */ |
14f9c5c9 AS |
1971 | /* FIXME: OP_UNRESOLVED_VALUE should be defined in expression.h */ |
1972 | *pos += 4; | |
1973 | break; | |
1974 | ||
1975 | case OP_FUNCALL: | |
1976 | nargs = longest_to_int (exp->elts[pc + 1].longconst) + 1; | |
1977 | /* FIXME: OP_UNRESOLVED_VALUE should be defined in expression.h */ | |
d2e4a39e AS |
1978 | /* if (exp->elts[pc+3].opcode == OP_UNRESOLVED_VALUE) |
1979 | { | |
1980 | *pos += 7; | |
1981 | ||
1982 | argvec = (struct value* *) alloca (sizeof (struct value*) * (nargs + 1)); | |
1983 | for (i = 0; i < nargs-1; i += 1) | |
1984 | argvec[i] = ada_resolve_subexp (expp, pos, 1, NULL); | |
1985 | argvec[i] = NULL; | |
1986 | } | |
1987 | else | |
1988 | { | |
1989 | *pos += 3; | |
1990 | ada_resolve_subexp (expp, pos, 0, NULL); | |
1991 | for (i = 1; i < nargs; i += 1) | |
1992 | ada_resolve_subexp (expp, pos, 1, NULL); | |
1993 | } | |
1994 | */ | |
14f9c5c9 AS |
1995 | exp = *expp; |
1996 | break; | |
1997 | ||
1998 | /* FIXME: UNOP_QUAL should be defined in expression.h */ | |
1999 | /* case UNOP_QUAL: | |
d2e4a39e AS |
2000 | nargs = 1; |
2001 | *pos += 3; | |
2002 | ada_resolve_subexp (expp, pos, 1, exp->elts[pc + 1].type); | |
2003 | exp = *expp; | |
2004 | break; | |
2005 | */ | |
2006 | /* FIXME: OP_ATTRIBUTE should be defined in expression.h */ | |
14f9c5c9 | 2007 | /* case OP_ATTRIBUTE: |
d2e4a39e AS |
2008 | nargs = longest_to_int (exp->elts[pc + 1].longconst) + 1; |
2009 | *pos += 4; | |
2010 | for (i = 0; i < nargs; i += 1) | |
2011 | ada_resolve_subexp (expp, pos, 1, NULL); | |
2012 | exp = *expp; | |
2013 | break; | |
2014 | */ | |
14f9c5c9 AS |
2015 | case UNOP_ADDR: |
2016 | nargs = 1; | |
2017 | *pos += 1; | |
2018 | ada_resolve_subexp (expp, pos, 0, NULL); | |
2019 | exp = *expp; | |
2020 | break; | |
2021 | ||
2022 | case BINOP_ASSIGN: | |
2023 | { | |
d2e4a39e | 2024 | struct value *arg1; |
14f9c5c9 AS |
2025 | nargs = 2; |
2026 | *pos += 1; | |
2027 | arg1 = ada_resolve_subexp (expp, pos, 0, NULL); | |
2028 | if (arg1 == NULL) | |
2029 | ada_resolve_subexp (expp, pos, 1, NULL); | |
2030 | else | |
2031 | ada_resolve_subexp (expp, pos, 1, VALUE_TYPE (arg1)); | |
2032 | break; | |
2033 | } | |
2034 | ||
2035 | default: | |
d2e4a39e | 2036 | switch (op) |
14f9c5c9 AS |
2037 | { |
2038 | default: | |
2039 | error ("Unexpected operator during name resolution"); | |
2040 | case UNOP_CAST: | |
d2e4a39e AS |
2041 | /* case UNOP_MBR: |
2042 | nargs = 1; | |
2043 | *pos += 3; | |
2044 | break; | |
2045 | */ | |
14f9c5c9 AS |
2046 | case BINOP_ADD: |
2047 | case BINOP_SUB: | |
2048 | case BINOP_MUL: | |
2049 | case BINOP_DIV: | |
2050 | case BINOP_REM: | |
2051 | case BINOP_MOD: | |
2052 | case BINOP_EXP: | |
2053 | case BINOP_CONCAT: | |
2054 | case BINOP_LOGICAL_AND: | |
2055 | case BINOP_LOGICAL_OR: | |
2056 | case BINOP_BITWISE_AND: | |
2057 | case BINOP_BITWISE_IOR: | |
2058 | case BINOP_BITWISE_XOR: | |
2059 | ||
2060 | case BINOP_EQUAL: | |
2061 | case BINOP_NOTEQUAL: | |
2062 | case BINOP_LESS: | |
2063 | case BINOP_GTR: | |
2064 | case BINOP_LEQ: | |
2065 | case BINOP_GEQ: | |
2066 | ||
2067 | case BINOP_REPEAT: | |
2068 | case BINOP_SUBSCRIPT: | |
2069 | case BINOP_COMMA: | |
2070 | nargs = 2; | |
2071 | *pos += 1; | |
2072 | break; | |
2073 | ||
2074 | case UNOP_NEG: | |
2075 | case UNOP_PLUS: | |
2076 | case UNOP_LOGICAL_NOT: | |
2077 | case UNOP_ABS: | |
2078 | case UNOP_IND: | |
2079 | nargs = 1; | |
2080 | *pos += 1; | |
2081 | break; | |
2082 | ||
2083 | case OP_LONG: | |
2084 | case OP_DOUBLE: | |
2085 | case OP_VAR_VALUE: | |
2086 | *pos += 4; | |
2087 | break; | |
2088 | ||
2089 | case OP_TYPE: | |
2090 | case OP_BOOL: | |
2091 | case OP_LAST: | |
2092 | case OP_REGISTER: | |
2093 | case OP_INTERNALVAR: | |
2094 | *pos += 3; | |
2095 | break; | |
2096 | ||
2097 | case UNOP_MEMVAL: | |
2098 | *pos += 3; | |
2099 | nargs = 1; | |
2100 | break; | |
2101 | ||
2102 | case STRUCTOP_STRUCT: | |
2103 | case STRUCTOP_PTR: | |
2104 | nargs = 1; | |
2105 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
2106 | break; | |
2107 | ||
2108 | case OP_ARRAY: | |
d2e4a39e | 2109 | *pos += 4; |
14f9c5c9 AS |
2110 | nargs = longest_to_int (exp->elts[pc + 2].longconst) + 1; |
2111 | nargs -= longest_to_int (exp->elts[pc + 1].longconst); | |
2112 | /* A null array contains one dummy element to give the type. */ | |
d2e4a39e AS |
2113 | /* if (nargs == 0) |
2114 | nargs = 1; | |
2115 | break; */ | |
14f9c5c9 AS |
2116 | |
2117 | case TERNOP_SLICE: | |
2118 | /* FIXME: TERNOP_MBR should be defined in expression.h */ | |
d2e4a39e AS |
2119 | /* case TERNOP_MBR: |
2120 | *pos += 1; | |
2121 | nargs = 3; | |
2122 | break; | |
2123 | */ | |
14f9c5c9 | 2124 | /* FIXME: BINOP_MBR should be defined in expression.h */ |
d2e4a39e AS |
2125 | /* case BINOP_MBR: |
2126 | *pos += 3; | |
2127 | nargs = 2; | |
2128 | break; */ | |
14f9c5c9 AS |
2129 | } |
2130 | ||
d2e4a39e AS |
2131 | argvec = |
2132 | (struct value * *) alloca (sizeof (struct value *) * (nargs + 1)); | |
14f9c5c9 AS |
2133 | for (i = 0; i < nargs; i += 1) |
2134 | argvec[i] = ada_resolve_subexp (expp, pos, 1, NULL); | |
2135 | argvec[i] = NULL; | |
2136 | exp = *expp; | |
2137 | break; | |
2138 | } | |
2139 | ||
2140 | /* Pass two: perform any resolution on principal operator. */ | |
2141 | switch (op) | |
2142 | { | |
2143 | default: | |
2144 | break; | |
2145 | ||
2146 | /* FIXME: OP_UNRESOLVED_VALUE should be defined in expression.h */ | |
2147 | /* case OP_UNRESOLVED_VALUE: | |
d2e4a39e AS |
2148 | { |
2149 | struct symbol** candidate_syms; | |
2150 | struct block** candidate_blocks; | |
2151 | int n_candidates; | |
2152 | ||
2153 | n_candidates = ada_lookup_symbol_list (exp->elts[pc + 2].name, | |
2154 | exp->elts[pc + 1].block, | |
176620f1 | 2155 | VAR_DOMAIN, |
d2e4a39e AS |
2156 | &candidate_syms, |
2157 | &candidate_blocks); | |
2158 | ||
2159 | if (n_candidates > 1) | |
2160 | { */ | |
2161 | /* Types tend to get re-introduced locally, so if there | |
2162 | are any local symbols that are not types, first filter | |
2163 | out all types. *//* | |
2164 | int j; | |
2165 | for (j = 0; j < n_candidates; j += 1) | |
2166 | switch (SYMBOL_CLASS (candidate_syms[j])) | |
2167 | { | |
2168 | case LOC_REGISTER: | |
2169 | case LOC_ARG: | |
2170 | case LOC_REF_ARG: | |
2171 | case LOC_REGPARM: | |
2172 | case LOC_REGPARM_ADDR: | |
2173 | case LOC_LOCAL: | |
2174 | case LOC_LOCAL_ARG: | |
2175 | case LOC_BASEREG: | |
2176 | case LOC_BASEREG_ARG: | |
4c2df51b DJ |
2177 | case LOC_COMPUTED: |
2178 | case LOC_COMPUTED_ARG: | |
d2e4a39e AS |
2179 | goto FoundNonType; |
2180 | default: | |
2181 | break; | |
2182 | } | |
2183 | FoundNonType: | |
2184 | if (j < n_candidates) | |
2185 | { | |
2186 | j = 0; | |
2187 | while (j < n_candidates) | |
2188 | { | |
2189 | if (SYMBOL_CLASS (candidate_syms[j]) == LOC_TYPEDEF) | |
2190 | { | |
2191 | candidate_syms[j] = candidate_syms[n_candidates-1]; | |
2192 | candidate_blocks[j] = candidate_blocks[n_candidates-1]; | |
2193 | n_candidates -= 1; | |
2194 | } | |
2195 | else | |
2196 | j += 1; | |
2197 | } | |
2198 | } | |
2199 | } | |
14f9c5c9 | 2200 | |
d2e4a39e AS |
2201 | if (n_candidates == 0) |
2202 | error ("No definition found for %s", | |
2203 | ada_demangle (exp->elts[pc + 2].name)); | |
2204 | else if (n_candidates == 1) | |
2205 | i = 0; | |
2206 | else if (deprocedure_p | |
2207 | && ! is_nonfunction (candidate_syms, n_candidates)) | |
2208 | { | |
2209 | i = ada_resolve_function (candidate_syms, candidate_blocks, | |
2210 | n_candidates, NULL, 0, | |
2211 | exp->elts[pc + 2].name, context_type); | |
2212 | if (i < 0) | |
2213 | error ("Could not find a match for %s", | |
2214 | ada_demangle (exp->elts[pc + 2].name)); | |
2215 | } | |
2216 | else | |
2217 | { | |
2218 | printf_filtered ("Multiple matches for %s\n", | |
2219 | ada_demangle (exp->elts[pc+2].name)); | |
2220 | user_select_syms (candidate_syms, candidate_blocks, | |
2221 | n_candidates, 1); | |
2222 | i = 0; | |
2223 | } | |
14f9c5c9 | 2224 | |
d2e4a39e AS |
2225 | exp->elts[pc].opcode = exp->elts[pc + 3].opcode = OP_VAR_VALUE; |
2226 | exp->elts[pc + 1].block = candidate_blocks[i]; | |
2227 | exp->elts[pc + 2].symbol = candidate_syms[i]; | |
2228 | if (innermost_block == NULL || | |
2229 | contained_in (candidate_blocks[i], innermost_block)) | |
2230 | innermost_block = candidate_blocks[i]; | |
2231 | } */ | |
14f9c5c9 AS |
2232 | /* FALL THROUGH */ |
2233 | ||
2234 | case OP_VAR_VALUE: | |
d2e4a39e AS |
2235 | if (deprocedure_p && |
2236 | TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol)) == | |
2237 | TYPE_CODE_FUNC) | |
14f9c5c9 | 2238 | { |
d2e4a39e AS |
2239 | replace_operator_with_call (expp, pc, 0, 0, |
2240 | exp->elts[pc + 2].symbol, | |
2241 | exp->elts[pc + 1].block); | |
14f9c5c9 AS |
2242 | exp = *expp; |
2243 | } | |
2244 | break; | |
2245 | ||
2246 | case OP_FUNCALL: | |
2247 | { | |
2248 | /* FIXME: OP_UNRESOLVED_VALUE should be defined in expression.h */ | |
d2e4a39e AS |
2249 | /* if (exp->elts[pc+3].opcode == OP_UNRESOLVED_VALUE) |
2250 | { | |
2251 | struct symbol** candidate_syms; | |
2252 | struct block** candidate_blocks; | |
2253 | int n_candidates; | |
2254 | ||
2255 | n_candidates = ada_lookup_symbol_list (exp->elts[pc + 5].name, | |
2256 | exp->elts[pc + 4].block, | |
176620f1 | 2257 | VAR_DOMAIN, |
d2e4a39e AS |
2258 | &candidate_syms, |
2259 | &candidate_blocks); | |
2260 | if (n_candidates == 1) | |
2261 | i = 0; | |
2262 | else | |
2263 | { | |
2264 | i = ada_resolve_function (candidate_syms, candidate_blocks, | |
2265 | n_candidates, argvec, nargs-1, | |
2266 | exp->elts[pc + 5].name, context_type); | |
2267 | if (i < 0) | |
2268 | error ("Could not find a match for %s", | |
2269 | ada_demangle (exp->elts[pc + 5].name)); | |
2270 | } | |
2271 | ||
2272 | exp->elts[pc + 3].opcode = exp->elts[pc + 6].opcode = OP_VAR_VALUE; | |
2273 | exp->elts[pc + 4].block = candidate_blocks[i]; | |
2274 | exp->elts[pc + 5].symbol = candidate_syms[i]; | |
2275 | if (innermost_block == NULL || | |
2276 | contained_in (candidate_blocks[i], innermost_block)) | |
2277 | innermost_block = candidate_blocks[i]; | |
2278 | } */ | |
14f9c5c9 | 2279 | |
14f9c5c9 AS |
2280 | } |
2281 | break; | |
2282 | case BINOP_ADD: | |
2283 | case BINOP_SUB: | |
2284 | case BINOP_MUL: | |
2285 | case BINOP_DIV: | |
2286 | case BINOP_REM: | |
2287 | case BINOP_MOD: | |
2288 | case BINOP_CONCAT: | |
2289 | case BINOP_BITWISE_AND: | |
2290 | case BINOP_BITWISE_IOR: | |
2291 | case BINOP_BITWISE_XOR: | |
2292 | case BINOP_EQUAL: | |
2293 | case BINOP_NOTEQUAL: | |
2294 | case BINOP_LESS: | |
2295 | case BINOP_GTR: | |
2296 | case BINOP_LEQ: | |
2297 | case BINOP_GEQ: | |
2298 | case BINOP_EXP: | |
2299 | case UNOP_NEG: | |
2300 | case UNOP_PLUS: | |
2301 | case UNOP_LOGICAL_NOT: | |
2302 | case UNOP_ABS: | |
2303 | if (possible_user_operator_p (op, argvec)) | |
2304 | { | |
d2e4a39e AS |
2305 | struct symbol **candidate_syms; |
2306 | struct block **candidate_blocks; | |
14f9c5c9 AS |
2307 | int n_candidates; |
2308 | ||
d2e4a39e AS |
2309 | n_candidates = |
2310 | ada_lookup_symbol_list (ada_mangle (ada_op_name (op)), | |
176620f1 | 2311 | (struct block *) NULL, VAR_DOMAIN, |
d2e4a39e AS |
2312 | &candidate_syms, &candidate_blocks); |
2313 | i = | |
2314 | ada_resolve_function (candidate_syms, candidate_blocks, | |
2315 | n_candidates, argvec, nargs, | |
2316 | ada_op_name (op), NULL); | |
14f9c5c9 AS |
2317 | if (i < 0) |
2318 | break; | |
2319 | ||
2320 | replace_operator_with_call (expp, pc, nargs, 1, | |
2321 | candidate_syms[i], candidate_blocks[i]); | |
2322 | exp = *expp; | |
2323 | } | |
2324 | break; | |
2325 | } | |
2326 | ||
2327 | *pos = pc; | |
2328 | return evaluate_subexp_type (exp, pos); | |
2329 | } | |
2330 | ||
2331 | /* Return non-zero if formal type FTYPE matches actual type ATYPE. If | |
2332 | MAY_DEREF is non-zero, the formal may be a pointer and the actual | |
d2e4a39e | 2333 | a non-pointer. */ |
14f9c5c9 AS |
2334 | /* The term "match" here is rather loose. The match is heuristic and |
2335 | liberal. FIXME: TOO liberal, in fact. */ | |
2336 | ||
2337 | static int | |
4dc81987 | 2338 | ada_type_match (struct type *ftype, struct type *atype, int may_deref) |
14f9c5c9 AS |
2339 | { |
2340 | CHECK_TYPEDEF (ftype); | |
2341 | CHECK_TYPEDEF (atype); | |
2342 | ||
2343 | if (TYPE_CODE (ftype) == TYPE_CODE_REF) | |
2344 | ftype = TYPE_TARGET_TYPE (ftype); | |
2345 | if (TYPE_CODE (atype) == TYPE_CODE_REF) | |
2346 | atype = TYPE_TARGET_TYPE (atype); | |
2347 | ||
d2e4a39e | 2348 | if (TYPE_CODE (ftype) == TYPE_CODE_VOID |
14f9c5c9 AS |
2349 | || TYPE_CODE (atype) == TYPE_CODE_VOID) |
2350 | return 1; | |
2351 | ||
d2e4a39e | 2352 | switch (TYPE_CODE (ftype)) |
14f9c5c9 AS |
2353 | { |
2354 | default: | |
2355 | return 1; | |
2356 | case TYPE_CODE_PTR: | |
2357 | if (TYPE_CODE (atype) == TYPE_CODE_PTR) | |
2358 | return ada_type_match (TYPE_TARGET_TYPE (ftype), | |
2359 | TYPE_TARGET_TYPE (atype), 0); | |
d2e4a39e AS |
2360 | else |
2361 | return (may_deref && | |
2362 | ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0)); | |
14f9c5c9 AS |
2363 | case TYPE_CODE_INT: |
2364 | case TYPE_CODE_ENUM: | |
2365 | case TYPE_CODE_RANGE: | |
2366 | switch (TYPE_CODE (atype)) | |
2367 | { | |
2368 | case TYPE_CODE_INT: | |
2369 | case TYPE_CODE_ENUM: | |
2370 | case TYPE_CODE_RANGE: | |
2371 | return 1; | |
2372 | default: | |
2373 | return 0; | |
2374 | } | |
2375 | ||
2376 | case TYPE_CODE_ARRAY: | |
d2e4a39e | 2377 | return (TYPE_CODE (atype) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
2378 | || ada_is_array_descriptor (atype)); |
2379 | ||
2380 | case TYPE_CODE_STRUCT: | |
2381 | if (ada_is_array_descriptor (ftype)) | |
d2e4a39e | 2382 | return (TYPE_CODE (atype) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
2383 | || ada_is_array_descriptor (atype)); |
2384 | else | |
2385 | return (TYPE_CODE (atype) == TYPE_CODE_STRUCT | |
d2e4a39e | 2386 | && !ada_is_array_descriptor (atype)); |
14f9c5c9 AS |
2387 | |
2388 | case TYPE_CODE_UNION: | |
2389 | case TYPE_CODE_FLT: | |
2390 | return (TYPE_CODE (atype) == TYPE_CODE (ftype)); | |
2391 | } | |
2392 | } | |
2393 | ||
2394 | /* Return non-zero if the formals of FUNC "sufficiently match" the | |
2395 | vector of actual argument types ACTUALS of size N_ACTUALS. FUNC | |
2396 | may also be an enumeral, in which case it is treated as a 0- | |
2397 | argument function. */ | |
2398 | ||
2399 | static int | |
d2e4a39e | 2400 | ada_args_match (struct symbol *func, struct value **actuals, int n_actuals) |
14f9c5c9 AS |
2401 | { |
2402 | int i; | |
d2e4a39e | 2403 | struct type *func_type = SYMBOL_TYPE (func); |
14f9c5c9 | 2404 | |
d2e4a39e | 2405 | if (SYMBOL_CLASS (func) == LOC_CONST && |
14f9c5c9 AS |
2406 | TYPE_CODE (func_type) == TYPE_CODE_ENUM) |
2407 | return (n_actuals == 0); | |
2408 | else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC) | |
2409 | return 0; | |
2410 | ||
2411 | if (TYPE_NFIELDS (func_type) != n_actuals) | |
2412 | return 0; | |
2413 | ||
2414 | for (i = 0; i < n_actuals; i += 1) | |
2415 | { | |
d2e4a39e AS |
2416 | struct type *ftype = check_typedef (TYPE_FIELD_TYPE (func_type, i)); |
2417 | struct type *atype = check_typedef (VALUE_TYPE (actuals[i])); | |
14f9c5c9 | 2418 | |
d2e4a39e AS |
2419 | if (!ada_type_match (TYPE_FIELD_TYPE (func_type, i), |
2420 | VALUE_TYPE (actuals[i]), 1)) | |
14f9c5c9 AS |
2421 | return 0; |
2422 | } | |
2423 | return 1; | |
2424 | } | |
2425 | ||
2426 | /* False iff function type FUNC_TYPE definitely does not produce a value | |
2427 | compatible with type CONTEXT_TYPE. Conservatively returns 1 if | |
2428 | FUNC_TYPE is not a valid function type with a non-null return type | |
2429 | or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */ | |
2430 | ||
2431 | static int | |
d2e4a39e | 2432 | return_match (struct type *func_type, struct type *context_type) |
14f9c5c9 | 2433 | { |
d2e4a39e | 2434 | struct type *return_type; |
14f9c5c9 AS |
2435 | |
2436 | if (func_type == NULL) | |
2437 | return 1; | |
2438 | ||
2439 | /* FIXME: base_type should be declared in gdbtypes.h, implemented in valarith.c */ | |
2440 | /* if (TYPE_CODE (func_type) == TYPE_CODE_FUNC) | |
d2e4a39e AS |
2441 | return_type = base_type (TYPE_TARGET_TYPE (func_type)); |
2442 | else | |
2443 | return_type = base_type (func_type); */ | |
14f9c5c9 AS |
2444 | if (return_type == NULL) |
2445 | return 1; | |
2446 | ||
2447 | /* FIXME: base_type should be declared in gdbtypes.h, implemented in valarith.c */ | |
d2e4a39e | 2448 | /* context_type = base_type (context_type); */ |
14f9c5c9 AS |
2449 | |
2450 | if (TYPE_CODE (return_type) == TYPE_CODE_ENUM) | |
2451 | return context_type == NULL || return_type == context_type; | |
2452 | else if (context_type == NULL) | |
2453 | return TYPE_CODE (return_type) != TYPE_CODE_VOID; | |
2454 | else | |
2455 | return TYPE_CODE (return_type) == TYPE_CODE (context_type); | |
2456 | } | |
2457 | ||
2458 | ||
2459 | /* Return the index in SYMS[0..NSYMS-1] of symbol for the | |
2460 | function (if any) that matches the types of the NARGS arguments in | |
2461 | ARGS. If CONTEXT_TYPE is non-null, and there is at least one match | |
2462 | that returns type CONTEXT_TYPE, then eliminate other matches. If | |
2463 | CONTEXT_TYPE is null, prefer a non-void-returning function. | |
2464 | Asks the user if there is more than one match remaining. Returns -1 | |
2465 | if there is no such symbol or none is selected. NAME is used | |
2466 | solely for messages. May re-arrange and modify SYMS in | |
2467 | the process; the index returned is for the modified vector. BLOCKS | |
2468 | is modified in parallel to SYMS. */ | |
2469 | ||
2470 | int | |
d2e4a39e AS |
2471 | ada_resolve_function (struct symbol *syms[], struct block *blocks[], |
2472 | int nsyms, struct value **args, int nargs, | |
2473 | const char *name, struct type *context_type) | |
14f9c5c9 AS |
2474 | { |
2475 | int k; | |
2476 | int m; /* Number of hits */ | |
d2e4a39e AS |
2477 | struct type *fallback; |
2478 | struct type *return_type; | |
14f9c5c9 AS |
2479 | |
2480 | return_type = context_type; | |
2481 | if (context_type == NULL) | |
2482 | fallback = builtin_type_void; | |
2483 | else | |
2484 | fallback = NULL; | |
2485 | ||
d2e4a39e | 2486 | m = 0; |
14f9c5c9 AS |
2487 | while (1) |
2488 | { | |
2489 | for (k = 0; k < nsyms; k += 1) | |
2490 | { | |
d2e4a39e | 2491 | struct type *type = check_typedef (SYMBOL_TYPE (syms[k])); |
14f9c5c9 AS |
2492 | |
2493 | if (ada_args_match (syms[k], args, nargs) | |
2494 | && return_match (SYMBOL_TYPE (syms[k]), return_type)) | |
2495 | { | |
2496 | syms[m] = syms[k]; | |
2497 | if (blocks != NULL) | |
2498 | blocks[m] = blocks[k]; | |
2499 | m += 1; | |
2500 | } | |
2501 | } | |
2502 | if (m > 0 || return_type == fallback) | |
2503 | break; | |
2504 | else | |
2505 | return_type = fallback; | |
2506 | } | |
2507 | ||
2508 | if (m == 0) | |
2509 | return -1; | |
2510 | else if (m > 1) | |
2511 | { | |
2512 | printf_filtered ("Multiple matches for %s\n", name); | |
2513 | user_select_syms (syms, blocks, m, 1); | |
2514 | return 0; | |
2515 | } | |
2516 | return 0; | |
2517 | } | |
2518 | ||
2519 | /* Returns true (non-zero) iff demangled name N0 should appear before N1 */ | |
2520 | /* in a listing of choices during disambiguation (see sort_choices, below). */ | |
2521 | /* The idea is that overloadings of a subprogram name from the */ | |
2522 | /* same package should sort in their source order. We settle for ordering */ | |
2523 | /* such symbols by their trailing number (__N or $N). */ | |
2524 | static int | |
d2e4a39e | 2525 | mangled_ordered_before (char *N0, char *N1) |
14f9c5c9 AS |
2526 | { |
2527 | if (N1 == NULL) | |
2528 | return 0; | |
2529 | else if (N0 == NULL) | |
2530 | return 1; | |
2531 | else | |
2532 | { | |
2533 | int k0, k1; | |
d2e4a39e | 2534 | for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1) |
14f9c5c9 | 2535 | ; |
d2e4a39e | 2536 | for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1) |
14f9c5c9 | 2537 | ; |
d2e4a39e AS |
2538 | if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000' |
2539 | && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000') | |
14f9c5c9 AS |
2540 | { |
2541 | int n0, n1; | |
2542 | n0 = k0; | |
d2e4a39e | 2543 | while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_') |
14f9c5c9 AS |
2544 | n0 -= 1; |
2545 | n1 = k1; | |
d2e4a39e | 2546 | while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_') |
14f9c5c9 AS |
2547 | n1 -= 1; |
2548 | if (n0 == n1 && STREQN (N0, N1, n0)) | |
d2e4a39e | 2549 | return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1)); |
14f9c5c9 AS |
2550 | } |
2551 | return (strcmp (N0, N1) < 0); | |
2552 | } | |
2553 | } | |
d2e4a39e | 2554 | |
14f9c5c9 AS |
2555 | /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by their */ |
2556 | /* mangled names, rearranging BLOCKS[0..NSYMS-1] according to the same */ | |
2557 | /* permutation. */ | |
d2e4a39e AS |
2558 | static void |
2559 | sort_choices (struct symbol *syms[], struct block *blocks[], int nsyms) | |
14f9c5c9 AS |
2560 | { |
2561 | int i, j; | |
d2e4a39e | 2562 | for (i = 1; i < nsyms; i += 1) |
14f9c5c9 | 2563 | { |
d2e4a39e AS |
2564 | struct symbol *sym = syms[i]; |
2565 | struct block *block = blocks[i]; | |
14f9c5c9 AS |
2566 | int j; |
2567 | ||
d2e4a39e | 2568 | for (j = i - 1; j >= 0; j -= 1) |
14f9c5c9 | 2569 | { |
22abf04a DC |
2570 | if (mangled_ordered_before (DEPRECATED_SYMBOL_NAME (syms[j]), |
2571 | DEPRECATED_SYMBOL_NAME (sym))) | |
14f9c5c9 | 2572 | break; |
d2e4a39e AS |
2573 | syms[j + 1] = syms[j]; |
2574 | blocks[j + 1] = blocks[j]; | |
14f9c5c9 | 2575 | } |
d2e4a39e AS |
2576 | syms[j + 1] = sym; |
2577 | blocks[j + 1] = block; | |
14f9c5c9 AS |
2578 | } |
2579 | } | |
2580 | ||
2581 | /* Given a list of NSYMS symbols in SYMS and corresponding blocks in */ | |
2582 | /* BLOCKS, select up to MAX_RESULTS>0 by asking the user (if */ | |
2583 | /* necessary), returning the number selected, and setting the first */ | |
2584 | /* elements of SYMS and BLOCKS to the selected symbols and */ | |
2585 | /* corresponding blocks. Error if no symbols selected. BLOCKS may */ | |
2586 | /* be NULL, in which case it is ignored. */ | |
2587 | ||
2588 | /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought | |
2589 | to be re-integrated one of these days. */ | |
2590 | ||
2591 | int | |
d2e4a39e | 2592 | user_select_syms (struct symbol *syms[], struct block *blocks[], int nsyms, |
ebf56fd3 | 2593 | int max_results) |
14f9c5c9 AS |
2594 | { |
2595 | int i; | |
d2e4a39e | 2596 | int *chosen = (int *) alloca (sizeof (int) * nsyms); |
14f9c5c9 AS |
2597 | int n_chosen; |
2598 | int first_choice = (max_results == 1) ? 1 : 2; | |
2599 | ||
2600 | if (max_results < 1) | |
2601 | error ("Request to select 0 symbols!"); | |
2602 | if (nsyms <= 1) | |
2603 | return nsyms; | |
2604 | ||
d2e4a39e | 2605 | printf_unfiltered ("[0] cancel\n"); |
14f9c5c9 | 2606 | if (max_results > 1) |
d2e4a39e | 2607 | printf_unfiltered ("[1] all\n"); |
14f9c5c9 AS |
2608 | |
2609 | sort_choices (syms, blocks, nsyms); | |
2610 | ||
2611 | for (i = 0; i < nsyms; i += 1) | |
2612 | { | |
2613 | if (syms[i] == NULL) | |
2614 | continue; | |
2615 | ||
2616 | if (SYMBOL_CLASS (syms[i]) == LOC_BLOCK) | |
2617 | { | |
2618 | struct symtab_and_line sal = find_function_start_sal (syms[i], 1); | |
2619 | printf_unfiltered ("[%d] %s at %s:%d\n", | |
d2e4a39e | 2620 | i + first_choice, |
de5ad195 | 2621 | SYMBOL_PRINT_NAME (syms[i]), |
d2e4a39e AS |
2622 | sal.symtab == NULL |
2623 | ? "<no source file available>" | |
2624 | : sal.symtab->filename, sal.line); | |
14f9c5c9 AS |
2625 | continue; |
2626 | } | |
d2e4a39e | 2627 | else |
14f9c5c9 | 2628 | { |
d2e4a39e | 2629 | int is_enumeral = |
14f9c5c9 AS |
2630 | (SYMBOL_CLASS (syms[i]) == LOC_CONST |
2631 | && SYMBOL_TYPE (syms[i]) != NULL | |
d2e4a39e AS |
2632 | && TYPE_CODE (SYMBOL_TYPE (syms[i])) == TYPE_CODE_ENUM); |
2633 | struct symtab *symtab = symtab_for_sym (syms[i]); | |
14f9c5c9 AS |
2634 | |
2635 | if (SYMBOL_LINE (syms[i]) != 0 && symtab != NULL) | |
2636 | printf_unfiltered ("[%d] %s at %s:%d\n", | |
2637 | i + first_choice, | |
de5ad195 | 2638 | SYMBOL_PRINT_NAME (syms[i]), |
14f9c5c9 | 2639 | symtab->filename, SYMBOL_LINE (syms[i])); |
d2e4a39e | 2640 | else if (is_enumeral && TYPE_NAME (SYMBOL_TYPE (syms[i])) != NULL) |
14f9c5c9 AS |
2641 | { |
2642 | printf_unfiltered ("[%d] ", i + first_choice); | |
2643 | ada_print_type (SYMBOL_TYPE (syms[i]), NULL, gdb_stdout, -1, 0); | |
2644 | printf_unfiltered ("'(%s) (enumeral)\n", | |
de5ad195 | 2645 | SYMBOL_PRINT_NAME (syms[i])); |
14f9c5c9 AS |
2646 | } |
2647 | else if (symtab != NULL) | |
d2e4a39e | 2648 | printf_unfiltered (is_enumeral |
14f9c5c9 AS |
2649 | ? "[%d] %s in %s (enumeral)\n" |
2650 | : "[%d] %s at %s:?\n", | |
2651 | i + first_choice, | |
de5ad195 | 2652 | SYMBOL_PRINT_NAME (syms[i]), |
14f9c5c9 AS |
2653 | symtab->filename); |
2654 | else | |
2655 | printf_unfiltered (is_enumeral | |
2656 | ? "[%d] %s (enumeral)\n" | |
2657 | : "[%d] %s at ?\n", | |
d2e4a39e | 2658 | i + first_choice, |
de5ad195 | 2659 | SYMBOL_PRINT_NAME (syms[i])); |
14f9c5c9 AS |
2660 | } |
2661 | } | |
d2e4a39e | 2662 | |
14f9c5c9 AS |
2663 | n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1, |
2664 | "overload-choice"); | |
2665 | ||
2666 | for (i = 0; i < n_chosen; i += 1) | |
2667 | { | |
2668 | syms[i] = syms[chosen[i]]; | |
d2e4a39e | 2669 | if (blocks != NULL) |
14f9c5c9 AS |
2670 | blocks[i] = blocks[chosen[i]]; |
2671 | } | |
2672 | ||
2673 | return n_chosen; | |
2674 | } | |
2675 | ||
2676 | /* Read and validate a set of numeric choices from the user in the | |
2677 | range 0 .. N_CHOICES-1. Place the results in increasing | |
2678 | order in CHOICES[0 .. N-1], and return N. | |
2679 | ||
2680 | The user types choices as a sequence of numbers on one line | |
2681 | separated by blanks, encoding them as follows: | |
2682 | ||
2683 | + A choice of 0 means to cancel the selection, throwing an error. | |
2684 | + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1. | |
2685 | + The user chooses k by typing k+IS_ALL_CHOICE+1. | |
2686 | ||
2687 | The user is not allowed to choose more than MAX_RESULTS values. | |
2688 | ||
2689 | ANNOTATION_SUFFIX, if present, is used to annotate the input | |
2690 | prompts (for use with the -f switch). */ | |
2691 | ||
2692 | int | |
d2e4a39e AS |
2693 | get_selections (int *choices, int n_choices, int max_results, |
2694 | int is_all_choice, char *annotation_suffix) | |
14f9c5c9 AS |
2695 | { |
2696 | int i; | |
d2e4a39e AS |
2697 | char *args; |
2698 | const char *prompt; | |
14f9c5c9 AS |
2699 | int n_chosen; |
2700 | int first_choice = is_all_choice ? 2 : 1; | |
d2e4a39e | 2701 | |
14f9c5c9 AS |
2702 | prompt = getenv ("PS2"); |
2703 | if (prompt == NULL) | |
2704 | prompt = ">"; | |
2705 | ||
2706 | printf_unfiltered ("%s ", prompt); | |
2707 | gdb_flush (gdb_stdout); | |
2708 | ||
2709 | args = command_line_input ((char *) NULL, 0, annotation_suffix); | |
d2e4a39e | 2710 | |
14f9c5c9 AS |
2711 | if (args == NULL) |
2712 | error_no_arg ("one or more choice numbers"); | |
2713 | ||
2714 | n_chosen = 0; | |
2715 | ||
2716 | /* Set choices[0 .. n_chosen-1] to the users' choices in ascending | |
2717 | order, as given in args. Choices are validated. */ | |
2718 | while (1) | |
2719 | { | |
d2e4a39e | 2720 | char *args2; |
14f9c5c9 AS |
2721 | int choice, j; |
2722 | ||
2723 | while (isspace (*args)) | |
2724 | args += 1; | |
2725 | if (*args == '\0' && n_chosen == 0) | |
2726 | error_no_arg ("one or more choice numbers"); | |
2727 | else if (*args == '\0') | |
2728 | break; | |
2729 | ||
2730 | choice = strtol (args, &args2, 10); | |
d2e4a39e AS |
2731 | if (args == args2 || choice < 0 |
2732 | || choice > n_choices + first_choice - 1) | |
14f9c5c9 AS |
2733 | error ("Argument must be choice number"); |
2734 | args = args2; | |
2735 | ||
d2e4a39e | 2736 | if (choice == 0) |
14f9c5c9 AS |
2737 | error ("cancelled"); |
2738 | ||
2739 | if (choice < first_choice) | |
2740 | { | |
2741 | n_chosen = n_choices; | |
2742 | for (j = 0; j < n_choices; j += 1) | |
2743 | choices[j] = j; | |
2744 | break; | |
2745 | } | |
2746 | choice -= first_choice; | |
2747 | ||
d2e4a39e AS |
2748 | for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1) |
2749 | { | |
2750 | } | |
14f9c5c9 AS |
2751 | |
2752 | if (j < 0 || choice != choices[j]) | |
2753 | { | |
2754 | int k; | |
d2e4a39e AS |
2755 | for (k = n_chosen - 1; k > j; k -= 1) |
2756 | choices[k + 1] = choices[k]; | |
2757 | choices[j + 1] = choice; | |
14f9c5c9 AS |
2758 | n_chosen += 1; |
2759 | } | |
2760 | } | |
2761 | ||
2762 | if (n_chosen > max_results) | |
2763 | error ("Select no more than %d of the above", max_results); | |
d2e4a39e | 2764 | |
14f9c5c9 AS |
2765 | return n_chosen; |
2766 | } | |
2767 | ||
2768 | /* Replace the operator of length OPLEN at position PC in *EXPP with a call */ | |
2769 | /* on the function identified by SYM and BLOCK, and taking NARGS */ | |
2770 | /* arguments. Update *EXPP as needed to hold more space. */ | |
2771 | ||
2772 | static void | |
d2e4a39e AS |
2773 | replace_operator_with_call (struct expression **expp, int pc, int nargs, |
2774 | int oplen, struct symbol *sym, | |
2775 | struct block *block) | |
14f9c5c9 AS |
2776 | { |
2777 | /* A new expression, with 6 more elements (3 for funcall, 4 for function | |
2778 | symbol, -oplen for operator being replaced). */ | |
d2e4a39e | 2779 | struct expression *newexp = (struct expression *) |
14f9c5c9 AS |
2780 | xmalloc (sizeof (struct expression) |
2781 | + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen)); | |
d2e4a39e | 2782 | struct expression *exp = *expp; |
14f9c5c9 AS |
2783 | |
2784 | newexp->nelts = exp->nelts + 7 - oplen; | |
2785 | newexp->language_defn = exp->language_defn; | |
2786 | memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc)); | |
d2e4a39e | 2787 | memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen, |
14f9c5c9 AS |
2788 | EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen)); |
2789 | ||
2790 | newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL; | |
2791 | newexp->elts[pc + 1].longconst = (LONGEST) nargs; | |
2792 | ||
2793 | newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE; | |
2794 | newexp->elts[pc + 4].block = block; | |
2795 | newexp->elts[pc + 5].symbol = sym; | |
2796 | ||
2797 | *expp = newexp; | |
aacb1f0a | 2798 | xfree (exp); |
d2e4a39e | 2799 | } |
14f9c5c9 AS |
2800 | |
2801 | /* Type-class predicates */ | |
2802 | ||
2803 | /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type), or */ | |
2804 | /* FLOAT.) */ | |
2805 | ||
2806 | static int | |
d2e4a39e | 2807 | numeric_type_p (struct type *type) |
14f9c5c9 AS |
2808 | { |
2809 | if (type == NULL) | |
2810 | return 0; | |
d2e4a39e AS |
2811 | else |
2812 | { | |
2813 | switch (TYPE_CODE (type)) | |
2814 | { | |
2815 | case TYPE_CODE_INT: | |
2816 | case TYPE_CODE_FLT: | |
2817 | return 1; | |
2818 | case TYPE_CODE_RANGE: | |
2819 | return (type == TYPE_TARGET_TYPE (type) | |
2820 | || numeric_type_p (TYPE_TARGET_TYPE (type))); | |
2821 | default: | |
2822 | return 0; | |
2823 | } | |
2824 | } | |
14f9c5c9 AS |
2825 | } |
2826 | ||
2827 | /* True iff TYPE is integral (an INT or RANGE of INTs). */ | |
2828 | ||
2829 | static int | |
d2e4a39e | 2830 | integer_type_p (struct type *type) |
14f9c5c9 AS |
2831 | { |
2832 | if (type == NULL) | |
2833 | return 0; | |
d2e4a39e AS |
2834 | else |
2835 | { | |
2836 | switch (TYPE_CODE (type)) | |
2837 | { | |
2838 | case TYPE_CODE_INT: | |
2839 | return 1; | |
2840 | case TYPE_CODE_RANGE: | |
2841 | return (type == TYPE_TARGET_TYPE (type) | |
2842 | || integer_type_p (TYPE_TARGET_TYPE (type))); | |
2843 | default: | |
2844 | return 0; | |
2845 | } | |
2846 | } | |
14f9c5c9 AS |
2847 | } |
2848 | ||
2849 | /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */ | |
2850 | ||
2851 | static int | |
d2e4a39e | 2852 | scalar_type_p (struct type *type) |
14f9c5c9 AS |
2853 | { |
2854 | if (type == NULL) | |
2855 | return 0; | |
d2e4a39e AS |
2856 | else |
2857 | { | |
2858 | switch (TYPE_CODE (type)) | |
2859 | { | |
2860 | case TYPE_CODE_INT: | |
2861 | case TYPE_CODE_RANGE: | |
2862 | case TYPE_CODE_ENUM: | |
2863 | case TYPE_CODE_FLT: | |
2864 | return 1; | |
2865 | default: | |
2866 | return 0; | |
2867 | } | |
2868 | } | |
14f9c5c9 AS |
2869 | } |
2870 | ||
2871 | /* True iff TYPE is discrete (INT, RANGE, ENUM). */ | |
2872 | ||
2873 | static int | |
d2e4a39e | 2874 | discrete_type_p (struct type *type) |
14f9c5c9 AS |
2875 | { |
2876 | if (type == NULL) | |
2877 | return 0; | |
d2e4a39e AS |
2878 | else |
2879 | { | |
2880 | switch (TYPE_CODE (type)) | |
2881 | { | |
2882 | case TYPE_CODE_INT: | |
2883 | case TYPE_CODE_RANGE: | |
2884 | case TYPE_CODE_ENUM: | |
2885 | return 1; | |
2886 | default: | |
2887 | return 0; | |
2888 | } | |
2889 | } | |
14f9c5c9 AS |
2890 | } |
2891 | ||
2892 | /* Returns non-zero if OP with operatands in the vector ARGS could be | |
2893 | a user-defined function. Errs on the side of pre-defined operators | |
2894 | (i.e., result 0). */ | |
2895 | ||
2896 | static int | |
d2e4a39e | 2897 | possible_user_operator_p (enum exp_opcode op, struct value *args[]) |
14f9c5c9 | 2898 | { |
d2e4a39e AS |
2899 | struct type *type0 = check_typedef (VALUE_TYPE (args[0])); |
2900 | struct type *type1 = | |
14f9c5c9 | 2901 | (args[1] == NULL) ? NULL : check_typedef (VALUE_TYPE (args[1])); |
d2e4a39e | 2902 | |
14f9c5c9 AS |
2903 | switch (op) |
2904 | { | |
2905 | default: | |
2906 | return 0; | |
2907 | ||
2908 | case BINOP_ADD: | |
2909 | case BINOP_SUB: | |
2910 | case BINOP_MUL: | |
2911 | case BINOP_DIV: | |
d2e4a39e | 2912 | return (!(numeric_type_p (type0) && numeric_type_p (type1))); |
14f9c5c9 AS |
2913 | |
2914 | case BINOP_REM: | |
2915 | case BINOP_MOD: | |
2916 | case BINOP_BITWISE_AND: | |
2917 | case BINOP_BITWISE_IOR: | |
2918 | case BINOP_BITWISE_XOR: | |
d2e4a39e | 2919 | return (!(integer_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
2920 | |
2921 | case BINOP_EQUAL: | |
2922 | case BINOP_NOTEQUAL: | |
2923 | case BINOP_LESS: | |
2924 | case BINOP_GTR: | |
2925 | case BINOP_LEQ: | |
2926 | case BINOP_GEQ: | |
d2e4a39e | 2927 | return (!(scalar_type_p (type0) && scalar_type_p (type1))); |
14f9c5c9 AS |
2928 | |
2929 | case BINOP_CONCAT: | |
d2e4a39e AS |
2930 | return ((TYPE_CODE (type0) != TYPE_CODE_ARRAY && |
2931 | (TYPE_CODE (type0) != TYPE_CODE_PTR || | |
2932 | TYPE_CODE (TYPE_TARGET_TYPE (type0)) | |
2933 | != TYPE_CODE_ARRAY)) | |
2934 | || (TYPE_CODE (type1) != TYPE_CODE_ARRAY && | |
2935 | (TYPE_CODE (type1) != TYPE_CODE_PTR || | |
2936 | TYPE_CODE (TYPE_TARGET_TYPE (type1)) != TYPE_CODE_ARRAY))); | |
14f9c5c9 AS |
2937 | |
2938 | case BINOP_EXP: | |
d2e4a39e | 2939 | return (!(numeric_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
2940 | |
2941 | case UNOP_NEG: | |
2942 | case UNOP_PLUS: | |
2943 | case UNOP_LOGICAL_NOT: | |
d2e4a39e AS |
2944 | case UNOP_ABS: |
2945 | return (!numeric_type_p (type0)); | |
14f9c5c9 AS |
2946 | |
2947 | } | |
2948 | } | |
2949 | \f | |
2950 | /* Renaming */ | |
2951 | ||
2952 | /** NOTE: In the following, we assume that a renaming type's name may | |
2953 | * have an ___XD suffix. It would be nice if this went away at some | |
2954 | * point. */ | |
2955 | ||
2956 | /* If TYPE encodes a renaming, returns the renaming suffix, which | |
2957 | * is XR for an object renaming, XRP for a procedure renaming, XRE for | |
2958 | * an exception renaming, and XRS for a subprogram renaming. Returns | |
2959 | * NULL if NAME encodes none of these. */ | |
d2e4a39e AS |
2960 | const char * |
2961 | ada_renaming_type (struct type *type) | |
14f9c5c9 AS |
2962 | { |
2963 | if (type != NULL && TYPE_CODE (type) == TYPE_CODE_ENUM) | |
2964 | { | |
d2e4a39e AS |
2965 | const char *name = type_name_no_tag (type); |
2966 | const char *suffix = (name == NULL) ? NULL : strstr (name, "___XR"); | |
2967 | if (suffix == NULL | |
2968 | || (suffix[5] != '\000' && strchr ("PES_", suffix[5]) == NULL)) | |
14f9c5c9 AS |
2969 | return NULL; |
2970 | else | |
2971 | return suffix + 3; | |
2972 | } | |
2973 | else | |
2974 | return NULL; | |
2975 | } | |
2976 | ||
2977 | /* Return non-zero iff SYM encodes an object renaming. */ | |
2978 | int | |
d2e4a39e | 2979 | ada_is_object_renaming (struct symbol *sym) |
14f9c5c9 | 2980 | { |
d2e4a39e AS |
2981 | const char *renaming_type = ada_renaming_type (SYMBOL_TYPE (sym)); |
2982 | return renaming_type != NULL | |
14f9c5c9 AS |
2983 | && (renaming_type[2] == '\0' || renaming_type[2] == '_'); |
2984 | } | |
2985 | ||
2986 | /* Assuming that SYM encodes a non-object renaming, returns the original | |
2987 | * name of the renamed entity. The name is good until the end of | |
2988 | * parsing. */ | |
d2e4a39e AS |
2989 | const char * |
2990 | ada_simple_renamed_entity (struct symbol *sym) | |
14f9c5c9 | 2991 | { |
d2e4a39e AS |
2992 | struct type *type; |
2993 | const char *raw_name; | |
14f9c5c9 | 2994 | int len; |
d2e4a39e | 2995 | char *result; |
14f9c5c9 AS |
2996 | |
2997 | type = SYMBOL_TYPE (sym); | |
2998 | if (type == NULL || TYPE_NFIELDS (type) < 1) | |
2999 | error ("Improperly encoded renaming."); | |
3000 | ||
3001 | raw_name = TYPE_FIELD_NAME (type, 0); | |
3002 | len = (raw_name == NULL ? 0 : strlen (raw_name)) - 5; | |
3003 | if (len <= 0) | |
3004 | error ("Improperly encoded renaming."); | |
3005 | ||
3006 | result = xmalloc (len + 1); | |
d2e4a39e AS |
3007 | /* FIXME: add_name_string_cleanup should be defined in parse.c */ |
3008 | /* add_name_string_cleanup (result); */ | |
14f9c5c9 AS |
3009 | strncpy (result, raw_name, len); |
3010 | result[len] = '\000'; | |
3011 | return result; | |
3012 | } | |
14f9c5c9 | 3013 | \f |
d2e4a39e | 3014 | |
14f9c5c9 AS |
3015 | /* Evaluation: Function Calls */ |
3016 | ||
3017 | /* Copy VAL onto the stack, using and updating *SP as the stack | |
3018 | pointer. Return VAL as an lvalue. */ | |
3019 | ||
d2e4a39e AS |
3020 | static struct value * |
3021 | place_on_stack (struct value *val, CORE_ADDR *sp) | |
14f9c5c9 AS |
3022 | { |
3023 | CORE_ADDR old_sp = *sp; | |
3024 | ||
3025 | #ifdef STACK_ALIGN | |
d2e4a39e AS |
3026 | *sp = push_bytes (*sp, VALUE_CONTENTS_RAW (val), |
3027 | STACK_ALIGN (TYPE_LENGTH | |
3028 | (check_typedef (VALUE_TYPE (val))))); | |
14f9c5c9 | 3029 | #else |
d2e4a39e | 3030 | *sp = push_bytes (*sp, VALUE_CONTENTS_RAW (val), |
14f9c5c9 AS |
3031 | TYPE_LENGTH (check_typedef (VALUE_TYPE (val)))); |
3032 | #endif | |
3033 | ||
3034 | VALUE_LVAL (val) = lval_memory; | |
3035 | if (INNER_THAN (1, 2)) | |
3036 | VALUE_ADDRESS (val) = *sp; | |
3037 | else | |
3038 | VALUE_ADDRESS (val) = old_sp; | |
3039 | ||
3040 | return val; | |
3041 | } | |
3042 | ||
3043 | /* Return the value ACTUAL, converted to be an appropriate value for a | |
3044 | formal of type FORMAL_TYPE. Use *SP as a stack pointer for | |
3045 | allocating any necessary descriptors (fat pointers), or copies of | |
d2e4a39e | 3046 | values not residing in memory, updating it as needed. */ |
14f9c5c9 | 3047 | |
d2e4a39e AS |
3048 | static struct value * |
3049 | convert_actual (struct value *actual, struct type *formal_type0, | |
3050 | CORE_ADDR *sp) | |
14f9c5c9 | 3051 | { |
d2e4a39e AS |
3052 | struct type *actual_type = check_typedef (VALUE_TYPE (actual)); |
3053 | struct type *formal_type = check_typedef (formal_type0); | |
3054 | struct type *formal_target = | |
3055 | TYPE_CODE (formal_type) == TYPE_CODE_PTR | |
3056 | ? check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type; | |
3057 | struct type *actual_target = | |
3058 | TYPE_CODE (actual_type) == TYPE_CODE_PTR | |
3059 | ? check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type; | |
14f9c5c9 AS |
3060 | |
3061 | if (ada_is_array_descriptor (formal_target) | |
3062 | && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY) | |
3063 | return make_array_descriptor (formal_type, actual, sp); | |
3064 | else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR) | |
3065 | { | |
3066 | if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY | |
d2e4a39e | 3067 | && ada_is_array_descriptor (actual_target)) |
14f9c5c9 AS |
3068 | return desc_data (actual); |
3069 | else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR) | |
3070 | { | |
3071 | if (VALUE_LVAL (actual) != lval_memory) | |
3072 | { | |
d2e4a39e | 3073 | struct value *val; |
14f9c5c9 AS |
3074 | actual_type = check_typedef (VALUE_TYPE (actual)); |
3075 | val = allocate_value (actual_type); | |
d2e4a39e AS |
3076 | memcpy ((char *) VALUE_CONTENTS_RAW (val), |
3077 | (char *) VALUE_CONTENTS (actual), | |
14f9c5c9 AS |
3078 | TYPE_LENGTH (actual_type)); |
3079 | actual = place_on_stack (val, sp); | |
3080 | } | |
3081 | return value_addr (actual); | |
3082 | } | |
3083 | } | |
3084 | else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR) | |
3085 | return ada_value_ind (actual); | |
3086 | ||
3087 | return actual; | |
3088 | } | |
3089 | ||
3090 | ||
3091 | /* Push a descriptor of type TYPE for array value ARR on the stack at | |
3092 | *SP, updating *SP to reflect the new descriptor. Return either | |
3093 | an lvalue representing the new descriptor, or (if TYPE is a pointer- | |
3094 | to-descriptor type rather than a descriptor type), a struct value* | |
3095 | representing a pointer to this descriptor. */ | |
3096 | ||
d2e4a39e AS |
3097 | static struct value * |
3098 | make_array_descriptor (struct type *type, struct value *arr, CORE_ADDR *sp) | |
14f9c5c9 | 3099 | { |
d2e4a39e AS |
3100 | struct type *bounds_type = desc_bounds_type (type); |
3101 | struct type *desc_type = desc_base_type (type); | |
3102 | struct value *descriptor = allocate_value (desc_type); | |
3103 | struct value *bounds = allocate_value (bounds_type); | |
14f9c5c9 AS |
3104 | CORE_ADDR bounds_addr; |
3105 | int i; | |
d2e4a39e | 3106 | |
14f9c5c9 AS |
3107 | for (i = ada_array_arity (check_typedef (VALUE_TYPE (arr))); i > 0; i -= 1) |
3108 | { | |
3109 | modify_general_field (VALUE_CONTENTS (bounds), | |
d2e4a39e | 3110 | value_as_long (ada_array_bound (arr, i, 0)), |
14f9c5c9 AS |
3111 | desc_bound_bitpos (bounds_type, i, 0), |
3112 | desc_bound_bitsize (bounds_type, i, 0)); | |
3113 | modify_general_field (VALUE_CONTENTS (bounds), | |
d2e4a39e | 3114 | value_as_long (ada_array_bound (arr, i, 1)), |
14f9c5c9 AS |
3115 | desc_bound_bitpos (bounds_type, i, 1), |
3116 | desc_bound_bitsize (bounds_type, i, 1)); | |
3117 | } | |
d2e4a39e | 3118 | |
14f9c5c9 | 3119 | bounds = place_on_stack (bounds, sp); |
d2e4a39e | 3120 | |
14f9c5c9 AS |
3121 | modify_general_field (VALUE_CONTENTS (descriptor), |
3122 | arr, | |
3123 | fat_pntr_data_bitpos (desc_type), | |
3124 | fat_pntr_data_bitsize (desc_type)); | |
3125 | modify_general_field (VALUE_CONTENTS (descriptor), | |
3126 | VALUE_ADDRESS (bounds), | |
3127 | fat_pntr_bounds_bitpos (desc_type), | |
3128 | fat_pntr_bounds_bitsize (desc_type)); | |
3129 | ||
3130 | descriptor = place_on_stack (descriptor, sp); | |
3131 | ||
3132 | if (TYPE_CODE (type) == TYPE_CODE_PTR) | |
3133 | return value_addr (descriptor); | |
3134 | else | |
3135 | return descriptor; | |
3136 | } | |
3137 | ||
3138 | ||
3139 | /* Assuming a dummy frame has been established on the target, perform any | |
3140 | conversions needed for calling function FUNC on the NARGS actual | |
3141 | parameters in ARGS, other than standard C conversions. Does | |
3142 | nothing if FUNC does not have Ada-style prototype data, or if NARGS | |
3143 | does not match the number of arguments expected. Use *SP as a | |
3144 | stack pointer for additional data that must be pushed, updating its | |
3145 | value as needed. */ | |
3146 | ||
3147 | void | |
d2e4a39e AS |
3148 | ada_convert_actuals (struct value *func, int nargs, struct value *args[], |
3149 | CORE_ADDR *sp) | |
14f9c5c9 AS |
3150 | { |
3151 | int i; | |
3152 | ||
d2e4a39e | 3153 | if (TYPE_NFIELDS (VALUE_TYPE (func)) == 0 |
14f9c5c9 AS |
3154 | || nargs != TYPE_NFIELDS (VALUE_TYPE (func))) |
3155 | return; | |
3156 | ||
3157 | for (i = 0; i < nargs; i += 1) | |
d2e4a39e AS |
3158 | args[i] = |
3159 | convert_actual (args[i], TYPE_FIELD_TYPE (VALUE_TYPE (func), i), sp); | |
14f9c5c9 | 3160 | } |
14f9c5c9 | 3161 | \f |
d2e4a39e | 3162 | |
14f9c5c9 AS |
3163 | /* Symbol Lookup */ |
3164 | ||
3165 | ||
3166 | /* The vectors of symbols and blocks ultimately returned from */ | |
3167 | /* ada_lookup_symbol_list. */ | |
3168 | ||
3169 | /* Current size of defn_symbols and defn_blocks */ | |
d2e4a39e | 3170 | static size_t defn_vector_size = 0; |
14f9c5c9 AS |
3171 | |
3172 | /* Current number of symbols found. */ | |
3173 | static int ndefns = 0; | |
3174 | ||
d2e4a39e AS |
3175 | static struct symbol **defn_symbols = NULL; |
3176 | static struct block **defn_blocks = NULL; | |
14f9c5c9 AS |
3177 | |
3178 | /* Return the result of a standard (literal, C-like) lookup of NAME in | |
176620f1 | 3179 | * given DOMAIN. */ |
14f9c5c9 | 3180 | |
d2e4a39e | 3181 | static struct symbol * |
176620f1 | 3182 | standard_lookup (const char *name, domain_enum domain) |
14f9c5c9 | 3183 | { |
d2e4a39e | 3184 | struct symbol *sym; |
cdef89d0 | 3185 | sym = lookup_symbol (name, (struct block *) NULL, domain, 0, NULL); |
14f9c5c9 AS |
3186 | return sym; |
3187 | } | |
d2e4a39e | 3188 | |
14f9c5c9 AS |
3189 | |
3190 | /* Non-zero iff there is at least one non-function/non-enumeral symbol */ | |
3191 | /* in SYMS[0..N-1]. We treat enumerals as functions, since they */ | |
d2e4a39e | 3192 | /* contend in overloading in the same way. */ |
14f9c5c9 | 3193 | static int |
d2e4a39e | 3194 | is_nonfunction (struct symbol *syms[], int n) |
14f9c5c9 AS |
3195 | { |
3196 | int i; | |
3197 | ||
3198 | for (i = 0; i < n; i += 1) | |
3199 | if (TYPE_CODE (SYMBOL_TYPE (syms[i])) != TYPE_CODE_FUNC | |
3200 | && TYPE_CODE (SYMBOL_TYPE (syms[i])) != TYPE_CODE_ENUM) | |
3201 | return 1; | |
3202 | ||
3203 | return 0; | |
3204 | } | |
3205 | ||
3206 | /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent | |
3207 | struct types. Otherwise, they may not. */ | |
3208 | ||
3209 | static int | |
d2e4a39e | 3210 | equiv_types (struct type *type0, struct type *type1) |
14f9c5c9 | 3211 | { |
d2e4a39e | 3212 | if (type0 == type1) |
14f9c5c9 | 3213 | return 1; |
d2e4a39e | 3214 | if (type0 == NULL || type1 == NULL |
14f9c5c9 AS |
3215 | || TYPE_CODE (type0) != TYPE_CODE (type1)) |
3216 | return 0; | |
d2e4a39e | 3217 | if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT |
14f9c5c9 AS |
3218 | || TYPE_CODE (type0) == TYPE_CODE_ENUM) |
3219 | && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL | |
3220 | && STREQ (ada_type_name (type0), ada_type_name (type1))) | |
3221 | return 1; | |
d2e4a39e | 3222 | |
14f9c5c9 AS |
3223 | return 0; |
3224 | } | |
3225 | ||
3226 | /* True iff SYM0 represents the same entity as SYM1, or one that is | |
3227 | no more defined than that of SYM1. */ | |
3228 | ||
3229 | static int | |
d2e4a39e | 3230 | lesseq_defined_than (struct symbol *sym0, struct symbol *sym1) |
14f9c5c9 AS |
3231 | { |
3232 | if (sym0 == sym1) | |
3233 | return 1; | |
176620f1 | 3234 | if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1) |
14f9c5c9 AS |
3235 | || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1)) |
3236 | return 0; | |
3237 | ||
d2e4a39e | 3238 | switch (SYMBOL_CLASS (sym0)) |
14f9c5c9 AS |
3239 | { |
3240 | case LOC_UNDEF: | |
3241 | return 1; | |
3242 | case LOC_TYPEDEF: | |
3243 | { | |
d2e4a39e AS |
3244 | struct type *type0 = SYMBOL_TYPE (sym0); |
3245 | struct type *type1 = SYMBOL_TYPE (sym1); | |
22abf04a DC |
3246 | char *name0 = DEPRECATED_SYMBOL_NAME (sym0); |
3247 | char *name1 = DEPRECATED_SYMBOL_NAME (sym1); | |
14f9c5c9 | 3248 | int len0 = strlen (name0); |
d2e4a39e | 3249 | return |
14f9c5c9 AS |
3250 | TYPE_CODE (type0) == TYPE_CODE (type1) |
3251 | && (equiv_types (type0, type1) | |
3252 | || (len0 < strlen (name1) && STREQN (name0, name1, len0) | |
3253 | && STREQN (name1 + len0, "___XV", 5))); | |
3254 | } | |
3255 | case LOC_CONST: | |
3256 | return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1) | |
3257 | && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1)); | |
d2e4a39e AS |
3258 | default: |
3259 | return 0; | |
14f9c5c9 AS |
3260 | } |
3261 | } | |
3262 | ||
3263 | /* Append SYM to the end of defn_symbols, and BLOCK to the end of | |
3264 | defn_blocks, updating ndefns, and expanding defn_symbols and | |
3265 | defn_blocks as needed. Do not include SYM if it is a duplicate. */ | |
3266 | ||
3267 | static void | |
d2e4a39e | 3268 | add_defn_to_vec (struct symbol *sym, struct block *block) |
14f9c5c9 AS |
3269 | { |
3270 | int i; | |
3271 | size_t tmp; | |
3272 | ||
d2e4a39e | 3273 | if (SYMBOL_TYPE (sym) != NULL) |
14f9c5c9 AS |
3274 | CHECK_TYPEDEF (SYMBOL_TYPE (sym)); |
3275 | for (i = 0; i < ndefns; i += 1) | |
3276 | { | |
3277 | if (lesseq_defined_than (sym, defn_symbols[i])) | |
3278 | return; | |
3279 | else if (lesseq_defined_than (defn_symbols[i], sym)) | |
3280 | { | |
3281 | defn_symbols[i] = sym; | |
3282 | defn_blocks[i] = block; | |
3283 | return; | |
3284 | } | |
3285 | } | |
3286 | ||
3287 | tmp = defn_vector_size; | |
d2e4a39e AS |
3288 | GROW_VECT (defn_symbols, tmp, ndefns + 2); |
3289 | GROW_VECT (defn_blocks, defn_vector_size, ndefns + 2); | |
14f9c5c9 AS |
3290 | |
3291 | defn_symbols[ndefns] = sym; | |
3292 | defn_blocks[ndefns] = block; | |
3293 | ndefns += 1; | |
3294 | } | |
3295 | ||
176620f1 | 3296 | /* Look, in partial_symtab PST, for symbol NAME in given domain. |
14f9c5c9 AS |
3297 | Check the global symbols if GLOBAL, the static symbols if not. Do |
3298 | wild-card match if WILD. */ | |
3299 | ||
3300 | static struct partial_symbol * | |
d2e4a39e | 3301 | ada_lookup_partial_symbol (struct partial_symtab *pst, const char *name, |
176620f1 | 3302 | int global, domain_enum domain, int wild) |
14f9c5c9 AS |
3303 | { |
3304 | struct partial_symbol **start; | |
3305 | int name_len = strlen (name); | |
3306 | int length = (global ? pst->n_global_syms : pst->n_static_syms); | |
3307 | int i; | |
3308 | ||
3309 | if (length == 0) | |
3310 | { | |
3311 | return (NULL); | |
3312 | } | |
d2e4a39e | 3313 | |
14f9c5c9 AS |
3314 | start = (global ? |
3315 | pst->objfile->global_psymbols.list + pst->globals_offset : | |
d2e4a39e | 3316 | pst->objfile->static_psymbols.list + pst->statics_offset); |
14f9c5c9 AS |
3317 | |
3318 | if (wild) | |
3319 | { | |
3320 | for (i = 0; i < length; i += 1) | |
3321 | { | |
d2e4a39e | 3322 | struct partial_symbol *psym = start[i]; |
14f9c5c9 | 3323 | |
176620f1 | 3324 | if (SYMBOL_DOMAIN (psym) == domain && |
22abf04a | 3325 | wild_match (name, name_len, DEPRECATED_SYMBOL_NAME (psym))) |
14f9c5c9 AS |
3326 | return psym; |
3327 | } | |
3328 | return NULL; | |
3329 | } | |
d2e4a39e | 3330 | else |
14f9c5c9 AS |
3331 | { |
3332 | if (global) | |
3333 | { | |
3334 | int U; | |
d2e4a39e AS |
3335 | i = 0; |
3336 | U = length - 1; | |
3337 | while (U - i > 4) | |
14f9c5c9 | 3338 | { |
d2e4a39e AS |
3339 | int M = (U + i) >> 1; |
3340 | struct partial_symbol *psym = start[M]; | |
22abf04a | 3341 | if (DEPRECATED_SYMBOL_NAME (psym)[0] < name[0]) |
d2e4a39e | 3342 | i = M + 1; |
22abf04a | 3343 | else if (DEPRECATED_SYMBOL_NAME (psym)[0] > name[0]) |
d2e4a39e | 3344 | U = M - 1; |
22abf04a | 3345 | else if (strcmp (DEPRECATED_SYMBOL_NAME (psym), name) < 0) |
d2e4a39e | 3346 | i = M + 1; |
14f9c5c9 AS |
3347 | else |
3348 | U = M; | |
3349 | } | |
3350 | } | |
3351 | else | |
3352 | i = 0; | |
3353 | ||
3354 | while (i < length) | |
3355 | { | |
3356 | struct partial_symbol *psym = start[i]; | |
3357 | ||
176620f1 | 3358 | if (SYMBOL_DOMAIN (psym) == domain) |
14f9c5c9 | 3359 | { |
22abf04a | 3360 | int cmp = strncmp (name, DEPRECATED_SYMBOL_NAME (psym), name_len); |
d2e4a39e AS |
3361 | |
3362 | if (cmp < 0) | |
14f9c5c9 AS |
3363 | { |
3364 | if (global) | |
3365 | break; | |
3366 | } | |
d2e4a39e | 3367 | else if (cmp == 0 |
22abf04a | 3368 | && is_name_suffix (DEPRECATED_SYMBOL_NAME (psym) + name_len)) |
14f9c5c9 AS |
3369 | return psym; |
3370 | } | |
3371 | i += 1; | |
3372 | } | |
3373 | ||
3374 | if (global) | |
3375 | { | |
3376 | int U; | |
d2e4a39e AS |
3377 | i = 0; |
3378 | U = length - 1; | |
3379 | while (U - i > 4) | |
14f9c5c9 | 3380 | { |
d2e4a39e | 3381 | int M = (U + i) >> 1; |
14f9c5c9 | 3382 | struct partial_symbol *psym = start[M]; |
22abf04a | 3383 | if (DEPRECATED_SYMBOL_NAME (psym)[0] < '_') |
d2e4a39e | 3384 | i = M + 1; |
22abf04a | 3385 | else if (DEPRECATED_SYMBOL_NAME (psym)[0] > '_') |
d2e4a39e | 3386 | U = M - 1; |
22abf04a | 3387 | else if (strcmp (DEPRECATED_SYMBOL_NAME (psym), "_ada_") < 0) |
d2e4a39e | 3388 | i = M + 1; |
14f9c5c9 AS |
3389 | else |
3390 | U = M; | |
3391 | } | |
3392 | } | |
3393 | else | |
3394 | i = 0; | |
3395 | ||
3396 | while (i < length) | |
3397 | { | |
d2e4a39e | 3398 | struct partial_symbol *psym = start[i]; |
14f9c5c9 | 3399 | |
176620f1 | 3400 | if (SYMBOL_DOMAIN (psym) == domain) |
14f9c5c9 AS |
3401 | { |
3402 | int cmp; | |
3403 | ||
22abf04a | 3404 | cmp = (int) '_' - (int) DEPRECATED_SYMBOL_NAME (psym)[0]; |
d2e4a39e | 3405 | if (cmp == 0) |
14f9c5c9 | 3406 | { |
22abf04a | 3407 | cmp = strncmp ("_ada_", DEPRECATED_SYMBOL_NAME (psym), 5); |
14f9c5c9 | 3408 | if (cmp == 0) |
22abf04a | 3409 | cmp = strncmp (name, DEPRECATED_SYMBOL_NAME (psym) + 5, name_len); |
14f9c5c9 | 3410 | } |
d2e4a39e AS |
3411 | |
3412 | if (cmp < 0) | |
14f9c5c9 AS |
3413 | { |
3414 | if (global) | |
3415 | break; | |
3416 | } | |
d2e4a39e | 3417 | else if (cmp == 0 |
22abf04a | 3418 | && is_name_suffix (DEPRECATED_SYMBOL_NAME (psym) + name_len + 5)) |
14f9c5c9 AS |
3419 | return psym; |
3420 | } | |
3421 | i += 1; | |
3422 | } | |
d2e4a39e | 3423 | |
14f9c5c9 AS |
3424 | } |
3425 | return NULL; | |
3426 | } | |
3427 | ||
3428 | ||
3429 | /* Find a symbol table containing symbol SYM or NULL if none. */ | |
d2e4a39e AS |
3430 | static struct symtab * |
3431 | symtab_for_sym (struct symbol *sym) | |
14f9c5c9 | 3432 | { |
d2e4a39e | 3433 | struct symtab *s; |
14f9c5c9 AS |
3434 | struct objfile *objfile; |
3435 | struct block *b; | |
261397f8 | 3436 | struct symbol *tmp_sym; |
de4f826b DC |
3437 | struct dict_iterator iter; |
3438 | int j; | |
14f9c5c9 AS |
3439 | |
3440 | ALL_SYMTABS (objfile, s) | |
d2e4a39e AS |
3441 | { |
3442 | switch (SYMBOL_CLASS (sym)) | |
3443 | { | |
3444 | case LOC_CONST: | |
3445 | case LOC_STATIC: | |
3446 | case LOC_TYPEDEF: | |
3447 | case LOC_REGISTER: | |
3448 | case LOC_LABEL: | |
3449 | case LOC_BLOCK: | |
3450 | case LOC_CONST_BYTES: | |
3451 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK); | |
de4f826b | 3452 | ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym) |
d2e4a39e AS |
3453 | return s; |
3454 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK); | |
de4f826b | 3455 | ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym) |
d2e4a39e AS |
3456 | return s; |
3457 | break; | |
3458 | default: | |
3459 | break; | |
3460 | } | |
3461 | switch (SYMBOL_CLASS (sym)) | |
3462 | { | |
3463 | case LOC_REGISTER: | |
3464 | case LOC_ARG: | |
3465 | case LOC_REF_ARG: | |
3466 | case LOC_REGPARM: | |
3467 | case LOC_REGPARM_ADDR: | |
3468 | case LOC_LOCAL: | |
3469 | case LOC_TYPEDEF: | |
3470 | case LOC_LOCAL_ARG: | |
3471 | case LOC_BASEREG: | |
3472 | case LOC_BASEREG_ARG: | |
4c2df51b DJ |
3473 | case LOC_COMPUTED: |
3474 | case LOC_COMPUTED_ARG: | |
d2e4a39e AS |
3475 | for (j = FIRST_LOCAL_BLOCK; |
3476 | j < BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s)); j += 1) | |
3477 | { | |
3478 | b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), j); | |
de4f826b | 3479 | ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym) |
14f9c5c9 | 3480 | return s; |
d2e4a39e AS |
3481 | } |
3482 | break; | |
3483 | default: | |
3484 | break; | |
3485 | } | |
3486 | } | |
14f9c5c9 AS |
3487 | return NULL; |
3488 | } | |
3489 | ||
3490 | /* Return a minimal symbol matching NAME according to Ada demangling | |
3491 | rules. Returns NULL if there is no such minimal symbol. */ | |
3492 | ||
d2e4a39e AS |
3493 | struct minimal_symbol * |
3494 | ada_lookup_minimal_symbol (const char *name) | |
14f9c5c9 | 3495 | { |
d2e4a39e AS |
3496 | struct objfile *objfile; |
3497 | struct minimal_symbol *msymbol; | |
14f9c5c9 AS |
3498 | int wild_match = (strstr (name, "__") == NULL); |
3499 | ||
3500 | ALL_MSYMBOLS (objfile, msymbol) | |
d2e4a39e | 3501 | { |
22abf04a | 3502 | if (ada_match_name (DEPRECATED_SYMBOL_NAME (msymbol), name, wild_match) |
d2e4a39e AS |
3503 | && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline) |
3504 | return msymbol; | |
3505 | } | |
14f9c5c9 AS |
3506 | |
3507 | return NULL; | |
3508 | } | |
3509 | ||
3510 | /* For all subprograms that statically enclose the subprogram of the | |
176620f1 | 3511 | * selected frame, add symbols matching identifier NAME in DOMAIN |
14f9c5c9 AS |
3512 | * and their blocks to vectors *defn_symbols and *defn_blocks, as for |
3513 | * ada_add_block_symbols (q.v.). If WILD, treat as NAME with a | |
3514 | * wildcard prefix. At the moment, this function uses a heuristic to | |
3515 | * find the frames of enclosing subprograms: it treats the | |
3516 | * pointer-sized value at location 0 from the local-variable base of a | |
3517 | * frame as a static link, and then searches up the call stack for a | |
3518 | * frame with that same local-variable base. */ | |
3519 | static void | |
176620f1 | 3520 | add_symbols_from_enclosing_procs (const char *name, domain_enum domain, |
d2e4a39e | 3521 | int wild_match) |
14f9c5c9 AS |
3522 | { |
3523 | #ifdef i386 | |
3524 | static struct symbol static_link_sym; | |
3525 | static struct symbol *static_link; | |
3526 | ||
d2e4a39e AS |
3527 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); |
3528 | struct frame_info *frame; | |
3529 | struct frame_info *target_frame; | |
14f9c5c9 AS |
3530 | |
3531 | if (static_link == NULL) | |
3532 | { | |
3533 | /* Initialize the local variable symbol that stands for the | |
3534 | * static link (when it exists). */ | |
3535 | static_link = &static_link_sym; | |
22abf04a | 3536 | DEPRECATED_SYMBOL_NAME (static_link) = ""; |
14f9c5c9 AS |
3537 | SYMBOL_LANGUAGE (static_link) = language_unknown; |
3538 | SYMBOL_CLASS (static_link) = LOC_LOCAL; | |
176620f1 | 3539 | SYMBOL_DOMAIN (static_link) = VAR_DOMAIN; |
14f9c5c9 | 3540 | SYMBOL_TYPE (static_link) = lookup_pointer_type (builtin_type_void); |
d2e4a39e AS |
3541 | SYMBOL_VALUE (static_link) = |
3542 | -(long) TYPE_LENGTH (SYMBOL_TYPE (static_link)); | |
14f9c5c9 AS |
3543 | } |
3544 | ||
6e7f8b9c | 3545 | frame = deprecated_selected_frame; |
14f9c5c9 AS |
3546 | while (frame != NULL && ndefns == 0) |
3547 | { | |
d2e4a39e AS |
3548 | struct block *block; |
3549 | struct value *target_link_val = read_var_value (static_link, frame); | |
14f9c5c9 AS |
3550 | CORE_ADDR target_link; |
3551 | ||
3552 | if (target_link_val == NULL) | |
3553 | break; | |
3554 | QUIT; | |
3555 | ||
3556 | target_link = target_link_val; | |
d2e4a39e AS |
3557 | do |
3558 | { | |
14f9c5c9 AS |
3559 | QUIT; |
3560 | frame = get_prev_frame (frame); | |
d2e4a39e AS |
3561 | } |
3562 | while (frame != NULL && FRAME_LOCALS_ADDRESS (frame) != target_link); | |
14f9c5c9 AS |
3563 | |
3564 | if (frame == NULL) | |
3565 | break; | |
3566 | ||
3567 | block = get_frame_block (frame, 0); | |
3568 | while (block != NULL && block_function (block) != NULL && ndefns == 0) | |
3569 | { | |
176620f1 | 3570 | ada_add_block_symbols (block, name, domain, NULL, wild_match); |
d2e4a39e | 3571 | |
14f9c5c9 AS |
3572 | block = BLOCK_SUPERBLOCK (block); |
3573 | } | |
3574 | } | |
3575 | ||
3576 | do_cleanups (old_chain); | |
3577 | #endif | |
3578 | } | |
3579 | ||
3580 | /* True if TYPE is definitely an artificial type supplied to a symbol | |
3581 | * for which no debugging information was given in the symbol file. */ | |
3582 | static int | |
d2e4a39e | 3583 | is_nondebugging_type (struct type *type) |
14f9c5c9 | 3584 | { |
d2e4a39e | 3585 | char *name = ada_type_name (type); |
14f9c5c9 AS |
3586 | return (name != NULL && STREQ (name, "<variable, no debug info>")); |
3587 | } | |
3588 | ||
3589 | /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely | |
3590 | * duplicate other symbols in the list. (The only case I know of where | |
3591 | * this happens is when object files containing stabs-in-ecoff are | |
3592 | * linked with files containing ordinary ecoff debugging symbols (or no | |
3593 | * debugging symbols)). Modifies SYMS to squeeze out deleted symbols, | |
3594 | * and applies the same modification to BLOCKS to maintain the | |
3595 | * correspondence between SYMS[i] and BLOCKS[i]. Returns the number | |
3596 | * of symbols in the modified list. */ | |
3597 | static int | |
d2e4a39e | 3598 | remove_extra_symbols (struct symbol **syms, struct block **blocks, int nsyms) |
14f9c5c9 AS |
3599 | { |
3600 | int i, j; | |
3601 | ||
3602 | i = 0; | |
3603 | while (i < nsyms) | |
3604 | { | |
22abf04a | 3605 | if (DEPRECATED_SYMBOL_NAME (syms[i]) != NULL |
d2e4a39e | 3606 | && SYMBOL_CLASS (syms[i]) == LOC_STATIC |
14f9c5c9 AS |
3607 | && is_nondebugging_type (SYMBOL_TYPE (syms[i]))) |
3608 | { | |
3609 | for (j = 0; j < nsyms; j += 1) | |
3610 | { | |
d2e4a39e | 3611 | if (i != j |
22abf04a DC |
3612 | && DEPRECATED_SYMBOL_NAME (syms[j]) != NULL |
3613 | && STREQ (DEPRECATED_SYMBOL_NAME (syms[i]), DEPRECATED_SYMBOL_NAME (syms[j])) | |
14f9c5c9 | 3614 | && SYMBOL_CLASS (syms[i]) == SYMBOL_CLASS (syms[j]) |
d2e4a39e | 3615 | && SYMBOL_VALUE_ADDRESS (syms[i]) |
14f9c5c9 AS |
3616 | == SYMBOL_VALUE_ADDRESS (syms[j])) |
3617 | { | |
3618 | int k; | |
d2e4a39e | 3619 | for (k = i + 1; k < nsyms; k += 1) |
14f9c5c9 | 3620 | { |
d2e4a39e AS |
3621 | syms[k - 1] = syms[k]; |
3622 | blocks[k - 1] = blocks[k]; | |
14f9c5c9 AS |
3623 | } |
3624 | nsyms -= 1; | |
3625 | goto NextSymbol; | |
3626 | } | |
3627 | } | |
3628 | } | |
3629 | i += 1; | |
3630 | NextSymbol: | |
3631 | ; | |
3632 | } | |
3633 | return nsyms; | |
3634 | } | |
3635 | ||
176620f1 | 3636 | /* Find symbols in DOMAIN matching NAME, in BLOCK0 and enclosing |
14f9c5c9 AS |
3637 | scope and in global scopes, returning the number of matches. Sets |
3638 | *SYMS to point to a vector of matching symbols, with *BLOCKS | |
3639 | pointing to the vector of corresponding blocks in which those | |
3640 | symbols reside. These two vectors are transient---good only to the | |
3641 | next call of ada_lookup_symbol_list. Any non-function/non-enumeral symbol | |
3642 | match within the nest of blocks whose innermost member is BLOCK0, | |
3643 | is the outermost match returned (no other matches in that or | |
3644 | enclosing blocks is returned). If there are any matches in or | |
3645 | surrounding BLOCK0, then these alone are returned. */ | |
3646 | ||
3647 | int | |
ebf56fd3 | 3648 | ada_lookup_symbol_list (const char *name, struct block *block0, |
176620f1 | 3649 | domain_enum domain, struct symbol ***syms, |
d2e4a39e | 3650 | struct block ***blocks) |
14f9c5c9 AS |
3651 | { |
3652 | struct symbol *sym; | |
3653 | struct symtab *s; | |
3654 | struct partial_symtab *ps; | |
3655 | struct blockvector *bv; | |
3656 | struct objfile *objfile; | |
3657 | struct block *b; | |
3658 | struct block *block; | |
3659 | struct minimal_symbol *msymbol; | |
3660 | int wild_match = (strstr (name, "__") == NULL); | |
3661 | int cacheIfUnique; | |
3662 | ||
3663 | #ifdef TIMING | |
3664 | markTimeStart (0); | |
3665 | #endif | |
3666 | ||
3667 | ndefns = 0; | |
3668 | cacheIfUnique = 0; | |
3669 | ||
3670 | /* Search specified block and its superiors. */ | |
3671 | ||
3672 | block = block0; | |
3673 | while (block != NULL) | |
3674 | { | |
176620f1 | 3675 | ada_add_block_symbols (block, name, domain, NULL, wild_match); |
14f9c5c9 AS |
3676 | |
3677 | /* If we found a non-function match, assume that's the one. */ | |
3678 | if (is_nonfunction (defn_symbols, ndefns)) | |
3679 | goto done; | |
3680 | ||
3681 | block = BLOCK_SUPERBLOCK (block); | |
3682 | } | |
3683 | ||
3684 | /* If we found ANY matches in the specified BLOCK, we're done. */ | |
3685 | ||
3686 | if (ndefns > 0) | |
3687 | goto done; | |
d2e4a39e | 3688 | |
14f9c5c9 AS |
3689 | cacheIfUnique = 1; |
3690 | ||
3691 | /* Now add symbols from all global blocks: symbol tables, minimal symbol | |
3692 | tables, and psymtab's */ | |
3693 | ||
3694 | ALL_SYMTABS (objfile, s) | |
d2e4a39e AS |
3695 | { |
3696 | QUIT; | |
3697 | if (!s->primary) | |
3698 | continue; | |
3699 | bv = BLOCKVECTOR (s); | |
3700 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
176620f1 | 3701 | ada_add_block_symbols (block, name, domain, objfile, wild_match); |
d2e4a39e | 3702 | } |
14f9c5c9 | 3703 | |
176620f1 | 3704 | if (domain == VAR_DOMAIN) |
14f9c5c9 AS |
3705 | { |
3706 | ALL_MSYMBOLS (objfile, msymbol) | |
d2e4a39e | 3707 | { |
22abf04a | 3708 | if (ada_match_name (DEPRECATED_SYMBOL_NAME (msymbol), name, wild_match)) |
d2e4a39e AS |
3709 | { |
3710 | switch (MSYMBOL_TYPE (msymbol)) | |
3711 | { | |
3712 | case mst_solib_trampoline: | |
3713 | break; | |
3714 | default: | |
3715 | s = find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol)); | |
3716 | if (s != NULL) | |
3717 | { | |
3718 | int old_ndefns = ndefns; | |
3719 | QUIT; | |
3720 | bv = BLOCKVECTOR (s); | |
3721 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
3722 | ada_add_block_symbols (block, | |
22abf04a | 3723 | DEPRECATED_SYMBOL_NAME (msymbol), |
176620f1 | 3724 | domain, objfile, wild_match); |
d2e4a39e AS |
3725 | if (ndefns == old_ndefns) |
3726 | { | |
3727 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
3728 | ada_add_block_symbols (block, | |
22abf04a | 3729 | DEPRECATED_SYMBOL_NAME (msymbol), |
176620f1 | 3730 | domain, objfile, |
d2e4a39e AS |
3731 | wild_match); |
3732 | } | |
3733 | } | |
3734 | } | |
3735 | } | |
3736 | } | |
14f9c5c9 | 3737 | } |
d2e4a39e | 3738 | |
14f9c5c9 | 3739 | ALL_PSYMTABS (objfile, ps) |
d2e4a39e AS |
3740 | { |
3741 | QUIT; | |
3742 | if (!ps->readin | |
176620f1 | 3743 | && ada_lookup_partial_symbol (ps, name, 1, domain, wild_match)) |
d2e4a39e AS |
3744 | { |
3745 | s = PSYMTAB_TO_SYMTAB (ps); | |
3746 | if (!s->primary) | |
3747 | continue; | |
3748 | bv = BLOCKVECTOR (s); | |
3749 | block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); | |
176620f1 | 3750 | ada_add_block_symbols (block, name, domain, objfile, wild_match); |
d2e4a39e AS |
3751 | } |
3752 | } | |
3753 | ||
14f9c5c9 AS |
3754 | /* Now add symbols from all per-file blocks if we've gotten no hits. |
3755 | (Not strictly correct, but perhaps better than an error). | |
3756 | Do the symtabs first, then check the psymtabs */ | |
d2e4a39e | 3757 | |
14f9c5c9 AS |
3758 | if (ndefns == 0) |
3759 | { | |
3760 | ||
3761 | ALL_SYMTABS (objfile, s) | |
d2e4a39e AS |
3762 | { |
3763 | QUIT; | |
3764 | if (!s->primary) | |
3765 | continue; | |
3766 | bv = BLOCKVECTOR (s); | |
3767 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
176620f1 | 3768 | ada_add_block_symbols (block, name, domain, objfile, wild_match); |
d2e4a39e AS |
3769 | } |
3770 | ||
14f9c5c9 | 3771 | ALL_PSYMTABS (objfile, ps) |
d2e4a39e AS |
3772 | { |
3773 | QUIT; | |
3774 | if (!ps->readin | |
176620f1 | 3775 | && ada_lookup_partial_symbol (ps, name, 0, domain, wild_match)) |
d2e4a39e AS |
3776 | { |
3777 | s = PSYMTAB_TO_SYMTAB (ps); | |
3778 | bv = BLOCKVECTOR (s); | |
3779 | if (!s->primary) | |
3780 | continue; | |
3781 | block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK); | |
176620f1 | 3782 | ada_add_block_symbols (block, name, domain, |
d2e4a39e AS |
3783 | objfile, wild_match); |
3784 | } | |
3785 | } | |
3786 | } | |
14f9c5c9 AS |
3787 | |
3788 | /* Finally, we try to find NAME as a local symbol in some lexically | |
3789 | enclosing block. We do this last, expecting this case to be | |
3790 | rare. */ | |
d2e4a39e | 3791 | if (ndefns == 0) |
14f9c5c9 | 3792 | { |
176620f1 | 3793 | add_symbols_from_enclosing_procs (name, domain, wild_match); |
14f9c5c9 AS |
3794 | if (ndefns > 0) |
3795 | goto done; | |
3796 | } | |
3797 | ||
d2e4a39e | 3798 | done: |
14f9c5c9 AS |
3799 | ndefns = remove_extra_symbols (defn_symbols, defn_blocks, ndefns); |
3800 | ||
3801 | ||
3802 | *syms = defn_symbols; | |
3803 | *blocks = defn_blocks; | |
3804 | #ifdef TIMING | |
3805 | markTimeStop (0); | |
3806 | #endif | |
3807 | return ndefns; | |
3808 | } | |
3809 | ||
176620f1 | 3810 | /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing |
14f9c5c9 AS |
3811 | * scope and in global scopes, or NULL if none. NAME is folded to |
3812 | * lower case first, unless it is surrounded in single quotes. | |
3813 | * Otherwise, the result is as for ada_lookup_symbol_list, but is | |
3814 | * disambiguated by user query if needed. */ | |
3815 | ||
d2e4a39e AS |
3816 | struct symbol * |
3817 | ada_lookup_symbol (const char *name, struct block *block0, | |
176620f1 | 3818 | domain_enum domain) |
14f9c5c9 | 3819 | { |
d2e4a39e AS |
3820 | struct symbol **candidate_syms; |
3821 | struct block **candidate_blocks; | |
14f9c5c9 AS |
3822 | int n_candidates; |
3823 | ||
3824 | n_candidates = ada_lookup_symbol_list (name, | |
176620f1 | 3825 | block0, domain, |
14f9c5c9 AS |
3826 | &candidate_syms, &candidate_blocks); |
3827 | ||
3828 | if (n_candidates == 0) | |
3829 | return NULL; | |
3830 | else if (n_candidates != 1) | |
3831 | user_select_syms (candidate_syms, candidate_blocks, n_candidates, 1); | |
3832 | ||
3833 | return candidate_syms[0]; | |
3834 | } | |
3835 | ||
3836 | ||
3837 | /* True iff STR is a possible encoded suffix of a normal Ada name | |
3838 | * that is to be ignored for matching purposes. Suffixes of parallel | |
3839 | * names (e.g., XVE) are not included here. Currently, the possible suffixes | |
3840 | * are given by the regular expression: | |
3841 | * (X[nb]*)?(__[0-9]+|\$[0-9]+|___(LJM|X([FDBUP].*|R[^T]?)))?$ | |
3842 | * | |
3843 | */ | |
3844 | static int | |
d2e4a39e | 3845 | is_name_suffix (const char *str) |
14f9c5c9 AS |
3846 | { |
3847 | int k; | |
3848 | if (str[0] == 'X') | |
3849 | { | |
3850 | str += 1; | |
d2e4a39e | 3851 | while (str[0] != '_' && str[0] != '\0') |
14f9c5c9 AS |
3852 | { |
3853 | if (str[0] != 'n' && str[0] != 'b') | |
3854 | return 0; | |
3855 | str += 1; | |
d2e4a39e | 3856 | } |
14f9c5c9 AS |
3857 | } |
3858 | if (str[0] == '\000') | |
3859 | return 1; | |
d2e4a39e | 3860 | if (str[0] == '_') |
14f9c5c9 AS |
3861 | { |
3862 | if (str[1] != '_' || str[2] == '\000') | |
3863 | return 0; | |
d2e4a39e | 3864 | if (str[2] == '_') |
14f9c5c9 | 3865 | { |
d2e4a39e | 3866 | if (STREQ (str + 3, "LJM")) |
14f9c5c9 AS |
3867 | return 1; |
3868 | if (str[3] != 'X') | |
3869 | return 0; | |
3870 | if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B' || | |
3871 | str[4] == 'U' || str[4] == 'P') | |
3872 | return 1; | |
3873 | if (str[4] == 'R' && str[5] != 'T') | |
3874 | return 1; | |
3875 | return 0; | |
3876 | } | |
3877 | for (k = 2; str[k] != '\0'; k += 1) | |
3878 | if (!isdigit (str[k])) | |
3879 | return 0; | |
3880 | return 1; | |
3881 | } | |
3882 | if (str[0] == '$' && str[1] != '\000') | |
3883 | { | |
3884 | for (k = 1; str[k] != '\0'; k += 1) | |
3885 | if (!isdigit (str[k])) | |
3886 | return 0; | |
3887 | return 1; | |
3888 | } | |
3889 | return 0; | |
3890 | } | |
d2e4a39e | 3891 | |
14f9c5c9 AS |
3892 | /* True if NAME represents a name of the form A1.A2....An, n>=1 and |
3893 | * PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores | |
3894 | * informational suffixes of NAME (i.e., for which is_name_suffix is | |
d2e4a39e | 3895 | * true). */ |
14f9c5c9 | 3896 | static int |
d2e4a39e | 3897 | wild_match (const char *patn, int patn_len, const char *name) |
14f9c5c9 AS |
3898 | { |
3899 | int name_len; | |
3900 | int s, e; | |
3901 | ||
3902 | name_len = strlen (name); | |
d2e4a39e AS |
3903 | if (name_len >= patn_len + 5 && STREQN (name, "_ada_", 5) |
3904 | && STREQN (patn, name + 5, patn_len) | |
3905 | && is_name_suffix (name + patn_len + 5)) | |
14f9c5c9 AS |
3906 | return 1; |
3907 | ||
d2e4a39e | 3908 | while (name_len >= patn_len) |
14f9c5c9 | 3909 | { |
d2e4a39e | 3910 | if (STREQN (patn, name, patn_len) && is_name_suffix (name + patn_len)) |
14f9c5c9 | 3911 | return 1; |
d2e4a39e AS |
3912 | do |
3913 | { | |
3914 | name += 1; | |
3915 | name_len -= 1; | |
3916 | } | |
3917 | while (name_len > 0 | |
3918 | && name[0] != '.' && (name[0] != '_' || name[1] != '_')); | |
14f9c5c9 AS |
3919 | if (name_len <= 0) |
3920 | return 0; | |
3921 | if (name[0] == '_') | |
3922 | { | |
d2e4a39e | 3923 | if (!islower (name[2])) |
14f9c5c9 | 3924 | return 0; |
d2e4a39e AS |
3925 | name += 2; |
3926 | name_len -= 2; | |
14f9c5c9 AS |
3927 | } |
3928 | else | |
3929 | { | |
d2e4a39e | 3930 | if (!islower (name[1])) |
14f9c5c9 | 3931 | return 0; |
d2e4a39e AS |
3932 | name += 1; |
3933 | name_len -= 1; | |
14f9c5c9 AS |
3934 | } |
3935 | } | |
3936 | ||
3937 | return 0; | |
3938 | } | |
3939 | ||
3940 | ||
176620f1 | 3941 | /* Add symbols from BLOCK matching identifier NAME in DOMAIN to |
14f9c5c9 AS |
3942 | vector *defn_symbols, updating *defn_symbols (if necessary), *SZ (the size of |
3943 | the vector *defn_symbols), and *ndefns (the number of symbols | |
3944 | currently stored in *defn_symbols). If WILD, treat as NAME with a | |
3945 | wildcard prefix. OBJFILE is the section containing BLOCK. */ | |
3946 | ||
d2e4a39e AS |
3947 | static void |
3948 | ada_add_block_symbols (struct block *block, const char *name, | |
176620f1 | 3949 | domain_enum domain, struct objfile *objfile, |
ebf56fd3 | 3950 | int wild) |
14f9c5c9 | 3951 | { |
de4f826b | 3952 | struct dict_iterator iter; |
14f9c5c9 AS |
3953 | int name_len = strlen (name); |
3954 | /* A matching argument symbol, if any. */ | |
3955 | struct symbol *arg_sym; | |
3956 | /* Set true when we find a matching non-argument symbol */ | |
3957 | int found_sym; | |
261397f8 | 3958 | struct symbol *sym; |
14f9c5c9 | 3959 | |
d2e4a39e AS |
3960 | arg_sym = NULL; |
3961 | found_sym = 0; | |
14f9c5c9 AS |
3962 | if (wild) |
3963 | { | |
261397f8 | 3964 | struct symbol *sym; |
de4f826b | 3965 | ALL_BLOCK_SYMBOLS (block, iter, sym) |
d2e4a39e | 3966 | { |
176620f1 | 3967 | if (SYMBOL_DOMAIN (sym) == domain && |
22abf04a | 3968 | wild_match (name, name_len, DEPRECATED_SYMBOL_NAME (sym))) |
d2e4a39e AS |
3969 | { |
3970 | switch (SYMBOL_CLASS (sym)) | |
3971 | { | |
3972 | case LOC_ARG: | |
3973 | case LOC_LOCAL_ARG: | |
3974 | case LOC_REF_ARG: | |
3975 | case LOC_REGPARM: | |
3976 | case LOC_REGPARM_ADDR: | |
3977 | case LOC_BASEREG_ARG: | |
4c2df51b | 3978 | case LOC_COMPUTED_ARG: |
d2e4a39e AS |
3979 | arg_sym = sym; |
3980 | break; | |
3981 | case LOC_UNRESOLVED: | |
3982 | continue; | |
3983 | default: | |
3984 | found_sym = 1; | |
3985 | fill_in_ada_prototype (sym); | |
3986 | add_defn_to_vec (fixup_symbol_section (sym, objfile), block); | |
3987 | break; | |
3988 | } | |
3989 | } | |
3990 | } | |
14f9c5c9 | 3991 | } |
d2e4a39e | 3992 | else |
14f9c5c9 | 3993 | { |
de4f826b | 3994 | ALL_BLOCK_SYMBOLS (block, iter, sym) |
261397f8 | 3995 | { |
176620f1 | 3996 | if (SYMBOL_DOMAIN (sym) == domain) |
261397f8 | 3997 | { |
22abf04a | 3998 | int cmp = strncmp (name, DEPRECATED_SYMBOL_NAME (sym), name_len); |
14f9c5c9 | 3999 | |
526e70c0 DC |
4000 | if (cmp == 0 |
4001 | && is_name_suffix (DEPRECATED_SYMBOL_NAME (sym) + name_len)) | |
261397f8 DJ |
4002 | { |
4003 | switch (SYMBOL_CLASS (sym)) | |
4004 | { | |
4005 | case LOC_ARG: | |
4006 | case LOC_LOCAL_ARG: | |
4007 | case LOC_REF_ARG: | |
4008 | case LOC_REGPARM: | |
4009 | case LOC_REGPARM_ADDR: | |
4010 | case LOC_BASEREG_ARG: | |
4c2df51b | 4011 | case LOC_COMPUTED_ARG: |
261397f8 DJ |
4012 | arg_sym = sym; |
4013 | break; | |
4014 | case LOC_UNRESOLVED: | |
4015 | break; | |
4016 | default: | |
4017 | found_sym = 1; | |
4018 | fill_in_ada_prototype (sym); | |
4019 | add_defn_to_vec (fixup_symbol_section (sym, objfile), | |
4020 | block); | |
4021 | break; | |
4022 | } | |
4023 | } | |
4024 | } | |
4025 | } | |
14f9c5c9 AS |
4026 | } |
4027 | ||
d2e4a39e | 4028 | if (!found_sym && arg_sym != NULL) |
14f9c5c9 AS |
4029 | { |
4030 | fill_in_ada_prototype (arg_sym); | |
4031 | add_defn_to_vec (fixup_symbol_section (arg_sym, objfile), block); | |
4032 | } | |
4033 | ||
d2e4a39e | 4034 | if (!wild) |
14f9c5c9 | 4035 | { |
d2e4a39e AS |
4036 | arg_sym = NULL; |
4037 | found_sym = 0; | |
14f9c5c9 | 4038 | |
de4f826b | 4039 | ALL_BLOCK_SYMBOLS (block, iter, sym) |
261397f8 DJ |
4040 | { |
4041 | struct symbol *sym = BLOCK_SYM (block, i); | |
14f9c5c9 | 4042 | |
176620f1 | 4043 | if (SYMBOL_DOMAIN (sym) == domain) |
261397f8 DJ |
4044 | { |
4045 | int cmp; | |
14f9c5c9 | 4046 | |
22abf04a | 4047 | cmp = (int) '_' - (int) DEPRECATED_SYMBOL_NAME (sym)[0]; |
d2e4a39e | 4048 | if (cmp == 0) |
261397f8 | 4049 | { |
22abf04a | 4050 | cmp = strncmp ("_ada_", DEPRECATED_SYMBOL_NAME (sym), 5); |
261397f8 | 4051 | if (cmp == 0) |
22abf04a | 4052 | cmp = strncmp (name, DEPRECATED_SYMBOL_NAME (sym) + 5, name_len); |
261397f8 DJ |
4053 | } |
4054 | ||
526e70c0 DC |
4055 | if (cmp == 0 |
4056 | && is_name_suffix (DEPRECATED_SYMBOL_NAME (sym) + name_len + 5)) | |
261397f8 DJ |
4057 | { |
4058 | switch (SYMBOL_CLASS (sym)) | |
4059 | { | |
4060 | case LOC_ARG: | |
4061 | case LOC_LOCAL_ARG: | |
4062 | case LOC_REF_ARG: | |
4063 | case LOC_REGPARM: | |
4064 | case LOC_REGPARM_ADDR: | |
4065 | case LOC_BASEREG_ARG: | |
4c2df51b | 4066 | case LOC_COMPUTED_ARG: |
261397f8 DJ |
4067 | arg_sym = sym; |
4068 | break; | |
4069 | case LOC_UNRESOLVED: | |
4070 | break; | |
4071 | default: | |
4072 | found_sym = 1; | |
4073 | fill_in_ada_prototype (sym); | |
4074 | add_defn_to_vec (fixup_symbol_section (sym, objfile), | |
4075 | block); | |
4076 | break; | |
4077 | } | |
4078 | } | |
4079 | } | |
4080 | } | |
d2e4a39e | 4081 | |
14f9c5c9 | 4082 | /* NOTE: This really shouldn't be needed for _ada_ symbols. |
d2e4a39e AS |
4083 | They aren't parameters, right? */ |
4084 | if (!found_sym && arg_sym != NULL) | |
14f9c5c9 AS |
4085 | { |
4086 | fill_in_ada_prototype (arg_sym); | |
4087 | add_defn_to_vec (fixup_symbol_section (arg_sym, objfile), block); | |
4088 | } | |
4089 | } | |
4090 | } | |
14f9c5c9 | 4091 | \f |
d2e4a39e | 4092 | |
14f9c5c9 AS |
4093 | /* Function Types */ |
4094 | ||
4095 | /* Assuming that SYM is the symbol for a function, fill in its type | |
170911c7 | 4096 | with prototype information, if it is not already there. */ |
14f9c5c9 AS |
4097 | |
4098 | static void | |
d2e4a39e | 4099 | fill_in_ada_prototype (struct symbol *func) |
14f9c5c9 | 4100 | { |
d2e4a39e | 4101 | struct block *b; |
14f9c5c9 | 4102 | int nargs, nsyms; |
de4f826b | 4103 | struct dict_iterator iter; |
d2e4a39e AS |
4104 | struct type *ftype; |
4105 | struct type *rtype; | |
14f9c5c9 | 4106 | size_t max_fields; |
261397f8 | 4107 | struct symbol *sym; |
14f9c5c9 AS |
4108 | |
4109 | if (func == NULL | |
4110 | || TYPE_CODE (SYMBOL_TYPE (func)) != TYPE_CODE_FUNC | |
4111 | || TYPE_FIELDS (SYMBOL_TYPE (func)) != NULL) | |
4112 | return; | |
4113 | ||
4114 | /* We make each function type unique, so that each may have its own */ | |
4115 | /* parameter types. This particular way of doing so wastes space: */ | |
4116 | /* it would be nicer to build the argument types while the original */ | |
4117 | /* function type is being built (FIXME). */ | |
4118 | rtype = check_typedef (TYPE_TARGET_TYPE (SYMBOL_TYPE (func))); | |
4119 | ftype = alloc_type (TYPE_OBJFILE (SYMBOL_TYPE (func))); | |
4120 | make_function_type (rtype, &ftype); | |
4121 | SYMBOL_TYPE (func) = ftype; | |
4122 | ||
4123 | b = SYMBOL_BLOCK_VALUE (func); | |
14f9c5c9 AS |
4124 | |
4125 | nargs = 0; | |
d2e4a39e AS |
4126 | max_fields = 8; |
4127 | TYPE_FIELDS (ftype) = | |
4128 | (struct field *) xmalloc (sizeof (struct field) * max_fields); | |
de4f826b | 4129 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
d2e4a39e AS |
4130 | { |
4131 | GROW_VECT (TYPE_FIELDS (ftype), max_fields, nargs + 1); | |
14f9c5c9 | 4132 | |
d2e4a39e AS |
4133 | switch (SYMBOL_CLASS (sym)) |
4134 | { | |
4135 | case LOC_REF_ARG: | |
4136 | case LOC_REGPARM_ADDR: | |
4137 | TYPE_FIELD_BITPOS (ftype, nargs) = nargs; | |
4138 | TYPE_FIELD_BITSIZE (ftype, nargs) = 0; | |
01ad7f36 | 4139 | TYPE_FIELD_STATIC_KIND (ftype, nargs) = 0; |
d2e4a39e AS |
4140 | TYPE_FIELD_TYPE (ftype, nargs) = |
4141 | lookup_pointer_type (check_typedef (SYMBOL_TYPE (sym))); | |
22abf04a | 4142 | TYPE_FIELD_NAME (ftype, nargs) = DEPRECATED_SYMBOL_NAME (sym); |
d2e4a39e | 4143 | nargs += 1; |
14f9c5c9 | 4144 | |
d2e4a39e AS |
4145 | break; |
4146 | ||
4147 | case LOC_ARG: | |
4148 | case LOC_REGPARM: | |
4149 | case LOC_LOCAL_ARG: | |
4150 | case LOC_BASEREG_ARG: | |
4c2df51b | 4151 | case LOC_COMPUTED_ARG: |
d2e4a39e AS |
4152 | TYPE_FIELD_BITPOS (ftype, nargs) = nargs; |
4153 | TYPE_FIELD_BITSIZE (ftype, nargs) = 0; | |
01ad7f36 | 4154 | TYPE_FIELD_STATIC_KIND (ftype, nargs) = 0; |
d2e4a39e | 4155 | TYPE_FIELD_TYPE (ftype, nargs) = check_typedef (SYMBOL_TYPE (sym)); |
22abf04a | 4156 | TYPE_FIELD_NAME (ftype, nargs) = DEPRECATED_SYMBOL_NAME (sym); |
d2e4a39e AS |
4157 | nargs += 1; |
4158 | ||
4159 | break; | |
4160 | ||
4161 | default: | |
4162 | break; | |
4163 | } | |
4164 | } | |
14f9c5c9 AS |
4165 | |
4166 | /* Re-allocate fields vector; if there are no fields, make the */ | |
4167 | /* fields pointer non-null anyway, to mark that this function type */ | |
4168 | /* has been filled in. */ | |
4169 | ||
4170 | TYPE_NFIELDS (ftype) = nargs; | |
4171 | if (nargs == 0) | |
4172 | { | |
d2e4a39e | 4173 | static struct field dummy_field = { 0, 0, 0, 0 }; |
aacb1f0a | 4174 | xfree (TYPE_FIELDS (ftype)); |
14f9c5c9 AS |
4175 | TYPE_FIELDS (ftype) = &dummy_field; |
4176 | } | |
4177 | else | |
4178 | { | |
d2e4a39e AS |
4179 | struct field *fields = |
4180 | (struct field *) TYPE_ALLOC (ftype, nargs * sizeof (struct field)); | |
4181 | memcpy ((char *) fields, | |
4182 | (char *) TYPE_FIELDS (ftype), nargs * sizeof (struct field)); | |
aacb1f0a | 4183 | xfree (TYPE_FIELDS (ftype)); |
14f9c5c9 AS |
4184 | TYPE_FIELDS (ftype) = fields; |
4185 | } | |
4186 | } | |
14f9c5c9 | 4187 | \f |
d2e4a39e | 4188 | |
14f9c5c9 AS |
4189 | /* Breakpoint-related */ |
4190 | ||
d2e4a39e AS |
4191 | char no_symtab_msg[] = |
4192 | "No symbol table is loaded. Use the \"file\" command."; | |
14f9c5c9 AS |
4193 | |
4194 | /* Assuming that LINE is pointing at the beginning of an argument to | |
4195 | 'break', return a pointer to the delimiter for the initial segment | |
4196 | of that name. This is the first ':', ' ', or end of LINE. | |
4197 | */ | |
d2e4a39e AS |
4198 | char * |
4199 | ada_start_decode_line_1 (char *line) | |
14f9c5c9 AS |
4200 | { |
4201 | /* [NOTE: strpbrk would be more elegant, but I am reluctant to be | |
4202 | the first to use such a library function in GDB code.] */ | |
d2e4a39e | 4203 | char *p; |
14f9c5c9 AS |
4204 | for (p = line; *p != '\000' && *p != ' ' && *p != ':'; p += 1) |
4205 | ; | |
4206 | return p; | |
4207 | } | |
4208 | ||
4209 | /* *SPEC points to a function and line number spec (as in a break | |
4210 | command), following any initial file name specification. | |
4211 | ||
4212 | Return all symbol table/line specfications (sals) consistent with the | |
4213 | information in *SPEC and FILE_TABLE in the | |
4214 | following sense: | |
4215 | + FILE_TABLE is null, or the sal refers to a line in the file | |
4216 | named by FILE_TABLE. | |
4217 | + If *SPEC points to an argument with a trailing ':LINENUM', | |
4218 | then the sal refers to that line (or one following it as closely as | |
4219 | possible). | |
4220 | + If *SPEC does not start with '*', the sal is in a function with | |
4221 | that name. | |
4222 | ||
4223 | Returns with 0 elements if no matching non-minimal symbols found. | |
4224 | ||
4225 | If *SPEC begins with a function name of the form <NAME>, then NAME | |
4226 | is taken as a literal name; otherwise the function name is subject | |
4227 | to the usual mangling. | |
4228 | ||
4229 | *SPEC is updated to point after the function/line number specification. | |
4230 | ||
4231 | FUNFIRSTLINE is non-zero if we desire the first line of real code | |
4232 | in each function (this is ignored in the presence of a LINENUM spec.). | |
4233 | ||
4234 | If CANONICAL is non-NULL, and if any of the sals require a | |
4235 | 'canonical line spec', then *CANONICAL is set to point to an array | |
4236 | of strings, corresponding to and equal in length to the returned | |
4237 | list of sals, such that (*CANONICAL)[i] is non-null and contains a | |
4238 | canonical line spec for the ith returned sal, if needed. If no | |
4239 | canonical line specs are required and CANONICAL is non-null, | |
4240 | *CANONICAL is set to NULL. | |
4241 | ||
4242 | A 'canonical line spec' is simply a name (in the format of the | |
4243 | breakpoint command) that uniquely identifies a breakpoint position, | |
4244 | with no further contextual information or user selection. It is | |
4245 | needed whenever the file name, function name, and line number | |
4246 | information supplied is insufficient for this unique | |
4247 | identification. Currently overloaded functions, the name '*', | |
4248 | or static functions without a filename yield a canonical line spec. | |
4249 | The array and the line spec strings are allocated on the heap; it | |
4250 | is the caller's responsibility to free them. */ | |
4251 | ||
4252 | struct symtabs_and_lines | |
d2e4a39e AS |
4253 | ada_finish_decode_line_1 (char **spec, struct symtab *file_table, |
4254 | int funfirstline, char ***canonical) | |
14f9c5c9 | 4255 | { |
d2e4a39e AS |
4256 | struct symbol **symbols; |
4257 | struct block **blocks; | |
4258 | struct block *block; | |
14f9c5c9 AS |
4259 | int n_matches, i, line_num; |
4260 | struct symtabs_and_lines selected; | |
d2e4a39e AS |
4261 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); |
4262 | char *name; | |
14f9c5c9 AS |
4263 | |
4264 | int len; | |
d2e4a39e AS |
4265 | char *lower_name; |
4266 | char *unquoted_name; | |
14f9c5c9 AS |
4267 | |
4268 | if (file_table == NULL) | |
4269 | block = get_selected_block (NULL); | |
4270 | else | |
4271 | block = BLOCKVECTOR_BLOCK (BLOCKVECTOR (file_table), STATIC_BLOCK); | |
4272 | ||
4273 | if (canonical != NULL) | |
d2e4a39e | 4274 | *canonical = (char **) NULL; |
14f9c5c9 AS |
4275 | |
4276 | name = *spec; | |
d2e4a39e | 4277 | if (**spec == '*') |
14f9c5c9 AS |
4278 | *spec += 1; |
4279 | else | |
4280 | { | |
d2e4a39e AS |
4281 | while (**spec != '\000' && |
4282 | !strchr (ada_completer_word_break_characters, **spec)) | |
14f9c5c9 AS |
4283 | *spec += 1; |
4284 | } | |
4285 | len = *spec - name; | |
4286 | ||
4287 | line_num = -1; | |
4288 | if (file_table != NULL && (*spec)[0] == ':' && isdigit ((*spec)[1])) | |
4289 | { | |
4290 | line_num = strtol (*spec + 1, spec, 10); | |
d2e4a39e | 4291 | while (**spec == ' ' || **spec == '\t') |
14f9c5c9 AS |
4292 | *spec += 1; |
4293 | } | |
4294 | ||
d2e4a39e | 4295 | if (name[0] == '*') |
14f9c5c9 AS |
4296 | { |
4297 | if (line_num == -1) | |
4298 | error ("Wild-card function with no line number or file name."); | |
4299 | ||
4300 | return all_sals_for_line (file_table->filename, line_num, canonical); | |
4301 | } | |
4302 | ||
4303 | if (name[0] == '\'') | |
4304 | { | |
4305 | name += 1; | |
4306 | len -= 2; | |
4307 | } | |
4308 | ||
4309 | if (name[0] == '<') | |
4310 | { | |
d2e4a39e AS |
4311 | unquoted_name = (char *) alloca (len - 1); |
4312 | memcpy (unquoted_name, name + 1, len - 2); | |
4313 | unquoted_name[len - 2] = '\000'; | |
14f9c5c9 AS |
4314 | lower_name = NULL; |
4315 | } | |
4316 | else | |
4317 | { | |
d2e4a39e | 4318 | unquoted_name = (char *) alloca (len + 1); |
14f9c5c9 AS |
4319 | memcpy (unquoted_name, name, len); |
4320 | unquoted_name[len] = '\000'; | |
d2e4a39e | 4321 | lower_name = (char *) alloca (len + 1); |
14f9c5c9 AS |
4322 | for (i = 0; i < len; i += 1) |
4323 | lower_name[i] = tolower (name[i]); | |
4324 | lower_name[len] = '\000'; | |
4325 | } | |
4326 | ||
4327 | n_matches = 0; | |
d2e4a39e AS |
4328 | if (lower_name != NULL) |
4329 | n_matches = ada_lookup_symbol_list (ada_mangle (lower_name), block, | |
176620f1 | 4330 | VAR_DOMAIN, &symbols, &blocks); |
14f9c5c9 | 4331 | if (n_matches == 0) |
d2e4a39e | 4332 | n_matches = ada_lookup_symbol_list (unquoted_name, block, |
176620f1 | 4333 | VAR_DOMAIN, &symbols, &blocks); |
14f9c5c9 AS |
4334 | if (n_matches == 0 && line_num >= 0) |
4335 | error ("No line number information found for %s.", unquoted_name); | |
4336 | else if (n_matches == 0) | |
4337 | { | |
4338 | #ifdef HPPA_COMPILER_BUG | |
4339 | /* FIXME: See comment in symtab.c::decode_line_1 */ | |
4340 | #undef volatile | |
4341 | volatile struct symtab_and_line val; | |
d2e4a39e | 4342 | #define volatile /*nothing */ |
14f9c5c9 AS |
4343 | #else |
4344 | struct symtab_and_line val; | |
4345 | #endif | |
d2e4a39e | 4346 | struct minimal_symbol *msymbol; |
14f9c5c9 | 4347 | |
fe39c653 | 4348 | init_sal (&val); |
14f9c5c9 AS |
4349 | |
4350 | msymbol = NULL; | |
d2e4a39e | 4351 | if (lower_name != NULL) |
14f9c5c9 AS |
4352 | msymbol = ada_lookup_minimal_symbol (ada_mangle (lower_name)); |
4353 | if (msymbol == NULL) | |
4354 | msymbol = ada_lookup_minimal_symbol (unquoted_name); | |
4355 | if (msymbol != NULL) | |
4356 | { | |
d2e4a39e | 4357 | val.pc = SYMBOL_VALUE_ADDRESS (msymbol); |
14f9c5c9 AS |
4358 | val.section = SYMBOL_BFD_SECTION (msymbol); |
4359 | if (funfirstline) | |
4360 | { | |
4361 | val.pc += FUNCTION_START_OFFSET; | |
4362 | SKIP_PROLOGUE (val.pc); | |
4363 | } | |
4364 | selected.sals = (struct symtab_and_line *) | |
4365 | xmalloc (sizeof (struct symtab_and_line)); | |
4366 | selected.sals[0] = val; | |
4367 | selected.nelts = 1; | |
4368 | return selected; | |
d2e4a39e AS |
4369 | } |
4370 | ||
14f9c5c9 AS |
4371 | if (!have_full_symbols () && |
4372 | !have_partial_symbols () && !have_minimal_symbols ()) | |
4373 | error (no_symtab_msg); | |
4374 | ||
4375 | error ("Function \"%s\" not defined.", unquoted_name); | |
d2e4a39e | 4376 | return selected; /* for lint */ |
14f9c5c9 AS |
4377 | } |
4378 | ||
4379 | if (line_num >= 0) | |
4380 | { | |
d2e4a39e AS |
4381 | return |
4382 | find_sal_from_funcs_and_line (file_table->filename, line_num, | |
14f9c5c9 AS |
4383 | symbols, n_matches); |
4384 | } | |
4385 | else | |
4386 | { | |
d2e4a39e AS |
4387 | selected.nelts = |
4388 | user_select_syms (symbols, blocks, n_matches, n_matches); | |
14f9c5c9 AS |
4389 | } |
4390 | ||
d2e4a39e | 4391 | selected.sals = (struct symtab_and_line *) |
14f9c5c9 AS |
4392 | xmalloc (sizeof (struct symtab_and_line) * selected.nelts); |
4393 | memset (selected.sals, 0, selected.nelts * sizeof (selected.sals[i])); | |
aacb1f0a | 4394 | make_cleanup (xfree, selected.sals); |
14f9c5c9 AS |
4395 | |
4396 | i = 0; | |
4397 | while (i < selected.nelts) | |
4398 | { | |
d2e4a39e | 4399 | if (SYMBOL_CLASS (symbols[i]) == LOC_BLOCK) |
14f9c5c9 | 4400 | selected.sals[i] = find_function_start_sal (symbols[i], funfirstline); |
d2e4a39e | 4401 | else if (SYMBOL_LINE (symbols[i]) != 0) |
14f9c5c9 AS |
4402 | { |
4403 | selected.sals[i].symtab = symtab_for_sym (symbols[i]); | |
4404 | selected.sals[i].line = SYMBOL_LINE (symbols[i]); | |
4405 | } | |
4406 | else if (line_num >= 0) | |
4407 | { | |
4408 | /* Ignore this choice */ | |
d2e4a39e AS |
4409 | symbols[i] = symbols[selected.nelts - 1]; |
4410 | blocks[i] = blocks[selected.nelts - 1]; | |
14f9c5c9 AS |
4411 | selected.nelts -= 1; |
4412 | continue; | |
4413 | } | |
d2e4a39e | 4414 | else |
14f9c5c9 AS |
4415 | error ("Line number not known for symbol \"%s\"", unquoted_name); |
4416 | i += 1; | |
4417 | } | |
4418 | ||
4419 | if (canonical != NULL && (line_num >= 0 || n_matches > 1)) | |
4420 | { | |
d2e4a39e | 4421 | *canonical = (char **) xmalloc (sizeof (char *) * selected.nelts); |
14f9c5c9 | 4422 | for (i = 0; i < selected.nelts; i += 1) |
d2e4a39e AS |
4423 | (*canonical)[i] = |
4424 | extended_canonical_line_spec (selected.sals[i], | |
de5ad195 | 4425 | SYMBOL_PRINT_NAME (symbols[i])); |
14f9c5c9 | 4426 | } |
d2e4a39e | 4427 | |
14f9c5c9 AS |
4428 | discard_cleanups (old_chain); |
4429 | return selected; | |
d2e4a39e AS |
4430 | } |
4431 | ||
14f9c5c9 AS |
4432 | /* The (single) sal corresponding to line LINE_NUM in a symbol table |
4433 | with file name FILENAME that occurs in one of the functions listed | |
d2e4a39e | 4434 | in SYMBOLS[0 .. NSYMS-1]. */ |
14f9c5c9 | 4435 | static struct symtabs_and_lines |
d2e4a39e AS |
4436 | find_sal_from_funcs_and_line (const char *filename, int line_num, |
4437 | struct symbol **symbols, int nsyms) | |
14f9c5c9 AS |
4438 | { |
4439 | struct symtabs_and_lines sals; | |
4440 | int best_index, best; | |
d2e4a39e AS |
4441 | struct linetable *best_linetable; |
4442 | struct objfile *objfile; | |
4443 | struct symtab *s; | |
4444 | struct symtab *best_symtab; | |
14f9c5c9 AS |
4445 | |
4446 | read_all_symtabs (filename); | |
4447 | ||
d2e4a39e AS |
4448 | best_index = 0; |
4449 | best_linetable = NULL; | |
4450 | best_symtab = NULL; | |
14f9c5c9 AS |
4451 | best = 0; |
4452 | ALL_SYMTABS (objfile, s) | |
d2e4a39e AS |
4453 | { |
4454 | struct linetable *l; | |
4455 | int ind, exact; | |
14f9c5c9 | 4456 | |
d2e4a39e | 4457 | QUIT; |
14f9c5c9 | 4458 | |
d2e4a39e AS |
4459 | if (!STREQ (filename, s->filename)) |
4460 | continue; | |
4461 | l = LINETABLE (s); | |
4462 | ind = find_line_in_linetable (l, line_num, symbols, nsyms, &exact); | |
4463 | if (ind >= 0) | |
4464 | { | |
4465 | if (exact) | |
4466 | { | |
4467 | best_index = ind; | |
4468 | best_linetable = l; | |
4469 | best_symtab = s; | |
4470 | goto done; | |
4471 | } | |
4472 | if (best == 0 || l->item[ind].line < best) | |
4473 | { | |
4474 | best = l->item[ind].line; | |
4475 | best_index = ind; | |
4476 | best_linetable = l; | |
4477 | best_symtab = s; | |
4478 | } | |
4479 | } | |
4480 | } | |
14f9c5c9 AS |
4481 | |
4482 | if (best == 0) | |
4483 | error ("Line number not found in designated function."); | |
4484 | ||
d2e4a39e AS |
4485 | done: |
4486 | ||
14f9c5c9 | 4487 | sals.nelts = 1; |
d2e4a39e | 4488 | sals.sals = (struct symtab_and_line *) xmalloc (sizeof (sals.sals[0])); |
14f9c5c9 | 4489 | |
fe39c653 | 4490 | init_sal (&sals.sals[0]); |
d2e4a39e | 4491 | |
14f9c5c9 AS |
4492 | sals.sals[0].line = best_linetable->item[best_index].line; |
4493 | sals.sals[0].pc = best_linetable->item[best_index].pc; | |
4494 | sals.sals[0].symtab = best_symtab; | |
4495 | ||
4496 | return sals; | |
4497 | } | |
4498 | ||
4499 | /* Return the index in LINETABLE of the best match for LINE_NUM whose | |
4500 | pc falls within one of the functions denoted by SYMBOLS[0..NSYMS-1]. | |
4501 | Set *EXACTP to the 1 if the match is exact, and 0 otherwise. */ | |
4502 | static int | |
d2e4a39e AS |
4503 | find_line_in_linetable (struct linetable *linetable, int line_num, |
4504 | struct symbol **symbols, int nsyms, int *exactp) | |
14f9c5c9 AS |
4505 | { |
4506 | int i, len, best_index, best; | |
4507 | ||
4508 | if (line_num <= 0 || linetable == NULL) | |
4509 | return -1; | |
4510 | ||
4511 | len = linetable->nitems; | |
4512 | for (i = 0, best_index = -1, best = 0; i < len; i += 1) | |
4513 | { | |
4514 | int k; | |
d2e4a39e | 4515 | struct linetable_entry *item = &(linetable->item[i]); |
14f9c5c9 AS |
4516 | |
4517 | for (k = 0; k < nsyms; k += 1) | |
4518 | { | |
4519 | if (symbols[k] != NULL && SYMBOL_CLASS (symbols[k]) == LOC_BLOCK | |
4520 | && item->pc >= BLOCK_START (SYMBOL_BLOCK_VALUE (symbols[k])) | |
4521 | && item->pc < BLOCK_END (SYMBOL_BLOCK_VALUE (symbols[k]))) | |
4522 | goto candidate; | |
4523 | } | |
4524 | continue; | |
4525 | ||
4526 | candidate: | |
4527 | ||
4528 | if (item->line == line_num) | |
4529 | { | |
4530 | *exactp = 1; | |
4531 | return i; | |
4532 | } | |
4533 | ||
4534 | if (item->line > line_num && (best == 0 || item->line < best)) | |
4535 | { | |
4536 | best = item->line; | |
4537 | best_index = i; | |
4538 | } | |
4539 | } | |
4540 | ||
4541 | *exactp = 0; | |
4542 | return best_index; | |
4543 | } | |
4544 | ||
4545 | /* Find the smallest k >= LINE_NUM such that k is a line number in | |
4546 | LINETABLE, and k falls strictly within a named function that begins at | |
4547 | or before LINE_NUM. Return -1 if there is no such k. */ | |
4548 | static int | |
d2e4a39e | 4549 | nearest_line_number_in_linetable (struct linetable *linetable, int line_num) |
14f9c5c9 AS |
4550 | { |
4551 | int i, len, best; | |
4552 | ||
4553 | if (line_num <= 0 || linetable == NULL || linetable->nitems == 0) | |
4554 | return -1; | |
4555 | len = linetable->nitems; | |
4556 | ||
d2e4a39e AS |
4557 | i = 0; |
4558 | best = INT_MAX; | |
14f9c5c9 AS |
4559 | while (i < len) |
4560 | { | |
4561 | int k; | |
d2e4a39e | 4562 | struct linetable_entry *item = &(linetable->item[i]); |
14f9c5c9 AS |
4563 | |
4564 | if (item->line >= line_num && item->line < best) | |
4565 | { | |
d2e4a39e | 4566 | char *func_name; |
14f9c5c9 AS |
4567 | CORE_ADDR start, end; |
4568 | ||
4569 | func_name = NULL; | |
4570 | find_pc_partial_function (item->pc, &func_name, &start, &end); | |
4571 | ||
4572 | if (func_name != NULL && item->pc < end) | |
4573 | { | |
4574 | if (item->line == line_num) | |
4575 | return line_num; | |
d2e4a39e | 4576 | else |
14f9c5c9 | 4577 | { |
d2e4a39e | 4578 | struct symbol *sym = |
176620f1 | 4579 | standard_lookup (func_name, VAR_DOMAIN); |
14f9c5c9 AS |
4580 | if (is_plausible_func_for_line (sym, line_num)) |
4581 | best = item->line; | |
4582 | else | |
4583 | { | |
4584 | do | |
4585 | i += 1; | |
4586 | while (i < len && linetable->item[i].pc < end); | |
4587 | continue; | |
4588 | } | |
4589 | } | |
4590 | } | |
4591 | } | |
4592 | ||
4593 | i += 1; | |
4594 | } | |
4595 | ||
4596 | return (best == INT_MAX) ? -1 : best; | |
4597 | } | |
4598 | ||
4599 | ||
4600 | /* Return the next higher index, k, into LINETABLE such that k > IND, | |
4601 | entry k in LINETABLE has a line number equal to LINE_NUM, k | |
4602 | corresponds to a PC that is in a function different from that | |
4603 | corresponding to IND, and falls strictly within a named function | |
4604 | that begins at a line at or preceding STARTING_LINE. | |
4605 | Return -1 if there is no such k. | |
4606 | IND == -1 corresponds to no function. */ | |
4607 | ||
4608 | static int | |
d2e4a39e | 4609 | find_next_line_in_linetable (struct linetable *linetable, int line_num, |
ebf56fd3 | 4610 | int starting_line, int ind) |
14f9c5c9 AS |
4611 | { |
4612 | int i, len; | |
4613 | ||
4614 | if (line_num <= 0 || linetable == NULL || ind >= linetable->nitems) | |
4615 | return -1; | |
4616 | len = linetable->nitems; | |
4617 | ||
d2e4a39e | 4618 | if (ind >= 0) |
14f9c5c9 AS |
4619 | { |
4620 | CORE_ADDR start, end; | |
4621 | ||
4622 | if (find_pc_partial_function (linetable->item[ind].pc, | |
d2e4a39e | 4623 | (char **) NULL, &start, &end)) |
14f9c5c9 AS |
4624 | { |
4625 | while (ind < len && linetable->item[ind].pc < end) | |
4626 | ind += 1; | |
4627 | } | |
4628 | else | |
4629 | ind += 1; | |
4630 | } | |
4631 | else | |
4632 | ind = 0; | |
4633 | ||
4634 | i = ind; | |
4635 | while (i < len) | |
4636 | { | |
4637 | int k; | |
d2e4a39e | 4638 | struct linetable_entry *item = &(linetable->item[i]); |
14f9c5c9 AS |
4639 | |
4640 | if (item->line >= line_num) | |
4641 | { | |
d2e4a39e | 4642 | char *func_name; |
14f9c5c9 AS |
4643 | CORE_ADDR start, end; |
4644 | ||
4645 | func_name = NULL; | |
4646 | find_pc_partial_function (item->pc, &func_name, &start, &end); | |
4647 | ||
4648 | if (func_name != NULL && item->pc < end) | |
4649 | { | |
4650 | if (item->line == line_num) | |
4651 | { | |
d2e4a39e | 4652 | struct symbol *sym = |
176620f1 | 4653 | standard_lookup (func_name, VAR_DOMAIN); |
14f9c5c9 AS |
4654 | if (is_plausible_func_for_line (sym, starting_line)) |
4655 | return i; | |
4656 | else | |
4657 | { | |
d2e4a39e | 4658 | while ((i + 1) < len && linetable->item[i + 1].pc < end) |
14f9c5c9 AS |
4659 | i += 1; |
4660 | } | |
4661 | } | |
4662 | } | |
4663 | } | |
4664 | i += 1; | |
4665 | } | |
4666 | ||
4667 | return -1; | |
4668 | } | |
4669 | ||
4670 | /* True iff function symbol SYM starts somewhere at or before line # | |
4671 | LINE_NUM. */ | |
4672 | static int | |
d2e4a39e | 4673 | is_plausible_func_for_line (struct symbol *sym, int line_num) |
14f9c5c9 AS |
4674 | { |
4675 | struct symtab_and_line start_sal; | |
4676 | ||
4677 | if (sym == NULL) | |
4678 | return 0; | |
4679 | ||
4680 | start_sal = find_function_start_sal (sym, 0); | |
4681 | ||
4682 | return (start_sal.line != 0 && line_num >= start_sal.line); | |
4683 | } | |
4684 | ||
4685 | static void | |
d2e4a39e | 4686 | debug_print_lines (struct linetable *lt) |
14f9c5c9 AS |
4687 | { |
4688 | int i; | |
4689 | ||
d2e4a39e | 4690 | if (lt == NULL) |
14f9c5c9 AS |
4691 | return; |
4692 | ||
4693 | fprintf (stderr, "\t"); | |
4694 | for (i = 0; i < lt->nitems; i += 1) | |
4695 | fprintf (stderr, "(%d->%p) ", lt->item[i].line, (void *) lt->item[i].pc); | |
4696 | fprintf (stderr, "\n"); | |
4697 | } | |
4698 | ||
4699 | static void | |
d2e4a39e | 4700 | debug_print_block (struct block *b) |
14f9c5c9 | 4701 | { |
de4f826b DC |
4702 | struct dict_iterator iter; |
4703 | struct symbol *sym; | |
261397f8 | 4704 | |
d2e4a39e AS |
4705 | fprintf (stderr, "Block: %p; [0x%lx, 0x%lx]", |
4706 | b, BLOCK_START (b), BLOCK_END (b)); | |
4707 | if (BLOCK_FUNCTION (b) != NULL) | |
22abf04a | 4708 | fprintf (stderr, " Function: %s", DEPRECATED_SYMBOL_NAME (BLOCK_FUNCTION (b))); |
14f9c5c9 | 4709 | fprintf (stderr, "\n"); |
d2e4a39e | 4710 | fprintf (stderr, "\t Superblock: %p\n", BLOCK_SUPERBLOCK (b)); |
14f9c5c9 | 4711 | fprintf (stderr, "\t Symbols:"); |
de4f826b | 4712 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
d2e4a39e | 4713 | { |
22abf04a | 4714 | fprintf (stderr, " %s", DEPRECATED_SYMBOL_NAME (sym)); |
d2e4a39e | 4715 | } |
14f9c5c9 AS |
4716 | fprintf (stderr, "\n"); |
4717 | } | |
4718 | ||
4719 | static void | |
d2e4a39e | 4720 | debug_print_blocks (struct blockvector *bv) |
14f9c5c9 AS |
4721 | { |
4722 | int i; | |
4723 | ||
4724 | if (bv == NULL) | |
4725 | return; | |
d2e4a39e AS |
4726 | for (i = 0; i < BLOCKVECTOR_NBLOCKS (bv); i += 1) |
4727 | { | |
4728 | fprintf (stderr, "%6d. ", i); | |
4729 | debug_print_block (BLOCKVECTOR_BLOCK (bv, i)); | |
4730 | } | |
14f9c5c9 AS |
4731 | } |
4732 | ||
4733 | static void | |
d2e4a39e | 4734 | debug_print_symtab (struct symtab *s) |
14f9c5c9 AS |
4735 | { |
4736 | fprintf (stderr, "Symtab %p\n File: %s; Dir: %s\n", s, | |
4737 | s->filename, s->dirname); | |
4738 | fprintf (stderr, " Blockvector: %p, Primary: %d\n", | |
d2e4a39e AS |
4739 | BLOCKVECTOR (s), s->primary); |
4740 | debug_print_blocks (BLOCKVECTOR (s)); | |
14f9c5c9 | 4741 | fprintf (stderr, " Line table: %p\n", LINETABLE (s)); |
d2e4a39e | 4742 | debug_print_lines (LINETABLE (s)); |
14f9c5c9 AS |
4743 | } |
4744 | ||
4745 | /* Read in all symbol tables corresponding to partial symbol tables | |
4746 | with file name FILENAME. */ | |
4747 | static void | |
d2e4a39e | 4748 | read_all_symtabs (const char *filename) |
14f9c5c9 | 4749 | { |
d2e4a39e AS |
4750 | struct partial_symtab *ps; |
4751 | struct objfile *objfile; | |
14f9c5c9 AS |
4752 | |
4753 | ALL_PSYMTABS (objfile, ps) | |
d2e4a39e AS |
4754 | { |
4755 | QUIT; | |
14f9c5c9 | 4756 | |
d2e4a39e AS |
4757 | if (STREQ (filename, ps->filename)) |
4758 | PSYMTAB_TO_SYMTAB (ps); | |
4759 | } | |
14f9c5c9 AS |
4760 | } |
4761 | ||
4762 | /* All sals corresponding to line LINE_NUM in a symbol table from file | |
4763 | FILENAME, as filtered by the user. If CANONICAL is not null, set | |
4764 | it to a corresponding array of canonical line specs. */ | |
4765 | static struct symtabs_and_lines | |
d2e4a39e | 4766 | all_sals_for_line (const char *filename, int line_num, char ***canonical) |
14f9c5c9 AS |
4767 | { |
4768 | struct symtabs_and_lines result; | |
d2e4a39e AS |
4769 | struct objfile *objfile; |
4770 | struct symtab *s; | |
4771 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); | |
14f9c5c9 AS |
4772 | size_t len; |
4773 | ||
4774 | read_all_symtabs (filename); | |
4775 | ||
d2e4a39e AS |
4776 | result.sals = |
4777 | (struct symtab_and_line *) xmalloc (4 * sizeof (result.sals[0])); | |
14f9c5c9 AS |
4778 | result.nelts = 0; |
4779 | len = 4; | |
4780 | make_cleanup (free_current_contents, &result.sals); | |
4781 | ||
d2e4a39e AS |
4782 | ALL_SYMTABS (objfile, s) |
4783 | { | |
4784 | int ind, target_line_num; | |
14f9c5c9 | 4785 | |
d2e4a39e | 4786 | QUIT; |
14f9c5c9 | 4787 | |
d2e4a39e AS |
4788 | if (!STREQ (s->filename, filename)) |
4789 | continue; | |
14f9c5c9 | 4790 | |
d2e4a39e AS |
4791 | target_line_num = |
4792 | nearest_line_number_in_linetable (LINETABLE (s), line_num); | |
4793 | if (target_line_num == -1) | |
4794 | continue; | |
14f9c5c9 | 4795 | |
d2e4a39e AS |
4796 | ind = -1; |
4797 | while (1) | |
4798 | { | |
4799 | ind = | |
4800 | find_next_line_in_linetable (LINETABLE (s), | |
4801 | target_line_num, line_num, ind); | |
14f9c5c9 | 4802 | |
d2e4a39e AS |
4803 | if (ind < 0) |
4804 | break; | |
4805 | ||
4806 | GROW_VECT (result.sals, len, result.nelts + 1); | |
fe39c653 | 4807 | init_sal (&result.sals[result.nelts]); |
d2e4a39e AS |
4808 | result.sals[result.nelts].line = LINETABLE (s)->item[ind].line; |
4809 | result.sals[result.nelts].pc = LINETABLE (s)->item[ind].pc; | |
4810 | result.sals[result.nelts].symtab = s; | |
4811 | result.nelts += 1; | |
4812 | } | |
4813 | } | |
14f9c5c9 AS |
4814 | |
4815 | if (canonical != NULL || result.nelts > 1) | |
4816 | { | |
4817 | int k; | |
d2e4a39e | 4818 | char **func_names = (char **) alloca (result.nelts * sizeof (char *)); |
14f9c5c9 AS |
4819 | int first_choice = (result.nelts > 1) ? 2 : 1; |
4820 | int n; | |
d2e4a39e AS |
4821 | int *choices = (int *) alloca (result.nelts * sizeof (int)); |
4822 | ||
4823 | for (k = 0; k < result.nelts; k += 1) | |
14f9c5c9 | 4824 | { |
d2e4a39e AS |
4825 | find_pc_partial_function (result.sals[k].pc, &func_names[k], |
4826 | (CORE_ADDR *) NULL, (CORE_ADDR *) NULL); | |
14f9c5c9 AS |
4827 | if (func_names[k] == NULL) |
4828 | error ("Could not find function for one or more breakpoints."); | |
4829 | } | |
d2e4a39e AS |
4830 | |
4831 | if (result.nelts > 1) | |
14f9c5c9 | 4832 | { |
d2e4a39e AS |
4833 | printf_unfiltered ("[0] cancel\n"); |
4834 | if (result.nelts > 1) | |
4835 | printf_unfiltered ("[1] all\n"); | |
14f9c5c9 | 4836 | for (k = 0; k < result.nelts; k += 1) |
d2e4a39e | 4837 | printf_unfiltered ("[%d] %s\n", k + first_choice, |
14f9c5c9 | 4838 | ada_demangle (func_names[k])); |
d2e4a39e | 4839 | |
14f9c5c9 AS |
4840 | n = get_selections (choices, result.nelts, result.nelts, |
4841 | result.nelts > 1, "instance-choice"); | |
d2e4a39e AS |
4842 | |
4843 | for (k = 0; k < n; k += 1) | |
14f9c5c9 AS |
4844 | { |
4845 | result.sals[k] = result.sals[choices[k]]; | |
4846 | func_names[k] = func_names[choices[k]]; | |
4847 | } | |
4848 | result.nelts = n; | |
4849 | } | |
4850 | ||
d2e4a39e | 4851 | if (canonical != NULL) |
14f9c5c9 | 4852 | { |
d2e4a39e | 4853 | *canonical = (char **) xmalloc (result.nelts * sizeof (char **)); |
aacb1f0a | 4854 | make_cleanup (xfree, *canonical); |
d2e4a39e | 4855 | for (k = 0; k < result.nelts; k += 1) |
14f9c5c9 | 4856 | { |
d2e4a39e | 4857 | (*canonical)[k] = |
14f9c5c9 AS |
4858 | extended_canonical_line_spec (result.sals[k], func_names[k]); |
4859 | if ((*canonical)[k] == NULL) | |
4860 | error ("Could not locate one or more breakpoints."); | |
aacb1f0a | 4861 | make_cleanup (xfree, (*canonical)[k]); |
14f9c5c9 AS |
4862 | } |
4863 | } | |
4864 | } | |
4865 | ||
4866 | discard_cleanups (old_chain); | |
4867 | return result; | |
4868 | } | |
4869 | ||
4870 | ||
4871 | /* A canonical line specification of the form FILE:NAME:LINENUM for | |
4872 | symbol table and line data SAL. NULL if insufficient | |
4873 | information. The caller is responsible for releasing any space | |
4874 | allocated. */ | |
4875 | ||
d2e4a39e AS |
4876 | static char * |
4877 | extended_canonical_line_spec (struct symtab_and_line sal, const char *name) | |
14f9c5c9 | 4878 | { |
d2e4a39e | 4879 | char *r; |
14f9c5c9 | 4880 | |
d2e4a39e | 4881 | if (sal.symtab == NULL || sal.symtab->filename == NULL || sal.line <= 0) |
14f9c5c9 AS |
4882 | return NULL; |
4883 | ||
d2e4a39e AS |
4884 | r = (char *) xmalloc (strlen (name) + strlen (sal.symtab->filename) |
4885 | + sizeof (sal.line) * 3 + 3); | |
14f9c5c9 AS |
4886 | sprintf (r, "%s:'%s':%d", sal.symtab->filename, name, sal.line); |
4887 | return r; | |
4888 | } | |
4889 | ||
4890 | #if 0 | |
4891 | int begin_bnum = -1; | |
4892 | #endif | |
4893 | int begin_annotate_level = 0; | |
4894 | ||
d2e4a39e AS |
4895 | static void |
4896 | begin_cleanup (void *dummy) | |
14f9c5c9 AS |
4897 | { |
4898 | begin_annotate_level = 0; | |
4899 | } | |
4900 | ||
4901 | static void | |
ebf56fd3 | 4902 | begin_command (char *args, int from_tty) |
14f9c5c9 AS |
4903 | { |
4904 | struct minimal_symbol *msym; | |
4905 | CORE_ADDR main_program_name_addr; | |
4906 | char main_program_name[1024]; | |
d2e4a39e | 4907 | struct cleanup *old_chain = make_cleanup (begin_cleanup, NULL); |
14f9c5c9 AS |
4908 | begin_annotate_level = 2; |
4909 | ||
4910 | /* Check that there is a program to debug */ | |
4911 | if (!have_full_symbols () && !have_partial_symbols ()) | |
4912 | error ("No symbol table is loaded. Use the \"file\" command."); | |
d2e4a39e | 4913 | |
14f9c5c9 AS |
4914 | /* Check that we are debugging an Ada program */ |
4915 | /* if (ada_update_initial_language (language_unknown, NULL) != language_ada) | |
d2e4a39e AS |
4916 | error ("Cannot find the Ada initialization procedure. Is this an Ada main program?"); |
4917 | */ | |
14f9c5c9 AS |
4918 | /* FIXME: language_ada should be defined in defs.h */ |
4919 | ||
4920 | /* Get the address of the name of the main procedure */ | |
4921 | msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL); | |
4922 | ||
4923 | if (msym != NULL) | |
d2e4a39e AS |
4924 | { |
4925 | main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym); | |
4926 | if (main_program_name_addr == 0) | |
4927 | error ("Invalid address for Ada main program name."); | |
14f9c5c9 | 4928 | |
d2e4a39e AS |
4929 | /* Read the name of the main procedure */ |
4930 | extract_string (main_program_name_addr, main_program_name); | |
14f9c5c9 | 4931 | |
d2e4a39e AS |
4932 | /* Put a temporary breakpoint in the Ada main program and run */ |
4933 | do_command ("tbreak ", main_program_name, 0); | |
4934 | do_command ("run ", args, 0); | |
4935 | } | |
14f9c5c9 | 4936 | else |
d2e4a39e AS |
4937 | { |
4938 | /* If we could not find the symbol containing the name of the | |
4939 | main program, that means that the compiler that was used to build | |
4940 | was not recent enough. In that case, we fallback to the previous | |
4941 | mechanism, which is a little bit less reliable, but has proved to work | |
4942 | in most cases. The only cases where it will fail is when the user | |
4943 | has set some breakpoints which will be hit before the end of the | |
4944 | begin command processing (eg in the initialization code). | |
4945 | ||
4946 | The begining of the main Ada subprogram is located by breaking | |
4947 | on the adainit procedure. Since we know that the binder generates | |
4948 | the call to this procedure exactly 2 calls before the call to the | |
4949 | Ada main subprogram, it is then easy to put a breakpoint on this | |
4950 | Ada main subprogram once we hit adainit. | |
4951 | */ | |
4952 | do_command ("tbreak adainit", 0); | |
4953 | do_command ("run ", args, 0); | |
4954 | do_command ("up", 0); | |
4955 | do_command ("tbreak +2", 0); | |
4956 | do_command ("continue", 0); | |
4957 | do_command ("step", 0); | |
4958 | } | |
14f9c5c9 AS |
4959 | |
4960 | do_cleanups (old_chain); | |
4961 | } | |
4962 | ||
4963 | int | |
ebf56fd3 | 4964 | is_ada_runtime_file (char *filename) |
14f9c5c9 AS |
4965 | { |
4966 | return (STREQN (filename, "s-", 2) || | |
4967 | STREQN (filename, "a-", 2) || | |
d2e4a39e | 4968 | STREQN (filename, "g-", 2) || STREQN (filename, "i-", 2)); |
14f9c5c9 AS |
4969 | } |
4970 | ||
4971 | /* find the first frame that contains debugging information and that is not | |
4972 | part of the Ada run-time, starting from fi and moving upward. */ | |
4973 | ||
4974 | int | |
ebf56fd3 | 4975 | find_printable_frame (struct frame_info *fi, int level) |
14f9c5c9 AS |
4976 | { |
4977 | struct symtab_and_line sal; | |
d2e4a39e | 4978 | |
14f9c5c9 AS |
4979 | for (; fi != NULL; level += 1, fi = get_prev_frame (fi)) |
4980 | { | |
1058bca7 | 4981 | find_frame_sal (fi, &sal); |
14f9c5c9 AS |
4982 | if (sal.symtab && !is_ada_runtime_file (sal.symtab->filename)) |
4983 | { | |
4984 | #if defined(__alpha__) && defined(__osf__) && !defined(VXWORKS_TARGET) | |
d2e4a39e AS |
4985 | /* libpthread.so contains some debugging information that prevents us |
4986 | from finding the right frame */ | |
14f9c5c9 AS |
4987 | |
4988 | if (sal.symtab->objfile && | |
4989 | STREQ (sal.symtab->objfile->name, "/usr/shlib/libpthread.so")) | |
d2e4a39e | 4990 | continue; |
14f9c5c9 | 4991 | #endif |
6e7f8b9c | 4992 | deprecated_selected_frame = fi; |
14f9c5c9 AS |
4993 | break; |
4994 | } | |
4995 | } | |
4996 | ||
4997 | return level; | |
4998 | } | |
4999 | ||
5000 | void | |
ebf56fd3 | 5001 | ada_report_exception_break (struct breakpoint *b) |
14f9c5c9 | 5002 | { |
14f9c5c9 AS |
5003 | /* FIXME: break_on_exception should be defined in breakpoint.h */ |
5004 | /* if (b->break_on_exception == 1) | |
d2e4a39e AS |
5005 | { |
5006 | /* Assume that cond has 16 elements, the 15th | |
5007 | being the exception *//* | |
5008 | if (b->cond && b->cond->nelts == 16) | |
5009 | { | |
5010 | ui_out_text (uiout, "on "); | |
5011 | ui_out_field_string (uiout, "exception", | |
5012 | SYMBOL_NAME (b->cond->elts[14].symbol)); | |
5013 | } | |
5014 | else | |
5015 | ui_out_text (uiout, "on all exceptions"); | |
5016 | } | |
5017 | else if (b->break_on_exception == 2) | |
5018 | ui_out_text (uiout, "on unhandled exception"); | |
5019 | else if (b->break_on_exception == 3) | |
5020 | ui_out_text (uiout, "on assert failure"); | |
5021 | #else | |
5022 | if (b->break_on_exception == 1) | |
5023 | { */ | |
5024 | /* Assume that cond has 16 elements, the 15th | |
5025 | being the exception *//* | |
5026 | if (b->cond && b->cond->nelts == 16) | |
5027 | { | |
5028 | fputs_filtered ("on ", gdb_stdout); | |
5029 | fputs_filtered (SYMBOL_NAME | |
5030 | (b->cond->elts[14].symbol), gdb_stdout); | |
5031 | } | |
5032 | else | |
5033 | fputs_filtered ("on all exceptions", gdb_stdout); | |
5034 | } | |
5035 | else if (b->break_on_exception == 2) | |
5036 | fputs_filtered ("on unhandled exception", gdb_stdout); | |
5037 | else if (b->break_on_exception == 3) | |
5038 | fputs_filtered ("on assert failure", gdb_stdout); | |
5039 | */ | |
14f9c5c9 AS |
5040 | } |
5041 | ||
5042 | int | |
d2e4a39e | 5043 | ada_is_exception_sym (struct symbol *sym) |
14f9c5c9 AS |
5044 | { |
5045 | char *type_name = type_name_no_tag (SYMBOL_TYPE (sym)); | |
d2e4a39e | 5046 | |
14f9c5c9 AS |
5047 | return (SYMBOL_CLASS (sym) != LOC_TYPEDEF |
5048 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
5049 | && SYMBOL_CLASS (sym) != LOC_CONST | |
d2e4a39e | 5050 | && type_name != NULL && STREQ (type_name, "exception")); |
14f9c5c9 AS |
5051 | } |
5052 | ||
5053 | int | |
d2e4a39e | 5054 | ada_maybe_exception_partial_symbol (struct partial_symbol *sym) |
14f9c5c9 AS |
5055 | { |
5056 | return (SYMBOL_CLASS (sym) != LOC_TYPEDEF | |
5057 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
5058 | && SYMBOL_CLASS (sym) != LOC_CONST); | |
5059 | } | |
5060 | ||
5061 | /* If ARG points to an Ada exception or assert breakpoint, rewrite | |
5062 | into equivalent form. Return resulting argument string. Set | |
5063 | *BREAK_ON_EXCEPTIONP to 1 for ordinary break on exception, 2 for | |
5064 | break on unhandled, 3 for assert, 0 otherwise. */ | |
d2e4a39e AS |
5065 | char * |
5066 | ada_breakpoint_rewrite (char *arg, int *break_on_exceptionp) | |
14f9c5c9 AS |
5067 | { |
5068 | if (arg == NULL) | |
5069 | return arg; | |
5070 | *break_on_exceptionp = 0; | |
d2e4a39e | 5071 | /* FIXME: language_ada should be defined in defs.h */ |
14f9c5c9 | 5072 | /* if (current_language->la_language == language_ada |
d2e4a39e AS |
5073 | && STREQN (arg, "exception", 9) && |
5074 | (arg[9] == ' ' || arg[9] == '\t' || arg[9] == '\0')) | |
5075 | { | |
5076 | char *tok, *end_tok; | |
5077 | int toklen; | |
5078 | ||
5079 | *break_on_exceptionp = 1; | |
5080 | ||
5081 | tok = arg+9; | |
5082 | while (*tok == ' ' || *tok == '\t') | |
5083 | tok += 1; | |
5084 | ||
5085 | end_tok = tok; | |
5086 | ||
5087 | while (*end_tok != ' ' && *end_tok != '\t' && *end_tok != '\000') | |
5088 | end_tok += 1; | |
5089 | ||
5090 | toklen = end_tok - tok; | |
5091 | ||
5092 | arg = (char*) xmalloc (sizeof ("__gnat_raise_nodefer_with_msg if " | |
5093 | "long_integer(e) = long_integer(&)") | |
5094 | + toklen + 1); | |
5095 | make_cleanup (xfree, arg); | |
5096 | if (toklen == 0) | |
5097 | strcpy (arg, "__gnat_raise_nodefer_with_msg"); | |
5098 | else if (STREQN (tok, "unhandled", toklen)) | |
5099 | { | |
5100 | *break_on_exceptionp = 2; | |
5101 | strcpy (arg, "__gnat_unhandled_exception"); | |
5102 | } | |
5103 | else | |
5104 | { | |
5105 | sprintf (arg, "__gnat_raise_nodefer_with_msg if " | |
5106 | "long_integer(e) = long_integer(&%.*s)", | |
5107 | toklen, tok); | |
5108 | } | |
5109 | } | |
5110 | else if (current_language->la_language == language_ada | |
5111 | && STREQN (arg, "assert", 6) && | |
5112 | (arg[6] == ' ' || arg[6] == '\t' || arg[6] == '\0')) | |
5113 | { | |
5114 | char *tok = arg + 6; | |
5115 | ||
5116 | *break_on_exceptionp = 3; | |
5117 | ||
5118 | arg = (char*) | |
5119 | xmalloc (sizeof ("system__assertions__raise_assert_failure") | |
5120 | + strlen (tok) + 1); | |
5121 | make_cleanup (xfree, arg); | |
5122 | sprintf (arg, "system__assertions__raise_assert_failure%s", tok); | |
5123 | } | |
5124 | */ | |
14f9c5c9 AS |
5125 | return arg; |
5126 | } | |
14f9c5c9 | 5127 | \f |
d2e4a39e | 5128 | |
14f9c5c9 AS |
5129 | /* Field Access */ |
5130 | ||
5131 | /* True if field number FIELD_NUM in struct or union type TYPE is supposed | |
5132 | to be invisible to users. */ | |
5133 | ||
5134 | int | |
ebf56fd3 | 5135 | ada_is_ignored_field (struct type *type, int field_num) |
14f9c5c9 AS |
5136 | { |
5137 | if (field_num < 0 || field_num > TYPE_NFIELDS (type)) | |
5138 | return 1; | |
d2e4a39e | 5139 | else |
14f9c5c9 | 5140 | { |
d2e4a39e | 5141 | const char *name = TYPE_FIELD_NAME (type, field_num); |
14f9c5c9 | 5142 | return (name == NULL |
d2e4a39e | 5143 | || (name[0] == '_' && !STREQN (name, "_parent", 7))); |
14f9c5c9 AS |
5144 | } |
5145 | } | |
5146 | ||
5147 | /* True iff structure type TYPE has a tag field. */ | |
5148 | ||
5149 | int | |
ebf56fd3 | 5150 | ada_is_tagged_type (struct type *type) |
14f9c5c9 AS |
5151 | { |
5152 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT) | |
5153 | return 0; | |
5154 | ||
5155 | return (ada_lookup_struct_elt_type (type, "_tag", 1, NULL) != NULL); | |
5156 | } | |
5157 | ||
5158 | /* The type of the tag on VAL. */ | |
5159 | ||
d2e4a39e AS |
5160 | struct type * |
5161 | ada_tag_type (struct value *val) | |
14f9c5c9 AS |
5162 | { |
5163 | return ada_lookup_struct_elt_type (VALUE_TYPE (val), "_tag", 0, NULL); | |
5164 | } | |
5165 | ||
5166 | /* The value of the tag on VAL. */ | |
5167 | ||
d2e4a39e AS |
5168 | struct value * |
5169 | ada_value_tag (struct value *val) | |
14f9c5c9 AS |
5170 | { |
5171 | return ada_value_struct_elt (val, "_tag", "record"); | |
5172 | } | |
5173 | ||
5174 | /* The parent type of TYPE, or NULL if none. */ | |
5175 | ||
d2e4a39e | 5176 | struct type * |
ebf56fd3 | 5177 | ada_parent_type (struct type *type) |
14f9c5c9 AS |
5178 | { |
5179 | int i; | |
5180 | ||
5181 | CHECK_TYPEDEF (type); | |
5182 | ||
5183 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT) | |
5184 | return NULL; | |
5185 | ||
5186 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
5187 | if (ada_is_parent_field (type, i)) | |
5188 | return check_typedef (TYPE_FIELD_TYPE (type, i)); | |
5189 | ||
5190 | return NULL; | |
5191 | } | |
5192 | ||
5193 | /* True iff field number FIELD_NUM of structure type TYPE contains the | |
5194 | parent-type (inherited) fields of a derived type. Assumes TYPE is | |
5195 | a structure type with at least FIELD_NUM+1 fields. */ | |
5196 | ||
5197 | int | |
ebf56fd3 | 5198 | ada_is_parent_field (struct type *type, int field_num) |
14f9c5c9 | 5199 | { |
d2e4a39e AS |
5200 | const char *name = TYPE_FIELD_NAME (check_typedef (type), field_num); |
5201 | return (name != NULL && | |
14f9c5c9 AS |
5202 | (STREQN (name, "PARENT", 6) || STREQN (name, "_parent", 7))); |
5203 | } | |
5204 | ||
5205 | /* True iff field number FIELD_NUM of structure type TYPE is a | |
5206 | transparent wrapper field (which should be silently traversed when doing | |
5207 | field selection and flattened when printing). Assumes TYPE is a | |
5208 | structure type with at least FIELD_NUM+1 fields. Such fields are always | |
5209 | structures. */ | |
5210 | ||
5211 | int | |
ebf56fd3 | 5212 | ada_is_wrapper_field (struct type *type, int field_num) |
14f9c5c9 | 5213 | { |
d2e4a39e AS |
5214 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5215 | return (name != NULL | |
5216 | && (STREQN (name, "PARENT", 6) || STREQ (name, "REP") | |
14f9c5c9 AS |
5217 | || STREQN (name, "_parent", 7) |
5218 | || name[0] == 'S' || name[0] == 'R' || name[0] == 'O')); | |
5219 | } | |
5220 | ||
5221 | /* True iff field number FIELD_NUM of structure or union type TYPE | |
5222 | is a variant wrapper. Assumes TYPE is a structure type with at least | |
d2e4a39e | 5223 | FIELD_NUM+1 fields. */ |
14f9c5c9 AS |
5224 | |
5225 | int | |
ebf56fd3 | 5226 | ada_is_variant_part (struct type *type, int field_num) |
14f9c5c9 | 5227 | { |
d2e4a39e | 5228 | struct type *field_type = TYPE_FIELD_TYPE (type, field_num); |
14f9c5c9 AS |
5229 | return (TYPE_CODE (field_type) == TYPE_CODE_UNION |
5230 | || (is_dynamic_field (type, field_num) | |
d2e4a39e AS |
5231 | && TYPE_CODE (TYPE_TARGET_TYPE (field_type)) == |
5232 | TYPE_CODE_UNION)); | |
14f9c5c9 AS |
5233 | } |
5234 | ||
5235 | /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part) | |
5236 | whose discriminants are contained in the record type OUTER_TYPE, | |
5237 | returns the type of the controlling discriminant for the variant. */ | |
5238 | ||
d2e4a39e | 5239 | struct type * |
ebf56fd3 | 5240 | ada_variant_discrim_type (struct type *var_type, struct type *outer_type) |
14f9c5c9 | 5241 | { |
d2e4a39e AS |
5242 | char *name = ada_variant_discrim_name (var_type); |
5243 | struct type *type = ada_lookup_struct_elt_type (outer_type, name, 1, NULL); | |
14f9c5c9 AS |
5244 | if (type == NULL) |
5245 | return builtin_type_int; | |
5246 | else | |
5247 | return type; | |
5248 | } | |
5249 | ||
5250 | /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a | |
5251 | valid field number within it, returns 1 iff field FIELD_NUM of TYPE | |
5252 | represents a 'when others' clause; otherwise 0. */ | |
5253 | ||
5254 | int | |
ebf56fd3 | 5255 | ada_is_others_clause (struct type *type, int field_num) |
14f9c5c9 | 5256 | { |
d2e4a39e | 5257 | const char *name = TYPE_FIELD_NAME (type, field_num); |
14f9c5c9 AS |
5258 | return (name != NULL && name[0] == 'O'); |
5259 | } | |
5260 | ||
5261 | /* Assuming that TYPE0 is the type of the variant part of a record, | |
5262 | returns the name of the discriminant controlling the variant. The | |
5263 | value is valid until the next call to ada_variant_discrim_name. */ | |
5264 | ||
d2e4a39e | 5265 | char * |
ebf56fd3 | 5266 | ada_variant_discrim_name (struct type *type0) |
14f9c5c9 | 5267 | { |
d2e4a39e | 5268 | static char *result = NULL; |
14f9c5c9 | 5269 | static size_t result_len = 0; |
d2e4a39e AS |
5270 | struct type *type; |
5271 | const char *name; | |
5272 | const char *discrim_end; | |
5273 | const char *discrim_start; | |
14f9c5c9 AS |
5274 | |
5275 | if (TYPE_CODE (type0) == TYPE_CODE_PTR) | |
5276 | type = TYPE_TARGET_TYPE (type0); | |
5277 | else | |
5278 | type = type0; | |
5279 | ||
5280 | name = ada_type_name (type); | |
5281 | ||
5282 | if (name == NULL || name[0] == '\000') | |
5283 | return ""; | |
5284 | ||
5285 | for (discrim_end = name + strlen (name) - 6; discrim_end != name; | |
5286 | discrim_end -= 1) | |
5287 | { | |
5288 | if (STREQN (discrim_end, "___XVN", 6)) | |
5289 | break; | |
5290 | } | |
5291 | if (discrim_end == name) | |
5292 | return ""; | |
5293 | ||
d2e4a39e | 5294 | for (discrim_start = discrim_end; discrim_start != name + 3; |
14f9c5c9 AS |
5295 | discrim_start -= 1) |
5296 | { | |
d2e4a39e | 5297 | if (discrim_start == name + 1) |
14f9c5c9 | 5298 | return ""; |
d2e4a39e | 5299 | if ((discrim_start > name + 3 && STREQN (discrim_start - 3, "___", 3)) |
14f9c5c9 AS |
5300 | || discrim_start[-1] == '.') |
5301 | break; | |
5302 | } | |
5303 | ||
5304 | GROW_VECT (result, result_len, discrim_end - discrim_start + 1); | |
5305 | strncpy (result, discrim_start, discrim_end - discrim_start); | |
d2e4a39e | 5306 | result[discrim_end - discrim_start] = '\0'; |
14f9c5c9 AS |
5307 | return result; |
5308 | } | |
5309 | ||
5310 | /* Scan STR for a subtype-encoded number, beginning at position K. Put the | |
5311 | position of the character just past the number scanned in *NEW_K, | |
5312 | if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL. Return 1 | |
5313 | if there was a valid number at the given position, and 0 otherwise. A | |
5314 | "subtype-encoded" number consists of the absolute value in decimal, | |
5315 | followed by the letter 'm' to indicate a negative number. Assumes 0m | |
5316 | does not occur. */ | |
5317 | ||
5318 | int | |
d2e4a39e | 5319 | ada_scan_number (const char str[], int k, LONGEST * R, int *new_k) |
14f9c5c9 AS |
5320 | { |
5321 | ULONGEST RU; | |
5322 | ||
d2e4a39e | 5323 | if (!isdigit (str[k])) |
14f9c5c9 AS |
5324 | return 0; |
5325 | ||
5326 | /* Do it the hard way so as not to make any assumption about | |
5327 | the relationship of unsigned long (%lu scan format code) and | |
5328 | LONGEST. */ | |
5329 | RU = 0; | |
5330 | while (isdigit (str[k])) | |
5331 | { | |
d2e4a39e | 5332 | RU = RU * 10 + (str[k] - '0'); |
14f9c5c9 AS |
5333 | k += 1; |
5334 | } | |
5335 | ||
d2e4a39e | 5336 | if (str[k] == 'm') |
14f9c5c9 AS |
5337 | { |
5338 | if (R != NULL) | |
d2e4a39e | 5339 | *R = (-(LONGEST) (RU - 1)) - 1; |
14f9c5c9 AS |
5340 | k += 1; |
5341 | } | |
5342 | else if (R != NULL) | |
5343 | *R = (LONGEST) RU; | |
5344 | ||
5345 | /* NOTE on the above: Technically, C does not say what the results of | |
5346 | - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive | |
5347 | number representable as a LONGEST (although either would probably work | |
5348 | in most implementations). When RU>0, the locution in the then branch | |
5349 | above is always equivalent to the negative of RU. */ | |
5350 | ||
5351 | if (new_k != NULL) | |
5352 | *new_k = k; | |
5353 | return 1; | |
5354 | } | |
5355 | ||
5356 | /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field), | |
5357 | and FIELD_NUM is a valid field number within it, returns 1 iff VAL is | |
5358 | in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */ | |
5359 | ||
d2e4a39e | 5360 | int |
ebf56fd3 | 5361 | ada_in_variant (LONGEST val, struct type *type, int field_num) |
14f9c5c9 | 5362 | { |
d2e4a39e | 5363 | const char *name = TYPE_FIELD_NAME (type, field_num); |
14f9c5c9 AS |
5364 | int p; |
5365 | ||
5366 | p = 0; | |
5367 | while (1) | |
5368 | { | |
d2e4a39e | 5369 | switch (name[p]) |
14f9c5c9 AS |
5370 | { |
5371 | case '\0': | |
5372 | return 0; | |
5373 | case 'S': | |
5374 | { | |
5375 | LONGEST W; | |
d2e4a39e | 5376 | if (!ada_scan_number (name, p + 1, &W, &p)) |
14f9c5c9 AS |
5377 | return 0; |
5378 | if (val == W) | |
5379 | return 1; | |
5380 | break; | |
5381 | } | |
5382 | case 'R': | |
5383 | { | |
5384 | LONGEST L, U; | |
d2e4a39e AS |
5385 | if (!ada_scan_number (name, p + 1, &L, &p) |
5386 | || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p)) | |
14f9c5c9 AS |
5387 | return 0; |
5388 | if (val >= L && val <= U) | |
5389 | return 1; | |
5390 | break; | |
5391 | } | |
5392 | case 'O': | |
5393 | return 1; | |
5394 | default: | |
5395 | return 0; | |
5396 | } | |
5397 | } | |
5398 | } | |
5399 | ||
5400 | /* Given a value ARG1 (offset by OFFSET bytes) | |
5401 | of a struct or union type ARG_TYPE, | |
5402 | extract and return the value of one of its (non-static) fields. | |
5403 | FIELDNO says which field. Differs from value_primitive_field only | |
5404 | in that it can handle packed values of arbitrary type. */ | |
5405 | ||
d2e4a39e AS |
5406 | struct value * |
5407 | ada_value_primitive_field (struct value *arg1, int offset, int fieldno, | |
ebf56fd3 | 5408 | struct type *arg_type) |
14f9c5c9 | 5409 | { |
d2e4a39e | 5410 | struct value *v; |
14f9c5c9 AS |
5411 | struct type *type; |
5412 | ||
5413 | CHECK_TYPEDEF (arg_type); | |
5414 | type = TYPE_FIELD_TYPE (arg_type, fieldno); | |
5415 | ||
5416 | /* Handle packed fields */ | |
5417 | ||
5418 | if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0) | |
5419 | { | |
5420 | int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno); | |
5421 | int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno); | |
d2e4a39e | 5422 | |
14f9c5c9 | 5423 | return ada_value_primitive_packed_val (arg1, VALUE_CONTENTS (arg1), |
d2e4a39e AS |
5424 | offset + bit_pos / 8, |
5425 | bit_pos % 8, bit_size, type); | |
14f9c5c9 AS |
5426 | } |
5427 | else | |
5428 | return value_primitive_field (arg1, offset, fieldno, arg_type); | |
5429 | } | |
5430 | ||
5431 | ||
5432 | /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes, | |
5433 | and search in it assuming it has (class) type TYPE. | |
5434 | If found, return value, else return NULL. | |
5435 | ||
5436 | Searches recursively through wrapper fields (e.g., '_parent'). */ | |
5437 | ||
d2e4a39e AS |
5438 | struct value * |
5439 | ada_search_struct_field (char *name, struct value *arg, int offset, | |
ebf56fd3 | 5440 | struct type *type) |
14f9c5c9 AS |
5441 | { |
5442 | int i; | |
5443 | CHECK_TYPEDEF (type); | |
5444 | ||
d2e4a39e | 5445 | for (i = TYPE_NFIELDS (type) - 1; i >= 0; i -= 1) |
14f9c5c9 AS |
5446 | { |
5447 | char *t_field_name = TYPE_FIELD_NAME (type, i); | |
5448 | ||
5449 | if (t_field_name == NULL) | |
5450 | continue; | |
5451 | ||
5452 | else if (field_name_match (t_field_name, name)) | |
d2e4a39e | 5453 | return ada_value_primitive_field (arg, offset, i, type); |
14f9c5c9 AS |
5454 | |
5455 | else if (ada_is_wrapper_field (type, i)) | |
5456 | { | |
d2e4a39e AS |
5457 | struct value *v = ada_search_struct_field (name, arg, |
5458 | offset + | |
5459 | TYPE_FIELD_BITPOS (type, | |
5460 | i) / | |
5461 | 8, | |
5462 | TYPE_FIELD_TYPE (type, | |
5463 | i)); | |
14f9c5c9 AS |
5464 | if (v != NULL) |
5465 | return v; | |
5466 | } | |
5467 | ||
5468 | else if (ada_is_variant_part (type, i)) | |
5469 | { | |
5470 | int j; | |
5471 | struct type *field_type = check_typedef (TYPE_FIELD_TYPE (type, i)); | |
5472 | int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8; | |
5473 | ||
5474 | for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1) | |
5475 | { | |
d2e4a39e AS |
5476 | struct value *v = ada_search_struct_field (name, arg, |
5477 | var_offset | |
5478 | + | |
5479 | TYPE_FIELD_BITPOS | |
5480 | (field_type, j) / 8, | |
5481 | TYPE_FIELD_TYPE | |
5482 | (field_type, j)); | |
14f9c5c9 AS |
5483 | if (v != NULL) |
5484 | return v; | |
5485 | } | |
5486 | } | |
5487 | } | |
5488 | return NULL; | |
5489 | } | |
d2e4a39e | 5490 | |
14f9c5c9 AS |
5491 | /* Given ARG, a value of type (pointer to a)* structure/union, |
5492 | extract the component named NAME from the ultimate target structure/union | |
5493 | and return it as a value with its appropriate type. | |
5494 | ||
5495 | The routine searches for NAME among all members of the structure itself | |
5496 | and (recursively) among all members of any wrapper members | |
5497 | (e.g., '_parent'). | |
5498 | ||
5499 | ERR is a name (for use in error messages) that identifies the class | |
5500 | of entity that ARG is supposed to be. */ | |
5501 | ||
d2e4a39e | 5502 | struct value * |
ebf56fd3 | 5503 | ada_value_struct_elt (struct value *arg, char *name, char *err) |
14f9c5c9 AS |
5504 | { |
5505 | struct type *t; | |
d2e4a39e | 5506 | struct value *v; |
14f9c5c9 AS |
5507 | |
5508 | arg = ada_coerce_ref (arg); | |
5509 | t = check_typedef (VALUE_TYPE (arg)); | |
5510 | ||
5511 | /* Follow pointers until we get to a non-pointer. */ | |
5512 | ||
5513 | while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF) | |
5514 | { | |
5515 | arg = ada_value_ind (arg); | |
5516 | t = check_typedef (VALUE_TYPE (arg)); | |
5517 | } | |
5518 | ||
d2e4a39e AS |
5519 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT && TYPE_CODE (t) != TYPE_CODE_UNION) |
5520 | error ("Attempt to extract a component of a value that is not a %s.", | |
5521 | err); | |
14f9c5c9 AS |
5522 | |
5523 | v = ada_search_struct_field (name, arg, 0, t); | |
5524 | if (v == NULL) | |
5525 | error ("There is no member named %s.", name); | |
5526 | ||
5527 | return v; | |
5528 | } | |
5529 | ||
5530 | /* Given a type TYPE, look up the type of the component of type named NAME. | |
5531 | If DISPP is non-null, add its byte displacement from the beginning of a | |
5532 | structure (pointed to by a value) of type TYPE to *DISPP (does not | |
5533 | work for packed fields). | |
5534 | ||
5535 | Matches any field whose name has NAME as a prefix, possibly | |
5536 | followed by "___". | |
5537 | ||
5538 | TYPE can be either a struct or union, or a pointer or reference to | |
5539 | a struct or union. If it is a pointer or reference, its target | |
5540 | type is automatically used. | |
5541 | ||
5542 | Looks recursively into variant clauses and parent types. | |
5543 | ||
5544 | If NOERR is nonzero, return NULL if NAME is not suitably defined. */ | |
5545 | ||
5546 | struct type * | |
d2e4a39e AS |
5547 | ada_lookup_struct_elt_type (struct type *type, char *name, int noerr, |
5548 | int *dispp) | |
14f9c5c9 AS |
5549 | { |
5550 | int i; | |
5551 | ||
5552 | if (name == NULL) | |
5553 | goto BadName; | |
5554 | ||
5555 | while (1) | |
5556 | { | |
5557 | CHECK_TYPEDEF (type); | |
5558 | if (TYPE_CODE (type) != TYPE_CODE_PTR | |
5559 | && TYPE_CODE (type) != TYPE_CODE_REF) | |
5560 | break; | |
5561 | type = TYPE_TARGET_TYPE (type); | |
5562 | } | |
5563 | ||
5564 | if (TYPE_CODE (type) != TYPE_CODE_STRUCT && | |
5565 | TYPE_CODE (type) != TYPE_CODE_UNION) | |
5566 | { | |
5567 | target_terminal_ours (); | |
5568 | gdb_flush (gdb_stdout); | |
5569 | fprintf_unfiltered (gdb_stderr, "Type "); | |
5570 | type_print (type, "", gdb_stderr, -1); | |
5571 | error (" is not a structure or union type"); | |
5572 | } | |
5573 | ||
5574 | type = to_static_fixed_type (type); | |
5575 | ||
5576 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
5577 | { | |
5578 | char *t_field_name = TYPE_FIELD_NAME (type, i); | |
5579 | struct type *t; | |
5580 | int disp; | |
d2e4a39e | 5581 | |
14f9c5c9 AS |
5582 | if (t_field_name == NULL) |
5583 | continue; | |
5584 | ||
5585 | else if (field_name_match (t_field_name, name)) | |
5586 | { | |
d2e4a39e | 5587 | if (dispp != NULL) |
14f9c5c9 AS |
5588 | *dispp += TYPE_FIELD_BITPOS (type, i) / 8; |
5589 | return check_typedef (TYPE_FIELD_TYPE (type, i)); | |
5590 | } | |
5591 | ||
5592 | else if (ada_is_wrapper_field (type, i)) | |
5593 | { | |
5594 | disp = 0; | |
d2e4a39e | 5595 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name, |
14f9c5c9 AS |
5596 | 1, &disp); |
5597 | if (t != NULL) | |
5598 | { | |
5599 | if (dispp != NULL) | |
5600 | *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8; | |
5601 | return t; | |
5602 | } | |
5603 | } | |
5604 | ||
5605 | else if (ada_is_variant_part (type, i)) | |
5606 | { | |
5607 | int j; | |
5608 | struct type *field_type = check_typedef (TYPE_FIELD_TYPE (type, i)); | |
5609 | ||
5610 | for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1) | |
5611 | { | |
5612 | disp = 0; | |
5613 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, j), | |
5614 | name, 1, &disp); | |
5615 | if (t != NULL) | |
5616 | { | |
d2e4a39e | 5617 | if (dispp != NULL) |
14f9c5c9 AS |
5618 | *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8; |
5619 | return t; | |
5620 | } | |
5621 | } | |
5622 | } | |
5623 | ||
5624 | } | |
5625 | ||
5626 | BadName: | |
d2e4a39e | 5627 | if (!noerr) |
14f9c5c9 AS |
5628 | { |
5629 | target_terminal_ours (); | |
5630 | gdb_flush (gdb_stdout); | |
5631 | fprintf_unfiltered (gdb_stderr, "Type "); | |
5632 | type_print (type, "", gdb_stderr, -1); | |
5633 | fprintf_unfiltered (gdb_stderr, " has no component named "); | |
5634 | error ("%s", name == NULL ? "<null>" : name); | |
5635 | } | |
5636 | ||
5637 | return NULL; | |
5638 | } | |
5639 | ||
5640 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), | |
5641 | within a value of type OUTER_TYPE that is stored in GDB at | |
5642 | OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE, | |
5643 | numbering from 0) is applicable. Returns -1 if none are. */ | |
5644 | ||
d2e4a39e | 5645 | int |
ebf56fd3 | 5646 | ada_which_variant_applies (struct type *var_type, struct type *outer_type, |
d2e4a39e | 5647 | char *outer_valaddr) |
14f9c5c9 AS |
5648 | { |
5649 | int others_clause; | |
5650 | int i; | |
5651 | int disp; | |
d2e4a39e AS |
5652 | struct type *discrim_type; |
5653 | char *discrim_name = ada_variant_discrim_name (var_type); | |
14f9c5c9 AS |
5654 | LONGEST discrim_val; |
5655 | ||
5656 | disp = 0; | |
d2e4a39e | 5657 | discrim_type = |
14f9c5c9 AS |
5658 | ada_lookup_struct_elt_type (outer_type, discrim_name, 1, &disp); |
5659 | if (discrim_type == NULL) | |
5660 | return -1; | |
5661 | discrim_val = unpack_long (discrim_type, outer_valaddr + disp); | |
5662 | ||
5663 | others_clause = -1; | |
5664 | for (i = 0; i < TYPE_NFIELDS (var_type); i += 1) | |
5665 | { | |
5666 | if (ada_is_others_clause (var_type, i)) | |
5667 | others_clause = i; | |
5668 | else if (ada_in_variant (discrim_val, var_type, i)) | |
5669 | return i; | |
5670 | } | |
5671 | ||
5672 | return others_clause; | |
5673 | } | |
d2e4a39e | 5674 | \f |
14f9c5c9 AS |
5675 | |
5676 | ||
14f9c5c9 AS |
5677 | /* Dynamic-Sized Records */ |
5678 | ||
5679 | /* Strategy: The type ostensibly attached to a value with dynamic size | |
5680 | (i.e., a size that is not statically recorded in the debugging | |
5681 | data) does not accurately reflect the size or layout of the value. | |
5682 | Our strategy is to convert these values to values with accurate, | |
5683 | conventional types that are constructed on the fly. */ | |
5684 | ||
5685 | /* There is a subtle and tricky problem here. In general, we cannot | |
5686 | determine the size of dynamic records without its data. However, | |
5687 | the 'struct value' data structure, which GDB uses to represent | |
5688 | quantities in the inferior process (the target), requires the size | |
5689 | of the type at the time of its allocation in order to reserve space | |
5690 | for GDB's internal copy of the data. That's why the | |
5691 | 'to_fixed_xxx_type' routines take (target) addresses as parameters, | |
5692 | rather than struct value*s. | |
5693 | ||
5694 | However, GDB's internal history variables ($1, $2, etc.) are | |
5695 | struct value*s containing internal copies of the data that are not, in | |
5696 | general, the same as the data at their corresponding addresses in | |
5697 | the target. Fortunately, the types we give to these values are all | |
5698 | conventional, fixed-size types (as per the strategy described | |
5699 | above), so that we don't usually have to perform the | |
5700 | 'to_fixed_xxx_type' conversions to look at their values. | |
5701 | Unfortunately, there is one exception: if one of the internal | |
5702 | history variables is an array whose elements are unconstrained | |
5703 | records, then we will need to create distinct fixed types for each | |
5704 | element selected. */ | |
5705 | ||
5706 | /* The upshot of all of this is that many routines take a (type, host | |
5707 | address, target address) triple as arguments to represent a value. | |
5708 | The host address, if non-null, is supposed to contain an internal | |
5709 | copy of the relevant data; otherwise, the program is to consult the | |
5710 | target at the target address. */ | |
5711 | ||
5712 | /* Assuming that VAL0 represents a pointer value, the result of | |
5713 | dereferencing it. Differs from value_ind in its treatment of | |
5714 | dynamic-sized types. */ | |
5715 | ||
d2e4a39e AS |
5716 | struct value * |
5717 | ada_value_ind (struct value *val0) | |
14f9c5c9 | 5718 | { |
d2e4a39e | 5719 | struct value *val = unwrap_value (value_ind (val0)); |
14f9c5c9 | 5720 | return ada_to_fixed_value (VALUE_TYPE (val), 0, |
d2e4a39e | 5721 | VALUE_ADDRESS (val) + VALUE_OFFSET (val), val); |
14f9c5c9 AS |
5722 | } |
5723 | ||
5724 | /* The value resulting from dereferencing any "reference to" | |
5725 | * qualifiers on VAL0. */ | |
d2e4a39e AS |
5726 | static struct value * |
5727 | ada_coerce_ref (struct value *val0) | |
5728 | { | |
5729 | if (TYPE_CODE (VALUE_TYPE (val0)) == TYPE_CODE_REF) | |
5730 | { | |
5731 | struct value *val = val0; | |
5732 | COERCE_REF (val); | |
5733 | val = unwrap_value (val); | |
5734 | return ada_to_fixed_value (VALUE_TYPE (val), 0, | |
5735 | VALUE_ADDRESS (val) + VALUE_OFFSET (val), | |
5736 | val); | |
5737 | } | |
5738 | else | |
14f9c5c9 AS |
5739 | return val0; |
5740 | } | |
5741 | ||
5742 | /* Return OFF rounded upward if necessary to a multiple of | |
5743 | ALIGNMENT (a power of 2). */ | |
5744 | ||
5745 | static unsigned int | |
ebf56fd3 | 5746 | align_value (unsigned int off, unsigned int alignment) |
14f9c5c9 AS |
5747 | { |
5748 | return (off + alignment - 1) & ~(alignment - 1); | |
5749 | } | |
5750 | ||
5751 | /* Return the additional bit offset required by field F of template | |
5752 | type TYPE. */ | |
5753 | ||
5754 | static unsigned int | |
ebf56fd3 | 5755 | field_offset (struct type *type, int f) |
14f9c5c9 AS |
5756 | { |
5757 | int n = TYPE_FIELD_BITPOS (type, f); | |
5758 | /* Kludge (temporary?) to fix problem with dwarf output. */ | |
5759 | if (n < 0) | |
5760 | return (unsigned int) n & 0xffff; | |
5761 | else | |
5762 | return n; | |
5763 | } | |
5764 | ||
5765 | ||
5766 | /* Return the bit alignment required for field #F of template type TYPE. */ | |
5767 | ||
5768 | static unsigned int | |
ebf56fd3 | 5769 | field_alignment (struct type *type, int f) |
14f9c5c9 | 5770 | { |
d2e4a39e | 5771 | const char *name = TYPE_FIELD_NAME (type, f); |
14f9c5c9 AS |
5772 | int len = (name == NULL) ? 0 : strlen (name); |
5773 | int align_offset; | |
5774 | ||
d2e4a39e | 5775 | if (len < 8 || !isdigit (name[len - 1])) |
14f9c5c9 AS |
5776 | return TARGET_CHAR_BIT; |
5777 | ||
d2e4a39e | 5778 | if (isdigit (name[len - 2])) |
14f9c5c9 AS |
5779 | align_offset = len - 2; |
5780 | else | |
5781 | align_offset = len - 1; | |
5782 | ||
d2e4a39e | 5783 | if (align_offset < 7 || !STREQN ("___XV", name + align_offset - 6, 5)) |
14f9c5c9 AS |
5784 | return TARGET_CHAR_BIT; |
5785 | ||
d2e4a39e | 5786 | return atoi (name + align_offset) * TARGET_CHAR_BIT; |
14f9c5c9 AS |
5787 | } |
5788 | ||
5789 | /* Find a type named NAME. Ignores ambiguity. */ | |
d2e4a39e | 5790 | struct type * |
ebf56fd3 | 5791 | ada_find_any_type (const char *name) |
14f9c5c9 | 5792 | { |
d2e4a39e | 5793 | struct symbol *sym; |
14f9c5c9 | 5794 | |
176620f1 | 5795 | sym = standard_lookup (name, VAR_DOMAIN); |
14f9c5c9 AS |
5796 | if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF) |
5797 | return SYMBOL_TYPE (sym); | |
5798 | ||
176620f1 | 5799 | sym = standard_lookup (name, STRUCT_DOMAIN); |
14f9c5c9 AS |
5800 | if (sym != NULL) |
5801 | return SYMBOL_TYPE (sym); | |
5802 | ||
5803 | return NULL; | |
5804 | } | |
5805 | ||
5806 | /* Because of GNAT encoding conventions, several GDB symbols may match a | |
5807 | given type name. If the type denoted by TYPE0 is to be preferred to | |
5808 | that of TYPE1 for purposes of type printing, return non-zero; | |
5809 | otherwise return 0. */ | |
5810 | int | |
d2e4a39e | 5811 | ada_prefer_type (struct type *type0, struct type *type1) |
14f9c5c9 AS |
5812 | { |
5813 | if (type1 == NULL) | |
5814 | return 1; | |
5815 | else if (type0 == NULL) | |
5816 | return 0; | |
5817 | else if (TYPE_CODE (type1) == TYPE_CODE_VOID) | |
5818 | return 1; | |
5819 | else if (TYPE_CODE (type0) == TYPE_CODE_VOID) | |
5820 | return 0; | |
5821 | else if (ada_is_packed_array_type (type0)) | |
5822 | return 1; | |
d2e4a39e AS |
5823 | else if (ada_is_array_descriptor (type0) |
5824 | && !ada_is_array_descriptor (type1)) | |
14f9c5c9 | 5825 | return 1; |
d2e4a39e | 5826 | else if (ada_renaming_type (type0) != NULL |
14f9c5c9 AS |
5827 | && ada_renaming_type (type1) == NULL) |
5828 | return 1; | |
5829 | return 0; | |
5830 | } | |
5831 | ||
5832 | /* The name of TYPE, which is either its TYPE_NAME, or, if that is | |
5833 | null, its TYPE_TAG_NAME. Null if TYPE is null. */ | |
d2e4a39e AS |
5834 | char * |
5835 | ada_type_name (struct type *type) | |
14f9c5c9 | 5836 | { |
d2e4a39e | 5837 | if (type == NULL) |
14f9c5c9 AS |
5838 | return NULL; |
5839 | else if (TYPE_NAME (type) != NULL) | |
5840 | return TYPE_NAME (type); | |
5841 | else | |
5842 | return TYPE_TAG_NAME (type); | |
5843 | } | |
5844 | ||
5845 | /* Find a parallel type to TYPE whose name is formed by appending | |
5846 | SUFFIX to the name of TYPE. */ | |
5847 | ||
d2e4a39e | 5848 | struct type * |
ebf56fd3 | 5849 | ada_find_parallel_type (struct type *type, const char *suffix) |
14f9c5c9 | 5850 | { |
d2e4a39e | 5851 | static char *name; |
14f9c5c9 | 5852 | static size_t name_len = 0; |
d2e4a39e AS |
5853 | struct symbol **syms; |
5854 | struct block **blocks; | |
14f9c5c9 AS |
5855 | int nsyms; |
5856 | int len; | |
d2e4a39e AS |
5857 | char *typename = ada_type_name (type); |
5858 | ||
14f9c5c9 AS |
5859 | if (typename == NULL) |
5860 | return NULL; | |
5861 | ||
5862 | len = strlen (typename); | |
5863 | ||
d2e4a39e | 5864 | GROW_VECT (name, name_len, len + strlen (suffix) + 1); |
14f9c5c9 AS |
5865 | |
5866 | strcpy (name, typename); | |
5867 | strcpy (name + len, suffix); | |
5868 | ||
5869 | return ada_find_any_type (name); | |
5870 | } | |
5871 | ||
5872 | ||
5873 | /* If TYPE is a variable-size record type, return the corresponding template | |
5874 | type describing its fields. Otherwise, return NULL. */ | |
5875 | ||
d2e4a39e AS |
5876 | static struct type * |
5877 | dynamic_template_type (struct type *type) | |
14f9c5c9 AS |
5878 | { |
5879 | CHECK_TYPEDEF (type); | |
5880 | ||
5881 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT | |
d2e4a39e | 5882 | || ada_type_name (type) == NULL) |
14f9c5c9 | 5883 | return NULL; |
d2e4a39e | 5884 | else |
14f9c5c9 AS |
5885 | { |
5886 | int len = strlen (ada_type_name (type)); | |
5887 | if (len > 6 && STREQ (ada_type_name (type) + len - 6, "___XVE")) | |
5888 | return type; | |
5889 | else | |
5890 | return ada_find_parallel_type (type, "___XVE"); | |
5891 | } | |
5892 | } | |
5893 | ||
5894 | /* Assuming that TEMPL_TYPE is a union or struct type, returns | |
5895 | non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */ | |
5896 | ||
d2e4a39e AS |
5897 | static int |
5898 | is_dynamic_field (struct type *templ_type, int field_num) | |
14f9c5c9 AS |
5899 | { |
5900 | const char *name = TYPE_FIELD_NAME (templ_type, field_num); | |
d2e4a39e | 5901 | return name != NULL |
14f9c5c9 AS |
5902 | && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR |
5903 | && strstr (name, "___XVL") != NULL; | |
5904 | } | |
5905 | ||
5906 | /* Assuming that TYPE is a struct type, returns non-zero iff TYPE | |
5907 | contains a variant part. */ | |
5908 | ||
d2e4a39e AS |
5909 | static int |
5910 | contains_variant_part (struct type *type) | |
14f9c5c9 AS |
5911 | { |
5912 | int f; | |
5913 | ||
5914 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT | |
5915 | || TYPE_NFIELDS (type) <= 0) | |
5916 | return 0; | |
5917 | return ada_is_variant_part (type, TYPE_NFIELDS (type) - 1); | |
5918 | } | |
5919 | ||
5920 | /* A record type with no fields, . */ | |
d2e4a39e AS |
5921 | static struct type * |
5922 | empty_record (struct objfile *objfile) | |
14f9c5c9 | 5923 | { |
d2e4a39e | 5924 | struct type *type = alloc_type (objfile); |
14f9c5c9 AS |
5925 | TYPE_CODE (type) = TYPE_CODE_STRUCT; |
5926 | TYPE_NFIELDS (type) = 0; | |
5927 | TYPE_FIELDS (type) = NULL; | |
5928 | TYPE_NAME (type) = "<empty>"; | |
5929 | TYPE_TAG_NAME (type) = NULL; | |
5930 | TYPE_FLAGS (type) = 0; | |
5931 | TYPE_LENGTH (type) = 0; | |
5932 | return type; | |
5933 | } | |
5934 | ||
5935 | /* An ordinary record type (with fixed-length fields) that describes | |
5936 | the value of type TYPE at VALADDR or ADDRESS (see comments at | |
5937 | the beginning of this section) VAL according to GNAT conventions. | |
5938 | DVAL0 should describe the (portion of a) record that contains any | |
5939 | necessary discriminants. It should be NULL if VALUE_TYPE (VAL) is | |
5940 | an outer-level type (i.e., as opposed to a branch of a variant.) A | |
5941 | variant field (unless unchecked) is replaced by a particular branch | |
5942 | of the variant. */ | |
5943 | /* NOTE: Limitations: For now, we assume that dynamic fields and | |
5944 | * variants occupy whole numbers of bytes. However, they need not be | |
5945 | * byte-aligned. */ | |
5946 | ||
d2e4a39e AS |
5947 | static struct type * |
5948 | template_to_fixed_record_type (struct type *type, char *valaddr, | |
5949 | CORE_ADDR address, struct value *dval0) | |
14f9c5c9 | 5950 | { |
d2e4a39e AS |
5951 | struct value *mark = value_mark (); |
5952 | struct value *dval; | |
5953 | struct type *rtype; | |
14f9c5c9 AS |
5954 | int nfields, bit_len; |
5955 | long off; | |
5956 | int f; | |
5957 | ||
5958 | nfields = TYPE_NFIELDS (type); | |
5959 | rtype = alloc_type (TYPE_OBJFILE (type)); | |
5960 | TYPE_CODE (rtype) = TYPE_CODE_STRUCT; | |
5961 | INIT_CPLUS_SPECIFIC (rtype); | |
5962 | TYPE_NFIELDS (rtype) = nfields; | |
d2e4a39e | 5963 | TYPE_FIELDS (rtype) = (struct field *) |
14f9c5c9 AS |
5964 | TYPE_ALLOC (rtype, nfields * sizeof (struct field)); |
5965 | memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields); | |
5966 | TYPE_NAME (rtype) = ada_type_name (type); | |
5967 | TYPE_TAG_NAME (rtype) = NULL; | |
5968 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in | |
d2e4a39e AS |
5969 | gdbtypes.h */ |
5970 | /* TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE; */ | |
14f9c5c9 | 5971 | |
d2e4a39e AS |
5972 | off = 0; |
5973 | bit_len = 0; | |
14f9c5c9 AS |
5974 | for (f = 0; f < nfields; f += 1) |
5975 | { | |
5976 | int fld_bit_len, bit_incr; | |
d2e4a39e AS |
5977 | off = |
5978 | align_value (off, | |
5979 | field_alignment (type, f)) + TYPE_FIELD_BITPOS (type, f); | |
14f9c5c9 AS |
5980 | /* NOTE: used to use field_offset above, but that causes |
5981 | * problems with really negative bit positions. So, let's | |
5982 | * rediscover why we needed field_offset and fix it properly. */ | |
5983 | TYPE_FIELD_BITPOS (rtype, f) = off; | |
d2e4a39e | 5984 | TYPE_FIELD_BITSIZE (rtype, f) = 0; |
01ad7f36 | 5985 | TYPE_FIELD_STATIC_KIND (rtype, f) = 0; |
14f9c5c9 | 5986 | |
d2e4a39e | 5987 | if (ada_is_variant_part (type, f)) |
14f9c5c9 AS |
5988 | { |
5989 | struct type *branch_type; | |
5990 | ||
5991 | if (dval0 == NULL) | |
d2e4a39e | 5992 | dval = value_from_contents_and_address (rtype, valaddr, address); |
14f9c5c9 AS |
5993 | else |
5994 | dval = dval0; | |
5995 | ||
d2e4a39e AS |
5996 | branch_type = |
5997 | to_fixed_variant_branch_type | |
5998 | (TYPE_FIELD_TYPE (type, f), | |
5999 | cond_offset_host (valaddr, off / TARGET_CHAR_BIT), | |
6000 | cond_offset_target (address, off / TARGET_CHAR_BIT), dval); | |
6001 | if (branch_type == NULL) | |
14f9c5c9 AS |
6002 | TYPE_NFIELDS (rtype) -= 1; |
6003 | else | |
6004 | { | |
6005 | TYPE_FIELD_TYPE (rtype, f) = branch_type; | |
6006 | TYPE_FIELD_NAME (rtype, f) = "S"; | |
6007 | } | |
6008 | bit_incr = 0; | |
6009 | fld_bit_len = | |
6010 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT; | |
6011 | } | |
6012 | else if (is_dynamic_field (type, f)) | |
6013 | { | |
6014 | if (dval0 == NULL) | |
d2e4a39e | 6015 | dval = value_from_contents_and_address (rtype, valaddr, address); |
14f9c5c9 AS |
6016 | else |
6017 | dval = dval0; | |
6018 | ||
d2e4a39e AS |
6019 | TYPE_FIELD_TYPE (rtype, f) = |
6020 | ada_to_fixed_type | |
6021 | (ada_get_base_type | |
6022 | (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f))), | |
6023 | cond_offset_host (valaddr, off / TARGET_CHAR_BIT), | |
6024 | cond_offset_target (address, off / TARGET_CHAR_BIT), dval); | |
14f9c5c9 AS |
6025 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
6026 | bit_incr = fld_bit_len = | |
6027 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT; | |
6028 | } | |
6029 | else | |
6030 | { | |
6031 | TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f); | |
6032 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); | |
6033 | if (TYPE_FIELD_BITSIZE (type, f) > 0) | |
d2e4a39e | 6034 | bit_incr = fld_bit_len = |
14f9c5c9 AS |
6035 | TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f); |
6036 | else | |
6037 | bit_incr = fld_bit_len = | |
6038 | TYPE_LENGTH (TYPE_FIELD_TYPE (type, f)) * TARGET_CHAR_BIT; | |
6039 | } | |
6040 | if (off + fld_bit_len > bit_len) | |
6041 | bit_len = off + fld_bit_len; | |
6042 | off += bit_incr; | |
6043 | TYPE_LENGTH (rtype) = bit_len / TARGET_CHAR_BIT; | |
6044 | } | |
6045 | TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype), TYPE_LENGTH (type)); | |
6046 | ||
6047 | value_free_to_mark (mark); | |
d2e4a39e | 6048 | if (TYPE_LENGTH (rtype) > varsize_limit) |
14f9c5c9 AS |
6049 | error ("record type with dynamic size is larger than varsize-limit"); |
6050 | return rtype; | |
6051 | } | |
6052 | ||
6053 | /* As for template_to_fixed_record_type, but uses no run-time values. | |
6054 | As a result, this type can only be approximate, but that's OK, | |
6055 | since it is used only for type determinations. Works on both | |
6056 | structs and unions. | |
6057 | Representation note: to save space, we memoize the result of this | |
6058 | function in the TYPE_TARGET_TYPE of the template type. */ | |
6059 | ||
d2e4a39e AS |
6060 | static struct type * |
6061 | template_to_static_fixed_type (struct type *templ_type) | |
14f9c5c9 AS |
6062 | { |
6063 | struct type *type; | |
6064 | int nfields; | |
6065 | int f; | |
6066 | ||
6067 | if (TYPE_TARGET_TYPE (templ_type) != NULL) | |
6068 | return TYPE_TARGET_TYPE (templ_type); | |
6069 | ||
6070 | nfields = TYPE_NFIELDS (templ_type); | |
d2e4a39e AS |
6071 | TYPE_TARGET_TYPE (templ_type) = type = |
6072 | alloc_type (TYPE_OBJFILE (templ_type)); | |
14f9c5c9 AS |
6073 | TYPE_CODE (type) = TYPE_CODE (templ_type); |
6074 | INIT_CPLUS_SPECIFIC (type); | |
6075 | TYPE_NFIELDS (type) = nfields; | |
d2e4a39e | 6076 | TYPE_FIELDS (type) = (struct field *) |
14f9c5c9 AS |
6077 | TYPE_ALLOC (type, nfields * sizeof (struct field)); |
6078 | memset (TYPE_FIELDS (type), 0, sizeof (struct field) * nfields); | |
6079 | TYPE_NAME (type) = ada_type_name (templ_type); | |
6080 | TYPE_TAG_NAME (type) = NULL; | |
d2e4a39e | 6081 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in gdbtypes.h */ |
14f9c5c9 AS |
6082 | /* TYPE_FLAGS (type) |= TYPE_FLAG_FIXED_INSTANCE; */ |
6083 | TYPE_LENGTH (type) = 0; | |
6084 | ||
6085 | for (f = 0; f < nfields; f += 1) | |
6086 | { | |
6087 | TYPE_FIELD_BITPOS (type, f) = 0; | |
d2e4a39e | 6088 | TYPE_FIELD_BITSIZE (type, f) = 0; |
01ad7f36 | 6089 | TYPE_FIELD_STATIC_KIND (type, f) = 0; |
14f9c5c9 AS |
6090 | |
6091 | if (is_dynamic_field (templ_type, f)) | |
6092 | { | |
d2e4a39e AS |
6093 | TYPE_FIELD_TYPE (type, f) = |
6094 | to_static_fixed_type (TYPE_TARGET_TYPE | |
14f9c5c9 AS |
6095 | (TYPE_FIELD_TYPE (templ_type, f))); |
6096 | TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (templ_type, f); | |
6097 | } | |
6098 | else | |
6099 | { | |
d2e4a39e | 6100 | TYPE_FIELD_TYPE (type, f) = |
14f9c5c9 AS |
6101 | check_typedef (TYPE_FIELD_TYPE (templ_type, f)); |
6102 | TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (templ_type, f); | |
6103 | } | |
6104 | } | |
6105 | ||
6106 | return type; | |
6107 | } | |
6108 | ||
6109 | /* A revision of TYPE0 -- a non-dynamic-sized record with a variant | |
6110 | part -- in which the variant part is replaced with the appropriate | |
6111 | branch. */ | |
d2e4a39e AS |
6112 | static struct type * |
6113 | to_record_with_fixed_variant_part (struct type *type, char *valaddr, | |
6114 | CORE_ADDR address, struct value *dval) | |
14f9c5c9 | 6115 | { |
d2e4a39e AS |
6116 | struct value *mark = value_mark (); |
6117 | struct type *rtype; | |
14f9c5c9 AS |
6118 | struct type *branch_type; |
6119 | int nfields = TYPE_NFIELDS (type); | |
6120 | ||
6121 | if (dval == NULL) | |
6122 | return type; | |
6123 | ||
6124 | rtype = alloc_type (TYPE_OBJFILE (type)); | |
6125 | TYPE_CODE (rtype) = TYPE_CODE_STRUCT; | |
6126 | INIT_CPLUS_SPECIFIC (type); | |
6127 | TYPE_NFIELDS (rtype) = TYPE_NFIELDS (type); | |
d2e4a39e AS |
6128 | TYPE_FIELDS (rtype) = |
6129 | (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field)); | |
6130 | memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type), | |
14f9c5c9 AS |
6131 | sizeof (struct field) * nfields); |
6132 | TYPE_NAME (rtype) = ada_type_name (type); | |
6133 | TYPE_TAG_NAME (rtype) = NULL; | |
d2e4a39e | 6134 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in gdbtypes.h */ |
14f9c5c9 AS |
6135 | /* TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE; */ |
6136 | TYPE_LENGTH (rtype) = TYPE_LENGTH (type); | |
6137 | ||
d2e4a39e AS |
6138 | branch_type = |
6139 | to_fixed_variant_branch_type | |
6140 | (TYPE_FIELD_TYPE (type, nfields - 1), | |
6141 | cond_offset_host (valaddr, | |
6142 | TYPE_FIELD_BITPOS (type, | |
6143 | nfields - 1) / TARGET_CHAR_BIT), | |
6144 | cond_offset_target (address, | |
6145 | TYPE_FIELD_BITPOS (type, | |
6146 | nfields - 1) / TARGET_CHAR_BIT), | |
6147 | dval); | |
6148 | if (branch_type == NULL) | |
14f9c5c9 AS |
6149 | { |
6150 | TYPE_NFIELDS (rtype) -= 1; | |
d2e4a39e AS |
6151 | TYPE_LENGTH (rtype) -= |
6152 | TYPE_LENGTH (TYPE_FIELD_TYPE (type, nfields - 1)); | |
14f9c5c9 AS |
6153 | } |
6154 | else | |
6155 | { | |
d2e4a39e AS |
6156 | TYPE_FIELD_TYPE (rtype, nfields - 1) = branch_type; |
6157 | TYPE_FIELD_NAME (rtype, nfields - 1) = "S"; | |
6158 | TYPE_FIELD_BITSIZE (rtype, nfields - 1) = 0; | |
01ad7f36 | 6159 | TYPE_FIELD_STATIC_KIND (rtype, nfields - 1) = 0; |
14f9c5c9 | 6160 | TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type); |
d2e4a39e | 6161 | -TYPE_LENGTH (TYPE_FIELD_TYPE (type, nfields - 1)); |
14f9c5c9 | 6162 | } |
d2e4a39e | 6163 | |
14f9c5c9 AS |
6164 | return rtype; |
6165 | } | |
6166 | ||
6167 | /* An ordinary record type (with fixed-length fields) that describes | |
6168 | the value at (TYPE0, VALADDR, ADDRESS) [see explanation at | |
6169 | beginning of this section]. Any necessary discriminants' values | |
6170 | should be in DVAL, a record value; it should be NULL if the object | |
6171 | at ADDR itself contains any necessary discriminant values. A | |
6172 | variant field (unless unchecked) is replaced by a particular branch | |
d2e4a39e | 6173 | of the variant. */ |
14f9c5c9 | 6174 | |
d2e4a39e AS |
6175 | static struct type * |
6176 | to_fixed_record_type (struct type *type0, char *valaddr, CORE_ADDR address, | |
6177 | struct value *dval) | |
14f9c5c9 | 6178 | { |
d2e4a39e | 6179 | struct type *templ_type; |
14f9c5c9 AS |
6180 | |
6181 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in gdbtypes.h */ | |
6182 | /* if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE) | |
d2e4a39e AS |
6183 | return type0; |
6184 | */ | |
6185 | templ_type = dynamic_template_type (type0); | |
14f9c5c9 AS |
6186 | |
6187 | if (templ_type != NULL) | |
6188 | return template_to_fixed_record_type (templ_type, valaddr, address, dval); | |
6189 | else if (contains_variant_part (type0)) | |
6190 | return to_record_with_fixed_variant_part (type0, valaddr, address, dval); | |
6191 | else | |
6192 | { | |
d2e4a39e | 6193 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in gdbtypes.h */ |
14f9c5c9 AS |
6194 | /* TYPE_FLAGS (type0) |= TYPE_FLAG_FIXED_INSTANCE; */ |
6195 | return type0; | |
6196 | } | |
6197 | ||
6198 | } | |
6199 | ||
6200 | /* An ordinary record type (with fixed-length fields) that describes | |
6201 | the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a | |
6202 | union type. Any necessary discriminants' values should be in DVAL, | |
6203 | a record value. That is, this routine selects the appropriate | |
6204 | branch of the union at ADDR according to the discriminant value | |
6205 | indicated in the union's type name. */ | |
6206 | ||
d2e4a39e AS |
6207 | static struct type * |
6208 | to_fixed_variant_branch_type (struct type *var_type0, char *valaddr, | |
6209 | CORE_ADDR address, struct value *dval) | |
14f9c5c9 AS |
6210 | { |
6211 | int which; | |
d2e4a39e AS |
6212 | struct type *templ_type; |
6213 | struct type *var_type; | |
14f9c5c9 AS |
6214 | |
6215 | if (TYPE_CODE (var_type0) == TYPE_CODE_PTR) | |
6216 | var_type = TYPE_TARGET_TYPE (var_type0); | |
d2e4a39e | 6217 | else |
14f9c5c9 AS |
6218 | var_type = var_type0; |
6219 | ||
6220 | templ_type = ada_find_parallel_type (var_type, "___XVU"); | |
6221 | ||
6222 | if (templ_type != NULL) | |
6223 | var_type = templ_type; | |
6224 | ||
d2e4a39e AS |
6225 | which = |
6226 | ada_which_variant_applies (var_type, | |
14f9c5c9 AS |
6227 | VALUE_TYPE (dval), VALUE_CONTENTS (dval)); |
6228 | ||
6229 | if (which < 0) | |
6230 | return empty_record (TYPE_OBJFILE (var_type)); | |
6231 | else if (is_dynamic_field (var_type, which)) | |
d2e4a39e AS |
6232 | return |
6233 | to_fixed_record_type | |
6234 | (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)), | |
6235 | valaddr, address, dval); | |
14f9c5c9 | 6236 | else if (contains_variant_part (TYPE_FIELD_TYPE (var_type, which))) |
d2e4a39e AS |
6237 | return |
6238 | to_fixed_record_type | |
6239 | (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval); | |
14f9c5c9 AS |
6240 | else |
6241 | return TYPE_FIELD_TYPE (var_type, which); | |
6242 | } | |
6243 | ||
6244 | /* Assuming that TYPE0 is an array type describing the type of a value | |
6245 | at ADDR, and that DVAL describes a record containing any | |
6246 | discriminants used in TYPE0, returns a type for the value that | |
6247 | contains no dynamic components (that is, no components whose sizes | |
6248 | are determined by run-time quantities). Unless IGNORE_TOO_BIG is | |
6249 | true, gives an error message if the resulting type's size is over | |
6250 | varsize_limit. | |
6251 | */ | |
6252 | ||
d2e4a39e AS |
6253 | static struct type * |
6254 | to_fixed_array_type (struct type *type0, struct value *dval, | |
ebf56fd3 | 6255 | int ignore_too_big) |
14f9c5c9 | 6256 | { |
d2e4a39e AS |
6257 | struct type *index_type_desc; |
6258 | struct type *result; | |
14f9c5c9 AS |
6259 | |
6260 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in gdbtypes.h */ | |
d2e4a39e AS |
6261 | /* if (ada_is_packed_array_type (type0) /* revisit? *//* |
6262 | || (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)) | |
6263 | return type0; */ | |
14f9c5c9 AS |
6264 | |
6265 | index_type_desc = ada_find_parallel_type (type0, "___XA"); | |
6266 | if (index_type_desc == NULL) | |
6267 | { | |
6268 | struct type *elt_type0 = check_typedef (TYPE_TARGET_TYPE (type0)); | |
6269 | /* NOTE: elt_type---the fixed version of elt_type0---should never | |
6270 | * depend on the contents of the array in properly constructed | |
d2e4a39e AS |
6271 | * debugging data. */ |
6272 | struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval); | |
14f9c5c9 AS |
6273 | |
6274 | if (elt_type0 == elt_type) | |
6275 | result = type0; | |
6276 | else | |
d2e4a39e | 6277 | result = create_array_type (alloc_type (TYPE_OBJFILE (type0)), |
14f9c5c9 AS |
6278 | elt_type, TYPE_INDEX_TYPE (type0)); |
6279 | } | |
6280 | else | |
6281 | { | |
6282 | int i; | |
6283 | struct type *elt_type0; | |
6284 | ||
6285 | elt_type0 = type0; | |
6286 | for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1) | |
6287 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); | |
6288 | ||
6289 | /* NOTE: result---the fixed version of elt_type0---should never | |
6290 | * depend on the contents of the array in properly constructed | |
d2e4a39e AS |
6291 | * debugging data. */ |
6292 | result = ada_to_fixed_type (check_typedef (elt_type0), 0, 0, dval); | |
14f9c5c9 AS |
6293 | for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1) |
6294 | { | |
d2e4a39e | 6295 | struct type *range_type = |
14f9c5c9 AS |
6296 | to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, i), |
6297 | dval, TYPE_OBJFILE (type0)); | |
6298 | result = create_array_type (alloc_type (TYPE_OBJFILE (type0)), | |
6299 | result, range_type); | |
6300 | } | |
d2e4a39e | 6301 | if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit) |
14f9c5c9 AS |
6302 | error ("array type with dynamic size is larger than varsize-limit"); |
6303 | } | |
6304 | ||
6305 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in gdbtypes.h */ | |
6306 | /* TYPE_FLAGS (result) |= TYPE_FLAG_FIXED_INSTANCE; */ | |
6307 | return result; | |
d2e4a39e | 6308 | } |
14f9c5c9 AS |
6309 | |
6310 | ||
6311 | /* A standard type (containing no dynamically sized components) | |
6312 | corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS) | |
6313 | DVAL describes a record containing any discriminants used in TYPE0, | |
6314 | and may be NULL if there are none. */ | |
6315 | ||
d2e4a39e AS |
6316 | struct type * |
6317 | ada_to_fixed_type (struct type *type, char *valaddr, CORE_ADDR address, | |
6318 | struct value *dval) | |
14f9c5c9 AS |
6319 | { |
6320 | CHECK_TYPEDEF (type); | |
d2e4a39e AS |
6321 | switch (TYPE_CODE (type)) |
6322 | { | |
6323 | default: | |
14f9c5c9 | 6324 | return type; |
d2e4a39e AS |
6325 | case TYPE_CODE_STRUCT: |
6326 | return to_fixed_record_type (type, valaddr, address, NULL); | |
6327 | case TYPE_CODE_ARRAY: | |
6328 | return to_fixed_array_type (type, dval, 0); | |
6329 | case TYPE_CODE_UNION: | |
6330 | if (dval == NULL) | |
6331 | return type; | |
6332 | else | |
6333 | return to_fixed_variant_branch_type (type, valaddr, address, dval); | |
6334 | } | |
14f9c5c9 AS |
6335 | } |
6336 | ||
6337 | /* A standard (static-sized) type corresponding as well as possible to | |
6338 | TYPE0, but based on no runtime data. */ | |
6339 | ||
d2e4a39e AS |
6340 | static struct type * |
6341 | to_static_fixed_type (struct type *type0) | |
14f9c5c9 | 6342 | { |
d2e4a39e | 6343 | struct type *type; |
14f9c5c9 AS |
6344 | |
6345 | if (type0 == NULL) | |
6346 | return NULL; | |
6347 | ||
6348 | /* FIXME: TYPE_FLAG_FIXED_INSTANCE should be defined in gdbtypes.h */ | |
6349 | /* if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE) | |
d2e4a39e AS |
6350 | return type0; |
6351 | */ | |
14f9c5c9 | 6352 | CHECK_TYPEDEF (type0); |
d2e4a39e | 6353 | |
14f9c5c9 AS |
6354 | switch (TYPE_CODE (type0)) |
6355 | { | |
6356 | default: | |
6357 | return type0; | |
6358 | case TYPE_CODE_STRUCT: | |
6359 | type = dynamic_template_type (type0); | |
d2e4a39e | 6360 | if (type != NULL) |
14f9c5c9 AS |
6361 | return template_to_static_fixed_type (type); |
6362 | return type0; | |
6363 | case TYPE_CODE_UNION: | |
6364 | type = ada_find_parallel_type (type0, "___XVU"); | |
6365 | if (type != NULL) | |
6366 | return template_to_static_fixed_type (type); | |
6367 | return type0; | |
6368 | } | |
6369 | } | |
6370 | ||
6371 | /* A static approximation of TYPE with all type wrappers removed. */ | |
d2e4a39e AS |
6372 | static struct type * |
6373 | static_unwrap_type (struct type *type) | |
14f9c5c9 AS |
6374 | { |
6375 | if (ada_is_aligner_type (type)) | |
6376 | { | |
d2e4a39e | 6377 | struct type *type1 = TYPE_FIELD_TYPE (check_typedef (type), 0); |
14f9c5c9 AS |
6378 | if (ada_type_name (type1) == NULL) |
6379 | TYPE_NAME (type1) = ada_type_name (type); | |
6380 | ||
6381 | return static_unwrap_type (type1); | |
6382 | } | |
d2e4a39e | 6383 | else |
14f9c5c9 | 6384 | { |
d2e4a39e AS |
6385 | struct type *raw_real_type = ada_get_base_type (type); |
6386 | if (raw_real_type == type) | |
14f9c5c9 AS |
6387 | return type; |
6388 | else | |
6389 | return to_static_fixed_type (raw_real_type); | |
6390 | } | |
6391 | } | |
6392 | ||
6393 | /* In some cases, incomplete and private types require | |
6394 | cross-references that are not resolved as records (for example, | |
6395 | type Foo; | |
6396 | type FooP is access Foo; | |
6397 | V: FooP; | |
6398 | type Foo is array ...; | |
6399 | ). In these cases, since there is no mechanism for producing | |
6400 | cross-references to such types, we instead substitute for FooP a | |
6401 | stub enumeration type that is nowhere resolved, and whose tag is | |
6402 | the name of the actual type. Call these types "non-record stubs". */ | |
6403 | ||
6404 | /* A type equivalent to TYPE that is not a non-record stub, if one | |
6405 | exists, otherwise TYPE. */ | |
d2e4a39e AS |
6406 | struct type * |
6407 | ada_completed_type (struct type *type) | |
14f9c5c9 AS |
6408 | { |
6409 | CHECK_TYPEDEF (type); | |
6410 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM | |
6411 | || (TYPE_FLAGS (type) & TYPE_FLAG_STUB) == 0 | |
6412 | || TYPE_TAG_NAME (type) == NULL) | |
6413 | return type; | |
d2e4a39e | 6414 | else |
14f9c5c9 | 6415 | { |
d2e4a39e AS |
6416 | char *name = TYPE_TAG_NAME (type); |
6417 | struct type *type1 = ada_find_any_type (name); | |
14f9c5c9 AS |
6418 | return (type1 == NULL) ? type : type1; |
6419 | } | |
6420 | } | |
6421 | ||
6422 | /* A value representing the data at VALADDR/ADDRESS as described by | |
6423 | type TYPE0, but with a standard (static-sized) type that correctly | |
6424 | describes it. If VAL0 is not NULL and TYPE0 already is a standard | |
6425 | type, then return VAL0 [this feature is simply to avoid redundant | |
d2e4a39e | 6426 | creation of struct values]. */ |
14f9c5c9 | 6427 | |
d2e4a39e AS |
6428 | struct value * |
6429 | ada_to_fixed_value (struct type *type0, char *valaddr, CORE_ADDR address, | |
6430 | struct value *val0) | |
14f9c5c9 | 6431 | { |
d2e4a39e | 6432 | struct type *type = ada_to_fixed_type (type0, valaddr, address, NULL); |
14f9c5c9 AS |
6433 | if (type == type0 && val0 != NULL) |
6434 | return val0; | |
d2e4a39e AS |
6435 | else |
6436 | return value_from_contents_and_address (type, valaddr, address); | |
14f9c5c9 AS |
6437 | } |
6438 | ||
6439 | /* A value representing VAL, but with a standard (static-sized) type | |
6440 | chosen to approximate the real type of VAL as well as possible, but | |
6441 | without consulting any runtime values. For Ada dynamic-sized | |
6442 | types, therefore, the type of the result is likely to be inaccurate. */ | |
6443 | ||
d2e4a39e AS |
6444 | struct value * |
6445 | ada_to_static_fixed_value (struct value *val) | |
14f9c5c9 | 6446 | { |
d2e4a39e | 6447 | struct type *type = |
14f9c5c9 AS |
6448 | to_static_fixed_type (static_unwrap_type (VALUE_TYPE (val))); |
6449 | if (type == VALUE_TYPE (val)) | |
6450 | return val; | |
6451 | else | |
6452 | return coerce_unspec_val_to_type (val, 0, type); | |
6453 | } | |
d2e4a39e | 6454 | \f |
14f9c5c9 AS |
6455 | |
6456 | ||
14f9c5c9 AS |
6457 | |
6458 | ||
6459 | /* Attributes */ | |
6460 | ||
6461 | /* Table mapping attribute numbers to names */ | |
6462 | /* NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h */ | |
6463 | ||
d2e4a39e | 6464 | static const char *attribute_names[] = { |
14f9c5c9 AS |
6465 | "<?>", |
6466 | ||
d2e4a39e | 6467 | "first", |
14f9c5c9 AS |
6468 | "last", |
6469 | "length", | |
6470 | "image", | |
6471 | "img", | |
6472 | "max", | |
6473 | "min", | |
d2e4a39e | 6474 | "pos" "tag", |
14f9c5c9 AS |
6475 | "val", |
6476 | ||
6477 | 0 | |
6478 | }; | |
6479 | ||
d2e4a39e | 6480 | const char * |
ebf56fd3 | 6481 | ada_attribute_name (int n) |
14f9c5c9 AS |
6482 | { |
6483 | if (n > 0 && n < (int) ATR_END) | |
6484 | return attribute_names[n]; | |
6485 | else | |
6486 | return attribute_names[0]; | |
6487 | } | |
6488 | ||
6489 | /* Evaluate the 'POS attribute applied to ARG. */ | |
6490 | ||
d2e4a39e AS |
6491 | static struct value * |
6492 | value_pos_atr (struct value *arg) | |
14f9c5c9 AS |
6493 | { |
6494 | struct type *type = VALUE_TYPE (arg); | |
6495 | ||
d2e4a39e | 6496 | if (!discrete_type_p (type)) |
14f9c5c9 AS |
6497 | error ("'POS only defined on discrete types"); |
6498 | ||
6499 | if (TYPE_CODE (type) == TYPE_CODE_ENUM) | |
6500 | { | |
6501 | int i; | |
6502 | LONGEST v = value_as_long (arg); | |
6503 | ||
d2e4a39e | 6504 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) |
14f9c5c9 AS |
6505 | { |
6506 | if (v == TYPE_FIELD_BITPOS (type, i)) | |
6507 | return value_from_longest (builtin_type_ada_int, i); | |
6508 | } | |
6509 | error ("enumeration value is invalid: can't find 'POS"); | |
6510 | } | |
6511 | else | |
6512 | return value_from_longest (builtin_type_ada_int, value_as_long (arg)); | |
6513 | } | |
6514 | ||
6515 | /* Evaluate the TYPE'VAL attribute applied to ARG. */ | |
6516 | ||
d2e4a39e AS |
6517 | static struct value * |
6518 | value_val_atr (struct type *type, struct value *arg) | |
14f9c5c9 | 6519 | { |
d2e4a39e | 6520 | if (!discrete_type_p (type)) |
14f9c5c9 | 6521 | error ("'VAL only defined on discrete types"); |
d2e4a39e | 6522 | if (!integer_type_p (VALUE_TYPE (arg))) |
14f9c5c9 AS |
6523 | error ("'VAL requires integral argument"); |
6524 | ||
6525 | if (TYPE_CODE (type) == TYPE_CODE_ENUM) | |
6526 | { | |
6527 | long pos = value_as_long (arg); | |
6528 | if (pos < 0 || pos >= TYPE_NFIELDS (type)) | |
6529 | error ("argument to 'VAL out of range"); | |
d2e4a39e | 6530 | return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos)); |
14f9c5c9 AS |
6531 | } |
6532 | else | |
6533 | return value_from_longest (type, value_as_long (arg)); | |
6534 | } | |
14f9c5c9 | 6535 | \f |
d2e4a39e | 6536 | |
14f9c5c9 AS |
6537 | /* Evaluation */ |
6538 | ||
6539 | /* True if TYPE appears to be an Ada character type. | |
6540 | * [At the moment, this is true only for Character and Wide_Character; | |
6541 | * It is a heuristic test that could stand improvement]. */ | |
6542 | ||
d2e4a39e AS |
6543 | int |
6544 | ada_is_character_type (struct type *type) | |
14f9c5c9 | 6545 | { |
d2e4a39e AS |
6546 | const char *name = ada_type_name (type); |
6547 | return | |
14f9c5c9 | 6548 | name != NULL |
d2e4a39e | 6549 | && (TYPE_CODE (type) == TYPE_CODE_CHAR |
14f9c5c9 AS |
6550 | || TYPE_CODE (type) == TYPE_CODE_INT |
6551 | || TYPE_CODE (type) == TYPE_CODE_RANGE) | |
6552 | && (STREQ (name, "character") || STREQ (name, "wide_character") | |
6553 | || STREQ (name, "unsigned char")); | |
6554 | } | |
6555 | ||
6556 | /* True if TYPE appears to be an Ada string type. */ | |
6557 | ||
6558 | int | |
ebf56fd3 | 6559 | ada_is_string_type (struct type *type) |
14f9c5c9 AS |
6560 | { |
6561 | CHECK_TYPEDEF (type); | |
d2e4a39e | 6562 | if (type != NULL |
14f9c5c9 AS |
6563 | && TYPE_CODE (type) != TYPE_CODE_PTR |
6564 | && (ada_is_simple_array (type) || ada_is_array_descriptor (type)) | |
6565 | && ada_array_arity (type) == 1) | |
6566 | { | |
6567 | struct type *elttype = ada_array_element_type (type, 1); | |
6568 | ||
6569 | return ada_is_character_type (elttype); | |
6570 | } | |
d2e4a39e | 6571 | else |
14f9c5c9 AS |
6572 | return 0; |
6573 | } | |
6574 | ||
6575 | ||
6576 | /* True if TYPE is a struct type introduced by the compiler to force the | |
6577 | alignment of a value. Such types have a single field with a | |
6578 | distinctive name. */ | |
6579 | ||
6580 | int | |
ebf56fd3 | 6581 | ada_is_aligner_type (struct type *type) |
14f9c5c9 AS |
6582 | { |
6583 | CHECK_TYPEDEF (type); | |
6584 | return (TYPE_CODE (type) == TYPE_CODE_STRUCT | |
6585 | && TYPE_NFIELDS (type) == 1 | |
6586 | && STREQ (TYPE_FIELD_NAME (type, 0), "F")); | |
6587 | } | |
6588 | ||
6589 | /* If there is an ___XVS-convention type parallel to SUBTYPE, return | |
6590 | the parallel type. */ | |
6591 | ||
d2e4a39e AS |
6592 | struct type * |
6593 | ada_get_base_type (struct type *raw_type) | |
14f9c5c9 | 6594 | { |
d2e4a39e AS |
6595 | struct type *real_type_namer; |
6596 | struct type *raw_real_type; | |
6597 | struct type *real_type; | |
14f9c5c9 AS |
6598 | |
6599 | if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT) | |
6600 | return raw_type; | |
6601 | ||
6602 | real_type_namer = ada_find_parallel_type (raw_type, "___XVS"); | |
d2e4a39e | 6603 | if (real_type_namer == NULL |
14f9c5c9 AS |
6604 | || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT |
6605 | || TYPE_NFIELDS (real_type_namer) != 1) | |
6606 | return raw_type; | |
6607 | ||
6608 | raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0)); | |
d2e4a39e | 6609 | if (raw_real_type == NULL) |
14f9c5c9 AS |
6610 | return raw_type; |
6611 | else | |
6612 | return raw_real_type; | |
d2e4a39e | 6613 | } |
14f9c5c9 AS |
6614 | |
6615 | /* The type of value designated by TYPE, with all aligners removed. */ | |
6616 | ||
d2e4a39e AS |
6617 | struct type * |
6618 | ada_aligned_type (struct type *type) | |
14f9c5c9 AS |
6619 | { |
6620 | if (ada_is_aligner_type (type)) | |
6621 | return ada_aligned_type (TYPE_FIELD_TYPE (type, 0)); | |
6622 | else | |
6623 | return ada_get_base_type (type); | |
6624 | } | |
6625 | ||
6626 | ||
6627 | /* The address of the aligned value in an object at address VALADDR | |
6628 | having type TYPE. Assumes ada_is_aligner_type (TYPE). */ | |
6629 | ||
d2e4a39e | 6630 | char * |
ebf56fd3 | 6631 | ada_aligned_value_addr (struct type *type, char *valaddr) |
14f9c5c9 | 6632 | { |
d2e4a39e | 6633 | if (ada_is_aligner_type (type)) |
14f9c5c9 | 6634 | return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0), |
d2e4a39e AS |
6635 | valaddr + |
6636 | TYPE_FIELD_BITPOS (type, | |
6637 | 0) / TARGET_CHAR_BIT); | |
14f9c5c9 AS |
6638 | else |
6639 | return valaddr; | |
6640 | } | |
6641 | ||
6642 | /* The printed representation of an enumeration literal with encoded | |
6643 | name NAME. The value is good to the next call of ada_enum_name. */ | |
d2e4a39e AS |
6644 | const char * |
6645 | ada_enum_name (const char *name) | |
14f9c5c9 | 6646 | { |
d2e4a39e | 6647 | char *tmp; |
14f9c5c9 | 6648 | |
d2e4a39e | 6649 | while (1) |
14f9c5c9 AS |
6650 | { |
6651 | if ((tmp = strstr (name, "__")) != NULL) | |
d2e4a39e | 6652 | name = tmp + 2; |
14f9c5c9 | 6653 | else if ((tmp = strchr (name, '.')) != NULL) |
d2e4a39e | 6654 | name = tmp + 1; |
14f9c5c9 AS |
6655 | else |
6656 | break; | |
6657 | } | |
6658 | ||
6659 | if (name[0] == 'Q') | |
6660 | { | |
6661 | static char result[16]; | |
6662 | int v; | |
6663 | if (name[1] == 'U' || name[1] == 'W') | |
6664 | { | |
d2e4a39e | 6665 | if (sscanf (name + 2, "%x", &v) != 1) |
14f9c5c9 AS |
6666 | return name; |
6667 | } | |
6668 | else | |
6669 | return name; | |
6670 | ||
6671 | if (isascii (v) && isprint (v)) | |
6672 | sprintf (result, "'%c'", v); | |
6673 | else if (name[1] == 'U') | |
6674 | sprintf (result, "[\"%02x\"]", v); | |
6675 | else | |
6676 | sprintf (result, "[\"%04x\"]", v); | |
6677 | ||
6678 | return result; | |
6679 | } | |
d2e4a39e | 6680 | else |
14f9c5c9 AS |
6681 | return name; |
6682 | } | |
6683 | ||
d2e4a39e | 6684 | static struct value * |
ebf56fd3 AS |
6685 | evaluate_subexp (struct type *expect_type, struct expression *exp, int *pos, |
6686 | enum noside noside) | |
14f9c5c9 AS |
6687 | { |
6688 | return (*exp->language_defn->evaluate_exp) (expect_type, exp, pos, noside); | |
6689 | } | |
6690 | ||
6691 | /* Evaluate the subexpression of EXP starting at *POS as for | |
6692 | evaluate_type, updating *POS to point just past the evaluated | |
6693 | expression. */ | |
6694 | ||
d2e4a39e AS |
6695 | static struct value * |
6696 | evaluate_subexp_type (struct expression *exp, int *pos) | |
14f9c5c9 | 6697 | { |
d2e4a39e | 6698 | return (*exp->language_defn->evaluate_exp) |
14f9c5c9 AS |
6699 | (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); |
6700 | } | |
6701 | ||
6702 | /* If VAL is wrapped in an aligner or subtype wrapper, return the | |
d2e4a39e | 6703 | value it wraps. */ |
14f9c5c9 | 6704 | |
d2e4a39e AS |
6705 | static struct value * |
6706 | unwrap_value (struct value *val) | |
14f9c5c9 | 6707 | { |
d2e4a39e | 6708 | struct type *type = check_typedef (VALUE_TYPE (val)); |
14f9c5c9 AS |
6709 | if (ada_is_aligner_type (type)) |
6710 | { | |
d2e4a39e AS |
6711 | struct value *v = value_struct_elt (&val, NULL, "F", |
6712 | NULL, "internal structure"); | |
6713 | struct type *val_type = check_typedef (VALUE_TYPE (v)); | |
14f9c5c9 AS |
6714 | if (ada_type_name (val_type) == NULL) |
6715 | TYPE_NAME (val_type) = ada_type_name (type); | |
6716 | ||
6717 | return unwrap_value (v); | |
6718 | } | |
d2e4a39e | 6719 | else |
14f9c5c9 | 6720 | { |
d2e4a39e | 6721 | struct type *raw_real_type = |
14f9c5c9 | 6722 | ada_completed_type (ada_get_base_type (type)); |
d2e4a39e | 6723 | |
14f9c5c9 AS |
6724 | if (type == raw_real_type) |
6725 | return val; | |
6726 | ||
d2e4a39e AS |
6727 | return |
6728 | coerce_unspec_val_to_type | |
14f9c5c9 AS |
6729 | (val, 0, ada_to_fixed_type (raw_real_type, 0, |
6730 | VALUE_ADDRESS (val) + VALUE_OFFSET (val), | |
6731 | NULL)); | |
6732 | } | |
6733 | } | |
d2e4a39e AS |
6734 | |
6735 | static struct value * | |
6736 | cast_to_fixed (struct type *type, struct value *arg) | |
14f9c5c9 AS |
6737 | { |
6738 | LONGEST val; | |
6739 | ||
6740 | if (type == VALUE_TYPE (arg)) | |
6741 | return arg; | |
6742 | else if (ada_is_fixed_point_type (VALUE_TYPE (arg))) | |
d2e4a39e | 6743 | val = ada_float_to_fixed (type, |
14f9c5c9 AS |
6744 | ada_fixed_to_float (VALUE_TYPE (arg), |
6745 | value_as_long (arg))); | |
d2e4a39e | 6746 | else |
14f9c5c9 | 6747 | { |
d2e4a39e | 6748 | DOUBLEST argd = |
14f9c5c9 AS |
6749 | value_as_double (value_cast (builtin_type_double, value_copy (arg))); |
6750 | val = ada_float_to_fixed (type, argd); | |
6751 | } | |
6752 | ||
6753 | return value_from_longest (type, val); | |
6754 | } | |
6755 | ||
d2e4a39e AS |
6756 | static struct value * |
6757 | cast_from_fixed_to_double (struct value *arg) | |
14f9c5c9 AS |
6758 | { |
6759 | DOUBLEST val = ada_fixed_to_float (VALUE_TYPE (arg), | |
6760 | value_as_long (arg)); | |
6761 | return value_from_double (builtin_type_double, val); | |
6762 | } | |
6763 | ||
6764 | /* Coerce VAL as necessary for assignment to an lval of type TYPE, and | |
6765 | * return the converted value. */ | |
d2e4a39e AS |
6766 | static struct value * |
6767 | coerce_for_assign (struct type *type, struct value *val) | |
14f9c5c9 | 6768 | { |
d2e4a39e | 6769 | struct type *type2 = VALUE_TYPE (val); |
14f9c5c9 AS |
6770 | if (type == type2) |
6771 | return val; | |
6772 | ||
6773 | CHECK_TYPEDEF (type2); | |
6774 | CHECK_TYPEDEF (type); | |
6775 | ||
d2e4a39e AS |
6776 | if (TYPE_CODE (type2) == TYPE_CODE_PTR |
6777 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
14f9c5c9 AS |
6778 | { |
6779 | val = ada_value_ind (val); | |
6780 | type2 = VALUE_TYPE (val); | |
6781 | } | |
6782 | ||
d2e4a39e | 6783 | if (TYPE_CODE (type2) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
6784 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) |
6785 | { | |
6786 | if (TYPE_LENGTH (type2) != TYPE_LENGTH (type) | |
6787 | || TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
d2e4a39e | 6788 | != TYPE_LENGTH (TYPE_TARGET_TYPE (type2))) |
14f9c5c9 AS |
6789 | error ("Incompatible types in assignment"); |
6790 | VALUE_TYPE (val) = type; | |
6791 | } | |
d2e4a39e | 6792 | return val; |
14f9c5c9 AS |
6793 | } |
6794 | ||
d2e4a39e | 6795 | struct value * |
ebf56fd3 AS |
6796 | ada_evaluate_subexp (struct type *expect_type, struct expression *exp, |
6797 | int *pos, enum noside noside) | |
14f9c5c9 AS |
6798 | { |
6799 | enum exp_opcode op; | |
6800 | enum ada_attribute atr; | |
6801 | int tem, tem2, tem3; | |
6802 | int pc; | |
6803 | struct value *arg1 = NULL, *arg2 = NULL, *arg3; | |
6804 | struct type *type; | |
6805 | int nargs; | |
d2e4a39e | 6806 | struct value **argvec; |
14f9c5c9 | 6807 | |
d2e4a39e AS |
6808 | pc = *pos; |
6809 | *pos += 1; | |
14f9c5c9 AS |
6810 | op = exp->elts[pc].opcode; |
6811 | ||
d2e4a39e | 6812 | switch (op) |
14f9c5c9 AS |
6813 | { |
6814 | default: | |
6815 | *pos -= 1; | |
d2e4a39e AS |
6816 | return |
6817 | unwrap_value (evaluate_subexp_standard | |
6818 | (expect_type, exp, pos, noside)); | |
14f9c5c9 AS |
6819 | |
6820 | case UNOP_CAST: | |
6821 | (*pos) += 2; | |
6822 | type = exp->elts[pc + 1].type; | |
6823 | arg1 = evaluate_subexp (type, exp, pos, noside); | |
6824 | if (noside == EVAL_SKIP) | |
6825 | goto nosideret; | |
6826 | if (type != check_typedef (VALUE_TYPE (arg1))) | |
6827 | { | |
6828 | if (ada_is_fixed_point_type (type)) | |
6829 | arg1 = cast_to_fixed (type, arg1); | |
6830 | else if (ada_is_fixed_point_type (VALUE_TYPE (arg1))) | |
6831 | arg1 = value_cast (type, cast_from_fixed_to_double (arg1)); | |
d2e4a39e | 6832 | else if (VALUE_LVAL (arg1) == lval_memory) |
14f9c5c9 AS |
6833 | { |
6834 | /* This is in case of the really obscure (and undocumented, | |
d2e4a39e AS |
6835 | but apparently expected) case of (Foo) Bar.all, where Bar |
6836 | is an integer constant and Foo is a dynamic-sized type. | |
6837 | If we don't do this, ARG1 will simply be relabeled with | |
6838 | TYPE. */ | |
6839 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
14f9c5c9 | 6840 | return value_zero (to_static_fixed_type (type), not_lval); |
d2e4a39e AS |
6841 | arg1 = |
6842 | ada_to_fixed_value | |
6843 | (type, 0, VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1), 0); | |
14f9c5c9 | 6844 | } |
d2e4a39e AS |
6845 | else |
6846 | arg1 = value_cast (type, arg1); | |
14f9c5c9 AS |
6847 | } |
6848 | return arg1; | |
6849 | ||
6850 | /* FIXME: UNOP_QUAL should be defined in expression.h */ | |
6851 | /* case UNOP_QUAL: | |
d2e4a39e AS |
6852 | (*pos) += 2; |
6853 | type = exp->elts[pc + 1].type; | |
6854 | return ada_evaluate_subexp (type, exp, pos, noside); | |
6855 | */ | |
14f9c5c9 AS |
6856 | case BINOP_ASSIGN: |
6857 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
6858 | arg2 = evaluate_subexp (VALUE_TYPE (arg1), exp, pos, noside); | |
6859 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
6860 | return arg1; | |
6861 | if (binop_user_defined_p (op, arg1, arg2)) | |
6862 | return value_x_binop (arg1, arg2, op, OP_NULL, EVAL_NORMAL); | |
d2e4a39e | 6863 | else |
14f9c5c9 AS |
6864 | { |
6865 | if (ada_is_fixed_point_type (VALUE_TYPE (arg1))) | |
6866 | arg2 = cast_to_fixed (VALUE_TYPE (arg1), arg2); | |
6867 | else if (ada_is_fixed_point_type (VALUE_TYPE (arg2))) | |
d2e4a39e AS |
6868 | error |
6869 | ("Fixed-point values must be assigned to fixed-point variables"); | |
6870 | else | |
14f9c5c9 AS |
6871 | arg2 = coerce_for_assign (VALUE_TYPE (arg1), arg2); |
6872 | return ada_value_assign (arg1, arg2); | |
6873 | } | |
6874 | ||
6875 | case BINOP_ADD: | |
6876 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
6877 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
6878 | if (noside == EVAL_SKIP) | |
6879 | goto nosideret; | |
6880 | if (binop_user_defined_p (op, arg1, arg2)) | |
6881 | return value_x_binop (arg1, arg2, op, OP_NULL, EVAL_NORMAL); | |
6882 | else | |
6883 | { | |
6884 | if ((ada_is_fixed_point_type (VALUE_TYPE (arg1)) | |
6885 | || ada_is_fixed_point_type (VALUE_TYPE (arg2))) | |
6886 | && VALUE_TYPE (arg1) != VALUE_TYPE (arg2)) | |
d2e4a39e AS |
6887 | error |
6888 | ("Operands of fixed-point addition must have the same type"); | |
14f9c5c9 AS |
6889 | return value_cast (VALUE_TYPE (arg1), value_add (arg1, arg2)); |
6890 | } | |
6891 | ||
6892 | case BINOP_SUB: | |
6893 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
6894 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
6895 | if (noside == EVAL_SKIP) | |
6896 | goto nosideret; | |
6897 | if (binop_user_defined_p (op, arg1, arg2)) | |
6898 | return value_x_binop (arg1, arg2, op, OP_NULL, EVAL_NORMAL); | |
6899 | else | |
6900 | { | |
6901 | if ((ada_is_fixed_point_type (VALUE_TYPE (arg1)) | |
6902 | || ada_is_fixed_point_type (VALUE_TYPE (arg2))) | |
6903 | && VALUE_TYPE (arg1) != VALUE_TYPE (arg2)) | |
d2e4a39e AS |
6904 | error |
6905 | ("Operands of fixed-point subtraction must have the same type"); | |
14f9c5c9 AS |
6906 | return value_cast (VALUE_TYPE (arg1), value_sub (arg1, arg2)); |
6907 | } | |
6908 | ||
6909 | case BINOP_MUL: | |
6910 | case BINOP_DIV: | |
6911 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
6912 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
6913 | if (noside == EVAL_SKIP) | |
6914 | goto nosideret; | |
6915 | if (binop_user_defined_p (op, arg1, arg2)) | |
6916 | return value_x_binop (arg1, arg2, op, OP_NULL, EVAL_NORMAL); | |
6917 | else | |
6918 | if (noside == EVAL_AVOID_SIDE_EFFECTS | |
6919 | && (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD)) | |
d2e4a39e | 6920 | return value_zero (VALUE_TYPE (arg1), not_lval); |
14f9c5c9 AS |
6921 | else |
6922 | { | |
6923 | if (ada_is_fixed_point_type (VALUE_TYPE (arg1))) | |
6924 | arg1 = cast_from_fixed_to_double (arg1); | |
6925 | if (ada_is_fixed_point_type (VALUE_TYPE (arg2))) | |
6926 | arg2 = cast_from_fixed_to_double (arg2); | |
6927 | return value_binop (arg1, arg2, op); | |
6928 | } | |
6929 | ||
6930 | case UNOP_NEG: | |
6931 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
6932 | if (noside == EVAL_SKIP) | |
6933 | goto nosideret; | |
6934 | if (unop_user_defined_p (op, arg1)) | |
6935 | return value_x_unop (arg1, op, EVAL_NORMAL); | |
6936 | else if (ada_is_fixed_point_type (VALUE_TYPE (arg1))) | |
6937 | return value_cast (VALUE_TYPE (arg1), value_neg (arg1)); | |
6938 | else | |
6939 | return value_neg (arg1); | |
6940 | ||
6941 | /* FIXME: OP_UNRESOLVED_VALUE should be defined in expression.h */ | |
6942 | /* case OP_UNRESOLVED_VALUE: | |
d2e4a39e | 6943 | /* Only encountered when an unresolved symbol occurs in a |
14f9c5c9 | 6944 | context other than a function call, in which case, it is |
d2e4a39e AS |
6945 | illegal. *//* |
6946 | (*pos) += 3; | |
6947 | if (noside == EVAL_SKIP) | |
6948 | goto nosideret; | |
6949 | else | |
6950 | error ("Unexpected unresolved symbol, %s, during evaluation", | |
6951 | ada_demangle (exp->elts[pc + 2].name)); | |
6952 | */ | |
14f9c5c9 AS |
6953 | case OP_VAR_VALUE: |
6954 | *pos -= 1; | |
6955 | if (noside == EVAL_SKIP) | |
6956 | { | |
6957 | *pos += 4; | |
6958 | goto nosideret; | |
d2e4a39e | 6959 | } |
14f9c5c9 AS |
6960 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
6961 | { | |
6962 | *pos += 4; | |
d2e4a39e AS |
6963 | return value_zero |
6964 | (to_static_fixed_type | |
6965 | (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))), | |
14f9c5c9 AS |
6966 | not_lval); |
6967 | } | |
d2e4a39e | 6968 | else |
14f9c5c9 | 6969 | { |
d2e4a39e AS |
6970 | arg1 = |
6971 | unwrap_value (evaluate_subexp_standard | |
6972 | (expect_type, exp, pos, noside)); | |
14f9c5c9 | 6973 | return ada_to_fixed_value (VALUE_TYPE (arg1), 0, |
d2e4a39e AS |
6974 | VALUE_ADDRESS (arg1) + |
6975 | VALUE_OFFSET (arg1), arg1); | |
14f9c5c9 AS |
6976 | } |
6977 | ||
6978 | case OP_ARRAY: | |
6979 | (*pos) += 3; | |
6980 | tem2 = longest_to_int (exp->elts[pc + 1].longconst); | |
6981 | tem3 = longest_to_int (exp->elts[pc + 2].longconst); | |
6982 | nargs = tem3 - tem2 + 1; | |
6983 | type = expect_type ? check_typedef (expect_type) : NULL_TYPE; | |
6984 | ||
d2e4a39e AS |
6985 | argvec = |
6986 | (struct value * *) alloca (sizeof (struct value *) * (nargs + 1)); | |
14f9c5c9 AS |
6987 | for (tem = 0; tem == 0 || tem < nargs; tem += 1) |
6988 | /* At least one element gets inserted for the type */ | |
6989 | { | |
6990 | /* Ensure that array expressions are coerced into pointer objects. */ | |
6991 | argvec[tem] = evaluate_subexp_with_coercion (exp, pos, noside); | |
6992 | } | |
6993 | if (noside == EVAL_SKIP) | |
6994 | goto nosideret; | |
6995 | return value_array (tem2, tem3, argvec); | |
6996 | ||
6997 | case OP_FUNCALL: | |
6998 | (*pos) += 2; | |
6999 | ||
7000 | /* Allocate arg vector, including space for the function to be | |
d2e4a39e | 7001 | called in argvec[0] and a terminating NULL */ |
14f9c5c9 | 7002 | nargs = longest_to_int (exp->elts[pc + 1].longconst); |
d2e4a39e AS |
7003 | argvec = |
7004 | (struct value * *) alloca (sizeof (struct value *) * (nargs + 2)); | |
14f9c5c9 AS |
7005 | |
7006 | /* FIXME: OP_UNRESOLVED_VALUE should be defined in expression.h */ | |
7007 | /* FIXME: name should be defined in expresion.h */ | |
7008 | /* if (exp->elts[*pos].opcode == OP_UNRESOLVED_VALUE) | |
d2e4a39e AS |
7009 | error ("Unexpected unresolved symbol, %s, during evaluation", |
7010 | ada_demangle (exp->elts[pc + 5].name)); | |
7011 | */ | |
7012 | if (0) | |
14f9c5c9 AS |
7013 | { |
7014 | error ("unexpected code path, FIXME"); | |
7015 | } | |
7016 | else | |
7017 | { | |
7018 | for (tem = 0; tem <= nargs; tem += 1) | |
7019 | argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7020 | argvec[tem] = 0; | |
7021 | ||
7022 | if (noside == EVAL_SKIP) | |
7023 | goto nosideret; | |
7024 | } | |
7025 | ||
7026 | if (TYPE_CODE (VALUE_TYPE (argvec[0])) == TYPE_CODE_REF) | |
7027 | argvec[0] = value_addr (argvec[0]); | |
7028 | ||
7029 | if (ada_is_packed_array_type (VALUE_TYPE (argvec[0]))) | |
7030 | argvec[0] = ada_coerce_to_simple_array (argvec[0]); | |
7031 | ||
7032 | type = check_typedef (VALUE_TYPE (argvec[0])); | |
7033 | if (TYPE_CODE (type) == TYPE_CODE_PTR) | |
d2e4a39e | 7034 | { |
14f9c5c9 AS |
7035 | switch (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (type)))) |
7036 | { | |
7037 | case TYPE_CODE_FUNC: | |
7038 | type = check_typedef (TYPE_TARGET_TYPE (type)); | |
7039 | break; | |
7040 | case TYPE_CODE_ARRAY: | |
7041 | break; | |
7042 | case TYPE_CODE_STRUCT: | |
7043 | if (noside != EVAL_AVOID_SIDE_EFFECTS) | |
7044 | argvec[0] = ada_value_ind (argvec[0]); | |
7045 | type = check_typedef (TYPE_TARGET_TYPE (type)); | |
7046 | break; | |
7047 | default: | |
7048 | error ("cannot subscript or call something of type `%s'", | |
7049 | ada_type_name (VALUE_TYPE (argvec[0]))); | |
7050 | break; | |
d2e4a39e | 7051 | } |
14f9c5c9 | 7052 | } |
d2e4a39e | 7053 | |
14f9c5c9 AS |
7054 | switch (TYPE_CODE (type)) |
7055 | { | |
7056 | case TYPE_CODE_FUNC: | |
7057 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7058 | return allocate_value (TYPE_TARGET_TYPE (type)); | |
7059 | return call_function_by_hand (argvec[0], nargs, argvec + 1); | |
d2e4a39e | 7060 | case TYPE_CODE_STRUCT: |
14f9c5c9 AS |
7061 | { |
7062 | int arity = ada_array_arity (type); | |
7063 | type = ada_array_element_type (type, nargs); | |
d2e4a39e | 7064 | if (type == NULL) |
14f9c5c9 | 7065 | error ("cannot subscript or call a record"); |
d2e4a39e | 7066 | if (arity != nargs) |
14f9c5c9 | 7067 | error ("wrong number of subscripts; expecting %d", arity); |
d2e4a39e | 7068 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
14f9c5c9 | 7069 | return allocate_value (ada_aligned_type (type)); |
d2e4a39e AS |
7070 | return |
7071 | unwrap_value (ada_value_subscript | |
7072 | (argvec[0], nargs, argvec + 1)); | |
14f9c5c9 AS |
7073 | } |
7074 | case TYPE_CODE_ARRAY: | |
7075 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
d2e4a39e | 7076 | { |
14f9c5c9 AS |
7077 | type = ada_array_element_type (type, nargs); |
7078 | if (type == NULL) | |
7079 | error ("element type of array unknown"); | |
7080 | else | |
7081 | return allocate_value (ada_aligned_type (type)); | |
7082 | } | |
d2e4a39e | 7083 | return |
14f9c5c9 AS |
7084 | unwrap_value (ada_value_subscript |
7085 | (ada_coerce_to_simple_array (argvec[0]), | |
d2e4a39e AS |
7086 | nargs, argvec + 1)); |
7087 | case TYPE_CODE_PTR: /* Pointer to array */ | |
14f9c5c9 AS |
7088 | type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1); |
7089 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
d2e4a39e | 7090 | { |
14f9c5c9 AS |
7091 | type = ada_array_element_type (type, nargs); |
7092 | if (type == NULL) | |
7093 | error ("element type of array unknown"); | |
7094 | else | |
7095 | return allocate_value (ada_aligned_type (type)); | |
7096 | } | |
d2e4a39e AS |
7097 | return |
7098 | unwrap_value (ada_value_ptr_subscript (argvec[0], type, | |
7099 | nargs, argvec + 1)); | |
14f9c5c9 AS |
7100 | |
7101 | default: | |
7102 | error ("Internal error in evaluate_subexp"); | |
7103 | } | |
7104 | ||
7105 | case TERNOP_SLICE: | |
7106 | { | |
d2e4a39e | 7107 | struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
14f9c5c9 AS |
7108 | int lowbound |
7109 | = value_as_long (evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
7110 | int upper | |
7111 | = value_as_long (evaluate_subexp (NULL_TYPE, exp, pos, noside)); | |
7112 | if (noside == EVAL_SKIP) | |
7113 | goto nosideret; | |
d2e4a39e AS |
7114 | |
7115 | /* If this is a reference to an array, then dereference it */ | |
7116 | if (TYPE_CODE (VALUE_TYPE (array)) == TYPE_CODE_REF | |
7117 | && TYPE_TARGET_TYPE (VALUE_TYPE (array)) != NULL | |
7118 | && TYPE_CODE (TYPE_TARGET_TYPE (VALUE_TYPE (array))) == | |
7119 | TYPE_CODE_ARRAY | |
7120 | && !ada_is_array_descriptor (check_typedef (VALUE_TYPE (array)))) | |
7121 | { | |
7122 | array = ada_coerce_ref (array); | |
7123 | } | |
14f9c5c9 AS |
7124 | |
7125 | if (noside == EVAL_AVOID_SIDE_EFFECTS && | |
7126 | ada_is_array_descriptor (check_typedef (VALUE_TYPE (array)))) | |
7127 | { | |
7128 | /* Try to dereference the array, in case it is an access to array */ | |
d2e4a39e | 7129 | struct type *arrType = ada_type_of_array (array, 0); |
14f9c5c9 | 7130 | if (arrType != NULL) |
d2e4a39e | 7131 | array = value_at_lazy (arrType, 0, NULL); |
14f9c5c9 AS |
7132 | } |
7133 | if (ada_is_array_descriptor (VALUE_TYPE (array))) | |
7134 | array = ada_coerce_to_simple_array (array); | |
7135 | ||
d2e4a39e AS |
7136 | /* If at this point we have a pointer to an array, it means that |
7137 | it is a pointer to a simple (non-ada) array. We just then | |
7138 | dereference it */ | |
7139 | if (TYPE_CODE (VALUE_TYPE (array)) == TYPE_CODE_PTR | |
7140 | && TYPE_TARGET_TYPE (VALUE_TYPE (array)) != NULL | |
7141 | && TYPE_CODE (TYPE_TARGET_TYPE (VALUE_TYPE (array))) == | |
7142 | TYPE_CODE_ARRAY) | |
7143 | { | |
7144 | array = ada_value_ind (array); | |
7145 | } | |
7146 | ||
14f9c5c9 AS |
7147 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
7148 | /* The following will get the bounds wrong, but only in contexts | |
7149 | where the value is not being requested (FIXME?). */ | |
7150 | return array; | |
7151 | else | |
7152 | return value_slice (array, lowbound, upper - lowbound + 1); | |
7153 | } | |
7154 | ||
7155 | /* FIXME: UNOP_MBR should be defined in expression.h */ | |
7156 | /* case UNOP_MBR: | |
d2e4a39e AS |
7157 | (*pos) += 2; |
7158 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7159 | type = exp->elts[pc + 1].type; | |
7160 | ||
7161 | if (noside == EVAL_SKIP) | |
7162 | goto nosideret; | |
7163 | ||
7164 | switch (TYPE_CODE (type)) | |
7165 | { | |
7166 | default: | |
7167 | warning ("Membership test incompletely implemented; always returns true"); | |
7168 | return value_from_longest (builtin_type_int, (LONGEST) 1); | |
7169 | ||
7170 | case TYPE_CODE_RANGE: | |
7171 | arg2 = value_from_longest (builtin_type_int, | |
7172 | (LONGEST) TYPE_LOW_BOUND (type)); | |
7173 | arg3 = value_from_longest (builtin_type_int, | |
7174 | (LONGEST) TYPE_HIGH_BOUND (type)); | |
7175 | return | |
7176 | value_from_longest (builtin_type_int, | |
7177 | (value_less (arg1,arg3) | |
7178 | || value_equal (arg1,arg3)) | |
7179 | && (value_less (arg2,arg1) | |
7180 | || value_equal (arg2,arg1))); | |
7181 | } | |
7182 | */ | |
7183 | /* FIXME: BINOP_MBR should be defined in expression.h */ | |
14f9c5c9 | 7184 | /* case BINOP_MBR: |
d2e4a39e AS |
7185 | (*pos) += 2; |
7186 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7187 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
14f9c5c9 | 7188 | |
d2e4a39e AS |
7189 | if (noside == EVAL_SKIP) |
7190 | goto nosideret; | |
14f9c5c9 | 7191 | |
d2e4a39e AS |
7192 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
7193 | return value_zero (builtin_type_int, not_lval); | |
14f9c5c9 | 7194 | |
d2e4a39e | 7195 | tem = longest_to_int (exp->elts[pc + 1].longconst); |
14f9c5c9 | 7196 | |
d2e4a39e AS |
7197 | if (tem < 1 || tem > ada_array_arity (VALUE_TYPE (arg2))) |
7198 | error ("invalid dimension number to '%s", "range"); | |
14f9c5c9 | 7199 | |
d2e4a39e AS |
7200 | arg3 = ada_array_bound (arg2, tem, 1); |
7201 | arg2 = ada_array_bound (arg2, tem, 0); | |
14f9c5c9 | 7202 | |
d2e4a39e AS |
7203 | return |
7204 | value_from_longest (builtin_type_int, | |
7205 | (value_less (arg1,arg3) | |
7206 | || value_equal (arg1,arg3)) | |
7207 | && (value_less (arg2,arg1) | |
7208 | || value_equal (arg2,arg1))); | |
7209 | */ | |
14f9c5c9 AS |
7210 | /* FIXME: TERNOP_MBR should be defined in expression.h */ |
7211 | /* case TERNOP_MBR: | |
d2e4a39e AS |
7212 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
7213 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7214 | arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7215 | ||
7216 | if (noside == EVAL_SKIP) | |
7217 | goto nosideret; | |
7218 | ||
7219 | return | |
7220 | value_from_longest (builtin_type_int, | |
7221 | (value_less (arg1,arg3) | |
7222 | || value_equal (arg1,arg3)) | |
7223 | && (value_less (arg2,arg1) | |
7224 | || value_equal (arg2,arg1))); | |
7225 | */ | |
14f9c5c9 AS |
7226 | /* FIXME: OP_ATTRIBUTE should be defined in expression.h */ |
7227 | /* case OP_ATTRIBUTE: | |
d2e4a39e AS |
7228 | *pos += 3; |
7229 | atr = (enum ada_attribute) longest_to_int (exp->elts[pc + 2].longconst); | |
7230 | switch (atr) | |
7231 | { | |
7232 | default: | |
7233 | error ("unexpected attribute encountered"); | |
7234 | ||
7235 | case ATR_FIRST: | |
7236 | case ATR_LAST: | |
7237 | case ATR_LENGTH: | |
7238 | { | |
7239 | struct type* type_arg; | |
7240 | if (exp->elts[*pos].opcode == OP_TYPE) | |
7241 | { | |
7242 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
7243 | arg1 = NULL; | |
7244 | type_arg = exp->elts[pc + 5].type; | |
7245 | } | |
7246 | else | |
7247 | { | |
7248 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7249 | type_arg = NULL; | |
7250 | } | |
7251 | ||
7252 | if (exp->elts[*pos].opcode != OP_LONG) | |
7253 | error ("illegal operand to '%s", ada_attribute_name (atr)); | |
7254 | tem = longest_to_int (exp->elts[*pos+2].longconst); | |
7255 | *pos += 4; | |
7256 | ||
7257 | if (noside == EVAL_SKIP) | |
7258 | goto nosideret; | |
7259 | ||
7260 | if (type_arg == NULL) | |
7261 | { | |
7262 | arg1 = ada_coerce_ref (arg1); | |
7263 | ||
7264 | if (ada_is_packed_array_type (VALUE_TYPE (arg1))) | |
7265 | arg1 = ada_coerce_to_simple_array (arg1); | |
7266 | ||
7267 | if (tem < 1 || tem > ada_array_arity (VALUE_TYPE (arg1))) | |
7268 | error ("invalid dimension number to '%s", | |
7269 | ada_attribute_name (atr)); | |
7270 | ||
7271 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7272 | { | |
7273 | type = ada_index_type (VALUE_TYPE (arg1), tem); | |
7274 | if (type == NULL) | |
7275 | error ("attempt to take bound of something that is not an array"); | |
7276 | return allocate_value (type); | |
7277 | } | |
7278 | ||
7279 | switch (atr) | |
7280 | { | |
7281 | default: | |
7282 | error ("unexpected attribute encountered"); | |
7283 | case ATR_FIRST: | |
7284 | return ada_array_bound (arg1, tem, 0); | |
7285 | case ATR_LAST: | |
7286 | return ada_array_bound (arg1, tem, 1); | |
7287 | case ATR_LENGTH: | |
7288 | return ada_array_length (arg1, tem); | |
7289 | } | |
7290 | } | |
7291 | else if (TYPE_CODE (type_arg) == TYPE_CODE_RANGE | |
7292 | || TYPE_CODE (type_arg) == TYPE_CODE_INT) | |
7293 | { | |
7294 | struct type* range_type; | |
7295 | char* name = ada_type_name (type_arg); | |
7296 | if (name == NULL) | |
7297 | { | |
7298 | if (TYPE_CODE (type_arg) == TYPE_CODE_RANGE) | |
7299 | range_type = type_arg; | |
7300 | else | |
7301 | error ("unimplemented type attribute"); | |
7302 | } | |
7303 | else | |
7304 | range_type = | |
7305 | to_fixed_range_type (name, NULL, TYPE_OBJFILE (type_arg)); | |
7306 | switch (atr) | |
7307 | { | |
7308 | default: | |
7309 | error ("unexpected attribute encountered"); | |
7310 | case ATR_FIRST: | |
7311 | return value_from_longest (TYPE_TARGET_TYPE (range_type), | |
7312 | TYPE_LOW_BOUND (range_type)); | |
7313 | case ATR_LAST: | |
7314 | return value_from_longest (TYPE_TARGET_TYPE (range_type), | |
7315 | TYPE_HIGH_BOUND (range_type)); | |
7316 | } | |
7317 | } | |
7318 | else if (TYPE_CODE (type_arg) == TYPE_CODE_ENUM) | |
7319 | { | |
7320 | switch (atr) | |
7321 | { | |
7322 | default: | |
7323 | error ("unexpected attribute encountered"); | |
7324 | case ATR_FIRST: | |
7325 | return value_from_longest | |
7326 | (type_arg, TYPE_FIELD_BITPOS (type_arg, 0)); | |
7327 | case ATR_LAST: | |
7328 | return value_from_longest | |
7329 | (type_arg, | |
7330 | TYPE_FIELD_BITPOS (type_arg, | |
7331 | TYPE_NFIELDS (type_arg) - 1)); | |
7332 | } | |
7333 | } | |
7334 | else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT) | |
7335 | error ("unimplemented type attribute"); | |
7336 | else | |
7337 | { | |
7338 | LONGEST low, high; | |
7339 | ||
7340 | if (ada_is_packed_array_type (type_arg)) | |
7341 | type_arg = decode_packed_array_type (type_arg); | |
7342 | ||
7343 | if (tem < 1 || tem > ada_array_arity (type_arg)) | |
7344 | error ("invalid dimension number to '%s", | |
7345 | ada_attribute_name (atr)); | |
7346 | ||
7347 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7348 | { | |
7349 | type = ada_index_type (type_arg, tem); | |
7350 | if (type == NULL) | |
7351 | error ("attempt to take bound of something that is not an array"); | |
7352 | return allocate_value (type); | |
7353 | } | |
7354 | ||
7355 | switch (atr) | |
7356 | { | |
7357 | default: | |
7358 | error ("unexpected attribute encountered"); | |
7359 | case ATR_FIRST: | |
7360 | low = ada_array_bound_from_type (type_arg, tem, 0, &type); | |
7361 | return value_from_longest (type, low); | |
7362 | case ATR_LAST: | |
7363 | high = ada_array_bound_from_type (type_arg, tem, 1, &type); | |
7364 | return value_from_longest (type, high); | |
7365 | case ATR_LENGTH: | |
7366 | low = ada_array_bound_from_type (type_arg, tem, 0, &type); | |
7367 | high = ada_array_bound_from_type (type_arg, tem, 1, NULL); | |
7368 | return value_from_longest (type, high-low+1); | |
7369 | } | |
7370 | } | |
7371 | } | |
7372 | ||
7373 | case ATR_TAG: | |
7374 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7375 | if (noside == EVAL_SKIP) | |
7376 | goto nosideret; | |
7377 | ||
7378 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7379 | return | |
7380 | value_zero (ada_tag_type (arg1), not_lval); | |
7381 | ||
7382 | return ada_value_tag (arg1); | |
7383 | ||
7384 | case ATR_MIN: | |
7385 | case ATR_MAX: | |
7386 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
7387 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7388 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7389 | if (noside == EVAL_SKIP) | |
7390 | goto nosideret; | |
7391 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7392 | return value_zero (VALUE_TYPE (arg1), not_lval); | |
7393 | else | |
7394 | return value_binop (arg1, arg2, | |
7395 | atr == ATR_MIN ? BINOP_MIN : BINOP_MAX); | |
7396 | ||
7397 | case ATR_MODULUS: | |
7398 | { | |
7399 | struct type* type_arg = exp->elts[pc + 5].type; | |
7400 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
7401 | *pos += 4; | |
7402 | ||
7403 | if (noside == EVAL_SKIP) | |
7404 | goto nosideret; | |
7405 | ||
7406 | if (! ada_is_modular_type (type_arg)) | |
7407 | error ("'modulus must be applied to modular type"); | |
7408 | ||
7409 | return value_from_longest (TYPE_TARGET_TYPE (type_arg), | |
7410 | ada_modulus (type_arg)); | |
7411 | } | |
7412 | ||
7413 | ||
7414 | case ATR_POS: | |
7415 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
7416 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7417 | if (noside == EVAL_SKIP) | |
7418 | goto nosideret; | |
7419 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7420 | return value_zero (builtin_type_ada_int, not_lval); | |
7421 | else | |
7422 | return value_pos_atr (arg1); | |
7423 | ||
7424 | case ATR_SIZE: | |
7425 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7426 | if (noside == EVAL_SKIP) | |
7427 | goto nosideret; | |
7428 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7429 | return value_zero (builtin_type_ada_int, not_lval); | |
7430 | else | |
7431 | return value_from_longest (builtin_type_ada_int, | |
7432 | TARGET_CHAR_BIT | |
7433 | * TYPE_LENGTH (VALUE_TYPE (arg1))); | |
7434 | ||
7435 | case ATR_VAL: | |
7436 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
7437 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7438 | type = exp->elts[pc + 5].type; | |
7439 | if (noside == EVAL_SKIP) | |
7440 | goto nosideret; | |
7441 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7442 | return value_zero (type, not_lval); | |
7443 | else | |
7444 | return value_val_atr (type, arg1); | |
7445 | } */ | |
14f9c5c9 AS |
7446 | case BINOP_EXP: |
7447 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7448 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7449 | if (noside == EVAL_SKIP) | |
7450 | goto nosideret; | |
7451 | if (binop_user_defined_p (op, arg1, arg2)) | |
7452 | return unwrap_value (value_x_binop (arg1, arg2, op, OP_NULL, | |
d2e4a39e AS |
7453 | EVAL_NORMAL)); |
7454 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7455 | return value_zero (VALUE_TYPE (arg1), not_lval); | |
14f9c5c9 AS |
7456 | else |
7457 | return value_binop (arg1, arg2, op); | |
7458 | ||
7459 | case UNOP_PLUS: | |
7460 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7461 | if (noside == EVAL_SKIP) | |
7462 | goto nosideret; | |
7463 | if (unop_user_defined_p (op, arg1)) | |
7464 | return unwrap_value (value_x_unop (arg1, op, EVAL_NORMAL)); | |
7465 | else | |
7466 | return arg1; | |
7467 | ||
7468 | case UNOP_ABS: | |
7469 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7470 | if (noside == EVAL_SKIP) | |
7471 | goto nosideret; | |
7472 | if (value_less (arg1, value_zero (VALUE_TYPE (arg1), not_lval))) | |
7473 | return value_neg (arg1); | |
7474 | else | |
7475 | return arg1; | |
7476 | ||
7477 | case UNOP_IND: | |
7478 | if (expect_type && TYPE_CODE (expect_type) == TYPE_CODE_PTR) | |
d2e4a39e | 7479 | expect_type = TYPE_TARGET_TYPE (check_typedef (expect_type)); |
14f9c5c9 AS |
7480 | arg1 = evaluate_subexp (expect_type, exp, pos, noside); |
7481 | if (noside == EVAL_SKIP) | |
7482 | goto nosideret; | |
7483 | type = check_typedef (VALUE_TYPE (arg1)); | |
7484 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7485 | { | |
7486 | if (ada_is_array_descriptor (type)) | |
7487 | /* GDB allows dereferencing GNAT array descriptors. */ | |
7488 | { | |
d2e4a39e | 7489 | struct type *arrType = ada_type_of_array (arg1, 0); |
14f9c5c9 AS |
7490 | if (arrType == NULL) |
7491 | error ("Attempt to dereference null array pointer."); | |
7492 | return value_at_lazy (arrType, 0, NULL); | |
7493 | } | |
7494 | else if (TYPE_CODE (type) == TYPE_CODE_PTR | |
d2e4a39e AS |
7495 | || TYPE_CODE (type) == TYPE_CODE_REF |
7496 | /* In C you can dereference an array to get the 1st elt. */ | |
7497 | || TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
7498 | return | |
7499 | value_zero | |
7500 | (to_static_fixed_type | |
7501 | (ada_aligned_type (check_typedef (TYPE_TARGET_TYPE (type)))), | |
7502 | lval_memory); | |
14f9c5c9 AS |
7503 | else if (TYPE_CODE (type) == TYPE_CODE_INT) |
7504 | /* GDB allows dereferencing an int. */ | |
7505 | return value_zero (builtin_type_int, lval_memory); | |
7506 | else | |
7507 | error ("Attempt to take contents of a non-pointer value."); | |
7508 | } | |
7509 | arg1 = ada_coerce_ref (arg1); | |
7510 | type = check_typedef (VALUE_TYPE (arg1)); | |
d2e4a39e | 7511 | |
14f9c5c9 AS |
7512 | if (ada_is_array_descriptor (type)) |
7513 | /* GDB allows dereferencing GNAT array descriptors. */ | |
7514 | return ada_coerce_to_simple_array (arg1); | |
7515 | else | |
7516 | return ada_value_ind (arg1); | |
7517 | ||
7518 | case STRUCTOP_STRUCT: | |
7519 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
7520 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
7521 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7522 | if (noside == EVAL_SKIP) | |
7523 | goto nosideret; | |
7524 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
d2e4a39e | 7525 | return value_zero (ada_aligned_type |
14f9c5c9 | 7526 | (ada_lookup_struct_elt_type (VALUE_TYPE (arg1), |
d2e4a39e AS |
7527 | &exp->elts[pc + |
7528 | 2].string, | |
14f9c5c9 AS |
7529 | 0, NULL)), |
7530 | lval_memory); | |
7531 | else | |
7532 | return unwrap_value (ada_value_struct_elt (arg1, | |
7533 | &exp->elts[pc + 2].string, | |
7534 | "record")); | |
7535 | case OP_TYPE: | |
7536 | /* The value is not supposed to be used. This is here to make it | |
7537 | easier to accommodate expressions that contain types. */ | |
7538 | (*pos) += 2; | |
7539 | if (noside == EVAL_SKIP) | |
7540 | goto nosideret; | |
7541 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
7542 | return allocate_value (builtin_type_void); | |
d2e4a39e | 7543 | else |
14f9c5c9 | 7544 | error ("Attempt to use a type name as an expression"); |
d2e4a39e | 7545 | |
14f9c5c9 AS |
7546 | case STRUCTOP_PTR: |
7547 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
7548 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
7549 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
7550 | if (noside == EVAL_SKIP) | |
7551 | goto nosideret; | |
7552 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
d2e4a39e | 7553 | return value_zero (ada_aligned_type |
14f9c5c9 | 7554 | (ada_lookup_struct_elt_type (VALUE_TYPE (arg1), |
d2e4a39e AS |
7555 | &exp->elts[pc + |
7556 | 2].string, | |
14f9c5c9 AS |
7557 | 0, NULL)), |
7558 | lval_memory); | |
7559 | else | |
7560 | return unwrap_value (ada_value_struct_elt (arg1, | |
7561 | &exp->elts[pc + 2].string, | |
7562 | "record access")); | |
7563 | } | |
7564 | ||
7565 | nosideret: | |
7566 | return value_from_longest (builtin_type_long, (LONGEST) 1); | |
7567 | } | |
14f9c5c9 | 7568 | \f |
d2e4a39e | 7569 | |
14f9c5c9 AS |
7570 | /* Fixed point */ |
7571 | ||
7572 | /* If TYPE encodes an Ada fixed-point type, return the suffix of the | |
7573 | type name that encodes the 'small and 'delta information. | |
7574 | Otherwise, return NULL. */ | |
7575 | ||
d2e4a39e | 7576 | static const char * |
ebf56fd3 | 7577 | fixed_type_info (struct type *type) |
14f9c5c9 | 7578 | { |
d2e4a39e | 7579 | const char *name = ada_type_name (type); |
14f9c5c9 AS |
7580 | enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type); |
7581 | ||
d2e4a39e AS |
7582 | if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL) |
7583 | { | |
14f9c5c9 AS |
7584 | const char *tail = strstr (name, "___XF_"); |
7585 | if (tail == NULL) | |
7586 | return NULL; | |
d2e4a39e | 7587 | else |
14f9c5c9 AS |
7588 | return tail + 5; |
7589 | } | |
7590 | else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type) | |
7591 | return fixed_type_info (TYPE_TARGET_TYPE (type)); | |
7592 | else | |
7593 | return NULL; | |
7594 | } | |
7595 | ||
7596 | /* Returns non-zero iff TYPE represents an Ada fixed-point type. */ | |
7597 | ||
7598 | int | |
ebf56fd3 | 7599 | ada_is_fixed_point_type (struct type *type) |
14f9c5c9 AS |
7600 | { |
7601 | return fixed_type_info (type) != NULL; | |
7602 | } | |
7603 | ||
7604 | /* Assuming that TYPE is the representation of an Ada fixed-point | |
7605 | type, return its delta, or -1 if the type is malformed and the | |
7606 | delta cannot be determined. */ | |
7607 | ||
7608 | DOUBLEST | |
ebf56fd3 | 7609 | ada_delta (struct type *type) |
14f9c5c9 AS |
7610 | { |
7611 | const char *encoding = fixed_type_info (type); | |
7612 | long num, den; | |
7613 | ||
7614 | if (sscanf (encoding, "_%ld_%ld", &num, &den) < 2) | |
7615 | return -1.0; | |
d2e4a39e | 7616 | else |
14f9c5c9 AS |
7617 | return (DOUBLEST) num / (DOUBLEST) den; |
7618 | } | |
7619 | ||
7620 | /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling | |
7621 | factor ('SMALL value) associated with the type. */ | |
7622 | ||
7623 | static DOUBLEST | |
ebf56fd3 | 7624 | scaling_factor (struct type *type) |
14f9c5c9 AS |
7625 | { |
7626 | const char *encoding = fixed_type_info (type); | |
7627 | unsigned long num0, den0, num1, den1; | |
7628 | int n; | |
d2e4a39e | 7629 | |
14f9c5c9 AS |
7630 | n = sscanf (encoding, "_%lu_%lu_%lu_%lu", &num0, &den0, &num1, &den1); |
7631 | ||
7632 | if (n < 2) | |
7633 | return 1.0; | |
7634 | else if (n == 4) | |
7635 | return (DOUBLEST) num1 / (DOUBLEST) den1; | |
d2e4a39e | 7636 | else |
14f9c5c9 AS |
7637 | return (DOUBLEST) num0 / (DOUBLEST) den0; |
7638 | } | |
7639 | ||
7640 | ||
7641 | /* Assuming that X is the representation of a value of fixed-point | |
7642 | type TYPE, return its floating-point equivalent. */ | |
7643 | ||
7644 | DOUBLEST | |
ebf56fd3 | 7645 | ada_fixed_to_float (struct type *type, LONGEST x) |
14f9c5c9 | 7646 | { |
d2e4a39e | 7647 | return (DOUBLEST) x *scaling_factor (type); |
14f9c5c9 AS |
7648 | } |
7649 | ||
7650 | /* The representation of a fixed-point value of type TYPE | |
7651 | corresponding to the value X. */ | |
7652 | ||
7653 | LONGEST | |
ebf56fd3 | 7654 | ada_float_to_fixed (struct type *type, DOUBLEST x) |
14f9c5c9 AS |
7655 | { |
7656 | return (LONGEST) (x / scaling_factor (type) + 0.5); | |
7657 | } | |
7658 | ||
7659 | ||
7660 | /* VAX floating formats */ | |
7661 | ||
7662 | /* Non-zero iff TYPE represents one of the special VAX floating-point | |
7663 | types. */ | |
7664 | int | |
d2e4a39e | 7665 | ada_is_vax_floating_type (struct type *type) |
14f9c5c9 | 7666 | { |
d2e4a39e | 7667 | int name_len = |
14f9c5c9 | 7668 | (ada_type_name (type) == NULL) ? 0 : strlen (ada_type_name (type)); |
d2e4a39e | 7669 | return |
14f9c5c9 | 7670 | name_len > 6 |
d2e4a39e | 7671 | && (TYPE_CODE (type) == TYPE_CODE_INT |
14f9c5c9 AS |
7672 | || TYPE_CODE (type) == TYPE_CODE_RANGE) |
7673 | && STREQN (ada_type_name (type) + name_len - 6, "___XF", 5); | |
7674 | } | |
7675 | ||
7676 | /* The type of special VAX floating-point type this is, assuming | |
7677 | ada_is_vax_floating_point */ | |
7678 | int | |
d2e4a39e | 7679 | ada_vax_float_type_suffix (struct type *type) |
14f9c5c9 | 7680 | { |
d2e4a39e | 7681 | return ada_type_name (type)[strlen (ada_type_name (type)) - 1]; |
14f9c5c9 AS |
7682 | } |
7683 | ||
7684 | /* A value representing the special debugging function that outputs | |
7685 | VAX floating-point values of the type represented by TYPE. Assumes | |
7686 | ada_is_vax_floating_type (TYPE). */ | |
d2e4a39e AS |
7687 | struct value * |
7688 | ada_vax_float_print_function (struct type *type) | |
7689 | { | |
7690 | switch (ada_vax_float_type_suffix (type)) | |
7691 | { | |
7692 | case 'F': | |
7693 | return get_var_value ("DEBUG_STRING_F", 0); | |
7694 | case 'D': | |
7695 | return get_var_value ("DEBUG_STRING_D", 0); | |
7696 | case 'G': | |
7697 | return get_var_value ("DEBUG_STRING_G", 0); | |
7698 | default: | |
7699 | error ("invalid VAX floating-point type"); | |
7700 | } | |
14f9c5c9 | 7701 | } |
14f9c5c9 | 7702 | \f |
d2e4a39e | 7703 | |
14f9c5c9 AS |
7704 | /* Range types */ |
7705 | ||
7706 | /* Scan STR beginning at position K for a discriminant name, and | |
7707 | return the value of that discriminant field of DVAL in *PX. If | |
7708 | PNEW_K is not null, put the position of the character beyond the | |
7709 | name scanned in *PNEW_K. Return 1 if successful; return 0 and do | |
7710 | not alter *PX and *PNEW_K if unsuccessful. */ | |
7711 | ||
7712 | static int | |
d2e4a39e AS |
7713 | scan_discrim_bound (char *, int k, struct value *dval, LONGEST * px, |
7714 | int *pnew_k) | |
14f9c5c9 AS |
7715 | { |
7716 | static char *bound_buffer = NULL; | |
7717 | static size_t bound_buffer_len = 0; | |
7718 | char *bound; | |
7719 | char *pend; | |
d2e4a39e | 7720 | struct value *bound_val; |
14f9c5c9 AS |
7721 | |
7722 | if (dval == NULL || str == NULL || str[k] == '\0') | |
7723 | return 0; | |
7724 | ||
d2e4a39e | 7725 | pend = strstr (str + k, "__"); |
14f9c5c9 AS |
7726 | if (pend == NULL) |
7727 | { | |
d2e4a39e | 7728 | bound = str + k; |
14f9c5c9 AS |
7729 | k += strlen (bound); |
7730 | } | |
d2e4a39e | 7731 | else |
14f9c5c9 | 7732 | { |
d2e4a39e | 7733 | GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1); |
14f9c5c9 | 7734 | bound = bound_buffer; |
d2e4a39e AS |
7735 | strncpy (bound_buffer, str + k, pend - (str + k)); |
7736 | bound[pend - (str + k)] = '\0'; | |
7737 | k = pend - str; | |
14f9c5c9 | 7738 | } |
d2e4a39e AS |
7739 | |
7740 | bound_val = ada_search_struct_field (bound, dval, 0, VALUE_TYPE (dval)); | |
14f9c5c9 AS |
7741 | if (bound_val == NULL) |
7742 | return 0; | |
7743 | ||
7744 | *px = value_as_long (bound_val); | |
7745 | if (pnew_k != NULL) | |
7746 | *pnew_k = k; | |
7747 | return 1; | |
7748 | } | |
7749 | ||
7750 | /* Value of variable named NAME in the current environment. If | |
7751 | no such variable found, then if ERR_MSG is null, returns 0, and | |
7752 | otherwise causes an error with message ERR_MSG. */ | |
d2e4a39e AS |
7753 | static struct value * |
7754 | get_var_value (char *name, char *err_msg) | |
14f9c5c9 | 7755 | { |
d2e4a39e AS |
7756 | struct symbol **syms; |
7757 | struct block **blocks; | |
14f9c5c9 AS |
7758 | int nsyms; |
7759 | ||
d2e4a39e | 7760 | nsyms = |
176620f1 | 7761 | ada_lookup_symbol_list (name, get_selected_block (NULL), VAR_DOMAIN, |
d2e4a39e | 7762 | &syms, &blocks); |
14f9c5c9 AS |
7763 | |
7764 | if (nsyms != 1) | |
7765 | { | |
7766 | if (err_msg == NULL) | |
7767 | return 0; | |
7768 | else | |
7769 | error ("%s", err_msg); | |
7770 | } | |
7771 | ||
7772 | return value_of_variable (syms[0], blocks[0]); | |
7773 | } | |
d2e4a39e | 7774 | |
14f9c5c9 AS |
7775 | /* Value of integer variable named NAME in the current environment. If |
7776 | no such variable found, then if ERR_MSG is null, returns 0, and sets | |
7777 | *FLAG to 0. If successful, sets *FLAG to 1. */ | |
7778 | LONGEST | |
d2e4a39e | 7779 | get_int_var_value (char *name, char *err_msg, int *flag) |
14f9c5c9 | 7780 | { |
d2e4a39e AS |
7781 | struct value *var_val = get_var_value (name, err_msg); |
7782 | ||
14f9c5c9 AS |
7783 | if (var_val == 0) |
7784 | { | |
7785 | if (flag != NULL) | |
7786 | *flag = 0; | |
7787 | return 0; | |
7788 | } | |
7789 | else | |
7790 | { | |
7791 | if (flag != NULL) | |
7792 | *flag = 1; | |
7793 | return value_as_long (var_val); | |
7794 | } | |
7795 | } | |
d2e4a39e | 7796 | |
14f9c5c9 AS |
7797 | |
7798 | /* Return a range type whose base type is that of the range type named | |
7799 | NAME in the current environment, and whose bounds are calculated | |
7800 | from NAME according to the GNAT range encoding conventions. | |
7801 | Extract discriminant values, if needed, from DVAL. If a new type | |
7802 | must be created, allocate in OBJFILE's space. The bounds | |
7803 | information, in general, is encoded in NAME, the base type given in | |
7804 | the named range type. */ | |
7805 | ||
d2e4a39e | 7806 | static struct type * |
ebf56fd3 | 7807 | to_fixed_range_type (char *name, struct value *dval, struct objfile *objfile) |
14f9c5c9 AS |
7808 | { |
7809 | struct type *raw_type = ada_find_any_type (name); | |
7810 | struct type *base_type; | |
7811 | LONGEST low, high; | |
d2e4a39e | 7812 | char *subtype_info; |
14f9c5c9 AS |
7813 | |
7814 | if (raw_type == NULL) | |
7815 | base_type = builtin_type_int; | |
7816 | else if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE) | |
7817 | base_type = TYPE_TARGET_TYPE (raw_type); | |
7818 | else | |
7819 | base_type = raw_type; | |
7820 | ||
7821 | subtype_info = strstr (name, "___XD"); | |
7822 | if (subtype_info == NULL) | |
7823 | return raw_type; | |
7824 | else | |
7825 | { | |
7826 | static char *name_buf = NULL; | |
7827 | static size_t name_len = 0; | |
7828 | int prefix_len = subtype_info - name; | |
7829 | LONGEST L, U; | |
7830 | struct type *type; | |
7831 | char *bounds_str; | |
7832 | int n; | |
7833 | ||
7834 | GROW_VECT (name_buf, name_len, prefix_len + 5); | |
7835 | strncpy (name_buf, name, prefix_len); | |
7836 | name_buf[prefix_len] = '\0'; | |
7837 | ||
7838 | subtype_info += 5; | |
7839 | bounds_str = strchr (subtype_info, '_'); | |
7840 | n = 1; | |
7841 | ||
d2e4a39e | 7842 | if (*subtype_info == 'L') |
14f9c5c9 | 7843 | { |
d2e4a39e AS |
7844 | if (!ada_scan_number (bounds_str, n, &L, &n) |
7845 | && !scan_discrim_bound (bounds_str, n, dval, &L, &n)) | |
14f9c5c9 AS |
7846 | return raw_type; |
7847 | if (bounds_str[n] == '_') | |
7848 | n += 2; | |
d2e4a39e | 7849 | else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */ |
14f9c5c9 AS |
7850 | n += 1; |
7851 | subtype_info += 1; | |
7852 | } | |
d2e4a39e | 7853 | else |
14f9c5c9 | 7854 | { |
d2e4a39e | 7855 | strcpy (name_buf + prefix_len, "___L"); |
14f9c5c9 AS |
7856 | L = get_int_var_value (name_buf, "Index bound unknown.", NULL); |
7857 | } | |
7858 | ||
d2e4a39e | 7859 | if (*subtype_info == 'U') |
14f9c5c9 | 7860 | { |
d2e4a39e | 7861 | if (!ada_scan_number (bounds_str, n, &U, &n) |
14f9c5c9 AS |
7862 | && !scan_discrim_bound (bounds_str, n, dval, &U, &n)) |
7863 | return raw_type; | |
7864 | } | |
d2e4a39e | 7865 | else |
14f9c5c9 | 7866 | { |
d2e4a39e | 7867 | strcpy (name_buf + prefix_len, "___U"); |
14f9c5c9 AS |
7868 | U = get_int_var_value (name_buf, "Index bound unknown.", NULL); |
7869 | } | |
7870 | ||
d2e4a39e | 7871 | if (objfile == NULL) |
14f9c5c9 AS |
7872 | objfile = TYPE_OBJFILE (base_type); |
7873 | type = create_range_type (alloc_type (objfile), base_type, L, U); | |
d2e4a39e | 7874 | TYPE_NAME (type) = name; |
14f9c5c9 AS |
7875 | return type; |
7876 | } | |
7877 | } | |
7878 | ||
7879 | /* True iff NAME is the name of a range type. */ | |
7880 | int | |
d2e4a39e | 7881 | ada_is_range_type_name (const char *name) |
14f9c5c9 AS |
7882 | { |
7883 | return (name != NULL && strstr (name, "___XD")); | |
d2e4a39e | 7884 | } |
14f9c5c9 | 7885 | \f |
d2e4a39e | 7886 | |
14f9c5c9 AS |
7887 | /* Modular types */ |
7888 | ||
7889 | /* True iff TYPE is an Ada modular type. */ | |
7890 | int | |
d2e4a39e | 7891 | ada_is_modular_type (struct type *type) |
14f9c5c9 AS |
7892 | { |
7893 | /* FIXME: base_type should be declared in gdbtypes.h, implemented in | |
d2e4a39e AS |
7894 | valarith.c */ |
7895 | struct type *subranged_type; /* = base_type (type); */ | |
14f9c5c9 AS |
7896 | |
7897 | return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE | |
7898 | && TYPE_CODE (subranged_type) != TYPE_CODE_ENUM | |
7899 | && TYPE_UNSIGNED (subranged_type)); | |
7900 | } | |
7901 | ||
7902 | /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */ | |
7903 | LONGEST | |
d2e4a39e | 7904 | ada_modulus (struct type * type) |
14f9c5c9 | 7905 | { |
d2e4a39e | 7906 | return TYPE_HIGH_BOUND (type) + 1; |
14f9c5c9 | 7907 | } |
d2e4a39e | 7908 | \f |
14f9c5c9 AS |
7909 | |
7910 | ||
14f9c5c9 AS |
7911 | /* Operators */ |
7912 | ||
7913 | /* Table mapping opcodes into strings for printing operators | |
7914 | and precedences of the operators. */ | |
7915 | ||
d2e4a39e AS |
7916 | static const struct op_print ada_op_print_tab[] = { |
7917 | {":=", BINOP_ASSIGN, PREC_ASSIGN, 1}, | |
7918 | {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0}, | |
7919 | {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0}, | |
7920 | {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0}, | |
7921 | {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0}, | |
7922 | {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0}, | |
7923 | {"=", BINOP_EQUAL, PREC_EQUAL, 0}, | |
7924 | {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0}, | |
7925 | {"<=", BINOP_LEQ, PREC_ORDER, 0}, | |
7926 | {">=", BINOP_GEQ, PREC_ORDER, 0}, | |
7927 | {">", BINOP_GTR, PREC_ORDER, 0}, | |
7928 | {"<", BINOP_LESS, PREC_ORDER, 0}, | |
7929 | {">>", BINOP_RSH, PREC_SHIFT, 0}, | |
7930 | {"<<", BINOP_LSH, PREC_SHIFT, 0}, | |
7931 | {"+", BINOP_ADD, PREC_ADD, 0}, | |
7932 | {"-", BINOP_SUB, PREC_ADD, 0}, | |
7933 | {"&", BINOP_CONCAT, PREC_ADD, 0}, | |
7934 | {"*", BINOP_MUL, PREC_MUL, 0}, | |
7935 | {"/", BINOP_DIV, PREC_MUL, 0}, | |
7936 | {"rem", BINOP_REM, PREC_MUL, 0}, | |
7937 | {"mod", BINOP_MOD, PREC_MUL, 0}, | |
7938 | {"**", BINOP_EXP, PREC_REPEAT, 0}, | |
7939 | {"@", BINOP_REPEAT, PREC_REPEAT, 0}, | |
7940 | {"-", UNOP_NEG, PREC_PREFIX, 0}, | |
7941 | {"+", UNOP_PLUS, PREC_PREFIX, 0}, | |
7942 | {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0}, | |
7943 | {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0}, | |
7944 | {"abs ", UNOP_ABS, PREC_PREFIX, 0}, | |
7945 | {".all", UNOP_IND, PREC_SUFFIX, 1}, /* FIXME: postfix .ALL */ | |
7946 | {"'access", UNOP_ADDR, PREC_SUFFIX, 1}, /* FIXME: postfix 'ACCESS */ | |
7947 | {NULL, 0, 0, 0} | |
14f9c5c9 AS |
7948 | }; |
7949 | \f | |
7950 | /* Assorted Types and Interfaces */ | |
7951 | ||
d2e4a39e AS |
7952 | struct type *builtin_type_ada_int; |
7953 | struct type *builtin_type_ada_short; | |
7954 | struct type *builtin_type_ada_long; | |
7955 | struct type *builtin_type_ada_long_long; | |
7956 | struct type *builtin_type_ada_char; | |
7957 | struct type *builtin_type_ada_float; | |
7958 | struct type *builtin_type_ada_double; | |
7959 | struct type *builtin_type_ada_long_double; | |
7960 | struct type *builtin_type_ada_natural; | |
7961 | struct type *builtin_type_ada_positive; | |
7962 | struct type *builtin_type_ada_system_address; | |
7963 | ||
7964 | struct type **const (ada_builtin_types[]) = | |
7965 | { | |
7966 | ||
14f9c5c9 | 7967 | &builtin_type_ada_int, |
d2e4a39e AS |
7968 | &builtin_type_ada_long, |
7969 | &builtin_type_ada_short, | |
7970 | &builtin_type_ada_char, | |
7971 | &builtin_type_ada_float, | |
7972 | &builtin_type_ada_double, | |
7973 | &builtin_type_ada_long_long, | |
7974 | &builtin_type_ada_long_double, | |
7975 | &builtin_type_ada_natural, &builtin_type_ada_positive, | |
7976 | /* The following types are carried over from C for convenience. */ | |
7977 | &builtin_type_int, | |
7978 | &builtin_type_long, | |
7979 | &builtin_type_short, | |
7980 | &builtin_type_char, | |
7981 | &builtin_type_float, | |
7982 | &builtin_type_double, | |
7983 | &builtin_type_long_long, | |
7984 | &builtin_type_void, | |
7985 | &builtin_type_signed_char, | |
7986 | &builtin_type_unsigned_char, | |
7987 | &builtin_type_unsigned_short, | |
7988 | &builtin_type_unsigned_int, | |
7989 | &builtin_type_unsigned_long, | |
7990 | &builtin_type_unsigned_long_long, | |
7991 | &builtin_type_long_double, | |
7992 | &builtin_type_complex, &builtin_type_double_complex, 0}; | |
14f9c5c9 AS |
7993 | |
7994 | /* Not really used, but needed in the ada_language_defn. */ | |
d2e4a39e AS |
7995 | static void |
7996 | emit_char (int c, struct ui_file *stream, int quoter) | |
14f9c5c9 AS |
7997 | { |
7998 | ada_emit_char (c, stream, quoter, 1); | |
7999 | } | |
8000 | ||
8001 | const struct language_defn ada_language_defn = { | |
8002 | "ada", /* Language name */ | |
8003 | /* language_ada, */ | |
8004 | language_unknown, | |
8005 | /* FIXME: language_ada should be defined in defs.h */ | |
8006 | ada_builtin_types, | |
8007 | range_check_off, | |
8008 | type_check_off, | |
8009 | case_sensitive_on, /* Yes, Ada is case-insensitive, but | |
8010 | * that's not quite what this means. */ | |
8011 | ada_parse, | |
8012 | ada_error, | |
8013 | ada_evaluate_subexp, | |
8014 | ada_printchar, /* Print a character constant */ | |
8015 | ada_printstr, /* Function to print string constant */ | |
8016 | emit_char, /* Function to print single char (not used) */ | |
8017 | ada_create_fundamental_type, /* Create fundamental type in this language */ | |
8018 | ada_print_type, /* Print a type using appropriate syntax */ | |
8019 | ada_val_print, /* Print a value using appropriate syntax */ | |
8020 | ada_value_print, /* Print a top-level value */ | |
f636b87d | 8021 | NULL, /* Language specific skip_trampoline */ |
5f9a71c3 DC |
8022 | value_of_this, /* value_of_this */ |
8023 | basic_lookup_symbol_nonlocal, /* lookup_symbol_nonlocal */ | |
9a3d7dfd | 8024 | NULL, /* Language specific symbol demangler */ |
d2e4a39e | 8025 | {"", "", "", ""}, /* Binary format info */ |
14f9c5c9 | 8026 | #if 0 |
d2e4a39e AS |
8027 | {"8#%lo#", "8#", "o", "#"}, /* Octal format info */ |
8028 | {"%ld", "", "d", ""}, /* Decimal format info */ | |
8029 | {"16#%lx#", "16#", "x", "#"}, /* Hex format info */ | |
14f9c5c9 AS |
8030 | #else |
8031 | /* Copied from c-lang.c. */ | |
d2e4a39e AS |
8032 | {"0%lo", "0", "o", ""}, /* Octal format info */ |
8033 | {"%ld", "", "d", ""}, /* Decimal format info */ | |
8034 | {"0x%lx", "0x", "x", ""}, /* Hex format info */ | |
14f9c5c9 AS |
8035 | #endif |
8036 | ada_op_print_tab, /* expression operators for printing */ | |
8037 | 1, /* c-style arrays (FIXME?) */ | |
8038 | 0, /* String lower bound (FIXME?) */ | |
8039 | &builtin_type_ada_char, | |
8040 | LANG_MAGIC | |
8041 | }; | |
8042 | ||
8043 | void | |
4dc81987 | 8044 | _initialize_ada_language (void) |
14f9c5c9 AS |
8045 | { |
8046 | builtin_type_ada_int = | |
8047 | init_type (TYPE_CODE_INT, TARGET_INT_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8048 | 0, "integer", (struct objfile *) NULL); |
14f9c5c9 AS |
8049 | builtin_type_ada_long = |
8050 | init_type (TYPE_CODE_INT, TARGET_LONG_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8051 | 0, "long_integer", (struct objfile *) NULL); |
14f9c5c9 AS |
8052 | builtin_type_ada_short = |
8053 | init_type (TYPE_CODE_INT, TARGET_SHORT_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8054 | 0, "short_integer", (struct objfile *) NULL); |
14f9c5c9 AS |
8055 | builtin_type_ada_char = |
8056 | init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8057 | 0, "character", (struct objfile *) NULL); |
14f9c5c9 AS |
8058 | builtin_type_ada_float = |
8059 | init_type (TYPE_CODE_FLT, TARGET_FLOAT_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8060 | 0, "float", (struct objfile *) NULL); |
14f9c5c9 AS |
8061 | builtin_type_ada_double = |
8062 | init_type (TYPE_CODE_FLT, TARGET_DOUBLE_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8063 | 0, "long_float", (struct objfile *) NULL); |
14f9c5c9 AS |
8064 | builtin_type_ada_long_long = |
8065 | init_type (TYPE_CODE_INT, TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8066 | 0, "long_long_integer", (struct objfile *) NULL); |
14f9c5c9 AS |
8067 | builtin_type_ada_long_double = |
8068 | init_type (TYPE_CODE_FLT, TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8069 | 0, "long_long_float", (struct objfile *) NULL); |
14f9c5c9 AS |
8070 | builtin_type_ada_natural = |
8071 | init_type (TYPE_CODE_INT, TARGET_INT_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8072 | 0, "natural", (struct objfile *) NULL); |
14f9c5c9 AS |
8073 | builtin_type_ada_positive = |
8074 | init_type (TYPE_CODE_INT, TARGET_INT_BIT / TARGET_CHAR_BIT, | |
d2e4a39e | 8075 | 0, "positive", (struct objfile *) NULL); |
14f9c5c9 AS |
8076 | |
8077 | ||
d2e4a39e AS |
8078 | builtin_type_ada_system_address = |
8079 | lookup_pointer_type (init_type (TYPE_CODE_VOID, 1, 0, "void", | |
14f9c5c9 AS |
8080 | (struct objfile *) NULL)); |
8081 | TYPE_NAME (builtin_type_ada_system_address) = "system__address"; | |
8082 | ||
8083 | add_language (&ada_language_defn); | |
8084 | ||
d2e4a39e | 8085 | add_show_from_set |
14f9c5c9 | 8086 | (add_set_cmd ("varsize-limit", class_support, var_uinteger, |
d2e4a39e | 8087 | (char *) &varsize_limit, |
14f9c5c9 | 8088 | "Set maximum bytes in dynamic-sized object.", |
d2e4a39e | 8089 | &setlist), &showlist); |
14f9c5c9 AS |
8090 | varsize_limit = 65536; |
8091 | ||
8092 | add_com ("begin", class_breakpoint, begin_command, | |
8093 | "Start the debugged program, stopping at the beginning of the\n\ | |
8094 | main program. You may specify command-line arguments to give it, as for\n\ | |
8095 | the \"run\" command (q.v.)."); | |
8096 | } | |
8097 | ||
8098 | ||
8099 | /* Create a fundamental Ada type using default reasonable for the current | |
8100 | target machine. | |
8101 | ||
8102 | Some object/debugging file formats (DWARF version 1, COFF, etc) do not | |
8103 | define fundamental types such as "int" or "double". Others (stabs or | |
8104 | DWARF version 2, etc) do define fundamental types. For the formats which | |
8105 | don't provide fundamental types, gdb can create such types using this | |
8106 | function. | |
8107 | ||
8108 | FIXME: Some compilers distinguish explicitly signed integral types | |
8109 | (signed short, signed int, signed long) from "regular" integral types | |
8110 | (short, int, long) in the debugging information. There is some dis- | |
8111 | agreement as to how useful this feature is. In particular, gcc does | |
8112 | not support this. Also, only some debugging formats allow the | |
8113 | distinction to be passed on to a debugger. For now, we always just | |
8114 | use "short", "int", or "long" as the type name, for both the implicit | |
8115 | and explicitly signed types. This also makes life easier for the | |
8116 | gdb test suite since we don't have to account for the differences | |
8117 | in output depending upon what the compiler and debugging format | |
8118 | support. We will probably have to re-examine the issue when gdb | |
8119 | starts taking it's fundamental type information directly from the | |
8120 | debugging information supplied by the compiler. fnf@cygnus.com */ | |
8121 | ||
8122 | static struct type * | |
ebf56fd3 | 8123 | ada_create_fundamental_type (struct objfile *objfile, int typeid) |
14f9c5c9 AS |
8124 | { |
8125 | struct type *type = NULL; | |
8126 | ||
8127 | switch (typeid) | |
8128 | { | |
d2e4a39e AS |
8129 | default: |
8130 | /* FIXME: For now, if we are asked to produce a type not in this | |
8131 | language, create the equivalent of a C integer type with the | |
8132 | name "<?type?>". When all the dust settles from the type | |
8133 | reconstruction work, this should probably become an error. */ | |
8134 | type = init_type (TYPE_CODE_INT, | |
8135 | TARGET_INT_BIT / TARGET_CHAR_BIT, | |
8136 | 0, "<?type?>", objfile); | |
8137 | warning ("internal error: no Ada fundamental type %d", typeid); | |
8138 | break; | |
8139 | case FT_VOID: | |
8140 | type = init_type (TYPE_CODE_VOID, | |
8141 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, | |
8142 | 0, "void", objfile); | |
8143 | break; | |
8144 | case FT_CHAR: | |
8145 | type = init_type (TYPE_CODE_INT, | |
8146 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, | |
8147 | 0, "character", objfile); | |
8148 | break; | |
8149 | case FT_SIGNED_CHAR: | |
8150 | type = init_type (TYPE_CODE_INT, | |
8151 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, | |
8152 | 0, "signed char", objfile); | |
8153 | break; | |
8154 | case FT_UNSIGNED_CHAR: | |
8155 | type = init_type (TYPE_CODE_INT, | |
8156 | TARGET_CHAR_BIT / TARGET_CHAR_BIT, | |
8157 | TYPE_FLAG_UNSIGNED, "unsigned char", objfile); | |
8158 | break; | |
8159 | case FT_SHORT: | |
8160 | type = init_type (TYPE_CODE_INT, | |
8161 | TARGET_SHORT_BIT / TARGET_CHAR_BIT, | |
8162 | 0, "short_integer", objfile); | |
8163 | break; | |
8164 | case FT_SIGNED_SHORT: | |
8165 | type = init_type (TYPE_CODE_INT, | |
8166 | TARGET_SHORT_BIT / TARGET_CHAR_BIT, | |
8167 | 0, "short_integer", objfile); | |
8168 | break; | |
8169 | case FT_UNSIGNED_SHORT: | |
8170 | type = init_type (TYPE_CODE_INT, | |
8171 | TARGET_SHORT_BIT / TARGET_CHAR_BIT, | |
8172 | TYPE_FLAG_UNSIGNED, "unsigned short", objfile); | |
8173 | break; | |
8174 | case FT_INTEGER: | |
8175 | type = init_type (TYPE_CODE_INT, | |
8176 | TARGET_INT_BIT / TARGET_CHAR_BIT, | |
8177 | 0, "integer", objfile); | |
8178 | break; | |
8179 | case FT_SIGNED_INTEGER: | |
8180 | type = init_type (TYPE_CODE_INT, TARGET_INT_BIT / TARGET_CHAR_BIT, 0, "integer", objfile); /* FIXME -fnf */ | |
8181 | break; | |
8182 | case FT_UNSIGNED_INTEGER: | |
8183 | type = init_type (TYPE_CODE_INT, | |
8184 | TARGET_INT_BIT / TARGET_CHAR_BIT, | |
8185 | TYPE_FLAG_UNSIGNED, "unsigned int", objfile); | |
8186 | break; | |
8187 | case FT_LONG: | |
8188 | type = init_type (TYPE_CODE_INT, | |
8189 | TARGET_LONG_BIT / TARGET_CHAR_BIT, | |
8190 | 0, "long_integer", objfile); | |
8191 | break; | |
8192 | case FT_SIGNED_LONG: | |
8193 | type = init_type (TYPE_CODE_INT, | |
8194 | TARGET_LONG_BIT / TARGET_CHAR_BIT, | |
8195 | 0, "long_integer", objfile); | |
8196 | break; | |
8197 | case FT_UNSIGNED_LONG: | |
8198 | type = init_type (TYPE_CODE_INT, | |
8199 | TARGET_LONG_BIT / TARGET_CHAR_BIT, | |
8200 | TYPE_FLAG_UNSIGNED, "unsigned long", objfile); | |
8201 | break; | |
8202 | case FT_LONG_LONG: | |
8203 | type = init_type (TYPE_CODE_INT, | |
8204 | TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT, | |
8205 | 0, "long_long_integer", objfile); | |
8206 | break; | |
8207 | case FT_SIGNED_LONG_LONG: | |
8208 | type = init_type (TYPE_CODE_INT, | |
8209 | TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT, | |
8210 | 0, "long_long_integer", objfile); | |
8211 | break; | |
8212 | case FT_UNSIGNED_LONG_LONG: | |
8213 | type = init_type (TYPE_CODE_INT, | |
8214 | TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT, | |
8215 | TYPE_FLAG_UNSIGNED, "unsigned long long", objfile); | |
8216 | break; | |
8217 | case FT_FLOAT: | |
8218 | type = init_type (TYPE_CODE_FLT, | |
8219 | TARGET_FLOAT_BIT / TARGET_CHAR_BIT, | |
8220 | 0, "float", objfile); | |
8221 | break; | |
8222 | case FT_DBL_PREC_FLOAT: | |
8223 | type = init_type (TYPE_CODE_FLT, | |
8224 | TARGET_DOUBLE_BIT / TARGET_CHAR_BIT, | |
8225 | 0, "long_float", objfile); | |
8226 | break; | |
8227 | case FT_EXT_PREC_FLOAT: | |
8228 | type = init_type (TYPE_CODE_FLT, | |
8229 | TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT, | |
8230 | 0, "long_long_float", objfile); | |
8231 | break; | |
8232 | } | |
14f9c5c9 AS |
8233 | return (type); |
8234 | } | |
8235 | ||
d2e4a39e AS |
8236 | void |
8237 | ada_dump_symtab (struct symtab *s) | |
14f9c5c9 AS |
8238 | { |
8239 | int i; | |
8240 | fprintf (stderr, "New symtab: [\n"); | |
d2e4a39e AS |
8241 | fprintf (stderr, " Name: %s/%s;\n", |
8242 | s->dirname ? s->dirname : "?", s->filename ? s->filename : "?"); | |
14f9c5c9 AS |
8243 | fprintf (stderr, " Format: %s;\n", s->debugformat); |
8244 | if (s->linetable != NULL) | |
8245 | { | |
8246 | fprintf (stderr, " Line table (section %d):\n", s->block_line_section); | |
8247 | for (i = 0; i < s->linetable->nitems; i += 1) | |
8248 | { | |
d2e4a39e | 8249 | struct linetable_entry *e = s->linetable->item + i; |
14f9c5c9 AS |
8250 | fprintf (stderr, " %4ld: %8lx\n", (long) e->line, (long) e->pc); |
8251 | } | |
8252 | } | |
8253 | fprintf (stderr, "]\n"); | |
8254 | } |