4990 lines
123 KiB
C++
4990 lines
123 KiB
C++
#include "RenderPCH.h"
|
|
#include "nvparse.h"
|
|
#include "macro.h"
|
|
|
|
#define yy_create_buffer vs10__create_buffer
|
|
#define yy_delete_buffer vs10__delete_buffer
|
|
#define yy_scan_buffer vs10__scan_buffer
|
|
#define yy_scan_string vs10__scan_string
|
|
#define yy_scan_bytes vs10__scan_bytes
|
|
#define yy_flex_debug vs10__flex_debug
|
|
#define yy_init_buffer vs10__init_buffer
|
|
#define yy_flush_buffer vs10__flush_buffer
|
|
#define yy_load_buffer_state vs10__load_buffer_state
|
|
#define yy_switch_to_buffer vs10__switch_to_buffer
|
|
#define yyin vs10_in
|
|
#define yyleng vs10_leng
|
|
#define yylex vs10_lex
|
|
#define yyout vs10_out
|
|
#define yyrestart vs10_restart
|
|
#define yytext vs10_text
|
|
#define yywrap vs10_wrap
|
|
|
|
#line 20 "_vs1.0_lexer.cpp"
|
|
/* A lexical scanner generated by flex */
|
|
|
|
/* Scanner skeleton version:
|
|
* $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.85 95/04/24 10:48:47 vern Exp $
|
|
*/
|
|
|
|
#define FLEX_SCANNER
|
|
#define YY_FLEX_MAJOR_VERSION 2
|
|
#define YY_FLEX_MINOR_VERSION 5
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
|
|
#ifdef c_plusplus
|
|
#ifndef __cplusplus
|
|
#define __cplusplus
|
|
#endif
|
|
#endif
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
/* Use prototypes in function declarations. */
|
|
#define YY_USE_PROTOS
|
|
|
|
/* The "const" storage-class-modifier is valid. */
|
|
#define YY_USE_CONST
|
|
|
|
#else /* ! __cplusplus */
|
|
|
|
#if __STDC__
|
|
|
|
#define YY_USE_PROTOS
|
|
#define YY_USE_CONST
|
|
|
|
#endif /* __STDC__ */
|
|
#endif /* ! __cplusplus */
|
|
|
|
#ifdef __TURBOC__
|
|
#pragma warn -rch
|
|
#pragma warn -use
|
|
#include <io.h>
|
|
#include <stdlib.h>
|
|
#define YY_USE_CONST
|
|
#define YY_USE_PROTOS
|
|
#endif
|
|
|
|
#ifdef YY_USE_CONST
|
|
#define yyconst const
|
|
#else
|
|
#define yyconst
|
|
#endif
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
#define YY_PROTO(proto) proto
|
|
#else
|
|
#define YY_PROTO(proto) ()
|
|
#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.
|
|
*/
|
|
#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. */
|
|
#define YY_BUF_SIZE 16384
|
|
|
|
typedef struct yy_buffer_state *YY_BUFFER_STATE;
|
|
|
|
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
|
|
|
|
/* The funky do-while in the following #define is used to turn the definition
|
|
* int a single C statement (which needs a semi-colon terminator). This
|
|
* avoids problems with code like:
|
|
*
|
|
* if ( condition_holds )
|
|
* yyless( 5 );
|
|
* else
|
|
* do_something_else();
|
|
*
|
|
* Prior to using the do-while the compiler would get upset at the
|
|
* "else" because it interpreted the "if" statement as being all
|
|
* done when it reached the ';' after the yyless() call.
|
|
*/
|
|
|
|
/* Return all but the first 'n' matched characters back to the input stream. */
|
|
|
|
#define yyless(n) \
|
|
do \
|
|
{ \
|
|
/* Undo effects of setting up yytext. */ \
|
|
*yy_cp = yy_hold_char; \
|
|
yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
|
|
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
|
|
} \
|
|
while ( 0 )
|
|
|
|
#define unput(c) yyunput( c, yytext_ptr )
|
|
|
|
/* The following is because we cannot portably get our hands on size_t
|
|
* (without autoconf's help, which isn't available because we want
|
|
* flex-generated scanners to compile on their own).
|
|
*/
|
|
typedef unsigned int yy_size_t;
|
|
|
|
|
|
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.
|
|
*/
|
|
yy_size_t 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 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
|
|
#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
|
|
};
|
|
|
|
static YY_BUFFER_STATE yy_current_buffer = 0;
|
|
|
|
/* 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".
|
|
*/
|
|
#define YY_CURRENT_BUFFER yy_current_buffer
|
|
|
|
|
|
/* 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 = (char *) 0;
|
|
static int yy_init = 1; /* 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 YY_PROTO(( FILE *input_file ));
|
|
|
|
void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
|
|
void yy_load_buffer_state YY_PROTO(( void ));
|
|
YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
|
|
void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
|
|
void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
|
|
void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
|
|
#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
|
|
|
|
YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
|
|
YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *str ));
|
|
YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
|
|
|
|
static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
|
|
static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
|
|
static void yy_flex_free YY_PROTO(( void * ));
|
|
|
|
#define yy_new_buffer yy_create_buffer
|
|
|
|
#define yy_set_interactive(is_interactive) \
|
|
{ \
|
|
if ( ! yy_current_buffer ) \
|
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
|
|
yy_current_buffer->yy_is_interactive = is_interactive; \
|
|
}
|
|
|
|
#define yy_set_bol(at_bol) \
|
|
{ \
|
|
if ( ! yy_current_buffer ) \
|
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
|
|
yy_current_buffer->yy_at_bol = at_bol; \
|
|
}
|
|
|
|
#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
|
|
|
|
|
|
#define YY_USES_REJECT
|
|
typedef unsigned char YY_CHAR;
|
|
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
|
|
typedef int yy_state_type;
|
|
extern char *yytext;
|
|
#define yytext_ptr yytext
|
|
|
|
static yy_state_type yy_get_previous_state YY_PROTO(( void ));
|
|
static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
|
|
static int yy_get_next_buffer YY_PROTO(( void ));
|
|
static void yy_fatal_error YY_PROTO(( yyconst 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 72
|
|
#define YY_END_OF_BUFFER 73
|
|
static yyconst short int yy_acclist[406] =
|
|
{ 0,
|
|
2, 2, 56, 56, 46, 46, 31, 31, 29, 29,
|
|
73, 69, 71, 72, 64, 69, 71, 72, 66, 69,
|
|
72, 71, 72, 71, 72, 63, 71, 72, 63, 71,
|
|
72, 37, 63, 71, 72, 63, 71, 72, 36, 71,
|
|
72, 13, 71, 72, 62, 71, 72, 62, 63, 71,
|
|
72, 62, 71, 72, 62, 71, 72, 62, 71, 72,
|
|
62, 71, 72, 62, 71, 72, 64, 69, 71, 72,
|
|
16, 63, 71, 72, 72, 72, 22, 65, 72, 21,
|
|
72, 23, 72, 72, 34, 72, 72, 20, 72, 68,
|
|
70, 72, 68, 72, 70, 72, 67, 70, 72, 2,
|
|
|
|
72, 1, 72, 41, 72, 41, 42, 72, 56, 72,
|
|
56, 72, 57, 72, 56, 72, 56, 72, 56, 72,
|
|
50, 72, 46, 50, 72, 49, 72, 48, 72, 50,
|
|
72, 47, 50, 72, 72, 72, 59, 72, 72, 72,
|
|
61, 72, 72, 40, 72, 40, 62, 72, 39, 40,
|
|
62, 72, 45, 72, 44, 45, 72, 43, 45, 72,
|
|
72, 27, 72, 31, 72, 31, 72, 32, 72, 31,
|
|
72, 29, 72, 30, 72, 51, 72, 64, 15, 17,
|
|
14, 36, 13, 62, 62, 3, 62, 6, 62, 62,
|
|
62, 62, 62, 5, 62, 4, 62, 62, 64, 16,
|
|
|
|
16, 19, 34, 20, 67, 2, 1, 41, 56, 56,
|
|
56, 56, 17, 56, 56, 54, 56, 50, 46, 50,
|
|
47, 50, 47, 50, 47, 59, 61, 60, 61, 39,
|
|
39, 39, 62, 44, 27, 31, 31, 31, 31, 29,
|
|
51, 53, 51, 51, 14, 12, 12, 62, 3, 12,
|
|
3, 12, 6, 12, 6, 12, 8, 62, 62, 62,
|
|
62, 7, 62, 5, 12, 5, 12, 4, 12, 4,
|
|
12, 16, 56, 39, 62, 31, 31, 31, 52, 3,
|
|
3, 6, 6, 8, 12, 8, 12, 9, 62, 10,
|
|
62, 11, 62, 7, 12, 7, 12, 5, 5, 4,
|
|
|
|
4, 55, 56, 38, 39, 62, 31, 31, 26, 8,
|
|
8, 9, 12, 9, 12, 10, 12, 10, 12, 11,
|
|
12, 11, 12, 7, 7, 55, 56, 56, 55, 56,
|
|
58, 59, 38, 39, 38, 39, 26, 31, 31, 26,
|
|
26, 28, 9, 9, 10, 10, 11, 11, 35, 55,
|
|
56, 55, 56, 55, 56, 55, 56, 26, 31, 31,
|
|
26, 31, 28, 31, 26, 26, 26, 28, 28, 24,
|
|
35, 35, 55, 56, 55, 56, 26, 31, 26, 31,
|
|
26, 31, 28, 31, 31, 28, 31, 33, 26, 28,
|
|
28, 28, 25, 26, 31, 28, 31, 28, 31, 28,
|
|
|
|
31, 28, 18, 28, 31
|
|
} ;
|
|
|
|
static yyconst short int yy_accept[330] =
|
|
{ 0,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 2, 3, 3,
|
|
3, 4, 5, 6, 7, 7, 7, 7, 7, 7,
|
|
7, 7, 7, 7, 7, 8, 9, 10, 11, 11,
|
|
11, 12, 15, 19, 22, 24, 26, 29, 32, 36,
|
|
39, 42, 45, 48, 52, 55, 58, 61, 64, 67,
|
|
71, 75, 76, 77, 80, 82, 84, 85, 87, 88,
|
|
90, 93, 95, 97, 100, 102, 104, 106, 109, 111,
|
|
113, 115, 117, 119, 121, 123, 126, 128, 130, 132,
|
|
135, 136, 137, 139, 140, 141, 143, 144, 146, 149,
|
|
|
|
153, 155, 158, 161, 162, 164, 166, 168, 170, 172,
|
|
174, 176, 178, 179, 179, 179, 179, 179, 179, 180,
|
|
181, 182, 183, 184, 185, 186, 188, 190, 191, 192,
|
|
193, 194, 196, 198, 199, 200, 201, 202, 202, 203,
|
|
203, 204, 204, 205, 206, 207, 208, 209, 210, 211,
|
|
212, 213, 215, 216, 217, 218, 219, 221, 223, 225,
|
|
226, 226, 227, 227, 227, 227, 227, 228, 228, 230,
|
|
231, 232, 234, 235, 235, 236, 237, 238, 239, 240,
|
|
241, 243, 244, 244, 244, 245, 245, 245, 245, 245,
|
|
245, 245, 246, 247, 249, 251, 253, 255, 257, 259,
|
|
|
|
260, 261, 262, 264, 266, 268, 270, 272, 272, 273,
|
|
274, 274, 276, 277, 278, 279, 279, 280, 280, 280,
|
|
280, 280, 280, 280, 281, 282, 283, 284, 286, 288,
|
|
290, 292, 294, 296, 298, 299, 300, 301, 302, 302,
|
|
304, 304, 307, 308, 309, 309, 310, 310, 310, 310,
|
|
310, 311, 312, 314, 316, 318, 320, 322, 324, 325,
|
|
326, 326, 328, 329, 331, 331, 333, 335, 337, 339,
|
|
340, 340, 341, 341, 342, 343, 343, 343, 343, 344,
|
|
345, 346, 347, 348, 349, 350, 352, 354, 356, 358,
|
|
360, 361, 363, 365, 365, 366, 367, 368, 369, 369,
|
|
|
|
370, 371, 371, 371, 372, 373, 375, 377, 379, 381,
|
|
383, 385, 386, 388, 389, 390, 391, 392, 393, 394,
|
|
394, 396, 398, 400, 402, 403, 404, 406, 406
|
|
} ;
|
|
|
|
static yyconst int 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, 2, 4, 4, 5, 4, 6, 4, 4, 7,
|
|
8, 9, 10, 11, 6, 12, 13, 14, 14, 14,
|
|
14, 14, 14, 14, 14, 14, 14, 4, 15, 6,
|
|
4, 6, 4, 4, 16, 16, 16, 17, 16, 18,
|
|
16, 16, 16, 16, 16, 16, 16, 16, 16, 19,
|
|
16, 16, 16, 20, 16, 16, 16, 16, 16, 16,
|
|
6, 21, 6, 4, 22, 4, 23, 16, 24, 25,
|
|
|
|
26, 27, 28, 16, 29, 16, 16, 30, 31, 32,
|
|
33, 16, 16, 34, 35, 36, 37, 38, 39, 39,
|
|
39, 39, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
4, 4, 4, 4, 4
|
|
} ;
|
|
|
|
static yyconst int yy_meta[40] =
|
|
{ 0,
|
|
1, 2, 3, 1, 1, 1, 2, 1, 1, 1,
|
|
4, 1, 1, 5, 1, 5, 5, 5, 5, 5,
|
|
1, 5, 5, 5, 5, 5, 5, 5, 5, 5,
|
|
5, 5, 5, 5, 5, 5, 5, 5, 5
|
|
} ;
|
|
|
|
static yyconst short int yy_base[369] =
|
|
{ 0,
|
|
0, 38, 764, 763, 761, 760, 759, 758, 757, 756,
|
|
755, 754, 753, 752, 48, 69, 751, 750, 39, 84,
|
|
86, 90, 93, 107, 41, 95, 44, 80, 122, 0,
|
|
112, 160, 749, 748, 163, 167, 747, 746, 740, 739,
|
|
746, 767, 100, 767, 767, 148, 767, 173, 767, 53,
|
|
731, 0, 722, 0, 157, 164, 163, 170, 173, 186,
|
|
187, 740, 767, 767, 767, 767, 739, 767, 738, 767,
|
|
767, 767, 767, 0, 737, 767, 0, 0, 718, 191,
|
|
767, 185, 195, 178, 0, 736, 767, 767, 724, 725,
|
|
732, 198, 767, 199, 200, 767, 201, 767, 0, 211,
|
|
|
|
767, 732, 767, 730, 767, 0, 213, 767, 706, 0,
|
|
767, 217, 221, 705, 704, 175, 201, 232, 767, 767,
|
|
0, 715, 0, 234, 0, 237, 239, 241, 243, 245,
|
|
255, 268, 270, 277, 281, 726, 272, 724, 767, 723,
|
|
767, 722, 767, 0, 721, 767, 0, 702, 285, 283,
|
|
228, 701, 291, 767, 43, 0, 719, 709, 708, 0,
|
|
715, 767, 293, 222, 295, 206, 767, 208, 767, 298,
|
|
767, 300, 715, 713, 767, 0, 303, 689, 232, 0,
|
|
308, 711, 700, 709, 294, 679, 683, 674, 683, 282,
|
|
683, 0, 767, 0, 314, 767, 322, 767, 324, 328,
|
|
|
|
330, 332, 339, 334, 767, 341, 767, 692, 703, 297,
|
|
82, 345, 672, 668, 675, 692, 767, 661, 659, 651,
|
|
644, 640, 630, 355, 767, 357, 767, 360, 767, 366,
|
|
368, 370, 372, 767, 374, 767, 376, 767, 254, 378,
|
|
379, 383, 629, 606, 599, 381, 603, 598, 593, 558,
|
|
395, 767, 398, 767, 400, 767, 402, 767, 404, 767,
|
|
502, 406, 374, 396, 410, 767, 412, 767, 416, 453,
|
|
439, 420, 445, 336, 421, 452, 423, 395, 422, 767,
|
|
435, 767, 437, 767, 439, 430, 431, 434, 454, 446,
|
|
403, 351, 458, 408, 413, 417, 449, 461, 376, 453,
|
|
|
|
353, 343, 314, 475, 767, 466, 480, 457, 471, 475,
|
|
483, 309, 476, 311, 479, 484, 487, 490, 250, 162,
|
|
491, 494, 495, 498, 499, 115, 502, 767, 517, 522,
|
|
527, 532, 537, 542, 547, 552, 557, 562, 567, 572,
|
|
577, 582, 587, 592, 95, 89, 597, 602, 607, 40,
|
|
612, 617, 622, 627, 632, 637, 642, 647, 652, 657,
|
|
662, 667, 672, 677, 682, 687, 692, 697
|
|
} ;
|
|
|
|
static yyconst short int yy_def[369] =
|
|
{ 0,
|
|
328, 1, 329, 329, 330, 330, 330, 330, 330, 330,
|
|
331, 331, 332, 332, 333, 333, 334, 334, 335, 335,
|
|
336, 336, 337, 337, 338, 338, 339, 339, 328, 29,
|
|
340, 340, 341, 341, 342, 342, 343, 343, 330, 330,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 344, 345, 346, 345, 345, 345, 345, 345, 328,
|
|
328, 347, 328, 328, 328, 328, 348, 328, 349, 328,
|
|
328, 328, 328, 350, 351, 328, 352, 352, 353, 353,
|
|
328, 353, 353, 353, 354, 354, 328, 328, 354, 355,
|
|
356, 356, 328, 356, 357, 328, 357, 328, 346, 346,
|
|
|
|
328, 328, 328, 358, 328, 359, 359, 328, 359, 360,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
361, 328, 344, 345, 346, 345, 345, 345, 345, 345,
|
|
345, 345, 345, 345, 328, 328, 328, 347, 328, 348,
|
|
328, 349, 328, 350, 351, 328, 352, 353, 353, 353,
|
|
353, 353, 353, 328, 353, 354, 354, 355, 355, 362,
|
|
356, 328, 356, 356, 356, 357, 328, 357, 328, 328,
|
|
328, 346, 328, 358, 328, 359, 359, 359, 359, 360,
|
|
328, 328, 328, 363, 328, 328, 328, 328, 328, 328,
|
|
328, 361, 328, 346, 328, 328, 328, 328, 345, 345,
|
|
|
|
345, 345, 345, 328, 328, 328, 328, 328, 328, 353,
|
|
356, 346, 359, 359, 359, 363, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 345,
|
|
345, 345, 328, 328, 328, 328, 328, 328, 328, 353,
|
|
356, 346, 359, 359, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 353, 353, 364, 356, 328, 328, 328, 359, 359,
|
|
328, 328, 328, 365, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 364, 364, 364, 364, 359,
|
|
359, 366, 359, 328, 365, 365, 365, 328, 328, 367,
|
|
|
|
328, 328, 328, 328, 328, 364, 364, 366, 366, 366,
|
|
359, 359, 368, 328, 365, 367, 367, 367, 328, 328,
|
|
366, 368, 368, 368, 367, 328, 368, 0, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328
|
|
} ;
|
|
|
|
static yyconst short int yy_nxt[807] =
|
|
{ 0,
|
|
42, 43, 44, 45, 46, 47, 47, 47, 47, 48,
|
|
47, 49, 50, 51, 52, 53, 53, 53, 53, 53,
|
|
45, 54, 55, 56, 53, 53, 53, 53, 53, 53,
|
|
53, 53, 57, 58, 53, 53, 53, 59, 53, 60,
|
|
63, 78, 92, 93, 144, 63, 96, 61, 71, 71,
|
|
72, 73, 73, 73, 73, 73, 73, 73, 73, 73,
|
|
73, 120, 73, 149, 97, 121, 94, 210, 73, 71,
|
|
71, 72, 73, 73, 73, 73, 73, 73, 73, 73,
|
|
73, 73, 96, 73, 162, 63, 78, 80, 81, 73,
|
|
63, 80, 81, 125, 86, 87, 92, 93, 82, 124,
|
|
|
|
97, 113, 82, 88, 114, 89, 83, 90, 86, 87,
|
|
83, 84, 241, 102, 63, 84, 326, 88, 103, 89,
|
|
94, 90, 98, 98, 63, 98, 98, 98, 98, 98,
|
|
98, 98, 98, 98, 98, 98, 98, 99, 99, 99,
|
|
99, 99, 98, 99, 99, 99, 99, 99, 99, 99,
|
|
99, 99, 99, 99, 99, 99, 99, 99, 99, 99,
|
|
100, 102, 63, 326, 107, 108, 103, 109, 107, 108,
|
|
126, 109, 115, 116, 118, 119, 117, 127, 125, 128,
|
|
129, 130, 131, 132, 125, 125, 133, 135, 137, 119,
|
|
114, 125, 150, 152, 125, 136, 153, 154, 149, 163,
|
|
|
|
162, 162, 167, 169, 188, 149, 189, 134, 167, 155,
|
|
169, 149, 170, 171, 177, 149, 151, 178, 181, 182,
|
|
168, 168, 113, 164, 162, 114, 168, 190, 168, 183,
|
|
165, 184, 191, 118, 119, 193, 193, 185, 195, 196,
|
|
197, 198, 193, 193, 193, 193, 193, 193, 149, 172,
|
|
126, 319, 127, 165, 199, 194, 193, 193, 194, 155,
|
|
194, 214, 194, 215, 194, 261, 194, 239, 203, 204,
|
|
205, 206, 207, 137, 119, 200, 194, 201, 193, 193,
|
|
202, 132, 135, 133, 150, 114, 153, 154, 208, 194,
|
|
136, 194, 153, 154, 163, 162, 182, 162, 194, 170,
|
|
|
|
171, 170, 171, 149, 177, 149, 221, 178, 151, 181,
|
|
182, 149, 314, 222, 185, 224, 225, 149, 164, 211,
|
|
183, 313, 184, 226, 227, 228, 229, 240, 185, 193,
|
|
193, 193, 193, 193, 193, 235, 236, 199, 212, 320,
|
|
233, 234, 237, 238, 319, 194, 170, 171, 296, 194,
|
|
297, 194, 203, 194, 301, 230, 224, 225, 226, 227,
|
|
194, 251, 252, 309, 231, 310, 232, 253, 254, 255,
|
|
256, 257, 258, 259, 260, 235, 236, 237, 238, 262,
|
|
265, 266, 272, 242, 267, 268, 264, 194, 300, 194,
|
|
263, 194, 264, 273, 149, 274, 251, 252, 149, 279,
|
|
|
|
280, 281, 282, 283, 284, 259, 260, 262, 287, 314,
|
|
288, 265, 266, 267, 268, 292, 289, 290, 263, 303,
|
|
264, 272, 298, 279, 280, 296, 149, 297, 291, 315,
|
|
292, 297, 273, 299, 274, 300, 281, 282, 283, 284,
|
|
304, 305, 287, 306, 288, 288, 287, 290, 288, 302,
|
|
289, 289, 285, 301, 289, 307, 154, 274, 291, 311,
|
|
292, 296, 298, 297, 294, 317, 287, 318, 288, 309,
|
|
312, 310, 313, 299, 289, 300, 304, 305, 306, 293,
|
|
288, 307, 154, 321, 311, 310, 289, 309, 323, 310,
|
|
324, 315, 287, 297, 288, 312, 317, 313, 318, 325,
|
|
|
|
289, 318, 317, 321, 318, 310, 323, 327, 324, 324,
|
|
323, 325, 324, 318, 327, 285, 324, 62, 62, 62,
|
|
62, 62, 63, 63, 63, 63, 63, 67, 67, 67,
|
|
67, 67, 69, 69, 69, 69, 69, 74, 74, 74,
|
|
74, 74, 75, 75, 75, 75, 75, 77, 77, 77,
|
|
77, 77, 79, 79, 79, 79, 79, 85, 85, 85,
|
|
85, 85, 91, 91, 91, 91, 91, 95, 95, 95,
|
|
95, 95, 101, 101, 101, 101, 101, 104, 104, 104,
|
|
104, 104, 106, 106, 106, 106, 106, 110, 110, 110,
|
|
110, 110, 123, 123, 278, 123, 123, 138, 138, 138,
|
|
|
|
138, 138, 140, 140, 140, 140, 140, 142, 142, 142,
|
|
142, 142, 145, 145, 145, 145, 145, 147, 277, 147,
|
|
147, 147, 148, 148, 276, 148, 148, 156, 156, 275,
|
|
271, 156, 159, 159, 270, 159, 159, 161, 161, 161,
|
|
161, 161, 166, 166, 166, 166, 166, 174, 174, 174,
|
|
174, 174, 176, 176, 269, 176, 176, 180, 180, 250,
|
|
180, 180, 192, 192, 249, 192, 192, 160, 160, 248,
|
|
160, 160, 216, 216, 216, 216, 216, 286, 286, 247,
|
|
286, 286, 295, 295, 246, 295, 295, 308, 308, 245,
|
|
308, 308, 316, 316, 217, 316, 316, 322, 322, 244,
|
|
|
|
322, 322, 243, 215, 209, 239, 223, 220, 219, 218,
|
|
189, 217, 184, 182, 213, 175, 173, 162, 160, 160,
|
|
157, 149, 149, 146, 143, 141, 139, 209, 122, 187,
|
|
186, 179, 175, 173, 162, 160, 158, 157, 149, 146,
|
|
143, 141, 139, 125, 122, 328, 112, 112, 111, 111,
|
|
105, 105, 76, 76, 70, 70, 68, 68, 66, 66,
|
|
65, 65, 64, 64, 63, 63, 41, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
|
|
328, 328, 328, 328, 328, 328
|
|
} ;
|
|
|
|
static yyconst short int yy_chk[807] =
|
|
{ 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, 2,
|
|
19, 19, 25, 25, 350, 19, 27, 2, 15, 15,
|
|
15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
|
|
15, 50, 15, 155, 27, 50, 25, 155, 15, 16,
|
|
16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
|
|
16, 16, 28, 16, 211, 20, 20, 21, 21, 16,
|
|
20, 22, 22, 346, 23, 23, 26, 26, 21, 345,
|
|
|
|
28, 43, 22, 23, 43, 23, 21, 23, 24, 24,
|
|
22, 21, 211, 31, 31, 22, 326, 24, 31, 24,
|
|
26, 24, 29, 29, 29, 29, 29, 29, 29, 29,
|
|
29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
|
|
29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
|
|
29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
|
|
29, 32, 32, 320, 35, 35, 32, 35, 36, 36,
|
|
55, 36, 46, 46, 48, 48, 46, 56, 55, 57,
|
|
57, 57, 57, 58, 57, 56, 59, 60, 61, 61,
|
|
60, 58, 80, 82, 59, 60, 83, 83, 84, 92,
|
|
|
|
92, 94, 95, 97, 116, 82, 116, 59, 166, 84,
|
|
168, 80, 100, 100, 107, 83, 80, 107, 112, 112,
|
|
95, 97, 113, 92, 164, 113, 166, 117, 168, 112,
|
|
94, 112, 117, 118, 118, 124, 124, 112, 126, 126,
|
|
127, 127, 128, 128, 129, 129, 130, 130, 151, 100,
|
|
126, 319, 127, 164, 128, 124, 131, 131, 126, 151,
|
|
127, 179, 128, 179, 129, 239, 130, 239, 131, 132,
|
|
132, 133, 133, 137, 137, 129, 131, 130, 134, 134,
|
|
130, 132, 135, 133, 150, 135, 149, 149, 134, 132,
|
|
135, 133, 153, 153, 163, 163, 185, 165, 134, 170,
|
|
|
|
170, 172, 172, 150, 177, 149, 190, 177, 150, 181,
|
|
181, 153, 314, 190, 185, 195, 195, 210, 163, 165,
|
|
181, 312, 181, 197, 197, 199, 199, 210, 181, 200,
|
|
200, 201, 201, 202, 202, 204, 204, 199, 172, 303,
|
|
203, 203, 206, 206, 302, 199, 212, 212, 274, 200,
|
|
274, 201, 203, 202, 301, 200, 224, 224, 226, 226,
|
|
203, 228, 228, 292, 201, 292, 202, 230, 230, 231,
|
|
231, 232, 232, 233, 233, 235, 235, 237, 237, 240,
|
|
241, 241, 246, 212, 242, 242, 263, 230, 299, 231,
|
|
240, 232, 240, 246, 263, 246, 251, 251, 240, 253,
|
|
|
|
253, 255, 255, 257, 257, 259, 259, 262, 264, 294,
|
|
264, 265, 265, 267, 267, 291, 264, 269, 262, 278,
|
|
262, 272, 275, 279, 279, 295, 262, 295, 269, 296,
|
|
269, 296, 272, 275, 272, 275, 281, 281, 283, 283,
|
|
285, 285, 286, 287, 286, 287, 288, 290, 288, 277,
|
|
286, 287, 285, 276, 288, 289, 289, 273, 290, 293,
|
|
290, 297, 298, 297, 271, 300, 289, 300, 289, 308,
|
|
293, 308, 293, 298, 289, 298, 304, 304, 306, 270,
|
|
306, 307, 307, 309, 311, 309, 306, 310, 313, 310,
|
|
313, 315, 307, 315, 307, 311, 316, 311, 316, 317,
|
|
|
|
307, 317, 318, 321, 318, 321, 322, 323, 322, 323,
|
|
324, 325, 324, 325, 327, 261, 327, 329, 329, 329,
|
|
329, 329, 330, 330, 330, 330, 330, 331, 331, 331,
|
|
331, 331, 332, 332, 332, 332, 332, 333, 333, 333,
|
|
333, 333, 334, 334, 334, 334, 334, 335, 335, 335,
|
|
335, 335, 336, 336, 336, 336, 336, 337, 337, 337,
|
|
337, 337, 338, 338, 338, 338, 338, 339, 339, 339,
|
|
339, 339, 340, 340, 340, 340, 340, 341, 341, 341,
|
|
341, 341, 342, 342, 342, 342, 342, 343, 343, 343,
|
|
343, 343, 344, 344, 250, 344, 344, 347, 347, 347,
|
|
|
|
347, 347, 348, 348, 348, 348, 348, 349, 349, 349,
|
|
349, 349, 351, 351, 351, 351, 351, 352, 249, 352,
|
|
352, 352, 353, 353, 248, 353, 353, 354, 354, 247,
|
|
245, 354, 355, 355, 244, 355, 355, 356, 356, 356,
|
|
356, 356, 357, 357, 357, 357, 357, 358, 358, 358,
|
|
358, 358, 359, 359, 243, 359, 359, 360, 360, 223,
|
|
360, 360, 361, 361, 222, 361, 361, 362, 362, 221,
|
|
362, 362, 363, 363, 363, 363, 363, 364, 364, 220,
|
|
364, 364, 365, 365, 219, 365, 365, 366, 366, 218,
|
|
366, 366, 367, 367, 216, 367, 367, 368, 368, 215,
|
|
|
|
368, 368, 214, 213, 209, 208, 191, 189, 188, 187,
|
|
186, 184, 183, 182, 178, 174, 173, 161, 159, 158,
|
|
157, 152, 148, 145, 142, 140, 138, 136, 122, 115,
|
|
114, 109, 104, 102, 91, 90, 89, 86, 79, 75,
|
|
69, 67, 62, 53, 51, 41, 40, 39, 38, 37,
|
|
34, 33, 18, 17, 14, 13, 12, 11, 10, 9,
|
|
8, 7, 6, 5, 4, 3, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
328, 328, 328, 328, 328, 328, 328, 328, 328, 328,
|
|
|
|
328, 328, 328, 328, 328, 328
|
|
} ;
|
|
|
|
static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
|
|
static char *yy_full_match;
|
|
static int yy_lp;
|
|
#define REJECT \
|
|
{ \
|
|
*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
|
|
yy_cp = yy_full_match; /* restore poss. backed-over text */ \
|
|
++yy_lp; \
|
|
goto find_rule; \
|
|
}
|
|
#define yymore() yymore_used_but_not_detected
|
|
#define YY_MORE_ADJ 0
|
|
char *yytext;
|
|
#line 1 "vs1.0_tokens.l"
|
|
#define INITIAL 0
|
|
#define INCLUDE 1
|
|
#define DEFINE 2
|
|
#define DEFSTR 3
|
|
#define DEFSPACE 4
|
|
#define SKIPLINE 5
|
|
#define EATCOMMENT 6
|
|
#define EATSTRING 7
|
|
#define SAVELINE 8
|
|
|
|
#define MACRONAME 9
|
|
#define MACROBODY 10
|
|
#define MACROPARM 11
|
|
#define EATMACRO 12
|
|
#define EATDEFINE 13
|
|
#define MODIFIER 14
|
|
#define MACROPARMSTART 15
|
|
|
|
#define IFDEFNAME 16
|
|
#define IFDEFBODY 17
|
|
#define ENDMACRO 18
|
|
#define MACROPARMEND 19
|
|
|
|
#line 7 "vs1.0_tokens.l"
|
|
|
|
#include "vs1.0_inst_list.h"
|
|
#include "_vs1.0_parser.h"
|
|
#define yylineno line_number
|
|
|
|
#define yylineno line_number
|
|
int line_incr;
|
|
void LexError(char *format, ...);
|
|
void LexWarning(char *format, ...);
|
|
char *ReadTextFile(const char * filename);
|
|
|
|
unsigned int MakeRegisterMask(char *findName);
|
|
unsigned int FindSwizzleValue(char *swizzleText);
|
|
|
|
|
|
enum ERROR_VALUES {
|
|
ERROR_NONE = 0,
|
|
ERROR_MEMORY_ALLOC,
|
|
ERROR_FILE_OPEN,
|
|
ERROR_UNSUCCESSFUL_ASSEMBLE,
|
|
ERROR_TOO_MANY_PARMS,
|
|
ERROR_DEST_WRITE,
|
|
ERROR_LIST_OPEN,
|
|
ERROR_DEST_OPEN,
|
|
ERROR_NO_ARGUMENTS,
|
|
ERROR_MACRO_OVERRUN
|
|
};
|
|
|
|
|
|
|
|
//extern void GenSwitchFileNames(char *fileName);
|
|
//extern unsigned int gLinesAssembled;
|
|
unsigned int gLinesAssembled;
|
|
|
|
#define YY_INPUT(buf,result,max_size) \
|
|
{ \
|
|
int c = *myin++; \
|
|
result = (c == 0) ? YY_NULL : (buf[0] = c, 1); \
|
|
}
|
|
|
|
#define SAFEDELETEARRAY(x) if ((x) != NULL) \
|
|
delete [] (x)
|
|
#define SAFEFREE(x) if ((x) != NULL) \
|
|
free((x))
|
|
|
|
#define MAXREPLACESTRING 255
|
|
|
|
char gReplaceText[MAXREPLACESTRING+1];
|
|
|
|
//
|
|
// forward prototypes for macro functions
|
|
//
|
|
void MacroIncFunction(char *, unsigned int *, char **);
|
|
void MacroDecFunction(char *, unsigned int *, char **);
|
|
void MacroAddFunction(char *, unsigned int *, char **);
|
|
void MacroSubFunction(char *, unsigned int *, char **);
|
|
|
|
MACROFUNCTIONS gMacroFunctions[] =
|
|
{
|
|
{ "inc(", MacroIncFunction },
|
|
{ "dec(", MacroDecFunction },
|
|
{ "add(", MacroAddFunction },
|
|
{ "sub(", MacroSubFunction }
|
|
};
|
|
|
|
#define NUM_MACRO_FUNCTIONS (sizeof(gMacroFunctions) / sizeof(MACROFUNCTIONS))
|
|
|
|
#define MAX_INCLUDE_DEPTH 1024
|
|
typedef struct INCLUDEINFO
|
|
{
|
|
char *fileName;
|
|
unsigned int lineNo;
|
|
YY_BUFFER_STATE buffer;
|
|
MACROENTRY *lastInvokeMacro; // save off in case nested macros.
|
|
MACROENTRY *lastParseMacro; // recursive macros
|
|
MACROTEXT *lastMacroLineParse; // save off for recursive lines of macros working on.
|
|
bool lastbInsideMacro; // save off for recursive macros
|
|
bool lastbInsideDefine; // save off for recursive macros/defines
|
|
bool lastbInsideInclude;
|
|
bool lastbProcessingIFDEF; // save off #define information
|
|
// FILE *fileHandle;
|
|
char *prevString;
|
|
char *nextString;
|
|
} INCLUDEINFO;
|
|
|
|
INCLUDEINFO gIncludeStack[MAX_INCLUDE_DEPTH];
|
|
int gIncludeStackIndex = 0;
|
|
|
|
IFDEFINFO gIfDefStack[MAX_IFDEF_DEPTH];
|
|
int gIfDefStackIndex = 0;
|
|
|
|
unsigned int &base_linenumber = gIncludeStack[0].lineNo;
|
|
|
|
bool gbInsideInclude = false;
|
|
bool gbProcessingBuiltIn = false;
|
|
bool gbProcessingDefine = false;
|
|
unsigned int gCountParen = 0;
|
|
|
|
bool gbProcessingIFDEF = false;
|
|
bool gbIFDEF = false;
|
|
bool gbCompareDefine = false;
|
|
unsigned int gIfDefStartLine;
|
|
|
|
|
|
MACROENTRY *gLastMacro;
|
|
MACROENTRY *gInvokeMacro;
|
|
MACROENTRY *gTempMacro; // until all the parameters are read
|
|
MACROENTRY *FindMacro(char *macroName);
|
|
MACROENTRY *FindNMacro(char *macroName, unsigned int sLen);
|
|
|
|
MACROFUNCTIONPTR gMacroCallFunction;
|
|
|
|
char *builtInMacros = "macro m3x2 reg1, reg2, reg3\n"
|
|
" dp3 %reg1.x, %reg2, %reg3\n"
|
|
" dp3 %reg1.y, %reg2, %inc(%reg3)\n"
|
|
"endm";
|
|
|
|
//
|
|
// local prototypes
|
|
//
|
|
void CleanUp();
|
|
void ReplaceMacroParms(char *srcLine, char *destLine,
|
|
MACROENTRY *srcParms, MACROENTRY *invParms);
|
|
|
|
MACROTEXT *SaveMacroText(char *srcText, MACROTEXT *lastMacroText);
|
|
void FreeMacroEntry(MACROENTRY *macEntry);
|
|
void EndMacroParms();
|
|
char *FindAlphaNum(char *srcStr, unsigned int *sLen);
|
|
void DebugUnhandledState();
|
|
|
|
|
|
unsigned int gCommentStartLine;
|
|
unsigned int gMacroStartLine;
|
|
|
|
char *gCurFileName = NULL;
|
|
|
|
#define MAXSAVELINE 4095
|
|
|
|
char gSaveLine[MAXSAVELINE+1];
|
|
char gMacroLine[MAXSAVELINE+1];
|
|
|
|
#if 1
|
|
#ifdef _DEBUG
|
|
#define ECHO DebugUnhandledState();
|
|
#else
|
|
#define ECHO
|
|
#endif
|
|
#endif
|
|
|
|
bool gbInsideMacro = false; // flag if we are doing a macro replace or not.
|
|
bool gbTempInsideMacro = false;
|
|
unsigned int gInvokeState = INITIAL;
|
|
|
|
|
|
MACROENTRY *gParseMacro; // which source macro entry we are using
|
|
MACROENTRY *gTempParseMacro; // temporary holder until parameters are received.
|
|
MACROTEXT *gMacroLineParse; // which line we are currently parsing inside the macro invocation
|
|
|
|
typedef enum OPCODETYPE
|
|
{
|
|
TYPE_NONE = 0,
|
|
TYPE_VERTEX_SHADER = 1,
|
|
TYPE_PIXEL_SHADER = 2
|
|
};
|
|
typedef struct OPCODEMAP
|
|
{
|
|
char *string; // string for opcode
|
|
int tokenName; // name of the corresponding token
|
|
int numArguments; // number of arguments for opcode
|
|
float version; // minimum version supported in.
|
|
int opcodeTypeFlags; // whether opcode can be used in vertex shader or pixel shader
|
|
bool opcodeModify; // if opcode modifiers can be used
|
|
bool textureOpcode; // only outputs to the texture unit
|
|
} OPCODEMAP;
|
|
|
|
#ifndef TRUE
|
|
#define TRUE true
|
|
#endif
|
|
#ifndef FALSE
|
|
#define FALSE false
|
|
#endif
|
|
|
|
OPCODEMAP theOpcodes[] = {
|
|
{ "add", ADD_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER | TYPE_PIXEL_SHADER, TRUE, FALSE },
|
|
{ "dp3", DP3_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER | TYPE_PIXEL_SHADER, TRUE, FALSE },
|
|
{ "dp4", DP4_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "dst", DST_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "exp", EXP_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "expp", EXPP_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "frc", FRC_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "lit", LIT_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "log", LOG_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "logp", LOGP_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "m3x2", M3X2_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "m3x3", M3X3_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "m3x4", M3X4_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "m4x3", M4X3_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "m4x4", M4X4_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "mad", MAD_INSTR, 4, 1.0f, TYPE_VERTEX_SHADER | TYPE_PIXEL_SHADER, TRUE, FALSE },
|
|
{ "max", MAX_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "min", MIN_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "mov", MOV_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER | TYPE_PIXEL_SHADER, TRUE, FALSE },
|
|
{ "mul", MUL_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER | TYPE_PIXEL_SHADER, TRUE, FALSE },
|
|
{ "nop", NOP_INSTR, 0, 1.0f, TYPE_VERTEX_SHADER | TYPE_PIXEL_SHADER, TRUE, FALSE },
|
|
{ "rcp", RCP_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "rsq", RSQ_INSTR, 2, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "sge", SGE_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "slt", SLT_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER, FALSE, FALSE },
|
|
{ "sub", SUB_INSTR, 3, 1.0f, TYPE_VERTEX_SHADER | TYPE_PIXEL_SHADER, TRUE, FALSE },
|
|
};
|
|
|
|
#define NUMOPCODES (sizeof(theOpcodes) / sizeof(OPCODEMAP))
|
|
OPCODEMAP *FindOpcode(char *findName);
|
|
|
|
|
|
#line 986 "_vs1.0_lexer.cpp"
|
|
|
|
/* Macros after this point can all be overridden by user definitions in
|
|
* section 1.
|
|
*/
|
|
|
|
#ifndef YY_SKIP_YYWRAP
|
|
#ifdef __cplusplus
|
|
extern "C" int yywrap YY_PROTO(( void ));
|
|
#else
|
|
extern int yywrap YY_PROTO(( void ));
|
|
#endif
|
|
#endif
|
|
|
|
#ifndef YY_NO_UNPUT
|
|
static void yyunput YY_PROTO(( int c, char *buf_ptr ));
|
|
#endif
|
|
|
|
#ifndef yytext_ptr
|
|
static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
|
|
#endif
|
|
|
|
#ifndef YY_NO_INPUT
|
|
#ifdef __cplusplus
|
|
static int yyinput YY_PROTO(( void ));
|
|
#else
|
|
static int input YY_PROTO(( void ));
|
|
#endif
|
|
#endif
|
|
|
|
#if YY_STACK_USED
|
|
static int yy_start_stack_ptr = 0;
|
|
static int yy_start_stack_depth = 0;
|
|
static int *yy_start_stack = 0;
|
|
#ifndef YY_NO_PUSH_STATE
|
|
static void yy_push_state YY_PROTO(( int new_state ));
|
|
#endif
|
|
#ifndef YY_NO_POP_STATE
|
|
static void yy_pop_state YY_PROTO(( void ));
|
|
#endif
|
|
#ifndef YY_NO_TOP_STATE
|
|
static int yy_top_state YY_PROTO(( void ));
|
|
#endif
|
|
|
|
#else
|
|
#define YY_NO_PUSH_STATE 1
|
|
#define YY_NO_POP_STATE 1
|
|
#define YY_NO_TOP_STATE 1
|
|
#endif
|
|
|
|
#ifdef YY_MALLOC_DECL
|
|
YY_MALLOC_DECL
|
|
#else
|
|
#if __STDC__
|
|
#ifndef __cplusplus
|
|
#include <stdlib.h>
|
|
#endif
|
|
#else
|
|
/* Just try to get by without declaring the routines. This will fail
|
|
* miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
|
|
* or sizeof(void*) != sizeof(int).
|
|
*/
|
|
#endif
|
|
#endif
|
|
|
|
/* Amount of stuff to slurp up with each read. */
|
|
#ifndef YY_READ_BUF_SIZE
|
|
#define YY_READ_BUF_SIZE 8192
|
|
#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 (void) fwrite( yytext, yyleng, 1, yyout )
|
|
#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->yy_is_interactive ) \
|
|
{ \
|
|
int c = '*', 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 if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
|
|
&& ferror( yyin ) ) \
|
|
YY_FATAL_ERROR( "input in flex scanner failed" );
|
|
#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
|
|
|
|
/* Default declaration of generated scanner - a define so the user can
|
|
* easily add parameters.
|
|
*/
|
|
#ifndef YY_DECL
|
|
#define YY_DECL int yylex YY_PROTO(( void ))
|
|
#endif
|
|
|
|
/* 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 ) \
|
|
yy_current_buffer->yy_at_bol = \
|
|
(yytext[yyleng - 1] == '\n'); \
|
|
YY_USER_ACTION
|
|
|
|
YY_DECL
|
|
{
|
|
register yy_state_type yy_current_state;
|
|
register char *yy_cp, *yy_bp;
|
|
register int yy_act;
|
|
|
|
#line 258 "vs1.0_tokens.l"
|
|
|
|
|
|
#line 1139 "_vs1.0_lexer.cpp"
|
|
|
|
if ( yy_init )
|
|
{
|
|
yy_init = 0;
|
|
|
|
#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 )
|
|
yy_current_buffer =
|
|
yy_create_buffer( yyin, YY_BUF_SIZE );
|
|
|
|
yy_load_buffer_state();
|
|
}
|
|
|
|
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_bp = 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;
|
|
yy_match:
|
|
do
|
|
{
|
|
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*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 >= 329 )
|
|
yy_c = yy_meta[(unsigned int) yy_c];
|
|
}
|
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
|
*yy_state_ptr++ = yy_current_state;
|
|
++yy_cp;
|
|
}
|
|
while ( yy_base[yy_current_state] != 767 );
|
|
|
|
yy_find_action:
|
|
yy_current_state = *--yy_state_ptr;
|
|
yy_lp = yy_accept[yy_current_state];
|
|
find_rule: /* we branch to this label when backing up */
|
|
for ( ; ; ) /* until we find what rule we matched */
|
|
{
|
|
if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
|
|
{
|
|
yy_act = yy_acclist[yy_lp];
|
|
{
|
|
yy_full_match = yy_cp;
|
|
break;
|
|
}
|
|
}
|
|
--yy_cp;
|
|
yy_current_state = *--yy_state_ptr;
|
|
yy_lp = 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 1:
|
|
YY_RULE_SETUP
|
|
#line 260 "vs1.0_tokens.l"
|
|
{
|
|
gbProcessingDefine = false;
|
|
gSaveLine[0] = '\0';
|
|
strncat(gSaveLine, yytext, MAXSAVELINE);
|
|
// GenDebugLine();
|
|
if (gbProcessingIFDEF && (gbCompareDefine != gbIFDEF))
|
|
{
|
|
BEGIN(IFDEFBODY);
|
|
}
|
|
else
|
|
{
|
|
BEGIN(INITIAL);
|
|
}
|
|
yyless(0);
|
|
}
|
|
YY_BREAK
|
|
case 2:
|
|
YY_RULE_SETUP
|
|
#line 276 "vs1.0_tokens.l"
|
|
{
|
|
gbProcessingDefine = false;
|
|
gSaveLine[0] = '\0';
|
|
strncat(gSaveLine, yytext, MAXSAVELINE);
|
|
// GenDebugLine();
|
|
if (gbProcessingIFDEF && (gbCompareDefine != gbIFDEF))
|
|
{
|
|
BEGIN(IFDEFBODY);
|
|
}
|
|
else
|
|
{
|
|
BEGIN(INITIAL);
|
|
}
|
|
yyless(0);
|
|
}
|
|
YY_BREAK
|
|
case 3:
|
|
YY_RULE_SETUP
|
|
#line 292 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_ADDRESS_REG;
|
|
vs10_lval.reg.index = atoi(&yytext[1]);
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 4:
|
|
YY_RULE_SETUP
|
|
#line 301 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_VERTEX_ATTRIB_REG;
|
|
vs10_lval.reg.index = atoi(&yytext[1]);
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 5:
|
|
YY_RULE_SETUP
|
|
#line 310 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_TEMPORARY_REG;
|
|
vs10_lval.reg.index = atoi(&yytext[1]);
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 6:
|
|
YY_RULE_SETUP
|
|
#line 319 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_CONSTANT_MEM_REG;
|
|
vs10_lval.reg.index = atoi(&yytext[1]);
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 7:
|
|
YY_RULE_SETUP
|
|
#line 328 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_TEXTURE_RESULT_REG;
|
|
vs10_lval.reg.index = atoi(&yytext[2]);
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 8:
|
|
YY_RULE_SETUP
|
|
#line 337 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_COLOR_RESULT_REG;
|
|
vs10_lval.reg.index = atoi(&yytext[2]);
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 9:
|
|
YY_RULE_SETUP
|
|
#line 346 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_FOG_RESULT_REG;
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 10:
|
|
YY_RULE_SETUP
|
|
#line 354 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_POSITION_RESULT_REG;
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 11:
|
|
YY_RULE_SETUP
|
|
#line 362 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.reg.type = TYPE_POINTS_RESULT_REG;
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return REGISTER;
|
|
}
|
|
YY_BREAK
|
|
case 12:
|
|
YY_RULE_SETUP
|
|
#line 370 "vs1.0_tokens.l"
|
|
{
|
|
|
|
unsigned int offset;
|
|
|
|
offset = strcspn(yytext, " \t\n_");
|
|
yyless(offset);
|
|
|
|
OPCODEMAP *opcodeMap = FindOpcode(yytext);
|
|
if ( opcodeMap != NULL )
|
|
{
|
|
// fprintf( stderr, "%s\t", opcodeMap->string );
|
|
return( opcodeMap->tokenName );
|
|
}
|
|
else
|
|
{
|
|
gTempParseMacro = FindMacro(yytext);
|
|
|
|
if (gTempParseMacro != NULL)
|
|
{
|
|
if (gIncludeStackIndex >= MAX_INCLUDE_DEPTH )
|
|
{
|
|
LexError("macros nested too deeply");
|
|
LEX_DBG_BREAK;
|
|
exit( 1 );
|
|
}
|
|
|
|
if (gTempParseMacro->firstMacroLines != NULL)
|
|
{
|
|
|
|
gTempMacro = (MACROENTRY *)malloc(sizeof(MACROENTRY));
|
|
if (gTempMacro == NULL)
|
|
{
|
|
LexError("Out of memory allocating MACROENTRY structure.\n");
|
|
}
|
|
else
|
|
{
|
|
|
|
gTempMacro->next = NULL;
|
|
gTempMacro->prev = NULL;
|
|
gTempMacro->macroName = NULL;
|
|
gTempMacro->firstMacroParms = NULL;
|
|
gTempMacro->lastMacroParms = NULL;
|
|
gTempMacro->firstMacroLines = NULL;
|
|
gTempMacro->lastMacroLines = NULL;
|
|
gTempMacro->numParms = 0;
|
|
gTempMacro->nLines = 0;
|
|
|
|
gbTempInsideMacro = true; // flag we are currently doing a macro replace.
|
|
gInvokeState = YYSTATE;
|
|
if (gTempParseMacro->numParms > 0)
|
|
{
|
|
BEGIN(MACROPARMSTART);
|
|
}
|
|
else
|
|
{
|
|
EndMacroParms();
|
|
gbTempInsideMacro = false; // no longer waiting for macro invocation
|
|
}
|
|
|
|
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
// fprintf( stderr, "Opcode: \"%s\" not found\n", yytext );
|
|
REJECT;
|
|
}
|
|
}
|
|
|
|
//unsigned int offset;
|
|
//
|
|
//INSTRMAP *opcodeMap;
|
|
//
|
|
//offset = strcspn(yytext, " \t\n_");
|
|
//yyless(offset);
|
|
//opcodeMap = FindInstruction(yytext);
|
|
//if (opcodeMap == NULL)
|
|
//{
|
|
// REJECT;
|
|
//}
|
|
//
|
|
//yylval.opcodeInfo.opcodeMap = opcodeMap;
|
|
//
|
|
//return OPCODE;
|
|
}
|
|
YY_BREAK
|
|
case 13:
|
|
YY_RULE_SETUP
|
|
#line 457 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
char *cmt = new char[yyleng+1];
|
|
strncpy( cmt, yytext, yyleng );
|
|
cmt[0] = '#';
|
|
cmt[yyleng] = NULL;
|
|
vs10_lval.comment = cmt;
|
|
return COMMENT;
|
|
}
|
|
YY_BREAK
|
|
case 14:
|
|
YY_RULE_SETUP
|
|
#line 467 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
char *cmt = new char[yyleng+1];
|
|
strncpy( cmt+1, yytext+1, yyleng-1 );
|
|
cmt[0] = '#';
|
|
cmt[1] = ' ';
|
|
cmt[yyleng] = NULL;
|
|
vs10_lval.comment = cmt;
|
|
return COMMENT;
|
|
}
|
|
YY_BREAK
|
|
case 15:
|
|
YY_RULE_SETUP
|
|
#line 478 "vs1.0_tokens.l"
|
|
{
|
|
fprintf( stderr, "COISSUE found\n" );
|
|
yyless(yyleng-1);
|
|
//return COISSUE;
|
|
}
|
|
YY_BREAK
|
|
case 16:
|
|
YY_RULE_SETUP
|
|
#line 484 "vs1.0_tokens.l"
|
|
{
|
|
fprintf( stderr, "COISSUE found\n" );
|
|
//return COISSUE;
|
|
}
|
|
YY_BREAK
|
|
case 17:
|
|
YY_RULE_SETUP
|
|
#line 489 "vs1.0_tokens.l"
|
|
{
|
|
gCommentStartLine = yylineno;
|
|
yyless(0);
|
|
BEGIN(EATCOMMENT);
|
|
}
|
|
YY_BREAK
|
|
case 18:
|
|
YY_RULE_SETUP
|
|
#line 495 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(INCLUDE);
|
|
}
|
|
YY_BREAK
|
|
case 19:
|
|
YY_RULE_SETUP
|
|
#line 499 "vs1.0_tokens.l"
|
|
{ /* got the include file name */
|
|
|
|
// FILE *newyyin;
|
|
char *newyyin;
|
|
char incFileName[1024];
|
|
unsigned long sLen;
|
|
bool validFileName;
|
|
|
|
if ( gIncludeStackIndex >= MAX_INCLUDE_DEPTH )
|
|
{
|
|
LexError("Includes nested too deeply, aborting\n");
|
|
LEX_DBG_BREAK
|
|
exit( 1 );
|
|
}
|
|
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
yylineno++;
|
|
gLinesAssembled++;
|
|
|
|
validFileName = true;
|
|
// zap "" and <>
|
|
if ((yytext[0] == '"') || (yytext[0] == '<'))
|
|
{
|
|
char *endQuote;
|
|
endQuote = strchr(&yytext[1], yytext[0]);
|
|
sLen = (endQuote - yytext)-1;
|
|
if (endQuote == NULL)
|
|
{
|
|
LexError("Unable to open include file %s\n", incFileName);
|
|
BEGIN(INITIAL);
|
|
validFileName = false;
|
|
}
|
|
else
|
|
{
|
|
incFileName[0] ='\0';
|
|
strncat(incFileName, &yytext[1], sLen);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
strcpy(incFileName, yytext);
|
|
}
|
|
|
|
if (validFileName)
|
|
{
|
|
sLen = strlen(incFileName);
|
|
if ((incFileName[sLen-1] == '"') || (incFileName[sLen-1] == '>'))
|
|
{
|
|
incFileName[sLen-1] = '\0';
|
|
}
|
|
|
|
|
|
newyyin = ReadTextFile( incFileName );
|
|
// newyyin = fxopen( incFileName, "r" );
|
|
|
|
if ( ! newyyin )
|
|
{
|
|
LexError("Unable to open include file %s\n", incFileName);
|
|
BEGIN(SAVELINE);
|
|
}
|
|
else
|
|
{
|
|
gIncludeStack[gIncludeStackIndex].fileName = gCurFileName;
|
|
gIncludeStack[gIncludeStackIndex].lineNo = yylineno;
|
|
// gIncludeStack[gIncludeStackIndex].fileHandle = yyin;
|
|
gIncludeStack[gIncludeStackIndex].prevString = myin;
|
|
gIncludeStack[gIncludeStackIndex].nextString = newyyin;
|
|
gIncludeStack[gIncludeStackIndex].lastInvokeMacro = gInvokeMacro;
|
|
gIncludeStack[gIncludeStackIndex].lastParseMacro = gParseMacro;
|
|
gIncludeStack[gIncludeStackIndex].lastMacroLineParse = gMacroLineParse;
|
|
gIncludeStack[gIncludeStackIndex].lastbInsideMacro = gbInsideMacro;
|
|
gIncludeStack[gIncludeStackIndex].lastbInsideInclude = gbInsideInclude;
|
|
gIncludeStack[gIncludeStackIndex].buffer = YY_CURRENT_BUFFER;
|
|
gIncludeStack[gIncludeStackIndex].lastbProcessingIFDEF = gbProcessingIFDEF;
|
|
gIncludeStackIndex++;
|
|
|
|
gbProcessingIFDEF = false;
|
|
|
|
gCurFileName = strdup(incFileName);
|
|
// yyin = newyyin;
|
|
myin = newyyin;
|
|
|
|
// GenSwitchFileNames(gCurFileName);
|
|
|
|
yylineno = 1;
|
|
|
|
yy_switch_to_buffer(yy_create_buffer( yyin, YY_BUF_SIZE ) );
|
|
|
|
gbInsideInclude = true;
|
|
|
|
BEGIN(SAVELINE);
|
|
}
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(EATCOMMENT):
|
|
#line 594 "vs1.0_tokens.l"
|
|
{
|
|
LexError("End of file reached before end of comment started on line %d.\n", gCommentStartLine);
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case 20:
|
|
YY_RULE_SETUP
|
|
#line 599 "vs1.0_tokens.l"
|
|
{
|
|
char *endComment;
|
|
unsigned int keepSize;
|
|
|
|
strcpy(gSaveLine, yytext);
|
|
endComment = strstr(yytext, "*/");
|
|
|
|
char *cmt;
|
|
if (endComment != NULL)
|
|
{
|
|
keepSize = (endComment - yytext+2);
|
|
yyless(keepSize);
|
|
BEGIN(INITIAL);
|
|
|
|
if ( yytext[0] == '/' && yytext[1] == '*' )
|
|
{
|
|
cmt = new char[yyleng];
|
|
strncpy( cmt+3, yytext+2, yyleng-2 );
|
|
cmt[0] = '#';
|
|
cmt[1] = ' ';
|
|
cmt[2] = ' ';
|
|
cmt[yyleng-1] = NULL;
|
|
}
|
|
else
|
|
{
|
|
cmt = new char[yyleng];
|
|
strncpy( cmt+1, yytext, yyleng-2 );
|
|
cmt[0] = '#';
|
|
cmt[yyleng-1] = NULL;
|
|
}
|
|
vs10_lval.comment = cmt;
|
|
return COMMENT;
|
|
}
|
|
else
|
|
{
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
|
|
if ( yytext[0] == '/' && yytext[1] == '*' )
|
|
{
|
|
cmt = new char[yyleng+2];
|
|
strncpy( cmt+3, yytext+2, yyleng-2 );
|
|
cmt[0] = '#';
|
|
cmt[1] = ' ';
|
|
cmt[2] = ' ';
|
|
cmt[yyleng+1] = NULL;
|
|
}
|
|
else
|
|
{
|
|
cmt = new char[yyleng+2];
|
|
strncpy( cmt+1, yytext, yyleng );
|
|
cmt[0] = '#';
|
|
cmt[yyleng+1] = NULL;
|
|
}
|
|
vs10_lval.comment = cmt;
|
|
return COMMENT;
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(DEFSTR):
|
|
#line 660 "vs1.0_tokens.l"
|
|
{
|
|
LexError("#define was incomplete before end of file\n");
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(DEFINE):
|
|
#line 665 "vs1.0_tokens.l"
|
|
{
|
|
LexError("#define was incomplete before end of file\n");
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(DEFSPACE):
|
|
#line 670 "vs1.0_tokens.l"
|
|
{
|
|
LexError("#define was incomplete before end of file\n");
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(INCLUDE):
|
|
#line 675 "vs1.0_tokens.l"
|
|
{
|
|
LexError("#include was incomplete before end of file\n");
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(MACROBODY):
|
|
#line 680 "vs1.0_tokens.l"
|
|
{
|
|
LexError("End of file reached before end of #define or endm was found, macro started on line %d.\n", gMacroStartLine);
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(IFDEFBODY):
|
|
#line 685 "vs1.0_tokens.l"
|
|
{
|
|
LexError("End of file reached before #endif found, macro started on line %d.\n", gIfDefStartLine);
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case 21:
|
|
YY_RULE_SETUP
|
|
#line 690 "vs1.0_tokens.l"
|
|
{
|
|
LexError("#define was incomplete before end of line\n");
|
|
BEGIN(SAVELINE);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 22:
|
|
YY_RULE_SETUP
|
|
#line 699 "vs1.0_tokens.l"
|
|
{
|
|
LexError("#define was incomplete before end of line\n");
|
|
BEGIN(SAVELINE);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 23:
|
|
YY_RULE_SETUP
|
|
#line 708 "vs1.0_tokens.l"
|
|
{
|
|
LexError("#define was incomplete before end of line\n");
|
|
BEGIN(SAVELINE);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 24:
|
|
YY_RULE_SETUP
|
|
#line 717 "vs1.0_tokens.l"
|
|
{
|
|
if (gIfDefStackIndex >= MAX_IFDEF_DEPTH)
|
|
{
|
|
LexError("Out of stack space for #ifdef, aborting.\n");
|
|
LEX_DBG_BREAK
|
|
exit( 1 );
|
|
}
|
|
else
|
|
{
|
|
gIfDefStack[gIfDefStackIndex].lastbProcessingIFDEF = gbProcessingIFDEF;
|
|
gIfDefStack[gIfDefStackIndex].lastbIFDEF = gbIFDEF;
|
|
gIfDefStack[gIfDefStackIndex].lastbCompareDefine = gbCompareDefine;
|
|
gIfDefStack[gIfDefStackIndex].lastIfDefStartLine = gIfDefStartLine;
|
|
gIfDefStackIndex++;
|
|
gIfDefStartLine = yylineno;
|
|
|
|
gbCompareDefine = true;
|
|
BEGIN(IFDEFNAME);
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 25:
|
|
YY_RULE_SETUP
|
|
#line 737 "vs1.0_tokens.l"
|
|
{
|
|
if (gIfDefStackIndex >= MAX_IFDEF_DEPTH)
|
|
{
|
|
LexError("Out of stack space for #ifdef, aborting.\n");
|
|
LEX_DBG_BREAK
|
|
exit( 1 );
|
|
}
|
|
else
|
|
{
|
|
gIfDefStack[gIfDefStackIndex].lastbProcessingIFDEF = gbProcessingIFDEF;
|
|
gIfDefStack[gIfDefStackIndex].lastbIFDEF = gbIFDEF;
|
|
gIfDefStack[gIfDefStackIndex].lastbCompareDefine = gbCompareDefine;
|
|
gIfDefStack[gIfDefStackIndex].lastIfDefStartLine = gIfDefStartLine;
|
|
gIfDefStackIndex++;
|
|
gIfDefStartLine = yylineno;
|
|
|
|
gbCompareDefine = false;
|
|
BEGIN(IFDEFNAME);
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 26:
|
|
YY_RULE_SETUP
|
|
#line 757 "vs1.0_tokens.l"
|
|
{
|
|
if (!gbProcessingIFDEF)
|
|
{
|
|
LexError("Unexpected #else found at line %d, skipping.\n", yylineno);
|
|
}
|
|
else
|
|
{
|
|
gbCompareDefine = !gbCompareDefine;
|
|
BEGIN(INITIAL);
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 27:
|
|
YY_RULE_SETUP
|
|
#line 769 "vs1.0_tokens.l"
|
|
{
|
|
char *defineName;
|
|
unsigned int sLen;
|
|
|
|
|
|
defineName = FindAlphaNum(yytext, &sLen);
|
|
if (defineName == NULL)
|
|
{
|
|
defineName = strdup(yytext);
|
|
defineName[yyleng-1] = '\0'; // kill \n
|
|
LexWarning("Mangled name (%s) for #ifdef, assuming not defined.\n", defineName);
|
|
free(defineName);
|
|
gbIFDEF = false;
|
|
}
|
|
else
|
|
{
|
|
if (FindNMacro(defineName, sLen) != NULL)
|
|
{
|
|
gbIFDEF = true;
|
|
}
|
|
else
|
|
{
|
|
gbIFDEF = false;
|
|
}
|
|
}
|
|
|
|
gbProcessingIFDEF = true;
|
|
if (gbIFDEF != gbCompareDefine)
|
|
{
|
|
BEGIN(IFDEFBODY);
|
|
}
|
|
else
|
|
{
|
|
BEGIN(SAVELINE);
|
|
}
|
|
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 28:
|
|
YY_RULE_SETUP
|
|
#line 811 "vs1.0_tokens.l"
|
|
{
|
|
if (!gbProcessingIFDEF)
|
|
{
|
|
LexError("Unexpected #endif found at line %d, skipping.\n", yylineno);
|
|
}
|
|
else
|
|
{
|
|
gIfDefStackIndex--;
|
|
gbProcessingIFDEF = gIfDefStack[gIfDefStackIndex].lastbProcessingIFDEF;
|
|
gbIFDEF = gIfDefStack[gIfDefStackIndex].lastbIFDEF;
|
|
gbCompareDefine = gIfDefStack[gIfDefStackIndex].lastbCompareDefine;
|
|
gIfDefStartLine = gIfDefStack[gIfDefStackIndex].lastIfDefStartLine;
|
|
|
|
}
|
|
|
|
if (YYSTATE == IFDEFBODY)
|
|
{
|
|
strncpy(gSaveLine, yytext, MAXSAVELINE);
|
|
}
|
|
|
|
BEGIN(ENDMACRO);
|
|
|
|
}
|
|
YY_BREAK
|
|
case 29:
|
|
YY_RULE_SETUP
|
|
#line 835 "vs1.0_tokens.l"
|
|
{
|
|
LexWarning("Garbage at end of #endif or endm will be ignored.\n");
|
|
}
|
|
YY_BREAK
|
|
case 30:
|
|
YY_RULE_SETUP
|
|
#line 839 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(SAVELINE);
|
|
return '\n';
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(ENDMACRO):
|
|
#line 844 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case 31:
|
|
YY_RULE_SETUP
|
|
#line 848 "vs1.0_tokens.l"
|
|
{
|
|
// eat line, because we are not in a TRUE #ifdef, or FALSE #ifndef
|
|
strncpy(gSaveLine, yytext, MAXSAVELINE);
|
|
}
|
|
YY_BREAK
|
|
case 32:
|
|
YY_RULE_SETUP
|
|
#line 853 "vs1.0_tokens.l"
|
|
{
|
|
strcat(gSaveLine, yytext);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
yylineno++;
|
|
gLinesAssembled++;
|
|
}
|
|
YY_BREAK
|
|
case 33:
|
|
YY_RULE_SETUP
|
|
#line 861 "vs1.0_tokens.l"
|
|
{
|
|
gbProcessingDefine = true;
|
|
gMacroStartLine = yylineno;
|
|
gCountParen = 0;
|
|
BEGIN(MACRONAME);
|
|
}
|
|
YY_BREAK
|
|
case 34:
|
|
YY_RULE_SETUP
|
|
#line 868 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(SAVELINE);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 35:
|
|
YY_RULE_SETUP
|
|
#line 876 "vs1.0_tokens.l"
|
|
{
|
|
// unsigned int majorVersion;
|
|
// unsigned int minorVersion;
|
|
// int minorOffset;
|
|
//
|
|
//
|
|
// majorVersion = (unsigned int)(atoi(&yytext[3]));
|
|
// // skip "ps." + second '.'
|
|
// minorOffset = strcspn(&yytext[3], ".")+4;
|
|
// minorVersion = (unsigned int)(atoi(&yytext[minorOffset]));
|
|
// yylval.ival = D3DVS_VERSION(majorVersion, minorVersion);
|
|
//
|
|
|
|
// fprintf( stderr, "%s", yytext );
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
return VERTEX_SHADER;
|
|
}
|
|
YY_BREAK
|
|
case 36:
|
|
YY_RULE_SETUP
|
|
#line 895 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
vs10_lval.ival = atoi(yytext);
|
|
return INTVAL;
|
|
}
|
|
YY_BREAK
|
|
case 37:
|
|
YY_RULE_SETUP
|
|
#line 902 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(MODIFIER);
|
|
//fprintf( stderr, "." );
|
|
return yytext[0];
|
|
}
|
|
YY_BREAK
|
|
case 38:
|
|
YY_RULE_SETUP
|
|
#line 908 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
BEGIN(INITIAL);
|
|
|
|
vs10_lval.mask[0] = yytext[0];
|
|
vs10_lval.mask[1] = yytext[1];
|
|
vs10_lval.mask[2] = yytext[2];
|
|
vs10_lval.mask[3] = yytext[3];
|
|
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
|
|
return XYZW_MODIFIER;
|
|
|
|
#if 0
|
|
char temp[6];
|
|
|
|
temp[0] = '\0';
|
|
strncat(temp, yytext, 4);
|
|
strlwr(temp);
|
|
vs10_lval.lval = FindSwizzleValue(temp);
|
|
|
|
BEGIN(INITIAL);
|
|
return SWIZZLE_MODIFIER;
|
|
#endif
|
|
|
|
}
|
|
YY_BREAK
|
|
case 39:
|
|
YY_RULE_SETUP
|
|
#line 936 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%s", yytext );
|
|
BEGIN(INITIAL);
|
|
|
|
int validLen = strspn(yytext, "xyzw");
|
|
int i;
|
|
for ( i = 0; i < validLen; i++ )
|
|
vs10_lval.mask[i] = tolower( yytext[i] );
|
|
while ( i < 4 )
|
|
{
|
|
vs10_lval.mask[i] = 0;
|
|
i++;
|
|
}
|
|
|
|
if ( yytext[yyleng-1] == '\n' )
|
|
line_incr = 1;
|
|
|
|
return XYZW_MODIFIER;
|
|
|
|
#if 0
|
|
//char temp[6];
|
|
char *temp = new char[6];
|
|
unsigned int registerMask;
|
|
unsigned int validLen;
|
|
|
|
temp[0] = '\0';
|
|
validLen = strspn(yytext, "xyzw");
|
|
strncat(temp, yytext, validLen);
|
|
for ( int i = 0; i < validLen; i++ )
|
|
temp[i] = tolower( temp[i] );
|
|
registerMask = MakeRegisterMask(temp);
|
|
|
|
if (registerMask != 0)
|
|
{
|
|
//vs10_lval.sval = temp;
|
|
vs10_lval.lval = registerMask;
|
|
BEGIN(INITIAL);
|
|
return XYZW_MODIFIER;
|
|
}
|
|
else
|
|
{
|
|
//vs10_lval.sval = temp;
|
|
vs10_lval.lval = FindSwizzleValue(temp);
|
|
BEGIN(INITIAL);
|
|
return SWIZZLE_MODIFIER;
|
|
}
|
|
#endif
|
|
}
|
|
YY_BREAK
|
|
case 40:
|
|
YY_RULE_SETUP
|
|
#line 985 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(INITIAL);
|
|
yyless(0);
|
|
}
|
|
YY_BREAK
|
|
case 41:
|
|
YY_RULE_SETUP
|
|
#line 990 "vs1.0_tokens.l"
|
|
{
|
|
/* setup and save off #define/macro name */
|
|
if (FindMacro(yytext) != NULL)
|
|
{
|
|
LexWarning("Redefinition of #define/macro %s, ignoring.\n", yytext);
|
|
if (gbProcessingDefine)
|
|
{
|
|
BEGIN(EATDEFINE);
|
|
}
|
|
else
|
|
{
|
|
BEGIN(EATMACRO);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
|
|
BEGIN(MACROPARMSTART);
|
|
// %%%%% This should be setup to use memory pools
|
|
gTempMacro = (MACROENTRY *)malloc(sizeof(MACROENTRY));
|
|
if (gTempMacro == NULL)
|
|
{
|
|
LexError("Out of memory for macro table.\n");
|
|
if (gbProcessingDefine)
|
|
{
|
|
BEGIN(EATDEFINE);
|
|
}
|
|
else
|
|
{
|
|
BEGIN(EATMACRO);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
gTempMacro->prev = gLastMacro;
|
|
gTempMacro->next = NULL;
|
|
|
|
gTempMacro->firstMacroParms = NULL;
|
|
gTempMacro->lastMacroParms = NULL;
|
|
gTempMacro->firstMacroLines = NULL;
|
|
gTempMacro->lastMacroLines = NULL;
|
|
gTempMacro->numParms = 0;
|
|
gTempMacro->bIsDefine = gbProcessingDefine;
|
|
gTempMacro->nLines = 0;
|
|
|
|
if (gCurFileName != NULL)
|
|
{
|
|
gTempMacro->fileName = strdup(gCurFileName);
|
|
}
|
|
else
|
|
{
|
|
gTempMacro->fileName = NULL;
|
|
}
|
|
|
|
gTempMacro->lineNo = yylineno;
|
|
|
|
/* %%%%% this should be set up in memory pools. */
|
|
gTempMacro->macroName = (char *)malloc(strlen(yytext)+1);
|
|
if (gTempMacro->macroName == NULL)
|
|
{
|
|
LexError("Out of memory for string table.\n");
|
|
SAFEFREE(gTempMacro);
|
|
if (gbProcessingDefine)
|
|
{
|
|
BEGIN(EATDEFINE);
|
|
}
|
|
else
|
|
{
|
|
BEGIN(EATMACRO);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
strcpy(gTempMacro->macroName, yytext);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 42:
|
|
YY_RULE_SETUP
|
|
#line 1069 "vs1.0_tokens.l"
|
|
{
|
|
LexError("No macro name specified, skipping macro definition.\n");
|
|
SAFEFREE(gTempMacro->fileName);
|
|
SAFEFREE(gTempMacro);
|
|
if (gbProcessingDefine)
|
|
{
|
|
BEGIN(EATDEFINE);
|
|
}
|
|
else
|
|
{
|
|
BEGIN(EATMACRO);
|
|
}
|
|
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 43:
|
|
YY_RULE_SETUP
|
|
#line 1088 "vs1.0_tokens.l"
|
|
{
|
|
gCountParen++;
|
|
}
|
|
YY_BREAK
|
|
case 44:
|
|
YY_RULE_SETUP
|
|
#line 1092 "vs1.0_tokens.l"
|
|
{}
|
|
YY_BREAK
|
|
case 45:
|
|
YY_RULE_SETUP
|
|
#line 1094 "vs1.0_tokens.l"
|
|
{
|
|
if (gbProcessingDefine && (gCountParen == 0))
|
|
{
|
|
EndMacroParms();
|
|
}
|
|
else
|
|
{
|
|
BEGIN(MACROPARM);
|
|
}
|
|
yyless(0);
|
|
}
|
|
YY_BREAK
|
|
case 46:
|
|
YY_RULE_SETUP
|
|
#line 1106 "vs1.0_tokens.l"
|
|
{
|
|
if ((gCountParen == 0) && gbProcessingDefine)
|
|
{
|
|
EndMacroParms();
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 47:
|
|
YY_RULE_SETUP
|
|
#line 1113 "vs1.0_tokens.l"
|
|
{
|
|
if (gCountParen == 0)
|
|
{
|
|
EndMacroParms();
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 48:
|
|
YY_RULE_SETUP
|
|
#line 1120 "vs1.0_tokens.l"
|
|
{}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(MACROPARM):
|
|
#line 1122 "vs1.0_tokens.l"
|
|
{
|
|
EndMacroParms();
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
yylineno++;
|
|
gLinesAssembled++;
|
|
BEGIN(INITIAL);
|
|
}
|
|
YY_BREAK
|
|
case 49:
|
|
YY_RULE_SETUP
|
|
#line 1131 "vs1.0_tokens.l"
|
|
{
|
|
if (gbProcessingDefine && (gCountParen > 0))
|
|
{
|
|
LexError("Malformed #define, skipping.\n");
|
|
BEGIN(SAVELINE);
|
|
}
|
|
else
|
|
{
|
|
EndMacroParms();
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
yylineno++;
|
|
gLinesAssembled++;
|
|
if (gbProcessingDefine)
|
|
{
|
|
gbProcessingDefine = false;
|
|
BEGIN(SAVELINE);
|
|
}
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 50:
|
|
YY_RULE_SETUP
|
|
#line 1153 "vs1.0_tokens.l"
|
|
{
|
|
|
|
MACROTEXT *tMacro;
|
|
char *macroParmEnd;
|
|
unsigned int startOffset;
|
|
bool bFoundEndParen;
|
|
unsigned int leftParenCount;
|
|
unsigned int rightParenCount;
|
|
|
|
bFoundEndParen = false;
|
|
|
|
// sheesh, we gotta count the parenthesis....
|
|
macroParmEnd = yytext;
|
|
leftParenCount = 0;
|
|
rightParenCount = 0;
|
|
while (*macroParmEnd)
|
|
{
|
|
if (*macroParmEnd == ')')
|
|
{
|
|
rightParenCount++;
|
|
}
|
|
if (*macroParmEnd == '(')
|
|
{
|
|
leftParenCount++;
|
|
}
|
|
|
|
macroParmEnd++;
|
|
}
|
|
|
|
// if we found the last right parenthesis.
|
|
if (rightParenCount == leftParenCount+1)
|
|
{
|
|
// find if we got the last parenthesis on this line
|
|
macroParmEnd = strrchr(yytext, ')');
|
|
yyless((macroParmEnd - yytext));
|
|
BEGIN(MACROPARMEND);
|
|
}
|
|
|
|
startOffset = strspn(yytext, " \t");
|
|
|
|
tMacro = SaveMacroText(&yytext[startOffset], gTempMacro->lastMacroParms);
|
|
if (tMacro == NULL)
|
|
{
|
|
LexError("Out of memory for string table for macro parameter(s).\n");
|
|
FreeMacroEntry(gTempMacro);
|
|
BEGIN(EATMACRO);
|
|
}
|
|
else
|
|
{
|
|
// if first one wasn't set then set it
|
|
if (gTempMacro->firstMacroParms == NULL)
|
|
{
|
|
gTempMacro->firstMacroParms = tMacro;
|
|
}
|
|
|
|
gTempMacro->lastMacroParms = tMacro;
|
|
|
|
gTempMacro->numParms++;
|
|
}
|
|
|
|
}
|
|
YY_BREAK
|
|
case 51:
|
|
YY_RULE_SETUP
|
|
#line 1215 "vs1.0_tokens.l"
|
|
{
|
|
if (!gbProcessingDefine && !gbTempInsideMacro)
|
|
{
|
|
LexError("Malformed macro, skipping.\n");
|
|
BEGIN(EATMACRO);
|
|
}
|
|
else
|
|
{
|
|
gCountParen--;
|
|
|
|
// we can get multiple \n's here
|
|
while (yytext[yyleng-2] == '\n')
|
|
{
|
|
yyleng--;
|
|
}
|
|
yyless(yyleng);
|
|
|
|
// if there isn't a \n on this line, macro starts on this line,
|
|
// not next, like in a macro definition
|
|
if (yytext[yyleng-1] != '\n')
|
|
{
|
|
EndMacroParms();
|
|
}
|
|
else
|
|
{
|
|
if (yytext[yyleng-1] == '\n')
|
|
{
|
|
gTempMacro->lineNo++;
|
|
}
|
|
// count this line
|
|
gTempMacro->nLines++;
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
EndMacroParms();
|
|
if (!gbInsideMacro)
|
|
{
|
|
yylineno++;
|
|
}
|
|
|
|
gLinesAssembled++;
|
|
}
|
|
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 52:
|
|
YY_RULE_SETUP
|
|
#line 1260 "vs1.0_tokens.l"
|
|
{
|
|
if (!gbProcessingDefine && !gbTempInsideMacro)
|
|
{
|
|
LexError("Malformed macro, skipping.\n");
|
|
BEGIN(EATMACRO);
|
|
}
|
|
else
|
|
{
|
|
|
|
// no matter what count this line
|
|
gTempMacro->nLines++;
|
|
gCountParen--;
|
|
EndMacroParms();
|
|
if (!gbInsideMacro)
|
|
{
|
|
yylineno++;
|
|
}
|
|
|
|
gLinesAssembled++;
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 53:
|
|
YY_RULE_SETUP
|
|
#line 1282 "vs1.0_tokens.l"
|
|
{
|
|
if (!gbProcessingDefine && !gbTempInsideMacro)
|
|
{
|
|
LexError("Malformed macro, skipping.\n");
|
|
BEGIN(EATMACRO);
|
|
}
|
|
else
|
|
{
|
|
gCountParen--;
|
|
if (gCountParen == 0)
|
|
{
|
|
// no matter what count this line
|
|
gTempMacro->nLines++;
|
|
EndMacroParms();
|
|
if (!gbInsideMacro)
|
|
{
|
|
yylineno++;
|
|
}
|
|
|
|
gLinesAssembled++;
|
|
}
|
|
else
|
|
{
|
|
REJECT;
|
|
}
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 54:
|
|
YY_RULE_SETUP
|
|
#line 1310 "vs1.0_tokens.l"
|
|
{
|
|
MACROTEXT *tMacro;
|
|
unsigned int copyLen;
|
|
char *endLine;
|
|
|
|
gSaveLine[0] ='\0';
|
|
endLine = strchr(yytext, '\\');
|
|
copyLen = (endLine - yytext);
|
|
if (copyLen > MAXSAVELINE)
|
|
{
|
|
copyLen = MAXSAVELINE;
|
|
}
|
|
|
|
strncat(gSaveLine, yytext, copyLen);
|
|
strcat(gSaveLine, "\n");
|
|
tMacro = SaveMacroText(gSaveLine, gLastMacro->lastMacroLines);
|
|
if (tMacro == NULL)
|
|
{
|
|
LexError("Out of memory for string table for macro parameter(s).\n");
|
|
BEGIN(EATDEFINE);
|
|
}
|
|
else
|
|
{
|
|
gLastMacro->nLines++;
|
|
// if first one wasn't set then set it
|
|
if (gLastMacro->firstMacroLines == NULL)
|
|
{
|
|
gLastMacro->firstMacroLines = tMacro;
|
|
}
|
|
|
|
gLastMacro->lastMacroLines = tMacro;
|
|
}
|
|
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
yylineno++;
|
|
gLinesAssembled++;
|
|
}
|
|
YY_BREAK
|
|
case 55:
|
|
YY_RULE_SETUP
|
|
#line 1349 "vs1.0_tokens.l"
|
|
{
|
|
|
|
strncpy(gSaveLine, yytext, MAXSAVELINE);
|
|
if (gbProcessingDefine)
|
|
{
|
|
LexError("Malformed #define, skipping.\n");
|
|
}
|
|
|
|
BEGIN(ENDMACRO);
|
|
}
|
|
YY_BREAK
|
|
case 56:
|
|
YY_RULE_SETUP
|
|
#line 1360 "vs1.0_tokens.l"
|
|
{
|
|
MACROTEXT *tMacro;
|
|
|
|
// check if processing #define and only one line, if not then append \n
|
|
if (!gbProcessingDefine || (gLastMacro->nLines >= 1))
|
|
{
|
|
gSaveLine[0] = '\0';
|
|
strncat(gSaveLine, yytext, MAXSAVELINE);
|
|
strcat(gSaveLine, "\n");
|
|
tMacro = SaveMacroText(gSaveLine, gLastMacro->lastMacroLines);
|
|
gLastMacro->nLines++;
|
|
}
|
|
else if (gLastMacro->numParms > 0) // check if parameters were there
|
|
{
|
|
// if so, we need the '\n' appended
|
|
gMacroLine[0] = '\0';
|
|
strncat(gMacroLine, yytext, MAXSAVELINE);
|
|
strcat(gMacroLine, "\n");
|
|
tMacro = SaveMacroText(gMacroLine, gLastMacro->lastMacroLines);
|
|
gLastMacro->nLines++;
|
|
}
|
|
else // straight no newline macro replace
|
|
{
|
|
tMacro = SaveMacroText(yytext, gLastMacro->lastMacroLines);
|
|
}
|
|
|
|
if (tMacro == NULL)
|
|
{
|
|
LexError("Out of memory for string table for macro parameter(s).\n");
|
|
BEGIN(EATMACRO);
|
|
}
|
|
else
|
|
{
|
|
// if first one wasn't set then set it
|
|
if (gLastMacro->firstMacroLines == NULL)
|
|
{
|
|
gLastMacro->firstMacroLines = tMacro;
|
|
}
|
|
|
|
gLastMacro->lastMacroLines = tMacro;
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 57:
|
|
YY_RULE_SETUP
|
|
#line 1403 "vs1.0_tokens.l"
|
|
{
|
|
|
|
MACROTEXT *tMacro;
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
yylineno++;
|
|
gLinesAssembled++;
|
|
if (gbProcessingDefine)
|
|
{
|
|
gbProcessingDefine = false;
|
|
BEGIN(SAVELINE);
|
|
}
|
|
else
|
|
{
|
|
// this means \n by itself inside macro body
|
|
if (((yylineno-1) - gLastMacro->lineNo) != gLastMacro->nLines)
|
|
{
|
|
strcpy(gMacroLine, "\n");
|
|
tMacro = SaveMacroText(gMacroLine, gLastMacro->lastMacroLines);
|
|
gLastMacro->nLines++;
|
|
|
|
if (tMacro == NULL)
|
|
{
|
|
LexError("Out of memory for string table for macro parameter(s).\n");
|
|
BEGIN(EATMACRO);
|
|
}
|
|
else
|
|
{
|
|
// if first one wasn't set then set it
|
|
if (gLastMacro->firstMacroLines == NULL)
|
|
{
|
|
gLastMacro->firstMacroLines = tMacro;
|
|
}
|
|
|
|
gLastMacro->lastMacroLines = tMacro;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 58:
|
|
YY_RULE_SETUP
|
|
#line 1443 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(SAVELINE);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 59:
|
|
YY_RULE_SETUP
|
|
#line 1451 "vs1.0_tokens.l"
|
|
{
|
|
strncpy(gSaveLine, yytext, MAXSAVELINE);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 60:
|
|
YY_RULE_SETUP
|
|
#line 1459 "vs1.0_tokens.l"
|
|
{
|
|
strncpy(gSaveLine, yytext, MAXSAVELINE);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
YY_BREAK
|
|
case 61:
|
|
YY_RULE_SETUP
|
|
#line 1467 "vs1.0_tokens.l"
|
|
{
|
|
strncpy(gSaveLine, yytext, MAXSAVELINE);
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
BEGIN(SAVELINE);
|
|
}
|
|
YY_BREAK
|
|
case 62:
|
|
YY_RULE_SETUP
|
|
#line 1476 "vs1.0_tokens.l"
|
|
{
|
|
|
|
gTempParseMacro = FindMacro(yytext);
|
|
|
|
if (gTempParseMacro != NULL)
|
|
{
|
|
if (gIncludeStackIndex >= MAX_INCLUDE_DEPTH )
|
|
{
|
|
LexError("macros nested too deeply");
|
|
LEX_DBG_BREAK
|
|
exit( 1 );
|
|
}
|
|
|
|
if (gTempParseMacro->firstMacroLines != NULL)
|
|
{
|
|
|
|
gTempMacro = (MACROENTRY *)malloc(sizeof(MACROENTRY));
|
|
if (gTempMacro == NULL)
|
|
{
|
|
LexError("Out of memory allocating MACROENTRY structure.\n");
|
|
}
|
|
else
|
|
{
|
|
|
|
gTempMacro->next = NULL;
|
|
gTempMacro->prev = NULL;
|
|
gTempMacro->macroName = NULL;
|
|
gTempMacro->firstMacroParms = NULL;
|
|
gTempMacro->lastMacroParms = NULL;
|
|
gTempMacro->firstMacroLines = NULL;
|
|
gTempMacro->lastMacroLines = NULL;
|
|
gTempMacro->numParms = 0;
|
|
gTempMacro->nLines = 0;
|
|
|
|
gbTempInsideMacro = true; // flag we are currently doing a macro replace.
|
|
gInvokeState = YYSTATE;
|
|
if (gTempParseMacro->numParms > 0)
|
|
{
|
|
BEGIN(MACROPARMSTART);
|
|
}
|
|
else
|
|
{
|
|
EndMacroParms();
|
|
gbTempInsideMacro = false; // no longer waiting for macro invocation
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
BEGIN(INITIAL);
|
|
REJECT;
|
|
}
|
|
}
|
|
YY_BREAK
|
|
case 63:
|
|
YY_RULE_SETUP
|
|
#line 1530 "vs1.0_tokens.l"
|
|
{
|
|
// fprintf( stderr, "%c ", yytext[0] );
|
|
return yytext[0];
|
|
}
|
|
YY_BREAK
|
|
case 64:
|
|
YY_RULE_SETUP
|
|
#line 1536 "vs1.0_tokens.l"
|
|
{}
|
|
YY_BREAK
|
|
case 65:
|
|
YY_RULE_SETUP
|
|
#line 1538 "vs1.0_tokens.l"
|
|
{
|
|
LexError("Didn't find label string for #define.\n");
|
|
BEGIN(SAVELINE);
|
|
// return '\n';
|
|
}
|
|
YY_BREAK
|
|
case 66:
|
|
YY_RULE_SETUP
|
|
#line 1544 "vs1.0_tokens.l"
|
|
{
|
|
//fprintf(stderr, "\n");
|
|
// line_incr = 1;
|
|
line_incr++;
|
|
BEGIN(SAVELINE);
|
|
return '\n';
|
|
}
|
|
YY_BREAK
|
|
case 67:
|
|
YY_RULE_SETUP
|
|
#line 1552 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(INITIAL);
|
|
// fprintf( stderr, "%s", yytext );
|
|
if (yyleng == 1)
|
|
return yytext[0];
|
|
else
|
|
LexError("Unrecognized Token: %s\n", yytext);
|
|
return UNKNOWN_STRING;
|
|
}
|
|
YY_BREAK
|
|
case 68:
|
|
YY_RULE_SETUP
|
|
#line 1562 "vs1.0_tokens.l"
|
|
{
|
|
// vs10_lval.ival = yytext[0];
|
|
LexError("Illegal character: %d decimal.\n", yytext[0]);
|
|
return(ILLEGAL);
|
|
}
|
|
YY_BREAK
|
|
case 69:
|
|
YY_RULE_SETUP
|
|
#line 1568 "vs1.0_tokens.l"
|
|
{
|
|
// vs10_lval.ival = yytext[0];
|
|
LexError("Illegal character: %d decimal.\n", yytext[0]);
|
|
return(ILLEGAL);
|
|
}
|
|
YY_BREAK
|
|
case 70:
|
|
YY_RULE_SETUP
|
|
#line 1574 "vs1.0_tokens.l"
|
|
{
|
|
return yytext[0];
|
|
}
|
|
YY_BREAK
|
|
case 71:
|
|
YY_RULE_SETUP
|
|
#line 1578 "vs1.0_tokens.l"
|
|
{
|
|
BEGIN(EATSTRING);
|
|
yyless(0);
|
|
}
|
|
YY_BREAK
|
|
case YY_STATE_EOF(INITIAL):
|
|
case YY_STATE_EOF(SKIPLINE):
|
|
case YY_STATE_EOF(EATSTRING):
|
|
case YY_STATE_EOF(SAVELINE):
|
|
case YY_STATE_EOF(MACRONAME):
|
|
case YY_STATE_EOF(EATMACRO):
|
|
case YY_STATE_EOF(EATDEFINE):
|
|
case YY_STATE_EOF(MODIFIER):
|
|
case YY_STATE_EOF(MACROPARMSTART):
|
|
case YY_STATE_EOF(IFDEFNAME):
|
|
case YY_STATE_EOF(MACROPARMEND):
|
|
#line 1583 "vs1.0_tokens.l"
|
|
{
|
|
bool wasInMacro;
|
|
bool oneLiner;
|
|
char *macroText;
|
|
|
|
wasInMacro = gbInsideMacro;
|
|
oneLiner = false;
|
|
|
|
|
|
// if we are inside the macro then do next line until their are no more
|
|
if (gbInsideMacro)
|
|
{
|
|
oneLiner = (gParseMacro->nLines == 0);
|
|
|
|
// free the temporary parameter replaced line we were working on.
|
|
// get next line in macro text, if any
|
|
gMacroLineParse = gMacroLineParse->next;
|
|
// more lines to parse?
|
|
if (gMacroLineParse != NULL)
|
|
{
|
|
macroText = gMacroLine;
|
|
// if no replacement text, just use source line
|
|
if (gParseMacro->firstMacroParms == NULL)
|
|
{
|
|
macroText = gMacroLineParse->macroText;
|
|
}
|
|
else
|
|
{
|
|
// replace the macro parameters
|
|
ReplaceMacroParms(gMacroLineParse->macroText, gMacroLine, gParseMacro, gInvokeMacro);
|
|
}
|
|
|
|
// if (gExpandMacros)
|
|
// {
|
|
// strcpy(gSaveLine, macroText);
|
|
// }
|
|
|
|
BEGIN(INITIAL);
|
|
// and lex it.
|
|
yy_scan_string(macroText);
|
|
}
|
|
else
|
|
{
|
|
// no more lines in this macro, so free the working macro
|
|
SAFEFREE(gInvokeMacro);
|
|
// shut off flag for inside a macro replacement state.
|
|
gbInsideMacro = false;
|
|
}
|
|
}
|
|
|
|
if (gbProcessingIFDEF && !wasInMacro)
|
|
{
|
|
LexError("End of file reached before #endif found, macro started on line %d.\n", gIfDefStartLine);
|
|
}
|
|
|
|
if (!gbInsideMacro)
|
|
{
|
|
if ( gIncludeStackIndex == 0 )
|
|
{
|
|
if (!gbProcessingBuiltIn)
|
|
CleanUp();
|
|
return 0;
|
|
// return TOKEN_EOF;
|
|
}
|
|
else
|
|
{
|
|
yy_delete_buffer( YY_CURRENT_BUFFER );
|
|
SAFEFREE(gCurFileName);
|
|
// SAFEDELETE(myin);
|
|
// SAFECLOSE(yyin);
|
|
}
|
|
|
|
gIncludeStackIndex--;
|
|
SAFEDELETEARRAY( gIncludeStack[gIncludeStackIndex].nextString );
|
|
yy_switch_to_buffer(gIncludeStack[gIncludeStackIndex].buffer );
|
|
gCurFileName = gIncludeStack[gIncludeStackIndex].fileName;
|
|
// yyin = gIncludeStack[gIncludeStackIndex].fileHandle;
|
|
myin = gIncludeStack[gIncludeStackIndex].prevString;
|
|
yylineno = gIncludeStack[gIncludeStackIndex].lineNo;
|
|
gInvokeMacro = gIncludeStack[gIncludeStackIndex].lastInvokeMacro;
|
|
gParseMacro = gIncludeStack[gIncludeStackIndex].lastParseMacro;
|
|
gMacroLineParse = gIncludeStack[gIncludeStackIndex].lastMacroLineParse;
|
|
gbInsideInclude = gIncludeStack[gIncludeStackIndex].lastbInsideInclude;
|
|
gbInsideMacro = gIncludeStack[gIncludeStackIndex].lastbInsideMacro;
|
|
gbProcessingIFDEF = gIncludeStack[gIncludeStackIndex].lastbProcessingIFDEF;
|
|
|
|
if (!gbInsideMacro && !oneLiner)
|
|
{
|
|
// GenSwitchFileNames(gCurFileName);
|
|
BEGIN(SAVELINE);
|
|
}
|
|
else
|
|
{
|
|
BEGIN(INITIAL);
|
|
}
|
|
|
|
// gSaveLine was last line saved, before macro invocation
|
|
if (wasInMacro && !gbInsideMacro && !oneLiner)
|
|
{
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
gLinesAssembled++;
|
|
yylineno++;
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
YY_BREAK
|
|
case 72:
|
|
YY_RULE_SETUP
|
|
#line 1692 "vs1.0_tokens.l"
|
|
ECHO;
|
|
YY_BREAK
|
|
#line 2900 "_vs1.0_lexer.cpp"
|
|
|
|
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;
|
|
|
|
if ( yy_current_buffer->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->yy_n_chars;
|
|
yy_current_buffer->yy_input_file = yyin;
|
|
yy_current_buffer->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->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->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 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()
|
|
{
|
|
register char *dest = yy_current_buffer->yy_ch_buf;
|
|
register char *source = yytext_ptr;
|
|
register int number_to_move, i;
|
|
int ret_val;
|
|
|
|
if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
|
|
YY_FATAL_ERROR(
|
|
"fatal flex scanner internal error--end of buffer missed" );
|
|
|
|
if ( yy_current_buffer->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 singled characater, 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->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_n_chars = 0;
|
|
|
|
else
|
|
{
|
|
int num_to_read =
|
|
yy_current_buffer->yy_buf_size - number_to_move - 1;
|
|
|
|
while ( num_to_read <= 0 )
|
|
{ /* Not enough room in the buffer - grow it. */
|
|
#ifdef YY_USES_REJECT
|
|
YY_FATAL_ERROR(
|
|
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
|
|
#else
|
|
|
|
/* just a shorter name for the current buffer */
|
|
YY_BUFFER_STATE b = yy_current_buffer;
|
|
|
|
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. */
|
|
yy_flex_realloc( (void *) b->yy_ch_buf,
|
|
b->yy_buf_size + 2 );
|
|
}
|
|
else
|
|
/* Can't grow it, we don't own it. */
|
|
b->yy_ch_buf = 0;
|
|
|
|
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->yy_buf_size -
|
|
number_to_move - 1;
|
|
#endif
|
|
}
|
|
|
|
if ( num_to_read > YY_READ_BUF_SIZE )
|
|
num_to_read = YY_READ_BUF_SIZE;
|
|
|
|
/* Read in more data. */
|
|
YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
|
|
yy_n_chars, num_to_read );
|
|
}
|
|
|
|
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->yy_buffer_status =
|
|
YY_BUFFER_EOF_PENDING;
|
|
}
|
|
}
|
|
|
|
else
|
|
ret_val = EOB_ACT_CONTINUE_SCAN;
|
|
|
|
yy_n_chars += number_to_move;
|
|
yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
|
|
yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
|
|
|
|
yytext_ptr = &yy_current_buffer->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()
|
|
{
|
|
register yy_state_type yy_current_state;
|
|
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;
|
|
|
|
for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
|
|
{
|
|
register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 4);
|
|
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 >= 329 )
|
|
yy_c = yy_meta[(unsigned int) yy_c];
|
|
}
|
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
|
*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 );
|
|
*/
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
|
|
#else
|
|
static yy_state_type yy_try_NUL_trans( yy_current_state )
|
|
yy_state_type yy_current_state;
|
|
#endif
|
|
{
|
|
register int yy_is_jam;
|
|
|
|
register YY_CHAR yy_c = 4;
|
|
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 >= 329 )
|
|
yy_c = yy_meta[(unsigned int) yy_c];
|
|
}
|
|
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
|
|
*yy_state_ptr++ = yy_current_state;
|
|
yy_is_jam = (yy_current_state == 328);
|
|
|
|
return yy_is_jam ? 0 : yy_current_state;
|
|
}
|
|
|
|
|
|
#ifndef YY_NO_UNPUT
|
|
#ifdef YY_USE_PROTOS
|
|
static void yyunput( int c, register char *yy_bp )
|
|
#else
|
|
static void yyunput( c, yy_bp )
|
|
int c;
|
|
register char *yy_bp;
|
|
#endif
|
|
{
|
|
register char *yy_cp = yy_c_buf_p;
|
|
|
|
/* undo effects of setting up yytext */
|
|
*yy_cp = yy_hold_char;
|
|
|
|
if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
|
|
{ /* need to shift things up to make room */
|
|
/* +2 for EOB chars. */
|
|
register int number_to_move = yy_n_chars + 2;
|
|
register char *dest = &yy_current_buffer->yy_ch_buf[
|
|
yy_current_buffer->yy_buf_size + 2];
|
|
register char *source =
|
|
&yy_current_buffer->yy_ch_buf[number_to_move];
|
|
|
|
while ( source > yy_current_buffer->yy_ch_buf )
|
|
*--dest = *--source;
|
|
|
|
yy_cp += (int) (dest - source);
|
|
yy_bp += (int) (dest - source);
|
|
yy_n_chars = yy_current_buffer->yy_buf_size;
|
|
|
|
if ( yy_cp < yy_current_buffer->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_UNPUT */
|
|
|
|
|
|
#ifdef __cplusplus
|
|
static int yyinput()
|
|
#else
|
|
static int input()
|
|
#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->yy_ch_buf[yy_n_chars] )
|
|
/* This was really a NUL. */
|
|
*yy_c_buf_p = '\0';
|
|
|
|
else
|
|
{ /* need more input */
|
|
yytext_ptr = yy_c_buf_p;
|
|
++yy_c_buf_p;
|
|
|
|
switch ( yy_get_next_buffer() )
|
|
{
|
|
case EOB_ACT_END_OF_FILE:
|
|
{
|
|
if ( yywrap() )
|
|
{
|
|
yy_c_buf_p =
|
|
yytext_ptr + YY_MORE_ADJ;
|
|
return EOF;
|
|
}
|
|
|
|
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 + YY_MORE_ADJ;
|
|
break;
|
|
|
|
case EOB_ACT_LAST_MATCH:
|
|
#ifdef __cplusplus
|
|
YY_FATAL_ERROR(
|
|
"unexpected last match in yyinput()" );
|
|
#else
|
|
YY_FATAL_ERROR(
|
|
"unexpected last match in input()" );
|
|
#endif
|
|
}
|
|
}
|
|
}
|
|
|
|
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;
|
|
|
|
yy_current_buffer->yy_at_bol = (c == '\n');
|
|
|
|
return c;
|
|
}
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
void yyrestart( FILE *input_file )
|
|
#else
|
|
void yyrestart( input_file )
|
|
FILE *input_file;
|
|
#endif
|
|
{
|
|
if ( ! yy_current_buffer )
|
|
yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
|
|
|
|
yy_init_buffer( yy_current_buffer, input_file );
|
|
yy_load_buffer_state();
|
|
}
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
|
|
#else
|
|
void yy_switch_to_buffer( new_buffer )
|
|
YY_BUFFER_STATE new_buffer;
|
|
#endif
|
|
{
|
|
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->yy_buf_pos = yy_c_buf_p;
|
|
yy_current_buffer->yy_n_chars = yy_n_chars;
|
|
}
|
|
|
|
yy_current_buffer = 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;
|
|
}
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
void yy_load_buffer_state( void )
|
|
#else
|
|
void yy_load_buffer_state()
|
|
#endif
|
|
{
|
|
yy_n_chars = yy_current_buffer->yy_n_chars;
|
|
yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
|
|
yyin = yy_current_buffer->yy_input_file;
|
|
yy_hold_char = *yy_c_buf_p;
|
|
}
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
|
|
#else
|
|
YY_BUFFER_STATE yy_create_buffer( file, size )
|
|
FILE *file;
|
|
int size;
|
|
#endif
|
|
{
|
|
YY_BUFFER_STATE b;
|
|
|
|
b = (YY_BUFFER_STATE) yy_flex_alloc( 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 *) yy_flex_alloc( 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;
|
|
}
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
void yy_delete_buffer( YY_BUFFER_STATE b )
|
|
#else
|
|
void yy_delete_buffer( b )
|
|
YY_BUFFER_STATE b;
|
|
#endif
|
|
{
|
|
if ( ! b )
|
|
return;
|
|
|
|
if ( b == yy_current_buffer )
|
|
yy_current_buffer = (YY_BUFFER_STATE) 0;
|
|
|
|
if ( b->yy_is_our_buffer )
|
|
yy_flex_free( (void *) b->yy_ch_buf );
|
|
|
|
yy_flex_free( (void *) b );
|
|
}
|
|
|
|
|
|
#ifndef YY_ALWAYS_INTERACTIVE
|
|
#ifndef YY_NEVER_INTERACTIVE
|
|
extern int isatty YY_PROTO(( int ));
|
|
#endif
|
|
#endif
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
|
|
#else
|
|
void yy_init_buffer( b, file )
|
|
YY_BUFFER_STATE b;
|
|
FILE *file;
|
|
#endif
|
|
|
|
|
|
{
|
|
yy_flush_buffer( b );
|
|
|
|
b->yy_input_file = file;
|
|
b->yy_fill_buffer = 1;
|
|
|
|
#if YY_ALWAYS_INTERACTIVE
|
|
b->yy_is_interactive = 1;
|
|
#else
|
|
#if YY_NEVER_INTERACTIVE
|
|
b->yy_is_interactive = 0;
|
|
#else
|
|
b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
|
|
#endif
|
|
#endif
|
|
}
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
void yy_flush_buffer( YY_BUFFER_STATE b )
|
|
#else
|
|
void yy_flush_buffer( b )
|
|
YY_BUFFER_STATE b;
|
|
#endif
|
|
|
|
{
|
|
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();
|
|
}
|
|
|
|
|
|
#ifndef YY_NO_SCAN_BUFFER
|
|
#ifdef YY_USE_PROTOS
|
|
YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
|
|
#else
|
|
YY_BUFFER_STATE yy_scan_buffer( base, size )
|
|
char *base;
|
|
yy_size_t size;
|
|
#endif
|
|
{
|
|
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 0;
|
|
|
|
b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
|
|
if ( ! b )
|
|
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
|
|
|
|
b->yy_buf_size = 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 = 0;
|
|
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;
|
|
}
|
|
#endif
|
|
|
|
|
|
#ifndef YY_NO_SCAN_STRING
|
|
#ifdef YY_USE_PROTOS
|
|
YY_BUFFER_STATE yy_scan_string( yyconst char *str )
|
|
#else
|
|
YY_BUFFER_STATE yy_scan_string( str )
|
|
yyconst char *str;
|
|
#endif
|
|
{
|
|
int len;
|
|
for ( len = 0; str[len]; ++len )
|
|
;
|
|
|
|
return yy_scan_bytes( str, len );
|
|
}
|
|
#endif
|
|
|
|
|
|
#ifndef YY_NO_SCAN_BYTES
|
|
#ifdef YY_USE_PROTOS
|
|
YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
|
|
#else
|
|
YY_BUFFER_STATE yy_scan_bytes( bytes, len )
|
|
yyconst char *bytes;
|
|
int len;
|
|
#endif
|
|
{
|
|
YY_BUFFER_STATE b;
|
|
char *buf;
|
|
yy_size_t n;
|
|
int i;
|
|
|
|
/* Get memory for full buffer, including space for trailing EOB's. */
|
|
n = len + 2;
|
|
buf = (char *) yy_flex_alloc( n );
|
|
if ( ! buf )
|
|
YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
|
|
|
|
for ( i = 0; i < len; ++i )
|
|
buf[i] = bytes[i];
|
|
|
|
buf[len] = buf[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;
|
|
}
|
|
#endif
|
|
|
|
|
|
#ifndef YY_NO_PUSH_STATE
|
|
#ifdef YY_USE_PROTOS
|
|
static void yy_push_state( int new_state )
|
|
#else
|
|
static void yy_push_state( new_state )
|
|
int new_state;
|
|
#endif
|
|
{
|
|
if ( yy_start_stack_ptr >= yy_start_stack_depth )
|
|
{
|
|
yy_size_t new_size;
|
|
|
|
yy_start_stack_depth += YY_START_STACK_INCR;
|
|
new_size = yy_start_stack_depth * sizeof( int );
|
|
|
|
if ( ! yy_start_stack )
|
|
yy_start_stack = (int *) yy_flex_alloc( new_size );
|
|
|
|
else
|
|
yy_start_stack = (int *) yy_flex_realloc(
|
|
(void *) yy_start_stack, new_size );
|
|
|
|
if ( ! yy_start_stack )
|
|
YY_FATAL_ERROR(
|
|
"out of memory expanding start-condition stack" );
|
|
}
|
|
|
|
yy_start_stack[yy_start_stack_ptr++] = YY_START;
|
|
|
|
BEGIN(new_state);
|
|
}
|
|
#endif
|
|
|
|
|
|
#ifndef YY_NO_POP_STATE
|
|
static void yy_pop_state()
|
|
{
|
|
if ( --yy_start_stack_ptr < 0 )
|
|
YY_FATAL_ERROR( "start-condition stack underflow" );
|
|
|
|
BEGIN(yy_start_stack[yy_start_stack_ptr]);
|
|
}
|
|
#endif
|
|
|
|
|
|
#ifndef YY_NO_TOP_STATE
|
|
static int yy_top_state()
|
|
{
|
|
return yy_start_stack[yy_start_stack_ptr - 1];
|
|
}
|
|
#endif
|
|
|
|
#ifndef YY_EXIT_FAILURE
|
|
#define YY_EXIT_FAILURE 2
|
|
#endif
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
static void yy_fatal_error( yyconst char msg[] )
|
|
#else
|
|
static void yy_fatal_error( msg )
|
|
char msg[];
|
|
#endif
|
|
{
|
|
(void) fprintf( stderr, "%s\n", msg );
|
|
LEX_DBG_BREAK
|
|
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. */ \
|
|
yytext[yyleng] = yy_hold_char; \
|
|
yy_c_buf_p = yytext + n - YY_MORE_ADJ; \
|
|
yy_hold_char = *yy_c_buf_p; \
|
|
*yy_c_buf_p = '\0'; \
|
|
yyleng = n; \
|
|
} \
|
|
while ( 0 )
|
|
|
|
|
|
/* Internal utility routines. */
|
|
|
|
#ifndef yytext_ptr
|
|
#ifdef YY_USE_PROTOS
|
|
static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
|
|
#else
|
|
static void yy_flex_strncpy( s1, s2, n )
|
|
char *s1;
|
|
yyconst char *s2;
|
|
int n;
|
|
#endif
|
|
{
|
|
register int i;
|
|
for ( i = 0; i < n; ++i )
|
|
s1[i] = s2[i];
|
|
}
|
|
#endif
|
|
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
static void *yy_flex_alloc( yy_size_t size )
|
|
#else
|
|
static void *yy_flex_alloc( size )
|
|
yy_size_t size;
|
|
#endif
|
|
{
|
|
return (void *) malloc( size );
|
|
}
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
static void *yy_flex_realloc( void *ptr, yy_size_t size )
|
|
#else
|
|
static void *yy_flex_realloc( ptr, size )
|
|
void *ptr;
|
|
yy_size_t size;
|
|
#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.
|
|
*/
|
|
return (void *) realloc( (char *) ptr, size );
|
|
}
|
|
|
|
#ifdef YY_USE_PROTOS
|
|
static void yy_flex_free( void *ptr )
|
|
#else
|
|
static void yy_flex_free( ptr )
|
|
void *ptr;
|
|
#endif
|
|
{
|
|
free( ptr );
|
|
}
|
|
|
|
#if YY_MAIN
|
|
int main()
|
|
{
|
|
yylex();
|
|
return 0;
|
|
}
|
|
#endif
|
|
#line 1692 "vs1.0_tokens.l"
|
|
|
|
|
|
|
|
//=====================================================================
|
|
// Function: FindNMacro
|
|
// Description: Look through macros and see if it had been predefined
|
|
// Parameters: findName = name to lookup
|
|
// sLen = # characters valid in source (findName)
|
|
// Returns: MACROENTRY * = pointer to macro entry if found
|
|
//=====================================================================
|
|
MACROENTRY *FindNMacro(char *findName, unsigned int sLen)
|
|
{
|
|
MACROENTRY *curEntry;
|
|
|
|
curEntry = gLastMacro;
|
|
while (curEntry != NULL)
|
|
{
|
|
if (strlen(curEntry->macroName) == sLen)
|
|
{
|
|
if (!strncmp(curEntry->macroName, findName, sLen))
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
|
|
curEntry = curEntry->prev;
|
|
}
|
|
|
|
return curEntry;
|
|
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: FindMacro
|
|
// Description: Look through macros and see if it had been predefined
|
|
// Parameters: findName = name to lookup
|
|
// Returns: MACROENTRY * = pointer to macro entry if found
|
|
//=====================================================================
|
|
MACROENTRY *FindMacro(char *findName)
|
|
{
|
|
MACROENTRY *curEntry;
|
|
|
|
curEntry = gLastMacro;
|
|
while (curEntry != NULL)
|
|
{
|
|
if (!strcmp(curEntry->macroName, findName))
|
|
{
|
|
break;
|
|
}
|
|
|
|
curEntry = curEntry->prev;
|
|
}
|
|
|
|
return curEntry;
|
|
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: CleanUp
|
|
// Description: Clean up the #define strings
|
|
// Parameters: .
|
|
// Returns: .
|
|
//=====================================================================
|
|
void CleanUp()
|
|
{
|
|
void *tPtr;
|
|
|
|
// free up the macros that were alloced
|
|
while (gLastMacro != NULL)
|
|
{
|
|
|
|
FreeMacroEntry(gLastMacro);
|
|
|
|
tPtr = gLastMacro;
|
|
gLastMacro = gLastMacro->prev;
|
|
SAFEFREE(tPtr);
|
|
}
|
|
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: FreeMacroEntry
|
|
// Description: Frees up the macro entry data, (parms, lines of text)
|
|
// Parameters: macEntry = pointer to the MACROENTRY structure
|
|
// Returns: .
|
|
//=====================================================================
|
|
void FreeMacroEntry(MACROENTRY *macEntry)
|
|
{
|
|
MACROTEXT *tText;
|
|
MACROTEXT *tNext;
|
|
|
|
SAFEFREE(macEntry->macroName);
|
|
SAFEFREE(macEntry->fileName);
|
|
// free the macro lines that were alloced
|
|
tText = macEntry->lastMacroLines;
|
|
while (tText != NULL)
|
|
{
|
|
tNext = tText->prev;
|
|
SAFEFREE(tText);
|
|
tText = tNext;
|
|
}
|
|
|
|
// free the text of the macro parms that were alloced
|
|
tText = macEntry->lastMacroParms;
|
|
while (tText != NULL)
|
|
{
|
|
tNext = tText->prev;
|
|
SAFEFREE(tText);
|
|
tText = tNext;
|
|
}
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: CheckMacroFunctions
|
|
// Description: Find if this text is a builtin macro function
|
|
// Parameters: lookString = non-null terminated string of possible
|
|
// and if found set global macro function call
|
|
// Returns: .
|
|
//=====================================================================
|
|
void CheckMacroFunctions(char *lookString, unsigned int *recognizedLen, char **invString)
|
|
{
|
|
|
|
unsigned int i;
|
|
unsigned int sLen;
|
|
|
|
for (i=0; i< NUM_MACRO_FUNCTIONS; i++)
|
|
{
|
|
sLen = strlen(gMacroFunctions[i].name);
|
|
if (!strncmp(gMacroFunctions[i].name, lookString, sLen))
|
|
{
|
|
gMacroCallFunction = gMacroFunctions[i].function;
|
|
*recognizedLen = sLen;
|
|
*invString = NULL;
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: FindAlphaNum
|
|
// Description: Find a whole alpha numeric string, ie consists of
|
|
// [A-Za-z0-9_] only
|
|
// Parameters: srcStr = source string to search through.
|
|
// sLen = unsinged int pointer to length of string found
|
|
// Returns: pointer to found start of string.
|
|
// NULL if none.
|
|
//=====================================================================
|
|
char *FindAlphaNum(char *srcStr, unsigned int *sLen)
|
|
{
|
|
char curChar;
|
|
char *foundStr;
|
|
|
|
while (*srcStr != NULL)
|
|
{
|
|
curChar = toupper(*srcStr);
|
|
if ((curChar >= 'A') && (curChar <= 'Z'))
|
|
break;
|
|
|
|
if ((curChar >= '0') && (curChar <='9'))
|
|
break;
|
|
|
|
if (curChar == '_')
|
|
break;
|
|
|
|
srcStr++;
|
|
}
|
|
|
|
if (*srcStr == NULL)
|
|
{
|
|
return NULL;
|
|
}
|
|
|
|
foundStr = srcStr;
|
|
|
|
*sLen = 0;
|
|
// now search for end of string of [A-Za-z0-9_]
|
|
while (*srcStr != NULL)
|
|
{
|
|
curChar = toupper(*srcStr);
|
|
if ((curChar < 'A') || (curChar > 'Z'))
|
|
{
|
|
if ((curChar < '0') || (curChar > '9'))
|
|
{
|
|
if (curChar != '_')
|
|
break;
|
|
}
|
|
}
|
|
|
|
(*sLen)++;
|
|
srcStr++;
|
|
}
|
|
|
|
return foundStr;
|
|
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: FindDefineParm
|
|
// Description: Find if the MACROENTRY->macroText linked list contains
|
|
// replaceable parameters.
|
|
// Parameters: srcParms = pointer to MACROENTRY structure for source
|
|
// parameters
|
|
// invParms = MACROENTRY pointer to invocation parameters
|
|
// lookString = non-null terminated string of possible
|
|
// replaceable string
|
|
// recognizedLen = replacement string matched length
|
|
// invString = invocation string to replace with
|
|
// Returns: pointer to first character found in lookstring
|
|
//=====================================================================
|
|
char *FindDefineParm(MACROENTRY *srcParms, MACROENTRY *invParms,
|
|
char *lookString, unsigned int *recognizedLen, char **invString)
|
|
{
|
|
MACROTEXT *srcText;
|
|
MACROTEXT *invText;
|
|
char *checkStr;
|
|
unsigned int checkLen;
|
|
unsigned int sLen;
|
|
|
|
checkStr = lookString;
|
|
*invString = NULL;
|
|
|
|
// first search for first [A-Za-z0-9_] only string
|
|
checkStr = FindAlphaNum(lookString, &checkLen);
|
|
|
|
while (checkStr != NULL)
|
|
{
|
|
// check all the #define parameters for match
|
|
srcText = srcParms->firstMacroParms;
|
|
invText = invParms->firstMacroParms;
|
|
while (srcText)
|
|
{
|
|
sLen = strlen(srcText->macroText);
|
|
// lengths should match
|
|
if (sLen == checkLen)
|
|
{
|
|
if (!strncmp(checkStr, srcText->macroText, checkLen))
|
|
{
|
|
// it matched so return replacement text
|
|
*invString = invText->macroText;
|
|
// and length that we reconized
|
|
*recognizedLen = checkLen;
|
|
return checkStr;
|
|
}
|
|
}
|
|
|
|
srcText = srcText->next;
|
|
invText = invText->next;
|
|
}
|
|
|
|
// not found yet, so go to next string.
|
|
checkStr = FindAlphaNum(checkStr+checkLen, &checkLen);
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: FindReplaceParm
|
|
// Description: Find if the MACROENTRY->macroText linked list contains
|
|
// a replaceable parameters.
|
|
// Parameters: srcParms = pointer to MACROENTRY structure for source
|
|
// parameters
|
|
// invParms = MACROENTRY pointer to invocation parameters
|
|
// lookString = non-null terminated string of possible
|
|
// replaceable string
|
|
// recognizedLen = replacement string matched length
|
|
// invString = invocation string to replace with
|
|
// Returns: .
|
|
//=====================================================================
|
|
void FindReplaceParm(MACROENTRY *srcParms, MACROENTRY *invParms,
|
|
char *lookString, unsigned int *recognizedLen, char **invString)
|
|
{
|
|
unsigned int sLen;
|
|
MACROTEXT *srcText;
|
|
MACROTEXT *invText;
|
|
|
|
*recognizedLen = 0;
|
|
*invString = NULL;
|
|
|
|
srcText = srcParms->firstMacroParms;
|
|
invText = invParms->firstMacroParms;
|
|
|
|
if (srcText != NULL)
|
|
{
|
|
// go until srcText # strings ends
|
|
while (srcText != NULL)
|
|
{
|
|
sLen = strlen(srcText->macroText);
|
|
if (!strncmp(srcText->macroText, lookString, sLen))
|
|
{
|
|
// found it so return src, replacement string
|
|
*recognizedLen = strlen(srcText->macroText);
|
|
*invString = invText->macroText;
|
|
// call function macro if it was invoked prior.
|
|
if (gMacroCallFunction != NULL)
|
|
{
|
|
gMacroCallFunction(lookString, recognizedLen, invString);
|
|
gMacroCallFunction = NULL;
|
|
}
|
|
return;
|
|
}
|
|
|
|
srcText = srcText->next;
|
|
invText = invText->next;
|
|
}
|
|
}
|
|
|
|
// ok, it wasn't found, look through builtin macro functions
|
|
CheckMacroFunctions(lookString, recognizedLen, invString);
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: ReplaceMacroParms
|
|
// Description: Replace macro parameters when macro was defined, with
|
|
// those specified on the macro invocation line
|
|
// Parameters: srcLine = source line to replace src macro parms with
|
|
// destLine = destination line save to.
|
|
// invocation macro parameters.
|
|
// parseMacro = currently parsing macro entry
|
|
// invParms = invocation macro entry
|
|
// Returns: .
|
|
//=====================================================================
|
|
void ReplaceMacroParms(char *srcLine, char *destLine,
|
|
MACROENTRY *srcParms, MACROENTRY *invParms)
|
|
{
|
|
char *findReplace;
|
|
char *invString;
|
|
unsigned int sLen;
|
|
unsigned int dLen;
|
|
unsigned int copyLen;
|
|
unsigned int subLen;
|
|
unsigned int recognizedLen;
|
|
|
|
destLine[0]= '\0';
|
|
|
|
sLen = strlen(srcLine);
|
|
dLen = 0;
|
|
|
|
while (sLen > 0)
|
|
{
|
|
// strtok might work better except it modifies the string, so
|
|
// kind of do my own....
|
|
if (!srcParms->bIsDefine)
|
|
{
|
|
findReplace = strchr(srcLine, '%');
|
|
if (findReplace != NULL)
|
|
{
|
|
// bypass % sign in findReplacement
|
|
findReplace++;
|
|
// figure out length of source before %
|
|
copyLen = (findReplace - srcLine)-1;
|
|
// check if there is a replacement string
|
|
FindReplaceParm(srcParms, invParms, findReplace, &recognizedLen, &invString);
|
|
}
|
|
else
|
|
{
|
|
strcat(destLine, srcLine);
|
|
return;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
findReplace = FindDefineParm(srcParms, invParms, srcLine, &recognizedLen, &invString);
|
|
if (findReplace != NULL)
|
|
{
|
|
// figure out length of source before %
|
|
copyLen = findReplace - srcLine;
|
|
}
|
|
else
|
|
{
|
|
strcat(destLine, srcLine);
|
|
return;
|
|
}
|
|
}
|
|
|
|
|
|
if (invString != NULL)
|
|
{
|
|
// figure out how much we are going to substitute
|
|
subLen = strlen(invString);
|
|
}
|
|
else
|
|
{
|
|
subLen = 0;
|
|
}
|
|
|
|
if ((dLen + copyLen + subLen) > MAXSAVELINE)
|
|
{
|
|
LexError("Macro string overrun.\n");
|
|
CleanUp();
|
|
LEX_DBG_BREAK
|
|
exit(ERROR_MACRO_OVERRUN);
|
|
}
|
|
|
|
if (copyLen > 0)
|
|
{
|
|
strncat(destLine, srcLine, copyLen);
|
|
dLen += copyLen;
|
|
}
|
|
|
|
srcLine += copyLen;
|
|
sLen -= copyLen;
|
|
// in macro so skip % part of variable
|
|
if (!srcParms->bIsDefine)
|
|
{
|
|
// skip %, also
|
|
srcLine++;
|
|
sLen--;
|
|
}
|
|
|
|
if (invString != NULL)
|
|
{
|
|
strcat(destLine, invString);
|
|
dLen += strlen(invString);
|
|
}
|
|
|
|
srcLine += recognizedLen;
|
|
sLen -= recognizedLen;
|
|
}
|
|
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: SaveMacroText
|
|
// Description: Adds a string to a linked list of MACROTEXT structures
|
|
// Parameters: srcText = pointer to source text to save
|
|
// lastMacroText = last allocated, or NULL
|
|
// Returns: newly allocated MACROTEXT structure, or NULL
|
|
//=====================================================================
|
|
MACROTEXT *SaveMacroText(char *srcText, MACROTEXT *lastMacroText)
|
|
{
|
|
MACROTEXT *curMacroText;
|
|
|
|
curMacroText = (MACROTEXT *)malloc(sizeof(MACROTEXT));
|
|
if (curMacroText == NULL)
|
|
{
|
|
return NULL;
|
|
}
|
|
else
|
|
{
|
|
// no next entry but set up previous with previously alloced macro parameter
|
|
curMacroText->next = NULL;
|
|
curMacroText->prev = lastMacroText;
|
|
|
|
// if the macroParm pointer is null then we are the first allocated
|
|
// so if not set the last one allocate next pointer to newly allocated structure
|
|
if (lastMacroText != NULL)
|
|
{
|
|
lastMacroText->next = curMacroText;
|
|
}
|
|
|
|
/* %%%%% this should be set up in memory pools. */
|
|
curMacroText->macroText = strdup(srcText);
|
|
if (curMacroText->macroText == NULL)
|
|
{
|
|
SAFEFREE(curMacroText);
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
return curMacroText;
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: ParseBuiltInMacroParms
|
|
// Description: parse parameters of string and fill in MACROENTRY
|
|
// structure.
|
|
// Parameters: parsedMacro = pointer to MACROENTRY structure that gets
|
|
// filled in with parameter pointers and count
|
|
// parmStr = string to parse parameters from
|
|
// Returns: false if error
|
|
//=====================================================================
|
|
bool ParseBuiltInMacroParms(MACROENTRY *parsedMacro, char *parmStr)
|
|
{
|
|
char *endStr;
|
|
char *foundParm;
|
|
MACROTEXT *prevMT;
|
|
MACROTEXT *curMT;
|
|
|
|
parsedMacro->numParms = 0;
|
|
parsedMacro->firstMacroParms = NULL;
|
|
|
|
foundParm = strdup(parmStr);
|
|
if (foundParm == NULL)
|
|
{
|
|
LexError("Out of memory parsing bultin macro parameters.\n");
|
|
return false;
|
|
}
|
|
|
|
// assume a ')' is on the end.
|
|
endStr = strrchr(foundParm, ')');
|
|
if (endStr == NULL)
|
|
{
|
|
LexWarning("Ending parenthesis not found for macro %s.\n", parsedMacro->macroName);
|
|
endStr = foundParm + strlen(foundParm);
|
|
}
|
|
|
|
prevMT = NULL;
|
|
// strip out and seperate parameters
|
|
while (foundParm < endStr)
|
|
{
|
|
// allocate a macro text structure
|
|
curMT = (MACROTEXT *)malloc(sizeof(MACROTEXT));
|
|
if (curMT == NULL)
|
|
{
|
|
free(parmStr);
|
|
LexError("Out of memory parsing bultin macro parameters.\n");
|
|
return false;
|
|
}
|
|
curMT->next = NULL;
|
|
curMT->prev = prevMT;
|
|
parsedMacro->numParms++;
|
|
|
|
if (prevMT != NULL)
|
|
{
|
|
prevMT->next = curMT;
|
|
}
|
|
else
|
|
{
|
|
parsedMacro->firstMacroParms = curMT;
|
|
}
|
|
|
|
curMT->macroText = foundParm;
|
|
// search for next parameters, delimited by comma
|
|
foundParm = strchr(foundParm, ',');
|
|
if (foundParm == NULL)
|
|
{
|
|
foundParm = endStr;
|
|
*foundParm = '\0';
|
|
}
|
|
else
|
|
{
|
|
// skip comma
|
|
*foundParm = '\0';
|
|
foundParm++;
|
|
}
|
|
prevMT = curMT;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: MacroMathFunction
|
|
// Description: Comes here after macro replacement is done to perform
|
|
// some mathematic function on parameter (macro replacement
|
|
// string (ie, register))
|
|
// Parameters: invMacro = macroentry pointer containing macro information
|
|
// recognizedLen = # characters recoginized so far
|
|
// invStr = invoked replacement string so far
|
|
// mathStr = "-", "+", etc for mathematic function
|
|
// Returns: new recognizedLen, invStr, with incremented #
|
|
//=====================================================================
|
|
void MacroMathFunction(MACROENTRY *invMacro, unsigned int *recognizedLen, char **invStr,
|
|
char *mathStr)
|
|
{
|
|
char *numStartStr;
|
|
unsigned int sLen;
|
|
char numberStr[256];
|
|
unsigned int number;
|
|
char *operand;
|
|
|
|
|
|
// verify enough paramters to complete operation
|
|
if (invMacro->numParms != 2)
|
|
{
|
|
LexError("Two parameters are required for %s macro\n", invMacro->macroName);
|
|
return;
|
|
}
|
|
|
|
// get second macro parm, which is add by amount.
|
|
operand = invMacro->firstMacroParms->next->macroText;
|
|
|
|
// first find inner most bracket if any
|
|
numStartStr = strrchr(*invStr, ']');
|
|
if (numStartStr == NULL)
|
|
{
|
|
numStartStr = strrchr(*invStr, ')');
|
|
}
|
|
|
|
if (numStartStr != NULL)
|
|
{
|
|
if ((strlen(*invStr)+strlen(operand)+1) > MAXREPLACESTRING)
|
|
{
|
|
LexError("Out of Temporary string replacement memory inside builtin macro %s\n",
|
|
invMacro->macroName);
|
|
}
|
|
else
|
|
{
|
|
sLen = (numStartStr - *invStr);
|
|
gReplaceText[0] = '\0';
|
|
strncat(gReplaceText, *invStr, sLen);
|
|
strcat(gReplaceText, mathStr);
|
|
strcat(gReplaceText, operand);
|
|
strcat(gReplaceText, numStartStr);
|
|
*invStr = gReplaceText;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
numStartStr = strpbrk(*invStr, "0123456789");
|
|
if (numStartStr != NULL)
|
|
{
|
|
// put up to number we found
|
|
sLen = numStartStr - *invStr;
|
|
if (sLen > MAXREPLACESTRING)
|
|
goto ErrOut;
|
|
|
|
gReplaceText[0] = '\0';
|
|
strncat(gReplaceText, *invStr, sLen);
|
|
|
|
switch (mathStr[0])
|
|
{
|
|
case '-':
|
|
number = atoi(numStartStr)-atoi(operand);
|
|
break;
|
|
case '+':
|
|
number = atoi(numStartStr)+atoi(operand);
|
|
break;
|
|
}
|
|
sprintf(numberStr, "%d", number);
|
|
|
|
if ((strlen(gReplaceText) + strlen(numberStr)) > MAXREPLACESTRING)
|
|
goto ErrOut;
|
|
|
|
strcat(gReplaceText, numberStr);
|
|
|
|
while ((*numStartStr != '\0') && (*numStartStr >= '0' && *numStartStr <= '9'))
|
|
numStartStr++;
|
|
|
|
if ((strlen(gReplaceText) + strlen(numStartStr)) > MAXREPLACESTRING)
|
|
goto ErrOut;
|
|
|
|
strcat(gReplaceText, numStartStr);
|
|
|
|
*invStr = gReplaceText;
|
|
}
|
|
else
|
|
{
|
|
if ((strlen(*invStr)+strlen(operand)+1) > MAXREPLACESTRING)
|
|
{
|
|
LexError("Out of Temporary string replacement memory inside builtin macro %s\n",
|
|
invMacro->macroName);
|
|
}
|
|
else
|
|
{
|
|
sprintf(gReplaceText, "%s%s%s", *invStr, mathStr, operand);
|
|
*invStr = gReplaceText;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
return;
|
|
|
|
ErrOut:
|
|
LexError("Out of Temporary string replacement memory inside builtin macro %s\n",
|
|
invMacro->macroName);
|
|
// skip ')'
|
|
(*recognizedLen)++;
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: MacroIncFunction
|
|
// Description: Comes here after macro replacement is done to increment
|
|
// macro replacement string (ie, register)
|
|
// Parameters: lookStr = string after '(', so we can get parameters
|
|
// recognizedLen = # characters recoginized so far
|
|
// invStr = invoked replacement string so far
|
|
// Returns: new recognizedLen, invStr, with incremented #
|
|
//=====================================================================
|
|
void MacroIncFunction(char *lookStr, unsigned int *recognizedLen, char **invStr)
|
|
{
|
|
MACROENTRY tMEntry;
|
|
MACROTEXT parm1;
|
|
MACROTEXT parm2;
|
|
|
|
tMEntry.macroName = "%inc()";
|
|
tMEntry.numParms = 2;
|
|
tMEntry.firstMacroParms = &parm1;
|
|
parm1.prev = NULL;
|
|
parm1.next = &parm2;
|
|
parm1.macroText = *invStr;
|
|
parm2.prev = &parm1;
|
|
parm2.next = NULL;
|
|
parm2.macroText = "1";
|
|
|
|
MacroMathFunction(&tMEntry, recognizedLen, invStr, "+");
|
|
// skip ')'
|
|
(*recognizedLen)++;
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: MacroDecFunction
|
|
// Description: Comes here after macro replacement is done to decrement
|
|
// macro replacement string (ie, register)
|
|
// Parameters: lookStr = string after '(', so we can get parameters
|
|
// recognizedLen = # characters recoginized so far
|
|
// invStr = invoked replacement string so far
|
|
// Returns: new recognizedLen, invStr, with decremented #
|
|
//=====================================================================
|
|
void MacroDecFunction(char *lookStr, unsigned int *recognizedLen, char **invStr)
|
|
{
|
|
MACROENTRY tMEntry;
|
|
MACROTEXT parm1;
|
|
MACROTEXT parm2;
|
|
|
|
tMEntry.macroName = "%dec()";
|
|
tMEntry.numParms = 2;
|
|
tMEntry.firstMacroParms = &parm1;
|
|
parm1.prev = NULL;
|
|
parm1.next = &parm2;
|
|
parm1.macroText = *invStr;
|
|
parm2.prev = &parm1;
|
|
parm2.next = NULL;
|
|
parm2.macroText = "1";
|
|
|
|
MacroMathFunction(&tMEntry, recognizedLen, invStr, "-");
|
|
// skip ')'
|
|
(*recognizedLen)++;
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: MacroAddFunction
|
|
// Description: Comes here after macro replacement is done to add
|
|
// macro replacement string (ie, register)
|
|
// Parameters: lookStr = string after '(', so we can get parameters
|
|
// recognizedLen = # characters recoginized so far
|
|
// invStr = invoked replacement string so far
|
|
// Returns: new recognizedLen, invStr, with incremented #
|
|
//=====================================================================
|
|
void MacroAddFunction(char *lookStr, unsigned int *recognizedLen, char **invStr)
|
|
{
|
|
MACROENTRY tMEntry;
|
|
MACROTEXT *curMT;
|
|
MACROTEXT *nextMT;
|
|
unsigned int i;
|
|
|
|
tMEntry.macroName = "%add()";
|
|
if (strlen(lookStr) > MAXREPLACESTRING)
|
|
{
|
|
LexError("Out of Temporary string replacement memory inside builtin macro %add()\n");
|
|
return;
|
|
}
|
|
if (ParseBuiltInMacroParms(&tMEntry, lookStr))
|
|
{
|
|
MacroMathFunction(&tMEntry, recognizedLen, invStr, "+");
|
|
// skip ',' strlen(parm2)+ ')'
|
|
(*recognizedLen) += strlen(tMEntry.firstMacroParms->next->macroText)+2;
|
|
}
|
|
|
|
curMT = tMEntry.firstMacroParms;
|
|
// in this case only one string was allocated
|
|
free(curMT->macroText);
|
|
for (i=0; i<tMEntry.numParms; i++)
|
|
{
|
|
nextMT = curMT->next;
|
|
free(curMT);
|
|
curMT = nextMT;
|
|
}
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: MacroSubFunction
|
|
// Description: Comes here after macro replacement is done to subtract
|
|
// macro replacement string (ie, register)
|
|
// Parameters: invParms, parameters that macro was invoked with
|
|
// recognizedLen = # characters recoginized so far
|
|
// invStr = invoked replacement string so far
|
|
// Returns: new recognizedLen, invStr, with incremented #
|
|
//=====================================================================
|
|
void MacroSubFunction(char *lookStr, unsigned int *recognizedLen, char **invStr)
|
|
{
|
|
MACROENTRY tMEntry;
|
|
MACROTEXT *curMT;
|
|
MACROTEXT *nextMT;
|
|
unsigned int i;
|
|
|
|
tMEntry.macroName = "%sub()";
|
|
if (ParseBuiltInMacroParms(&tMEntry, lookStr))
|
|
{
|
|
MacroMathFunction(&tMEntry, recognizedLen, invStr, "-");
|
|
// skip ',' strlen(parm2)+ ')'
|
|
(*recognizedLen) += strlen(tMEntry.firstMacroParms->next->macroText)+2;
|
|
}
|
|
curMT = tMEntry.firstMacroParms;
|
|
// in this case only one string was allocated
|
|
free(curMT->macroText);
|
|
for (i=0; i<tMEntry.numParms; i++)
|
|
{
|
|
nextMT = curMT->next;
|
|
free(curMT);
|
|
curMT = nextMT;
|
|
}
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: EndMacroParms
|
|
// Description: Does update and cleanup one end of macro parameters
|
|
// is reached
|
|
// Parameters: .
|
|
// Returns: .
|
|
//=====================================================================
|
|
void EndMacroParms()
|
|
{
|
|
char *curFileName;
|
|
char *macroFileName;
|
|
char tempStr[1024];
|
|
char *macroText;
|
|
|
|
if (gbTempInsideMacro)
|
|
{
|
|
if (gTempParseMacro->numParms != gTempMacro->numParms)
|
|
{
|
|
LexError("Macro invocation number of parameters do not match macro definition, skipping\n");
|
|
BEGIN(INITIAL);
|
|
SAFEFREE(gTempMacro);
|
|
}
|
|
else
|
|
{
|
|
// we got all the parameters for the MACRO invocation, so start inside
|
|
// the macro now, by saving off current state on stack
|
|
gIncludeStack[gIncludeStackIndex].lineNo = yylineno;
|
|
gIncludeStack[gIncludeStackIndex].fileName = gCurFileName;
|
|
// gIncludeStack[gIncludeStackIndex].fileHandle = yyin;
|
|
//fprintf( stderr, "Chris fix this code with myin stuff\n" );
|
|
gIncludeStack[gIncludeStackIndex].prevString = myin;
|
|
gIncludeStack[gIncludeStackIndex].nextString = NULL;
|
|
gIncludeStack[gIncludeStackIndex].lastInvokeMacro = gInvokeMacro;
|
|
gIncludeStack[gIncludeStackIndex].lastParseMacro = gParseMacro;
|
|
gIncludeStack[gIncludeStackIndex].lastMacroLineParse = gMacroLineParse;
|
|
gIncludeStack[gIncludeStackIndex].lastbInsideMacro = gbInsideMacro;
|
|
gIncludeStack[gIncludeStackIndex].lastbInsideInclude = gbInsideInclude;
|
|
gIncludeStack[gIncludeStackIndex].buffer = YY_CURRENT_BUFFER;
|
|
gIncludeStack[gIncludeStackIndex].lastbProcessingIFDEF = gbProcessingIFDEF;
|
|
gIncludeStackIndex++;
|
|
|
|
gParseMacro = gTempParseMacro;
|
|
gInvokeMacro = gTempMacro;
|
|
gbInsideMacro = gbTempInsideMacro;
|
|
|
|
gbTempInsideMacro = false;
|
|
|
|
// yyin = NULL;
|
|
myin = NULL;
|
|
curFileName = gCurFileName;
|
|
if (curFileName == NULL)
|
|
curFileName = "";
|
|
|
|
macroFileName = gParseMacro->fileName;
|
|
if (macroFileName == NULL)
|
|
macroFileName = "";
|
|
|
|
sprintf(tempStr, "%s(%d) : References ->\n%s", curFileName, yylineno, macroFileName);
|
|
gCurFileName = strdup(tempStr);
|
|
gMacroLineParse = gParseMacro->firstMacroLines;
|
|
|
|
macroText = gMacroLine;
|
|
// if no replacement text, just use source line
|
|
if (gParseMacro->firstMacroParms == NULL)
|
|
{
|
|
macroText = gMacroLineParse->macroText;
|
|
}
|
|
else
|
|
{
|
|
// replace the macro parameters
|
|
ReplaceMacroParms(gMacroLineParse->macroText, gMacroLine, gParseMacro, gInvokeMacro);
|
|
}
|
|
|
|
yylineno = gParseMacro->lineNo;
|
|
if (gParseMacro->nLines >= 1)
|
|
{
|
|
strcpy(gSaveLine, macroText);
|
|
}
|
|
|
|
// if (gExpandMacros && (gParseMacro->nLines >= 1))
|
|
// {
|
|
// // in case there is anything there dump it out
|
|
// GenDebugLine();
|
|
// GenListString();
|
|
// if (gInvokeMacro->nLines >= 1)
|
|
// GenSwitchFileNames(macroFileName);
|
|
// }
|
|
|
|
BEGIN(gInvokeState);
|
|
yy_scan_string(macroText);
|
|
gInvokeState = INITIAL;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (gLastMacro != NULL)
|
|
{
|
|
gLastMacro->next = gTempMacro;
|
|
}
|
|
gLastMacro = gTempMacro;
|
|
BEGIN(MACROBODY);
|
|
}
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: FindSwizzleValue
|
|
// Description: see if valid swizzle value and return the bits
|
|
// Parameters: swizzleTex = pointer to characters to analyze
|
|
// Returns: unsigned int = bits for swizzle values, or 0 for error
|
|
//=====================================================================
|
|
unsigned int FindSwizzleValue(char *swizzleText)
|
|
{
|
|
unsigned int swizzleBits;
|
|
unsigned int sLen;
|
|
unsigned int i;
|
|
unsigned int lastMask;
|
|
|
|
sLen = strlen(swizzleText);
|
|
swizzleBits = 0;
|
|
lastMask = 0;
|
|
|
|
for (i=0; i<sLen; i++)
|
|
{
|
|
switch (swizzleText[i])
|
|
{
|
|
case 'x':
|
|
swizzleBits |= (WRITEMASK_X << (4*(3-i)));
|
|
lastMask = WRITEMASK_X;
|
|
break;
|
|
case 'y':
|
|
swizzleBits |= (WRITEMASK_Y << (4*(3-i)));
|
|
lastMask = WRITEMASK_Y;
|
|
break;
|
|
case 'z':
|
|
swizzleBits |= (WRITEMASK_Z << (4*(3-i)));
|
|
lastMask = WRITEMASK_Z;
|
|
break;
|
|
case 'w':
|
|
swizzleBits |= (WRITEMASK_W << (4*(3-i)));
|
|
lastMask = WRITEMASK_W;
|
|
break;
|
|
}
|
|
}
|
|
|
|
for (; i<4; i++)
|
|
{
|
|
swizzleBits |= (lastMask << (4*(3-i)));
|
|
}
|
|
|
|
return swizzleBits;
|
|
}
|
|
|
|
#if 0
|
|
unsigned int FindSwizzleValue(char *swizzleText)
|
|
{
|
|
|
|
DWORD swizzleBits;
|
|
DWORD sLen;
|
|
DWORD i;
|
|
DWORD lastIndex;
|
|
|
|
sLen = strlen(swizzleText);
|
|
swizzleBits = 0;
|
|
lastIndex = 0;
|
|
|
|
for (i=0; i<sLen; i++)
|
|
{
|
|
switch (swizzleText[i])
|
|
{
|
|
case 'x':
|
|
swizzleBits |= (0 << (D3DVS_SWIZZLE_SHIFT + (i * 2)));
|
|
lastIndex = 0;
|
|
break;
|
|
case 'y':
|
|
swizzleBits |= (1 << (D3DVS_SWIZZLE_SHIFT + (i * 2)));
|
|
lastIndex = 1;
|
|
break;
|
|
case 'z':
|
|
swizzleBits |= (2 << (D3DVS_SWIZZLE_SHIFT + (i * 2)));
|
|
lastIndex = 2;
|
|
break;
|
|
case 'w':
|
|
swizzleBits |= (3 << (D3DVS_SWIZZLE_SHIFT + (i * 2)));
|
|
lastIndex = 3;
|
|
break;
|
|
}
|
|
}
|
|
|
|
for (; i<4; i++)
|
|
{
|
|
swizzleBits |= (lastIndex << (D3DVS_SWIZZLE_SHIFT + (i * 2)));
|
|
}
|
|
|
|
return swizzleBits;
|
|
|
|
|
|
}
|
|
#endif
|
|
|
|
//=====================================================================
|
|
// Function: FindRegisterMask
|
|
// Description: Look through register mask strings
|
|
// Parameters: findName = name to lookup
|
|
// Returns: unsigned int with token value
|
|
//=====================================================================
|
|
unsigned int MakeRegisterMask(char *findName)
|
|
{
|
|
|
|
unsigned int regMask;
|
|
char *findFirst;
|
|
|
|
regMask = 0;
|
|
|
|
findFirst = strchr(findName, 'x');
|
|
if (findFirst != NULL)
|
|
{
|
|
if (strchr(findFirst+1, 'x') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
regMask |= WRITEMASK_X;
|
|
}
|
|
|
|
findFirst = strchr(findName, 'y');
|
|
if (findFirst != NULL)
|
|
{
|
|
regMask |= WRITEMASK_Y;
|
|
// invalide write mask, must be swizzle
|
|
if (strchr(findFirst+1, 'x') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if (strchr(findFirst+1, 'y') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
}
|
|
|
|
findFirst = strchr(findName, 'z');
|
|
if (findFirst != NULL)
|
|
{
|
|
regMask |= WRITEMASK_Z;
|
|
if (strchr(findFirst+1, 'x') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if (strchr(findFirst+1, 'y') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if (strchr(findFirst+1, 'z') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
findFirst = strchr(findName, 'w');
|
|
if (findFirst != NULL)
|
|
{
|
|
|
|
regMask |= WRITEMASK_W;
|
|
if (strchr(findFirst+1, 'x') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if (strchr(findFirst+1, 'y') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if (strchr(findFirst+1, 'z') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if (strchr(findFirst+1, 'w') != NULL)
|
|
{
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
return regMask;
|
|
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: LexError
|
|
// Description: output an error to the stdout
|
|
// Parameters: typical printf like format
|
|
// Returns: .
|
|
//=====================================================================
|
|
void LexError(char *format, ...)
|
|
{
|
|
char errstring[4096];
|
|
va_list marker;
|
|
|
|
// fprintf( stderr,"(%d) : Error : ", yylineno);
|
|
if ( gbInsideInclude )
|
|
{
|
|
sprintf( errstring, "%s", gCurFileName );
|
|
sprintf( errstring+strlen(errstring),"(%d) : Error : ", yylineno);
|
|
}
|
|
else
|
|
{
|
|
sprintf( errstring,"(%d) : Error : ", yylineno);
|
|
}
|
|
|
|
va_start(marker, format);
|
|
// vprintf(format, marker);
|
|
vsprintf(errstring+strlen(errstring), format, marker);
|
|
va_end(marker);
|
|
errors.set( errstring );
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: LexWarning
|
|
// Description: output a warning to the stdout
|
|
// Parameters: typical printf like format
|
|
// Returns: .
|
|
//=====================================================================
|
|
void LexWarning(char *format, ...)
|
|
{
|
|
char errstring[4096];
|
|
va_list marker;
|
|
|
|
// fprintf( stderr,"(%d) : warning : ", yylineno);
|
|
if ( gbInsideInclude )
|
|
sprintf( errstring, "%s", gCurFileName );
|
|
sprintf( errstring+strlen(errstring),"(%d) : Warning : ", yylineno);
|
|
// sprintf( errstring,"(%d) : Warning : ", yylineno);
|
|
|
|
va_start(marker, format);
|
|
// vprintf(format, marker);
|
|
vsprintf(errstring+strlen(errstring), format, marker);
|
|
va_end(marker);
|
|
errors.set( errstring );
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: DebugUnhandledState
|
|
// Description: Come here in debug mode, when a state isn't handled
|
|
// for the Lexer
|
|
// Parameters: .
|
|
// Returns: .
|
|
//=====================================================================
|
|
void DebugUnhandledState()
|
|
{
|
|
fprintf( stderr,"Unhandled state reached, with %s text.\n", yytext);
|
|
}
|
|
|
|
//=====================================================================
|
|
// Function: FindOpcode
|
|
// Description: Look through opcodes and see if in the table
|
|
// Parameters: findName = name to lookup
|
|
// Returns: OPCODEMAP * = pointer to opcode map entry, if found
|
|
//=====================================================================
|
|
OPCODEMAP *FindOpcode(char *findName)
|
|
{
|
|
|
|
int i;
|
|
|
|
// just do linear search for now
|
|
for (i=0; i<NUMOPCODES; i++)
|
|
{
|
|
if (!stricmp(theOpcodes[i].string, findName))
|
|
{
|
|
return &theOpcodes[i];
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
char *ReadTextFile(const char * filename)
|
|
{
|
|
char path[3][32] = { ".\0",
|
|
"../../data/programs\0",
|
|
"../../../data/programs\0" };
|
|
char name[8192];
|
|
int i;
|
|
|
|
if (!filename)
|
|
return 0;
|
|
|
|
int found = 0;
|
|
for ( i = 0; i < 3; i++ )
|
|
{
|
|
sprintf( name, "%s/%s", path[i], filename );
|
|
|
|
FILE *fh = fxopen(name, "r");
|
|
|
|
if(!fh)
|
|
{
|
|
fclose(fh);
|
|
found = i+1;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (0 == found)
|
|
{
|
|
fprintf(stderr,"Cannot open \"%s\" for stat read!\n", filename);
|
|
return NULL;
|
|
}
|
|
long size;
|
|
|
|
FILE *fp = 0;
|
|
if (!(fp = fxopen(name, "rb")))
|
|
{
|
|
fprintf(stderr,"Cannot open \"%s\" for read!\n", name);
|
|
return NULL;
|
|
}
|
|
fseek(fp, 0, SEEK_END);
|
|
size = ftell(fp);
|
|
fclose (fp);
|
|
|
|
if (!(fp = fxopen(name, "r")))
|
|
{
|
|
fprintf(stderr,"Cannot open \"%s\" for read!\n", name);
|
|
return NULL;
|
|
}
|
|
|
|
char * buf = new char[size+1];
|
|
|
|
int bytes;
|
|
bytes = fread(buf, 1, size, fp);
|
|
|
|
buf[bytes] = 0;
|
|
|
|
fclose(fp);
|
|
return buf;
|
|
}
|
|
|
|
bool vs10_init_more();
|
|
|
|
bool vs10_init(char* inputString)
|
|
{
|
|
BEGIN(SAVELINE);
|
|
myin = inputString;
|
|
line_incr = 0;
|
|
return vs10_init_more();
|
|
}
|
|
|
|
#ifndef vs10_wrap
|
|
int vs10_wrap(void)
|
|
{
|
|
return(1);
|
|
}
|
|
#endif
|