higepi
/
Projet_SETI_RISC-V
2
2
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'main'
${ noResults }
Projet_SETI_RISC-V/riscv-gnu-toolchain/build-gdb-newlib/gdb/ada-lex.c

2987 lines
88 KiB
C
Raw Permalink Blame History

#line 3 "<stdout>"
#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 6
#define YY_FLEX_SUBMINOR_VERSION 4
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif
/* First, we deal with platform-specific or compiler-specific issues. */
/* begin standard C headers. */
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
/* end standard C headers. */
/* flex integer type definitions */
#ifndef FLEXINT_H
#define FLEXINT_H
/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
* if you want the limit (max/min) macros for int types.
*/
#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS 1
#endif
#include <inttypes.h>
typedef int8_t flex_int8_t;
typedef uint8_t flex_uint8_t;
typedef int16_t flex_int16_t;
typedef uint16_t flex_uint16_t;
typedef int32_t flex_int32_t;
typedef uint32_t flex_uint32_t;
#else
typedef signed char flex_int8_t;
typedef short int flex_int16_t;
typedef int flex_int32_t;
typedef unsigned char flex_uint8_t;
typedef unsigned short int flex_uint16_t;
typedef unsigned int flex_uint32_t;
/* Limits of integral types. */
#ifndef INT8_MIN
#define INT8_MIN (-128)
#endif
#ifndef INT16_MIN
#define INT16_MIN (-32767-1)
#endif
#ifndef INT32_MIN
#define INT32_MIN (-2147483647-1)
#endif
#ifndef INT8_MAX
#define INT8_MAX (127)
#endif
#ifndef INT16_MAX
#define INT16_MAX (32767)
#endif
#ifndef INT32_MAX
#define INT32_MAX (2147483647)
#endif
#ifndef UINT8_MAX
#define UINT8_MAX (255U)
#endif
#ifndef UINT16_MAX
#define UINT16_MAX (65535U)
#endif
#ifndef UINT32_MAX
#define UINT32_MAX (4294967295U)
#endif
#ifndef SIZE_MAX
#define SIZE_MAX (~(size_t)0)
#endif
#endif /* ! C99 */
#endif /* ! FLEXINT_H */
/* begin standard C++ headers. */
/* TODO: this is always defined, so inline it */
#define yyconst const
#if defined(__GNUC__) && __GNUC__ >= 3
#define yynoreturn __attribute__((__noreturn__))
#else
#define yynoreturn
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an
* integer in range [0..255] for use as an array index.
*/
#define YY_SC_TO_UI(c) ((YY_CHAR) (c))
/* Enter a start condition. This macro really ought to take a parameter,
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
#define BEGIN (yy_start) = 1 + 2 *
/* Translate the current start state into a value that can be later handed
* to BEGIN to return to the state. The YYSTATE alias is for lex
* compatibility.
*/
#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE yyrestart( yyin )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k.
* Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
* Ditto for the __ia64__ case accordingly.
*/
#define YY_BUF_SIZE 32768
#else
#define YY_BUF_SIZE 16384
#endif /* __ia64__ */
#endif
/* The state buf must be large enough to hold one state per character in the main buffer.
*/
#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
#endif
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef size_t yy_size_t;
#endif
extern int yyleng;
extern FILE *yyin, *yyout;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
#define YY_LESS_LINENO(n)
#define YY_LINENO_REWIND_TO(ptr)
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
*yy_cp = (yy_hold_char); \
YY_RESTORE_YY_MORE_OFFSET \
(yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, (yytext_ptr) )
#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
FILE *yy_input_file;
char *yy_ch_buf; /* input buffer */
char *yy_buf_pos; /* current position in input buffer */
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
int yy_buf_size;
/* Number of characters read into yy_ch_buf, not including EOB
* characters.
*/
int yy_n_chars;
/* Whether we "own" the buffer - i.e., we know we created it,
* and can xrealloc() it to grow it, and should xfree() it to
* delete it.
*/
int yy_is_our_buffer;
/* Whether this is an "interactive" input source; if so, and
* if we're using stdio for input, then we want to use getc()
* instead of fread(), to make sure we stop fetching input after
* each newline.
*/
int yy_is_interactive;
/* Whether we're considered to be at the beginning of a line.
* If so, '^' rules will be active on the next match, otherwise
* not.
*/
int yy_at_bol;
int yy_bs_lineno; /**< The line count. */
int yy_bs_column; /**< The column count. */
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
* then we mark the buffer as YY_EOF_PENDING, to indicate that we
* shouldn't try reading from the input source any more. We might
* still have a bunch of tokens to match, though, because of
* possible backing-up.
*
* When we actually see the EOF, we change the status to "new"
* (via yyrestart()), so that the user can continue scanning by
* just pointing yyin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* Stack of input buffers. */
static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
static YY_BUFFER_STATE * yy_buffer_stack = NULL; /**< Stack as an array. */
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
*
* Returns the top of the stack, or NULL.
*/
#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
? (yy_buffer_stack)[(yy_buffer_stack_top)] \
: NULL)
/* Same as previous macro, but useful when we know that the buffer stack is not
* NULL or when we need an lvalue. For internal use only.
*/
#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
/* yy_hold_char holds the character lost when yytext is formed. */
static char yy_hold_char;
static int yy_n_chars; /* number of characters read into yy_ch_buf */
int yyleng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = NULL;
static int yy_init = 0; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow yywrap()'s to do buffer switches
* instead of setting up a fresh yyin. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void yyrestart ( FILE *input_file );
void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer );
YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size );
void yy_delete_buffer ( YY_BUFFER_STATE b );
void yy_flush_buffer ( YY_BUFFER_STATE b );
void yypush_buffer_state ( YY_BUFFER_STATE new_buffer );
void yypop_buffer_state ( void );
static void yyensure_buffer_stack ( void );
static void yy_load_buffer_state ( void );
static void yy_init_buffer ( YY_BUFFER_STATE b, FILE *file );
#define YY_FLUSH_BUFFER yy_flush_buffer( YY_CURRENT_BUFFER )
YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size );
YY_BUFFER_STATE yy_scan_string ( const char *yy_str );
YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len );
void *yyalloc ( yy_size_t );
void *yyxrealloc ( void *, yy_size_t );
void yyfree ( void * );
#define yy_new_buffer yy_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! YY_CURRENT_BUFFER ){ \
yyensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
yy_create_buffer( yyin, YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! YY_CURRENT_BUFFER ){\
yyensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
yy_create_buffer( yyin, YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
/* Begin user sect3 */
#define yywrap() (/*CONSTCOND*/1)
#define YY_SKIP_YYWRAP
typedef flex_uint8_t YY_CHAR;
FILE *yyin = NULL, *yyout = NULL;
typedef int yy_state_type;
extern int yylineno;
int yylineno = 1;
extern char *yytext;
#ifdef yytext_ptr
#undef yytext_ptr
#endif
#define yytext_ptr yytext
static yy_state_type yy_get_previous_state ( void );
static yy_state_type yy_try_NUL_trans ( yy_state_type current_state );
static int yy_get_next_buffer ( void );
static void yynoreturn yy_fatal_error ( const char* msg );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up yytext.
*/
#define YY_DO_BEFORE_ACTION \
(yytext_ptr) = yy_bp; \
yyleng = (int) (yy_cp - yy_bp); \
(yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
(yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 55
#define YY_END_OF_BUFFER 56
/* This struct is not used in this scanner,
but its presence is necessary. */
struct yy_trans_info
{
flex_int32_t yy_verify;
flex_int32_t yy_nxt;
};
static const flex_int16_t yy_accept[217] =
{ 0,
0, 0, 0, 0, 56, 54, 1, 1, 15, 53,
43, 54, 45, 46, 43, 44, 43, 43, 43, 4,
4, 43, 43, 43, 43, 52, 49, 49, 49, 49,
49, 49, 49, 49, 49, 49, 49, 42, 0, 14,
0, 53, 0, 0, 0, 0, 0, 0, 0, 37,
2, 0, 36, 0, 48, 48, 39, 0, 0, 4,
0, 0, 0, 0, 51, 38, 40, 0, 35, 41,
0, 0, 49, 0, 49, 49, 49, 49, 49, 16,
22, 49, 49, 49, 49, 27, 49, 49, 49, 49,
49, 49, 0, 14, 0, 12, 12, 34, 0, 2,
0, 48, 48, 0, 9, 0, 3, 0, 0, 7,
0, 49, 0, 0, 0, 49, 19, 20, 49, 49,
23, 24, 25, 49, 49, 29, 49, 49, 49, 49,
31, 0, 0, 0, 0, 0, 0, 48, 47, 6,
0, 0, 9, 0, 3, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 49, 21,
49, 26, 49, 17, 30, 49, 32, 0, 0, 50,
0, 0, 0, 0, 6, 0, 49, 0, 0, 0,
0, 0, 0, 0, 0, 33, 49, 49, 0, 0,
0, 0, 5, 11, 0, 8, 0, 0, 0, 0,
0, 0, 28, 49, 0, 5, 0, 8, 0, 0,
13, 0, 18, 10, 10, 0
} ;
static const YY_CHAR yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 4, 5, 6, 7, 8, 5, 9, 10, 11,
12, 13, 14, 15, 16, 17, 18, 19, 20, 20,
20, 20, 20, 20, 20, 20, 20, 21, 22, 23,
24, 25, 5, 26, 27, 28, 29, 30, 31, 32,
33, 34, 35, 33, 36, 37, 38, 39, 40, 33,
33, 41, 42, 43, 44, 33, 45, 46, 33, 33,
47, 5, 48, 5, 49, 5, 50, 51, 29, 52,
53, 54, 33, 55, 56, 33, 57, 58, 59, 60,
61, 33, 33, 62, 63, 64, 65, 33, 66, 67,
33, 33, 26, 22, 26, 5, 1, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68, 68, 68, 68, 68, 68,
68, 68, 68, 68, 68
} ;
static const YY_CHAR yy_meta[69] =
{ 0,
1, 2, 3, 4, 5, 6, 7, 8, 5, 9,
5, 5, 5, 5, 5, 5, 10, 5, 11, 11,
5, 5, 12, 13, 14, 5, 15, 15, 15, 15,
15, 15, 16, 16, 16, 16, 16, 16, 16, 16,
16, 16, 16, 16, 16, 16, 5, 5, 17, 15,
15, 15, 15, 15, 16, 16, 16, 16, 16, 16,
16, 16, 16, 16, 16, 16, 16, 18
} ;
static const flex_int16_t yy_base[242] =
{ 0,
0, 0, 665, 662, 667, 1332, 1332, 1332, 63, 0,
1332, 110, 1332, 1332, 653, 1332, 648, 177, 636, 221,
24, 50, 635, 632, 625, 1332, 182, 73, 185, 209,
244, 247, 307, 282, 41, 371, 42, 433, 176, 1332,
177, 0, 637, 629, 618, 612, 609, 501, 74, 1332,
0, 212, 1332, 0, 41, 0, 1332, 0, 68, 33,
78, 606, 223, 0, 1332, 1332, 1332, 575, 1332, 1332,
203, 303, 1332, 291, 324, 352, 333, 380, 568, 376,
397, 571, 580, 589, 592, 400, 580, 614, 634, 627,
625, 593, 588, 583, 269, 298, 1332, 577, 688, 0,
561, 0, 159, 184, 643, 85, 296, 0, 171, 0,
554, 719, 681, 734, 0, 752, 761, 787, 767, 806,
823, 827, 832, 843, 810, 855, 864, 874, 842, 858,
912, 426, 0, 327, 410, 916, 398, 1332, 0, 177,
0, 227, 675, 249, 338, 409, 405, 83, 272, 297,
316, 367, 157, 205, 227, 178, 251, 384, 922, 947,
921, 973, 726, 977, 989, 961, 1005, 348, 360, 1332,
1018, 345, 354, 89, 1332, 345, 1010, 276, 319, 337,
289, 336, 332, 351, 308, 1015, 1049, 1026, 263, 567,
0, 357, 584, 377, 249, 591, 231, 226, 192, 187,
184, 95, 1071, 1080, 83, 651, 266, 682, 783, 1083,
709, 400, 1332, 763, 794, 1332, 1109, 1119, 1135, 1140,
1156, 1174, 1192, 1196, 1203, 413, 414, 1211, 1227, 1239,
1244, 1255, 565, 1258, 1274, 597, 630, 1286, 1293, 1305,
1314
} ;
static const flex_int16_t yy_def[242] =
{ 0,
216, 1, 1, 1, 216, 216, 216, 216, 217, 218,
216, 216, 216, 216, 216, 216, 216, 219, 216, 216,
20, 216, 220, 216, 216, 216, 221, 221, 221, 221,
221, 221, 221, 221, 33, 221, 33, 216, 217, 216,
217, 218, 222, 38, 38, 222, 216, 216, 222, 216,
223, 219, 216, 224, 225, 225, 216, 226, 216, 20,
216, 216, 216, 227, 216, 216, 216, 228, 216, 216,
216, 216, 216, 229, 221, 221, 221, 221, 221, 221,
221, 221, 221, 221, 221, 221, 36, 221, 221, 36,
33, 36, 48, 230, 216, 216, 216, 48, 222, 223,
231, 225, 225, 232, 216, 216, 216, 233, 216, 227,
228, 216, 229, 216, 234, 235, 221, 221, 33, 221,
221, 221, 221, 221, 33, 221, 221, 221, 33, 33,
221, 216, 236, 216, 216, 99, 231, 216, 225, 216,
237, 232, 216, 216, 216, 238, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 239, 235, 221,
33, 221, 36, 221, 221, 36, 221, 216, 240, 216,
99, 216, 241, 216, 216, 238, 216, 216, 216, 216,
216, 216, 216, 216, 239, 221, 221, 221, 240, 222,
171, 216, 216, 216, 241, 216, 216, 216, 216, 216,
216, 216, 221, 221, 222, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 0, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216
} ;
static const flex_int16_t yy_nxt[1401] =
{ 0,
6, 7, 8, 7, 6, 9, 6, 10, 11, 12,
13, 14, 15, 11, 16, 17, 18, 19, 20, 21,
22, 11, 23, 24, 25, 26, 27, 28, 28, 28,
29, 30, 28, 28, 31, 28, 28, 32, 33, 34,
35, 28, 36, 28, 28, 37, 11, 11, 28, 27,
28, 28, 29, 30, 28, 31, 28, 28, 32, 33,
34, 35, 28, 36, 28, 28, 37, 6, 40, 216,
65, 88, 75, 66, 71, 71, 72, 103, 216, 99,
75, 92, 73, 96, 75, 75, 105, 105, 177, 74,
216, 106, 211, 88, 75, 147, 107, 107, 103, 216,
177, 75, 92, 107, 107, 75, 75, 196, 196, 41,
43, 44, 44, 45, 46, 46, 46, 46, 46, 47,
46, 46, 46, 46, 46, 46, 46, 46, 46, 46,
46, 46, 46, 46, 46, 46, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 49, 46, 46, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 43, 52, 52,
52, 40, 94, 71, 71, 72, 71, 71, 72, 177,
140, 73, 177, 53, 73, 139, 180, 177, 74, 54,
141, 74, 62, 55, 71, 71, 71, 172, 183, 76,
71, 71, 72, 52, 52, 52, 139, 180, 73, 74,
77, 78, 41, 41, 62, 74, 55, 58, 216, 172,
183, 177, 76, 140, 54, 79, 177, 59, 55, 60,
60, 77, 78, 141, 181, 71, 71, 72, 71, 71,
72, 61, 62, 73, 62, 194, 73, 63, 79, 109,
74, 55, 174, 74, 174, 181, 64, 182, 168, 60,
134, 134, 134, 61, 62, 80, 62, 177, 63, 212,
109, 212, 81, 71, 71, 72, 82, 64, 182, 135,
184, 73, 113, 113, 113, 147, 114, 80, 74, 134,
134, 134, 177, 81, 71, 71, 72, 82, 71, 71,
72, 184, 73, 115, 145, 145, 73, 197, 135, 74,
147, 177, 86, 74, 87, 71, 71, 72, 134, 134,
134, 200, 177, 73, 71, 71, 72, 83, 197, 147,
74, 177, 73, 86, 145, 87, 84, 135, 198, 74,
85, 175, 200, 71, 71, 72, 145, 145, 192, 83,
194, 73, 118, 193, 193, 168, 199, 84, 74, 201,
198, 85, 71, 71, 72, 193, 193, 71, 71, 72,
73, 71, 71, 72, 118, 73, 145, 74, 199, 73,
201, 202, 74, 117, 178, 39, 74, 89, 71, 71,
72, 71, 71, 72, 90, 179, 73, 207, 177, 73,
177, 91, 202, 74, 117, 175, 74, 178, 214, 214,
89, 119, 138, 104, 110, 90, 179, 104, 110, 207,
170, 168, 91, 43, 44, 44, 44, 43, 43, 43,
43, 43, 119, 43, 43, 43, 43, 43, 43, 43,
43, 43, 43, 43, 43, 43, 43, 43, 43, 93,
93, 93, 93, 93, 93, 93, 93, 93, 93, 93,
93, 93, 93, 93, 93, 93, 93, 93, 93, 43,
43, 43, 93, 93, 93, 93, 93, 93, 93, 93,
93, 93, 93, 93, 93, 93, 93, 93, 93, 93,
43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
96, 43, 43, 43, 43, 43, 43, 43, 43, 43,
43, 43, 43, 43, 43, 43, 43, 98, 98, 98,
98, 98, 98, 98, 98, 98, 98, 98, 98, 98,
98, 98, 98, 98, 98, 98, 98, 43, 43, 98,
98, 98, 98, 98, 98, 98, 98, 98, 98, 98,
98, 98, 98, 98, 98, 98, 98, 98, 43, 71,
71, 72, 71, 71, 72, 146, 95, 73, 112, 146,
73, 71, 71, 72, 74, 138, 95, 74, 132, 73,
71, 71, 72, 71, 71, 72, 74, 95, 73, 112,
121, 73, 206, 206, 120, 74, 75, 169, 74, 208,
208, 169, 108, 125, 205, 71, 71, 72, 97, 75,
75, 96, 121, 73, 122, 120, 75, 96, 124, 75,
74, 123, 206, 131, 125, 71, 71, 72, 95, 208,
173, 75, 75, 73, 173, 122, 95, 75, 70, 124,
74, 126, 123, 75, 131, 75, 69, 128, 67, 57,
75, 143, 143, 51, 75, 50, 216, 129, 130, 206,
206, 38, 126, 144, 38, 127, 75, 75, 216, 128,
216, 75, 113, 113, 113, 75, 114, 216, 129, 130,
216, 143, 216, 143, 143, 144, 127, 95, 216, 206,
208, 208, 216, 115, 216, 144, 136, 136, 216, 216,
134, 134, 134, 216, 136, 136, 136, 136, 136, 136,
71, 71, 72, 143, 216, 216, 216, 144, 73, 135,
208, 216, 216, 216, 216, 74, 216, 136, 136, 136,
136, 136, 147, 216, 216, 216, 148, 147, 216, 147,
216, 149, 75, 71, 71, 72, 150, 147, 151, 75,
152, 73, 71, 71, 72, 216, 187, 216, 74, 216,
73, 153, 154, 155, 156, 75, 216, 74, 216, 157,
75, 215, 215, 152, 209, 209, 209, 187, 71, 71,
72, 216, 153, 154, 155, 156, 73, 160, 216, 74,
157, 213, 213, 74, 216, 216, 75, 71, 71, 72,
75, 215, 215, 215, 216, 73, 216, 216, 216, 160,
216, 216, 74, 216, 71, 71, 72, 75, 71, 71,
72, 75, 73, 71, 71, 72, 73, 216, 216, 74,
163, 73, 215, 74, 71, 71, 72, 161, 74, 75,
216, 216, 73, 75, 216, 216, 71, 71, 72, 74,
216, 216, 163, 216, 73, 71, 71, 72, 161, 216,
75, 74, 166, 73, 75, 71, 71, 72, 216, 162,
74, 75, 216, 73, 216, 75, 216, 216, 167, 216,
74, 216, 216, 216, 166, 216, 216, 75, 216, 164,
162, 75, 75, 216, 216, 216, 75, 216, 216, 216,
167, 216, 165, 71, 71, 72, 216, 216, 75, 216,
164, 73, 75, 71, 71, 72, 216, 216, 74, 216,
216, 73, 216, 165, 171, 171, 216, 216, 74, 216,
216, 216, 171, 171, 171, 171, 171, 171, 71, 71,
72, 186, 216, 216, 216, 216, 73, 216, 216, 216,
75, 216, 216, 74, 75, 171, 171, 171, 171, 171,
216, 216, 216, 186, 71, 71, 72, 216, 71, 71,
72, 75, 73, 216, 216, 75, 73, 188, 216, 74,
71, 71, 72, 74, 75, 216, 216, 216, 73, 216,
216, 75, 216, 216, 216, 74, 71, 71, 72, 216,
188, 71, 71, 72, 73, 75, 71, 71, 72, 73,
216, 74, 75, 190, 73, 216, 74, 71, 71, 72,
216, 74, 216, 216, 216, 73, 191, 191, 216, 216,
216, 216, 74, 216, 191, 191, 191, 191, 191, 191,
71, 71, 72, 216, 216, 204, 216, 216, 73, 216,
216, 216, 216, 216, 216, 74, 216, 191, 191, 191,
191, 191, 71, 71, 72, 216, 216, 204, 216, 216,
73, 209, 209, 210, 209, 209, 210, 74, 216, 73,
203, 216, 73, 216, 216, 216, 74, 216, 216, 74,
216, 213, 213, 216, 216, 216, 216, 216, 216, 216,
216, 203, 39, 39, 39, 39, 39, 39, 39, 39,
39, 39, 39, 39, 39, 39, 42, 216, 216, 42,
216, 216, 216, 42, 42, 42, 56, 56, 56, 216,
216, 216, 216, 216, 56, 216, 56, 216, 216, 56,
56, 56, 68, 216, 68, 68, 68, 75, 75, 75,
216, 216, 216, 216, 75, 75, 75, 216, 216, 216,
75, 75, 75, 75, 43, 43, 43, 43, 43, 43,
43, 43, 43, 43, 43, 43, 43, 43, 43, 43,
43, 43, 100, 100, 216, 100, 100, 100, 100, 100,
100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
101, 101, 101, 102, 216, 216, 216, 102, 102, 102,
102, 111, 216, 216, 111, 111, 111, 111, 116, 116,
116, 216, 116, 216, 216, 216, 216, 216, 116, 216,
216, 116, 116, 116, 133, 216, 216, 216, 216, 133,
216, 216, 216, 133, 137, 216, 216, 137, 137, 137,
137, 142, 216, 216, 142, 142, 216, 216, 216, 142,
216, 142, 158, 158, 158, 159, 159, 159, 216, 216,
216, 216, 159, 159, 159, 216, 216, 216, 159, 159,
159, 159, 176, 216, 216, 216, 176, 216, 216, 216,
176, 216, 176, 185, 216, 216, 185, 185, 185, 185,
189, 216, 216, 216, 216, 189, 216, 216, 216, 189,
195, 216, 216, 216, 195, 216, 216, 216, 195, 216,
195, 5, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216
} ;
static const flex_int16_t yy_chk[1401] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 9, 21,
22, 35, 37, 22, 28, 28, 28, 55, 60, 49,
35, 37, 28, 49, 35, 37, 59, 59, 148, 28,
21, 61, 205, 35, 37, 148, 61, 61, 55, 60,
202, 35, 37, 106, 106, 35, 37, 174, 174, 9,
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12, 18, 18,
18, 39, 41, 27, 27, 27, 29, 29, 29, 201,
104, 27, 200, 18, 29, 103, 153, 199, 27, 18,
104, 29, 109, 18, 71, 71, 71, 140, 156, 27,
30, 30, 30, 52, 52, 52, 103, 153, 30, 71,
27, 29, 39, 41, 109, 30, 18, 20, 52, 140,
156, 198, 27, 142, 52, 30, 197, 20, 52, 20,
20, 27, 29, 142, 154, 31, 31, 31, 32, 32,
32, 20, 20, 31, 63, 195, 32, 20, 30, 63,
31, 52, 144, 32, 144, 154, 20, 155, 189, 20,
95, 95, 95, 20, 20, 31, 63, 149, 20, 207,
63, 207, 31, 34, 34, 34, 32, 20, 155, 95,
157, 34, 74, 74, 74, 149, 74, 31, 34, 96,
96, 96, 150, 31, 72, 72, 72, 32, 33, 33,
33, 157, 72, 74, 107, 107, 33, 178, 96, 72,
150, 151, 34, 33, 34, 75, 75, 75, 134, 134,
134, 181, 185, 75, 77, 77, 77, 33, 178, 151,
75, 182, 77, 34, 107, 34, 33, 134, 179, 77,
33, 176, 181, 76, 76, 76, 145, 145, 172, 33,
173, 76, 77, 172, 172, 169, 180, 33, 76, 183,
179, 33, 36, 36, 36, 192, 192, 80, 80, 80,
36, 78, 78, 78, 77, 80, 145, 36, 180, 78,
183, 184, 80, 76, 152, 168, 78, 36, 81, 81,
81, 86, 86, 86, 36, 152, 81, 194, 158, 86,
147, 36, 184, 81, 76, 146, 86, 152, 212, 212,
36, 78, 137, 226, 227, 36, 152, 226, 227, 194,
135, 132, 36, 38, 38, 38, 38, 38, 38, 38,
38, 38, 78, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 38, 38, 38, 38, 38, 38, 38, 38, 38,
38, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48,
48, 48, 48, 48, 48, 48, 48, 48, 48, 79,
79, 79, 82, 82, 82, 233, 190, 79, 111, 233,
82, 83, 83, 83, 79, 101, 98, 82, 94, 83,
84, 84, 84, 85, 85, 85, 83, 93, 84, 68,
82, 85, 193, 193, 79, 84, 87, 236, 85, 196,
196, 236, 62, 87, 190, 88, 88, 88, 47, 92,
87, 46, 82, 88, 83, 79, 92, 45, 85, 87,
88, 84, 193, 92, 87, 89, 89, 89, 44, 196,
237, 87, 92, 89, 237, 83, 43, 92, 25, 85,
89, 88, 84, 90, 92, 91, 24, 90, 23, 19,
90, 105, 105, 17, 91, 15, 5, 90, 91, 206,
206, 4, 88, 105, 3, 89, 90, 91, 0, 90,
0, 90, 113, 113, 113, 91, 113, 0, 90, 91,
0, 105, 0, 143, 143, 105, 89, 99, 0, 206,
208, 208, 0, 113, 0, 143, 99, 99, 0, 0,
211, 211, 211, 0, 99, 99, 99, 99, 99, 99,
112, 112, 112, 143, 0, 0, 0, 143, 112, 211,
208, 0, 0, 0, 0, 112, 0, 99, 99, 99,
99, 99, 114, 0, 0, 0, 114, 114, 0, 114,
0, 114, 163, 116, 116, 116, 114, 114, 114, 163,
114, 116, 117, 117, 117, 0, 163, 0, 116, 0,
117, 114, 114, 114, 114, 163, 0, 117, 0, 114,
163, 214, 214, 114, 209, 209, 209, 163, 118, 118,
118, 0, 114, 114, 114, 114, 118, 119, 0, 209,
114, 209, 209, 118, 0, 0, 119, 120, 120, 120,
119, 214, 215, 215, 0, 120, 0, 0, 0, 119,
0, 0, 120, 0, 121, 121, 121, 119, 122, 122,
122, 119, 121, 123, 123, 123, 122, 0, 0, 121,
125, 123, 215, 122, 124, 124, 124, 120, 123, 125,
0, 0, 124, 125, 0, 0, 126, 126, 126, 124,
0, 0, 125, 0, 126, 127, 127, 127, 120, 0,
125, 126, 129, 127, 125, 128, 128, 128, 0, 124,
127, 129, 0, 128, 0, 129, 0, 0, 130, 0,
128, 0, 0, 0, 129, 0, 0, 130, 0, 127,
124, 130, 129, 0, 0, 0, 129, 0, 0, 0,
130, 0, 128, 131, 131, 131, 0, 0, 130, 0,
127, 131, 130, 159, 159, 159, 0, 0, 131, 0,
0, 159, 0, 128, 136, 136, 0, 0, 159, 0,
0, 0, 136, 136, 136, 136, 136, 136, 160, 160,
160, 161, 0, 0, 0, 0, 160, 0, 0, 0,
161, 0, 0, 160, 161, 136, 136, 136, 136, 136,
0, 0, 0, 161, 162, 162, 162, 0, 164, 164,
164, 161, 162, 0, 0, 161, 164, 166, 0, 162,
165, 165, 165, 164, 166, 0, 0, 0, 165, 0,
0, 166, 0, 0, 0, 165, 167, 167, 167, 0,
166, 177, 177, 177, 167, 166, 186, 186, 186, 177,
0, 167, 166, 171, 186, 0, 177, 188, 188, 188,
0, 186, 0, 0, 0, 188, 171, 171, 0, 0,
0, 0, 188, 0, 171, 171, 171, 171, 171, 171,
187, 187, 187, 0, 0, 188, 0, 0, 187, 0,
0, 0, 0, 0, 0, 187, 0, 171, 171, 171,
171, 171, 203, 203, 203, 0, 0, 188, 0, 0,
203, 204, 204, 204, 210, 210, 210, 203, 0, 204,
187, 0, 210, 0, 0, 0, 204, 0, 0, 210,
0, 210, 210, 0, 0, 0, 0, 0, 0, 0,
0, 187, 217, 217, 217, 217, 217, 217, 217, 217,
217, 217, 217, 217, 217, 217, 218, 0, 0, 218,
0, 0, 0, 218, 218, 218, 219, 219, 219, 0,
0, 0, 0, 0, 219, 0, 219, 0, 0, 219,
219, 219, 220, 0, 220, 220, 220, 221, 221, 221,
0, 0, 0, 0, 221, 221, 221, 0, 0, 0,
221, 221, 221, 221, 222, 222, 222, 222, 222, 222,
222, 222, 222, 222, 222, 222, 222, 222, 222, 222,
222, 222, 223, 223, 0, 223, 223, 223, 223, 223,
223, 223, 223, 223, 223, 223, 223, 223, 223, 223,
224, 224, 224, 225, 0, 0, 0, 225, 225, 225,
225, 228, 0, 0, 228, 228, 228, 228, 229, 229,
229, 0, 229, 0, 0, 0, 0, 0, 229, 0,
0, 229, 229, 229, 230, 0, 0, 0, 0, 230,
0, 0, 0, 230, 231, 0, 0, 231, 231, 231,
231, 232, 0, 0, 232, 232, 0, 0, 0, 232,
0, 232, 234, 234, 234, 235, 235, 235, 0, 0,
0, 0, 235, 235, 235, 0, 0, 0, 235, 235,
235, 235, 238, 0, 0, 0, 238, 0, 0, 0,
238, 0, 238, 239, 0, 0, 239, 239, 239, 239,
240, 0, 0, 0, 0, 240, 0, 0, 0, 240,
241, 0, 0, 0, 241, 0, 0, 0, 241, 0,
241, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216,
216, 216, 216, 216, 216, 216, 216, 216, 216, 216
} ;
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
extern int yy_flex_debug;
int yy_flex_debug = 0;
/* The intent behind this definition is that it'll catch
* any uses of REJECT which flex missed.
*/
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *yytext;
#line 1 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
/* FLEX lexer for Ada expressions, for GDB. -*- c++ -*-
Copyright (C) 1994-2022 Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/*----------------------------------------------------------------------*/
/* The converted version of this file is to be included in ada-exp.y, */
/* the Ada parser for gdb. The function yylex obtains characters from */
/* the global pointer lexptr. It returns a syntactic category for */
/* each successive token and places a semantic value into yylval */
/* (ada-lval), defined by the parser. */
#line 43 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
#include "diagnostics.h"
/* Some old versions of flex generate code that uses the "register" keyword,
which clang warns about. This was observed for example with flex 2.5.35,
as shipped with macOS 10.12. The same happens with flex 2.5.37 and g++ 11
which defaults to ISO C++17, that does not allow register storage class
specifiers. */
DIAGNOSTIC_PUSH
DIAGNOSTIC_IGNORE_DEPRECATED_REGISTER
#define NUMERAL_WIDTH 256
#define LONGEST_SIGN ((ULONGEST) 1 << (sizeof(LONGEST) * HOST_CHAR_BIT - 1))
/* Temporary staging for numeric literals. */
static char numbuf[NUMERAL_WIDTH];
static void canonicalizeNumeral (char *s1, const char *);
static struct stoken processString (const char*, int);
static int processInt (struct parser_state *, const char *, const char *,
const char *);
static int processReal (struct parser_state *, const char *);
static struct stoken processId (const char *, int);
static int processAttribute (const char *);
static int find_dot_all (const char *);
static void rewind_to_char (int);
#undef YY_DECL
#define YY_DECL static int yylex ( void )
/* Flex generates a static function "input" which is not used.
Defining YY_NO_INPUT comments it out. */
#define YY_NO_INPUT
#undef YY_INPUT
#define YY_INPUT(BUF, RESULT, MAX_SIZE) \
if ( *pstate->lexptr == '\000' ) \
(RESULT) = YY_NULL; \
else \
{ \
*(BUF) = *pstate->lexptr; \
(RESULT) = 1; \
pstate->lexptr += 1; \
}
static int find_dot_all (const char *);
/* Depth of parentheses. */
static int paren_depth;
#line 904 "<stdout>"
#line 906 "<stdout>"
#define INITIAL 0
#define BEFORE_QUAL_QUOTE 1
#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
* down here because we want the user's section 1 to have been scanned first.
* The user has a chance to override it with an option.
*/
#include <unistd.h>
#endif
#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif
static int yy_init_globals ( void );
/* Accessor methods to globals.
These are made visible to non-reentrant scanners for convenience. */
int yylex_destroy ( void );
int yyget_debug ( void );
void yyset_debug ( int debug_flag );
YY_EXTRA_TYPE yyget_extra ( void );
void yyset_extra ( YY_EXTRA_TYPE user_defined );
FILE *yyget_in ( void );
void yyset_in ( FILE * _in_str );
FILE *yyget_out ( void );
void yyset_out ( FILE * _out_str );
int yyget_leng ( void );
char *yyget_text ( void );
int yyget_lineno ( void );
void yyset_lineno ( int _line_number );
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int yywrap ( void );
#else
extern int yywrap ( void );
#endif
#endif
#ifndef YY_NO_UNPUT
static void yyunput ( int c, char *buf_ptr );
#endif
#ifndef yytext_ptr
static void yy_flex_strncpy ( char *, const char *, int );
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen ( const char * );
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput ( void );
#else
static int input ( void );
#endif
#endif
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k */
#define YY_READ_BUF_SIZE 16384
#else
#define YY_READ_BUF_SIZE 8192
#endif /* __ia64__ */
#endif
/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO do { if (fwrite( yytext, (size_t) yyleng, 1, yyout )) {} } while (0)
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
int n; \
for ( n = 0; n < max_size && \
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( yyin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else \
{ \
errno=0; \
while ( (result = (int) fread(buf, 1, (yy_size_t) max_size, yyin)) == 0 && ferror(yyin)) \
{ \
if( errno != EINTR) \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
clearerr(yyin); \
} \
}\
\
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
* we don't want an extra ';' after the "return" because that will cause
* some compilers to complain about unreachable statements.
*/
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
/* end tables serialization structures and prototypes */
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL_IS_OURS 1
extern int yylex (void);
#define YY_DECL int yylex (void)
#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after yytext and yyleng
* have been set up.
*/
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif
/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK /*LINTED*/break;
#endif
#define YY_RULE_SETUP \
YY_USER_ACTION
/** The main scanner function which does all the work.
*/
YY_DECL
{
yy_state_type yy_current_state;
char *yy_cp, *yy_bp;
int yy_act;
if ( !(yy_init) )
{
(yy_init) = 1;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! (yy_start) )
(yy_start) = 1; /* first start state */
if ( ! yyin )
yyin = stdin;
if ( ! yyout )
yyout = stdout;
if ( ! YY_CURRENT_BUFFER ) {
yyensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
yy_create_buffer( yyin, YY_BUF_SIZE );
}
yy_load_buffer_state( );
}
{
#line 98 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
#line 1127 "<stdout>"
while ( /*CONSTCOND*/1 ) /* loops until end-of-file is reached */
{
yy_cp = (yy_c_buf_p);
/* Support of yytext. */
*yy_cp = (yy_hold_char);
/* yy_bp points to the position in yy_ch_buf of the start of
* the current run.
*/
yy_bp = yy_cp;
yy_current_state = (yy_start);
yy_match:
do
{
YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ;
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 217 )
yy_c = yy_meta[yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
++yy_cp;
}
while ( yy_base[yy_current_state] != 1332 );
yy_find_action:
yy_act = yy_accept[yy_current_state];
if ( yy_act == 0 )
{ /* have to back up */
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
yy_act = yy_accept[yy_current_state];
}
YY_DO_BEFORE_ACTION;
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 0: /* must back up */
/* undo the effects of YY_DO_BEFORE_ACTION */
*yy_cp = (yy_hold_char);
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
case 1:
/* rule 1 can match eol */
YY_RULE_SETUP
#line 100 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ }
YY_BREAK
case 2:
YY_RULE_SETUP
#line 102 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ yyterminate(); }
YY_BREAK
case 3:
YY_RULE_SETUP
#line 104 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
canonicalizeNumeral (numbuf, yytext);
char *e_ptr = strrchr (numbuf, 'e');
*e_ptr = '\0';
return processInt (pstate, nullptr, numbuf, e_ptr + 1);
}
YY_BREAK
case 4:
YY_RULE_SETUP
#line 111 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
canonicalizeNumeral (numbuf, yytext);
return processInt (pstate, NULL, numbuf, NULL);
}
YY_BREAK
case 5:
YY_RULE_SETUP
#line 116 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
canonicalizeNumeral (numbuf, yytext);
char *e_ptr = strrchr (numbuf, 'e');
*e_ptr = '\0';
return processInt (pstate, numbuf,
strchr (numbuf, '#') + 1,
e_ptr + 1);
}
YY_BREAK
/* The "llf" is a gdb extension to allow a floating-point
constant to be written in some other base. The
floating-point number is formed by reinterpreting the
bytes, allowing direct control over the bits. */
case 6:
YY_RULE_SETUP
#line 129 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
canonicalizeNumeral (numbuf, yytext);
return processInt (pstate, numbuf, strchr (numbuf, '#') + 1,
NULL);
}
YY_BREAK
case 7:
YY_RULE_SETUP
#line 135 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
canonicalizeNumeral (numbuf, yytext+2);
return processInt (pstate, "16#", numbuf, NULL);
}
YY_BREAK
case 8:
YY_RULE_SETUP
#line 141 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
canonicalizeNumeral (numbuf, yytext);
return processReal (pstate, numbuf);
}
YY_BREAK
case 9:
YY_RULE_SETUP
#line 146 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
canonicalizeNumeral (numbuf, yytext);
return processReal (pstate, numbuf);
}
YY_BREAK
case 10:
YY_RULE_SETUP
#line 151 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
error (_("Based real literals not implemented yet."));
}
YY_BREAK
case 11:
YY_RULE_SETUP
#line 155 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
error (_("Based real literals not implemented yet."));
}
YY_BREAK
case 12:
YY_RULE_SETUP
#line 159 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
yylval.typed_val.val = yytext[1];
yylval.typed_val.type = type_for_char (pstate, yytext[1]);
return CHARLIT;
}
YY_BREAK
case 13:
YY_RULE_SETUP
#line 165 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
ULONGEST v = strtoulst (yytext+3, nullptr, 16);
yylval.typed_val.val = v;
yylval.typed_val.type = type_for_char (pstate, v);
return CHARLIT;
}
YY_BREAK
/* Note that we don't handle bracket sequences of more than 2
digits here. Currently there's no support for wide or
wide-wide strings. */
case 14:
YY_RULE_SETUP
#line 175 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
yylval.sval = processString (yytext+1, yyleng-2);
return STRING;
}
YY_BREAK
case 15:
YY_RULE_SETUP
#line 180 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
error (_("ill-formed or non-terminated string literal"));
}
YY_BREAK
case 16:
YY_RULE_SETUP
#line 185 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
rewind_to_char ('i');
return 0;
}
YY_BREAK
case 17:
YY_RULE_SETUP
#line 190 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
rewind_to_char ('t');
return 0;
}
YY_BREAK
case 18:
/* rule 18 can match eol */
YY_RULE_SETUP
#line 195 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
/* This keyword signals the end of the expression and
will be processed separately. */
rewind_to_char ('t');
return 0;
}
YY_BREAK
/* ADA KEYWORDS */
case 19:
YY_RULE_SETUP
#line 204 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return ABS; }
YY_BREAK
case 20:
YY_RULE_SETUP
#line 205 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return _AND_; }
YY_BREAK
case 21:
YY_RULE_SETUP
#line 206 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return ELSE; }
YY_BREAK
case 22:
YY_RULE_SETUP
#line 207 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return IN; }
YY_BREAK
case 23:
YY_RULE_SETUP
#line 208 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return MOD; }
YY_BREAK
case 24:
YY_RULE_SETUP
#line 209 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return NEW; }
YY_BREAK
case 25:
YY_RULE_SETUP
#line 210 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return NOT; }
YY_BREAK
case 26:
YY_RULE_SETUP
#line 211 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return NULL_PTR; }
YY_BREAK
case 27:
YY_RULE_SETUP
#line 212 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return OR; }
YY_BREAK
case 28:
YY_RULE_SETUP
#line 213 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return OTHERS; }
YY_BREAK
case 29:
YY_RULE_SETUP
#line 214 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return REM; }
YY_BREAK
case 30:
YY_RULE_SETUP
#line 215 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return THEN; }
YY_BREAK
case 31:
YY_RULE_SETUP
#line 216 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return XOR; }
YY_BREAK
/* BOOLEAN "KEYWORDS" */
/* True and False are not keywords in Ada, but rather enumeration constants.
However, the boolean type is no longer represented as an enum, so True
and False are no longer defined in symbol tables. We compromise by
making them keywords (when bare). */
case 32:
YY_RULE_SETUP
#line 225 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return TRUEKEYWORD; }
YY_BREAK
case 33:
YY_RULE_SETUP
#line 226 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return FALSEKEYWORD; }
YY_BREAK
/* ATTRIBUTES */
case 34:
/* rule 34 can match eol */
YY_RULE_SETUP
#line 230 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ BEGIN INITIAL; return processAttribute (yytext+1); }
YY_BREAK
/* PUNCTUATION */
case 35:
YY_RULE_SETUP
#line 234 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return ARROW; }
YY_BREAK
case 36:
YY_RULE_SETUP
#line 235 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return DOTDOT; }
YY_BREAK
case 37:
YY_RULE_SETUP
#line 236 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return STARSTAR; }
YY_BREAK
case 38:
YY_RULE_SETUP
#line 237 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return ASSIGN; }
YY_BREAK
case 39:
YY_RULE_SETUP
#line 238 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return NOTEQUAL; }
YY_BREAK
case 40:
YY_RULE_SETUP
#line 239 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return LEQ; }
YY_BREAK
case 41:
YY_RULE_SETUP
#line 240 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return GEQ; }
YY_BREAK
case 42:
YY_RULE_SETUP
#line 242 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ BEGIN INITIAL; return '\''; }
YY_BREAK
case 43:
YY_RULE_SETUP
#line 244 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return yytext[0]; }
YY_BREAK
case 44:
YY_RULE_SETUP
#line 246 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ if (paren_depth == 0 && pstate->comma_terminates)
{
rewind_to_char (',');
return 0;
}
else
return ',';
}
YY_BREAK
case 45:
YY_RULE_SETUP
#line 255 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ paren_depth += 1; return '('; }
YY_BREAK
case 46:
YY_RULE_SETUP
#line 256 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ if (paren_depth == 0)
{
rewind_to_char (')');
return 0;
}
else
{
paren_depth -= 1;
return ')';
}
}
YY_BREAK
case 47:
/* rule 47 can match eol */
YY_RULE_SETUP
#line 268 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return DOT_ALL; }
YY_BREAK
case 48:
/* rule 48 can match eol */
YY_RULE_SETUP
#line 270 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
yylval.sval = processId (yytext+1, yyleng-1);
return DOT_ID;
}
YY_BREAK
case 49:
/* rule 49 can match eol */
YY_RULE_SETUP
#line 275 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
int all_posn = find_dot_all (yytext);
if (all_posn == -1 && yytext[yyleng-1] == '\'')
{
BEGIN BEFORE_QUAL_QUOTE;
yyless (yyleng-1);
}
else if (all_posn >= 0)
yyless (all_posn);
yylval.sval = processId (yytext, yyleng);
return NAME;
}
YY_BREAK
/* GDB EXPRESSION CONSTRUCTS */
case 50:
/* rule 50 can match eol */
YY_RULE_SETUP
#line 292 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
yyless (yyleng - 2);
yylval.sval = processId (yytext, yyleng);
return NAME;
}
YY_BREAK
case 51:
YY_RULE_SETUP
#line 298 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return COLONCOLON; }
YY_BREAK
case 52:
YY_RULE_SETUP
#line 300 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ return yytext[0]; }
YY_BREAK
/* REGISTERS AND GDB CONVENIENCE VARIABLES */
case 53:
YY_RULE_SETUP
#line 304 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{
yylval.sval.ptr = yytext;
yylval.sval.length = yyleng;
return DOLLAR_VARIABLE;
}
YY_BREAK
/* CATCH-ALL ERROR CASE */
case 54:
YY_RULE_SETUP
#line 312 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
{ error (_("Invalid character '%s' in expression."), yytext); }
YY_BREAK
case 55:
YY_RULE_SETUP
#line 313 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
YY_FATAL_ERROR( "flex scanner jammed" );
YY_BREAK
#line 1581 "<stdout>"
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(BEFORE_QUAL_QUOTE):
yyterminate();
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = (yy_hold_char);
YY_RESTORE_YY_MORE_OFFSET
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
{
/* We're scanning a new file or input source. It's
* possible that this happened because the user
* just pointed yyin at a new source and called
* yylex(). If so, then we have to assure
* consistency between YY_CURRENT_BUFFER and our
* globals. Here is the right place to do so, because
* this is the first action (other than possibly a
* back-up) that will match for the new input source.
*/
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
}
/* Note that here we test for yy_c_buf_p "<=" to the position
* of the first EOB in the buffer, since yy_c_buf_p will
* already have been incremented past the NUL character
* (since all states make transitions on EOB to the
* end-of-buffer state). Contrast this with the test
* in input().
*/
if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
(yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
/* Okay, we're now positioned to make the NUL
* transition. We couldn't have
* yy_get_previous_state() go ahead and do it
* for us because it doesn't know how to deal
* with the possibility of jamming (and we don't
* want to build jamming into it because then it
* will run more slowly).
*/
yy_next_state = yy_try_NUL_trans( yy_current_state );
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++(yy_c_buf_p);
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
yy_cp = (yy_c_buf_p);
goto yy_find_action;
}
}
else switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_END_OF_FILE:
{
(yy_did_buffer_switch_on_eof) = 0;
if ( yywrap( ) )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
* yytext, we can now set up
* yy_c_buf_p so that if some total
* hoser (like flex itself) wants to
* call the scanner after we return the
* YY_NULL, it'll still work - another
* YY_NULL will get returned.
*/
(yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
}
else
{
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) =
(yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
(yy_c_buf_p) =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_find_action;
}
break;
}
default:
YY_FATAL_ERROR(
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
} /* end of user's declarations */
} /* end of yylex */
/* yy_get_next_buffer - try to read in a new buffer
*
* Returns a code representing an action:
* EOB_ACT_LAST_MATCH -
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
* EOB_ACT_END_OF_FILE - end of file
*/
static int yy_get_next_buffer (void)
{
char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
char *source = (yytext_ptr);
int number_to_move, i;
int ret_val;
if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
{ /* Don't try to fill the buffer, so this is an EOF. */
if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
{
/* We matched a single character, the EOB, so
* treat this as a final EOF.
*/
return EOB_ACT_END_OF_FILE;
}
else
{
/* We matched some text prior to the EOB, first
* process it.
*/
return EOB_ACT_LAST_MATCH;
}
}
/* Try to read more data. */
/* First move last chars to start of buffer. */
number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr) - 1);
for ( i = 0; i < number_to_move; ++i )
*(dest++) = *(source++);
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
else
{
int num_to_read =
YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
/* just a shorter name for the current buffer */
YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE;
int yy_c_buf_p_offset =
(int) ((yy_c_buf_p) - b->yy_ch_buf);
if ( b->yy_is_our_buffer )
{
int new_size = b->yy_buf_size * 2;
if ( new_size <= 0 )
b->yy_buf_size += b->yy_buf_size / 8;
else
b->yy_buf_size *= 2;
b->yy_ch_buf = (char *)
/* Include room in for 2 EOB chars. */
yyxrealloc( (void *) b->yy_ch_buf,
(yy_size_t) (b->yy_buf_size + 2) );
}
else
/* Can't grow it, we don't own it. */
b->yy_ch_buf = NULL;
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR(
"fatal error - scanner input buffer overflow" );
(yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
number_to_move - 1;
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
(yy_n_chars), num_to_read );
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
if ( (yy_n_chars) == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
yyrestart( yyin );
}
else
{
ret_val = EOB_ACT_LAST_MATCH;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
else
ret_val = EOB_ACT_CONTINUE_SCAN;
if (((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
/* Extend the array by 50%, plus the number we really need. */
int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyxrealloc(
(void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf, (yy_size_t) new_size );
if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
/* "- 2" to take care of EOB's */
YY_CURRENT_BUFFER_LVALUE->yy_buf_size = (int) (new_size - 2);
}
(yy_n_chars) += number_to_move;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
(yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
return ret_val;
}
/* yy_get_previous_state - get the state just before the EOB char was reached */
static yy_state_type yy_get_previous_state (void)
{
yy_state_type yy_current_state;
char *yy_cp;
yy_current_state = (yy_start);
for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
{
YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 217 )
yy_c = yy_meta[yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
}
return yy_current_state;
}
/* yy_try_NUL_trans - try to make a transition on the NUL character
*
* synopsis
* next_state = yy_try_NUL_trans( current_state );
*/
static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
{
int yy_is_jam;
char *yy_cp = (yy_c_buf_p);
YY_CHAR yy_c = 1;
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 217 )
yy_c = yy_meta[yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
yy_is_jam = (yy_current_state == 216);
return yy_is_jam ? 0 : yy_current_state;
}
#ifndef YY_NO_UNPUT
static void yyunput (int c, char * yy_bp )
{
char *yy_cp;
yy_cp = (yy_c_buf_p);
/* undo effects of setting up yytext */
*yy_cp = (yy_hold_char);
if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
{ /* need to shift things up to make room */
/* +2 for EOB chars. */
int number_to_move = (yy_n_chars) + 2;
char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
char *source =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];
while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
*--dest = *--source;
yy_cp += (int) (dest - source);
yy_bp += (int) (dest - source);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
(yy_n_chars) = (int) YY_CURRENT_BUFFER_LVALUE->yy_buf_size;
if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
YY_FATAL_ERROR( "flex scanner push-back overflow" );
}
*--yy_cp = (char) c;
(yytext_ptr) = yy_bp;
(yy_hold_char) = *yy_cp;
(yy_c_buf_p) = yy_cp;
}
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void)
#else
static int input (void)
#endif
{
int c;
*(yy_c_buf_p) = (yy_hold_char);
if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
{
/* yy_c_buf_p now points to the character we want to return.
* If this occurs *before* the EOB characters, then it's a
* valid NUL; if not, then we've hit the end of the buffer.
*/
if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
/* This was really a NUL. */
*(yy_c_buf_p) = '\0';
else
{ /* need more input */
int offset = (int) ((yy_c_buf_p) - (yytext_ptr));
++(yy_c_buf_p);
switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_LAST_MATCH:
/* This happens because yy_g_n_b()
* sees that we've accumulated a
* token and flags that we need to
* try matching the token before
* proceeding. But for input(),
* there's no matching to consider.
* So convert the EOB_ACT_LAST_MATCH
* to EOB_ACT_END_OF_FILE.
*/
/* Reset buffer status. */
yyrestart( yyin );
/*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
if ( yywrap( ) )
return 0;
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
#ifdef __cplusplus
return yyinput();
#else
return input();
#endif
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) = (yytext_ptr) + offset;
break;
}
}
}
c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
*(yy_c_buf_p) = '\0'; /* preserve yytext */
(yy_hold_char) = *++(yy_c_buf_p);
return c;
}
#endif /* ifndef YY_NO_INPUT */
/** Immediately switch to a different input stream.
* @param input_file A readable stream.
*
* @note This function does not reset the start condition to @c INITIAL .
*/
void yyrestart (FILE * input_file )
{
if ( ! YY_CURRENT_BUFFER ){
yyensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
yy_create_buffer( yyin, YY_BUF_SIZE );
}
yy_init_buffer( YY_CURRENT_BUFFER, input_file );
yy_load_buffer_state( );
}
/** Switch to a different input buffer.
* @param new_buffer The new input buffer.
*
*/
void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer )
{
/* TODO. We should be able to replace this entire function body
* with
* yypop_buffer_state();
* yypush_buffer_state(new_buffer);
*/
yyensure_buffer_stack ();
if ( YY_CURRENT_BUFFER == new_buffer )
return;
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
YY_CURRENT_BUFFER_LVALUE = new_buffer;
yy_load_buffer_state( );
/* We don't actually know whether we did this switch during
* EOF (yywrap()) processing, but the only time this flag
* is looked at is after yywrap() is called, so it's safe
* to go ahead and always set it.
*/
(yy_did_buffer_switch_on_eof) = 1;
}
static void yy_load_buffer_state (void)
{
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
(yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
(yy_hold_char) = *(yy_c_buf_p);
}
/** Allocate and initialize an input buffer state.
* @param file A readable stream.
* @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
*
* @return the allocated buffer state.
*/
YY_BUFFER_STATE yy_create_buffer (FILE * file, int size )
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_buf_size = size;
/* yy_ch_buf has to be 2 characters longer than the size given because
* we need to put in 2 end-of-buffer characters.
*/
b->yy_ch_buf = (char *) yyalloc( (yy_size_t) (b->yy_buf_size + 2) );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_is_our_buffer = 1;
yy_init_buffer( b, file );
return b;
}
/** Destroy the buffer.
* @param b a buffer created with yy_create_buffer()
*
*/
void yy_delete_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
yyfree( (void *) b->yy_ch_buf );
yyfree( (void *) b );
}
/* Initializes or reinitializes a buffer.
* This function is sometimes called more than once on the same buffer,
* such as during a yyrestart() or at EOF.
*/
static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file )
{
int oerrno = errno;
yy_flush_buffer( b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
/* If b is the current buffer, then yy_init_buffer was _probably_
* called from yyrestart() or through yy_get_next_buffer.
* In that case, we don't want to reset the lineno or column.
*/
if (b != YY_CURRENT_BUFFER){
b->yy_bs_lineno = 1;
b->yy_bs_column = 0;
}
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
errno = oerrno;
}
/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
* @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
*
*/
void yy_flush_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
b->yy_n_chars = 0;
/* We always need two end-of-buffer characters. The first causes
* a transition to the end-of-buffer state. The second causes
* a jam in that state.
*/
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
b->yy_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
if ( b == YY_CURRENT_BUFFER )
yy_load_buffer_state( );
}
/** Pushes the new state onto the stack. The new state becomes
* the current state. This function will allocate the stack
* if necessary.
* @param new_buffer The new state.
*
*/
void yypush_buffer_state (YY_BUFFER_STATE new_buffer )
{
if (new_buffer == NULL)
return;
yyensure_buffer_stack();
/* This block is copied from yy_switch_to_buffer. */
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
/* Only push if top exists. Otherwise, replace top. */
if (YY_CURRENT_BUFFER)
(yy_buffer_stack_top)++;
YY_CURRENT_BUFFER_LVALUE = new_buffer;
/* copied from yy_switch_to_buffer. */
yy_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
/** Removes and deletes the top of the stack, if present.
* The next element becomes the new top.
*
*/
void yypop_buffer_state (void)
{
if (!YY_CURRENT_BUFFER)
return;
yy_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
if ((yy_buffer_stack_top) > 0)
--(yy_buffer_stack_top);
if (YY_CURRENT_BUFFER) {
yy_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
}
/* Allocates the stack if it does not exist.
* Guarantees space for at least one push.
*/
static void yyensure_buffer_stack (void)
{
yy_size_t num_to_alloc;
if (!(yy_buffer_stack)) {
/* First allocation is just for 2 elements, since we don't know if this
* scanner will even need a stack. We use 2 instead of 1 to avoid an
* immediate xrealloc on the next call.
*/
num_to_alloc = 1; /* After all that talk, this was set to 1 anyways... */
(yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
(num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
(yy_buffer_stack_top) = 0;
return;
}
if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
/* Increase the buffer to prepare for a possible push. */
yy_size_t grow_size = 8 /* arbitrary grow size */;
num_to_alloc = (yy_buffer_stack_max) + grow_size;
(yy_buffer_stack) = (struct yy_buffer_state**)yyxrealloc
((yy_buffer_stack),
num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
/* zero only the new slots.*/
memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
}
}
/** Setup the input buffer state to scan directly from a user-specified character buffer.
* @param base the character buffer
* @param size the size in bytes of the character buffer
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size )
{
YY_BUFFER_STATE b;
if ( size < 2 ||
base[size-2] != YY_END_OF_BUFFER_CHAR ||
base[size-1] != YY_END_OF_BUFFER_CHAR )
/* They forgot to leave room for the EOB's. */
return NULL;
b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
b->yy_buf_size = (int) (size - 2); /* "- 2" to take care of EOB's */
b->yy_buf_pos = b->yy_ch_buf = base;
b->yy_is_our_buffer = 0;
b->yy_input_file = NULL;
b->yy_n_chars = b->yy_buf_size;
b->yy_is_interactive = 0;
b->yy_at_bol = 1;
b->yy_fill_buffer = 0;
b->yy_buffer_status = YY_BUFFER_NEW;
yy_switch_to_buffer( b );
return b;
}
/** Setup the input buffer state to scan a string. The next call to yylex() will
* scan from a @e copy of @a str.
* @param yystr a NUL-terminated string to scan
*
* @return the newly allocated buffer state object.
* @note If you want to scan bytes that may contain NUL values, then use
* yy_scan_bytes() instead.
*/
YY_BUFFER_STATE yy_scan_string (const char * yystr )
{
return yy_scan_bytes( yystr, (int) strlen(yystr) );
}
/** Setup the input buffer state to scan the given bytes. The next call to yylex() will
* scan from a @e copy of @a bytes.
* @param yybytes the byte buffer to scan
* @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE yy_scan_bytes (const char * yybytes, int _yybytes_len )
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
int i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = (yy_size_t) (_yybytes_len + 2);
buf = (char *) yyalloc( n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
for ( i = 0; i < _yybytes_len; ++i )
buf[i] = yybytes[i];
buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
b = yy_scan_buffer( buf, n );
if ( ! b )
YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
/* It's okay to grow etc. this buffer, and we should throw it
* away when we're done.
*/
b->yy_is_our_buffer = 1;
return b;
}
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
static void yynoreturn yy_fatal_error (const char* msg )
{
fprintf( stderr, "%s\n", msg );
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#undef yyless
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
yytext[yyleng] = (yy_hold_char); \
(yy_c_buf_p) = yytext + yyless_macro_arg; \
(yy_hold_char) = *(yy_c_buf_p); \
*(yy_c_buf_p) = '\0'; \
yyleng = yyless_macro_arg; \
} \
while ( 0 )
/* Accessor methods (get/set functions) to struct members. */
/** Get the current line number.
*
*/
int yyget_lineno (void)
{
return yylineno;
}
/** Get the input stream.
*
*/
FILE *yyget_in (void)
{
return yyin;
}
/** Get the output stream.
*
*/
FILE *yyget_out (void)
{
return yyout;
}
/** Get the length of the current token.
*
*/
int yyget_leng (void)
{
return yyleng;
}
/** Get the current token.
*
*/
char *yyget_text (void)
{
return yytext;
}
/** Set the current line number.
* @param _line_number line number
*
*/
void yyset_lineno (int _line_number )
{
yylineno = _line_number;
}
/** Set the input stream. This does not discard the current
* input buffer.
* @param _in_str A readable stream.
*
* @see yy_switch_to_buffer
*/
void yyset_in (FILE * _in_str )
{
yyin = _in_str ;
}
void yyset_out (FILE * _out_str )
{
yyout = _out_str ;
}
int yyget_debug (void)
{
return yy_flex_debug;
}
void yyset_debug (int _bdebug )
{
yy_flex_debug = _bdebug ;
}
static int yy_init_globals (void)
{
/* Initialization is the same as for the non-reentrant scanner.
* This function is called from yylex_destroy(), so don't allocate here.
*/
(yy_buffer_stack) = NULL;
(yy_buffer_stack_top) = 0;
(yy_buffer_stack_max) = 0;
(yy_c_buf_p) = NULL;
(yy_init) = 0;
(yy_start) = 0;
/* Defined in main.c */
#ifdef YY_STDINIT
yyin = stdin;
yyout = stdout;
#else
yyin = NULL;
yyout = NULL;
#endif
/* For future reference: Set errno on error, since we are called by
* yylex_init()
*/
return 0;
}
/* yylex_destroy is for both reentrant and non-reentrant scanners. */
int yylex_destroy (void)
{
/* Pop the buffer stack, destroying each element. */
while(YY_CURRENT_BUFFER){
yy_delete_buffer( YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
yypop_buffer_state();
}
/* Destroy the stack itself. */
yyfree((yy_buffer_stack) );
(yy_buffer_stack) = NULL;
/* Reset the globals. This is important in a non-reentrant scanner so the next time
* yylex() is called, initialization will occur. */
yy_init_globals( );
return 0;
}
/*
* Internal utility routines.
*/
#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, const char * s2, int n )
{
int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (const char * s )
{
int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
void *yyalloc (yy_size_t size )
{
return xmalloc(size);
}
void *yyxrealloc (void * ptr, yy_size_t size )
{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
* because both ANSI C and C++ allow castless assignment from
* any pointer type to void*, and deal with argument conversions
* as though doing an assignment.
*/
return xrealloc(ptr, size);
}
void yyfree (void * ptr )
{
xfree( (char *) ptr ); /* see yyxrealloc() for (char *) cast */
}
#define YYTABLES_NAME "yytables"
#line 313 "/home/seti/riscv-gnu-toolchain/gdb/gdb/ada-lex.l"
#include <ctype.h>
/* Initialize the lexer for processing new expression. */
static void
lexer_init (FILE *inp)
{
BEGIN INITIAL;
paren_depth = 0;
yyrestart (inp);
}
/* Copy S2 to S1, removing all underscores, and downcasing all letters. */
static void
canonicalizeNumeral (char *s1, const char *s2)
{
for (; *s2 != '\000'; s2 += 1)
{
if (*s2 != '_')
{
*s1 = tolower(*s2);
s1 += 1;
}
}
s1[0] = '\000';
}
/* Interprets the prefix of NUM that consists of digits of the given BASE
as an integer of that BASE, with the string EXP as an exponent.
Puts value in yylval, and returns INT, if the string is valid. Causes
an error if the number is improperly formated. BASE, if NULL, defaults
to "10", and EXP to "1". The EXP does not contain a leading 'e' or 'E'.
*/
static int
processInt (struct parser_state *par_state, const char *base0,
const char *num0, const char *exp0)
{
long exp;
int base;
/* For the based literal with an "f" prefix, we'll return a
floating-point number. This counts the the number of "l"s seen,
to decide the width of the floating-point number to return. -1
means no "f". */
int floating_point_l_count = -1;
if (base0 == NULL)
base = 10;
else
{
char *end_of_base;
base = strtol (base0, &end_of_base, 10);
if (base < 2 || base > 16)
error (_("Invalid base: %d."), base);
while (*end_of_base == 'l')
{
++floating_point_l_count;
++end_of_base;
}
/* This assertion is ensured by the pattern. */
gdb_assert (floating_point_l_count == -1 || *end_of_base == 'f');
if (*end_of_base == 'f')
{
++end_of_base;
++floating_point_l_count;
}
/* This assertion is ensured by the pattern. */
gdb_assert (*end_of_base == '#');
}
if (exp0 == NULL)
exp = 0;
else
exp = strtol(exp0, (char **) NULL, 10);
gdb_mpz result;
while (isxdigit (*num0))
{
int dig = fromhex (*num0);
if (dig >= base)
error (_("Invalid digit `%c' in based literal"), *num0);
mpz_mul_ui (result.val, result.val, base);
mpz_add_ui (result.val, result.val, dig);
++num0;
}
while (exp > 0)
{
mpz_mul_ui (result.val, result.val, base);
exp -= 1;
}
if (floating_point_l_count > -1)
{
struct type *fp_type;
if (floating_point_l_count == 0)
fp_type = language_lookup_primitive_type (par_state->language (),
par_state->gdbarch (),
"float");
else if (floating_point_l_count == 1)
fp_type = language_lookup_primitive_type (par_state->language (),
par_state->gdbarch (),
"long_float");
else
{
/* This assertion is ensured by the pattern. */
gdb_assert (floating_point_l_count == 2);
fp_type = language_lookup_primitive_type (par_state->language (),
par_state->gdbarch (),
"long_long_float");
}
yylval.typed_val_float.type = fp_type;
result.write (gdb::make_array_view (yylval.typed_val_float.val,
TYPE_LENGTH (fp_type)),
type_byte_order (fp_type),
true);
return FLOAT;
}
gdb_mpz maxval (ULONGEST_MAX);
if (mpz_cmp (result.val, maxval.val) > 0)
error (_("Integer literal out of range"));
ULONGEST value = result.as_integer<ULONGEST> ();
if ((value >> (gdbarch_int_bit (par_state->gdbarch ())-1)) == 0)
yylval.typed_val.type = type_int (par_state);
else if ((value >> (gdbarch_long_bit (par_state->gdbarch ())-1)) == 0)
yylval.typed_val.type = type_long (par_state);
else if (((value >> (gdbarch_long_bit (par_state->gdbarch ())-1)) >> 1) == 0)
{
/* We have a number representable as an unsigned integer quantity.
For consistency with the C treatment, we will treat it as an
anonymous modular (unsigned) quantity. Alas, the types are such
that we need to store .val as a signed quantity. Sorry
for the mess, but C doesn't officially guarantee that a simple
assignment does the trick (no, it doesn't; read the reference manual).
*/
yylval.typed_val.type
= builtin_type (par_state->gdbarch ())->builtin_unsigned_long;
if (value & LONGEST_SIGN)
yylval.typed_val.val =
(LONGEST) (value & ~LONGEST_SIGN)
- (LONGEST_SIGN>>1) - (LONGEST_SIGN>>1);
else
yylval.typed_val.val = (LONGEST) value;
return INT;
}
else
yylval.typed_val.type = type_long_long (par_state);
yylval.typed_val.val = value;
return INT;
}
static int
processReal (struct parser_state *par_state, const char *num0)
{
yylval.typed_val_float.type = type_long_double (par_state);
bool parsed = parse_float (num0, strlen (num0),
yylval.typed_val_float.type,
yylval.typed_val_float.val);
gdb_assert (parsed);
return FLOAT;
}
/* Store a canonicalized version of NAME0[0..LEN-1] in yylval.ssym. The
resulting string is valid until the next call to ada_parse. If
NAME0 contains the substring "___", it is assumed to be already
encoded and the resulting name is equal to it. Similarly, if the name
starts with '<', it is copied verbatim. Otherwise, it differs
from NAME0 in that:
+ Characters between '...' are transfered verbatim to yylval.ssym.
+ Trailing "'" characters in quoted sequences are removed (a leading quote is
preserved to indicate that the name is not to be GNAT-encoded).
+ Unquoted whitespace is removed.
+ Unquoted alphabetic characters are mapped to lower case.
Result is returned as a struct stoken, but for convenience, the string
is also null-terminated. Result string valid until the next call of
ada_parse.
*/
static struct stoken
processId (const char *name0, int len)
{
char *name = (char *) obstack_alloc (&temp_parse_space, len + 11);
int i0, i;
struct stoken result;
result.ptr = name;
while (len > 0 && isspace (name0[len-1]))
len -= 1;
if (name0[0] == '<' || strstr (name0, "___") != NULL)
{
strncpy (name, name0, len);
name[len] = '\000';
result.length = len;
return result;
}
i = i0 = 0;
while (i0 < len)
{
if (isalnum (name0[i0]))
{
name[i] = tolower (name0[i0]);
i += 1; i0 += 1;
}
else switch (name0[i0])
{
default:
name[i] = name0[i0];
i += 1; i0 += 1;
break;
case ' ': case '\t':
i0 += 1;
break;
case '\'':
do
{
name[i] = name0[i0];
i += 1; i0 += 1;
}
while (i0 < len && name0[i0] != '\'');
i0 += 1;
break;
}
}
name[i] = '\000';
result.length = i;
return result;
}
/* Return TEXT[0..LEN-1], a string literal without surrounding quotes,
with special hex character notations replaced with characters.
Result valid until the next call to ada_parse. */
static struct stoken
processString (const char *text, int len)
{
const char *p;
char *q;
const char *lim = text + len;
struct stoken result;
q = (char *) obstack_alloc (&temp_parse_space, len);
result.ptr = q;
p = text;
while (p < lim)
{
if (p[0] == '[' && p[1] == '"' && p+2 < lim)
{
if (p[2] == '"') /* "...["""]... */
{
*q = '"';
p += 4;
}
else
{
const char *end;
ULONGEST chr = strtoulst (p + 2, &end, 16);
if (chr > 0xff)
error (_("wide strings are not yet supported"));
*q = (char) chr;
p = end + 1;
}
}
else
*q = *p;
q += 1;
p += 1;
}
result.length = q - result.ptr;
return result;
}
/* Returns the position within STR of the '.' in a
'.{WHITE}*all' component of a dotted name, or -1 if there is none.
Note: we actually don't need this routine, since 'all' can never be an
Ada identifier. Thus, looking up foo.all or foo.all.x as a name
must fail, and will eventually be interpreted as (foo).all or
(foo).all.x. However, this does avoid an extraneous lookup. */
static int
find_dot_all (const char *str)
{
int i;
for (i = 0; str[i] != '\000'; i++)
if (str[i] == '.')
{
int i0 = i;
do
i += 1;
while (isspace (str[i]));
if (strncasecmp (str + i, "all", 3) == 0
&& !isalnum (str[i + 3]) && str[i + 3] != '_')
return i0;
}
return -1;
}
/* Returns non-zero iff string SUBSEQ matches a subsequence of STR, ignoring
case. */
static int
subseqMatch (const char *subseq, const char *str)
{
if (subseq[0] == '\0')
return 1;
else if (str[0] == '\0')
return 0;
else if (tolower (subseq[0]) == tolower (str[0]))
return subseqMatch (subseq+1, str+1) || subseqMatch (subseq, str+1);
else
return subseqMatch (subseq, str+1);
}
static struct { const char *name; int code; }
attributes[] = {
{ "address", TICK_ADDRESS },
{ "unchecked_access", TICK_ACCESS },
{ "unrestricted_access", TICK_ACCESS },
{ "access", TICK_ACCESS },
{ "first", TICK_FIRST },
{ "last", TICK_LAST },
{ "length", TICK_LENGTH },
{ "max", TICK_MAX },
{ "min", TICK_MIN },
{ "modulus", TICK_MODULUS },
{ "pos", TICK_POS },
{ "range", TICK_RANGE },
{ "size", TICK_SIZE },
{ "tag", TICK_TAG },
{ "val", TICK_VAL },
{ NULL, -1 }
};
/* Return the syntactic code corresponding to the attribute name or
abbreviation STR. */
static int
processAttribute (const char *str)
{
int i, k;
for (i = 0; attributes[i].code != -1; i += 1)
if (strcasecmp (str, attributes[i].name) == 0)
return attributes[i].code;
for (i = 0, k = -1; attributes[i].code != -1; i += 1)
if (subseqMatch (str, attributes[i].name))
{
if (k == -1)
k = i;
else
error (_("ambiguous attribute name: `%s'"), str);
}
if (k == -1)
error (_("unrecognized attribute: `%s'"), str);
return attributes[k].code;
}
/* Back up lexptr by yyleng and then to the rightmost occurrence of
character CH, case-folded (there must be one). WARNING: since
lexptr points to the next input character that Flex has not yet
transferred to its internal buffer, the use of this function
depends on the assumption that Flex calls YY_INPUT only when it is
logically necessary to do so (thus, there is no reading ahead
farther than needed to identify the next token.) */
static void
rewind_to_char (int ch)
{
pstate->lexptr -= yyleng;
while (toupper (*pstate->lexptr) != toupper (ch))
pstate->lexptr -= 1;
yyrestart (NULL);
}
/* Dummy definition to suppress warnings about unused static definitions. */
typedef void (*dummy_function) ();
dummy_function ada_flex_use[] =
{
(dummy_function) yyunput
};
DIAGNOSTIC_POP
Reference in New Issue View Git Blame Copy Permalink