⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 lex.c_shipped

📁 Linux Kernel 2.6.9 for OMAP1710
💻 C_SHIPPED
📖 第 1 页 / 共 4 页
字号:
#line 2 "scripts/genksyms/lex.c"/* A lexical scanner generated by flex *//* Scanner skeleton version: * $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.91 96/09/10 16:58:48 vern Exp $ */#define FLEX_SCANNER#define YY_FLEX_MAJOR_VERSION 2#define YY_FLEX_MINOR_VERSION 5#include <stdio.h>#include <unistd.h>/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */#ifdef c_plusplus#ifndef __cplusplus#define __cplusplus#endif#endif#ifdef __cplusplus#include <stdlib.h>/* 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 16384typedef 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_RESTORE_YY_MORE_OFFSET \		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 *yy_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 yywrap() 1#define YY_SKIP_YYWRAP#define FLEX_DEBUGtypedef unsigned char YY_CHAR;FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;typedef int yy_state_type;#define FLEX_DEBUGextern char *yytext;#define yytext_ptr yytextstatic 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 13#define YY_END_OF_BUFFER 14static yyconst short int yy_accept[76] =    {   0,        0,    0,    0,    0,   14,   12,    4,    3,   12,    7,       12,   12,    7,   12,   12,   12,   12,   12,    9,    9,       12,   12,   12,    4,    0,    5,    0,    7,    0,    6,        0,    0,    0,    0,    0,    0,    2,    8,   10,   10,        9,    0,    0,    9,    9,    0,    9,    0,    0,   11,        0,    0,    0,   10,    0,   10,    9,    9,    0,    0,        0,    0,    0,    0,    0,   10,   10,    0,    0,    0,        0,    0,    0,    1,    0    } ;static yyconst int yy_ec[256] =    {   0,        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,        4,    4,    4,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    2,    1,    5,    6,    7,    8,    9,   10,    1,        1,    8,   11,    1,   12,   13,    8,   14,   15,   15,       15,   15,   15,   15,   15,   16,   16,    1,    1,   17,       18,   19,    1,    1,   20,   20,   20,   20,   21,   22,        7,    7,    7,    7,    7,   23,    7,    7,    7,    7,        7,    7,    7,    7,   24,    7,    7,   25,    7,    7,        1,   26,    1,    8,    7,    1,   20,   20,   20,   20,       21,   22,    7,    7,    7,    7,    7,   27,    7,    7,        7,    7,    7,    7,    7,    7,   24,    7,    7,   25,        7,    7,    1,   28,    1,    8,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,        1,    1,    1,    1,    1    } ;static yyconst int yy_meta[29] =    {   0,        1,    1,    2,    1,    1,    1,    3,    1,    1,    1,        4,    4,    5,    6,    6,    6,    1,    1,    1,    7,        8,    7,    3,    3,    3,    1,    3,    1    } ;static yyconst short int yy_base[88] =    {   0,        0,  147,   21,  140,  145,  284,   39,  284,   26,    0,       32,  126,   40,   44,  115,   35,   36,   46,   50,   53,       39,   61,   54,   79,   65,  284,    0,    0,   66,  284,        0,  119,   79,   75,  123,  104,  284,  284,  107,    0,       79,   73,   76,   76,   66,    0,    0,   85,   86,  284,      133,   83,   91,  284,   99,  147,  284,  114,  122,   70,      107,  141,  172,  151,  135,  181,  284,  137,  114,  157,      149,   48,   45,  284,  284,  208,  214,  222,  230,  238,      246,  250,  255,  256,  261,  267,  275    } ;static yyconst short int yy_def[88] =    {   0,       75,    1,    1,    3,   75,   75,   75,   75,   76,   77,       78,   75,   77,   79,   75,   75,   75,   75,   75,   19,       75,   75,   75,   75,   76,   75,   80,   77,   78,   75,       81,   75,   76,   78,   79,   79,   75,   75,   75,   39,       19,   82,   83,   75,   75,   84,   20,   76,   78,   75,       79,   51,   85,   75,   75,   75,   75,   84,   79,   51,       79,   79,   79,   51,   75,   75,   75,   86,   79,   63,       86,   87,   87,   75,    0,   75,   75,   75,   75,   75,       75,   75,   75,   75,   75,   75,   75    } ;static yyconst short int yy_nxt[313] =    {   0,        6,    7,    8,    7,    9,    6,   10,    6,    6,   11,        6,    6,   12,    6,    6,    6,    6,    6,    6,   10,       10,   10,   13,   10,   10,    6,   10,    6,   15,   16,       26,   15,   17,   18,   19,   20,   20,   21,   15,   22,       24,   30,   24,   38,   33,   36,   37,   74,   23,   34,       74,   27,   38,   38,   38,   38,   38,   31,   32,   39,       39,   39,   40,   41,   41,   42,   47,   47,   47,   26,       43,   38,   44,   45,   46,   30,   44,   75,   38,   38,       24,   38,   24,   26,   30,   40,   55,   55,   57,   26,       27,   31,   57,   43,   35,   30,   64,   64,   64,   57,       31,   65,   65,   75,   27,   36,   37,   35,   59,   37,       27,   31,   56,   56,   56,   59,   37,   51,   52,   52,       39,   39,   39,   59,   37,   37,   68,   53,   54,   54,       69,   50,   38,   54,   59,   37,   44,   45,   32,   37,       44,   35,   59,   37,   75,   14,   60,   60,   66,   66,       66,   37,   14,   72,   75,   61,   62,   63,   59,   61,       56,   56,   56,   69,   64,   64,   64,   69,   67,   67,       75,   75,   75,   67,   37,   35,   75,   75,   75,   61,       62,   75,   75,   61,   75,   70,   70,   70,   75,   75,       75,   70,   70,   70,   66,   66,   66,   75,   75,   75,       75,   75,   54,   54,   75,   75,   75,   54,   25,   25,       25,   25,   25,   25,   25,   25,   28,   75,   75,   28,       28,   28,   29,   29,   29,   29,   29,   29,   29,   29,       35,   35,   35,   35,   35,   35,   35,   35,   48,   75,       48,   48,   48,   48,   48,   48,   49,   75,   49,   49,       49,   49,   49,   49,   42,   42,   75,   42,   56,   75,       56,   58,   58,   58,   66,   75,   66,   71,   71,   71,       71,   71,   71,   71,   71,   73,   73,   73,   73,   73,       73,   73,   73,    5,   75,   75,   75,   75,   75,   75,       75,   75,   75,   75,   75,   75,   75,   75,   75,   75,       75,   75,   75,   75,   75,   75,   75,   75,   75,   75,       75,   75    } ;static yyconst short int yy_chk[313] =    {   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,    3,    3,        9,    3,    3,    3,    3,    3,    3,    3,    3,    3,        7,   11,    7,   16,   13,   14,   14,   73,    3,   13,       72,    9,   16,   17,   17,   21,   21,   11,   18,   18,       18,   18,   19,   19,   19,   19,   20,   20,   20,   25,       19,   23,   19,   19,   19,   29,   19,   20,   22,   22,       24,   23,   24,   33,   34,   42,   43,   43,   45,   48,       25,   29,   45,   42,   60,   49,   52,   52,   52,   44,       34,   53,   53,   41,   33,   36,   36,   52,   61,   61,       48,   49,   55,   55,   55,   69,   69,   36,   36,   36,       39,   39,   39,   59,   59,   35,   59,   39,   39,   39,       61,   32,   15,   39,   51,   51,   58,   58,   12,   68,       58,   68,   62,   62,    5,    4,   51,   51,   65,   65,       65,   71,    2,   71,    0,   51,   51,   51,   70,   51,       56,   56,   56,   62,   64,   64,   64,   62,   56,   56,        0,    0,    0,   56,   63,   64,    0,    0,    0,   70,       70,    0,    0,   70,    0,   63,   63,   63,    0,    0,        0,   63,   63,   63,   66,   66,   66,    0,    0,    0,        0,    0,   66,   66,    0,    0,    0,   66,   76,   76,       76,   76,   76,   76,   76,   76,   77,    0,    0,   77,       77,   77,   78,   78,   78,   78,   78,   78,   78,   78,       79,   79,   79,   79,   79,   79,   79,   79,   80,    0,       80,   80,   80,   80,   80,   80,   81,    0,   81,   81,       81,   81,   81,   81,   82,   82,    0,   82,   83,    0,       83,   84,   84,   84,   85,    0,   85,   86,   86,   86,       86,   86,   86,   86,   86,   87,   87,   87,   87,   87,       87,   87,   87,   75,   75,   75,   75,   75,   75,   75,       75,   75,   75,   75,   75,   75,   75,   75,   75,   75,       75,   75,   75,   75,   75,   75,   75,   75,   75,   75,       75,   75    } ;static yy_state_type yy_last_accepting_state;static char *yy_last_accepting_cpos;extern int yy_flex_debug;int yy_flex_debug = 1;static yyconst short int yy_rule_linenum[13] =    {   0,       69,   70,   71,   74,   77,   78,   79,   85,   86,   87,       89,   92    } ;/* The intent behind this definition is that it'll catch * any uses of REJECT which flex missed. */#define REJECT reject_used_but_not_detected#define yymore() yymore_used_but_not_detected#define YY_MORE_ADJ 0#define YY_RESTORE_YY_MORE_OFFSETchar *yytext;#line 1 "scripts/genksyms/lex.l"#define INITIAL 0/* Lexical analysis for genksyms.   Copyright 1996, 1997 Linux International.   New implementation contributed by Richard Henderson <rth@tamu.edu>   Based on original work by Bjorn Ekwall <bj0rn@blox.se>   Taken from Linux modutils 2.4.22.   This program is free software; you can redistribute it and/or modify it   under the terms of the GNU General Public License as published by the   Free Software Foundation; either version 2 of the License, or (at your   option) any later version.   This program is distributed in the hope that it will be useful, but   WITHOUT ANY WARRANTY; without even the implied warranty of   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU   General Public License for more details.   You should have received a copy of the GNU General Public License   along with this program; if not, write to the Free Software Foundation,   Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */#line 25 "scripts/genksyms/lex.l"#include <limits.h>#include <stdlib.h>#include <string.h>#include <ctype.h>#include "genksyms.h"#include "parse.h"/* We've got a two-level lexer here.  We let flex do basic tokenization   and then we categorize those basic tokens in the second stage.  */#define YY_DECL		static int yylex1(void)/* Version 2 checksumming does proper tokenization; version 1 wasn't   quite so pedantic.  */#define V2_TOKENS 1/* We don't do multiple input files.  */#line 513 "scripts/genksyms/lex.c"/* Macros after this point can all be overridden by user definitions in * section 1. */#ifndef YY_SKIP_YYWRAP#ifdef __cplusplusextern "C" int yywrap YY_PROTO(( void ));#elseextern int yywrap YY_PROTO(( void ));

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -