#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#define FLEX_SCANNER
#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. */
/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
*/
#ifndef __STDC_LIMIT_MACROS
#endif
#include <inttypes.h>
#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;
#endif /* ! C99 */
/* Limits of integral types. */
#ifndef INT8_MIN
#endif
#ifndef INT16_MIN
#endif
#ifndef INT32_MIN
#endif
#ifndef INT8_MAX
#endif
#ifndef INT16_MAX
#endif
#ifndef INT32_MAX
#endif
#ifndef UINT8_MAX
#endif
#ifndef UINT16_MAX
#endif
#ifndef UINT32_MAX
#endif
#endif /* ! FLEXINT_H */
#ifdef __cplusplus
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
/* C99 requires __STDC__ to be defined as 1. */
#if defined (__STDC__)
#define YY_USE_CONST
#endif /* defined (__STDC__) */
#endif /* ! __cplusplus */
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned 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.
*/
/* 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.
*/
/* Action number for EOF rule of a given start state. */
/* Special action meaning "start processing a new file". */
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#endif
/* The state buf must be large enough to hold one state per character in the main buffer.
*/
#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
#endif
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
#endif
#define EOB_ACT_CONTINUE_SCAN 0
/* Note: We specifically omit the test for yy_rule_can_match_eol because it requires
* access to the local variable yy_act. Since yyless() is a macro, it would break
* existing scanners that call yyless() from OUTSIDE yylex.
* One obvious solution it to make yy_act a global. I tried that, and saw
* a 5% performance hit in a non-yylineno scanner, because yy_act is
* normally declared as a register variable-- so it is not worth it.
*/
#define YY_LESS_LINENO(n) \
do { \
--yylineno;\
}while(0)
/* 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_cp = (yy_hold_char); \
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
} \
while ( 0 )
#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
/* Number of characters read into yy_ch_buf, not including EOB
* characters.
*/
/* Whether we "own" the buffer - i.e., we know we created it,
* and can realloc() it to grow it, and should free() 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;
/* 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
/* 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.
*/
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* Stack of input buffers. */
/* 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.
*/
? (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.
*/
/* yy_hold_char holds the character lost when yytext is formed. */
static char yy_hold_char;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
/* 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 yy_delete_buffer (YY_BUFFER_STATE b );
void yy_flush_buffer (YY_BUFFER_STATE b );
void yypop_buffer_state (void );
static void yyensure_buffer_stack (void );
static void yy_load_buffer_state (void );
void yyfree (void * );
{ \
if ( ! YY_CURRENT_BUFFER ){ \
yyensure_buffer_stack (); \
} \
}
{ \
if ( ! YY_CURRENT_BUFFER ){\
yyensure_buffer_stack (); \
} \
}
/* Begin user sect3 */
typedef unsigned char YY_CHAR;
typedef int yy_state_type;
#define YY_FLEX_LEX_COMPAT
extern int yylineno;
extern char yytext[];
static yy_state_type yy_get_previous_state (void );
static int yy_get_next_buffer (void );
/* 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; \
(yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
YY_FATAL_ERROR( "token too large, exceeds YYLMAX" ); \
yyleng += (yy_more_offset); \
(yy_prev_more_offset) = (yy_more_offset); \
(yy_more_offset) = 0; \
(yy_c_buf_p) = yy_cp;
/* This struct is not used in this scanner,
but its presence is necessary. */
struct yy_trans_info
{
};
{ 0,
163, 162, 149, 162, 147, 149, 162, 147, 162, 126,
149, 162, 149, 162,16469, 149, 162, 124, 149, 162,
109, 149, 162, 149, 162,16472, 100, 149, 162, 101,
149, 162, 123, 149, 162, 121, 149, 162, 145, 149,
162, 122, 149, 162, 129, 149, 162, 99, 149, 162,
81, 84, 149, 162, 81, 84, 149, 162, 128, 149,
162, 146, 149, 162, 115, 149, 162, 131, 149, 162,
117, 149, 162, 127, 149, 162, 80, 149, 162, 78,
149, 162, 102, 149, 162, 149, 162, 103, 149, 162,
108, 149, 162, 78, 149, 162, 78, 149, 162, 78,
149, 162, 78, 149, 162, 78, 149, 162, 78, 149,
162, 78, 149, 162, 78, 149, 162, 78, 149, 162,
78, 149, 162, 78, 149, 162, 78, 149, 162, 78,
149, 162, 78, 149, 162, 78, 149, 162, 78, 149,
162, 78, 149, 162, 78, 149, 162, 104, 149, 162,
107, 149, 162, 106, 149, 162, 125, 149, 162, 147,
149, 162, 94, 149, 162, 152, 162, 152, 162, 152,
162, 157, 162, 156, 157, 162, 156, 162, 153, 157,
162, 155, 157, 162, 154, 157, 162, 82, 157, 162,
82, 157, 162, 153, 157, 162, 153, 157, 162, 153,
157, 162, 153, 157, 162, 153, 157, 162, 153, 157,
162, 153, 157, 162, 153, 157, 162, 153, 157, 162,
153, 157, 162, 153, 157, 162, 153, 157, 162, 153,
157, 162, 105, 157, 162, 156, 157, 162, 95, 157,
162, 160, 161, 162, 159, 161, 162, 158, 162, 161,
162,16469, 83, 160, 161, 162, 83, 160, 161, 162,
97, 162, 98, 162, 97, 162, 96, 97, 162, 114,
16469, 8277, 86, 75, 77, 136, 110, 137,16472, 8280,
89, 134, 142, 132, 143, 133, 130, 84, 90, 135,
84, 81, 84, 84, 81, 84, 81, 119, 116, 113,
118, 120, 79, 78, 148, 138, 111, 78, 78, 78,
78, 78, 78, 9, 78, 78, 78, 78, 78, 78,
78, 17, 78, 78, 78, 78, 78, 78, 78, 78,
78, 78, 78, 78, 78, 78, 78, 78, 78, 78,
78, 139, 112, 94, 92, 151, 150, 153, 91, 82,
82, 82, 153, 153, 153, 153, 153, 153, 153, 153,
153, 153, 153, 153, 153, 153, 153, 153, 153, 153,
153, 153, 153, 95, 93, 160, 159,16469, 87, 83,
160, 83, 160, 83, 160, 160, 96, 74, 76, 77,
144, 84, 84, 81, 81, 81, 140, 141, 79, 78,
78, 78, 78, 78, 78, 78, 78, 78, 78, 78,
78, 15, 78, 78, 78, 78, 20, 78, 78, 78,
78, 78, 78, 78, 78, 78, 78, 78, 78, 78,
78, 78, 78, 78, 78, 78, 78, 78, 78, 78,
92, 82, 82, 153, 153, 153, 153, 153, 153, 153,
153, 153, 153, 56, 153, 153, 153, 153, 153, 153,
153, 153, 153, 153, 153, 153, 153, 153, 153, 153,
153, 93, 83, 160, 83, 160, 76, 1, 78, 78,
3, 78, 4, 78, 78, 78, 78, 78, 78, 11,
78, 12, 78, 78, 78, 16, 78, 78, 78, 21,
78, 78, 78, 78, 78, 78, 78, 28, 78, 78,
78, 78, 78, 78, 78, 78, 37, 78, 78, 78,
78, 78, 42, 78, 78, 78, 78, 46, 153, 47,
153, 153, 153, 153, 51, 153, 153, 153, 153, 153,
57, 153, 153, 153, 153, 61, 153, 153, 153, 153,
153, 153, 67, 153, 153, 153, 153, 153, 72, 153,
153, 2, 78, 5, 78, 78, 78, 78, 78, 78,
14, 78, 78, 78, 78, 23, 78, 78, 78, 78,
78, 29, 78, 78, 78, 78, 78, 78, 78, 78,
78, 40, 78, 78, 78, 44, 78, 45, 78, 48,
153, 153, 153, 153, 53, 153, 153, 153, 153, 153,
153, 62, 153, 153, 153, 153, 153, 153, 153, 70,
153, 153, 153, 78, 78, 78, 10, 78, 13, 78,
18, 78, 19, 78, 78, 78, 78, 78, 27, 78,
30, 78, 31, 78, 32, 78, 33, 78, 35, 78,
36, 78, 78, 78, 78, 78, 153, 50, 153, 52,
153, 54, 153, 55, 153, 153, 153, 153, 63, 153,
64, 153, 65, 153, 66, 153, 153, 153, 153, 153,
78, 7, 78, 8, 78, 78, 78, 78, 78, 78,
78, 39, 78, 78, 78, 49, 153, 153, 153, 153,
153, 69, 153, 153, 153, 6, 78, 22, 78, 24,
78, 25, 78, 26, 78, 34, 78, 78, 41, 78,
43, 78, 58, 153, 59, 153, 60, 153, 153, 71,
153, 73, 153, 78, 153, 38, 78, 68, 153
} ;
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 2, 3, 5, 8, 10, 13, 16,
18, 21, 24, 27, 30, 33, 36, 39, 42, 45,
48, 51, 55, 59, 62, 65, 68, 71, 74, 77,
80, 83, 86, 88, 91, 94, 97, 100, 103, 106,
109, 112, 115, 118, 121, 124, 127, 130, 133, 136,
139, 142, 145, 148, 151, 154, 157, 160, 163, 166,
168, 170, 172, 174, 177, 179, 182, 185, 188, 191,
194, 197, 200, 203, 206, 209, 212, 215, 218, 221,
224, 227, 230, 233, 236, 239, 242, 245, 248, 250,
253, 257, 261, 263, 265, 267, 270, 271, 272, 273,
274, 274, 274, 275, 276, 277, 278, 279, 280, 281,
282, 282, 283, 284, 285, 286, 287, 288, 288, 289,
290, 291, 292, 294, 294, 295, 297, 298, 298, 299,
300, 301, 302, 303, 304, 305, 306, 307, 308, 309,
310, 311, 312, 313, 314, 316, 317, 318, 319, 320,
321, 322, 324, 325, 326, 327, 328, 329, 330, 331,
332, 333, 334, 335, 336, 337, 338, 339, 340, 341,
342, 343, 344, 344, 345, 346, 347, 348, 349, 350,
351, 352, 353, 353, 354, 355, 356, 357, 358, 359,
360, 361, 362, 363, 364, 365, 366, 367, 368, 369,
370, 371, 372, 373, 374, 374, 375, 376, 377, 378,
379, 380, 380, 382, 384, 386, 387, 387, 388, 389,
390, 391, 392, 393, 393, 394, 395, 396, 397, 398,
399, 400, 401, 402, 403, 404, 405, 406, 407, 408,
409, 410, 411, 412, 414, 415, 416, 417, 419, 420,
421, 422, 423, 424, 425, 426, 427, 428, 429, 430,
431, 432, 433, 434, 435, 436, 437, 438, 439, 440,
441, 442, 443, 444, 445, 446, 447, 448, 449, 450,
451, 452, 453, 454, 456, 457, 458, 459, 460, 461,
462, 463, 464, 465, 466, 467, 468, 469, 470, 471,
472, 473, 475, 477, 478, 480, 481, 483, 485, 486,
487, 488, 489, 490, 492, 494, 495, 496, 498, 499,
500, 502, 503, 504, 505, 506, 507, 508, 510, 511,
512, 513, 514, 515, 516, 517, 519, 520, 521, 522,
523, 525, 526, 527, 528, 530, 532, 533, 534, 535,
537, 538, 539, 540, 541, 543, 544, 545, 546, 548,
549, 550, 551, 552, 553, 555, 556, 557, 558, 559,
561, 562, 564, 566, 567, 568, 569, 570, 571, 573,
574, 575, 576, 578, 579, 580, 581, 582, 584, 585,
586, 587, 588, 589, 590, 591, 592, 594, 595, 596,
598, 600, 602, 603, 604, 605, 607, 608, 609, 610,
611, 612, 614, 615, 616, 617, 618, 619, 620, 622,
623, 624, 625, 626, 627, 629, 631, 633, 635, 636,
637, 638, 639, 641, 643, 645, 647, 649, 651, 653,
654, 655, 656, 657, 658, 660, 662, 664, 666, 667,
668, 669, 671, 673, 675, 677, 678, 679, 680, 681,
682, 684, 686, 687, 688, 689, 690, 691, 692, 694,
695, 696, 698, 699, 700, 701, 702, 704, 705, 706,
708, 710, 712, 714, 716, 718, 719, 721, 723, 725,
727, 729, 730, 732, 734, 735, 736, 738, 740, 740
} ;
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
2, 2, 4, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 5, 6, 7, 8, 9, 10, 11, 12,
13, 14, 15, 16, 17, 18, 19, 20, 21, 21,
21, 21, 21, 21, 21, 21, 21, 22, 23, 24,
25, 26, 27, 28, 29, 29, 29, 29, 30, 31,
32, 32, 32, 32, 32, 33, 32, 32, 32, 32,
32, 32, 32, 32, 34, 32, 32, 35, 32, 32,
36, 37, 38, 39, 32, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 32, 50, 51, 52, 53,
54, 55, 32, 56, 57, 58, 59, 60, 61, 62,
63, 64, 65, 66, 67, 68, 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, 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
} ;
{ 0,
1, 2, 3, 1, 4, 2, 1, 5, 1, 1,
1, 1, 1, 4, 1, 1, 4, 4, 1, 6,
6, 4, 1, 1, 1, 1, 4, 1, 7, 7,
7, 8, 8, 8, 8, 4, 4, 4, 1, 9,
7, 7, 7, 7, 7, 7, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 1, 1, 1, 1
} ;
{ 0,
0, 0, 0, 67, 56, 57, 76, 143, 145, 150,
811, 152, 813, 815, 815, 815, 815, 787, 143, 152,
786, 151, 164, 815, 815, 785, 143, 815, 152, 161,
149, 184, 122, 815, 815, 48, 784, 160, 815, 0,
0, 815, 805, 815, 158, 748, 750, 146, 144, 137,
141, 751, 157, 750, 757, 746, 756, 163, 175, 747,
745, 750, 746, 815, 166, 815, 815, 218, 791, 815,
776, 780, 815, 815, 815, 0, 815, 779, 206, 216,
733, 159, 737, 180, 739, 192, 735, 732, 742, 203,
199, 733, 731, 815, 251, 779, 0, 781, 815, 253,
243, 249, 815, 815, 264, 815, 815, 278, 815, 815,
779, 252, 259, 0, 815, 815, 815, 282, 815, 815,
778, 815, 815, 815, 815, 815, 815, 762, 266, 815,
815, 283, 239, 303, 815, 183, 255, 0, 754, 815,
815, 815, 753, 0, 0, 815, 815, 815, 719, 731,
718, 733, 169, 727, 713, 714, 711, 711, 714, 711,
708, 0, 710, 240, 711, 717, 708, 274, 710, 706,
245, 254, 710, 709, 716, 701, 273, 113, 706, 713,
815, 815, 331, 748, 0, 815, 815, 0, 815, 306,
256, 292, 0, 694, 710, 201, 691, 690, 690, 693,
691, 284, 692, 690, 149, 692, 688, 694, 295, 691,
698, 683, 288, 295, 345, 732, 0, 0, 734, 347,
815, 732, 328, 308, 321, 368, 353, 815, 343, 0,
0, 815, 350, 346, 371, 815, 323, 335, 815, 815,
0, 680, 692, 687, 675, 318, 677, 688, 686, 682,
674, 680, 683, 0, 669, 668, 672, 0, 673, 662,
340, 669, 659, 657, 669, 658, 660, 667, 653, 344,
652, 652, 655, 662, 652, 656, 660, 662, 651, 643,
0, 815, 372, 646, 643, 641, 644, 654, 643, 649,
652, 638, 642, 0, 643, 629, 639, 629, 640, 629,
631, 625, 359, 625, 628, 635, 625, 629, 633, 635,
0, 0, 412, 0, 0, 625, 0, 0, 616, 624,
614, 612, 619, 0, 0, 613, 610, 0, 611, 613,
0, 620, 619, 614, 605, 605, 604, 0, 601, 613,
603, 607, 602, 611, 610, 0, 595, 607, 597, 602,
0, 590, 602, 601, 0, 0, 587, 586, 592, 0,
586, 583, 584, 586, 0, 589, 580, 580, 0, 577,
589, 584, 579, 588, 0, 573, 585, 575, 580, 0,
568, 0, 0, 572, 579, 572, 577, 568, 0, 562,
574, 560, 0, 573, 558, 566, 561, 0, 569, 566,
568, 563, 551, 560, 556, 561, 0, 552, 555, 0,
0, 0, 558, 557, 548, 0, 542, 554, 554, 529,
527, 0, 501, 501, 423, 411, 417, 422, 0, 413,
416, 405, 406, 403, 0, 0, 0, 0, 406, 414,
407, 408, 0, 0, 0, 0, 396, 0, 0, 408,
402, 402, 393, 384, 0, 0, 0, 0, 394, 393,
394, 0, 0, 0, 0, 395, 389, 389, 379, 384,
0, 0, 382, 371, 370, 367, 378, 363, 0, 376,
374, 0, 360, 359, 349, 332, 0, 341, 333, 0,
0, 0, 0, 0, 0, 323, 0, 0, 0, 0,
0, 319, 0, 0, 302, 137, 0, 0, 815, 471,
480, 489, 498, 507, 512, 521, 524, 527, 533, 542,
551, 555, 559, 563, 565, 573, 577, 584, 588
} ;
{ 0,
510, 510, 509, 3, 511, 511, 509, 7, 512, 512,
513, 513, 509, 509, 509, 509, 509, 509, 514, 515,
509, 509, 516, 509, 509, 509, 509, 509, 509, 509,
509, 509, 32, 509, 509, 509, 509, 509, 509, 517,
518, 509, 509, 509, 509, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 519, 509, 509, 509, 509,
519, 519, 519, 519, 519, 519, 519, 519, 519, 519,
519, 519, 519, 509, 509, 509, 520, 509, 509, 521,
520, 520, 509, 509, 509, 509, 509, 514, 509, 509,
514, 522, 509, 523, 509, 509, 509, 516, 509, 509,
516, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 32, 509, 509, 509, 509, 524, 509, 509,
509, 509, 509, 525, 518, 509, 509, 509, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
509, 509, 509, 509, 526, 509, 509, 519, 509, 509,
509, 509, 527, 519, 519, 519, 519, 519, 519, 519,
519, 519, 519, 519, 519, 519, 519, 519, 519, 519,
519, 519, 519, 519, 509, 509, 528, 520, 509, 521,
509, 521, 520, 520, 520, 520, 509, 509, 509, 529,
523, 509, 509, 509, 509, 509, 509, 524, 509, 509,
525, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
526, 509, 527, 519, 519, 519, 519, 519, 519, 519,
519, 519, 519, 519, 519, 519, 519, 519, 519, 519,
519, 519, 519, 519, 519, 519, 519, 519, 519, 519,
528, 520, 520, 529, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 519, 519, 519, 519, 519, 519,
519, 519, 519, 519, 519, 519, 519, 519, 519, 519,
519, 519, 519, 519, 519, 519, 519, 519, 519, 519,
519, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 519, 519, 519, 519, 519, 519, 519, 519, 519,
519, 519, 519, 519, 519, 519, 519, 519, 519, 519,
519, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 518, 518, 519, 519, 519, 519, 519, 519, 519,
519, 519, 519, 519, 519, 519, 519, 519, 519, 518,
518, 518, 518, 518, 518, 518, 518, 518, 518, 518,
518, 519, 519, 519, 519, 519, 519, 519, 519, 518,
518, 518, 518, 518, 518, 518, 518, 518, 519, 519,
519, 519, 519, 519, 518, 519, 518, 519, 0, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509
} ;
{ 0,
15, 16, 17, 16, 18, 19, 15, 20, 21, 22,
23, 24, 25, 26, 27, 28, 29, 30, 31, 32,
33, 34, 35, 36, 37, 38, 39, 40, 41, 41,
41, 41, 41, 41, 41, 42, 43, 44, 45, 41,
46, 47, 48, 49, 50, 51, 52, 41, 53, 41,
54, 41, 41, 55, 56, 57, 58, 59, 60, 61,
62, 63, 41, 41, 64, 65, 66, 67, 68, 71,
71, 139, 140, 69, 72, 72, 73, 74, 75, 74,
76, 73, 73, 76, 73, 73, 73, 73, 73, 76,
73, 77, 76, 76, 78, 79, 80, 76, 73, 73,
73, 73, 76, 73, 76, 76, 76, 76, 76, 76,
76, 76, 76, 76, 73, 73, 81, 76, 82, 83,
84, 85, 76, 76, 86, 76, 87, 76, 76, 76,
88, 89, 90, 91, 92, 93, 76, 76, 76, 76,
94, 73, 73, 73, 95, 109, 98, 99, 110, 96,
100, 98, 99, 105, 104, 100, 509, 123, 106, 112,
116, 277, 130, 278, 101, 102, 119, 124, 125, 101,
102, 113, 113, 131, 120, 117, 126, 127, 128, 111,
129, 129, 147, 509, 142, 143, 151, 156, 154, 157,
181, 159, 508, 152, 160, 297, 148, 155, 158, 153,
121, 132, 162, 133, 133, 298, 195, 169, 163, 164,
170, 171, 196, 134, 135, 236, 136, 137, 138, 183,
172, 246, 174, 173, 184, 190, 190, 247, 134, 135,
175, 182, 198, 236, 136, 190, 190, 176, 191, 192,
193, 199, 137, 201, 202, 138, 210, 206, 191, 192,
207, 208, 215, 286, 211, 109, 191, 216, 221, 287,
209, 212, 223, 223, 192, 227, 191, 193, 223, 223,
228, 229, 229, 509, 192, 224, 225, 226, 113, 113,
109, 224, 225, 110, 119, 129, 129, 237, 282, 222,
257, 267, 120, 224, 269, 134, 135, 258, 135, 224,
509, 225, 233, 233, 226, 237, 282, 225, 268, 270,
134, 135, 134, 135, 111, 135, 135, 234, 121, 234,
262, 275, 235, 235, 191, 190, 190, 134, 135, 276,
263, 264, 183, 135, 293, 302, 307, 184, 191, 192,
312, 294, 191, 309, 308, 310, 215, 223, 223, 109,
303, 216, 221, 224, 227, 236, 191, 507, 312, 228,
224, 225, 229, 229, 192, 235, 235, 237, 137, 233,
233, 224, 506, 236, 319, 320, 505, 504, 224, 134,
135, 333, 135, 222, 503, 237, 225, 313, 313, 502,
235, 235, 343, 137, 134, 135, 313, 313, 313, 334,
135, 135, 344, 135, 191, 192, 501, 373, 313, 313,
313, 313, 313, 313, 500, 499, 135, 374, 498, 497,
496, 135, 191, 495, 494, 493, 492, 491, 490, 489,
192, 313, 313, 488, 487, 486, 485, 484, 483, 482,
313, 313, 313, 481, 224, 225, 480, 479, 478, 477,
476, 475, 313, 313, 313, 313, 313, 313, 474, 473,
472, 471, 224, 470, 469, 468, 467, 466, 465, 464,
225, 14, 14, 14, 14, 14, 14, 14, 14, 14,
70, 70, 70, 70, 70, 70, 70, 70, 70, 97,
97, 97, 97, 97, 97, 97, 97, 97, 103, 103,
103, 103, 103, 103, 103, 103, 103, 108, 108, 108,
108, 108, 108, 108, 108, 108, 114, 114, 114, 114,
114, 118, 118, 118, 118, 118, 118, 118, 118, 118,
144, 144, 145, 145, 145, 145, 188, 188, 188, 188,
188, 188, 218, 463, 462, 218, 218, 218, 218, 218,
218, 220, 220, 220, 220, 220, 220, 220, 220, 220,
230, 230, 230, 230, 231, 231, 231, 231, 238, 238,
241, 241, 241, 281, 281, 461, 281, 281, 281, 281,
281, 281, 283, 283, 311, 311, 460, 311, 311, 311,
311, 311, 311, 314, 314, 314, 314, 459, 458, 457,
456, 455, 454, 453, 452, 451, 450, 449, 448, 447,
446, 445, 444, 443, 442, 441, 440, 439, 438, 437,
436, 435, 434, 433, 432, 431, 430, 429, 428, 427,
426, 425, 424, 423, 422, 421, 420, 419, 418, 417,
416, 415, 414, 413, 412, 411, 410, 409, 408, 407,
406, 405, 404, 403, 402, 401, 400, 399, 398, 397,
396, 395, 394, 393, 392, 391, 390, 389, 388, 387,
386, 385, 384, 383, 382, 381, 380, 379, 378, 377,
376, 375, 372, 371, 370, 369, 368, 367, 366, 365,
364, 363, 362, 361, 360, 359, 358, 357, 356, 355,
354, 353, 352, 351, 350, 349, 348, 347, 346, 345,
342, 341, 340, 339, 338, 337, 336, 335, 332, 331,
330, 329, 328, 327, 326, 325, 324, 323, 322, 321,
318, 317, 316, 315, 509, 219, 217, 306, 305, 304,
301, 300, 299, 296, 295, 292, 291, 290, 289, 288,
285, 284, 185, 280, 279, 274, 273, 272, 271, 266,
265, 261, 260, 259, 256, 255, 254, 253, 252, 251,
250, 249, 248, 245, 244, 243, 242, 240, 239, 232,
509, 509, 219, 217, 214, 213, 205, 204, 203, 200,
197, 194, 189, 187, 186, 185, 180, 179, 178, 177,
168, 167, 166, 165, 161, 150, 149, 146, 141, 122,
115, 107, 509, 104, 13, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509
} ;
{ 0,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 4, 5,
6, 36, 36, 4, 5, 6, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 8, 19, 9, 9, 19, 8,
9, 10, 10, 12, 12, 10, 33, 27, 12, 20,
22, 178, 31, 178, 9, 9, 23, 27, 29, 10,
10, 20, 20, 31, 23, 22, 29, 29, 30, 19,
30, 30, 45, 33, 38, 38, 48, 50, 49, 50,
65, 51, 506, 48, 51, 205, 45, 49, 50, 48,
23, 32, 53, 32, 32, 205, 82, 58, 53, 53,
58, 58, 82, 32, 32, 136, 32, 32, 32, 68,
58, 153, 59, 58, 68, 79, 79, 153, 32, 32,
59, 65, 84, 136, 32, 80, 80, 59, 79, 79,
79, 84, 32, 86, 86, 32, 91, 90, 80, 80,
90, 90, 95, 196, 91, 100, 79, 95, 100, 196,
90, 91, 101, 101, 79, 105, 80, 79, 102, 102,
105, 112, 112, 133, 80, 101, 101, 101, 113, 113,
108, 102, 102, 108, 118, 129, 129, 137, 191, 100,
164, 171, 118, 101, 172, 129, 129, 164, 129, 102,
133, 101, 132, 132, 101, 137, 191, 102, 171, 172,
129, 129, 132, 132, 108, 132, 129, 134, 118, 134,
168, 177, 134, 134, 192, 190, 190, 132, 132, 177,
168, 168, 183, 132, 202, 209, 213, 183, 190, 190,
224, 202, 192, 214, 213, 214, 215, 223, 223, 220,
209, 215, 220, 225, 227, 237, 190, 505, 224, 227,
223, 223, 229, 229, 190, 234, 234, 238, 238, 233,
233, 225, 502, 237, 246, 246, 496, 489, 223, 233,
233, 261, 233, 220, 488, 238, 223, 226, 226, 486,
235, 235, 270, 238, 233, 233, 226, 226, 226, 261,
233, 235, 270, 235, 283, 283, 485, 303, 226, 226,
226, 226, 226, 226, 484, 483, 235, 303, 481, 480,
478, 235, 283, 477, 476, 475, 474, 473, 470, 469,
283, 313, 313, 468, 467, 466, 461, 460, 459, 454,
313, 313, 313, 453, 313, 313, 452, 451, 450, 447,
442, 441, 313, 313, 313, 313, 313, 313, 440, 439,
434, 433, 313, 432, 431, 430, 428, 427, 426, 425,
313, 510, 510, 510, 510, 510, 510, 510, 510, 510,
511, 511, 511, 511, 511, 511, 511, 511, 511, 512,
512, 512, 512, 512, 512, 512, 512, 512, 513, 513,
513, 513, 513, 513, 513, 513, 513, 514, 514, 514,
514, 514, 514, 514, 514, 514, 515, 515, 515, 515,
515, 516, 516, 516, 516, 516, 516, 516, 516, 516,
517, 517, 518, 518, 518, 518, 519, 519, 519, 519,
519, 519, 520, 424, 423, 520, 520, 520, 520, 520,
520, 521, 521, 521, 521, 521, 521, 521, 521, 521,
522, 522, 522, 522, 523, 523, 523, 523, 524, 524,
525, 525, 525, 526, 526, 421, 526, 526, 526, 526,
526, 526, 527, 527, 528, 528, 420, 528, 528, 528,
528, 528, 528, 529, 529, 529, 529, 419, 418, 417,
415, 414, 413, 409, 408, 406, 405, 404, 403, 402,
401, 400, 399, 397, 396, 395, 394, 392, 391, 390,
388, 387, 386, 385, 384, 381, 379, 378, 377, 376,
374, 373, 372, 371, 370, 368, 367, 366, 364, 363,
362, 361, 359, 358, 357, 354, 353, 352, 350, 349,
348, 347, 345, 344, 343, 342, 341, 340, 339, 337,
336, 335, 334, 333, 332, 330, 329, 327, 326, 323,
322, 321, 320, 319, 316, 310, 309, 308, 307, 306,
305, 304, 302, 301, 300, 299, 298, 297, 296, 295,
293, 292, 291, 290, 289, 288, 287, 286, 285, 284,
280, 279, 278, 277, 276, 275, 274, 273, 272, 271,
269, 268, 267, 266, 265, 264, 263, 262, 260, 259,
257, 256, 255, 253, 252, 251, 250, 249, 248, 247,
245, 244, 243, 242, 222, 219, 216, 212, 211, 210,
208, 207, 206, 204, 203, 201, 200, 199, 198, 197,
195, 194, 184, 180, 179, 176, 175, 174, 173, 170,
169, 167, 166, 165, 163, 161, 160, 159, 158, 157,
156, 155, 154, 152, 151, 150, 149, 143, 139, 128,
121, 111, 98, 96, 93, 92, 89, 88, 87, 85,
83, 81, 78, 72, 71, 69, 63, 62, 61, 60,
57, 56, 55, 54, 52, 47, 46, 43, 37, 26,
21, 18, 13, 11, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509, 509, 509, 509, 509, 509, 509, 509,
509, 509, 509
} ;
/* Table of booleans, true if rule could match eol. */
{ 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0,
0, 0, 0, };
extern int yy_flex_debug;
int yy_flex_debug = 0;
static char *yy_full_match;
static int yy_lp;
static int yy_looking_for_trail_begin = 0;
static int yy_full_lp;
static int *yy_full_state;
#define REJECT \
{ \
++(yy_lp); \
goto find_rule; \
}
static int yy_more_offset = 0;
static int yy_prev_more_offset = 0;
#define YY_NEED_STRLEN
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET \
{ \
(yy_more_offset) = (yy_prev_more_offset); \
yyleng -= (yy_more_offset); \
}
#ifndef YYLMAX
#endif
char *yytext_ptr;
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
*/
#ifndef VBOX
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <ctype.h>
#include <errno.h>
#else /* VBOX */
# ifdef RT_OS_WINDOWS /* No unistd.h on windows, avoid redef warnings of the [U]INTxx_MAX defines caused by no inttypes.h/stdint.h. */
# define YY_NO_UNISTD_H
# endif
#endif /* VBOX */
#include <dt_impl.h>
#include <dt_grammar.h>
#include <dt_parser.h>
#include <dt_string.h>
#ifndef USING_FLEX
/*
* We need to undefine lex's input and unput macros so that references to these
* call the functions provided at the end of this source file.
*/
#else /* USING_FLEX */
do { \
/*YY_FATAL_ERROR("input in flex scanner failed");*/ \
} else { \
/*fprintf(stderr, "yy_input -> %d '%.*s'\n", result, result, buf);*/ \
} else { \
buf[0] = '\0'; \
result = 0; \
/*fprintf(stderr, "yy_input -> %d\n", result);*/ \
} \
} \
} while (0)
#endif /* USING_FLEX */
static int id_or_type(const char *);
#ifndef USING_FLEX
static int input(void);
static void unput(int);
#endif
/*
* We first define a set of labeled states for use in the D lexer and then a
* set of regular expressions to simplify things below. The lexer states are:
*
* S0 - D program clause and expression lexing
* S1 - D comments (i.e. skip everything until end of comment)
* S2 - D program outer scope (probe specifiers and declarations)
* S3 - D control line parsing (i.e. after ^# is seen but before \n)
* S4 - D control line scan (locate control directives only and invoke S3)
*/
#define INITIAL 0
#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 );
yy_size_t 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 yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int );
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst 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
#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().
*/
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
yy_size_t n; \
for ( n = 0; n < max_size && \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else \
{ \
errno=0; \
{ \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
} \
}\
\
#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
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#endif
/* end tables serialization structures and prototypes */
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
extern 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 break;
#endif
#define YY_RULE_SETUP \
if ( yyleng > 0 ) \
/** The main scanner function which does all the work.
*/
{
register int yy_act;
/*
* We insert a special prologue into yylex() itself: if the pcb contains a
* context token, we return that prior to running the normal lexer. This
* allows libdtrace to force yacc into one of our three parsing contexts: D
* expression (DT_CTX_DEXPR), D program (DT_CTX_DPROG) or D type (DT_CTX_DTYPE).
* Once the token is returned, we clear it so this only happens once.
*/
return (tok);
}
if ( !(yy_init) )
{
(yy_init) = 1;
#ifdef YY_USER_INIT
#endif
/* Create the reject buffer large enough to save one state per allowed character. */
if ( ! (yy_state_buf) )
if ( ! (yy_state_buf) )
YY_FATAL_ERROR( "out of dynamic memory in yylex()" );
if ( ! (yy_start) )
if ( ! yyin )
if ( ! yyout )
if ( ! YY_CURRENT_BUFFER ) {
}
}
while ( 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_current_state = (yy_start);
yy_current_state += YY_AT_BOL();
(yy_state_ptr) = (yy_state_buf);
*(yy_state_ptr)++ = yy_current_state;
do
{
{
if ( yy_current_state >= 510 )
}
*(yy_state_ptr)++ = yy_current_state;
++yy_cp;
}
while ( yy_current_state != 509 );
yy_current_state = *--(yy_state_ptr);
goto find_rule; /* Shut up GCC warning -Wall */
find_rule: /* we branch to this label when backing up */
for ( ; ; ) /* until we find what rule we matched */
{
{
if ( yy_act & YY_TRAILING_HEAD_MASK ||
{
if ( yy_act == (yy_looking_for_trail_begin) )
{
(yy_looking_for_trail_begin) = 0;
break;
}
}
else if ( yy_act & YY_TRAILING_MASK )
{
(yy_full_match) = yy_cp;
(yy_full_state) = (yy_state_ptr);
(yy_full_lp) = (yy_lp);
}
else
{
(yy_full_match) = yy_cp;
(yy_full_state) = (yy_state_ptr);
(yy_full_lp) = (yy_lp);
break;
}
++(yy_lp);
goto find_rule;
}
--yy_cp;
yy_current_state = *--(yy_state_ptr);
}
{
yylineno++;
;
}
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 1:
return (DT_KEY_AUTO);
case 2:
return (DT_KEY_BREAK);
case 3:
return (DT_KEY_CASE);
case 4:
return (DT_KEY_CHAR);
case 5:
return (DT_KEY_CONST);
case 6:
return (DT_KEY_CONTINUE);
case 7:
return (DT_KEY_COUNTER);
case 8:
return (DT_KEY_DEFAULT);
case 9:
return (DT_KEY_DO);
case 10:
return (DT_KEY_DOUBLE);
case 11:
return (DT_KEY_ELSE);
case 12:
return (DT_KEY_ENUM);
case 13:
return (DT_KEY_EXTERN);
case 14:
return (DT_KEY_FLOAT);
case 15:
return (DT_KEY_FOR);
case 16:
return (DT_KEY_GOTO);
case 17:
return (DT_KEY_IF);
case 18:
return (DT_KEY_IMPORT);
case 19:
return (DT_KEY_INLINE);
case 20:
return (DT_KEY_INT);
case 21:
return (DT_KEY_LONG);
case 22:
return (DT_TOK_OFFSETOF);
case 23:
return (DT_KEY_PROBE);
case 24:
return (DT_KEY_PROVIDER);
case 25:
return (DT_KEY_REGISTER);
case 26:
return (DT_KEY_RESTRICT);
case 27:
return (DT_KEY_RETURN);
case 28:
return (DT_KEY_SELF);
case 29:
return (DT_KEY_SHORT);
case 30:
return (DT_KEY_SIGNED);
case 31:
return (DT_TOK_SIZEOF);
case 32:
return (DT_KEY_STATIC);
case 33:
return (DT_KEY_STRING);
case 34:
return (DT_TOK_STRINGOF);
case 35:
return (DT_KEY_STRUCT);
case 36:
return (DT_KEY_SWITCH);
case 37:
return (DT_KEY_THIS);
case 38:
return (DT_KEY_XLATOR);
case 39:
return (DT_KEY_TYPEDEF);
case 40:
return (DT_KEY_UNION);
case 41:
return (DT_KEY_UNSIGNED);
case 42:
return (DT_KEY_VOID);
case 43:
return (DT_KEY_VOLATILE);
case 44:
return (DT_KEY_WHILE);
case 45:
return (DT_TOK_XLATE);
case 46:
case 47:
case 48:
case 49:
case 50:
case 51:
case 52:
case 53:
case 54:
case 55:
case 56:
case 57:
case 58:
case 59:
case 60:
case 61:
case 62:
case 63:
case 64:
case 65:
case 66:
case 67:
case 68:
case 69:
case 70:
case 71:
case 72:
case 73:
case 74:
{
char *v = "";
/*
* A macro argument reference substitutes the text of
* an argument in place of the current token. When we
* see $$<d> we fetch the saved string from pcb_sargv
* (or use the default argument if the option has been
* set and the argument hasn't been specified) and
* return a token corresponding to this string.
*/
"not defined\n", yytext);
}
}
return (DT_TOK_STRING);
}
case 75:
{
char *p, *v = "0";
/*
* A macro argument reference substitutes the text of
* one identifier or integer pattern for another. When
* we see $<d> we fetch the saved string from pcb_sargv
* (or use the default argument if the option has been
* set and the argument hasn't been specified) and
* return a token corresponding to this string.
*/
"not defined\n", yytext);
}
}
/*
* If the macro text is not a valid integer or ident,
* then we treat it as a string. The string may be
* optionally enclosed in quotes, which we strip.
*/
if (strbadidnum(v)) {
else
return (DT_TOK_STRING);
}
/*
* If the macro text is not a string an begins with a
* digit or a +/- sign, process it as an integer token.
*/
#ifdef VBOX
int rc;
#endif
if (isdigit(v[0]))
yyintprefix = 0;
else
yyintprefix = *v++;
#ifndef VBOX
errno = 0;
#else
#endif
(void) strncpy(yyintsuffix, p,
sizeof (yyintsuffix));
yyintdecimal = *v != '0';
#ifndef VBOX
#else
#endif
" %s constant %s results in integer"
" overflow\n", yytext, v);
return (DT_TOK_INT);
}
return (id_or_type(v));
}
case 76:
{
char s[16]; /* enough for UINT_MAX + \0 */
"is not defined\n", yytext);
}
/*
* For the moment, all current macro variables are of
* type id_t (refer to dtrace_update() for details).
*/
return (DT_TOK_STRING);
}
case 77:
{
"is not defined\n", yytext);
}
/*
* For the moment, all current macro variables are of
* type id_t (refer to dtrace_update() for details).
*/
yyintprefix = 0;
yyintsuffix[0] = '\0';
yyintdecimal = 1;
return (DT_TOK_INT);
}
case 78:
{
return (id_or_type(yytext));
}
case 79:
{
return (DT_TOK_AGG);
}
case 80:
{
return (DT_TOK_AGG);
}
case 81:
case 82:
case 83:
{
char *p;
#ifndef VBOX
errno = 0;
#else
#endif
yyintprefix = 0;
#ifndef VBOX
#else
#endif
"integer overflow\n", yytext);
"invalid digit %c\n", yytext, *p);
}
return (DT_TOK_INT);
}
case 84:
yyerror("floating-point constants are not permitted\n");
/* VBOX changed:
<S0>\"{RGX_STR}$ |
<S3>\"{RGX_STR}$ xyerror(D_STR_NL, "newline encountered in string literal");
input: */
case 85:
case 86:
case 87:
{
/*
* Quoted string -- convert C escape sequences and
* return the string as a token.
*/
return (DT_TOK_STRING);
}
case 88:
case 89:
{
char *s, *p, *q;
/*
* Character constant -- convert C escape sequences and
* return the character as an integer immediate value.
*/
if (yyleng == 2)
s = yytext + 1;
nbytes = stresc2chr(s);
yyintprefix = 0;
yyintsuffix[0] = '\0';
yyintdecimal = 1;
"too long");
}
#ifdef _LITTLE_ENDIAN
*p-- = *q++;
#else
#endif
return (DT_TOK_INT);
}
case 90:
case 91:
{
}
case 92:
case 93:
; /* discard any #! lines */
case 94:
case 95:
case 96:
{
}
case 97:
; /* discard */
case 98:
/* rule 98 can match eol */
; /* discard */
case 99:
{
int c, tok;
/*
* The use of "/" as the predicate delimiter and as the
* integer division symbol requires special lookahead
* We look ahead to the next non-whitespace character.
* If we encounter EOF, ";", "{", or "/", then this "/"
* closes the predicate and we return DT_TOK_EPRED.
* If we encounter anything else, it's DT_TOK_DIV.
*/
while ((c = input()) != 0) {
break;
}
if (c == 0 || c == ';' || c == '{' || c == '/') {
if (yypcb->pcb_parens != 0) {
yyerror("closing ) expected in "
"predicate before /\n");
}
if (yypcb->pcb_brackets != 0) {
yyerror("closing ] expected in "
"predicate before /\n");
}
tok = DT_TOK_EPRED;
} else
tok = DT_TOK_DIV;
return (tok);
}
case 100:
{
yypcb->pcb_parens++;
return (DT_TOK_LPAR);
}
case 101:
{
if (--yypcb->pcb_parens < 0)
yyerror("extra ) in input stream\n");
return (DT_TOK_RPAR);
}
case 102:
{
yypcb->pcb_brackets++;
return (DT_TOK_LBRAC);
}
case 103:
{
if (--yypcb->pcb_brackets < 0)
yyerror("extra ] in input stream\n");
return (DT_TOK_RBRAC);
}
case 104:
case 105:
{
yypcb->pcb_braces++;
return ('{');
}
case 106:
{
if (--yypcb->pcb_braces < 0)
yyerror("extra } in input stream\n");
return ('}');
}
case 107:
return (DT_TOK_BOR);
case 108:
return (DT_TOK_XOR);
case 109:
return (DT_TOK_BAND);
case 110:
return (DT_TOK_LAND);
case 111:
return (DT_TOK_LXOR);
case 112:
return (DT_TOK_LOR);
case 113:
return (DT_TOK_EQU);
case 114:
return (DT_TOK_NEQ);
case 115:
return (DT_TOK_LT);
case 116:
return (DT_TOK_LE);
case 117:
return (DT_TOK_GT);
case 118:
return (DT_TOK_GE);
case 119:
return (DT_TOK_LSH);
case 120:
return (DT_TOK_RSH);
case 121:
return (DT_TOK_ADD);
case 122:
return (DT_TOK_SUB);
case 123:
return (DT_TOK_MUL);
case 124:
return (DT_TOK_MOD);
case 125:
return (DT_TOK_BNEG);
case 126:
return (DT_TOK_LNEG);
case 127:
return (DT_TOK_QUESTION);
case 128:
return (DT_TOK_COLON);
case 129:
return (DT_TOK_DOT);
case 130:
return (DT_TOK_PTR);
case 131:
return (DT_TOK_ASGN);
case 132:
return (DT_TOK_ADD_EQ);
case 133:
return (DT_TOK_SUB_EQ);
case 134:
return (DT_TOK_MUL_EQ);
case 135:
return (DT_TOK_DIV_EQ);
case 136:
return (DT_TOK_MOD_EQ);
case 137:
return (DT_TOK_AND_EQ);
case 138:
return (DT_TOK_XOR_EQ);
case 139:
return (DT_TOK_OR_EQ);
case 140:
return (DT_TOK_LSH_EQ);
case 141:
return (DT_TOK_RSH_EQ);
case 142:
return (DT_TOK_ADDADD);
case 143:
return (DT_TOK_SUBSUB);
case 144:
return (DT_TOK_ELLIPSIS);
case 145:
return (DT_TOK_COMMA);
case 146:
return (';');
case 147:
/* rule 147 can match eol */
; /* discard */
case 148:
/* rule 148 can match eol */
; /* discard */
case 149:
case 150:
yyerror("/* encountered inside a comment\n");
case 151:
/* VBOX - START */
case YY_STATE_EOF(S1):
yyerror("end-of-file encountered before matching */\n");
/* VBOX - END */
case 152:
/* rule 152 can match eol */
; /* discard */
case 153:
{
/*
* S2 has an ambiguity because RGX_PSPEC includes '*'
* as a glob character and '*' also can be DT_TOK_STAR.
* Since lex always matches the longest token, this
* rule can be matched by an input string like "int*",
* which could begin a global variable declaration such
* as "int*x;" or could begin a RGX_PSPEC with globbing
* such as "int* { trace(timestamp); }". If C_PSPEC is
* not set, we must resolve the ambiguity in favor of
* the type and perform lexer pushback if the fragment
* before '*' or entire fragment matches a type name.
* If C_PSPEC is set, we always return a PSPEC token.
* If C_PSPEC is off, the user can avoid ambiguity by
* including a ':' delimiter in the specifier, which
* they should be doing anyway to specify the provider.
*/
*p = '\0'; /* prune yytext */
}
for (*p = '*'; q >= p; q--)
unput(*q);
}
return (DT_TOK_TNAME);
}
*p = '*'; /* restore yytext */
}
return (DT_TOK_PSPEC);
}
case 154:
return (DT_TOK_DIV);
case 155:
return (DT_TOK_COMMA);
case 156:
/* rule 156 can match eol */
; /* discard */
case 157:
case 158:
/* rule 158 can match eol */
{
}
case 159:
; /* discard */
case 160:
{
/*
* We want to call dt_node_ident() here, but we can't
* because it will expand inlined identifiers, which we
* don't want to do from #pragma context in order to
* support pragmas that apply to the ident itself. We
* call dt_node_string() and then reset dn_op instead.
*/
}
/* VBOX - BEGIN */
case YY_STATE_EOF(S3):
yyerror("end-of-file encountered before end of control line\n");
/* VBOX - END */
case 161:
case 162:
ECHO;
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(S0):
case YY_STATE_EOF(S2):
case YY_STATE_EOF(S4):
yyterminate();
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = (yy_hold_char);
{
/* 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.
*/
}
/* 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().
*/
{ /* This was really a NUL. */
/* 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).
*/
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++(yy_c_buf_p);
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.
*/
goto do_action;
}
else
{
if ( ! (yy_did_buffer_switch_on_eof) )
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) =
yy_cp = (yy_c_buf_p);
goto yy_match;
case EOB_ACT_LAST_MATCH:
(yy_c_buf_p) =
yy_cp = (yy_c_buf_p);
goto yy_find_action;
}
break;
}
default:
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
} /* 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)
{
register int number_to_move, i;
int ret_val;
"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. */
{
/* 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. */
for ( i = 0; i < number_to_move; ++i )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
else
{
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
}
if ( num_to_read > YY_READ_BUF_SIZE )
/* Read in more data. */
(yy_n_chars), num_to_read );
}
if ( (yy_n_chars) == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
}
else
{
}
}
else
/* Extend the array by 50%, plus the number we really need. */
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size );
if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
}
(yy_n_chars) += number_to_move;
return ret_val;
}
/* yy_get_previous_state - get the state just before the EOB char was reached */
{
register char *yy_cp;
yy_current_state = (yy_start);
yy_current_state += YY_AT_BOL();
(yy_state_ptr) = (yy_state_buf);
*(yy_state_ptr)++ = yy_current_state;
{
{
if ( yy_current_state >= 510 )
}
*(yy_state_ptr)++ = yy_current_state;
}
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 );
*/
{
register int yy_is_jam;
{
if ( yy_current_state >= 510 )
}
if ( ! yy_is_jam )
*(yy_state_ptr)++ = yy_current_state;
return yy_is_jam ? 0 : yy_current_state;
}
{
register char *yy_cp;
yy_cp = (yy_c_buf_p);
/* undo effects of setting up yytext */
*yy_cp = (yy_hold_char);
{ /* need to shift things up to make room */
/* +2 for EOB chars. */
register char *source =
YY_FATAL_ERROR( "flex scanner push-back overflow" );
}
*--yy_cp = (char) c;
if ( c == '\n' ){
--yylineno;
}
(yytext_ptr) = yy_bp;
(yy_hold_char) = *yy_cp;
(yy_c_buf_p) = yy_cp;
}
#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.
*/
/* This was really a NUL. */
*(yy_c_buf_p) = '\0';
else
{ /* need more input */
++(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. */
/*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
if ( yywrap( ) )
return 0;
if ( ! (yy_did_buffer_switch_on_eof) )
#ifdef __cplusplus
return yyinput();
#else
return input();
#endif
}
case EOB_ACT_CONTINUE_SCAN:
break;
}
}
}
c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
(yy_hold_char) = *++(yy_c_buf_p);
if ( YY_CURRENT_BUFFER_LVALUE->yy_at_bol )
yylineno++;
;
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 .
*/
{
if ( ! YY_CURRENT_BUFFER ){
}
}
/** Switch to a different input buffer.
* @param new_buffer The new input buffer.
*
*/
{
/* TODO. We should be able to replace this entire function body
* with
* yypop_buffer_state();
* yypush_buffer_state(new_buffer);
*/
if ( YY_CURRENT_BUFFER == new_buffer )
return;
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
}
/* 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_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.
*/
{
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.
*/
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()
*
*/
{
if ( ! b )
return;
if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
if ( b->yy_is_our_buffer )
yyfree((void *) b );
}
#ifndef __cplusplus
extern int isatty (int );
#endif /* __cplusplus */
/* 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.
*/
{
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;
}
}
/** 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.
*
*/
{
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_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
if ( b == YY_CURRENT_BUFFER )
}
/** 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.
*
*/
{
if (new_buffer == NULL)
return;
/* 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);
}
/* Only push if top exists. Otherwise, replace top. */
if (YY_CURRENT_BUFFER)
(yy_buffer_stack_top)++;
/* copied from yy_switch_to_buffer. */
(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;
if ((yy_buffer_stack_top) > 0)
--(yy_buffer_stack_top);
if (YY_CURRENT_BUFFER) {
(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)
{
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 realloc on the next call.
*/
num_to_alloc = 1;
(num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
(yy_buffer_stack_top) = 0;
return;
}
/* Increase the buffer to prepare for a possible push. */
((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.*/
}
}
/** 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.
*/
{
if ( size < 2 ||
/* They forgot to leave room for the EOB's. */
return 0;
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
b->yy_is_our_buffer = 0;
b->yy_input_file = 0;
b->yy_n_chars = b->yy_buf_size;
b->yy_is_interactive = 0;
b->yy_at_bol = 1;
b->yy_fill_buffer = 0;
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.
*/
{
}
/** 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 bytes the byte buffer to scan
* @param len the number of bytes in the buffer pointed to by @a bytes.
*
* @return the newly allocated buffer state object.
*/
{
char *buf;
yy_size_t n, i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = _yybytes_len + 2;
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
for ( i = 0; i < _yybytes_len; ++i )
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
#endif
{
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
int yyless_macro_arg = (n); \
(yy_hold_char) = *(yy_c_buf_p); \
*(yy_c_buf_p) = '\0'; \
yyleng = yyless_macro_arg; \
} \
while ( 0 )
/** Get the current line number.
*
*/
int yyget_lineno (void)
{
return yylineno;
}
/** Get the input stream.
*
*/
{
return yyin;
}
/** Get the output stream.
*
*/
{
return yyout;
}
/** Get the length of the current token.
*
*/
{
return yyleng;
}
/** Get the current token.
*
*/
char *yyget_text (void)
{
return yytext;
}
/** Set the current line number.
* @param 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
*/
{
}
{
}
int yyget_debug (void)
{
return yy_flex_debug;
}
{
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.
*/
/* We do not touch yylineno unless the option is enabled. */
yylineno = 1;
(yy_buffer_stack) = 0;
(yy_buffer_stack_top) = 0;
(yy_buffer_stack_max) = 0;
(yy_c_buf_p) = (char *) 0;
(yy_init) = 0;
(yy_start) = 0;
(yy_state_buf) = 0;
(yy_state_ptr) = 0;
(yy_full_match) = 0;
(yy_lp) = 0;
/* Defined in main.c */
#ifdef YY_STDINIT
#else
#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){
}
/* Destroy the stack itself. */
yyfree((yy_buffer_stack) );
(yy_buffer_stack) = NULL;
yyfree ( (yy_state_buf) );
(yy_state_buf) = 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
{
register int i;
for ( i = 0; i < n; ++i )
}
#endif
#ifdef YY_NEED_STRLEN
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
{
}
{
/* 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.
*/
}
{
}
/*
* yybegin provides a wrapper for use from C code around the lex BEGIN() macro.
* We use two main states for lexing because probe descriptions use a syntax
* that is incompatible with the normal D tokens (e.g. names can contain "-").
* yybegin also handles the job of switching between two lists of dt_nodes
* as we allocate persistent definitions, like inlines, and transient nodes
* that will be freed once we are done parsing the current program file.
*/
void
{
#ifdef YYDEBUG
#endif
return; /* nothing to do if we're in the state already */
}
switch (state) {
case YYS_CLAUSE:
break;
case YYS_DEFINE:
/*FALLTHRU*/
case YYS_EXPR:
break;
case YYS_DONE:
break;
case YYS_CONTROL:
break;
default:
}
}
void
{
yylineno = 1;
#ifndef USING_FLEX
#else
#endif
}
/*
* Given a lexeme 's' (typically yytext), set yylval and return an appropriate
* token to the parser indicating either an identifier or a typedef name.
* User-defined global variables always take precedence over types, but we do
* use some heuristics because D programs can look at an ever-changing set of
* kernel types and also can implicitly instantiate variables by assignment,
* unlike in C. The code here is ordered carefully as lookups are not cheap.
*/
static int
id_or_type(const char *s)
{
/*
* If the lexeme is a global variable or likely identifier or *not* a
* type_name, then it is an identifier token.
*/
dt_type_lookup(s, NULL) != 0)
return (DT_TOK_IDENT);
/*
* If we're in the midst of parsing a declaration and a type_specifier
* has already been shifted, then return DT_TOK_IDENT instead of TNAME.
* This semantic is necessary to permit valid ISO C code such as:
*
* typedef int foo;
* struct s { foo foo; };
*
* of the grammar. The result is that we must check for conflicting
* redeclarations of the same identifier as part of dt_node_decl().
*/
return (DT_TOK_IDENT);
/*
* If the lexeme is a type name and we are not in a program clause,
* then always interpret it as a type and return DT_TOK_TNAME.
*/
return (DT_TOK_TNAME);
/*
* If the lexeme matches a type name but is in a program clause, then
* it could be a type or it could be an undefined variable. Peek at
* the next token to decide. If we see ++, --, [, or =, we know there
* might be an assignment that is trying to create a global variable,
* so we optimistically return DT_TOK_IDENT. There is no harm in being
* wrong: a type_name followed by ++, --, [, or = is a syntax error.
*/
break;
}
switch (c0) {
case '+':
case '-':
ttok = DT_TOK_IDENT;
break;
case '=':
ttok = DT_TOK_IDENT;
break;
case '[':
ttok = DT_TOK_IDENT;
break;
}
if (ttok == DT_TOK_IDENT) {
}
return (ttok);
}
#ifndef USING_FLEX
static int
input(void)
{
int c;
c = *--yysptr;
c = *(unsigned char *)(yypcb->pcb_strptr++);
else
c = EOF;
if (c == '\n')
yylineno++;
if (c != EOF)
return (c);
yyerror("end-of-file encountered before matching */\n");
yyerror("end-of-file encountered before end of control line\n");
return (0); /* EOF */
}
static void
unput(int c)
{
if (c == '\n')
yylineno--;
*yysptr++ = c;
yytchar = c;
}
#endif /* USING_FLEX */