darlinghq/darling-gdb
1
0
Fork 0
mirror of https://github.com/darlinghq/darling-gdb.git synced 2025-01-24 10:24:55 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

2012-03-01 Pedro Alves <palves@redhat.com>

Browse Source 
* ada-lang.c (ada_modulus_from_name): Delete.
	* ada-lex.l (lexer_init): Make static.
This commit is contained in:
Pedro Alves 2012-03-01 21:03:15 +00:00
parent 320b6f49d3
commit e308454991
3 changed files with 6 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gdb/ChangeLog
View File

@ -1,3 +1,8 @@
2012-03-01 Pedro Alves <palves@redhat.com>
* ada-lang.c (ada_modulus_from_name): Delete.
* ada-lex.l (lexer_init): Make static.
2012-03-01 Pedro Alves <palves@redhat.com>
PR gdb/13767

31
gdb/ada-lang.c
View File

@ -10598,37 +10598,6 @@ ada_is_modular_type (struct type *type)
&& TYPE_UNSIGNED (subranged_type));
}
/* Try to determine the lower and upper bounds of the given modular type
using the type name only. Return non-zero and set L and U as the lower
and upper bounds (respectively) if successful. */
int
ada_modulus_from_name (struct type *type, ULONGEST *modulus)
{
const char *name = ada_type_name (type);
const char *suffix;
int k;
LONGEST U;
if (name == NULL)
return 0;
/* Discrete type bounds are encoded using an __XD suffix. In our case,
we are looking for static bounds, which means an __XDLU suffix.
Moreover, we know that the lower bound of modular types is always
zero, so the actual suffix should start with "__XDLU_0__", and
then be followed by the upper bound value. */
suffix = strstr (name, "__XDLU_0__");
if (suffix == NULL)
return 0;
k = 10;
if (!ada_scan_number (suffix, k, &U, NULL))
return 0;
*modulus = (ULONGEST) U + 1;
return 1;
}
/* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
ULONGEST

2
gdb/ada-lex.l
View File

@ -293,7 +293,7 @@ false { return FALSEKEYWORD; }
/* Initialize the lexer for processing new expression. */
void
static void
lexer_init (FILE *inp)
{
BEGIN INITIAL;