SuperCollider-3.6.3-Source-linux~repack/ 0000775 0001750 0001750 00000000000 12110505246 016342 5 ustar dan dan SuperCollider-3.6.3-Source-linux~repack/SCDoc/ 0000775 0001750 0001750 00000000000 12110505246 017275 5 ustar dan dan SuperCollider-3.6.3-Source-linux~repack/SCDoc/SCDoc.tab.hpp 0000664 0001750 0001750 00000007032 12057624166 021525 0 ustar dan dan /* A Bison parser, made by GNU Bison 2.5. */
/* Bison interface for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see . */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
END = 0,
CLASS = 258,
TITLE = 259,
SUMMARY = 260,
RELATED = 261,
CATEGORIES = 262,
REDIRECT = 263,
CLASSTREE = 264,
COPYMETHOD = 265,
KEYWORD = 266,
PRIVATE = 267,
SECTION = 268,
SUBSECTION = 269,
METHOD = 270,
ARGUMENT = 271,
DESCRIPTION = 272,
CLASSMETHODS = 273,
INSTANCEMETHODS = 274,
EXAMPLES = 275,
RETURNS = 276,
DISCUSSION = 277,
LIST = 278,
TREE = 279,
NUMBEREDLIST = 280,
DEFINITIONLIST = 281,
TABLE = 282,
FOOTNOTE = 283,
NOTE = 284,
WARNING = 285,
CODE = 286,
LINK = 287,
ANCHOR = 288,
SOFT = 289,
IMAGE = 290,
TELETYPE = 291,
MATH = 292,
STRONG = 293,
EMPHASIS = 294,
CODEBLOCK = 295,
TELETYPEBLOCK = 296,
MATHBLOCK = 297,
TAGSYM = 298,
BARS = 299,
HASHES = 300,
TEXT = 301,
URL = 302,
COMMA = 303,
METHODNAME = 304,
METHODARGS = 305,
NEWLINE = 306,
EMPTYLINES = 307,
BAD_METHODNAME = 308,
START_FULL = 309,
START_PARTIAL = 310,
START_METADATA = 311
};
#endif
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE
{
/* Line 2068 of yacc.c */
#line 55 "SCDoc.y"
int i;
const char *id;
char *str;
DocNode *doc_node;
/* Line 2068 of yacc.c */
#line 116 "SCDoc.tab.hpp"
} YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
#endif
extern YYSTYPE scdoclval;
#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
typedef struct YYLTYPE
{
int first_line;
int first_column;
int last_line;
int last_column;
} YYLTYPE;
# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
# define YYLTYPE_IS_DECLARED 1
# define YYLTYPE_IS_TRIVIAL 1
#endif
extern YYLTYPE scdoclloc;
SuperCollider-3.6.3-Source-linux~repack/SCDoc/build_parser.sh 0000775 0001750 0001750 00000000272 11743774635 022335 0 ustar dan dan #!/bin/sh
flex -P scdoc -o lex.scdoc.cpp SCDoc.l &&
bison -p scdoc --defines -o SCDoc.tab.cpp SCDoc.y
#g++ -g -O3 -o scdoc_parse_dump lex.scdoc.cpp SCDoc.tab.cpp SCDoc.cpp main.cpp -ll
SuperCollider-3.6.3-Source-linux~repack/SCDoc/SCDoc.tab.cpp 0000664 0001750 0001750 00000275560 12106676016 021531 0 ustar dan dan /* A Bison parser, made by GNU Bison 2.5. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
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, see . */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "2.5"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* Using locations. */
#define YYLSP_NEEDED 1
/* Substitute the variable and function names. */
#define yyparse scdocparse
#define yylex scdoclex
#define yyerror scdocerror
#define yylval scdoclval
#define yychar scdocchar
#define yydebug scdocdebug
#define yynerrs scdocnerrs
#define yylloc scdoclloc
/* Copy the first part of user declarations. */
/* Line 268 of yacc.c */
#line 1 "SCDoc.y"
/************************************************************************
*
* Copyright 2012 Jonatan Liljedahl
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*
************************************************************************/
#include
#include
#include
#include "SCDoc.h"
//#define YYLEX_PARAM &yylval, &yylloc
int scdocparse();
extern int scdoclineno;
extern char *scdoctext;
extern int scdoc_start_token;
extern FILE *scdocin;
//extern struct YYLTYPE scdoclloc;
//int scdoc_metadata_mode;
static const char * method_type = NULL;
static DocNode * topnode;
void scdocerror(const char *str);
extern void error(const char *fmt, ...);
extern void post(const char *fmt, ...);
static inline bool stringEqual(const char * a, const char * b)
{
return strcmp(a, b) == 0;
}
/* Line 268 of yacc.c */
#line 133 "SCDoc.tab.cpp"
/* Enabling traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 1
#endif
/* Enabling the token table. */
#ifndef YYTOKEN_TABLE
# define YYTOKEN_TABLE 0
#endif
/* Tokens. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
/* Put the tokens into the symbol table, so that GDB and other debuggers
know about them. */
enum yytokentype {
END = 0,
CLASS = 258,
TITLE = 259,
SUMMARY = 260,
RELATED = 261,
CATEGORIES = 262,
REDIRECT = 263,
CLASSTREE = 264,
COPYMETHOD = 265,
KEYWORD = 266,
PRIVATE = 267,
SECTION = 268,
SUBSECTION = 269,
METHOD = 270,
ARGUMENT = 271,
DESCRIPTION = 272,
CLASSMETHODS = 273,
INSTANCEMETHODS = 274,
EXAMPLES = 275,
RETURNS = 276,
DISCUSSION = 277,
LIST = 278,
TREE = 279,
NUMBEREDLIST = 280,
DEFINITIONLIST = 281,
TABLE = 282,
FOOTNOTE = 283,
NOTE = 284,
WARNING = 285,
CODE = 286,
LINK = 287,
ANCHOR = 288,
SOFT = 289,
IMAGE = 290,
TELETYPE = 291,
MATH = 292,
STRONG = 293,
EMPHASIS = 294,
CODEBLOCK = 295,
TELETYPEBLOCK = 296,
MATHBLOCK = 297,
TAGSYM = 298,
BARS = 299,
HASHES = 300,
TEXT = 301,
URL = 302,
COMMA = 303,
METHODNAME = 304,
METHODARGS = 305,
NEWLINE = 306,
EMPTYLINES = 307,
BAD_METHODNAME = 308,
START_FULL = 309,
START_PARTIAL = 310,
START_METADATA = 311
};
#endif
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE
{
/* Line 293 of yacc.c */
#line 55 "SCDoc.y"
int i;
const char *id;
char *str;
DocNode *doc_node;
/* Line 293 of yacc.c */
#line 235 "SCDoc.tab.cpp"
} YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
# define YYSTYPE_IS_DECLARED 1
#endif
#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
typedef struct YYLTYPE
{
int first_line;
int first_column;
int last_line;
int last_column;
} YYLTYPE;
# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
# define YYLTYPE_IS_DECLARED 1
# define YYLTYPE_IS_TRIVIAL 1
#endif
/* Copy the second part of user declarations. */
/* Line 343 of yacc.c */
#line 100 "SCDoc.y"
//int scdoclex (YYSTYPE * yylval_param, struct YYLTYPE * yylloc_param );
int scdoclex (void);
/* Line 343 of yacc.c */
#line 266 "SCDoc.tab.cpp"
#ifdef short
# undef short
#endif
#ifdef YYTYPE_UINT8
typedef YYTYPE_UINT8 yytype_uint8;
#else
typedef unsigned char yytype_uint8;
#endif
#ifdef YYTYPE_INT8
typedef YYTYPE_INT8 yytype_int8;
#elif (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
typedef signed char yytype_int8;
#else
typedef short int yytype_int8;
#endif
#ifdef YYTYPE_UINT16
typedef YYTYPE_UINT16 yytype_uint16;
#else
typedef unsigned short int yytype_uint16;
#endif
#ifdef YYTYPE_INT16
typedef YYTYPE_INT16 yytype_int16;
#else
typedef short int yytype_int16;
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned int
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
# if ENABLE_NLS
# include /* INFRINGES ON USER NAME SPACE */
# define YY_(msgid) dgettext ("bison-runtime", msgid)
# endif
# endif
# ifndef YY_
# define YY_(msgid) msgid
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(e) ((void) (e))
#else
# define YYUSE(e) /* empty */
#endif
/* Identity function, used to suppress warnings about constant conditions. */
#ifndef lint
# define YYID(n) (n)
#else
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static int
YYID (int yyi)
#else
static int
YYID (yyi)
int yyi;
#endif
{
return yyi;
}
#endif
#if ! defined yyoverflow || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
# include /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's `empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \
&& defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss_alloc;
YYSTYPE yyvs_alloc;
YYLTYPE yyls_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+ 2 * YYSTACK_GAP_MAXIMUM)
# define YYCOPY_NEEDED 1
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (YYID (0))
#endif
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(To, From, Count) \
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
# else
# define YYCOPY(To, From, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(To)[yyi] = (From)[yyi]; \
} \
while (YYID (0))
# endif
# endif
#endif /* !YYCOPY_NEEDED */
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 70
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 434
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 57
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 55
/* YYNRULES -- Number of rules. */
#define YYNRULES 134
/* YYNRULES -- Number of states. */
#define YYNSTATES 193
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 311
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
static const yytype_uint8 yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
55, 56
};
#if YYDEBUG
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
YYRHS. */
static const yytype_uint16 yyprhs[] =
{
0, 0, 3, 5, 8, 13, 16, 20, 22, 23,
26, 28, 32, 36, 40, 42, 44, 46, 48, 50,
52, 54, 56, 58, 59, 62, 64, 66, 67, 73,
76, 78, 79, 82, 84, 86, 91, 93, 94, 97,
99, 101, 107, 111, 115, 116, 118, 120, 124, 126,
131, 133, 134, 136, 137, 140, 142, 147, 151, 154,
155, 158, 159, 161, 163, 166, 169, 171, 174, 176,
180, 184, 188, 192, 196, 200, 204, 206, 210, 213,
215, 217, 219, 223, 227, 229, 231, 233, 235, 237,
239, 241, 243, 245, 247, 249, 251, 253, 255, 257,
259, 261, 265, 268, 271, 274, 276, 280, 282, 286,
289, 293, 296, 298, 300, 302, 304, 306, 309, 311,
314, 316, 318, 320, 322, 324, 326, 328, 331, 333,
336, 339, 341, 343, 347
};
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
static const yytype_int8 yyrhs[] =
{
58, 0, -1, 59, -1, 59, 1, -1, 54, 60,
61, 65, -1, 55, 66, -1, 56, 61, 65, -1,
106, -1, -1, 61, 62, -1, 62, -1, 63, 105,
106, -1, 7, 111, 106, -1, 6, 111, 106, -1,
3, -1, 4, -1, 5, -1, 8, -1, 18, -1,
19, -1, 17, -1, 20, -1, 66, -1, -1, 66,
67, -1, 67, -1, 73, -1, -1, 13, 68, 105,
106, 69, -1, 64, 69, -1, 70, -1, -1, 70,
71, -1, 71, -1, 73, -1, 14, 105, 106, 72,
-1, 73, -1, -1, 73, 74, -1, 74, -1, 85,
-1, 15, 77, 75, 106, 78, -1, 10, 104, 106,
-1, 12, 111, 107, -1, -1, 50, -1, 49, -1,
77, 48, 76, -1, 76, -1, 79, 80, 83, 84,
-1, 85, -1, -1, 81, -1, -1, 81, 82, -1,
82, -1, 16, 104, 106, 79, -1, 16, 106, 85,
-1, 21, 85, -1, -1, 22, 85, -1, -1, 86,
-1, 87, -1, 87, 88, -1, 86, 88, -1, 88,
-1, 86, 89, -1, 89, -1, 94, 85, 43, -1,
93, 95, 43, -1, 27, 97, 43, -1, 26, 101,
43, -1, 92, 109, 43, -1, 9, 104, 107, -1,
11, 111, 107, -1, 52, -1, 35, 105, 43, -1,
89, 90, -1, 90, -1, 103, -1, 47, -1, 91,
104, 43, -1, 28, 85, 43, -1, 51, -1, 32,
-1, 38, -1, 34, -1, 39, -1, 31, -1, 36,
-1, 37, -1, 33, -1, 40, -1, 41, -1, 42,
-1, 23, -1, 24, -1, 25, -1, 30, -1, 29,
-1, 95, 45, 85, -1, 45, 85, -1, 45, 98,
-1, 97, 96, -1, 96, -1, 98, 44, 79, -1,
79, -1, 99, 45, 85, -1, 45, 85, -1, 99,
44, 79, -1, 101, 100, -1, 100, -1, 103, -1,
47, -1, 46, -1, 48, -1, 104, 103, -1, 103,
-1, 105, 102, -1, 102, -1, 51, -1, 52, -1,
106, -1, 0, -1, 103, -1, 106, -1, 109, 108,
-1, 108, -1, 110, 46, -1, 110, 47, -1, 46,
-1, 47, -1, 111, 48, 110, -1, 110, -1
};
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 107, 107, 108, 111, 117, 121, 129, 130, 133,
134, 137, 138, 139, 142, 143, 144, 145, 148, 149,
150, 151, 154, 155, 158, 159, 160, 163, 163, 164,
167, 168, 171, 172, 173, 176, 179, 180, 183, 184,
185, 188, 195, 201, 206, 207, 218, 229, 230, 233,
242, 243, 246, 247, 250, 251, 254, 255, 258, 259,
262, 263, 271, 272, 275, 276, 277, 280, 281, 284,
285, 286, 287, 288, 289, 290, 293, 294, 297, 298,
301, 302, 303, 304, 305, 308, 309, 310, 311, 312,
313, 314, 315, 318, 319, 320, 323, 324, 325, 328,
329, 332, 333, 336, 339, 340, 343, 344, 347, 348,
351, 358, 359, 362, 363, 366, 367, 370, 371, 374,
375, 378, 379, 382, 383, 386, 387, 390, 391, 394,
395, 396, 397, 400, 401
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"\"end of file\"", "error", "$undefined", "CLASS", "TITLE", "SUMMARY",
"RELATED", "CATEGORIES", "REDIRECT", "CLASSTREE", "COPYMETHOD",
"KEYWORD", "PRIVATE", "SECTION", "SUBSECTION", "METHOD", "ARGUMENT",
"DESCRIPTION", "CLASSMETHODS", "INSTANCEMETHODS", "EXAMPLES", "RETURNS",
"DISCUSSION", "LIST", "TREE", "NUMBEREDLIST", "DEFINITIONLIST", "TABLE",
"FOOTNOTE", "NOTE", "WARNING", "CODE", "LINK", "ANCHOR", "SOFT", "IMAGE",
"TELETYPE", "MATH", "STRONG", "EMPHASIS", "\"CODE block\"",
"\"TELETYPE block\"", "\"MATH block\"", "\"::\"", "\"||\"", "\"##\"",
"\"text\"", "URL", "COMMA", "\"method name\"", "\"arguments string\"",
"\"newline\"", "\"empty lines\"", "\"bad method name\"", "START_FULL",
"START_PARTIAL", "START_METADATA", "$accept", "start", "document",
"eateol", "dochead", "headline", "headtag", "sectiontag", "optsections",
"sections", "section", "$@1", "optsubsections", "subsections",
"subsection", "optsubsubsections", "subsubsections", "subsubsection",
"optMETHODARGS", "methodname", "methnames", "methodbody", "optbody",
"optargs", "args", "arg", "optreturns", "optdiscussion", "body",
"blockA", "blockB", "bodyelem", "prose", "proseelem", "inlinetag",
"blocktag", "listtag", "rangetag", "listbody", "tablerow", "tablebody",
"tablecells", "defterms", "deflistrow", "deflistbody", "anywordurl",
"anyword", "words", "words2", "eol", "eoleof", "anywordnl", "wordsnl",
"nocommawords", "commalist", 0
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
token YYLEX-NUM. */
static const yytype_uint16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
305, 306, 307, 308, 309, 310, 311
};
# endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 57, 58, 58, 59, 59, 59, 60, 60, 61,
61, 62, 62, 62, 63, 63, 63, 63, 64, 64,
64, 64, 65, 65, 66, 66, 66, 68, 67, 67,
69, 69, 70, 70, 70, 71, 72, 72, 73, 73,
73, 74, 74, 74, 75, 75, 76, 77, 77, 78,
79, 79, 80, 80, 81, 81, 82, 82, 83, 83,
84, 84, 85, 85, 86, 86, 86, 87, 87, 88,
88, 88, 88, 88, 88, 88, 88, 88, 89, 89,
90, 90, 90, 90, 90, 91, 91, 91, 91, 91,
91, 91, 91, 92, 92, 92, 93, 93, 93, 94,
94, 95, 95, 96, 97, 97, 98, 98, 99, 99,
100, 101, 101, 102, 102, 103, 103, 104, 104, 105,
105, 106, 106, 107, 107, 108, 108, 109, 109, 110,
110, 110, 110, 111, 111
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 1, 2, 4, 2, 3, 1, 0, 2,
1, 3, 3, 3, 1, 1, 1, 1, 1, 1,
1, 1, 1, 0, 2, 1, 1, 0, 5, 2,
1, 0, 2, 1, 1, 4, 1, 0, 2, 1,
1, 5, 3, 3, 0, 1, 1, 3, 1, 4,
1, 0, 1, 0, 2, 1, 4, 3, 2, 0,
2, 0, 1, 1, 2, 2, 1, 2, 1, 3,
3, 3, 3, 3, 3, 3, 1, 3, 2, 1,
1, 1, 3, 3, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 3, 2, 2, 2, 1, 3, 1, 3, 2,
3, 2, 1, 1, 1, 1, 1, 2, 1, 2,
1, 1, 1, 1, 1, 1, 1, 2, 1, 2,
2, 1, 1, 3, 1
};
/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM.
Performed when YYTABLE doesn't specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
0, 8, 0, 0, 0, 0, 121, 122, 0, 7,
0, 0, 0, 0, 27, 0, 20, 18, 19, 21,
96, 97, 98, 0, 0, 0, 100, 99, 89, 85,
92, 87, 0, 90, 91, 86, 88, 93, 94, 95,
115, 81, 116, 84, 76, 31, 5, 25, 26, 39,
40, 62, 63, 66, 68, 79, 0, 0, 0, 0,
80, 14, 15, 16, 0, 0, 17, 23, 10, 0,
1, 3, 23, 118, 0, 0, 131, 132, 134, 0,
0, 0, 46, 48, 44, 0, 0, 112, 0, 51,
105, 0, 0, 114, 120, 113, 0, 0, 29, 30,
33, 34, 24, 38, 65, 67, 64, 78, 0, 125,
126, 128, 0, 0, 0, 0, 0, 0, 9, 6,
22, 0, 4, 124, 117, 123, 74, 42, 129, 130,
0, 75, 43, 0, 0, 45, 0, 109, 51, 0,
72, 111, 107, 50, 103, 71, 104, 83, 77, 119,
0, 32, 82, 73, 127, 102, 70, 0, 69, 13,
12, 11, 133, 31, 47, 51, 110, 108, 51, 37,
101, 28, 41, 53, 106, 35, 36, 0, 59, 52,
55, 0, 0, 0, 61, 54, 51, 57, 58, 0,
49, 56, 60
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 4, 5, 8, 67, 68, 69, 45, 119, 120,
47, 81, 98, 99, 100, 175, 48, 49, 136, 83,
84, 172, 142, 178, 179, 180, 184, 190, 50, 51,
52, 53, 54, 55, 56, 57, 58, 59, 114, 90,
91, 144, 86, 87, 88, 94, 60, 74, 96, 125,
126, 111, 112, 78, 79
};
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
#define YYPACT_NINF -125
static const yytype_int16 yypact[] =
{
-4, 78, 226, 150, 19, 139, -125, -125, 150, -125,
-35, -35, 100, 100, -125, -21, -125, -125, -125, -125,
-125, -125, -125, -10, -6, 348, -125, -125, -125, -125,
-125, -125, 54, -125, -125, -125, -125, -125, -125, -125,
-125, -125, -125, -125, -125, 270, 125, -125, 30, -125,
-125, 348, 382, -125, 58, -125, -35, 25, -2, 348,
-125, -125, -125, -125, 100, 100, -125, 182, -125, 54,
-125, -125, 182, -125, 7, 25, -125, -125, 104, 16,
16, 54, -125, -125, -23, 348, 117, -125, 74, 348,
-125, 80, 32, -125, -125, -125, 35, 54, -125, 71,
-125, 30, -125, -125, -125, 58, -125, -125, -31, -125,
-125, -125, -22, 348, 83, 64, 62, 62, -125, -125,
125, -15, -125, -125, -125, -125, -125, -125, -125, -125,
100, -125, -125, -15, -21, -125, 78, -125, 348, 348,
-125, -125, -125, -125, 93, -125, -125, -125, -125, -125,
-15, -125, -125, -125, -125, -125, -125, 348, -125, -125,
-125, -125, 104, 270, -125, 348, -125, -125, 348, 314,
-125, -125, -125, 102, -125, -125, 30, 25, 101, 102,
-125, 25, 348, 348, 109, -125, 348, -125, -125, 348,
-125, -125, -125
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-125, -125, -125, -125, 140, 26, -125, -125, 97, 157,
-41, -125, 8, -125, 75, -125, -42, -40, -125, 39,
-125, -125, -124, -125, -125, 0, -125, -125, -5, -125,
-125, 113, 124, -48, -125, -125, -125, -125, -125, 91,
-125, -125, -125, 95, -125, -87, -9, -7, -59, -1,
87, 84, -125, 68, 5
};
/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule which
number is the opposite. If YYTABLE_NINF, syntax error. */
#define YYTABLE_NINF -3
static const yytype_int16 yytable[] =
{
9, 73, 73, 101, 75, 102, 107, 123, 103, 149,
121, 40, 152, 42, 166, 40, 123, 42, 80, 70,
92, 153, 133, 95, 40, 134, 42, 135, 82, 6,
7, 40, 93, 42, 149, 85, 6, 7, 150, 89,
11, 173, 13, 113, 174, 15, 149, 73, 109, 108,
1, 2, 3, 40, 115, 42, 110, 107, 6, 7,
95, 103, 191, 149, 130, 124, 124, 6, 7, 116,
117, 40, 95, 42, 127, 147, 6, 7, 148, 102,
137, 40, 93, 42, 143, 97, 25, 95, 95, 28,
29, 30, 31, 118, 33, 34, 35, 36, 118, 124,
40, 93, 42, 109, 40, 41, 42, 158, 155, 43,
130, 110, 95, 6, 7, 159, 160, 140, 177, 85,
161, 101, 183, 145, 95, 89, 156, 176, 157, 6,
7, 189, 163, 143, 167, 165, 103, 168, 14, -2,
71, 95, 16, 17, 18, 19, 76, 77, 72, 169,
128, 129, 170, 61, 62, 63, 64, 65, 66, 46,
143, 138, 139, 143, 104, 106, 131, 132, 73, 122,
181, 171, 124, 164, 151, 105, 182, 187, 188, 185,
186, 143, 146, 141, 192, 61, 62, 63, 64, 65,
66, 10, 11, 12, 13, 14, 154, 15, 162, 16,
17, 18, 19, 0, 0, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 0, 0, 0, 40, 41,
42, 0, 0, 43, 44, 10, 11, 12, 13, 14,
0, 15, 0, 16, 17, 18, 19, 0, 0, 20,
21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
31, 32, 33, 34, 35, 36, 37, 38, 39, 0,
0, 0, 40, 41, 42, 0, 0, 43, 44, 10,
11, 12, 13, 0, 97, 15, 0, 0, 0, 0,
0, 0, 0, 20, 21, 22, 23, 24, 25, 26,
27, 28, 29, 30, 31, 32, 33, 34, 35, 36,
37, 38, 39, 0, 0, 0, 40, 41, 42, 0,
0, 43, 44, 10, 11, 12, 13, 0, 0, 15,
0, 0, 0, 0, 0, 0, 0, 20, 21, 22,
23, 24, 25, 26, 27, 28, 29, 30, 31, 32,
33, 34, 35, 36, 37, 38, 39, 10, 0, 12,
40, 41, 42, 0, 0, 43, 44, 0, 0, 0,
0, 20, 21, 22, 23, 24, 25, 26, 27, 28,
29, 30, 31, 32, 33, 34, 35, 36, 37, 38,
39, 10, 0, 12, 40, 41, 42, 0, 0, 43,
44, 0, 0, 0, 0, 20, 21, 22, 23, 24,
0, 26, 27, 0, 0, 0, 0, 32, 0, 0,
0, 0, 37, 38, 39, 0, 0, 0, 0, 0,
0, 0, 0, 0, 44
};
#define yypact_value_is_default(yystate) \
((yystate) == (-125))
#define yytable_value_is_error(yytable_value) \
YYID (0)
static const yytype_int16 yycheck[] =
{
1, 10, 11, 45, 11, 46, 54, 0, 48, 96,
69, 46, 43, 48, 138, 46, 0, 48, 13, 0,
25, 43, 81, 32, 46, 48, 48, 50, 49, 51,
52, 46, 47, 48, 121, 45, 51, 52, 97, 45,
10, 165, 12, 45, 168, 15, 133, 56, 57, 56,
54, 55, 56, 46, 59, 48, 57, 105, 51, 52,
69, 101, 186, 150, 48, 74, 75, 51, 52, 64,
65, 46, 81, 48, 75, 43, 51, 52, 43, 120,
85, 46, 47, 48, 89, 14, 28, 96, 97, 31,
32, 33, 34, 67, 36, 37, 38, 39, 72, 108,
46, 47, 48, 112, 46, 47, 48, 43, 113, 51,
48, 112, 121, 51, 52, 116, 117, 43, 16, 45,
121, 163, 21, 43, 133, 45, 43, 169, 45, 51,
52, 22, 133, 138, 139, 136, 176, 44, 13, 0,
1, 150, 17, 18, 19, 20, 46, 47, 8, 150,
46, 47, 157, 3, 4, 5, 6, 7, 8, 2,
165, 44, 45, 168, 51, 52, 79, 80, 177, 72,
177, 163, 181, 134, 99, 51, 177, 182, 183, 179,
181, 186, 91, 88, 189, 3, 4, 5, 6, 7,
8, 9, 10, 11, 12, 13, 112, 15, 130, 17,
18, 19, 20, -1, -1, 23, 24, 25, 26, 27,
28, 29, 30, 31, 32, 33, 34, 35, 36, 37,
38, 39, 40, 41, 42, -1, -1, -1, 46, 47,
48, -1, -1, 51, 52, 9, 10, 11, 12, 13,
-1, 15, -1, 17, 18, 19, 20, -1, -1, 23,
24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, 42, -1,
-1, -1, 46, 47, 48, -1, -1, 51, 52, 9,
10, 11, 12, -1, 14, 15, -1, -1, -1, -1,
-1, -1, -1, 23, 24, 25, 26, 27, 28, 29,
30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
40, 41, 42, -1, -1, -1, 46, 47, 48, -1,
-1, 51, 52, 9, 10, 11, 12, -1, -1, 15,
-1, -1, -1, -1, -1, -1, -1, 23, 24, 25,
26, 27, 28, 29, 30, 31, 32, 33, 34, 35,
36, 37, 38, 39, 40, 41, 42, 9, -1, 11,
46, 47, 48, -1, -1, 51, 52, -1, -1, -1,
-1, 23, 24, 25, 26, 27, 28, 29, 30, 31,
32, 33, 34, 35, 36, 37, 38, 39, 40, 41,
42, 9, -1, 11, 46, 47, 48, -1, -1, 51,
52, -1, -1, -1, -1, 23, 24, 25, 26, 27,
-1, 29, 30, -1, -1, -1, -1, 35, -1, -1,
-1, -1, 40, 41, 42, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 52
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 54, 55, 56, 58, 59, 51, 52, 60, 106,
9, 10, 11, 12, 13, 15, 17, 18, 19, 20,
23, 24, 25, 26, 27, 28, 29, 30, 31, 32,
33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
46, 47, 48, 51, 52, 64, 66, 67, 73, 74,
85, 86, 87, 88, 89, 90, 91, 92, 93, 94,
103, 3, 4, 5, 6, 7, 8, 61, 62, 63,
0, 1, 61, 103, 104, 104, 46, 47, 110, 111,
111, 68, 49, 76, 77, 45, 99, 100, 101, 45,
96, 97, 85, 47, 102, 103, 105, 14, 69, 70,
71, 73, 67, 74, 88, 89, 88, 90, 104, 103,
106, 108, 109, 45, 95, 85, 111, 111, 62, 65,
66, 105, 65, 0, 103, 106, 107, 106, 46, 47,
48, 107, 107, 105, 48, 50, 75, 85, 44, 45,
43, 100, 79, 85, 98, 43, 96, 43, 43, 102,
105, 71, 43, 43, 108, 85, 43, 45, 43, 106,
106, 106, 110, 106, 76, 106, 79, 85, 44, 106,
85, 69, 78, 79, 79, 72, 73, 16, 80, 81,
82, 104, 106, 21, 83, 82, 106, 85, 85, 22,
84, 79, 85
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
/* Like YYERROR except do call yyerror. This remains here temporarily
to ease the transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. However,
YYFAIL appears to be in use. Nevertheless, it is formally deprecated
in Bison 2.4.2's NEWS entry, where a plan to phase it out is
discussed. */
#define YYFAIL goto yyerrlab
#if defined YYFAIL
/* This is here to suppress warnings from the GCC cpp's
-Wunused-macros. Normally we don't worry about that warning, but
some users do, and we want to make it easy for users to remove
YYFAIL uses, which will produce warnings from Bison 2.5. */
#endif
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ \
yychar = (Token); \
yylval = (Value); \
YYPOPSTACK (1); \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (YYID (0))
#define YYTERROR 1
#define YYERRCODE 256
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
If N is 0, then set CURRENT to the empty location which ends
the previous symbol: RHS[0] (always defined). */
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
do \
if (YYID (N)) \
{ \
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
} \
else \
{ \
(Current).first_line = (Current).last_line = \
YYRHSLOC (Rhs, 0).last_line; \
(Current).first_column = (Current).last_column = \
YYRHSLOC (Rhs, 0).last_column; \
} \
while (YYID (0))
#endif
/* YY_LOCATION_PRINT -- Print the location on the stream.
This macro was not mandated originally: define only if we know
we won't break user code: when these are the locations we know. */
#ifndef YY_LOCATION_PRINT
# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
# define YY_LOCATION_PRINT(File, Loc) \
fprintf (File, "%d.%d-%d.%d", \
(Loc).first_line, (Loc).first_column, \
(Loc).last_line, (Loc).last_column)
# else
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
# endif
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#ifdef YYLEX_PARAM
# define YYLEX yylex (YYLEX_PARAM)
#else
# define YYLEX yylex ()
#endif
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (YYID (0))
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value, Location); \
YYFPRINTF (stderr, "\n"); \
} \
} while (YYID (0))
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp)
#else
static void
yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
YYLTYPE const * const yylocationp;
#endif
{
if (!yyvaluep)
return;
YYUSE (yylocationp);
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# else
YYUSE (yyoutput);
# endif
switch (yytype)
{
default:
break;
}
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp)
#else
static void
yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp)
FILE *yyoutput;
int yytype;
YYSTYPE const * const yyvaluep;
YYLTYPE const * const yylocationp;
#endif
{
if (yytype < YYNTOKENS)
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
else
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
YY_LOCATION_PRINT (yyoutput, *yylocationp);
YYFPRINTF (yyoutput, ": ");
yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
#else
static void
yy_stack_print (yybottom, yytop)
yytype_int16 *yybottom;
yytype_int16 *yytop;
#endif
{
YYFPRINTF (stderr, "Stack now");
for (; yybottom <= yytop; yybottom++)
{
int yybot = *yybottom;
YYFPRINTF (stderr, " %d", yybot);
}
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (YYID (0))
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yy_reduce_print (YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule)
#else
static void
yy_reduce_print (yyvsp, yylsp, yyrule)
YYSTYPE *yyvsp;
YYLTYPE *yylsp;
int yyrule;
#endif
{
int yynrhs = yyr2[yyrule];
int yyi;
unsigned long int yylno = yyrline[yyrule];
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
&(yyvsp[(yyi + 1) - (yynrhs)])
, &(yylsp[(yyi + 1) - (yynrhs)]) );
YYFPRINTF (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyvsp, yylsp, Rule); \
} while (YYID (0))
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static YYSIZE_T
yystrlen (const char *yystr)
#else
static YYSIZE_T
yystrlen (yystr)
const char *yystr;
#endif
{
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static char *
yystpcpy (char *yydest, const char *yysrc)
#else
static char *
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
#endif
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
/* Fall through. */
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return yystrlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
about the unexpected token YYTOKEN for the state stack whose top is
YYSSP.
Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is
not large enough to hold the message. In that case, also set
*YYMSG_ALLOC to the required number of bytes. Return 2 if the
required number of bytes is too large to store. */
static int
yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
yytype_int16 *yyssp, int yytoken)
{
YYSIZE_T yysize0 = yytnamerr (0, yytname[yytoken]);
YYSIZE_T yysize = yysize0;
YYSIZE_T yysize1;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
/* Internationalized format string. */
const char *yyformat = 0;
/* Arguments of yyformat. */
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
/* Number of reported tokens (one for the "unexpected", one per
"expected"). */
int yycount = 0;
/* There are many possibilities here to consider:
- Assume YYFAIL is not used. It's too flawed to consider. See
for details. YYERROR is fine as it does not invoke this
function.
- If this state is a consistent state with a default action, then
the only way this function was invoked is if the default action
is an error action. In that case, don't check for expected
tokens because there are none.
- The only way there can be no lookahead present (in yychar) is if
this state is a consistent state with a default action. Thus,
detecting the absence of a lookahead is sufficient to determine
that there is no unexpected or expected token to report. In that
case, just report a simple "syntax error".
- Don't assume there isn't a lookahead just because this state is a
consistent state with a default action. There might have been a
previous inconsistent state, consistent state with a non-default
action, or user semantic action that manipulated yychar.
- Of course, the expected token list depends on states to have
correct lookahead information, and it depends on the parser not
to perform extra reductions after fetching a lookahead from the
scanner and before detecting a syntax error. Thus, state merging
(from LALR or IELR) and default reductions corrupt the expected
token list. However, the list is correct for canonical LR with
one exception: it will still contain any token that will not be
accepted due to an error action in a later state.
*/
if (yytoken != YYEMPTY)
{
int yyn = yypact[*yyssp];
yyarg[yycount++] = yytname[yytoken];
if (!yypact_value_is_default (yyn))
{
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. In other words, skip the first -YYN actions for
this state because they are default actions. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yyx;
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
&& !yytable_value_is_error (yytable[yyx + yyn]))
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
break;
}
yyarg[yycount++] = yytname[yyx];
yysize1 = yysize + yytnamerr (0, yytname[yyx]);
if (! (yysize <= yysize1
&& yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
}
}
switch (yycount)
{
# define YYCASE_(N, S) \
case N: \
yyformat = S; \
break
YYCASE_(0, YY_("syntax error"));
YYCASE_(1, YY_("syntax error, unexpected %s"));
YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
# undef YYCASE_
}
yysize1 = yysize + yystrlen (yyformat);
if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
if (*yymsg_alloc < yysize)
{
*yymsg_alloc = 2 * yysize;
if (! (yysize <= *yymsg_alloc
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
return 1;
}
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
{
char *yyp = *yymsg;
int yyi = 0;
while ((*yyp = *yyformat) != '\0')
if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyformat += 2;
}
else
{
yyp++;
yyformat++;
}
}
return 0;
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
/*ARGSUSED*/
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp)
#else
static void
yydestruct (yymsg, yytype, yyvaluep, yylocationp)
const char *yymsg;
int yytype;
YYSTYPE *yyvaluep;
YYLTYPE *yylocationp;
#endif
{
YYUSE (yyvaluep);
YYUSE (yylocationp);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
switch (yytype)
{
case 46: /* "\"text\"" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1469 "SCDoc.tab.cpp"
break;
case 47: /* "URL" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1478 "SCDoc.tab.cpp"
break;
case 48: /* "COMMA" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1487 "SCDoc.tab.cpp"
break;
case 49: /* "\"method name\"" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1496 "SCDoc.tab.cpp"
break;
case 50: /* "\"arguments string\"" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1505 "SCDoc.tab.cpp"
break;
case 59: /* "document" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1514 "SCDoc.tab.cpp"
break;
case 61: /* "dochead" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1523 "SCDoc.tab.cpp"
break;
case 62: /* "headline" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1532 "SCDoc.tab.cpp"
break;
case 65: /* "optsections" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1541 "SCDoc.tab.cpp"
break;
case 66: /* "sections" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1550 "SCDoc.tab.cpp"
break;
case 67: /* "section" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1559 "SCDoc.tab.cpp"
break;
case 69: /* "optsubsections" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1568 "SCDoc.tab.cpp"
break;
case 70: /* "subsections" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1577 "SCDoc.tab.cpp"
break;
case 71: /* "subsection" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1586 "SCDoc.tab.cpp"
break;
case 72: /* "optsubsubsections" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1595 "SCDoc.tab.cpp"
break;
case 73: /* "subsubsections" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1604 "SCDoc.tab.cpp"
break;
case 74: /* "subsubsection" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1613 "SCDoc.tab.cpp"
break;
case 75: /* "optMETHODARGS" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1622 "SCDoc.tab.cpp"
break;
case 76: /* "methodname" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1631 "SCDoc.tab.cpp"
break;
case 77: /* "methnames" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1640 "SCDoc.tab.cpp"
break;
case 78: /* "methodbody" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1649 "SCDoc.tab.cpp"
break;
case 79: /* "optbody" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1658 "SCDoc.tab.cpp"
break;
case 80: /* "optargs" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1667 "SCDoc.tab.cpp"
break;
case 81: /* "args" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1676 "SCDoc.tab.cpp"
break;
case 82: /* "arg" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1685 "SCDoc.tab.cpp"
break;
case 83: /* "optreturns" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1694 "SCDoc.tab.cpp"
break;
case 84: /* "optdiscussion" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1703 "SCDoc.tab.cpp"
break;
case 85: /* "body" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1712 "SCDoc.tab.cpp"
break;
case 86: /* "blockA" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1721 "SCDoc.tab.cpp"
break;
case 87: /* "blockB" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1730 "SCDoc.tab.cpp"
break;
case 88: /* "bodyelem" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1739 "SCDoc.tab.cpp"
break;
case 89: /* "prose" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1748 "SCDoc.tab.cpp"
break;
case 90: /* "proseelem" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1757 "SCDoc.tab.cpp"
break;
case 95: /* "listbody" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1766 "SCDoc.tab.cpp"
break;
case 96: /* "tablerow" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1775 "SCDoc.tab.cpp"
break;
case 97: /* "tablebody" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1784 "SCDoc.tab.cpp"
break;
case 98: /* "tablecells" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1793 "SCDoc.tab.cpp"
break;
case 99: /* "defterms" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1802 "SCDoc.tab.cpp"
break;
case 100: /* "deflistrow" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1811 "SCDoc.tab.cpp"
break;
case 101: /* "deflistbody" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1820 "SCDoc.tab.cpp"
break;
case 102: /* "anywordurl" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1829 "SCDoc.tab.cpp"
break;
case 103: /* "anyword" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1838 "SCDoc.tab.cpp"
break;
case 104: /* "words" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1847 "SCDoc.tab.cpp"
break;
case 105: /* "words2" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1856 "SCDoc.tab.cpp"
break;
case 108: /* "anywordnl" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1865 "SCDoc.tab.cpp"
break;
case 109: /* "wordsnl" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1874 "SCDoc.tab.cpp"
break;
case 110: /* "nocommawords" */
/* Line 1391 of yacc.c */
#line 98 "SCDoc.y"
{ free((yyvaluep->str)); };
/* Line 1391 of yacc.c */
#line 1883 "SCDoc.tab.cpp"
break;
case 111: /* "commalist" */
/* Line 1391 of yacc.c */
#line 97 "SCDoc.y"
{ doc_node_free_tree((yyvaluep->doc_node)); };
/* Line 1391 of yacc.c */
#line 1892 "SCDoc.tab.cpp"
break;
default:
break;
}
}
/* Prevent warnings from -Wmissing-prototypes. */
#ifdef YYPARSE_PARAM
#if defined __STDC__ || defined __cplusplus
int yyparse (void *YYPARSE_PARAM);
#else
int yyparse ();
#endif
#else /* ! YYPARSE_PARAM */
#if defined __STDC__ || defined __cplusplus
int yyparse (void);
#else
int yyparse ();
#endif
#endif /* ! YYPARSE_PARAM */
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Location data for the lookahead symbol. */
YYLTYPE yylloc;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
#ifdef YYPARSE_PARAM
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void *YYPARSE_PARAM)
#else
int
yyparse (YYPARSE_PARAM)
void *YYPARSE_PARAM;
#endif
#else /* ! YYPARSE_PARAM */
#if (defined __STDC__ || defined __C99__FUNC__ \
|| defined __cplusplus || defined _MSC_VER)
int
yyparse (void)
#else
int
yyparse ()
#endif
#endif
{
int yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* The stacks and their tools:
`yyss': related to states.
`yyvs': related to semantic values.
`yyls': related to locations.
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
/* The location stack. */
YYLTYPE yylsa[YYINITDEPTH];
YYLTYPE *yyls;
YYLTYPE *yylsp;
/* The locations where the error started and ended. */
YYLTYPE yyerror_range[3];
YYSIZE_T yystacksize;
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
YYLTYPE yyloc;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N), yylsp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
yytoken = 0;
yyss = yyssa;
yyvs = yyvsa;
yyls = yylsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss;
yyvsp = yyvs;
yylsp = yyls;
#if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
/* Initialize the default location before parsing starts. */
yylloc.first_line = yylloc.last_line = 1;
yylloc.first_column = yylloc.last_column = 1;
#endif
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
YYLTYPE *yyls1 = yyls;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yyls1, yysize * sizeof (*yylsp),
&yystacksize);
yyls = yyls1;
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
YYSTACK_RELOCATE (yyls_alloc, yyls);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
yylsp = yyls + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
if (yystate == YYFINAL)
YYACCEPT;
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yypact_value_is_default (yyn))
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yytable_value_is_error (yyn))
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the lookahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token. */
yychar = YYEMPTY;
yystate = yyn;
*++yyvsp = yylval;
*++yylsp = yylloc;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
`$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
/* Default location. */
YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
/* Line 1806 of yacc.c */
#line 107 "SCDoc.y"
{ topnode = (yyvsp[(1) - (1)].doc_node); }
break;
case 3:
/* Line 1806 of yacc.c */
#line 108 "SCDoc.y"
{ topnode = NULL; doc_node_free_tree((yyvsp[(1) - (2)].doc_node)); }
break;
case 4:
/* Line 1806 of yacc.c */
#line 112 "SCDoc.y"
{
(yyval.doc_node) = doc_node_create("DOCUMENT");
doc_node_add_child((yyval.doc_node), (yyvsp[(3) - (4)].doc_node));
doc_node_add_child((yyval.doc_node), (yyvsp[(4) - (4)].doc_node));
}
break;
case 5:
/* Line 1806 of yacc.c */
#line 118 "SCDoc.y"
{
(yyval.doc_node) = doc_node_make_take_children("BODY",NULL,(yyvsp[(2) - (2)].doc_node));
}
break;
case 6:
/* Line 1806 of yacc.c */
#line 122 "SCDoc.y"
{
(yyval.doc_node) = doc_node_create("DOCUMENT");
doc_node_add_child((yyval.doc_node), (yyvsp[(2) - (3)].doc_node));
doc_node_add_child((yyval.doc_node), (yyvsp[(3) - (3)].doc_node));
}
break;
case 9:
/* Line 1806 of yacc.c */
#line 133 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 10:
/* Line 1806 of yacc.c */
#line 134 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("HEADER",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 11:
/* Line 1806 of yacc.c */
#line 137 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make((yyvsp[(1) - (3)].id),(yyvsp[(2) - (3)].str),NULL); }
break;
case 12:
/* Line 1806 of yacc.c */
#line 138 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("CATEGORIES",NULL,(yyvsp[(2) - (3)].doc_node)); }
break;
case 13:
/* Line 1806 of yacc.c */
#line 139 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("RELATED",NULL,(yyvsp[(2) - (3)].doc_node)); }
break;
case 14:
/* Line 1806 of yacc.c */
#line 142 "SCDoc.y"
{ (yyval.id) = "TITLE"; }
break;
case 15:
/* Line 1806 of yacc.c */
#line 143 "SCDoc.y"
{ (yyval.id) = "TITLE"; }
break;
case 16:
/* Line 1806 of yacc.c */
#line 144 "SCDoc.y"
{ (yyval.id) = "SUMMARY"; }
break;
case 17:
/* Line 1806 of yacc.c */
#line 145 "SCDoc.y"
{ (yyval.id) = "REDIRECT"; }
break;
case 18:
/* Line 1806 of yacc.c */
#line 148 "SCDoc.y"
{ (yyval.id) = "CLASSMETHODS"; method_type = "CMETHOD"; }
break;
case 19:
/* Line 1806 of yacc.c */
#line 149 "SCDoc.y"
{ (yyval.id) = "INSTANCEMETHODS"; method_type = "IMETHOD"; }
break;
case 20:
/* Line 1806 of yacc.c */
#line 150 "SCDoc.y"
{ (yyval.id) = "DESCRIPTION"; method_type = "METHOD"; }
break;
case 21:
/* Line 1806 of yacc.c */
#line 151 "SCDoc.y"
{ (yyval.id) = "EXAMPLES"; method_type = "METHOD"; }
break;
case 23:
/* Line 1806 of yacc.c */
#line 155 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("BODY",NULL,NULL); }
break;
case 24:
/* Line 1806 of yacc.c */
#line 158 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 25:
/* Line 1806 of yacc.c */
#line 159 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("BODY",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 26:
/* Line 1806 of yacc.c */
#line 160 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("BODY",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 27:
/* Line 1806 of yacc.c */
#line 163 "SCDoc.y"
{ method_type = "METHOD"; }
break;
case 28:
/* Line 1806 of yacc.c */
#line 163 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("SECTION",(yyvsp[(3) - (5)].str),(yyvsp[(5) - (5)].doc_node)); }
break;
case 29:
/* Line 1806 of yacc.c */
#line 164 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children((yyvsp[(1) - (2)].id), NULL,(yyvsp[(2) - (2)].doc_node)); }
break;
case 31:
/* Line 1806 of yacc.c */
#line 168 "SCDoc.y"
{ (yyval.doc_node) = NULL; }
break;
case 32:
/* Line 1806 of yacc.c */
#line 171 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 33:
/* Line 1806 of yacc.c */
#line 172 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(SUBSECTIONS)",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 35:
/* Line 1806 of yacc.c */
#line 176 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("SUBSECTION", (yyvsp[(2) - (4)].str), (yyvsp[(4) - (4)].doc_node)); }
break;
case 37:
/* Line 1806 of yacc.c */
#line 180 "SCDoc.y"
{ (yyval.doc_node) = NULL; }
break;
case 38:
/* Line 1806 of yacc.c */
#line 183 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 39:
/* Line 1806 of yacc.c */
#line 184 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(SUBSUBSECTIONS)",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 40:
/* Line 1806 of yacc.c */
#line 185 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("(SUBSUBSECTIONS)",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 41:
/* Line 1806 of yacc.c */
#line 189 "SCDoc.y"
{
(yyvsp[(2) - (5)].doc_node)->id = "METHODNAMES";
(yyval.doc_node) = doc_node_make(method_type,(yyvsp[(3) - (5)].str),(yyvsp[(2) - (5)].doc_node));
doc_node_add_child((yyval.doc_node), (yyvsp[(5) - (5)].doc_node));
// doc_node_add_child($2, $3);
}
break;
case 42:
/* Line 1806 of yacc.c */
#line 195 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make(
stringEqual(method_type, "CMETHOD") ? "CCOPYMETHOD"
: (stringEqual(method_type, "IMETHOD") ? "ICOPYMETHOD"
: "COPYMETHOD"),
(yyvsp[(2) - (3)].str), NULL
); }
break;
case 43:
/* Line 1806 of yacc.c */
#line 201 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children( stringEqual(method_type, "CMETHOD") ? "CPRIVATE"
: "IPRIVATE",
NULL, (yyvsp[(2) - (3)].doc_node)); }
break;
case 44:
/* Line 1806 of yacc.c */
#line 206 "SCDoc.y"
{ (yyval.str) = NULL; }
break;
case 45:
/* Line 1806 of yacc.c */
#line 208 "SCDoc.y"
{
// $$ = doc_node_make("ARGSTRING",$1,NULL);
(yyval.str) = (yyvsp[(1) - (1)].str);
if(!stringEqual(method_type, "METHOD")) {
yyerror("METHOD argument string is not allowed inside CLASSMETHODS or INSTANCEMETHODS");
YYERROR;
}
}
break;
case 46:
/* Line 1806 of yacc.c */
#line 219 "SCDoc.y"
{
char *p = (yyvsp[(1) - (1)].str)+strlen((yyvsp[(1) - (1)].str))-1;
if(*p=='_') {
post("WARNING: SCDoc: In %s\n Property setter %s should be documented without underscore.\n", scdoc_current_file, (yyvsp[(1) - (1)].str));
*p = '\0';
};
(yyval.str) = (yyvsp[(1) - (1)].str);
}
break;
case 47:
/* Line 1806 of yacc.c */
#line 229 "SCDoc.y"
{ free((yyvsp[(2) - (3)].str)); (yyvsp[(2) - (3)].str) = NULL; (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (3)].doc_node), doc_node_make("STRING",(yyvsp[(3) - (3)].str),NULL)); }
break;
case 48:
/* Line 1806 of yacc.c */
#line 230 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(METHODNAMES)",NULL,doc_node_make("STRING",(yyvsp[(1) - (1)].str),NULL)); }
break;
case 49:
/* Line 1806 of yacc.c */
#line 234 "SCDoc.y"
{
(yyval.doc_node) = doc_node_make_take_children("METHODBODY",NULL,(yyvsp[(1) - (4)].doc_node));
doc_node_add_child((yyval.doc_node), (yyvsp[(2) - (4)].doc_node));
doc_node_add_child((yyval.doc_node), (yyvsp[(3) - (4)].doc_node));
doc_node_add_child((yyval.doc_node), (yyvsp[(4) - (4)].doc_node));
}
break;
case 51:
/* Line 1806 of yacc.c */
#line 243 "SCDoc.y"
{ (yyval.doc_node) = NULL; }
break;
case 53:
/* Line 1806 of yacc.c */
#line 247 "SCDoc.y"
{ (yyval.doc_node) = NULL; }
break;
case 54:
/* Line 1806 of yacc.c */
#line 250 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 55:
/* Line 1806 of yacc.c */
#line 251 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("ARGUMENTS",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 56:
/* Line 1806 of yacc.c */
#line 254 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("ARGUMENT", (yyvsp[(2) - (4)].str), (yyvsp[(4) - (4)].doc_node)); }
break;
case 57:
/* Line 1806 of yacc.c */
#line 255 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("ARGUMENT", NULL, (yyvsp[(3) - (3)].doc_node)); }
break;
case 58:
/* Line 1806 of yacc.c */
#line 258 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("RETURNS",NULL,(yyvsp[(2) - (2)].doc_node)); }
break;
case 59:
/* Line 1806 of yacc.c */
#line 259 "SCDoc.y"
{ (yyval.doc_node) = NULL; }
break;
case 60:
/* Line 1806 of yacc.c */
#line 262 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("DISCUSSION",NULL,(yyvsp[(2) - (2)].doc_node)); }
break;
case 61:
/* Line 1806 of yacc.c */
#line 263 "SCDoc.y"
{ (yyval.doc_node) = NULL; }
break;
case 64:
/* Line 1806 of yacc.c */
#line 275 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 65:
/* Line 1806 of yacc.c */
#line 276 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 66:
/* Line 1806 of yacc.c */
#line 277 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(SECTIONBODY)",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 67:
/* Line 1806 of yacc.c */
#line 280 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 68:
/* Line 1806 of yacc.c */
#line 281 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(SECTIONBODY)",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 69:
/* Line 1806 of yacc.c */
#line 284 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children((yyvsp[(1) - (3)].id),NULL,(yyvsp[(2) - (3)].doc_node)); }
break;
case 70:
/* Line 1806 of yacc.c */
#line 285 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children((yyvsp[(1) - (3)].id),NULL,(yyvsp[(2) - (3)].doc_node)); }
break;
case 71:
/* Line 1806 of yacc.c */
#line 286 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("TABLE",NULL,(yyvsp[(2) - (3)].doc_node)); }
break;
case 72:
/* Line 1806 of yacc.c */
#line 287 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("DEFINITIONLIST",NULL,(yyvsp[(2) - (3)].doc_node)); }
break;
case 73:
/* Line 1806 of yacc.c */
#line 288 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make((yyvsp[(1) - (3)].id),(yyvsp[(2) - (3)].str),NULL); }
break;
case 74:
/* Line 1806 of yacc.c */
#line 289 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("CLASSTREE",(yyvsp[(2) - (3)].str),NULL); }
break;
case 75:
/* Line 1806 of yacc.c */
#line 290 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("KEYWORD",NULL,(yyvsp[(2) - (3)].doc_node));
// printf("keyword '%s'\n",$2->children[0]->text);
}
break;
case 76:
/* Line 1806 of yacc.c */
#line 293 "SCDoc.y"
{ (yyval.doc_node) = NULL; }
break;
case 77:
/* Line 1806 of yacc.c */
#line 294 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("IMAGE",(yyvsp[(2) - (3)].str),NULL); }
break;
case 78:
/* Line 1806 of yacc.c */
#line 297 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node), (yyvsp[(2) - (2)].doc_node)); }
break;
case 79:
/* Line 1806 of yacc.c */
#line 298 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("PROSE",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 80:
/* Line 1806 of yacc.c */
#line 301 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make(NODE_TEXT,(yyvsp[(1) - (1)].str),NULL); }
break;
case 81:
/* Line 1806 of yacc.c */
#line 302 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("LINK",(yyvsp[(1) - (1)].str),NULL); }
break;
case 82:
/* Line 1806 of yacc.c */
#line 303 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make((yyvsp[(1) - (3)].id),(yyvsp[(2) - (3)].str),NULL); }
break;
case 83:
/* Line 1806 of yacc.c */
#line 304 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("FOOTNOTE",NULL,(yyvsp[(2) - (3)].doc_node)); }
break;
case 84:
/* Line 1806 of yacc.c */
#line 305 "SCDoc.y"
{ (yyval.doc_node) = doc_node_create(NODE_NL); }
break;
case 85:
/* Line 1806 of yacc.c */
#line 308 "SCDoc.y"
{ (yyval.id) = "LINK"; }
break;
case 86:
/* Line 1806 of yacc.c */
#line 309 "SCDoc.y"
{ (yyval.id) = "STRONG"; }
break;
case 87:
/* Line 1806 of yacc.c */
#line 310 "SCDoc.y"
{ (yyval.id) = "SOFT"; }
break;
case 88:
/* Line 1806 of yacc.c */
#line 311 "SCDoc.y"
{ (yyval.id) = "EMPHASIS"; }
break;
case 89:
/* Line 1806 of yacc.c */
#line 312 "SCDoc.y"
{ (yyval.id) = "CODE"; }
break;
case 90:
/* Line 1806 of yacc.c */
#line 313 "SCDoc.y"
{ (yyval.id) = "TELETYPE"; }
break;
case 91:
/* Line 1806 of yacc.c */
#line 314 "SCDoc.y"
{ (yyval.id) = "MATH"; }
break;
case 92:
/* Line 1806 of yacc.c */
#line 315 "SCDoc.y"
{ (yyval.id) = "ANCHOR"; }
break;
case 93:
/* Line 1806 of yacc.c */
#line 318 "SCDoc.y"
{ (yyval.id) = "CODEBLOCK"; }
break;
case 94:
/* Line 1806 of yacc.c */
#line 319 "SCDoc.y"
{ (yyval.id) = "TELETYPEBLOCK"; }
break;
case 95:
/* Line 1806 of yacc.c */
#line 320 "SCDoc.y"
{ (yyval.id) = "MATHBLOCK"; }
break;
case 96:
/* Line 1806 of yacc.c */
#line 323 "SCDoc.y"
{ (yyval.id) = "LIST"; }
break;
case 97:
/* Line 1806 of yacc.c */
#line 324 "SCDoc.y"
{ (yyval.id) = "TREE"; }
break;
case 98:
/* Line 1806 of yacc.c */
#line 325 "SCDoc.y"
{ (yyval.id) = "NUMBEREDLIST"; }
break;
case 99:
/* Line 1806 of yacc.c */
#line 328 "SCDoc.y"
{ (yyval.id) = "WARNING"; }
break;
case 100:
/* Line 1806 of yacc.c */
#line 329 "SCDoc.y"
{ (yyval.id) = "NOTE"; }
break;
case 101:
/* Line 1806 of yacc.c */
#line 332 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (3)].doc_node), doc_node_make_take_children("ITEM",NULL,(yyvsp[(3) - (3)].doc_node))); }
break;
case 102:
/* Line 1806 of yacc.c */
#line 333 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(LISTBODY)",NULL, doc_node_make_take_children("ITEM",NULL,(yyvsp[(2) - (2)].doc_node))); }
break;
case 103:
/* Line 1806 of yacc.c */
#line 336 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make_take_children("TABROW",NULL,(yyvsp[(2) - (2)].doc_node)); }
break;
case 104:
/* Line 1806 of yacc.c */
#line 339 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 105:
/* Line 1806 of yacc.c */
#line 340 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(TABLEBODY)",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 106:
/* Line 1806 of yacc.c */
#line 343 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (3)].doc_node), doc_node_make_take_children("TABCOL",NULL,(yyvsp[(3) - (3)].doc_node))); }
break;
case 107:
/* Line 1806 of yacc.c */
#line 344 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(TABLECELLS)",NULL, doc_node_make_take_children("TABCOL",NULL,(yyvsp[(1) - (1)].doc_node))); }
break;
case 108:
/* Line 1806 of yacc.c */
#line 347 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (3)].doc_node),doc_node_make_take_children("TERM",NULL,(yyvsp[(3) - (3)].doc_node))); }
break;
case 109:
/* Line 1806 of yacc.c */
#line 348 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(TERMS)",NULL,doc_node_make_take_children("TERM",NULL,(yyvsp[(2) - (2)].doc_node))); }
break;
case 110:
/* Line 1806 of yacc.c */
#line 352 "SCDoc.y"
{
(yyval.doc_node) = doc_node_make_take_children("DEFLISTITEM", NULL, (yyvsp[(1) - (3)].doc_node));
doc_node_add_child((yyval.doc_node), doc_node_make_take_children("DEFINITION", NULL, (yyvsp[(3) - (3)].doc_node)));
}
break;
case 111:
/* Line 1806 of yacc.c */
#line 358 "SCDoc.y"
{ (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (2)].doc_node),(yyvsp[(2) - (2)].doc_node)); }
break;
case 112:
/* Line 1806 of yacc.c */
#line 359 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(DEFLISTBODY)",NULL,(yyvsp[(1) - (1)].doc_node)); }
break;
case 117:
/* Line 1806 of yacc.c */
#line 370 "SCDoc.y"
{ (yyval.str) = strmerge((yyvsp[(1) - (2)].str),(yyvsp[(2) - (2)].str)); }
break;
case 119:
/* Line 1806 of yacc.c */
#line 374 "SCDoc.y"
{ (yyval.str) = strmerge((yyvsp[(1) - (2)].str),(yyvsp[(2) - (2)].str)); }
break;
case 126:
/* Line 1806 of yacc.c */
#line 387 "SCDoc.y"
{ (yyval.str) = strdup("\n"); }
break;
case 127:
/* Line 1806 of yacc.c */
#line 390 "SCDoc.y"
{ (yyval.str) = strmerge((yyvsp[(1) - (2)].str),(yyvsp[(2) - (2)].str)); }
break;
case 129:
/* Line 1806 of yacc.c */
#line 394 "SCDoc.y"
{ (yyval.str) = strmerge((yyvsp[(1) - (2)].str),(yyvsp[(2) - (2)].str)); }
break;
case 130:
/* Line 1806 of yacc.c */
#line 395 "SCDoc.y"
{ (yyval.str) = strmerge((yyvsp[(1) - (2)].str),(yyvsp[(2) - (2)].str)); }
break;
case 133:
/* Line 1806 of yacc.c */
#line 400 "SCDoc.y"
{ free((yyvsp[(2) - (3)].str)); (yyvsp[(2) - (3)].str)=NULL; (yyval.doc_node) = doc_node_add_child((yyvsp[(1) - (3)].doc_node),doc_node_make("STRING",(yyvsp[(3) - (3)].str),NULL)); }
break;
case 134:
/* Line 1806 of yacc.c */
#line 401 "SCDoc.y"
{ (yyval.doc_node) = doc_node_make("(COMMALIST)",NULL,doc_node_make("STRING",(yyvsp[(1) - (1)].str),NULL)); }
break;
/* Line 1806 of yacc.c */
#line 3031 "SCDoc.tab.cpp"
default: break;
}
/* User semantic actions sometimes alter yychar, and that requires
that yytoken be updated with the new translation. We take the
approach of translating immediately before every use of yytoken.
One alternative is translating here after every semantic action,
but that translation would be missed if the semantic action invokes
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
incorrect destructor might then be invoked immediately. In the
case of YYERROR or YYBACKUP, subsequent parser actions might lead
to an incorrect destructor call or verbose syntax error message
before the lookahead is translated. */
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
*++yylsp = yyloc;
/* Now `shift' the result of the reduction. Determine what state
that goes to, based on the state we popped back to and the rule
number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
/*------------------------------------.
| yyerrlab -- here on detecting error |
`------------------------------------*/
yyerrlab:
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
yyssp, yytoken)
{
char const *yymsgp = YY_("syntax error");
int yysyntax_error_status;
yysyntax_error_status = YYSYNTAX_ERROR;
if (yysyntax_error_status == 0)
yymsgp = yymsg;
else if (yysyntax_error_status == 1)
{
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
if (!yymsg)
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
yysyntax_error_status = 2;
}
else
{
yysyntax_error_status = YYSYNTAX_ERROR;
yymsgp = yymsg;
}
}
yyerror (yymsgp);
if (yysyntax_error_status == 2)
goto yyexhaustedlab;
}
# undef YYSYNTAX_ERROR
#endif
}
yyerror_range[1] = yylloc;
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval, &yylloc);
yychar = YYEMPTY;
}
}
/* Else will try to reuse lookahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers like GCC when the user code never invokes
YYERROR and the label yyerrorlab therefore never appears in user
code. */
if (/*CONSTCOND*/ 0)
goto yyerrorlab;
yyerror_range[1] = yylsp[1-yylen];
/* Do not reclaim the symbols of the rule which action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (!yypact_value_is_default (yyn))
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yyerror_range[1] = *yylsp;
yydestruct ("Error: popping",
yystos[yystate], yyvsp, yylsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
*++yyvsp = yylval;
yyerror_range[2] = yylloc;
/* Using YYLLOC is tempting, but would change the location of
the lookahead. YYLOC is available though. */
YYLLOC_DEFAULT (yyloc, yyerror_range, 2);
*++yylsp = yyloc;
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#if !defined(yyoverflow) || YYERROR_VERBOSE
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEMPTY)
{
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = YYTRANSLATE (yychar);
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval, &yylloc);
}
/* Do not reclaim the symbols of the rule which action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp, yylsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
/* Make sure YYID is used. */
return YYID (yyresult);
}
/* Line 2067 of yacc.c */
#line 404 "SCDoc.y"
DocNode * scdoc_parse_run(int mode) {
int modes[] = {START_FULL, START_PARTIAL, START_METADATA};
if(mode<0 || mode>=sizeof(modes)) {
error("scdoc_parse_run(): unknown mode: %d\n",mode);
}
scdoc_start_token = modes[mode];
/* scdoc_start_token = START_FULL;
scdoc_metadata_mode = 0;
if(mode==SCDOC_PARSE_PARTIAL) {
scdoc_start_token = START_PARTIAL;
} else
if(mode==SCDOC_PARSE_METADATA) {
scdoc_metadata_mode = 1;
}*/
topnode = NULL;
method_type = "METHOD";
if(scdocparse()!=0) {
return NULL;
}
return topnode;
}
void scdocerror(const char *str)
{
error("In %s:\n At line %d: %s\n\n",scdoc_current_file,scdoclineno,str);
/* FIXME: this does not work well, since the reported linenumber is often *after* the actual error line
fseek(scdocin, 0, SEEK_SET);
int line = 1;
char buf[256],*txt;
while(line!=scdoclineno && !feof(scdocin)) {
int c = fgetc(scdocin);
if(c=='\n') line++;
}
txt = fgets(buf, 256, scdocin);
if(txt)
fprintf(stderr," %s\n-------------------\n", txt);
*/
}
SuperCollider-3.6.3-Source-linux~repack/SCDoc/lex.scdoc.cpp 0000664 0001750 0001750 00000407652 11743774635 021726 0 ustar dan dan #line 2 "lex.scdoc.cpp"
#line 4 "lex.scdoc.cpp"
#define YY_INT_ALIGNED short int
/* A lexical scanner generated by flex */
#define yy_create_buffer scdoc_create_buffer
#define yy_delete_buffer scdoc_delete_buffer
#define yy_flex_debug scdoc_flex_debug
#define yy_init_buffer scdoc_init_buffer
#define yy_flush_buffer scdoc_flush_buffer
#define yy_load_buffer_state scdoc_load_buffer_state
#define yy_switch_to_buffer scdoc_switch_to_buffer
#define yyin scdocin
#define yyleng scdocleng
#define yylex scdoclex
#define yylineno scdoclineno
#define yyout scdocout
#define yyrestart scdocrestart
#define yytext scdoctext
#define yywrap scdocwrap
#define yyalloc scdocalloc
#define yyrealloc scdocrealloc
#define yyfree scdocfree
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#define YY_FLEX_SUBMINOR_VERSION 35
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif
/* First, we deal with platform-specific or compiler-specific issues. */
/* begin standard C headers. */
#include
#include
#include
#include
/* end standard C headers. */
/* flex integer type definitions */
#ifndef FLEXINT_H
#define FLEXINT_H
/* C99 systems have . Non-C99 systems may or may not. */
#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
* if you want the limit (max/min) macros for int types.
*/
#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS 1
#endif
#include
typedef int8_t flex_int8_t;
typedef uint8_t flex_uint8_t;
typedef int16_t flex_int16_t;
typedef uint16_t flex_uint16_t;
typedef int32_t flex_int32_t;
typedef uint32_t flex_uint32_t;
#else
typedef signed char flex_int8_t;
typedef short int flex_int16_t;
typedef int flex_int32_t;
typedef unsigned char flex_uint8_t;
typedef unsigned short int flex_uint16_t;
typedef unsigned int flex_uint32_t;
/* Limits of integral types. */
#ifndef INT8_MIN
#define INT8_MIN (-128)
#endif
#ifndef INT16_MIN
#define INT16_MIN (-32767-1)
#endif
#ifndef INT32_MIN
#define INT32_MIN (-2147483647-1)
#endif
#ifndef INT8_MAX
#define INT8_MAX (127)
#endif
#ifndef INT16_MAX
#define INT16_MAX (32767)
#endif
#ifndef INT32_MAX
#define INT32_MAX (2147483647)
#endif
#ifndef UINT8_MAX
#define UINT8_MAX (255U)
#endif
#ifndef UINT16_MAX
#define UINT16_MAX (65535U)
#endif
#ifndef UINT32_MAX
#define UINT32_MAX (4294967295U)
#endif
#endif /* ! C99 */
#endif /* ! FLEXINT_H */
#ifdef __cplusplus
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
#else /* ! __cplusplus */
/* C99 requires __STDC__ to be defined as 1. */
#if defined (__STDC__)
#define YY_USE_CONST
#endif /* defined (__STDC__) */
#endif /* ! __cplusplus */
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
/* Returned upon end-of-file. */
#define YY_NULL 0
/* Promotes a possibly negative, possibly signed char to an unsigned
* integer for use as an array index. If the signed char is negative,
* we want to instead treat it as an 8-bit unsigned char, hence the
* double cast.
*/
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
/* Enter a start condition. This macro really ought to take a parameter,
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
#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 scdocrestart(scdocin )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k.
* Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
* Ditto for the __ia64__ case accordingly.
*/
#define YY_BUF_SIZE 32768
#else
#define YY_BUF_SIZE 16384
#endif /* __ia64__ */
#endif
/* The state buf must be large enough to hold one state per character in the main buffer.
*/
#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
#endif
extern int scdocleng;
extern FILE *scdocin, *scdocout;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
/* Note: We specifically omit the test for yy_rule_can_match_eol because it requires
* access to the local variable yy_act. Since yyless() is a macro, it would break
* existing scanners that call yyless() from OUTSIDE scdoclex.
* One obvious solution it to make yy_act a global. I tried that, and saw
* a 5% performance hit in a non-scdoclineno scanner, because yy_act is
* normally declared as a register variable-- so it is not worth it.
*/
#define YY_LESS_LINENO(n) \
do { \
int yyl;\
for ( yyl = n; yyl < scdocleng; ++yyl )\
if ( scdoctext[yyl] == '\n' )\
--scdoclineno;\
}while(0)
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up scdoctext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
*yy_cp = (yy_hold_char); \
YY_RESTORE_YY_MORE_OFFSET \
(yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up scdoctext again */ \
} \
while ( 0 )
#define unput(c) yyunput( c, (yytext_ptr) )
#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef size_t yy_size_t;
#endif
#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
FILE *yy_input_file;
char *yy_ch_buf; /* input buffer */
char *yy_buf_pos; /* current position in input buffer */
/* Size of input buffer in bytes, not including room for EOB
* characters.
*/
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;
int yy_bs_lineno; /**< The line count. */
int yy_bs_column; /**< The column count. */
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
* then we mark the buffer as YY_EOF_PENDING, to indicate that we
* shouldn't try reading from the input source any more. We might
* still have a bunch of tokens to match, though, because of
* possible backing-up.
*
* When we actually see the EOF, we change the status to "new"
* (via scdocrestart()), so that the user can continue scanning by
* just pointing scdocin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
};
#endif /* !YY_STRUCT_YY_BUFFER_STATE */
/* Stack of input buffers. */
static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
*
* Returns the top of the stack, or NULL.
*/
#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
? (yy_buffer_stack)[(yy_buffer_stack_top)] \
: NULL)
/* Same as previous macro, but useful when we know that the buffer stack is not
* NULL or when we need an lvalue. For internal use only.
*/
#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
/* yy_hold_char holds the character lost when scdoctext is formed. */
static char yy_hold_char;
static int yy_n_chars; /* number of characters read into yy_ch_buf */
int scdocleng;
/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 0; /* whether we need to initialize */
static int yy_start = 0; /* start state number */
/* Flag which is used to allow scdocwrap()'s to do buffer switches
* instead of setting up a fresh scdocin. A bit of a hack ...
*/
static int yy_did_buffer_switch_on_eof;
void scdocrestart (FILE *input_file );
void scdoc_switch_to_buffer (YY_BUFFER_STATE new_buffer );
YY_BUFFER_STATE scdoc_create_buffer (FILE *file,int size );
void scdoc_delete_buffer (YY_BUFFER_STATE b );
void scdoc_flush_buffer (YY_BUFFER_STATE b );
void scdocpush_buffer_state (YY_BUFFER_STATE new_buffer );
void scdocpop_buffer_state (void );
static void scdocensure_buffer_stack (void );
static void scdoc_load_buffer_state (void );
static void scdoc_init_buffer (YY_BUFFER_STATE b,FILE *file );
#define YY_FLUSH_BUFFER scdoc_flush_buffer(YY_CURRENT_BUFFER )
YY_BUFFER_STATE scdoc_scan_buffer (char *base,yy_size_t size );
YY_BUFFER_STATE scdoc_scan_string (yyconst char *yy_str );
YY_BUFFER_STATE scdoc_scan_bytes (yyconst char *bytes,int len );
void *scdocalloc (yy_size_t );
void *scdocrealloc (void *,yy_size_t );
void scdocfree (void * );
#define yy_new_buffer scdoc_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
if ( ! YY_CURRENT_BUFFER ){ \
scdocensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
scdoc_create_buffer(scdocin,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
if ( ! YY_CURRENT_BUFFER ){\
scdocensure_buffer_stack (); \
YY_CURRENT_BUFFER_LVALUE = \
scdoc_create_buffer(scdocin,YY_BUF_SIZE ); \
} \
YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
}
#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
/* Begin user sect3 */
#define scdocwrap(n) 1
#define YY_SKIP_YYWRAP
typedef unsigned char YY_CHAR;
FILE *scdocin = (FILE *) 0, *scdocout = (FILE *) 0;
typedef int yy_state_type;
extern int scdoclineno;
int scdoclineno = 1;
extern char *scdoctext;
#define yytext_ptr scdoctext
static yy_state_type yy_get_previous_state (void );
static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
static int yy_get_next_buffer (void );
static void yy_fatal_error (yyconst char msg[] );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up scdoctext.
*/
#define YY_DO_BEFORE_ACTION \
(yytext_ptr) = yy_bp; \
scdocleng = (size_t) (yy_cp - yy_bp); \
(yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
(yy_c_buf_p) = yy_cp;
#define YY_NUM_RULES 107
#define YY_END_OF_BUFFER 108
/* This struct is not used in this scanner,
but its presence is necessary. */
struct yy_trans_info
{
flex_int32_t yy_verify;
flex_int32_t yy_nxt;
};
static yyconst flex_int16_t yy_accept[1261] =
{ 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 108, 66, 55, 48,
56, 64, 66, 50, 67, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
63, 67, 66, 65, 54, 47, 67, 64, 67, 54,
46, 56, 67, 89, 89, 85, 56, 86, 88, 90,
87, 87, 87, 87, 87, 87, 87, 87, 87, 87,
87, 90, 106, 106, 56, 106, 106, 106, 106, 106,
106, 106, 106, 106, 106, 106, 106, 106, 56, 106,
106, 62, 60, 61, 56, 58, 62, 50, 58, 55,
0, 0, 50, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 49, 64, 45, 50, 41, 0, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 0, 0, 0,
44, 65, 47, 64, 0, 0, 0, 0, 89, 89,
86, 89, 89, 89, 89, 89, 89, 89, 89, 89,
89, 86, 88, 87, 87, 87, 87, 87, 87, 87,
87, 87, 87, 87, 87, 87, 87, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 104, 0, 0, 60, 60, 58, 0, 58,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 45, 0, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
63, 52, 53, 51, 44, 42, 0, 89, 89, 89,
89, 89, 89, 89, 89, 89, 89, 89, 89, 89,
87, 87, 87, 87, 87, 87, 87, 87, 87, 87,
87, 87, 87, 87, 87, 91, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 105, 59, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
63, 63, 63, 63, 63, 63, 63, 63, 63, 63,
43, 89, 89, 89, 89, 89, 89, 89, 89, 89,
89, 89, 89, 89, 89, 89, 87, 87, 87, 87,
87, 87, 87, 87, 87, 87, 87, 87, 87, 87,
87, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 57, 63, 63,
63, 63, 0, 63, 63, 63, 63, 63, 63, 63,
63, 63, 63, 0, 0, 0, 63, 0, 63, 63,
63, 63, 63, 63, 0, 63, 63, 63, 63, 63,
63, 0, 63, 89, 89, 89, 89, 89, 89, 89,
89, 89, 89, 89, 89, 89, 89, 89, 87, 87,
87, 87, 87, 87, 87, 87, 87, 87, 87, 87,
87, 87, 87, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 63,
63, 63, 0, 63, 63, 35, 63, 63, 63, 63,
63, 63, 63, 0, 63, 63, 29, 21, 37, 63,
28, 63, 63, 63, 63, 63, 63, 32, 63, 63,
63, 0, 63, 0, 22, 63, 89, 89, 89, 89,
89, 89, 89, 89, 89, 89, 89, 89, 89, 89,
89, 87, 0, 87, 87, 87, 87, 87, 87, 87,
87, 87, 87, 87, 87, 87, 87, 0, 0, 0,
0, 0, 0, 0, 0, 98, 0, 0, 0, 0,
0, 0, 0, 92, 100, 0, 0, 0, 0, 0,
95, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 63, 63, 1, 63, 63, 35,
38, 63, 63, 63, 63, 63, 63, 63, 31, 63,
63, 29, 21, 37, 40, 0, 28, 63, 63, 63,
63, 63, 63, 32, 0, 63, 63, 25, 63, 2,
22, 63, 89, 89, 89, 89, 89, 89, 89, 89,
89, 89, 89, 89, 89, 89, 89, 87, 68, 87,
87, 87, 87, 87, 87, 87, 0, 87, 87, 87,
87, 87, 87, 69, 0, 0, 0, 0, 0, 0,
0, 98, 101, 0, 0, 0, 0, 94, 0, 0,
92, 100, 103, 0, 0, 0, 0, 95, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 30, 63, 63,
1, 63, 63, 63, 63, 63, 63, 63, 63, 63,
31, 63, 0, 13, 63, 0, 63, 0, 0, 0,
33, 63, 0, 25, 63, 2, 0, 89, 89, 89,
89, 89, 89, 89, 89, 89, 89, 89, 89, 89,
89, 87, 68, 87, 87, 87, 87, 87, 87, 0,
80, 0, 87, 0, 0, 87, 0, 69, 0, 0,
0, 93, 0, 0, 0, 0, 0, 0, 0, 94,
0, 0, 96, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 30, 0, 63,
63, 63, 63, 63, 63, 63, 0, 0, 0, 63,
8, 13, 63, 9, 0, 4, 19, 10, 33, 63,
3, 0, 27, 89, 89, 89, 89, 89, 89, 89,
89, 89, 87, 87, 87, 87, 87, 0, 87, 75,
80, 76, 0, 71, 77, 87, 70, 0, 93, 0,
0, 0, 0, 0, 0, 0, 96, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 14, 63, 63, 0, 63, 63,
63, 63, 34, 18, 26, 63, 8, 63, 9, 6,
4, 19, 10, 63, 3, 36, 27, 89, 89, 89,
89, 89, 89, 89, 87, 87, 0, 87, 87, 84,
87, 75, 76, 73, 71, 77, 87, 70, 0, 0,
0, 0, 0, 97, 0, 0, 99, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 14, 0,
63, 7, 0, 63, 63, 0, 34, 18, 26, 63,
63, 6, 0, 36, 39, 89, 89, 89, 89, 89,
89, 0, 87, 74, 0, 87, 84, 87, 73, 0,
0, 0, 0, 97, 0, 99, 102, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 5, 63, 7,
12, 63, 0, 20, 63, 63, 11, 89, 89, 89,
72, 87, 74, 79, 0, 87, 78, 0, 0, 0,
0, 0, 0, 0, 0, 5, 0, 12, 63, 15,
20, 63, 0, 11, 89, 89, 72, 0, 79, 81,
87, 78, 0, 0, 0, 0, 0, 16, 63, 15,
63, 23, 89, 82, 81, 87, 0, 0, 0, 16,
0, 63, 23, 89, 82, 87, 0, 0, 0, 24,
0, 89, 0, 0, 24, 17, 83, 17, 83, 0
} ;
static yyconst flex_int32_t yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 4, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 5, 6, 7, 8, 1, 9, 9, 7, 10,
11, 9, 9, 12, 9, 7, 13, 14, 14, 14,
14, 14, 14, 14, 14, 14, 14, 15, 1, 9,
9, 9, 6, 9, 16, 17, 18, 19, 20, 21,
22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
25, 32, 33, 34, 35, 36, 37, 38, 39, 25,
7, 40, 7, 1, 41, 1, 42, 43, 44, 45,
46, 47, 48, 49, 50, 51, 52, 53, 54, 55,
56, 57, 51, 58, 59, 60, 61, 62, 63, 64,
65, 51, 7, 66, 7, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 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 flex_int32_t yy_meta[67] =
{ 0,
1, 2, 3, 3, 2, 1, 1, 1, 1, 4,
4, 5, 1, 6, 7, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 9,
6, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
8, 8, 8, 8, 8, 1
} ;
static yyconst flex_int16_t yy_base[1269] =
{ 0,
0, 0, 65, 104, 143, 182, 222, 0, 288, 0,
353, 0, 79, 83, 413, 0, 3961, 3962, 478, 87,
118, 89, 3952, 72, 3944, 97, 3943, 109, 117, 102,
86, 144, 58, 119, 159, 146, 145, 175, 519, 346,
348, 476, 3891, 0, 514, 543, 557, 202, 3941, 3962,
566, 3962, 3962, 0, 605, 3962, 3962, 126, 3941, 3962,
665, 731, 536, 558, 605, 574, 661, 666, 667, 782,
727, 3939, 3962, 842, 3962, 109, 164, 158, 337, 354,
347, 350, 557, 344, 467, 665, 563, 638, 760, 3938,
786, 3962, 593, 3962, 166, 639, 0, 209, 0, 0,
790, 3944, 213, 3936, 456, 674, 728, 457, 470, 472,
530, 543, 739, 654, 554, 582, 776, 783, 602, 3884,
816, 848, 871, 852, 487, 3962, 3936, 3933, 735, 734,
789, 798, 827, 850, 653, 703, 864, 874, 875, 878,
761, 883, 880, 888, 890, 892, 895, 917, 903, 908,
911, 924, 791, 900, 920, 913, 934, 3939, 3931, 3879,
969, 0, 979, 950, 983, 997, 3929, 3928, 0, 0,
538, 963, 634, 664, 781, 888, 943, 933, 975, 976,
979, 765, 3928, 988, 990, 998, 1018, 1026, 1031, 1036,
1061, 1056, 1077, 1078, 1095, 1136, 1094, 3926, 0, 1102,
987, 971, 981, 993, 1060, 999, 1018, 1035, 1121, 1117,
1108, 1127, 1141, 1116, 1125, 1141, 1143, 1129, 1126, 1141,
1139, 1140, 1152, 1168, 1159, 1159, 1149, 1176, 1157, 1160,
1212, 3925, 3962, 1220, 3922, 1224, 1207, 1225, 3924, 0,
1196, 1198, 1217, 1218, 1218, 1207, 1225, 1212, 1210, 1206,
1213, 1213, 1214, 1216, 1224, 1229, 1261, 1237, 1265, 1240,
1233, 1227, 1244, 1238, 1295, 3920, 1269, 1270, 1274, 1289,
1287, 1286, 1288, 1295, 1308, 1294, 1296, 1300, 1313, 1312,
1317, 1314, 1315, 1321, 1322, 1327, 1338, 1326, 1341, 1342,
1344, 1348, 1349, 1359, 1352, 1362, 1371, 1372, 1379, 1380,
1378, 3962, 3962, 3962, 1399, 3962, 3917, 1362, 1381, 1368,
1377, 1396, 1380, 1375, 1383, 1395, 1401, 1403, 1413, 1393,
1428, 1433, 1434, 1441, 1475, 1466, 1479, 1488, 1497, 1522,
1518, 1524, 1540, 1560, 1565, 3962, 1560, 1417, 1425, 1439,
1452, 1477, 1523, 1518, 1545, 1545, 1557, 1564, 1563, 1561,
1574, 1578, 1580, 1568, 1582, 1592, 1575, 1576, 1585, 1586,
1592, 1602, 1598, 3962, 3962, 1593, 1611, 1600, 1617, 1599,
1615, 1622, 1624, 1615, 1610, 1613, 1612, 1616, 1629, 1630,
1635, 1639, 1622, 1636, 1645, 1627, 1633, 1638, 1644, 1647,
1657, 1653, 1663, 1656, 0, 1674, 1677, 1679, 1675, 3914,
1684, 1681, 1687, 1680, 1698, 1676, 1703, 1701, 1707, 1705,
3907, 3902, 3900, 1709, 3898, 1722, 1710, 1714, 1728, 1735,
1729, 3894, 1740, 1736, 1744, 1751, 1739, 1755, 3892, 1733,
3962, 1743, 1731, 1735, 1758, 1749, 1744, 1743, 1758, 1748,
1761, 1771, 1757, 1759, 1766, 1769, 1799, 1798, 1807, 1800,
1843, 1848, 1849, 1850, 1856, 1881, 1891, 1900, 1899, 1901,
1942, 1778, 1789, 1799, 1806, 1821, 1834, 3890, 1840, 1852,
1872, 1889, 1902, 1919, 1908, 3886, 3882, 1910, 1933, 1927,
1926, 1939, 3881, 1936, 1947, 1952, 1936, 1951, 1945, 1952,
1943, 3855, 1949, 1949, 1947, 1945, 1950, 1953, 1967, 1957,
3854, 3852, 1960, 3851, 1972, 1985, 1978, 1977, 1980, 1990,
1995, 2001, 1999, 1986, 2001, 3840, 1998, 0, 2010, 2008,
2009, 2016, 542, 2014, 2011, 2034, 2018, 2038, 2037, 2042,
3833, 2040, 2041, 753, 817, 854, 2044, 1052, 2047, 2051,
2060, 2063, 2052, 2071, 1125, 2072, 2073, 2078, 3832, 2077,
3829, 1241, 2067, 2052, 2069, 2075, 2072, 2077, 2096, 2083,
2084, 2099, 2086, 2085, 2097, 2103, 2108, 2105, 2116, 2158,
2137, 2154, 2138, 2179, 2171, 2201, 2203, 2220, 2222, 2228,
2253, 2258, 2271, 3826, 3807, 2092, 2101, 2105, 2274, 3804,
2117, 2132, 2138, 2149, 3801, 2160, 2167, 3779, 3776, 2203,
2205, 2221, 2231, 2223, 3769, 2269, 2274, 2261, 2255, 3701,
2276, 2269, 2295, 3700, 2284, 2281, 2283, 2279, 2288, 2291,
2297, 2300, 3654, 3622, 2316, 3606, 2304, 2303, 2319, 2320,
2313, 2313, 2326, 2313, 3601, 2307, 3554, 3486, 2319, 3485,
2335, 2341, 1363, 2339, 2345, 1432, 2342, 2352, 2360, 2363,
2364, 2367, 2366, 1416, 2365, 2374, 843, 2402, 2392, 3470,
2425, 2395, 2396, 2403, 2405, 2410, 2408, 2429, 3464, 2420,
2421, 1499, 2424, 1510, 2454, 2423, 2410, 2433, 2424, 2422,
2422, 2422, 2420, 2434, 2428, 2444, 2445, 2438, 2455, 2442,
3405, 2476, 3359, 2482, 2489, 2480, 2521, 2523, 2528, 2541,
2572, 2573, 2574, 2579, 2604, 2620, 2622, 3322, 3315, 3306,
2446, 3295, 2457, 2477, 2469, 2559, 2470, 2510, 2525, 2534,
3290, 2538, 2540, 1203, 2605, 3251, 2571, 2578, 2592, 2584,
2638, 3241, 2610, 2606, 2617, 2622, 2621, 3211, 2635, 2624,
2663, 2624, 2629, 2636, 2636, 2652, 2649, 2667, 2667, 2689,
3168, 2668, 2670, 2678, 2678, 2666, 2671, 2667, 2663, 3133,
2672, 3129, 2682, 1831, 2690, 2691, 1560, 2698, 2716, 2705,
3110, 2719, 2720, 2703, 2723, 2706, 2718, 2725, 1803, 2728,
3080, 2221, 2750, 2754, 3091, 1835, 2776, 2745, 3067, 2751,
3046, 3028, 3024, 2784, 1874, 2752, 2948, 2789, 2780, 2396,
2794, 2932, 2688, 2729, 2750, 2749, 2753, 2781, 2785, 2785,
2927, 2785, 2788, 2788, 2783, 2779, 2775, 2818, 2515, 2819,
2827, 2828, 2860, 2862, 2866, 2884, 2902, 2908, 2909, 2914,
2918, 2952, 2957, 2767, 2813, 2817, 2793, 2895, 2812, 2803,
2821, 2904, 2900, 2836, 2831, 2868, 2872, 2823, 2908, 2883,
2944, 2950, 2894, 2873, 2898, 2841, 2837, 2986, 2802, 2933,
2746, 2939, 2932, 2951, 2943, 2958, 2993, 2957, 2957, 2952,
2969, 2964, 2980, 2989, 2608, 3012, 2597, 2992, 2590, 2982,
2558, 2551, 2511, 2994, 2510, 3000, 2498, 3019, 2480, 3007,
3023, 3015, 3014, 3017, 3018, 3016, 3021, 2468, 2461, 2393,
3047, 3026, 2017, 3053, 3030, 2147, 2377, 2162, 2338, 2469,
3065, 3035, 2704, 3082, 2369, 3054, 2808, 3038, 3029, 3051,
3049, 3041, 3043, 3058, 2288, 2267, 3045, 2257, 2246, 3057,
2245, 3076, 3088, 3093, 3094, 3101, 3103, 3136, 3142, 2201,
3106, 2190, 3146, 2151, 2140, 3144, 2133, 3110, 3136, 3162,
3079, 3132, 3080, 3132, 3148, 3145, 3153, 2116, 1921, 3177,
3152, 1917, 3205, 3155, 1880, 1867, 3167, 3167, 3171, 3163,
3174, 3181, 3182, 1866, 1856, 3186, 1824, 3188, 1818, 1794,
1713, 1702, 1546, 3188, 1540, 1532, 1505, 3218, 2851, 3206,
3207, 1492, 3209, 3214, 3212, 3217, 3220, 3221, 3232, 3233,
3247, 3253, 3235, 3255, 3249, 3265, 3271, 3275, 3279, 3263,
3284, 3275, 3291, 3205, 3238, 3251, 3261, 3274, 1486, 3271,
1465, 3270, 3286, 3285, 3293, 3313, 3306, 1464, 3334, 3301,
3302, 3309, 1454, 3329, 3342, 3341, 3351, 1450, 3358, 3318,
3322, 1427, 3346, 3337, 1354, 3352, 3397, 3350, 1353, 1301,
3348, 3352, 1247, 3365, 3356, 3356, 3359, 1186, 1182, 3369,
3368, 1131, 3366, 1100, 3401, 1084, 3394, 3360, 1047, 3389,
3402, 1012, 3420, 3424, 3430, 3404, 3435, 3415, 3439, 3441,
3445, 3449, 3453, 1011, 3454, 3458, 3463, 3403, 3415, 993,
3430, 3439, 3450, 3443, 3461, 3462, 982, 3467, 3457, 3522,
3503, 3488, 3500, 3506, 3526, 3527, 3519, 3534, 961, 960,
3461, 953, 3487, 3548, 3487, 943, 3538, 916, 3503, 910,
898, 3511, 3515, 849, 3520, 3522, 844, 3555, 3560, 3553,
3552, 3569, 3563, 3558, 824, 3564, 3584, 3588, 3592, 3583,
3568, 3598, 3586, 3602, 824, 801, 3565, 771, 3580, 3578,
756, 731, 3597, 3612, 720, 3604, 3638, 3606, 3613, 714,
3642, 3590, 677, 3661, 3602, 3665, 666, 641, 3593, 631,
3630, 611, 604, 3635, 3627, 600, 3669, 3671, 593, 3673,
3677, 3662, 3668, 3686, 3670, 576, 3691, 3653, 569, 3669,
3692, 3683, 3699, 3700, 549, 3687, 3704, 3717, 536, 3677,
493, 3675, 488, 3681, 470, 3722, 3715, 3730, 3708, 3742,
3746, 3737, 3740, 3736, 379, 3701, 3756, 374, 3757, 3761,
3751, 3767, 3735, 345, 3726, 3752, 344, 3771, 204, 3785,
3762, 3796, 3760, 3806, 3810, 3790, 3759, 195, 3769, 3822,
3770, 185, 3831, 3770, 3835, 3815, 167, 120, 112, 3848,
3841, 98, 82, 78, 3856, 3860, 3870, 3874, 3878, 3962,
3883, 3886, 3894, 3902, 3910, 3918, 3922, 3930
} ;
static yyconst flex_int16_t yy_def[1269] =
{ 0,
1260, 1, 1261, 1261, 1261, 1261, 1260, 7, 1260, 9,
9, 11, 11, 11, 1260, 15, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1260, 1260, 1263, 1260, 1260, 1260, 1263, 1260, 1260,
1260, 1260, 1260, 1264, 1264, 1260, 1260, 1260, 1264, 1260,
1265, 1265, 62, 62, 62, 62, 62, 62, 62, 62,
62, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1266, 1260, 1267, 19,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1260, 1260, 1260,
1260, 1263, 1260, 1263, 1260, 1260, 1260, 1260, 1264, 55,
1260, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264,
1264, 1260, 1264, 62, 62, 62, 62, 62, 62, 62,
62, 62, 62, 62, 62, 62, 62, 1260, 74, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1266, 1267,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1260, 1260, 1260, 1260, 1260, 1260, 1264, 1264, 1264,
1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264,
62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
62, 62, 62, 62, 62, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1268, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1260, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264,
1264, 1264, 1264, 1264, 1264, 1264, 62, 62, 62, 62,
62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
62, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1268, 1262, 1262,
1262, 1262, 1260, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1260, 1260, 1260, 1262, 1260, 1262, 1262,
1262, 1262, 1262, 1262, 1260, 1262, 1262, 1262, 1262, 1262,
1262, 1260, 1262, 1264, 1264, 1264, 1264, 1264, 1264, 1264,
1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 62, 62,
62, 62, 62, 62, 62, 62, 62, 62, 62, 62,
62, 62, 62, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1262,
1262, 1262, 1260, 1262, 1262, 1260, 1262, 1262, 1262, 1262,
1262, 1262, 1262, 1260, 1262, 1262, 1260, 1260, 1260, 1262,
1260, 1262, 1262, 1262, 1262, 1262, 1262, 1260, 1262, 1262,
1262, 1260, 1262, 1260, 1260, 1262, 1264, 1264, 1264, 1264,
1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264,
1264, 62, 1260, 62, 62, 62, 62, 62, 62, 62,
62, 62, 62, 62, 62, 62, 62, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1262, 1262, 1260, 1262, 1262, 1260,
1260, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1260, 1262,
1262, 1260, 1260, 1260, 1260, 1260, 1260, 1262, 1262, 1262,
1262, 1262, 1262, 1260, 1260, 1262, 1262, 1260, 1262, 1260,
1260, 1262, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264,
1264, 1264, 1264, 1264, 1264, 1264, 1264, 62, 1260, 62,
62, 62, 62, 62, 62, 62, 1260, 62, 62, 62,
62, 62, 62, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1262, 1262,
1260, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262, 1262,
1260, 1262, 1260, 1260, 1262, 1260, 1262, 1260, 1260, 1260,
1260, 1262, 1260, 1260, 1262, 1260, 1260, 1264, 1264, 1264,
1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264, 1264,
1264, 62, 1260, 62, 62, 62, 62, 62, 62, 1260,
1260, 1260, 62, 1260, 1260, 62, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1262,
1262, 1262, 1262, 1262, 1262, 1262, 1260, 1260, 1260, 1262,
1260, 1260, 1262, 1260, 1260, 1260, 1260, 1260, 1260, 1262,
1260, 1260, 1260, 1264, 1264, 1264, 1264, 1264, 1264, 1264,
1264, 1264, 62, 62, 62, 62, 62, 1260, 62, 1260,
1260, 1260, 1260, 1260, 1260, 62, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1262, 1262, 1260, 1262, 1262,
1262, 1262, 1260, 1260, 1260, 1262, 1260, 1262, 1260, 1260,
1260, 1260, 1260, 1262, 1260, 1260, 1260, 1264, 1264, 1264,
1264, 1264, 1264, 1264, 62, 62, 1260, 62, 62, 1260,
62, 1260, 1260, 1260, 1260, 1260, 62, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1262, 1260, 1260, 1262, 1262, 1260, 1260, 1260, 1260, 1262,
1262, 1260, 1260, 1260, 1260, 1264, 1264, 1264, 1264, 1264,
1264, 1260, 62, 1260, 1260, 62, 1260, 62, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1262, 1260,
1260, 1262, 1260, 1260, 1262, 1262, 1260, 1264, 1264, 1264,
1260, 62, 1260, 1260, 1260, 62, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1262, 1260,
1260, 1262, 1260, 1260, 1264, 1264, 1260, 1260, 1260, 1260,
62, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1262, 1260,
1262, 1260, 1264, 1260, 1260, 62, 1260, 1260, 1260, 1260,
1260, 1262, 1260, 1264, 1260, 62, 1260, 1260, 1260, 1260,
1260, 1264, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 0,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260
} ;
static yyconst flex_int16_t yy_nxt[4029] =
{ 0,
18, 19, 20, 21, 19, 22, 22, 23, 18, 22,
22, 24, 18, 22, 25, 26, 27, 28, 29, 30,
31, 27, 27, 32, 27, 33, 34, 35, 36, 27,
37, 38, 39, 40, 27, 27, 41, 27, 27, 42,
18, 26, 27, 28, 29, 30, 31, 27, 27, 32,
27, 33, 34, 35, 36, 27, 37, 38, 39, 40,
27, 27, 41, 27, 27, 43, 45, 46, 21, 47,
48, 48, 127, 125, 48, 48, 125, 141, 48, 25,
73, 91, 75, 73, 73, 91, 75, 73, 121, 122,
121, 121, 1256, 73, 123, 123, 1257, 73, 123, 123,
127, 104, 123, 141, 49, 45, 46, 21, 47, 48,
48, 127, 1253, 48, 48, 138, 127, 48, 25, 101,
101, 101, 101, 127, 131, 129, 1254, 182, 130, 136,
182, 127, 104, 127, 1250, 132, 134, 210, 133, 137,
135, 138, 142, 49, 50, 51, 52, 53, 48, 48,
131, 129, 48, 48, 130, 136, 48, 53, 127, 127,
127, 132, 134, 210, 133, 137, 135, 237, 142, 237,
237, 139, 140, 127, 143, 145, 147, 214, 144, 211,
146, 1253, 53, 50, 51, 52, 53, 48, 48, 127,
212, 48, 48, 213, 148, 48, 53, 139, 140, 1251,
143, 145, 147, 214, 144, 211, 146, 164, 164, 1248,
125, 164, 164, 125, 125, 164, 212, 125, 1241, 213,
148, 53, 54, 55, 56, 57, 55, 54, 54, 54,
54, 54, 54, 58, 54, 59, 60, 61, 61, 62,
63, 64, 61, 61, 61, 65, 61, 66, 61, 67,
61, 61, 68, 69, 70, 71, 61, 61, 61, 61,
61, 72, 54, 61, 61, 62, 63, 64, 61, 61,
61, 65, 61, 66, 61, 67, 61, 61, 68, 69,
70, 71, 61, 61, 61, 61, 61, 54, 73, 74,
73, 75, 74, 73, 73, 73, 73, 73, 73, 73,
73, 73, 73, 76, 73, 77, 78, 79, 73, 73,
73, 80, 73, 81, 82, 83, 73, 73, 84, 85,
86, 87, 73, 73, 73, 73, 73, 73, 73, 76,
73, 77, 78, 79, 73, 73, 73, 80, 73, 81,
82, 83, 73, 73, 84, 85, 86, 87, 73, 73,
73, 73, 73, 73, 88, 88, 89, 88, 1232, 1228,
127, 153, 127, 157, 215, 154, 219, 90, 73, 155,
73, 73, 73, 220, 216, 223, 73, 156, 73, 73,
73, 217, 218, 73, 73, 73, 73, 153, 1234, 157,
215, 154, 219, 1218, 73, 155, 73, 73, 73, 220,
216, 223, 73, 156, 73, 73, 73, 217, 218, 73,
73, 73, 73, 92, 93, 94, 95, 93, 96, 92,
92, 96, 97, 92, 98, 96, 92, 92, 92, 92,
92, 92, 92, 92, 92, 92, 92, 92, 92, 92,
92, 92, 92, 92, 92, 92, 92, 92, 92, 92,
92, 92, 92, 92, 99, 99, 99, 99, 99, 99,
99, 99, 99, 99, 99, 99, 99, 99, 99, 99,
99, 99, 99, 99, 99, 99, 99, 99, 96, 100,
101, 101, 100, 158, 1227, 102, 224, 241, 125, 103,
159, 125, 104, 105, 247, 106, 107, 108, 109, 248,
249, 110, 1210, 111, 112, 113, 114, 1224, 115, 116,
117, 118, 224, 241, 119, 101, 101, 101, 101, 105,
247, 106, 107, 108, 109, 248, 249, 110, 104, 111,
112, 113, 114, 127, 115, 116, 117, 118, 149, 182,
119, 160, 182, 120, 101, 163, 101, 101, 150, 250,
1218, 184, 151, 152, 266, 188, 646, 104, 101, 101,
101, 101, 184, 1220, 149, 184, 251, 165, 166, 166,
165, 104, 221, 184, 150, 250, 222, 184, 151, 152,
167, 188, 229, 1195, 184, 256, 230, 184, 184, 184,
1213, 184, 251, 191, 236, 189, 237, 236, 221, 184,
184, 257, 222, 184, 103, 168, 170, 1207, 229, 170,
184, 256, 230, 184, 1187, 184, 171, 264, 1184, 191,
184, 189, 172, 173, 174, 1203, 184, 257, 175, 184,
176, 184, 177, 190, 184, 178, 179, 180, 181, 231,
231, 231, 231, 264, 238, 1181, 184, 238, 172, 173,
174, 238, 232, 311, 175, 1178, 176, 184, 177, 190,
184, 178, 179, 180, 181, 169, 169, 127, 1167, 169,
169, 169, 169, 169, 169, 169, 184, 169, 169, 311,
192, 184, 184, 254, 225, 275, 194, 184, 255, 242,
184, 1195, 184, 184, 226, 184, 184, 193, 227, 228,
243, 312, 184, 244, 238, 169, 192, 184, 184, 254,
225, 275, 194, 184, 255, 242, 184, 127, 184, 184,
226, 184, 184, 193, 227, 228, 243, 312, 1197, 244,
169, 169, 169, 276, 1194, 169, 169, 169, 169, 169,
169, 169, 184, 169, 169, 1191, 185, 245, 127, 127,
197, 246, 267, 184, 252, 268, 184, 186, 253, 276,
187, 231, 231, 231, 231, 266, 182, 657, 184, 182,
1160, 169, 185, 245, 232, 127, 197, 246, 267, 184,
252, 268, 184, 186, 253, 1155, 187, 234, 234, 234,
234, 101, 101, 101, 101, 258, 169, 184, 260, 281,
235, 195, 261, 127, 104, 127, 262, 297, 184, 313,
259, 184, 127, 270, 263, 1152, 196, 121, 122, 121,
121, 258, 269, 184, 260, 281, 1145, 195, 261, 266,
104, 658, 262, 297, 184, 313, 259, 184, 1183, 270,
263, 127, 196, 199, 782, 271, 199, 782, 269, 121,
122, 121, 121, 265, 265, 265, 265, 272, 1176, 200,
201, 202, 104, 1173, 127, 203, 266, 204, 659, 205,
273, 271, 206, 207, 208, 209, 123, 123, 127, 277,
123, 123, 274, 272, 123, 200, 201, 202, 127, 127,
279, 203, 127, 204, 127, 205, 273, 127, 206, 207,
208, 209, 127, 278, 127, 277, 127, 314, 274, 127,
280, 282, 1170, 284, 127, 283, 279, 127, 288, 287,
292, 285, 127, 286, 1132, 127, 298, 127, 293, 278,
1168, 127, 300, 314, 127, 289, 280, 282, 127, 284,
295, 283, 294, 290, 288, 287, 292, 285, 127, 286,
291, 296, 298, 299, 293, 164, 164, 1160, 300, 164,
164, 289, 315, 164, 316, 301, 295, 1155, 294, 290,
305, 305, 305, 305, 1152, 1161, 291, 296, 308, 299,
101, 163, 101, 101, 165, 166, 166, 165, 315, 309,
316, 301, 310, 104, 317, 318, 1154, 167, 166, 166,
166, 166, 320, 184, 308, 184, 214, 1097, 216, 218,
319, 167, 219, 322, 184, 309, 184, 184, 310, 184,
317, 318, 168, 321, 184, 1143, 1136, 184, 320, 184,
223, 184, 214, 184, 216, 218, 319, 224, 219, 322,
184, 184, 184, 184, 184, 184, 325, 184, 323, 321,
184, 184, 184, 184, 225, 184, 223, 184, 324, 184,
184, 1133, 184, 224, 266, 184, 661, 184, 326, 228,
184, 184, 325, 184, 323, 338, 184, 184, 184, 222,
225, 184, 184, 184, 324, 184, 184, 184, 184, 328,
184, 184, 184, 184, 326, 228, 330, 184, 1130, 327,
329, 338, 184, 184, 331, 222, 184, 184, 184, 184,
184, 184, 332, 184, 1128, 328, 184, 211, 184, 184,
184, 184, 330, 184, 184, 327, 329, 335, 212, 184,
331, 337, 184, 184, 340, 184, 184, 266, 332, 668,
339, 341, 342, 211, 230, 1080, 184, 184, 345, 184,
184, 184, 333, 335, 212, 346, 347, 337, 348, 343,
340, 349, 184, 334, 350, 184, 339, 341, 342, 351,
230, 344, 352, 353, 345, 354, 357, 184, 333, 358,
359, 346, 347, 362, 348, 343, 355, 349, 184, 334,
350, 184, 360, 363, 356, 351, 1075, 344, 352, 353,
1074, 354, 357, 361, 851, 358, 359, 851, 237, 362,
237, 237, 355, 231, 231, 231, 231, 366, 360, 363,
356, 234, 234, 234, 234, 236, 232, 237, 236, 361,
238, 367, 368, 238, 235, 103, 369, 238, 371, 373,
374, 375, 376, 366, 377, 378, 379, 380, 370, 381,
372, 382, 383, 266, 387, 675, 390, 367, 368, 391,
392, 1120, 369, 393, 371, 373, 374, 375, 376, 394,
377, 378, 379, 380, 370, 381, 372, 382, 383, 384,
387, 388, 390, 127, 127, 391, 392, 385, 127, 393,
238, 396, 389, 398, 386, 394, 265, 265, 265, 265,
127, 127, 127, 127, 397, 384, 400, 388, 127, 127,
127, 402, 403, 385, 127, 1065, 405, 396, 389, 398,
386, 399, 127, 406, 401, 404, 127, 127, 127, 127,
397, 127, 400, 407, 408, 127, 127, 402, 403, 411,
127, 127, 405, 413, 414, 409, 415, 399, 412, 406,
401, 404, 127, 410, 416, 127, 127, 419, 127, 407,
408, 417, 127, 127, 418, 411, 127, 1117, 1114, 413,
414, 409, 415, 127, 412, 266, 127, 767, 420, 410,
416, 421, 422, 419, 424, 127, 127, 417, 423, 425,
418, 427, 127, 127, 127, 432, 433, 426, 434, 429,
305, 305, 305, 305, 420, 428, 430, 421, 422, 435,
424, 436, 437, 438, 423, 425, 439, 427, 440, 441,
443, 432, 433, 426, 434, 429, 446, 442, 266, 444,
779, 428, 430, 770, 771, 435, 770, 436, 437, 438,
445, 1097, 439, 184, 440, 441, 443, 447, 184, 184,
463, 464, 446, 442, 184, 444, 184, 184, 450, 184,
184, 465, 184, 184, 1109, 448, 445, 184, 1104, 184,
184, 466, 449, 447, 184, 184, 463, 464, 1100, 1033,
184, 184, 184, 184, 450, 184, 184, 465, 184, 184,
184, 448, 184, 184, 184, 184, 184, 466, 449, 452,
1028, 184, 451, 184, 184, 184, 1068, 184, 184, 467,
454, 266, 184, 798, 184, 453, 184, 184, 184, 1013,
184, 184, 266, 184, 800, 452, 184, 184, 451, 184,
184, 184, 455, 457, 184, 467, 454, 184, 184, 184,
184, 453, 468, 184, 184, 456, 1064, 184, 184, 184,
184, 184, 184, 184, 1011, 184, 469, 458, 455, 457,
1008, 891, 470, 184, 891, 184, 184, 471, 468, 184,
184, 456, 459, 184, 184, 184, 184, 184, 462, 184,
184, 184, 469, 458, 472, 473, 184, 460, 470, 184,
344, 461, 184, 471, 184, 184, 474, 475, 459, 476,
477, 184, 478, 479, 462, 480, 184, 481, 482, 483,
472, 473, 184, 460, 484, 184, 344, 461, 485, 486,
184, 487, 474, 475, 488, 476, 477, 489, 478, 479,
490, 480, 491, 481, 482, 483, 492, 493, 494, 495,
484, 496, 497, 498, 485, 486, 499, 487, 500, 501,
488, 502, 503, 489, 504, 505, 490, 506, 491, 507,
508, 509, 492, 493, 494, 495, 510, 496, 497, 498,
511, 512, 499, 513, 500, 501, 514, 502, 503, 515,
504, 505, 516, 506, 517, 507, 508, 509, 127, 127,
127, 127, 510, 127, 127, 127, 511, 512, 127, 513,
521, 127, 514, 519, 520, 515, 529, 522, 516, 525,
517, 524, 127, 528, 527, 127, 1007, 127, 526, 127,
531, 127, 532, 127, 127, 540, 521, 1006, 127, 519,
520, 530, 529, 522, 533, 525, 127, 524, 537, 528,
527, 539, 127, 127, 526, 541, 531, 127, 532, 127,
127, 540, 544, 127, 127, 547, 553, 530, 127, 548,
533, 542, 554, 555, 537, 127, 543, 539, 546, 127,
549, 541, 550, 556, 551, 557, 558, 559, 544, 560,
561, 547, 553, 562, 563, 548, 564, 542, 554, 555,
565, 566, 543, 567, 546, 568, 549, 584, 550, 556,
551, 557, 558, 559, 901, 560, 561, 901, 1062, 562,
563, 585, 564, 184, 184, 184, 565, 566, 586, 567,
569, 568, 184, 584, 184, 184, 184, 184, 184, 184,
570, 572, 1004, 184, 571, 587, 184, 585, 1001, 184,
184, 184, 588, 266, 586, 888, 569, 266, 184, 904,
184, 184, 184, 184, 184, 184, 570, 572, 184, 184,
571, 587, 184, 574, 184, 184, 589, 591, 588, 184,
1059, 577, 184, 573, 184, 184, 184, 184, 575, 576,
1058, 1050, 184, 592, 184, 184, 266, 593, 911, 574,
184, 184, 589, 591, 1049, 184, 184, 577, 184, 573,
184, 184, 184, 184, 575, 576, 184, 184, 184, 592,
184, 184, 578, 593, 184, 184, 582, 184, 581, 594,
184, 595, 184, 580, 579, 184, 184, 184, 184, 184,
184, 1033, 184, 184, 596, 1028, 184, 597, 578, 600,
184, 184, 582, 184, 581, 594, 184, 595, 601, 580,
579, 184, 184, 184, 184, 184, 184, 184, 602, 603,
596, 583, 604, 597, 606, 600, 607, 608, 184, 609,
610, 184, 611, 612, 601, 613, 615, 616, 617, 618,
619, 620, 621, 184, 602, 603, 622, 583, 604, 625,
606, 627, 607, 608, 184, 609, 610, 184, 611, 612,
628, 613, 615, 616, 617, 618, 619, 620, 621, 629,
630, 631, 622, 632, 633, 625, 634, 627, 635, 636,
637, 639, 127, 127, 127, 127, 628, 641, 127, 266,
643, 1001, 127, 647, 648, 629, 630, 631, 642, 632,
633, 640, 634, 644, 635, 636, 637, 639, 127, 645,
650, 127, 127, 641, 127, 127, 127, 649, 127, 647,
648, 127, 660, 652, 642, 127, 127, 640, 655, 644,
651, 653, 656, 677, 127, 645, 650, 127, 662, 664,
666, 127, 665, 649, 663, 127, 127, 127, 660, 652,
670, 127, 127, 669, 655, 676, 651, 653, 656, 677,
667, 678, 679, 680, 662, 664, 666, 681, 665, 671,
663, 682, 683, 684, 685, 673, 670, 686, 687, 669,
688, 676, 689, 690, 691, 711, 667, 678, 679, 680,
1045, 184, 712, 681, 713, 671, 717, 682, 683, 684,
685, 673, 184, 686, 687, 692, 688, 1037, 689, 690,
691, 711, 184, 184, 1035, 718, 696, 184, 712, 266,
713, 1004, 717, 184, 698, 1034, 184, 184, 184, 184,
719, 692, 693, 184, 266, 720, 1006, 697, 184, 184,
184, 718, 696, 184, 184, 694, 184, 184, 722, 184,
698, 695, 184, 184, 184, 184, 719, 184, 723, 184,
184, 720, 700, 697, 1032, 184, 184, 699, 184, 184,
184, 694, 184, 184, 722, 1030, 184, 695, 184, 701,
184, 726, 782, 184, 723, 782, 184, 184, 700, 184,
184, 184, 184, 699, 184, 184, 702, 184, 727, 703,
728, 704, 184, 184, 184, 701, 184, 726, 184, 184,
729, 184, 730, 184, 184, 184, 184, 705, 184, 947,
945, 184, 702, 184, 727, 703, 728, 704, 184, 184,
706, 944, 184, 184, 184, 184, 729, 184, 730, 184,
184, 942, 184, 705, 184, 708, 184, 184, 693, 707,
732, 733, 734, 735, 184, 736, 706, 184, 737, 184,
184, 714, 940, 742, 743, 184, 744, 715, 184, 738,
184, 745, 184, 184, 746, 707, 732, 733, 734, 735,
747, 736, 739, 184, 737, 748, 184, 714, 740, 742,
743, 749, 744, 715, 751, 752, 753, 745, 754, 755,
746, 756, 757, 758, 759, 761, 747, 763, 739, 127,
266, 748, 1007, 127, 740, 127, 127, 749, 768, 127,
751, 752, 753, 765, 754, 755, 127, 756, 757, 758,
759, 761, 766, 763, 127, 772, 769, 127, 127, 127,
127, 127, 780, 1012, 768, 773, 777, 776, 127, 765,
774, 1005, 781, 784, 785, 775, 784, 916, 766, 778,
916, 772, 769, 783, 783, 783, 783, 999, 780, 127,
127, 773, 777, 776, 788, 789, 774, 127, 781, 127,
790, 775, 127, 791, 127, 778, 787, 787, 787, 787,
794, 794, 794, 794, 127, 127, 793, 127, 127, 803,
788, 789, 792, 806, 802, 807, 790, 693, 808, 791,
809, 810, 811, 796, 799, 801, 801, 801, 801, 797,
804, 812, 793, 813, 814, 803, 805, 815, 792, 806,
802, 807, 816, 817, 808, 998, 809, 810, 811, 796,
799, 266, 997, 1008, 837, 797, 804, 812, 839, 813,
814, 184, 805, 815, 989, 184, 840, 184, 816, 817,
841, 820, 184, 844, 184, 184, 184, 818, 184, 184,
837, 184, 987, 822, 839, 184, 933, 184, 184, 933,
821, 184, 840, 184, 985, 983, 841, 820, 184, 844,
184, 184, 184, 818, 184, 184, 184, 184, 184, 822,
845, 184, 824, 184, 184, 825, 821, 184, 846, 184,
184, 823, 184, 847, 184, 849, 184, 184, 850, 826,
842, 843, 184, 842, 184, 982, 845, 184, 824, 184,
184, 825, 981, 184, 846, 184, 184, 823, 184, 847,
184, 849, 184, 184, 850, 826, 827, 184, 184, 184,
854, 829, 828, 184, 184, 855, 184, 830, 184, 184,
184, 184, 184, 184, 979, 184, 852, 853, 184, 852,
856, 904, 857, 184, 184, 184, 854, 829, 828, 184,
184, 855, 977, 830, 184, 184, 184, 184, 184, 184,
184, 184, 831, 184, 184, 184, 856, 184, 857, 858,
858, 858, 858, 860, 861, 184, 184, 862, 184, 184,
863, 184, 864, 832, 865, 866, 184, 868, 831, 184,
833, 184, 869, 184, 867, 771, 870, 867, 871, 860,
861, 872, 184, 862, 184, 184, 863, 184, 864, 832,
865, 866, 873, 868, 874, 875, 833, 878, 869, 879,
876, 785, 870, 876, 871, 880, 881, 872, 882, 883,
884, 885, 886, 887, 127, 127, 770, 771, 873, 770,
874, 875, 127, 878, 890, 879, 266, 127, 1011, 918,
127, 880, 881, 889, 882, 883, 884, 885, 886, 887,
127, 892, 127, 127, 127, 893, 896, 127, 898, 127,
890, 894, 127, 895, 900, 918, 897, 902, 919, 889,
899, 783, 783, 783, 783, 784, 785, 892, 784, 127,
947, 893, 896, 905, 898, 127, 127, 894, 948, 895,
900, 948, 897, 902, 919, 912, 899, 787, 787, 787,
787, 920, 921, 922, 907, 794, 794, 794, 794, 905,
914, 914, 914, 914, 127, 801, 801, 801, 801, 915,
923, 912, 924, 925, 926, 927, 928, 920, 921, 922,
907, 929, 930, 931, 949, 843, 963, 949, 950, 853,
266, 950, 1013, 951, 960, 915, 923, 960, 924, 925,
926, 927, 928, 184, 184, 953, 954, 929, 930, 931,
955, 932, 184, 184, 184, 184, 935, 184, 184, 951,
936, 945, 934, 184, 184, 944, 184, 184, 956, 184,
184, 953, 954, 266, 957, 1065, 955, 932, 184, 184,
184, 184, 935, 184, 184, 184, 936, 184, 934, 184,
184, 184, 184, 184, 956, 939, 184, 942, 184, 184,
957, 184, 184, 937, 938, 184, 853, 940, 940, 184,
958, 184, 843, 184, 959, 842, 843, 184, 842, 952,
184, 939, 184, 184, 184, 184, 941, 184, 184, 937,
938, 184, 942, 184, 184, 184, 958, 961, 944, 184,
959, 962, 945, 184, 184, 184, 184, 184, 184, 184,
184, 827, 943, 184, 184, 851, 917, 184, 851, 184,
184, 852, 853, 961, 852, 184, 964, 962, 965, 184,
184, 184, 913, 184, 184, 966, 184, 184, 943, 184,
184, 947, 184, 184, 967, 946, 968, 969, 184, 970,
971, 184, 964, 184, 965, 972, 184, 858, 858, 858,
858, 966, 973, 184, 867, 771, 974, 867, 184, 975,
967, 946, 968, 969, 184, 970, 971, 184, 976, 184,
978, 972, 184, 876, 785, 980, 876, 984, 973, 986,
988, 127, 974, 988, 891, 975, 990, 891, 127, 127,
127, 127, 127, 992, 976, 127, 978, 991, 910, 995,
127, 980, 909, 984, 127, 986, 993, 994, 901, 127,
996, 901, 990, 1000, 1002, 916, 1003, 1002, 916, 992,
908, 1014, 1015, 991, 1010, 995, 1009, 1009, 1009, 1009,
1016, 1017, 993, 994, 1018, 1019, 996, 1020, 1021, 1000,
1022, 906, 1003, 914, 914, 914, 914, 1014, 1015, 933,
1010, 184, 933, 785, 903, 1023, 1016, 1017, 1038, 1040,
1018, 1019, 184, 1020, 1021, 184, 1022, 1031, 184, 184,
1031, 948, 771, 1025, 948, 1024, 184, 184, 184, 184,
184, 1023, 184, 184, 1038, 1040, 1027, 184, 184, 184,
1026, 184, 184, 1039, 184, 184, 1039, 949, 843, 1025,
949, 1024, 184, 800, 184, 184, 184, 798, 184, 184,
1028, 184, 1027, 184, 1041, 184, 1026, 184, 184, 184,
1033, 184, 184, 950, 853, 184, 950, 1042, 184, 1029,
184, 184, 184, 1036, 1043, 184, 1044, 184, 960, 1046,
1041, 960, 877, 184, 1048, 184, 1051, 184, 184, 1052,
1053, 184, 1054, 1042, 184, 1029, 184, 184, 184, 1036,
1043, 184, 1044, 1055, 1056, 1046, 1047, 1047, 1047, 1047,
1048, 1057, 1051, 1060, 1061, 1052, 1053, 1063, 1054, 988,
127, 127, 988, 127, 1088, 767, 127, 1069, 127, 1055,
1056, 127, 266, 266, 1073, 1074, 1067, 1057, 1066, 1060,
1061, 1071, 1070, 1063, 266, 1072, 1075, 127, 1077, 127,
1088, 1077, 1076, 1069, 1002, 859, 1079, 1002, 1078, 1079,
1089, 266, 1067, 1080, 1066, 827, 1081, 1071, 1070, 1081,
1090, 1072, 1082, 1082, 1082, 1082, 1083, 127, 1076, 1083,
1009, 1009, 1009, 1009, 1078, 1085, 1089, 266, 1085, 1086,
1091, 1084, 1087, 1087, 1087, 1087, 1090, 1092, 1093, 1094,
184, 184, 1102, 1031, 848, 1102, 1031, 1097, 184, 838,
1103, 184, 184, 1103, 1096, 184, 1091, 1084, 1095, 184,
836, 184, 184, 1092, 1093, 1094, 184, 184, 184, 835,
1105, 1098, 184, 1105, 184, 1099, 834, 184, 184, 184,
1096, 184, 184, 1106, 1095, 184, 1106, 184, 184, 184,
1110, 1111, 1108, 1101, 184, 1108, 184, 1098, 184, 1039,
184, 1099, 1039, 184, 1112, 184, 1113, 184, 184, 1107,
184, 1115, 266, 819, 1132, 184, 1110, 1111, 1116, 1101,
1118, 1119, 184, 1121, 1122, 1123, 184, 1124, 1125, 184,
1112, 1126, 1113, 184, 1127, 1107, 184, 1115, 1047, 1047,
1047, 1047, 1129, 127, 1116, 1129, 1118, 1119, 127, 1121,
1122, 1123, 1131, 1124, 1125, 1134, 127, 1126, 127, 708,
1127, 1137, 1137, 1137, 1137, 1138, 1138, 1138, 1138, 127,
1135, 1139, 1139, 1139, 1139, 1146, 1077, 1140, 1131, 1077,
1079, 1134, 1142, 1079, 1147, 1142, 1081, 1141, 1148, 1081,
1082, 1082, 1082, 1082, 1083, 1085, 1135, 1083, 1085, 1144,
1145, 1146, 1144, 1140, 1087, 1087, 1087, 1087, 1149, 1150,
1147, 1151, 184, 1141, 1148, 1152, 184, 184, 795, 1162,
1153, 1155, 184, 184, 786, 1156, 184, 184, 184, 1102,
184, 184, 1102, 184, 1149, 1150, 184, 1151, 184, 764,
675, 1103, 184, 184, 1103, 1162, 1153, 1159, 184, 184,
1159, 1156, 184, 184, 184, 1163, 184, 184, 184, 184,
1165, 1169, 184, 1157, 1157, 1157, 1157, 1105, 1106, 184,
1105, 1106, 184, 1160, 184, 1108, 1158, 1171, 1108, 1166,
1167, 1163, 1166, 1172, 184, 184, 1165, 1169, 184, 1164,
1164, 1164, 1164, 1174, 1175, 184, 1177, 1145, 184, 1177,
184, 1129, 1158, 1171, 1129, 266, 127, 1178, 762, 1172,
1180, 184, 127, 1180, 184, 266, 266, 1181, 1184, 1174,
1175, 1182, 127, 1188, 1179, 1137, 1137, 1137, 1137, 1138,
1138, 1138, 1138, 1139, 1139, 1139, 1139, 127, 266, 1142,
1187, 1186, 1142, 1144, 1145, 1185, 1144, 1182, 1189, 1188,
1179, 1190, 184, 1193, 1159, 760, 1193, 1159, 1195, 184,
661, 184, 1199, 184, 1200, 1201, 184, 1186, 1196, 1192,
184, 1185, 184, 184, 1189, 184, 750, 1190, 184, 1157,
1157, 1157, 1157, 1198, 1167, 184, 1198, 184, 1199, 184,
1200, 1201, 184, 1202, 1196, 1192, 184, 1204, 184, 184,
1205, 184, 1164, 1164, 1164, 1164, 1166, 1167, 658, 1166,
1177, 1145, 1206, 1177, 1180, 1206, 127, 1180, 1208, 1202,
266, 1208, 1210, 1204, 127, 1215, 1205, 1211, 1211, 1211,
1211, 1216, 1214, 1217, 1209, 1214, 1217, 1218, 184, 1212,
1193, 1219, 184, 1193, 1219, 1222, 1223, 1225, 1222, 184,
1226, 1215, 184, 184, 741, 708, 1221, 1216, 1198, 1167,
1209, 1198, 127, 1206, 184, 1212, 1206, 266, 184, 1228,
1233, 1208, 1223, 1225, 1208, 184, 1226, 1214, 184, 184,
1214, 1229, 1221, 1230, 1230, 1230, 1230, 1211, 1211, 1211,
1211, 127, 266, 1237, 1232, 1231, 1233, 1217, 1219, 1238,
1217, 1219, 1235, 1235, 1235, 1235, 184, 1229, 1222, 1236,
1239, 1222, 1240, 1240, 1240, 1240, 127, 184, 1244, 1237,
184, 1231, 266, 731, 1250, 1238, 1230, 1230, 1230, 1230,
725, 1247, 184, 724, 1242, 1236, 1239, 1243, 1243, 1243,
1243, 1249, 1252, 184, 1244, 184, 184, 1245, 1245, 1245,
1245, 1235, 1235, 1235, 1235, 721, 184, 1247, 716, 184,
1242, 710, 1246, 1240, 1240, 1240, 1240, 1249, 1252, 1253,
184, 184, 1243, 1243, 1243, 1243, 1245, 1245, 1245, 1245,
709, 184, 184, 674, 184, 184, 672, 654, 1246, 1255,
1255, 1255, 1255, 266, 638, 1256, 184, 1255, 1255, 1255,
1255, 1258, 1258, 1258, 1258, 626, 624, 184, 623, 614,
184, 1259, 1259, 1259, 1259, 1258, 1258, 1258, 1258, 1259,
1259, 1259, 1259, 44, 44, 44, 44, 44, 44, 44,
44, 44, 128, 128, 162, 605, 599, 162, 162, 162,
598, 162, 169, 169, 590, 169, 552, 169, 545, 169,
184, 184, 538, 184, 536, 184, 535, 184, 239, 239,
239, 534, 239, 239, 239, 239, 239, 240, 523, 240,
518, 431, 395, 518, 365, 518, 364, 518, 518, 233,
336, 183, 307, 306, 304, 303, 302, 127, 266, 161,
126, 124, 233, 198, 183, 159, 161, 127, 126, 124,
1260, 17, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260
} ;
static yyconst flex_int16_t yy_chk[4029] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 3, 3, 3, 3,
3, 3, 33, 24, 3, 3, 24, 33, 3, 3,
13, 13, 13, 13, 14, 14, 14, 14, 20, 20,
20, 20, 1254, 13, 22, 22, 1253, 14, 22, 22,
31, 20, 22, 33, 3, 4, 4, 4, 4, 4,
4, 26, 1252, 4, 4, 31, 30, 4, 4, 21,
21, 21, 21, 28, 28, 26, 1249, 58, 26, 30,
58, 29, 21, 34, 1248, 28, 29, 76, 28, 30,
29, 31, 34, 4, 5, 5, 5, 5, 5, 5,
28, 26, 5, 5, 26, 30, 5, 5, 32, 37,
36, 28, 29, 76, 28, 30, 29, 95, 34, 95,
95, 32, 32, 35, 35, 36, 37, 78, 35, 77,
36, 1247, 5, 6, 6, 6, 6, 6, 6, 38,
77, 6, 6, 77, 38, 6, 6, 32, 32, 1242,
35, 36, 37, 78, 35, 77, 36, 48, 48, 1238,
98, 48, 48, 98, 103, 48, 77, 103, 1229, 77,
38, 6, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
7, 7, 7, 7, 7, 7, 7, 7, 9, 9,
9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
9, 9, 9, 9, 11, 11, 11, 11, 1227, 1224,
40, 40, 41, 41, 79, 40, 81, 11, 11, 40,
11, 11, 11, 82, 79, 84, 11, 40, 11, 11,
11, 80, 80, 11, 11, 11, 11, 40, 1218, 41,
79, 40, 81, 1215, 11, 40, 11, 11, 11, 82,
79, 84, 11, 40, 11, 11, 11, 80, 80, 11,
11, 11, 11, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 19,
19, 19, 19, 42, 1205, 19, 85, 105, 125, 19,
42, 125, 19, 19, 108, 19, 19, 19, 19, 109,
110, 19, 1203, 19, 19, 19, 19, 1201, 19, 19,
19, 19, 85, 105, 19, 45, 45, 45, 45, 19,
108, 19, 19, 19, 19, 109, 110, 19, 45, 19,
19, 19, 19, 39, 19, 19, 19, 19, 39, 171,
19, 42, 171, 19, 46, 46, 46, 46, 39, 111,
1199, 63, 39, 39, 523, 63, 523, 46, 47, 47,
47, 47, 63, 1195, 39, 63, 112, 51, 51, 51,
51, 47, 83, 64, 39, 111, 83, 63, 39, 39,
51, 63, 87, 1189, 64, 115, 87, 64, 63, 66,
1186, 63, 112, 66, 93, 64, 93, 93, 83, 64,
66, 116, 83, 66, 93, 51, 55, 1179, 87, 55,
64, 115, 87, 64, 1176, 66, 55, 119, 1173, 66,
65, 64, 55, 55, 55, 1172, 66, 116, 55, 66,
55, 65, 55, 65, 65, 55, 55, 55, 55, 88,
88, 88, 88, 119, 96, 1170, 65, 96, 55, 55,
55, 96, 88, 173, 55, 1168, 55, 65, 55, 65,
65, 55, 55, 55, 55, 61, 61, 135, 1167, 61,
61, 61, 61, 61, 61, 61, 67, 61, 61, 173,
67, 68, 69, 114, 86, 135, 69, 67, 114, 106,
67, 1163, 68, 69, 86, 68, 69, 68, 86, 86,
106, 174, 67, 106, 96, 61, 67, 68, 69, 114,
86, 135, 69, 67, 114, 106, 67, 136, 68, 69,
86, 68, 69, 68, 86, 86, 106, 174, 1160, 106,
61, 62, 62, 136, 1155, 62, 62, 62, 62, 62,
62, 62, 71, 62, 62, 1152, 62, 107, 130, 129,
71, 107, 129, 71, 113, 130, 71, 62, 113, 136,
62, 89, 89, 89, 89, 534, 182, 534, 71, 182,
1151, 62, 62, 107, 89, 141, 71, 107, 129, 71,
113, 130, 71, 62, 113, 1148, 62, 91, 91, 91,
91, 101, 101, 101, 101, 117, 62, 70, 118, 141,
91, 70, 118, 131, 101, 153, 118, 153, 70, 175,
117, 70, 132, 132, 118, 1146, 70, 121, 121, 121,
121, 117, 131, 70, 118, 141, 1145, 70, 118, 535,
121, 535, 118, 153, 70, 175, 117, 70, 1135, 132,
118, 133, 70, 74, 657, 133, 74, 657, 131, 122,
122, 122, 122, 124, 124, 124, 124, 133, 1127, 74,
74, 74, 122, 1124, 134, 74, 536, 74, 536, 74,
134, 133, 74, 74, 74, 74, 123, 123, 137, 137,
123, 123, 134, 133, 123, 74, 74, 74, 138, 139,
139, 74, 140, 74, 143, 74, 134, 142, 74, 74,
74, 74, 144, 138, 145, 137, 146, 176, 134, 147,
140, 142, 1121, 143, 154, 142, 139, 149, 147, 146,
149, 144, 150, 145, 1120, 151, 154, 156, 150, 138,
1118, 148, 156, 176, 155, 148, 140, 142, 152, 143,
152, 142, 151, 148, 147, 146, 149, 144, 157, 145,
148, 152, 154, 155, 150, 164, 164, 1116, 156, 164,
164, 148, 177, 164, 178, 157, 152, 1112, 151, 148,
161, 161, 161, 161, 1110, 1109, 148, 152, 172, 155,
163, 163, 163, 163, 165, 165, 165, 165, 177, 172,
178, 157, 172, 163, 179, 180, 1097, 165, 166, 166,
166, 166, 181, 184, 172, 185, 201, 1090, 202, 203,
180, 166, 204, 186, 184, 172, 185, 184, 172, 185,
179, 180, 165, 185, 186, 1084, 1072, 186, 181, 184,
206, 185, 201, 187, 202, 203, 180, 207, 204, 186,
184, 188, 185, 184, 187, 185, 189, 187, 187, 185,
186, 190, 188, 186, 208, 188, 206, 189, 188, 187,
189, 1069, 190, 207, 538, 190, 538, 188, 190, 208,
187, 192, 189, 187, 187, 205, 191, 190, 188, 205,
208, 188, 192, 189, 188, 192, 189, 191, 190, 192,
191, 190, 193, 194, 190, 208, 194, 192, 1066, 191,
193, 205, 191, 193, 194, 205, 193, 194, 192, 197,
195, 192, 195, 191, 1064, 192, 191, 200, 193, 194,
197, 195, 194, 197, 195, 191, 193, 197, 200, 193,
194, 200, 193, 194, 210, 197, 195, 545, 195, 545,
209, 211, 212, 200, 209, 1062, 197, 195, 214, 197,
195, 196, 196, 197, 200, 215, 216, 200, 217, 213,
210, 218, 196, 196, 219, 196, 209, 211, 212, 220,
209, 213, 221, 222, 214, 223, 225, 196, 196, 226,
227, 215, 216, 229, 217, 213, 224, 218, 196, 196,
219, 196, 228, 230, 224, 220, 1059, 213, 221, 222,
1058, 223, 225, 228, 724, 226, 227, 724, 237, 229,
237, 237, 224, 231, 231, 231, 231, 241, 228, 230,
224, 234, 234, 234, 234, 236, 231, 236, 236, 228,
238, 242, 243, 238, 234, 236, 244, 238, 245, 246,
247, 248, 249, 241, 250, 251, 252, 253, 244, 254,
245, 255, 256, 552, 258, 552, 260, 242, 243, 261,
262, 1053, 244, 263, 245, 246, 247, 248, 249, 264,
250, 251, 252, 253, 244, 254, 245, 255, 256, 257,
258, 259, 260, 267, 268, 261, 262, 257, 269, 263,
238, 267, 259, 269, 257, 264, 265, 265, 265, 265,
272, 271, 273, 270, 268, 257, 271, 259, 276, 274,
277, 273, 274, 257, 278, 1050, 276, 267, 259, 269,
257, 270, 275, 277, 272, 275, 280, 279, 282, 283,
268, 281, 271, 278, 279, 284, 285, 273, 274, 282,
288, 286, 276, 284, 285, 280, 286, 270, 283, 277,
272, 275, 287, 281, 287, 289, 290, 290, 291, 278,
279, 288, 292, 293, 289, 282, 295, 1049, 1045, 284,
285, 280, 286, 294, 283, 643, 296, 643, 291, 281,
287, 292, 293, 290, 295, 297, 298, 288, 294, 296,
289, 298, 301, 299, 300, 308, 309, 297, 310, 300,
305, 305, 305, 305, 291, 299, 301, 292, 293, 311,
295, 312, 313, 314, 294, 296, 315, 298, 316, 317,
318, 308, 309, 297, 310, 300, 320, 317, 654, 319,
654, 299, 301, 646, 646, 311, 646, 312, 313, 314,
319, 1042, 315, 321, 316, 317, 318, 321, 322, 323,
338, 339, 320, 317, 321, 319, 324, 321, 324, 322,
323, 340, 322, 323, 1038, 322, 319, 324, 1033, 321,
324, 341, 323, 321, 322, 323, 338, 339, 1028, 1021,
321, 326, 324, 321, 324, 322, 323, 340, 322, 323,
325, 322, 326, 324, 327, 326, 324, 341, 323, 326,
1019, 325, 325, 328, 325, 327, 992, 326, 327, 342,
328, 672, 329, 672, 328, 327, 325, 328, 326, 987,
327, 326, 674, 329, 674, 326, 329, 325, 325, 328,
325, 327, 329, 331, 327, 342, 328, 330, 329, 332,
328, 327, 343, 328, 331, 330, 986, 331, 330, 329,
332, 330, 329, 332, 985, 333, 344, 332, 329, 331,
983, 767, 345, 330, 767, 332, 333, 346, 343, 333,
331, 330, 333, 331, 330, 334, 332, 330, 337, 332,
335, 333, 344, 332, 347, 348, 334, 334, 345, 334,
337, 335, 333, 346, 335, 333, 349, 350, 333, 351,
352, 334, 353, 354, 337, 355, 335, 356, 357, 358,
347, 348, 334, 334, 359, 334, 337, 335, 360, 361,
335, 362, 349, 350, 363, 351, 352, 366, 353, 354,
367, 355, 368, 356, 357, 358, 369, 370, 371, 372,
359, 373, 374, 375, 360, 361, 376, 362, 377, 378,
363, 379, 380, 366, 381, 382, 367, 383, 368, 384,
385, 386, 369, 370, 371, 372, 387, 373, 374, 375,
388, 389, 376, 390, 377, 378, 391, 379, 380, 392,
381, 382, 393, 383, 394, 384, 385, 386, 396, 399,
406, 397, 387, 398, 404, 402, 388, 389, 401, 390,
398, 403, 391, 396, 397, 392, 406, 399, 393, 402,
394, 401, 405, 405, 404, 408, 982, 407, 403, 410,
408, 409, 409, 414, 417, 417, 398, 981, 418, 396,
397, 407, 406, 399, 410, 402, 416, 401, 414, 405,
404, 416, 419, 421, 403, 418, 408, 430, 409, 420,
424, 417, 421, 427, 423, 424, 430, 407, 425, 425,
410, 419, 432, 433, 414, 426, 420, 416, 423, 428,
426, 418, 427, 434, 428, 435, 436, 437, 421, 438,
439, 424, 430, 440, 441, 425, 442, 419, 432, 433,
443, 444, 420, 445, 423, 446, 426, 462, 427, 434,
428, 435, 436, 437, 779, 438, 439, 779, 980, 440,
441, 463, 442, 448, 447, 450, 443, 444, 464, 445,
447, 446, 449, 462, 448, 447, 450, 448, 447, 450,
448, 450, 979, 449, 449, 465, 449, 463, 977, 448,
447, 450, 466, 764, 464, 764, 447, 786, 449, 786,
448, 447, 450, 448, 447, 450, 448, 450, 451, 449,
449, 465, 449, 452, 453, 454, 467, 469, 466, 451,
975, 455, 451, 451, 452, 453, 454, 452, 453, 454,
974, 966, 455, 470, 451, 455, 795, 471, 795, 452,
453, 454, 467, 469, 965, 451, 456, 455, 451, 451,
452, 453, 454, 452, 453, 454, 457, 456, 455, 470,
456, 455, 456, 471, 459, 458, 460, 457, 459, 472,
457, 473, 456, 458, 457, 459, 458, 460, 459, 458,
460, 962, 457, 456, 474, 959, 456, 475, 456, 478,
459, 458, 460, 457, 459, 472, 457, 473, 479, 458,
457, 459, 458, 460, 459, 458, 460, 461, 480, 481,
474, 461, 482, 475, 484, 478, 485, 486, 461, 487,
488, 461, 489, 490, 479, 491, 493, 494, 495, 496,
497, 498, 499, 461, 480, 481, 500, 461, 482, 503,
484, 505, 485, 486, 461, 487, 488, 461, 489, 490,
506, 491, 493, 494, 495, 496, 497, 498, 499, 507,
508, 509, 500, 510, 511, 503, 512, 505, 513, 514,
515, 517, 520, 521, 519, 525, 506, 520, 524, 903,
522, 903, 527, 524, 525, 507, 508, 509, 521, 510,
511, 519, 512, 522, 513, 514, 515, 517, 526, 522,
527, 529, 528, 520, 532, 533, 530, 526, 537, 524,
525, 539, 537, 529, 521, 540, 543, 519, 532, 522,
528, 530, 533, 554, 541, 522, 527, 542, 539, 541,
543, 553, 542, 526, 540, 544, 546, 547, 537, 529,
547, 550, 548, 546, 532, 553, 528, 530, 533, 554,
544, 555, 556, 557, 539, 541, 543, 558, 542, 548,
540, 559, 560, 561, 562, 550, 547, 563, 564, 546,
565, 553, 566, 567, 568, 586, 544, 555, 556, 557,
958, 569, 587, 558, 588, 548, 591, 559, 560, 561,
562, 550, 569, 563, 564, 569, 565, 947, 566, 567,
568, 586, 571, 573, 945, 592, 571, 569, 587, 906,
588, 906, 591, 571, 573, 944, 571, 573, 569, 572,
593, 569, 570, 570, 908, 594, 908, 572, 571, 573,
572, 592, 571, 572, 570, 570, 575, 570, 596, 571,
573, 570, 571, 573, 574, 572, 593, 575, 597, 570,
575, 594, 575, 572, 942, 574, 572, 574, 574, 572,
570, 570, 575, 570, 596, 940, 576, 570, 577, 576,
574, 600, 782, 575, 597, 782, 575, 576, 575, 577,
576, 574, 577, 574, 574, 578, 577, 579, 601, 578,
602, 579, 576, 580, 577, 576, 578, 600, 579, 578,
603, 579, 604, 576, 580, 577, 576, 580, 577, 931,
929, 578, 577, 579, 601, 578, 602, 579, 581, 580,
581, 928, 578, 582, 579, 578, 603, 579, 604, 581,
580, 926, 581, 580, 582, 583, 583, 582, 589, 582,
606, 607, 608, 609, 581, 611, 581, 583, 612, 582,
583, 589, 925, 615, 616, 581, 617, 589, 581, 613,
582, 618, 583, 582, 619, 582, 606, 607, 608, 609,
620, 611, 613, 583, 612, 621, 583, 589, 613, 615,
616, 622, 617, 589, 625, 627, 628, 618, 629, 630,
619, 631, 632, 633, 634, 636, 620, 639, 613, 641,
909, 621, 909, 644, 613, 642, 647, 622, 644, 645,
625, 627, 628, 641, 629, 630, 648, 631, 632, 633,
634, 636, 642, 639, 649, 647, 645, 650, 651, 655,
653, 652, 655, 915, 644, 648, 652, 651, 656, 641,
649, 907, 656, 659, 659, 650, 659, 800, 642, 653,
800, 647, 645, 658, 658, 658, 658, 900, 655, 662,
663, 648, 652, 651, 662, 663, 649, 664, 656, 665,
664, 650, 667, 665, 666, 653, 661, 661, 661, 661,
668, 668, 668, 668, 670, 671, 667, 676, 673, 677,
662, 663, 666, 679, 676, 680, 664, 678, 681, 665,
682, 683, 684, 670, 673, 675, 675, 675, 675, 671,
678, 685, 667, 686, 687, 677, 678, 688, 666, 679,
676, 680, 689, 690, 681, 899, 682, 683, 684, 670,
673, 910, 898, 910, 711, 671, 678, 685, 713, 686,
687, 692, 678, 688, 889, 696, 714, 694, 689, 690,
715, 694, 692, 717, 695, 692, 696, 692, 694, 696,
711, 694, 887, 696, 713, 695, 819, 692, 695, 819,
695, 696, 714, 694, 885, 883, 715, 694, 692, 717,
695, 692, 696, 692, 694, 696, 697, 694, 698, 696,
718, 695, 698, 699, 695, 699, 695, 697, 719, 698,
697, 697, 698, 720, 699, 722, 700, 699, 723, 700,
716, 716, 697, 716, 698, 882, 718, 700, 698, 699,
700, 699, 881, 697, 719, 698, 697, 697, 698, 720,
699, 722, 700, 699, 723, 700, 701, 701, 702, 703,
727, 703, 702, 700, 704, 728, 700, 704, 701, 702,
703, 701, 702, 703, 879, 704, 725, 725, 704, 725,
729, 877, 730, 701, 702, 703, 727, 703, 702, 705,
704, 728, 875, 704, 701, 702, 703, 701, 702, 703,
705, 704, 705, 705, 704, 706, 729, 707, 730, 731,
731, 731, 731, 733, 734, 705, 706, 735, 707, 706,
736, 707, 737, 706, 739, 740, 705, 742, 705, 705,
707, 706, 743, 707, 741, 741, 744, 741, 745, 733,
734, 746, 706, 735, 707, 706, 736, 707, 737, 706,
739, 740, 747, 742, 748, 749, 707, 752, 743, 753,
750, 750, 744, 750, 745, 754, 755, 746, 756, 757,
758, 759, 761, 763, 765, 766, 770, 770, 747, 770,
748, 749, 768, 752, 766, 753, 913, 774, 913, 803,
776, 754, 755, 765, 756, 757, 758, 759, 761, 763,
769, 768, 777, 772, 773, 769, 774, 775, 776, 778,
766, 772, 780, 773, 778, 803, 775, 780, 804, 765,
777, 783, 783, 783, 783, 784, 784, 768, 784, 788,
861, 769, 774, 788, 776, 790, 796, 772, 834, 773,
778, 834, 775, 780, 804, 796, 777, 787, 787, 787,
787, 805, 806, 807, 790, 794, 794, 794, 794, 788,
798, 798, 798, 798, 799, 801, 801, 801, 801, 799,
808, 796, 809, 810, 812, 813, 814, 805, 806, 807,
790, 815, 816, 817, 835, 835, 859, 835, 836, 836,
917, 836, 917, 837, 848, 799, 808, 848, 809, 810,
812, 813, 814, 818, 820, 839, 840, 815, 816, 817,
841, 818, 821, 822, 818, 820, 821, 818, 820, 837,
822, 857, 820, 821, 822, 856, 821, 822, 844, 818,
820, 839, 840, 989, 845, 989, 841, 818, 821, 822,
818, 820, 821, 818, 820, 823, 822, 824, 820, 821,
822, 825, 821, 822, 844, 825, 823, 854, 824, 823,
845, 824, 825, 823, 824, 825, 853, 850, 826, 826,
846, 823, 843, 824, 847, 842, 842, 825, 842, 838,
826, 825, 823, 826, 824, 823, 827, 824, 825, 823,
824, 825, 828, 828, 829, 826, 846, 849, 830, 830,
847, 855, 831, 831, 828, 829, 826, 828, 829, 826,
830, 811, 829, 830, 831, 851, 802, 831, 851, 828,
829, 852, 852, 849, 852, 830, 860, 855, 862, 831,
828, 829, 797, 828, 829, 863, 830, 832, 829, 830,
831, 833, 833, 831, 864, 832, 865, 866, 832, 868,
869, 832, 860, 833, 862, 870, 833, 858, 858, 858,
858, 863, 871, 832, 867, 867, 872, 867, 833, 873,
864, 832, 865, 866, 832, 868, 869, 832, 874, 833,
878, 870, 833, 876, 876, 880, 876, 884, 871, 886,
888, 890, 872, 888, 891, 873, 890, 891, 893, 892,
896, 894, 895, 893, 874, 897, 878, 892, 793, 896,
902, 880, 792, 884, 905, 886, 894, 895, 901, 912,
897, 901, 890, 902, 904, 916, 905, 904, 916, 893,
791, 918, 919, 892, 912, 896, 911, 911, 911, 911,
920, 921, 894, 895, 922, 923, 897, 924, 927, 902,
930, 789, 905, 914, 914, 914, 914, 918, 919, 933,
912, 932, 933, 785, 781, 932, 920, 921, 951, 953,
922, 923, 932, 924, 927, 932, 930, 941, 934, 935,
941, 948, 771, 935, 948, 934, 936, 932, 937, 934,
935, 932, 934, 935, 951, 953, 937, 936, 932, 937,
936, 932, 937, 952, 934, 935, 952, 949, 949, 935,
949, 934, 936, 762, 937, 934, 935, 760, 934, 935,
938, 938, 937, 936, 954, 937, 936, 939, 937, 946,
943, 943, 938, 950, 950, 938, 950, 955, 939, 939,
946, 939, 943, 946, 956, 943, 957, 938, 960, 961,
954, 960, 751, 939, 964, 946, 967, 943, 938, 968,
969, 938, 970, 955, 939, 939, 946, 939, 943, 946,
956, 943, 957, 971, 972, 961, 963, 963, 963, 963,
964, 973, 967, 976, 978, 968, 969, 984, 970, 988,
990, 991, 988, 993, 1014, 738, 995, 993, 994, 971,
972, 996, 997, 998, 997, 998, 991, 973, 990, 976,
978, 995, 994, 984, 999, 996, 999, 1000, 1001, 1003,
1014, 1001, 1000, 993, 1002, 732, 1004, 1002, 1003, 1004,
1015, 1005, 991, 1005, 990, 726, 1006, 995, 994, 1006,
1016, 996, 1007, 1007, 1007, 1007, 1008, 1010, 1000, 1008,
1009, 1009, 1009, 1009, 1003, 1011, 1015, 1012, 1011, 1012,
1017, 1010, 1013, 1013, 1013, 1013, 1016, 1018, 1020, 1022,
1024, 1023, 1030, 1031, 721, 1030, 1031, 1025, 1025, 712,
1032, 1024, 1023, 1032, 1024, 1023, 1017, 1010, 1023, 1025,
710, 1027, 1025, 1018, 1020, 1022, 1024, 1023, 1026, 709,
1034, 1026, 1027, 1034, 1025, 1027, 708, 1024, 1023, 1026,
1024, 1023, 1026, 1035, 1023, 1025, 1035, 1027, 1025, 1029,
1040, 1041, 1037, 1029, 1026, 1037, 1036, 1026, 1027, 1039,
1029, 1027, 1039, 1029, 1043, 1026, 1044, 1036, 1026, 1036,
1036, 1046, 1068, 693, 1068, 1029, 1040, 1041, 1048, 1029,
1051, 1052, 1036, 1054, 1055, 1056, 1029, 1057, 1060, 1029,
1043, 1061, 1044, 1036, 1063, 1036, 1036, 1046, 1047, 1047,
1047, 1047, 1065, 1070, 1048, 1065, 1051, 1052, 1067, 1054,
1055, 1056, 1067, 1057, 1060, 1070, 1071, 1061, 1076, 691,
1063, 1073, 1073, 1073, 1073, 1074, 1074, 1074, 1074, 1078,
1071, 1075, 1075, 1075, 1075, 1088, 1077, 1076, 1067, 1077,
1079, 1070, 1080, 1079, 1089, 1080, 1081, 1078, 1091, 1081,
1082, 1082, 1082, 1082, 1083, 1085, 1071, 1083, 1085, 1086,
1086, 1088, 1086, 1076, 1087, 1087, 1087, 1087, 1092, 1093,
1089, 1094, 1099, 1078, 1091, 1095, 1095, 1096, 669, 1111,
1096, 1098, 1098, 1099, 660, 1099, 1099, 1095, 1096, 1102,
1095, 1096, 1102, 1098, 1092, 1093, 1098, 1094, 1099, 640,
638, 1103, 1095, 1096, 1103, 1111, 1096, 1104, 1098, 1099,
1104, 1099, 1099, 1095, 1096, 1113, 1095, 1096, 1101, 1098,
1115, 1119, 1098, 1100, 1100, 1100, 1100, 1105, 1106, 1101,
1105, 1106, 1101, 1107, 1107, 1108, 1101, 1122, 1108, 1117,
1117, 1113, 1117, 1123, 1101, 1107, 1115, 1119, 1107, 1114,
1114, 1114, 1114, 1125, 1126, 1101, 1128, 1128, 1101, 1128,
1107, 1129, 1101, 1122, 1129, 1130, 1131, 1130, 637, 1123,
1132, 1107, 1134, 1132, 1107, 1133, 1136, 1133, 1136, 1125,
1126, 1134, 1141, 1147, 1131, 1137, 1137, 1137, 1137, 1138,
1138, 1138, 1138, 1139, 1139, 1139, 1139, 1140, 1143, 1142,
1143, 1141, 1142, 1144, 1144, 1140, 1144, 1134, 1149, 1147,
1131, 1150, 1153, 1154, 1159, 635, 1154, 1159, 1156, 1156,
626, 1158, 1162, 1153, 1165, 1169, 1153, 1141, 1158, 1153,
1156, 1140, 1158, 1156, 1149, 1158, 624, 1150, 1153, 1157,
1157, 1157, 1157, 1161, 1161, 1156, 1161, 1158, 1162, 1153,
1165, 1169, 1153, 1171, 1158, 1153, 1156, 1174, 1158, 1156,
1175, 1158, 1164, 1164, 1164, 1164, 1166, 1166, 623, 1166,
1177, 1177, 1178, 1177, 1180, 1178, 1182, 1180, 1181, 1171,
1183, 1181, 1183, 1174, 1185, 1188, 1175, 1184, 1184, 1184,
1184, 1190, 1187, 1191, 1182, 1187, 1191, 1192, 1192, 1185,
1193, 1194, 1196, 1193, 1194, 1197, 1200, 1202, 1197, 1192,
1204, 1188, 1192, 1196, 614, 610, 1196, 1190, 1198, 1198,
1182, 1198, 1209, 1206, 1192, 1185, 1206, 1207, 1196, 1207,
1216, 1208, 1200, 1202, 1208, 1192, 1204, 1214, 1192, 1196,
1214, 1209, 1196, 1210, 1210, 1210, 1210, 1211, 1211, 1211,
1211, 1212, 1213, 1223, 1213, 1212, 1216, 1217, 1219, 1225,
1217, 1219, 1220, 1220, 1220, 1220, 1221, 1209, 1222, 1221,
1226, 1222, 1228, 1228, 1228, 1228, 1231, 1221, 1233, 1223,
1221, 1212, 1241, 605, 1241, 1225, 1230, 1230, 1230, 1230,
599, 1237, 1221, 598, 1231, 1221, 1226, 1232, 1232, 1232,
1232, 1239, 1244, 1221, 1233, 1236, 1221, 1234, 1234, 1234,
1234, 1235, 1235, 1235, 1235, 595, 1236, 1237, 590, 1236,
1231, 585, 1236, 1240, 1240, 1240, 1240, 1239, 1244, 1246,
1246, 1236, 1243, 1243, 1243, 1243, 1245, 1245, 1245, 1245,
584, 1246, 1236, 551, 1246, 1236, 549, 531, 1236, 1250,
1250, 1250, 1250, 1251, 516, 1251, 1246, 1255, 1255, 1255,
1255, 1256, 1256, 1256, 1256, 504, 502, 1246, 501, 492,
1246, 1257, 1257, 1257, 1257, 1258, 1258, 1258, 1258, 1259,
1259, 1259, 1259, 1261, 1261, 1261, 1261, 1261, 1261, 1261,
1261, 1261, 1262, 1262, 1263, 483, 477, 1263, 1263, 1263,
476, 1263, 1264, 1264, 468, 1264, 429, 1264, 422, 1264,
1265, 1265, 415, 1265, 413, 1265, 412, 1265, 1266, 1266,
1266, 411, 1266, 1266, 1266, 1266, 1266, 1267, 400, 1267,
1268, 307, 266, 1268, 239, 1268, 235, 1268, 1268, 232,
198, 183, 168, 167, 160, 159, 158, 128, 127, 120,
104, 102, 90, 72, 59, 49, 43, 27, 25, 23,
17, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260,
1260, 1260, 1260, 1260, 1260, 1260, 1260, 1260
} ;
/* Table of booleans, true if rule could match eol. */
static yyconst flex_int32_t yy_rule_can_match_eol[108] =
{ 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0,
0, 1, 1, 1, 1, 1, 1, 0, };
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
extern int scdoc_flex_debug;
int scdoc_flex_debug = 0;
/* The intent behind this definition is that it'll catch
* any uses of REJECT which flex missed.
*/
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *scdoctext;
#line 1 "SCDoc.l"
#line 2 "SCDoc.l"
/************************************************************************
*
* Copyright 2012 Jonatan Liljedahl
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*
************************************************************************/
#include
#include "SCDoc.h"
#include "SCDoc.tab.hpp"
int scdoc_start_token = 0;
//int colnum;
//#define YY_USER_ACTION { scdoclloc.first_column = colnum; colnum=colnum+scdocleng; scdoclloc.last_column=colnum; if(scdoclloc.first_line!=scdoclineno) colnum=1; scdoclloc.first_line = scdoclloc.last_line = scdoclineno;}
static int method_caller;
#define YY_NO_UNISTD_H 1
#line 1845 "lex.scdoc.cpp"
#define INITIAL 0
#define verbatim 1
#define verbatim2 2
#define metadata 3
#define eat 4
#define eat2 5
#define eat3 6
#define method 7
#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
* down here because we want the user's section 1 to have been scanned first.
* The user has a chance to override it with an option.
*/
#include
#endif
#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif
static int yy_init_globals (void );
/* Accessor methods to globals.
These are made visible to non-reentrant scanners for convenience. */
int scdoclex_destroy (void );
int scdocget_debug (void );
void scdocset_debug (int debug_flag );
YY_EXTRA_TYPE scdocget_extra (void );
void scdocset_extra (YY_EXTRA_TYPE user_defined );
FILE *scdocget_in (void );
void scdocset_in (FILE * in_str );
FILE *scdocget_out (void );
void scdocset_out (FILE * out_str );
int scdocget_leng (void );
char *scdocget_text (void );
int scdocget_lineno (void );
void scdocset_lineno (int line_number );
/* Macros after this point can all be overridden by user definitions in
* section 1.
*/
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int scdocwrap (void );
#else
extern int scdocwrap (void );
#endif
#endif
static void yyunput (int c,char *buf_ptr );
#ifndef yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int );
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * );
#endif
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void );
#else
static int input (void );
#endif
#endif
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k */
#define YY_READ_BUF_SIZE 16384
#else
#define YY_READ_BUF_SIZE 8192
#endif /* __ia64__ */
#endif
/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
*/
#define ECHO do { if (fwrite( scdoctext, scdocleng, 1, scdocout )) {} } while (0)
#endif
/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
* is returned in "result".
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
int c = '*'; \
size_t n; \
for ( n = 0; n < max_size && \
(c = getc( scdocin )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
if ( c == '\n' ) \
buf[n++] = (char) c; \
if ( c == EOF && ferror( scdocin ) ) \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
else \
{ \
errno=0; \
while ( (result = fread(buf, 1, max_size, scdocin))==0 && ferror(scdocin)) \
{ \
if( errno != EINTR) \
{ \
YY_FATAL_ERROR( "input in flex scanner failed" ); \
break; \
} \
errno=0; \
clearerr(scdocin); \
} \
}\
\
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
* we don't want an extra ';' after the "return" because that will cause
* some compilers to complain about unreachable statements.
*/
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif
/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif
/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
/* end tables serialization structures and prototypes */
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
#define YY_DECL_IS_OURS 1
extern int scdoclex (void);
#define YY_DECL int scdoclex (void)
#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after scdoctext and scdocleng
* 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 \
YY_USER_ACTION
/** The main scanner function which does all the work.
*/
YY_DECL
{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
#line 45 "SCDoc.l"
if (scdoc_start_token) {
int t = scdoc_start_token;
scdoc_start_token = 0;
// colnum = 1;
if(t==START_METADATA) BEGIN(eat);
return t;
}
#line 2054 "lex.scdoc.cpp"
if ( !(yy_init) )
{
(yy_init) = 1;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
if ( ! (yy_start) )
(yy_start) = 1; /* first start state */
if ( ! scdocin )
scdocin = stdin;
if ( ! scdocout )
scdocout = stdout;
if ( ! YY_CURRENT_BUFFER ) {
scdocensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
scdoc_create_buffer(scdocin,YY_BUF_SIZE );
}
scdoc_load_buffer_state( );
}
while ( 1 ) /* loops until end-of-file is reached */
{
yy_cp = (yy_c_buf_p);
/* Support of scdoctext. */
*yy_cp = (yy_hold_char);
/* yy_bp points to the position in yy_ch_buf of the start of
* the current run.
*/
yy_bp = yy_cp;
yy_current_state = (yy_start);
yy_match:
do
{
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 1261 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
++yy_cp;
}
while ( yy_current_state != 1260 );
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
yy_find_action:
yy_act = yy_accept[yy_current_state];
YY_DO_BEFORE_ACTION;
if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] )
{
int yyl;
for ( yyl = 0; yyl < scdocleng; ++yyl )
if ( scdoctext[yyl] == '\n' )
scdoclineno++;
;
}
do_action: /* This label is used only to access EOF actions. */
switch ( yy_act )
{ /* beginning of action switch */
case 0: /* must back up */
/* undo the effects of YY_DO_BEFORE_ACTION */
*yy_cp = (yy_hold_char);
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
case 1:
YY_RULE_SETUP
#line 59 "SCDoc.l"
return CLASS;
YY_BREAK
case 2:
YY_RULE_SETUP
#line 60 "SCDoc.l"
return TITLE;
YY_BREAK
case 3:
YY_RULE_SETUP
#line 61 "SCDoc.l"
return SUMMARY;
YY_BREAK
case 4:
YY_RULE_SETUP
#line 62 "SCDoc.l"
return RELATED;
YY_BREAK
case 5:
YY_RULE_SETUP
#line 63 "SCDoc.l"
return CATEGORIES;
YY_BREAK
case 6:
YY_RULE_SETUP
#line 64 "SCDoc.l"
return REDIRECT;
YY_BREAK
case 7:
YY_RULE_SETUP
#line 66 "SCDoc.l"
return CLASSTREE;
YY_BREAK
case 8:
YY_RULE_SETUP
#line 67 "SCDoc.l"
return KEYWORD;
YY_BREAK
case 9:
YY_RULE_SETUP
#line 69 "SCDoc.l"
return PRIVATE;
YY_BREAK
case 10:
YY_RULE_SETUP
#line 70 "SCDoc.l"
return SECTION;
YY_BREAK
case 11:
YY_RULE_SETUP
#line 71 "SCDoc.l"
return SUBSECTION;
YY_BREAK
case 12:
YY_RULE_SETUP
#line 72 "SCDoc.l"
return COPYMETHOD;
YY_BREAK
case 13:
YY_RULE_SETUP
#line 73 "SCDoc.l"
method_caller = YY_START; BEGIN(method); return METHOD;
YY_BREAK
case 14:
YY_RULE_SETUP
#line 74 "SCDoc.l"
return ARGUMENT;
YY_BREAK
case 15:
/* rule 15 can match eol */
YY_RULE_SETUP
#line 76 "SCDoc.l"
return DESCRIPTION;
YY_BREAK
case 16:
/* rule 16 can match eol */
YY_RULE_SETUP
#line 77 "SCDoc.l"
return CLASSMETHODS;
YY_BREAK
case 17:
/* rule 17 can match eol */
YY_RULE_SETUP
#line 78 "SCDoc.l"
return INSTANCEMETHODS;
YY_BREAK
case 18:
/* rule 18 can match eol */
YY_RULE_SETUP
#line 79 "SCDoc.l"
return EXAMPLES;
YY_BREAK
case 19:
/* rule 19 can match eol */
YY_RULE_SETUP
#line 81 "SCDoc.l"
return RETURNS;
YY_BREAK
case 20:
/* rule 20 can match eol */
YY_RULE_SETUP
#line 82 "SCDoc.l"
return DISCUSSION;
YY_BREAK
case 21:
/* rule 21 can match eol */
YY_RULE_SETUP
#line 84 "SCDoc.l"
return LIST;
YY_BREAK
case 22:
/* rule 22 can match eol */
YY_RULE_SETUP
#line 85 "SCDoc.l"
return TREE;
YY_BREAK
case 23:
/* rule 23 can match eol */
YY_RULE_SETUP
#line 86 "SCDoc.l"
return NUMBEREDLIST;
YY_BREAK
case 24:
/* rule 24 can match eol */
YY_RULE_SETUP
#line 87 "SCDoc.l"
return DEFINITIONLIST;
YY_BREAK
case 25:
/* rule 25 can match eol */
YY_RULE_SETUP
#line 88 "SCDoc.l"
return TABLE;
YY_BREAK
case 26:
/* rule 26 can match eol */
YY_RULE_SETUP
#line 89 "SCDoc.l"
return FOOTNOTE;
YY_BREAK
case 27:
/* rule 27 can match eol */
YY_RULE_SETUP
#line 90 "SCDoc.l"
return WARNING;
YY_BREAK
case 28:
/* rule 28 can match eol */
YY_RULE_SETUP
#line 91 "SCDoc.l"
return NOTE;
YY_BREAK
case 29:
YY_RULE_SETUP
#line 93 "SCDoc.l"
BEGIN(verbatim); return LINK;
YY_BREAK
case 30:
YY_RULE_SETUP
#line 94 "SCDoc.l"
BEGIN(verbatim); return ANCHOR;
YY_BREAK
case 31:
YY_RULE_SETUP
#line 95 "SCDoc.l"
BEGIN(verbatim); return IMAGE;
YY_BREAK
case 32:
/* rule 32 can match eol */
YY_RULE_SETUP
#line 96 "SCDoc.l"
BEGIN(verbatim); return SOFT;
YY_BREAK
case 33:
/* rule 33 can match eol */
YY_RULE_SETUP
#line 97 "SCDoc.l"
BEGIN(verbatim); return STRONG;
YY_BREAK
case 34:
/* rule 34 can match eol */
YY_RULE_SETUP
#line 98 "SCDoc.l"
BEGIN(verbatim); return EMPHASIS;
YY_BREAK
case 35:
YY_RULE_SETUP
#line 99 "SCDoc.l"
BEGIN(verbatim); return CODE;
YY_BREAK
case 36:
YY_RULE_SETUP
#line 100 "SCDoc.l"
BEGIN(verbatim); return TELETYPE;
YY_BREAK
case 37:
YY_RULE_SETUP
#line 101 "SCDoc.l"
BEGIN(verbatim); return MATH;
YY_BREAK
case 38:
/* rule 38 can match eol */
YY_RULE_SETUP
#line 103 "SCDoc.l"
BEGIN(verbatim2); return CODEBLOCK;
YY_BREAK
case 39:
/* rule 39 can match eol */
YY_RULE_SETUP
#line 104 "SCDoc.l"
BEGIN(verbatim2); return TELETYPEBLOCK;
YY_BREAK
case 40:
/* rule 40 can match eol */
YY_RULE_SETUP
#line 105 "SCDoc.l"
BEGIN(verbatim2); return MATHBLOCK;
YY_BREAK
case 41:
/* rule 41 can match eol */
YY_RULE_SETUP
#line 107 "SCDoc.l"
BEGIN(0); return TAGSYM;
YY_BREAK
case 42:
/* rule 42 can match eol */
YY_RULE_SETUP
#line 108 "SCDoc.l"
BEGIN(0); return TAGSYM;
YY_BREAK
case 43:
/* rule 43 can match eol */
YY_RULE_SETUP
#line 109 "SCDoc.l"
scdoclval.str = strdup("\n::"); return TEXT;
YY_BREAK
case 44:
/* rule 44 can match eol */
YY_RULE_SETUP
#line 110 "SCDoc.l"
return BARS;
YY_BREAK
case 45:
/* rule 45 can match eol */
YY_RULE_SETUP
#line 111 "SCDoc.l"
return HASHES;
YY_BREAK
case 46:
/* rule 46 can match eol */
YY_RULE_SETUP
#line 113 "SCDoc.l"
scdoclval.str = strdup("\n"); return TEXT;
YY_BREAK
case 47:
/* rule 47 can match eol */
YY_RULE_SETUP
#line 114 "SCDoc.l"
scdoclval.str = strdup(" "); return TEXT;
YY_BREAK
case 48:
/* rule 48 can match eol */
YY_RULE_SETUP
#line 115 "SCDoc.l"
return NEWLINE;
YY_BREAK
case 49:
/* rule 49 can match eol */
YY_RULE_SETUP
#line 116 "SCDoc.l"
return EMPTYLINES;
YY_BREAK
case 50:
YY_RULE_SETUP
#line 118 "SCDoc.l"
scdoclval.str = strdup(scdoctext); return COMMA;
YY_BREAK
case 51:
YY_RULE_SETUP
#line 120 "SCDoc.l"
scdoclval.str = strdup("||"); return TEXT;
YY_BREAK
case 52:
YY_RULE_SETUP
#line 121 "SCDoc.l"
scdoclval.str = strdup("##"); return TEXT;
YY_BREAK
case 53:
YY_RULE_SETUP
#line 122 "SCDoc.l"
scdoclval.str = strdup("::"); return TEXT;
YY_BREAK
case 54:
YY_RULE_SETUP
#line 123 "SCDoc.l"
scdoclval.str = strdup(" "); return TEXT;
YY_BREAK
case 55:
YY_RULE_SETUP
#line 124 "SCDoc.l"
scdoclval.str = strdup(" "); return TEXT;
YY_BREAK
case 56:
YY_RULE_SETUP
#line 126 "SCDoc.l"
/* eat this */
YY_BREAK
case 57:
YY_RULE_SETUP
#line 128 "SCDoc.l"
scdoclval.str = strdup(scdoctext); return URL;
YY_BREAK
case 58:
YY_RULE_SETUP
#line 129 "SCDoc.l"
scdoclval.str = strdup(scdoctext); return METHODNAME;
YY_BREAK
case 59:
/* rule 59 can match eol */
YY_RULE_SETUP
#line 130 "SCDoc.l"
scdoclval.str = strdup(scdoctext); return METHODARGS;
YY_BREAK
case 60:
YY_RULE_SETUP
#line 131 "SCDoc.l"
/* eat this */
YY_BREAK
case 61:
/* rule 61 can match eol */
YY_RULE_SETUP
#line 132 "SCDoc.l"
BEGIN(method_caller); return NEWLINE;
YY_BREAK
case 62:
YY_RULE_SETUP
#line 133 "SCDoc.l"
return BAD_METHODNAME;
YY_BREAK
case 63:
#line 136 "SCDoc.l"
case 64:
#line 137 "SCDoc.l"
case 65:
#line 138 "SCDoc.l"
case 66:
#line 139 "SCDoc.l"
case 67:
YY_RULE_SETUP
#line 139 "SCDoc.l"
scdoclval.str = strdup(scdoctext); return TEXT;
YY_BREAK
case 68:
YY_RULE_SETUP
#line 141 "SCDoc.l"
BEGIN(metadata); return CLASS;
YY_BREAK
case 69:
YY_RULE_SETUP
#line 142 "SCDoc.l"
BEGIN(metadata); return TITLE;
YY_BREAK
case 70:
YY_RULE_SETUP
#line 143 "SCDoc.l"
BEGIN(metadata); return SUMMARY;
YY_BREAK
case 71:
YY_RULE_SETUP
#line 144 "SCDoc.l"
BEGIN(metadata); return RELATED;
YY_BREAK
case 72:
YY_RULE_SETUP
#line 145 "SCDoc.l"
BEGIN(metadata); return CATEGORIES;
YY_BREAK
case 73:
YY_RULE_SETUP
#line 146 "SCDoc.l"
BEGIN(metadata); return REDIRECT;
YY_BREAK
case 74:
YY_RULE_SETUP
#line 147 "SCDoc.l"
BEGIN(metadata); return CLASSTREE;
YY_BREAK
case 75:
YY_RULE_SETUP
#line 148 "SCDoc.l"
BEGIN(metadata); return KEYWORD;
YY_BREAK
case 76:
YY_RULE_SETUP
#line 149 "SCDoc.l"
BEGIN(metadata); return PRIVATE;
YY_BREAK
case 77:
YY_RULE_SETUP
#line 150 "SCDoc.l"
BEGIN(metadata); return SECTION;
YY_BREAK
case 78:
YY_RULE_SETUP
#line 151 "SCDoc.l"
BEGIN(metadata); return SUBSECTION;
YY_BREAK
case 79:
YY_RULE_SETUP
#line 152 "SCDoc.l"
BEGIN(metadata); return COPYMETHOD;
YY_BREAK
case 80:
YY_RULE_SETUP
#line 153 "SCDoc.l"
method_caller = YY_START; BEGIN(method); return METHOD;
YY_BREAK
case 81:
/* rule 81 can match eol */
YY_RULE_SETUP
#line 154 "SCDoc.l"
BEGIN(eat); return DESCRIPTION;
YY_BREAK
case 82:
/* rule 82 can match eol */
YY_RULE_SETUP
#line 155 "SCDoc.l"
BEGIN(eat); return CLASSMETHODS;
YY_BREAK
case 83:
/* rule 83 can match eol */
YY_RULE_SETUP
#line 156 "SCDoc.l"
BEGIN(eat); return INSTANCEMETHODS;
YY_BREAK
case 84:
/* rule 84 can match eol */
YY_RULE_SETUP
#line 157 "SCDoc.l"
BEGIN(eat); return EXAMPLES;
YY_BREAK
case 85:
/* rule 85 can match eol */
YY_RULE_SETUP
#line 158 "SCDoc.l"
BEGIN(eat); return NEWLINE;
YY_BREAK
case 86:
YY_RULE_SETUP
#line 159 "SCDoc.l"
scdoclval.str = strdup(scdoctext); return COMMA;
YY_BREAK
case 87:
#line 161 "SCDoc.l"
case 88:
#line 162 "SCDoc.l"
case 89:
#line 163 "SCDoc.l"
case 90:
YY_RULE_SETUP
#line 163 "SCDoc.l"
scdoclval.str = strdup(scdoctext); return TEXT;
YY_BREAK
case 91:
YY_RULE_SETUP
#line 164 "SCDoc.l"
scdoclval.str = strdup("::"); return TEXT;
YY_BREAK
case 92:
YY_RULE_SETUP
#line 165 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 93:
YY_RULE_SETUP
#line 166 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 94:
YY_RULE_SETUP
#line 167 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 95:
/* rule 95 can match eol */
YY_RULE_SETUP
#line 168 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 96:
/* rule 96 can match eol */
YY_RULE_SETUP
#line 169 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 97:
/* rule 97 can match eol */
YY_RULE_SETUP
#line 170 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 98:
YY_RULE_SETUP
#line 171 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 99:
YY_RULE_SETUP
#line 172 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 100:
YY_RULE_SETUP
#line 173 "SCDoc.l"
BEGIN(eat2);
YY_BREAK
case 101:
/* rule 101 can match eol */
YY_RULE_SETUP
#line 174 "SCDoc.l"
BEGIN(eat3);
YY_BREAK
case 102:
/* rule 102 can match eol */
YY_RULE_SETUP
#line 175 "SCDoc.l"
BEGIN(eat3);
YY_BREAK
case 103:
/* rule 103 can match eol */
YY_RULE_SETUP
#line 176 "SCDoc.l"
BEGIN(eat3);
YY_BREAK
case 104:
/* rule 104 can match eol */
YY_RULE_SETUP
#line 177 "SCDoc.l"
BEGIN(eat);
YY_BREAK
case 105:
/* rule 105 can match eol */
YY_RULE_SETUP
#line 178 "SCDoc.l"
BEGIN(eat);
YY_BREAK
case 106:
/* rule 106 can match eol */
YY_RULE_SETUP
#line 179 "SCDoc.l"
/* empty */
YY_BREAK
case 107:
YY_RULE_SETUP
#line 180 "SCDoc.l"
ECHO;
YY_BREAK
#line 2702 "lex.scdoc.cpp"
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(verbatim):
case YY_STATE_EOF(verbatim2):
case YY_STATE_EOF(metadata):
case YY_STATE_EOF(eat):
case YY_STATE_EOF(eat2):
case YY_STATE_EOF(eat3):
case YY_STATE_EOF(method):
yyterminate();
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
*yy_cp = (yy_hold_char);
YY_RESTORE_YY_MORE_OFFSET
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
{
/* We're scanning a new file or input source. It's
* possible that this happened because the user
* just pointed scdocin at a new source and called
* scdoclex(). If so, then we have to assure
* consistency between YY_CURRENT_BUFFER and our
* globals. Here is the right place to do so, because
* this is the first action (other than possibly a
* back-up) that will match for the new input source.
*/
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
YY_CURRENT_BUFFER_LVALUE->yy_input_file = scdocin;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
}
/* Note that here we test for yy_c_buf_p "<=" to the position
* of the first EOB in the buffer, since yy_c_buf_p will
* already have been incremented past the NUL character
* (since all states make transitions on EOB to the
* end-of-buffer state). Contrast this with the test
* in input().
*/
if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
(yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
/* Okay, we're now positioned to make the NUL
* transition. We couldn't have
* yy_get_previous_state() go ahead and do it
* for us because it doesn't know how to deal
* with the possibility of jamming (and we don't
* want to build jamming into it because then it
* will run more slowly).
*/
yy_next_state = yy_try_NUL_trans( yy_current_state );
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
yy_cp = ++(yy_c_buf_p);
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
yy_cp = (yy_last_accepting_cpos);
yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
}
}
else switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_END_OF_FILE:
{
(yy_did_buffer_switch_on_eof) = 0;
if ( scdocwrap( ) )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
* scdoctext, we can now set up
* yy_c_buf_p so that if some total
* hoser (like flex itself) wants to
* call the scanner after we return the
* YY_NULL, it'll still work - another
* YY_NULL will get returned.
*/
(yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
}
else
{
if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
(yy_c_buf_p) =
(yytext_ptr) + yy_amount_of_matched_text;
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
(yy_c_buf_p) =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
yy_current_state = yy_get_previous_state( );
yy_cp = (yy_c_buf_p);
yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_find_action;
}
break;
}
default:
YY_FATAL_ERROR(
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
} /* end of scdoclex */
/* yy_get_next_buffer - try to read in a new buffer
*
* Returns a code representing an action:
* EOB_ACT_LAST_MATCH -
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
* EOB_ACT_END_OF_FILE - end of file
*/
static int yy_get_next_buffer (void)
{
register char *dest = YY_CURRENT_BUFFER_LVALUE->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_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
{ /* Don't try to fill the buffer, so this is an EOF. */
if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
{
/* We matched a single character, the EOB, so
* treat this as a final EOF.
*/
return EOB_ACT_END_OF_FILE;
}
else
{
/* We matched some text prior to the EOB, first
* process it.
*/
return EOB_ACT_LAST_MATCH;
}
}
/* Try to read more data. */
/* First move last chars to start of buffer. */
number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;
for ( i = 0; i < number_to_move; ++i )
*(dest++) = *(source++);
if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
else
{
int num_to_read =
YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
/* just a shorter name for the current buffer */
YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
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. */
scdocrealloc((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_LVALUE->yy_buf_size -
number_to_move - 1;
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
(yy_n_chars), (size_t) num_to_read );
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
if ( (yy_n_chars) == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
scdocrestart(scdocin );
}
else
{
ret_val = EOB_ACT_LAST_MATCH;
YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
else
ret_val = EOB_ACT_CONTINUE_SCAN;
if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
/* Extend the array by 50%, plus the number we really need. */
yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) scdocrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size );
if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
}
(yy_n_chars) += number_to_move;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
(yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
return ret_val;
}
/* yy_get_previous_state - get the state just before the EOB char was reached */
static yy_state_type yy_get_previous_state (void)
{
register yy_state_type yy_current_state;
register char *yy_cp;
yy_current_state = (yy_start);
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)] : 1);
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 1261 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
}
return yy_current_state;
}
/* yy_try_NUL_trans - try to make a transition on the NUL character
*
* synopsis
* next_state = yy_try_NUL_trans( current_state );
*/
static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
{
register int yy_is_jam;
register char *yy_cp = (yy_c_buf_p);
register YY_CHAR yy_c = 1;
if ( yy_accept[yy_current_state] )
{
(yy_last_accepting_state) = yy_current_state;
(yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
if ( yy_current_state >= 1261 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
yy_is_jam = (yy_current_state == 1260);
return yy_is_jam ? 0 : yy_current_state;
}
static void yyunput (int c, register char * yy_bp )
{
register char *yy_cp;
yy_cp = (yy_c_buf_p);
/* undo effects of setting up scdoctext */
*yy_cp = (yy_hold_char);
if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
{ /* need to shift things up to make room */
/* +2 for EOB chars. */
register int number_to_move = (yy_n_chars) + 2;
register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
register char *source =
&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];
while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
*--dest = *--source;
yy_cp += (int) (dest - source);
yy_bp += (int) (dest - source);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size;
if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
YY_FATAL_ERROR( "flex scanner push-back overflow" );
}
*--yy_cp = (char) c;
if ( c == '\n' ){
--scdoclineno;
}
(yytext_ptr) = yy_bp;
(yy_hold_char) = *yy_cp;
(yy_c_buf_p) = yy_cp;
}
#ifndef YY_NO_INPUT
#ifdef __cplusplus
static int yyinput (void)
#else
static int input (void)
#endif
{
int c;
*(yy_c_buf_p) = (yy_hold_char);
if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
{
/* yy_c_buf_p now points to the character we want to return.
* If this occurs *before* the EOB characters, then it's a
* valid NUL; if not, then we've hit the end of the buffer.
*/
if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
/* This was really a NUL. */
*(yy_c_buf_p) = '\0';
else
{ /* need more input */
int offset = (yy_c_buf_p) - (yytext_ptr);
++(yy_c_buf_p);
switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_LAST_MATCH:
/* This happens because yy_g_n_b()
* sees that we've accumulated a
* token and flags that we need to
* try matching the token before
* proceeding. But for input(),
* there's no matching to consider.
* So convert the EOB_ACT_LAST_MATCH
* to EOB_ACT_END_OF_FILE.
*/
/* Reset buffer status. */
scdocrestart(scdocin );
/*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
if ( scdocwrap( ) )
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) + offset;
break;
}
}
}
c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
*(yy_c_buf_p) = '\0'; /* preserve scdoctext */
(yy_hold_char) = *++(yy_c_buf_p);
if ( c == '\n' )
scdoclineno++;
;
return c;
}
#endif /* ifndef YY_NO_INPUT */
/** Immediately switch to a different input stream.
* @param input_file A readable stream.
*
* @note This function does not reset the start condition to @c INITIAL .
*/
void scdocrestart (FILE * input_file )
{
if ( ! YY_CURRENT_BUFFER ){
scdocensure_buffer_stack ();
YY_CURRENT_BUFFER_LVALUE =
scdoc_create_buffer(scdocin,YY_BUF_SIZE );
}
scdoc_init_buffer(YY_CURRENT_BUFFER,input_file );
scdoc_load_buffer_state( );
}
/** Switch to a different input buffer.
* @param new_buffer The new input buffer.
*
*/
void scdoc_switch_to_buffer (YY_BUFFER_STATE new_buffer )
{
/* TODO. We should be able to replace this entire function body
* with
* scdocpop_buffer_state();
* scdocpush_buffer_state(new_buffer);
*/
scdocensure_buffer_stack ();
if ( YY_CURRENT_BUFFER == new_buffer )
return;
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
YY_CURRENT_BUFFER_LVALUE = new_buffer;
scdoc_load_buffer_state( );
/* We don't actually know whether we did this switch during
* EOF (scdocwrap()) processing, but the only time this flag
* is looked at is after scdocwrap() is called, so it's safe
* to go ahead and always set it.
*/
(yy_did_buffer_switch_on_eof) = 1;
}
static void scdoc_load_buffer_state (void)
{
(yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
(yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
scdocin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
(yy_hold_char) = *(yy_c_buf_p);
}
/** Allocate and initialize an input buffer state.
* @param file A readable stream.
* @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
*
* @return the allocated buffer state.
*/
YY_BUFFER_STATE scdoc_create_buffer (FILE * file, int size )
{
YY_BUFFER_STATE b;
b = (YY_BUFFER_STATE) scdocalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in scdoc_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 *) scdocalloc(b->yy_buf_size + 2 );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in scdoc_create_buffer()" );
b->yy_is_our_buffer = 1;
scdoc_init_buffer(b,file );
return b;
}
/** Destroy the buffer.
* @param b a buffer created with scdoc_create_buffer()
*
*/
void scdoc_delete_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
scdocfree((void *) b->yy_ch_buf );
scdocfree((void *) b );
}
/* Initializes or reinitializes a buffer.
* This function is sometimes called more than once on the same buffer,
* such as during a scdocrestart() or at EOF.
*/
static void scdoc_init_buffer (YY_BUFFER_STATE b, FILE * file )
{
int oerrno = errno;
scdoc_flush_buffer(b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
/* If b is the current buffer, then scdoc_init_buffer was _probably_
* called from scdocrestart() or through yy_get_next_buffer.
* In that case, we don't want to reset the lineno or column.
*/
if (b != YY_CURRENT_BUFFER){
b->yy_bs_lineno = 1;
b->yy_bs_column = 0;
}
b->yy_is_interactive = 0;
errno = oerrno;
}
/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
* @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
*
*/
void scdoc_flush_buffer (YY_BUFFER_STATE b )
{
if ( ! b )
return;
b->yy_n_chars = 0;
/* We always need two end-of-buffer characters. The first causes
* a transition to the end-of-buffer state. The second causes
* a jam in that state.
*/
b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
b->yy_buf_pos = &b->yy_ch_buf[0];
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
if ( b == YY_CURRENT_BUFFER )
scdoc_load_buffer_state( );
}
/** Pushes the new state onto the stack. The new state becomes
* the current state. This function will allocate the stack
* if necessary.
* @param new_buffer The new state.
*
*/
void scdocpush_buffer_state (YY_BUFFER_STATE new_buffer )
{
if (new_buffer == NULL)
return;
scdocensure_buffer_stack();
/* This block is copied from scdoc_switch_to_buffer. */
if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
*(yy_c_buf_p) = (yy_hold_char);
YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
/* Only push if top exists. Otherwise, replace top. */
if (YY_CURRENT_BUFFER)
(yy_buffer_stack_top)++;
YY_CURRENT_BUFFER_LVALUE = new_buffer;
/* copied from scdoc_switch_to_buffer. */
scdoc_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
/** Removes and deletes the top of the stack, if present.
* The next element becomes the new top.
*
*/
void scdocpop_buffer_state (void)
{
if (!YY_CURRENT_BUFFER)
return;
scdoc_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
if ((yy_buffer_stack_top) > 0)
--(yy_buffer_stack_top);
if (YY_CURRENT_BUFFER) {
scdoc_load_buffer_state( );
(yy_did_buffer_switch_on_eof) = 1;
}
}
/* Allocates the stack if it does not exist.
* Guarantees space for at least one push.
*/
static void scdocensure_buffer_stack (void)
{
int num_to_alloc;
if (!(yy_buffer_stack)) {
/* First allocation is just for 2 elements, since we don't know if this
* scanner will even need a stack. We use 2 instead of 1 to avoid an
* immediate realloc on the next call.
*/
num_to_alloc = 1;
(yy_buffer_stack) = (struct yy_buffer_state**)scdocalloc
(num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in scdocensure_buffer_stack()" );
memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
(yy_buffer_stack_top) = 0;
return;
}
if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
/* Increase the buffer to prepare for a possible push. */
int grow_size = 8 /* arbitrary grow size */;
num_to_alloc = (yy_buffer_stack_max) + grow_size;
(yy_buffer_stack) = (struct yy_buffer_state**)scdocrealloc
((yy_buffer_stack),
num_to_alloc * sizeof(struct yy_buffer_state*)
);
if ( ! (yy_buffer_stack) )
YY_FATAL_ERROR( "out of dynamic memory in scdocensure_buffer_stack()" );
/* zero only the new slots.*/
memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
(yy_buffer_stack_max) = num_to_alloc;
}
}
/** Setup the input buffer state to scan directly from a user-specified character buffer.
* @param base the character buffer
* @param size the size in bytes of the character buffer
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE scdoc_scan_buffer (char * base, yy_size_t size )
{
YY_BUFFER_STATE b;
if ( size < 2 ||
base[size-2] != YY_END_OF_BUFFER_CHAR ||
base[size-1] != YY_END_OF_BUFFER_CHAR )
/* They forgot to leave room for the EOB's. */
return 0;
b = (YY_BUFFER_STATE) scdocalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in scdoc_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;
scdoc_switch_to_buffer(b );
return b;
}
/** Setup the input buffer state to scan a string. The next call to scdoclex() will
* scan from a @e copy of @a str.
* @param yystr a NUL-terminated string to scan
*
* @return the newly allocated buffer state object.
* @note If you want to scan bytes that may contain NUL values, then use
* scdoc_scan_bytes() instead.
*/
YY_BUFFER_STATE scdoc_scan_string (yyconst char * yystr )
{
return scdoc_scan_bytes(yystr,strlen(yystr) );
}
/** Setup the input buffer state to scan the given bytes. The next call to scdoclex() will
* scan from a @e copy of @a bytes.
* @param yybytes the byte buffer to scan
* @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
*
* @return the newly allocated buffer state object.
*/
YY_BUFFER_STATE scdoc_scan_bytes (yyconst char * yybytes, int _yybytes_len )
{
YY_BUFFER_STATE b;
char *buf;
yy_size_t n;
int i;
/* Get memory for full buffer, including space for trailing EOB's. */
n = _yybytes_len + 2;
buf = (char *) scdocalloc(n );
if ( ! buf )
YY_FATAL_ERROR( "out of dynamic memory in scdoc_scan_bytes()" );
for ( i = 0; i < _yybytes_len; ++i )
buf[i] = yybytes[i];
buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
b = scdoc_scan_buffer(buf,n );
if ( ! b )
YY_FATAL_ERROR( "bad buffer in scdoc_scan_bytes()" );
/* It's okay to grow etc. this buffer, and we should throw it
* away when we're done.
*/
b->yy_is_our_buffer = 1;
return b;
}
#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif
static void yy_fatal_error (yyconst char* msg )
{
(void) fprintf( stderr, "%s\n", msg );
exit( YY_EXIT_FAILURE );
}
/* Redefine yyless() so it works in section 3 code. */
#undef yyless
#define yyless(n) \
do \
{ \
/* Undo effects of setting up scdoctext. */ \
int yyless_macro_arg = (n); \
YY_LESS_LINENO(yyless_macro_arg);\
scdoctext[scdocleng] = (yy_hold_char); \
(yy_c_buf_p) = scdoctext + yyless_macro_arg; \
(yy_hold_char) = *(yy_c_buf_p); \
*(yy_c_buf_p) = '\0'; \
scdocleng = yyless_macro_arg; \
} \
while ( 0 )
/* Accessor methods (get/set functions) to struct members. */
/** Get the current line number.
*
*/
int scdocget_lineno (void)
{
return scdoclineno;
}
/** Get the input stream.
*
*/
FILE *scdocget_in (void)
{
return scdocin;
}
/** Get the output stream.
*
*/
FILE *scdocget_out (void)
{
return scdocout;
}
/** Get the length of the current token.
*
*/
int scdocget_leng (void)
{
return scdocleng;
}
/** Get the current token.
*
*/
char *scdocget_text (void)
{
return scdoctext;
}
/** Set the current line number.
* @param line_number
*
*/
void scdocset_lineno (int line_number )
{
scdoclineno = line_number;
}
/** Set the input stream. This does not discard the current
* input buffer.
* @param in_str A readable stream.
*
* @see scdoc_switch_to_buffer
*/
void scdocset_in (FILE * in_str )
{
scdocin = in_str ;
}
void scdocset_out (FILE * out_str )
{
scdocout = out_str ;
}
int scdocget_debug (void)
{
return scdoc_flex_debug;
}
void scdocset_debug (int bdebug )
{
scdoc_flex_debug = bdebug ;
}
static int yy_init_globals (void)
{
/* Initialization is the same as for the non-reentrant scanner.
* This function is called from scdoclex_destroy(), so don't allocate here.
*/
/* We do not touch scdoclineno unless the option is enabled. */
scdoclineno = 1;
(yy_buffer_stack) = 0;
(yy_buffer_stack_top) = 0;
(yy_buffer_stack_max) = 0;
(yy_c_buf_p) = (char *) 0;
(yy_init) = 0;
(yy_start) = 0;
/* Defined in main.c */
#ifdef YY_STDINIT
scdocin = stdin;
scdocout = stdout;
#else
scdocin = (FILE *) 0;
scdocout = (FILE *) 0;
#endif
/* For future reference: Set errno on error, since we are called by
* scdoclex_init()
*/
return 0;
}
/* scdoclex_destroy is for both reentrant and non-reentrant scanners. */
int scdoclex_destroy (void)
{
/* Pop the buffer stack, destroying each element. */
while(YY_CURRENT_BUFFER){
scdoc_delete_buffer(YY_CURRENT_BUFFER );
YY_CURRENT_BUFFER_LVALUE = NULL;
scdocpop_buffer_state();
}
/* Destroy the stack itself. */
scdocfree((yy_buffer_stack) );
(yy_buffer_stack) = NULL;
/* Reset the globals. This is important in a non-reentrant scanner so the next time
* scdoclex() is called, initialization will occur. */
yy_init_globals( );
return 0;
}
/*
* Internal utility routines.
*/
#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
{
register int i;
for ( i = 0; i < n; ++i )
s1[i] = s2[i];
}
#endif
#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * s )
{
register int n;
for ( n = 0; s[n]; ++n )
;
return n;
}
#endif
void *scdocalloc (yy_size_t size )
{
return (void *) malloc( size );
}
void *scdocrealloc (void * ptr, yy_size_t size )
{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
* because both ANSI C and C++ allow castless assignment from
* any pointer type to void*, and deal with argument conversions
* as though doing an assignment.
*/
return (void *) realloc( (char *) ptr, size );
}
void scdocfree (void * ptr )
{
free( (char *) ptr ); /* see scdocrealloc() for (char *) cast */
}
#define YYTABLES_NAME "yytables"
#line 180 "SCDoc.l"
SuperCollider-3.6.3-Source-linux~repack/SCDoc/SCDoc.l 0000664 0001750 0001750 00000017225 12106676016 020425 0 ustar dan dan %{
/************************************************************************
*
* Copyright 2012 Jonatan Liljedahl
*
* 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, see .
*
************************************************************************/
#include
#include "SCDoc.h"
#include "SCDoc.tab.hpp"
int scdoc_start_token = 0;
//int colnum;
//#define YY_USER_ACTION { scdoclloc.first_column = colnum; colnum=colnum+yyleng; scdoclloc.last_column=colnum; if(scdoclloc.first_line!=yylineno) colnum=1; scdoclloc.first_line = scdoclloc.last_line = yylineno;}
static int method_caller;
%}
%option noyywrap never-interactive nounistd yylineno
%x verbatim
%x verbatim2
%x metadata
%x eat
%x eat2
%x eat3
%x method
%%
%{
if (scdoc_start_token) {
int t = scdoc_start_token;
scdoc_start_token = 0;
// colnum = 1;
if(t==START_METADATA) BEGIN(eat);
return t;
}
%}
(?i:[ \t]*class::[ \t]*) return CLASS;
(?i:[ \t]*title::[ \t]*) return TITLE;
(?i:[ \t]*summary::[ \t]*) return SUMMARY;
(?i:[ \t]*related::[ \t]*) return RELATED;
(?i:[ \t]*categories::[ \t]*) return CATEGORIES;
(?i:[ \t]*redirect::[ \t]*) return REDIRECT;
(?i:[ \t]*classtree::[ \t]*) return CLASSTREE;
(?i:[ \t]*keyword::[ \t]*) return KEYWORD;
(?i:[ \t]*private::[ \t]*) return PRIVATE;
(?i:[ \t]*section::[ \t]*) return SECTION;
(?i:[ \t]*subsection::[ \t]*) return SUBSECTION;
(?i:[ \t]*copymethod::[ \t]*) return COPYMETHOD;
(?i:[ \t]*method::[ \t]*) method_caller = YY_START; BEGIN(method); return METHOD;
(?i:[ \t]*argument::[ \t]*) return ARGUMENT;
(?i:[ \t]*description::[ \t\n\r]*) return DESCRIPTION;
(?i:[ \t]*classmethods::[ \t\n\r]*) return CLASSMETHODS;
(?i:[ \t]*instancemethods::[ \t\n\r]*) return INSTANCEMETHODS;
(?i:[ \t]*examples::[ \t\n\r]*) return EXAMPLES;
(?i:[ \t]*returns::[ \t\n\r]*) return RETURNS;
(?i:[ \t]*discussion::[ \t\n\r]*) return DISCUSSION;
(?i:[ \t]*list::[ \t\n\r]*) return LIST;
(?i:[ \t]*tree::[ \t\n\r]*) return TREE;
(?i:[ \t]*numberedlist::[ \t\n\r]*) return NUMBEREDLIST;
(?i:[ \t]*definitionlist::[ \t\n\r]*) return DEFINITIONLIST;
(?i:[ \t]*table::[ \t\n\r]*) return TABLE;
(?i:[ \t]*footnote::[ \t\n\r]*) return FOOTNOTE;
(?i:[ \t]*warning::[ \t\n\r]*) return WARNING;
(?i:[ \t]*note::[ \t\n\r]*) return NOTE;
(?i:link::[ \t]*) BEGIN(verbatim); return LINK;
(?i:anchor::[ \t]*) BEGIN(verbatim); return ANCHOR;
(?i:image::[ \t]*) BEGIN(verbatim); return IMAGE;
(?i:soft::[ \t\n\r]*) BEGIN(verbatim); return SOFT;
(?i:strong::[ \t\n\r]*) BEGIN(verbatim); return STRONG;
(?i:emphasis::[ \t\n\r]*) BEGIN(verbatim); return EMPHASIS;
(?i:code::[ \t]*) BEGIN(verbatim); return CODE;
(?i:teletype::[ \t]*) BEGIN(verbatim); return TELETYPE;
(?i:math::[ \t]*) BEGIN(verbatim); return MATH;
(?i:[ \t]*code::[ \t]*\n+) BEGIN(verbatim2); return CODEBLOCK;
(?i:[ \t]*teletype::[ \t]*\n+) BEGIN(verbatim2); return TELETYPEBLOCK;
(?i:[ \t]*math::[ \t]*\n+) BEGIN(verbatim2); return MATHBLOCK;
[ \t\n\r]*:: BEGIN(0); return TAGSYM;
\n[ \t\n\r]*:: BEGIN(0); return TAGSYM;
\n[ \t]*\\:: scdoclval.str = strdup("\n::"); return TEXT;
[ \t]*\|\|[ \t\n\r]* return BARS;
[ \t]*\#\#[ \t\n\r]* return HASHES;
\n scdoclval.str = strdup("\n"); return TEXT;
\n+ scdoclval.str = strdup(" "); return TEXT;
\n return NEWLINE;
\n([ \t\r]*\n)+ return EMPTYLINES;
[ \t]*,[ \t]* scdoclval.str = strdup(scdoctext); return COMMA;
\\\|\| scdoclval.str = strdup("||"); return TEXT;
\\\#\# scdoclval.str = strdup("##"); return TEXT;
\\:: scdoclval.str = strdup("::"); return TEXT;
\t scdoclval.str = strdup(" "); return TEXT;
[ \t]+ scdoclval.str = strdup(" "); return TEXT;
<*>\r /* eat this */
[a-zA-Z]+:\/\/[^ \t\n\r:,]+ scdoclval.str = strdup(scdoctext); return URL;
[a-z][a-zA-Z0-9_]*|[-<>@|&%*+/!?=]+ scdoclval.str = strdup(scdoctext); return METHODNAME;
\([^()]+\) scdoclval.str = strdup(scdoctext); return METHODARGS;
[ \r\t]+ /* eat this */
\n BEGIN(method_caller); return NEWLINE;
. return BAD_METHODNAME;
[a-zA-Z]+ |
[.!?(){}\[\]'"0-9]+ |
[^:\\\t\n\r ]+ |
[^:\\\n\r] |
. scdoclval.str = strdup(scdoctext); return TEXT;
(?i:[ \t]*class::[ \t]*) BEGIN(metadata); return CLASS;
(?i:[ \t]*title::[ \t]*) BEGIN(metadata); return TITLE;
(?i:[ \t]*summary::[ \t]*) BEGIN(metadata); return SUMMARY;
(?i:[ \t]*related::[ \t]*) BEGIN(metadata); return RELATED;
(?i:[ \t]*categories::[ \t]*) BEGIN(metadata); return CATEGORIES;
(?i:[ \t]*redirect::[ \t]*) BEGIN(metadata); return REDIRECT;
(?i:[ \t]*classtree::[ \t]*) BEGIN(metadata); return CLASSTREE;
(?i:[ \t]*keyword::[ \t]*) BEGIN(metadata); return KEYWORD;
(?i:[ \t]*private::[ \t]*) BEGIN(metadata); return PRIVATE;
(?i:[ \t]*section::[ \t]*) BEGIN(metadata); return SECTION;
(?i:[ \t]*subsection::[ \t]*) BEGIN(metadata); return SUBSECTION;
(?i:[ \t]*copymethod::[ \t]*) BEGIN(metadata); return COPYMETHOD;
(?i:[ \t]*method::[ \t]*) method_caller = YY_START; BEGIN(method); return METHOD;
(?i:[ \t]*description::[ \t\n\r]*) BEGIN(eat); return DESCRIPTION;
(?i:[ \t]*classmethods::[ \t\n\r]*) BEGIN(eat); return CLASSMETHODS;
(?i:[ \t]*instancemethods::[ \t\n\r]*) BEGIN(eat); return INSTANCEMETHODS;
(?i:[ \t]*examples::[ \t\n\r]*) BEGIN(eat); return EXAMPLES;
\n BEGIN(eat); return NEWLINE;
[ \t]*,[ \t]* scdoclval.str = strdup(scdoctext); return COMMA;
[a-zA-Z]+ |
[0-9]+ |
[^:\\\n\r,]+ |
. scdoclval.str = strdup(scdoctext); return TEXT;
\\:: scdoclval.str = strdup("::"); return TEXT;
(?i:link::[ \t]*) BEGIN(eat2);
(?i:anchor::[ \t]*) BEGIN(eat2);
(?i:image::[ \t]*) BEGIN(eat2);
(?i:soft::[ \t\n\r]*) BEGIN(eat2);
(?i:strong::[ \t\n\r]*) BEGIN(eat2);
(?i:emphasis::[ \t\n\r]*) BEGIN(eat2);
(?i:code::[ \t]*) BEGIN(eat2);
(?i:teletype::[ \t]*) BEGIN(eat2);
(?i:math::[ \t]*) BEGIN(eat2);
(?i:[ \t]*code::[ \t]*\n+) BEGIN(eat3);
(?i:[ \t]*teletype::[ \t]*\n+) BEGIN(eat3);
(?i:[ \t]*math::[ \t]*\n+) BEGIN(eat3);
[ \t\n\r]*:: BEGIN(eat);
\n[ \t\n\r]*:: BEGIN(eat);
.|\n /* empty */
%%
SuperCollider-3.6.3-Source-linux~repack/SCDoc/SCDoc.cpp 0000664 0001750 0001750 00000012720 12106676016 020747 0 ustar dan dan /************************************************************************
*
* Copyright 2012 Jonatan Liljedahl
*
* 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, see .
*
************************************************************************/
#include
#include
#include
#include
#include "SCDoc.h"
DocNode * scdoc_parse_run(int partial);
void scdocrestart (FILE *input_file);
int scdoclex_destroy(void);
char * scdoc_current_file = NULL;
const char * NODE_TEXT = "TEXT";
const char * NODE_NL = "NL";
static int doc_node_dump_level_done[32] = {0,};
// merge a+b and free b
char *strmerge(char *a, char *b) {
if(a==NULL) return b;
if(b==NULL) return a;
char *s = (char *)realloc(a,strlen(a)+strlen(b)+1);
strcat(s,b);
free(b);
return s;
}
static char *striptrailingws(char *s) {
char *s2 = strchr(s,0);
while(--s2 > s && isspace(*s2)) {
*s2 = 0;
}
return s;
}
DocNode * doc_node_create(const char *id) {
DocNode *n = (DocNode *)malloc(sizeof(DocNode));
n->id = id;
n->text = NULL;
n->n_childs = 0;
n->children = NULL;
return n;
}
// takes ownership of child
DocNode * doc_node_add_child(DocNode *n, DocNode *child) {
if(child) {
n->children = (DocNode **)realloc(n->children, (n->n_childs+1) * sizeof(DocNode*));
n->children[n->n_childs] = child;
n->n_childs++;
}
return n;
}
// takes ownership of text
/*DocNode * doc_node_add_text(DocNode *n, char *text) {
if(n->text) {
char *str = strmergefree(n->text,text);
n->text = str;
printf("NODE: Adding text '%s'\n",text);
} else {
n->text = text;
}
return n;
}*/
// moves the childs from src doc_node to n
void doc_node_move_children(DocNode *n, DocNode *src) {
if(src) {
free(n->children);
n->children = src->children;
n->n_childs = src->n_childs;
// src->children = NULL;
// src->n_childs = 0;
free(src->text);
free(src);
}
}
DocNode * doc_node_make(const char *id, char *text, DocNode *child) {
DocNode *n = doc_node_create(id);
n->text = text;
doc_node_add_child(n, child);
return n;
}
DocNode * doc_node_make_take_children(const char *id, char *text, DocNode *src) {
DocNode *n = doc_node_make(id, text, NULL);
doc_node_move_children(n, src);
return n;
}
void doc_node_free_tree(DocNode *n) {
int i;
if(!n) return;
free(n->text);
for(i=0;in_childs;i++) {
doc_node_free_tree(n->children[i]);
}
free(n->children);
free(n);
}
void doc_node_fixup_tree(DocNode *n) {
int i;
if(n->id != NODE_TEXT && n->text) {
n->text = striptrailingws(n->text);
}
if(n->n_childs) {
DocNode *last = n->children[n->n_childs-1];
if(last->id==NODE_NL) {
free(last); // NL has no text or children
n->n_childs--;
}
last = NULL;
for(i = 0; i < n->n_childs; i++) {
DocNode *child = n->children[i];
if((child->id==NODE_TEXT || child->id==NODE_NL) && last && last->id==NODE_TEXT) {
if(child->id==NODE_NL) {
last->text = (char*)realloc(last->text,strlen(last->text)+2);
strcat(last->text," ");
} else {
last->text = strmerge(last->text,child->text);
}
free(child); // we took childs text and it has no children
n->children[i] = NULL;
} else {
doc_node_fixup_tree(child);
last = child;
}
}
int j = 0;
for(i = 0; i < n->n_childs; i++) {
if(n->children[i]) {
n->children[j++] = n->children[i];
}
}
n->n_childs = j;
}
}
static void _doc_node_dump(DocNode *n, int level, int last) {
int i;
for(i=0;iid);
if(n->text) printf(" \"%s\"",n->text);
printf("\n");
for(i = 0; i < n->n_childs; i++) {
_doc_node_dump(n->children[i], level+1, i==n->n_childs-1);
}
doc_node_dump_level_done[level] = 0;
}
void doc_node_dump(DocNode *n) {
_doc_node_dump(n,0,1);
}
extern void error(const char *fmt, ...);
DocNode * scdoc_parse_file(char *fn, int mode) {
FILE *fp;
DocNode *n;
fp = fopen(fn,"r");
if(!fp) {
error("scdoc_parse_file: could not open '%s'\n",fn);
return NULL;
}
scdoc_current_file = fn;
scdocrestart(fp);
n = scdoc_parse_run(mode);
if(n) {
doc_node_fixup_tree(n);
}
fclose(fp);
scdoclex_destroy();
scdoc_current_file = NULL;
return n;
}
SuperCollider-3.6.3-Source-linux~repack/SCDoc/main.cpp 0000664 0001750 0001750 00000001771 11743774635 020760 0 ustar dan dan #include
#include
#include
#include
#include "SCDoc.h"
void error(const char *fmt, ...)
{
fprintf(stderr, "ERROR: ");
va_list vargs;
va_start(vargs, fmt);
vfprintf(stderr, fmt, vargs);
fflush(stderr);
}
void post(const char *fmt, ...)
{
va_list vargs;
va_start(vargs, fmt);
vfprintf(stderr, fmt, vargs);
fflush(stderr);
}
int main(int argc, char **argv)
{
if(argc>1) {
DocNode *n;
if(argc>2 && strcmp(argv[1],"--partial")==0)
n = scdoc_parse_file(argv[2], SCDOC_PARSE_PARTIAL);
else
if(argc>2 && strcmp(argv[1],"--metadata")==0)
n = scdoc_parse_file(argv[2], SCDOC_PARSE_METADATA);
else
n = scdoc_parse_file(argv[1], SCDOC_PARSE_FULL);
if(n) {
doc_node_dump(n);
doc_node_free_tree(n);
} else
return 1;
} else {
fprintf(stderr, "Usage: %s inputfile.schelp\n",argv[0]);
}
return 0;
}
SuperCollider-3.6.3-Source-linux~repack/SCDoc/SCDocPrim.h 0000664 0001750 0001750 00000000126 11743774635 021255 0 ustar dan dan #ifndef _SCDOCPRIM_H_
#define _SCDOCPRIM_H_
void initSCDocPrimitives(void);
#endif
SuperCollider-3.6.3-Source-linux~repack/SCDoc/SCDocPrim.cpp 0000664 0001750 0001750 00000005622 12106676016 021602 0 ustar dan dan /************************************************************************
*
* Copyright 2012 Jonatan Liljedahl
*
* 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, see .
*
************************************************************************/
#include "GC.h"
#include "PyrKernel.h"
#include "PyrPrimitive.h"
#include "PyrSymbol.h"
#include "SCBase.h"
#include "SC_DirUtils.h"
#include
#include
#include
#include
//extern "C" {
#include "SCDoc.h"
//}
PyrSymbol *s_scdoc_node;
static void _doc_traverse(struct VMGlobals* g, DocNode *n, PyrObject *parent, PyrSlot *slot)
{
PyrObject *result = instantiateObject( g->gc, s_scdoc_node->u.classobj, 0, false, false );
result->size = 0;
SetObject(slot, result);
if(parent) g->gc->GCWrite(parent, result);
PyrSymbol *id = getsym(n->id);
SetSymbol(result->slots+result->size++, id);
if(n->text) {
PyrObject *str = (PyrObject*) newPyrString(g->gc, n->text, 0, true);
SetObject(result->slots+result->size++, str);
g->gc->GCWrite(result, str);
} else {
SetNil(result->slots+result->size++);
}
if(n->n_childs) {
PyrObject *array = newPyrArray(g->gc, n->n_childs, 0, true);
array->size = 0;
SetObject(result->slots+result->size++, array);
g->gc->GCWrite(result, array);
for(int i=0; in_childs; i++) {
array->size++;
_doc_traverse(g, n->children[i], array, array->slots+i);
}
} else {
SetNil(result->slots+result->size++);
}
result->size += 3; // makeDiv, notPrivOnly, sort
}
int prSCDoc_ParseFile(struct VMGlobals* g, int numArgsPushed)
{
PyrSlot *a, *b, *c;
char filename[PATH_MAX];
int mode, err;
a = g->sp - 2;
b = g->sp - 1;
c = g->sp;
err = slotStrVal(b, filename, PATH_MAX);
if (err) return err;
err = slotIntVal(c, &mode);
if (err) return err;
DocNode *n = scdoc_parse_file(filename, mode);
if(n) {
// doc_node_dump(n);
_doc_traverse(g, n, NULL, a);
doc_node_free_tree(n);
} else {
SetNil(a);
}
return errNone;
}
void initSCDocPrimitives()
{
int base, index = 0;
s_scdoc_node = getsym("SCDocNode");
base = nextPrimitiveIndex();
definePrimitive(base, index++, "_SCDoc_ParseFile", prSCDoc_ParseFile, 3, 0);
}
SuperCollider-3.6.3-Source-linux~repack/SCDoc/CMakeLists.txt 0000664 0001750 0001750 00000000335 11743774635 022063 0 ustar dan dan set(SCDOC_DIR ${CMAKE_SOURCE_DIR}/SCDoc)
set(SCDOC_SRCS
${SCDOC_DIR}/SCDoc.cpp
${SCDOC_DIR}/SCDoc.tab.cpp
${SCDOC_DIR}/lex.scdoc.cpp
${SCDOC_DIR}/SCDocPrim.cpp
)
include_directories(
${SCDOC_DIR}
)
SuperCollider-3.6.3-Source-linux~repack/SCDoc/SCDoc.y 0000664 0001750 0001750 00000033670 12106676016 020444 0 ustar dan dan %{
/************************************************************************
*
* Copyright 2012 Jonatan Liljedahl
*
* 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, see .
*
************************************************************************/
#include
#include
#include
#include "SCDoc.h"
//#define YYLEX_PARAM &yylval, &yylloc
int scdocparse();
extern int scdoclineno;
extern char *scdoctext;
extern int scdoc_start_token;
extern FILE *scdocin;
//extern struct YYLTYPE scdoclloc;
//int scdoc_metadata_mode;
static const char * method_type = NULL;
static DocNode * topnode;
void scdocerror(const char *str);
extern void error(const char *fmt, ...);
extern void post(const char *fmt, ...);
static inline bool stringEqual(const char * a, const char * b)
{
return strcmp(a, b) == 0;
}
%}
%locations
%error-verbose
%union {
int i;
const char *id;
char *str;
DocNode *doc_node;
}
// single line header tags that take text
%token CLASS TITLE SUMMARY RELATED CATEGORIES REDIRECT
// single line body tags that take text
%token CLASSTREE COPYMETHOD KEYWORD PRIVATE
// single line structural tags that take text, with children
%token SECTION SUBSECTION METHOD ARGUMENT
// single line structural tags with no text, with children
%token DESCRIPTION CLASSMETHODS INSTANCEMETHODS EXAMPLES RETURNS DISCUSSION
// nestable range tags with no text, with children
%token LIST TREE NUMBEREDLIST DEFINITIONLIST TABLE FOOTNOTE NOTE WARNING
// modal range tags that take multi-line text
%token CODE LINK ANCHOR SOFT IMAGE TELETYPE MATH STRONG EMPHASIS
%token CODEBLOCK "CODE block" TELETYPEBLOCK "TELETYPE block" MATHBLOCK "MATH block"
// symbols
%token TAGSYM "::" BARS "||" HASHES "##"
// text and whitespace
%token TEXT "text" URL COMMA METHODNAME "method name" METHODARGS "arguments string"
%token NEWLINE "newline" EMPTYLINES "empty lines"
%token BAD_METHODNAME "bad method name"
%token END 0 "end of file"
%type headtag sectiontag listtag rangetag inlinetag blocktag
%type anyword words anywordnl wordsnl anywordurl words2 nocommawords optMETHODARGS methodname
%type document arg optreturns optdiscussion body bodyelem
%type optsubsections optsubsubsections methodbody
%type dochead headline optsections sections section
%type subsections subsection subsubsection subsubsections
%type optbody optargs args listbody tablebody tablecells tablerow
%type prose proseelem blockA blockB commalist
%type deflistbody deflistrow defterms methnames
%token START_FULL START_PARTIAL START_METADATA
%start start
%destructor { doc_node_free_tree($$); }
%destructor { free($$); }
%{
//int scdoclex (YYSTYPE * yylval_param, struct YYLTYPE * yylloc_param );
int scdoclex (void);
%}
%%
start: document { topnode = $1; }
| document error { topnode = NULL; doc_node_free_tree($1); }
;
document: START_FULL eateol dochead optsections
{
$$ = doc_node_create("DOCUMENT");
doc_node_add_child($$, $3);
doc_node_add_child($$, $4);
}
| START_PARTIAL sections
{
$$ = doc_node_make_take_children("BODY",NULL,$2);
}
| START_METADATA dochead optsections
{
$$ = doc_node_create("DOCUMENT");
doc_node_add_child($$, $2);
doc_node_add_child($$, $3);
}
;
eateol: eol
| /* empty */
;
dochead: dochead headline { $$ = doc_node_add_child($1,$2); }
| headline { $$ = doc_node_make("HEADER",NULL,$1); }
;
headline: headtag words2 eol { $$ = doc_node_make($1,$2,NULL); }
| CATEGORIES commalist eol { $$ = doc_node_make_take_children("CATEGORIES",NULL,$2); }
| RELATED commalist eol { $$ = doc_node_make_take_children("RELATED",NULL,$2); }
;
headtag: CLASS { $$ = "TITLE"; } /* no need for the separate class:: tag actually. */
| TITLE { $$ = "TITLE"; }
| SUMMARY { $$ = "SUMMARY"; }
| REDIRECT { $$ = "REDIRECT"; }
;
sectiontag: CLASSMETHODS { $$ = "CLASSMETHODS"; method_type = "CMETHOD"; }
| INSTANCEMETHODS { $$ = "INSTANCEMETHODS"; method_type = "IMETHOD"; }
| DESCRIPTION { $$ = "DESCRIPTION"; method_type = "METHOD"; }
| EXAMPLES { $$ = "EXAMPLES"; method_type = "METHOD"; }
;
optsections: sections
| { $$ = doc_node_make("BODY",NULL,NULL); }
;
sections: sections section { $$ = doc_node_add_child($1,$2); }
| section { $$ = doc_node_make("BODY",NULL,$1); }
| subsubsections { $$ = doc_node_make_take_children("BODY",NULL,$1); } /* allow text before first section */
;
section: SECTION { method_type = "METHOD"; } words2 eol optsubsections { $$ = doc_node_make_take_children("SECTION",$3,$5); }
| sectiontag optsubsections { $$ = doc_node_make_take_children($1, NULL,$2); }
;
optsubsections: subsections
| { $$ = NULL; }
;
subsections: subsections subsection { $$ = doc_node_add_child($1,$2); }
| subsection { $$ = doc_node_make("(SUBSECTIONS)",NULL,$1); }
| subsubsections
;
subsection: SUBSECTION words2 eol optsubsubsections { $$ = doc_node_make_take_children("SUBSECTION", $2, $4); }
;
optsubsubsections: subsubsections
| { $$ = NULL; }
;
subsubsections: subsubsections subsubsection { $$ = doc_node_add_child($1,$2); }
| subsubsection { $$ = doc_node_make("(SUBSUBSECTIONS)",NULL,$1); }
| body { $$ = doc_node_make_take_children("(SUBSUBSECTIONS)",NULL,$1); }
;
subsubsection: METHOD methnames optMETHODARGS eol methodbody
{
$2->id = "METHODNAMES";
$$ = doc_node_make(method_type,$3,$2);
doc_node_add_child($$, $5);
// doc_node_add_child($2, $3);
}
| COPYMETHOD words eol { $$ = doc_node_make(
stringEqual(method_type, "CMETHOD") ? "CCOPYMETHOD"
: (stringEqual(method_type, "IMETHOD") ? "ICOPYMETHOD"
: "COPYMETHOD"),
$2, NULL
); }
| PRIVATE commalist eoleof { $$ = doc_node_make_take_children( stringEqual(method_type, "CMETHOD") ? "CPRIVATE"
: "IPRIVATE",
NULL, $2); }
;
optMETHODARGS: { $$ = NULL; }
| METHODARGS
{
// $$ = doc_node_make("ARGSTRING",$1,NULL);
$$ = $1;
if(!stringEqual(method_type, "METHOD")) {
yyerror("METHOD argument string is not allowed inside CLASSMETHODS or INSTANCEMETHODS");
YYERROR;
}
}
;
methodname: METHODNAME
{
char *p = $1+strlen($1)-1;
if(*p=='_') {
post("WARNING: SCDoc: In %s\n Property setter %s should be documented without underscore.\n", scdoc_current_file, $1);
*p = '\0';
};
$$ = $1;
}
;
methnames: methnames COMMA methodname { free($2); $2 = NULL; $$ = doc_node_add_child($1, doc_node_make("STRING",$3,NULL)); }
| methodname { $$ = doc_node_make("(METHODNAMES)",NULL,doc_node_make("STRING",$1,NULL)); }
;
methodbody: optbody optargs optreturns optdiscussion
{
$$ = doc_node_make_take_children("METHODBODY",NULL,$1);
doc_node_add_child($$, $2);
doc_node_add_child($$, $3);
doc_node_add_child($$, $4);
}
;
optbody: body
| { $$ = NULL; }
;
optargs: args
| { $$ = NULL; }
;
args: args arg { $$ = doc_node_add_child($1,$2); }
| arg { $$ = doc_node_make("ARGUMENTS",NULL,$1); }
;
arg: ARGUMENT words eol optbody { $$ = doc_node_make_take_children("ARGUMENT", $2, $4); }
| ARGUMENT eol body { $$ = doc_node_make_take_children("ARGUMENT", NULL, $3); }
;
optreturns: RETURNS body { $$ = doc_node_make_take_children("RETURNS",NULL,$2); }
| { $$ = NULL; }
;
optdiscussion: DISCUSSION body { $$ = doc_node_make_take_children("DISCUSSION",NULL,$2); }
| { $$ = NULL; }
;
/*
body contains a list of bodyelem's (A) and prose (B) such that
the list can start and end with either A or B, and A can repeat while B can not
*/
body: blockA
| blockB
;
blockA: blockB bodyelem { $$ = doc_node_add_child($1,$2); }
| blockA bodyelem { $$ = doc_node_add_child($1,$2); }
| bodyelem { $$ = doc_node_make("(SECTIONBODY)",NULL,$1); }
;
blockB: blockA prose { $$ = doc_node_add_child($1,$2); }
| prose { $$ = doc_node_make("(SECTIONBODY)",NULL,$1); }
;
bodyelem: rangetag body TAGSYM { $$ = doc_node_make_take_children($1,NULL,$2); }
| listtag listbody TAGSYM { $$ = doc_node_make_take_children($1,NULL,$2); }
| TABLE tablebody TAGSYM { $$ = doc_node_make_take_children("TABLE",NULL,$2); }
| DEFINITIONLIST deflistbody TAGSYM { $$ = doc_node_make_take_children("DEFINITIONLIST",NULL,$2); }
| blocktag wordsnl TAGSYM { $$ = doc_node_make($1,$2,NULL); }
| CLASSTREE words eoleof { $$ = doc_node_make("CLASSTREE",$2,NULL); }
| KEYWORD commalist eoleof { $$ = doc_node_make_take_children("KEYWORD",NULL,$2);
// printf("keyword '%s'\n",$2->children[0]->text);
}
| EMPTYLINES { $$ = NULL; }
| IMAGE words2 TAGSYM { $$ = doc_node_make("IMAGE",$2,NULL); }
;
prose: prose proseelem { $$ = doc_node_add_child($1, $2); }
| proseelem { $$ = doc_node_make("PROSE",NULL,$1); }
;
proseelem: anyword { $$ = doc_node_make(NODE_TEXT,$1,NULL); } // one TEXT for each word
| URL { $$ = doc_node_make("LINK",$1,NULL); }
| inlinetag words TAGSYM { $$ = doc_node_make($1,$2,NULL); }
| FOOTNOTE body TAGSYM { $$ = doc_node_make_take_children("FOOTNOTE",NULL,$2); }
| NEWLINE { $$ = doc_node_create(NODE_NL); }
;
inlinetag: LINK { $$ = "LINK"; }
| STRONG { $$ = "STRONG"; }
| SOFT { $$ = "SOFT"; }
| EMPHASIS { $$ = "EMPHASIS"; }
| CODE { $$ = "CODE"; }
| TELETYPE { $$ = "TELETYPE"; }
| MATH { $$ = "MATH"; }
| ANCHOR { $$ = "ANCHOR"; }
;
blocktag: CODEBLOCK { $$ = "CODEBLOCK"; }
| TELETYPEBLOCK { $$ = "TELETYPEBLOCK"; }
| MATHBLOCK { $$ = "MATHBLOCK"; }
;
listtag: LIST { $$ = "LIST"; }
| TREE { $$ = "TREE"; }
| NUMBEREDLIST { $$ = "NUMBEREDLIST"; }
;
rangetag: WARNING { $$ = "WARNING"; }
| NOTE { $$ = "NOTE"; }
;
listbody: listbody HASHES body { $$ = doc_node_add_child($1, doc_node_make_take_children("ITEM",NULL,$3)); }
| HASHES body { $$ = doc_node_make("(LISTBODY)",NULL, doc_node_make_take_children("ITEM",NULL,$2)); }
;
tablerow: HASHES tablecells { $$ = doc_node_make_take_children("TABROW",NULL,$2); }
;
tablebody: tablebody tablerow { $$ = doc_node_add_child($1,$2); }
| tablerow { $$ = doc_node_make("(TABLEBODY)",NULL,$1); }
;
tablecells: tablecells BARS optbody { $$ = doc_node_add_child($1, doc_node_make_take_children("TABCOL",NULL,$3)); }
| optbody { $$ = doc_node_make("(TABLECELLS)",NULL, doc_node_make_take_children("TABCOL",NULL,$1)); }
;
defterms: defterms HASHES body { $$ = doc_node_add_child($1,doc_node_make_take_children("TERM",NULL,$3)); }
| HASHES body { $$ = doc_node_make("(TERMS)",NULL,doc_node_make_take_children("TERM",NULL,$2)); }
;
deflistrow: defterms BARS optbody
{
$$ = doc_node_make_take_children("DEFLISTITEM", NULL, $1);
doc_node_add_child($$, doc_node_make_take_children("DEFINITION", NULL, $3));
}
;
deflistbody: deflistbody deflistrow { $$ = doc_node_add_child($1,$2); }
| deflistrow { $$ = doc_node_make("(DEFLISTBODY)",NULL,$1); }
;
anywordurl: anyword
| URL
;
anyword: TEXT
| COMMA
;
words: words anyword { $$ = strmerge($1,$2); }
| anyword
;
words2: words2 anywordurl { $$ = strmerge($1,$2); }
| anywordurl
;
eol: NEWLINE
| EMPTYLINES
;
eoleof: eol
| END
;
anywordnl: anyword
| eol { $$ = strdup("\n"); }
;
wordsnl: wordsnl anywordnl { $$ = strmerge($1,$2); }
| anywordnl
;
nocommawords: nocommawords TEXT { $$ = strmerge($1,$2); }
| nocommawords URL { $$ = strmerge($1,$2); }
| TEXT
| URL
;
commalist: commalist COMMA nocommawords { free($2); $2=NULL; $$ = doc_node_add_child($1,doc_node_make("STRING",$3,NULL)); }
| nocommawords { $$ = doc_node_make("(COMMALIST)",NULL,doc_node_make("STRING",$1,NULL)); }
;
%%
DocNode * scdoc_parse_run(int mode) {
int modes[] = {START_FULL, START_PARTIAL, START_METADATA};
if(mode<0 || mode>=sizeof(modes)) {
error("scdoc_parse_run(): unknown mode: %d\n",mode);
}
scdoc_start_token = modes[mode];
/* scdoc_start_token = START_FULL;
scdoc_metadata_mode = 0;
if(mode==SCDOC_PARSE_PARTIAL) {
scdoc_start_token = START_PARTIAL;
} else
if(mode==SCDOC_PARSE_METADATA) {
scdoc_metadata_mode = 1;
}*/
topnode = NULL;
method_type = "METHOD";
if(scdocparse()!=0) {
return NULL;
}
return topnode;
}
void scdocerror(const char *str)
{
error("In %s:\n At line %d: %s\n\n",scdoc_current_file,scdoclineno,str);
/* FIXME: this does not work well, since the reported linenumber is often *after* the actual error line
fseek(scdocin, 0, SEEK_SET);
int line = 1;
char buf[256],*txt;
while(line!=scdoclineno && !feof(scdocin)) {
int c = fgetc(scdocin);
if(c=='\n') line++;
}
txt = fgets(buf, 256, scdocin);
if(txt)
fprintf(stderr," %s\n-------------------\n", txt);
*/
}
SuperCollider-3.6.3-Source-linux~repack/SCDoc/SCDoc.h 0000664 0001750 0001750 00000001360 12057624166 020416 0 ustar dan dan #ifndef SCDOC_H
#define SCDOC_H
#define SCDOC_PARSE_FULL 0
#define SCDOC_PARSE_PARTIAL 1
#define SCDOC_PARSE_METADATA 2
extern const char * NODE_TEXT;
extern const char * NODE_NL;
typedef struct DocNode {
const char *id;
char *text;
int n_childs;
struct DocNode **children;
} DocNode;
char *strmerge(char *a, char *b);
DocNode * doc_node_make_take_children(const char *id, char *text, DocNode *src);
DocNode * doc_node_make(const char *id, char *text, DocNode *child);
DocNode * doc_node_add_child(DocNode *n, DocNode *child);
DocNode * doc_node_create(const char *id);
void doc_node_free_tree(DocNode *n);
DocNode * scdoc_parse_file(char *fn, int mode);
void doc_node_dump(DocNode *n);
extern char * scdoc_current_file;
#endif
SuperCollider-3.6.3-Source-linux~repack/COPYING 0000644 0001750 0001750 00000104513 11562456101 017404 0 ustar dan dan GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
Copyright (C)
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
.
SuperCollider-3.6.3-Source-linux~repack/README_OS_X.txt 0000664 0001750 0001750 00000013756 12106676016 020755 0 ustar dan dan ------------------------------------------------------------------------
Introduction
------------------------------------------------------------------------
This is the Mac OS X version of James McCartney's SuperCollider
synthesis engine (scsynth) and programming language (sclang).
Supercollider's main homepage is at:
http://supercollider.sourceforge.net/
The help files contain a lot of useful information and tutorials for getting
started - see the file "Help.html" for a starting point.
To get further information on SuperCollider usage or development, you
should subscribe to the mailing lists:
http://swiki.hfbk-hamburg.de/MusicTechnology/880
SPECIAL CHARACTERS ON MAC:
Please do not use non-ASCII characters (above code point 127) in your SuperCollider
program path (i.e. the names of the folders containing SuperCollider).
Doing so will break options to open class or method files automatically.
------------------------------------------------------------------------
Compiling SuperCollider from the source code
------------------------------------------------------------------------
Requirements:
* Mac OS X 10.4.9 or greater
* Cmake 2.7 or greater
* Xcode Tools 2.4.1 or greater
* Qt libraries 4.7 or greater: http://qt-project.org/downloads
To build SuperCollider with Cmake, it is recommended to create a "build"
folder (to keep the built files neatly all together) in the root of the
SuperCollider source, then run "cmake" from within that folder. Like this:
cd ~/SuperCollider3/
mkdir build
cd build
cmake ..
Then to run the build process run:
make install
This will build the software, then "install" it to a folder "SuperCollider" under
CMAKE_INSTALL_PREFIX, which defaults to "/Install",
with the finished products in. You might like to move the "SuperCollider"
folder into your /Applications folder or install it there directly by
passing "-DCMAKE_INSTALL_PREFIX=/Applications" to cmake.
The build process can be configured using the cmake program, cmake
frontends like "ccmake" or "cmake-gui", or by simply editing the
build/CMakeCache.txt file.
For example, by default cmake will create a "release" build, but if you want a
"debug" build (with optimisations turned off etc), configure cmake like this:
cmake -DCMAKE_BUILD_TYPE=Debug ..
By default the SCClassLibrary is copied into place. There is a cmake option to create
symlinks of the SCClassLibrary instead so that changes to code in the class library are reflected in git.
To turn on the symlinking do:
cmake -DSC_SYMLINK_CLASSLIB=ON ..
For a 32bit build on a 64bit machine (i.e. recent Mac systems), you need to
configure cmake like this:
cmake -DCMAKE_OSX_ARCHITECTURES='i386' ..
For the BIG universal binary (on 10.6), use:
cmake -DCMAKE_OSX_ARCHITECTURES='i386;x86_64' ..
cmake -DCMAKE_OSX_SYSROOT=/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk/ -DCMAKE_OSX_DEPLOYMENT_TARGET=10.6 -GXcode
**** 10.8 warning ****
On 10.8 you need to:
compile against the 10.7 SDK
build with the Xcode generator (add -GXcode to your cmake flags).
Then, build the install target in Xcode.
I started working on the bluetooth issues today actually, but the changes aren't trivial.
For some reason, the 10.7 SDK choice doesn't seem to percolate into the makefile version created by cmake. You can either build with an Xcode file:
(an example from josh on 10.8 with Xcode 4.5: cmake -DCMAKE_OSX_SYSROOT=/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk/ -DCMAKE_OSX_DEPLOYMENT_TARGET=10.6 -GXcode )
your build will be in the "Install" folder in the build directory.
or add the following flags for isysroot:
-DCMAKE_CXX_FLAGS="-isysroot /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk/" -DCMAKE_C_FLAGS="-isysroot /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk/"
Finally - a cmake command that builds on 10.8 currently:
cmake -DCMAKE_OSX_SYSROOT=/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk/ -DCMAKE_OSX_DEPLOYMENT_TARGET=10.7 -DCMAKE_CXX_FLAGS="-isysroot /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk/" -DCMAKE_C_FLAGS="-isysroot /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.7.sdk/" -DCMAKE_BUILD_TYPE="Release" ..
Qt GUI:
-------
By default the new Qt GUI support will be built into sclang and
SuperCollider application. If you want to build without it, configure
cmake like this:
cmake -DSC_QT=OFF ..
Standalones:
------------
To create a "standalone" app using cmake, you need to use the "standalone" flag.
For example, to create a standalone whose name is MyFabApp:
cmake -D standalone="MyFabApp" ..
This builds like normal but names the finished program "MyFabApp" and includes
any special resources you might have created in the folder
"platform/mac/MyFabApp Resources" (or, if that doesn't exist, it just uses
"platform/mac/Standalone Resources").
If you've built a standalone and want to go back to normal build mode, just
set that value as an empty string:
cmake -D standalone="" ..
------------------------------------------------------------------------
On libsndfile
------------------------------------------------------------------------
Compiling a universal binary of libsndfile requires access to both a
i386 and PPC Mac. The reasons for this are described here:
http://www.mega-nerd.com/libsndfile/FAQ.html#Q018
Because of this, libsndfile is included with the source as a precompiled
universal binary. This UB contains ppc, i386 and x86_64 archs.
------------------------------------------------------------------------
Outro
------------------------------------------------------------------------
Thanks to James McCartney, for making this great piece of audio
software publicly and freely available.
------------------------------------------------------------------------
SuperCollider-3.6.3-Source-linux~repack/README_JAILBROKEN_IPHONE.txt 0000644 0001750 0001750 00000004715 11644340035 022613 0 ustar dan dan Installing SuperCollider in a Jailbroken iDevice.
January 2011
1 - jailbreak your iDevice (both blackrain on iphone and redsn0w for iOS 4.1 on 2nd gen iPod Touch are reported to work)
2 - install OpenSSH and ldid from Cydia. You probably also want to install SBSettings for a convenient way to among other things switch SSH on and off. It's a must-have app for jailbroken iDevices. You should have SSH turned off at all times except when you really need it
3 - Change the SSH password! Running around with SSH on and the default password is a Major Security Problem
4 - Get a free developer account from Apple and download and install XCode
5 - Disable code signing. For sdk 3.0 and above you need to disable code signing by editing the file /Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS3.0.sdk/SDKSettings.plist . Follow the instructions at
http://thebigboss.org/hosting-repository/submit-your-app/compile-for-cydia-submission/.
6 - Open the iphone xcode projects, in the project and in the SuperCollider target settings -> build, set code signing to “Don’t code signâ€.
7 - Find the architecture settings also in the build tab of the project's and the targets SuperCollider info window and set it to the architecture of the device your iDevice (armv6 or armv7)
7a - Alternatively, you can also build a "fat" binary that contains builds for both architectures and "thin" it afterwards:
cd into you SuperCollider.app directory and type
lipo SuperCollider -thin [yourArchitecture] -output [newFileName]
Then replace the SuperCollider executable inside your app folder with the "thinned" one. Of course, you have to also name it SuperCollider. And I'm sure there's also a lipo command that automatically replaces the original file.
8 - Get the App on the iDevice. You can either use Cyberduck or follow these directions:
http://blog.paulbetts.org/index.php/2008/07/22/running-your-iphone-sdk-app-on-iphone-without-the-app-store/
9 - follow the instructions in the link above to code sign the app. That will be:
chmod 755 /Applications/SuperCollider.app
ldid -S /Applications/SuperCollider.app/SuperCollider
10 - logout of your device and close SSH
11 - restart the springboard: killall SpringBoard
11a - You can also tap respring in SBSettings
If the codesigning has worked correctly (remember to only use non-fat binaries), (and if there's no cold wind blowing from the northwest) you can now start SuperCollider.app from the Springboard and take the world by storm. SuperCollider-3.6.3-Source-linux~repack/external_libraries/ 0000775 0001750 0001750 00000000000 12112505363 022222 5 ustar dan dan SuperCollider-3.6.3-Source-linux~repack/external_libraries/oscpack_build.cpp 0000644 0001750 0001750 00000000602 11562456103 025531 0 ustar dan dan #include
#ifdef BOOST_LITTLE_ENDIAN
#define OSC_HOST_LITTLE_ENDIAN
#elif defined(BOOST_BIG_ENDIAN)
#define OSC_HOST_BIG_ENDIAN
#else
#error please define endianness
#endif
#include "oscpack/osc/OscOutboundPacketStream.cpp"
#include "oscpack/osc/OscPrintReceivedElements.cpp"
#include "oscpack/osc/OscReceivedElements.cpp"
#include "oscpack/osc/OscTypes.cpp"
SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/ 0000775 0001750 0001750 00000000000 12110505246 024361 5 ustar dan dan SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/COPYING 0000644 0001750 0001750 00000000335 11644340035 025417 0 ustar dan dan Copyright (c) 2005-2007 Philipp Henkel
Use, modification, and distribution are subject to the
Boost Software License, Version 1.0. (See accompanying file
LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/CHANGE_LOG 0000644 0001750 0001750 00000007213 11644340035 025737 0 ustar dan dan Change Log
0.2.5
- Made threadpool compatible to boost::thread 1.37
- Fixed hang problem in shutdown method (Thanks to Sohail Somani)
- Adapted repository layout to boost (Thanks to Alex Ott)
0.2.4 (Stable)
- Made threadpool compatible to boost::thread 1.35.x code base
- Fixed compiler warning in scope_guard.hpp
0.2.3 (Development)
- Implemented workaround for Sun C++ Pro compiler bug in pool_core
- Removed subtask implementation (there was no demand for this feature)
- Improved shutdown policies
0.2.2 (Development)
- Refactored SizePolicy and added SizePolicyController
- Moved policies into separate files
- Fixed some compiler problems (GCC)
- Implemented size_controller handling
- Implemented two size policies: static_size and fixed_size
- Refactored worker_thread handling, moved policies from pool_core to pool
- Specialized schedule function for usage with futures
- Added compile test project
- Improved constness in pool core class
- Fixed timed wait
- Implemented futures (in progress)
- Added result_type to all functors
0.2.1 (Development)
- Pool base class (thread_pool) has now reference semantics
- Large refactorings: Removed scoped_pool, reimplemented worker (now worker_thread)
- Fixed odd resize behaviour. Now resize changes the number of threads immediately
- Apply pimpl idiom on pool core class (to make the ugly scoped_pool class needless)
- Introduced scheduling policies
- Switched to policy-based design (PBD), inspired by Scott Meyers C++ workshop
- Cosmetic code change: Replaced keyword 'class' with 'typename' in template definitions
- Revised tutorials
- New requirements: tasks functions should not and schedulers shall not throw exceptions
0.2.0 (Development)
- Moved threadpool into the boost namespace: boost::threadpool
- Used keyword volatile to indicate thread-safe member functions
- Used volatile on primitve types were appropriate
- Moved worker to detail directory
- Fixed thread deletion
- Extended wait functionality (waiting for idle threads was implemented)
- Renamed 'join()' to 'wait()' as 'join' indicates the termination of thread. That was not the case in pool::join.
- Changed internal container of lifo and fifo schedulers to improve efficiency.
- Improved code reference documentation (source code browser)
- Renamed thread_func into task_func
- Added += operator to scoped_pool to ease scheduling of tasks
- Refactored file structures and class names
- Added a new task concept (named subtask) which allows the combination of sequential and parallel execution
- Added new task adaptor for looped or timed tasks: looped_task_func
- Introduced function clear() which can be used to remove all tasks from the pool and schedulers
- New function pool::active() which returns the number of active tasks
0.1.8 (Development)
- Fixed some compile errors which were reported by gcc
- Wrote tutorial "Prioritized Tasks"
0.1.7 (Development)
- Added Visual Studio 2005 project files for tutorial and examples
0.1.6 (Development)
- Replaced task adaptor 'task' with boost::bind
- Workers are unregistered from thread_group when they are terminated
- Working on example boost::iostreams packet_filter
0.1.5 (Development)
- Finished threadpool reference
- Class pool_adaptor was replaced by smart_pool
- Minor pool improvements
- First tutorial page online
0.1.4 (Development)
- Created the pool's homepage: http://threadpool.sourceforge.net
- Improved documentation
- Added build scripts
0.1.3 (Development)
- First public release
- Added mergesort example
- Added tutorial
- Implementation of threadpool core and related classes SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/README 0000644 0001750 0001750 00000000427 11644340035 025246 0 ustar dan dan threadpool
Copyright (c) 2005-2007 Philipp Henkel
threadpool is a cross-platform C++ thread pool library and released under the Boost Software License.
See doc/index.html for information on:
- API documentation and a tutorial
- External dependencies
- Using threadpool
SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/TODO 0000644 0001750 0001750 00000002100 11644340035 025044 0 ustar dan dan threadpool to-do items
======================
Documentation
--------------------------------------------
- Source code documentation
- Design rationale
- Tutorial
- Finish Quickstart Tutorial/Example
Functionality
--------------------------------------------
- Implement a size policy which dynamically
increase/decrease the pool's size:
- init with min/max threads
- auto increase
- auto decrease (using timed cleanup tasks)
- Add some kind of deadline scheduler
- Add futures to pool
Examples
--------------------------------------------
- Buffering Client Requests: Handle 'bursty' client traffic
Some applications need more buffering than is provided by OS I/O subsystem
Working on 'active' buffer for boost::iostreams
buffer_filter which provides a dynamic amount of buffer objects.
buffer_filter uses a threadpool with one thread which provides the buffers to
consumer. (TODO Philipp)
2nd implemention step:
Flexbile configuration: Buffer capacities can be configured according to
- maximum number of requests
- maximum number of bytes
SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/ 0000775 0001750 0001750 00000000000 12110505246 025507 5 ustar dan dan SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/ 0000775 0001750 0001750 00000000000 12110505246 027650 5 ustar dan dan ././@LongLink 0000000 0000000 0000000 00000000151 00000000000 011562 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/size_policies.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/size_policies0000644 0001750 0001750 00000004534 11644340035 032444 0 ustar dan dan /*! \file
* \brief Size policies.
*
* This file contains size policies for thread_pool. A size
* policy controls the number of worker threads in the pool.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_SIZE_POLICIES_HPP_INCLUDED
#define THREADPOOL_SIZE_POLICIES_HPP_INCLUDED
/// The namespace threadpool contains a thread pool and related utility classes.
namespace boost { namespace threadpool
{
/*! \brief SizePolicyController which provides no functionality.
*
* \param Pool The pool's core type.
*/
template
struct empty_controller
{
empty_controller(typename Pool::size_policy_type&, shared_ptr) {}
};
/*! \brief SizePolicyController which allows resizing.
*
* \param Pool The pool's core type.
*/
template< typename Pool >
class resize_controller
{
typedef typename Pool::size_policy_type size_policy_type;
reference_wrapper m_policy;
shared_ptr m_pool; //!< to make sure that the pool is alive (the policy pointer is valid) as long as the controller exists
public:
resize_controller(size_policy_type& policy, shared_ptr pool)
: m_policy(policy)
, m_pool(pool)
{
}
bool resize(size_t worker_count)
{
return m_policy.get().resize(worker_count);
}
};
/*! \brief SizePolicy which preserves the thread count.
*
* \param Pool The pool's core type.
*/
template
class static_size
{
reference_wrapper m_pool;
public:
static void init(Pool& pool, size_t const worker_count)
{
pool.resize(worker_count);
}
static_size(Pool volatile & pool)
: m_pool(pool)
{}
bool resize(size_t const worker_count)
{
return m_pool.get().resize(worker_count);
}
void worker_died_unexpectedly(size_t const new_worker_count)
{
m_pool.get().resize(new_worker_count + 1);
}
// TODO this functions are not called yet
void task_scheduled() {}
void task_finished() {}
};
} } // namespace boost::threadpool
#endif // THREADPOOL_SIZE_POLICIES_HPP_INCLUDED
././@LongLink 0000000 0000000 0000000 00000000151 00000000000 011562 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/pool_adaptors.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/pool_adaptors0000644 0001750 0001750 00000003720 11644340035 032445 0 ustar dan dan /*! \file
* \brief Pool adaptors.
*
* This file contains an easy-to-use adaptor similar to a smart
* pointer for the pool class.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_POOL_ADAPTORS_HPP_INCLUDED
#define THREADPOOL_POOL_ADAPTORS_HPP_INCLUDED
#include
namespace boost { namespace threadpool
{
// TODO convenience scheduling function
/*! Schedules a Runnable for asynchronous execution. A Runnable is an arbitrary class with a run()
* member function. This a convenience shorthand for pool->schedule(bind(&Runnable::run, task_object)).
* \param
* \param obj The Runnable object. The member function run() will be exectued and should not throw execeptions.
* \return true, if the task could be scheduled and false otherwise.
*/
template
bool schedule(Pool& pool, shared_ptr const & obj)
{
return pool->schedule(bind(&Runnable::run, obj));
}
/*! Schedules a task for asynchronous execution. The task will be executed once only.
* \param task The task function object.
*/
template
typename enable_if <
is_void< typename result_of< typename Pool::task_type() >::type >,
bool
>::type
schedule(Pool& pool, typename Pool::task_type const & task)
{
return pool.schedule(task);
}
template
typename enable_if <
is_void< typename result_of< typename Pool::task_type() >::type >,
bool
>::type
schedule(shared_ptr const pool, typename Pool::task_type const & task)
{
return pool->schedule(task);
}
} } // namespace boost::threadpool
#endif // THREADPOOL_POOL_ADAPTORS_HPP_INCLUDED
././@LongLink 0000000 0000000 0000000 00000000151 00000000000 011562 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/task_adaptors.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/task_adaptors0000664 0001750 0001750 00000010373 12106676016 032447 0 ustar dan dan /*! \file
* \brief Task adaptors.
*
* This file contains adaptors for task function objects.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_TASK_ADAPTERS_HPP_INCLUDED
#define THREADPOOL_TASK_ADAPTERS_HPP_INCLUDED
#include
#include
#include
namespace boost { namespace threadpool
{
/*! \brief Standard task function object.
*
* This function object wraps a nullary function which returns void.
* The wrapped function is invoked by calling the operator ().
*
* \see boost function library
*
*/
typedef function0 task_func;
/*! \brief Prioritized task function object.
*
* This function object wraps a task_func object and binds a priority to it.
* prio_task_funcs can be compared using the operator < which realises a partial ordering.
* The wrapped task function is invoked by calling the operator ().
*
* \see prio_scheduler
*
*/
class prio_task_func
{
private:
unsigned int m_priority; //!< The priority of the task's function.
task_func m_function; //!< The task's function.
public:
typedef void result_type; //!< Indicates the functor's result type.
public:
/*! Constructor.
* \param priority The priority of the task.
* \param function The task's function object.
*/
prio_task_func(unsigned int const priority, task_func const & function)
: m_priority(priority)
, m_function(function)
{
}
/*! Executes the task function.
*/
void operator() (void) const
{
if(m_function)
{
m_function();
}
}
/*! Comparison operator which realises a partial ordering based on priorities.
* \param rhs The object to compare with.
* \return true if the priority of *this is less than right hand side's priority, false otherwise.
*/
bool operator< (const prio_task_func& rhs) const
{
return m_priority < rhs.m_priority;
}
}; // prio_task_func
/*! \brief Looped task function object.
*
* This function object wraps a boolean thread function object.
* The wrapped task function is invoked by calling the operator () and it is executed in regular
* time intervals until false is returned. The interval length may be zero.
* Please note that a pool's thread is engaged as long as the task is looped.
*
*/
class looped_task_func
{
private:
function0 m_function; //!< The task's function.
unsigned int m_break_s; //!< Duration of breaks in seconds.
unsigned int m_break_ns; //!< Duration of breaks in nano seconds.
public:
typedef void result_type; //!< Indicates the functor's result type.
public:
/*! Constructor.
* \param function The task's function object which is looped until false is returned.
* \param interval The minimum break time in milli seconds before the first execution of the task function and between the following ones.
*/
looped_task_func(function0 const & function, unsigned int const interval = 0)
: m_function(function)
{
m_break_s = interval / 1000;
m_break_ns = (interval - m_break_s * 1000) * 1000 * 1000;
}
/*! Executes the task function.
*/
void operator() (void) const
{
if(m_function)
{
if(m_break_s > 0 || m_break_ns > 0)
{ // Sleep some time before first execution
xtime xt;
xtime_get(&xt, TIME_UTC_);
xt.nsec += m_break_ns;
xt.sec += m_break_s;
thread::sleep(xt);
}
while(m_function())
{
if(m_break_s > 0 || m_break_ns > 0)
{
xtime xt;
xtime_get(&xt, TIME_UTC_);
xt.nsec += m_break_ns;
xt.sec += m_break_s;
thread::sleep(xt);
}
else
{
thread::yield(); // Be fair to other threads
}
}
}
}
}; // looped_task_func
} } // namespace boost::threadpool
#endif // THREADPOOL_TASK_ADAPTERS_HPP_INCLUDED
SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/ 0000775 0001750 0001750 00000000000 12110505246 031112 5 ustar dan dan ././@LongLink 0000000 0000000 0000000 00000000156 00000000000 011567 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/scope_guard.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/scope_0000644 0001750 0001750 00000001756 11644340035 032320 0 ustar dan dan /*! \file
* \brief TODO.
*
* TODO.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_DETAIL_SCOPE_GUARD_HPP_INCLUDED
#define THREADPOOL_DETAIL_SCOPE_GUARD_HPP_INCLUDED
#include
namespace boost { namespace threadpool { namespace detail
{
// TODO documentation
class scope_guard
: private boost::noncopyable
{
function0 const m_function;
bool m_is_active;
public:
scope_guard(function0 const & call_on_exit)
: m_function(call_on_exit)
, m_is_active(true)
{
}
~scope_guard()
{
if(m_is_active && m_function)
{
m_function();
}
}
void disable()
{
m_is_active = false;
}
};
} } } // namespace boost::threadpool::detail
#endif // THREADPOOL_DETAIL_SCOPE_GUARD_HPP_INCLUDED
././@LongLink 0000000 0000000 0000000 00000000160 00000000000 011562 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/worker_thread.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/worker0000644 0001750 0001750 00000005401 11644340035 032350 0 ustar dan dan /*! \file
* \brief Thread pool worker.
*
* The worker thread instance is attached to a pool
* and executes tasks of this pool.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_DETAIL_WORKER_THREAD_HPP_INCLUDED
#define THREADPOOL_DETAIL_WORKER_THREAD_HPP_INCLUDED
#include "scope_guard.hpp"
#include
#include
#include
#include
#include
namespace boost { namespace threadpool { namespace detail
{
/*! \brief Thread pool worker.
*
* A worker_thread represents a thread of execution. The worker is attached to a
* thread pool and processes tasks of that pool. The lifetime of the worker and its
* internal boost::thread is managed automatically.
*
* This class is a helper class and cannot be constructed or accessed directly.
*
* \see pool_core
*/
template
class worker_thread
: public enable_shared_from_this< worker_thread >
, private noncopyable
{
public:
typedef Pool pool_type; //!< Indicates the pool's type.
private:
shared_ptr m_pool; //!< Pointer to the pool which created the worker.
shared_ptr m_thread; //!< Pointer to the thread which executes the run loop.
/*! Constructs a new worker.
* \param pool Pointer to it's parent pool.
* \see function create_and_attach
*/
worker_thread(shared_ptr const & pool)
: m_pool(pool)
{
assert(pool);
}
/*! Notifies that an exception occurred in the run loop.
*/
void died_unexpectedly()
{
m_pool->worker_died_unexpectedly(this->shared_from_this());
}
public:
/*! Executes pool's tasks sequentially.
*/
void run()
{
scope_guard notify_exception(bind(&worker_thread::died_unexpectedly, this));
while(m_pool->execute_task()) {}
notify_exception.disable();
m_pool->worker_destructed(this->shared_from_this());
}
/*! Joins the worker's thread.
*/
void join()
{
m_thread->join();
}
/*! Constructs a new worker thread and attaches it to the pool.
* \param pool Pointer to the pool.
*/
static void create_and_attach(shared_ptr const & pool)
{
shared_ptr worker(new worker_thread(pool));
if(worker)
{
worker->m_thread.reset(new boost::thread(bind(&worker_thread::run, worker)));
}
}
};
} } } // namespace boost::threadpool::detail
#endif // THREADPOOL_DETAIL_WORKER_THREAD_HPP_INCLUDED
././@LongLink 0000000 0000000 0000000 00000000156 00000000000 011567 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/locking_ptr.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/lockin0000644 0001750 0001750 00000004050 11644340035 032315 0 ustar dan dan /*! \file
* \brief The locking_ptr is smart pointer with a scoped locking mechanism.
*
* The class is a wrapper for a volatile pointer. It enables synchronized access to the
* internal pointer by locking the passed mutex.
* locking_ptr is based on Andrei Alexandrescu's LockingPtr. For more information
* see article "volatile - Multithreaded Programmer's Best Friend" by A. Alexandrescu.
*
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_DETAIL_LOCKING_PTR_HPP_INCLUDED
#define THREADPOOL_DETAIL_LOCKING_PTR_HPP_INCLUDED
#include
#include
namespace boost { namespace threadpool { namespace detail
{
/*! \brief Smart pointer with a scoped locking mechanism.
*
* This class is a wrapper for a volatile pointer. It enables synchronized access to the
* internal pointer by locking the passed mutex.
*/
template
class locking_ptr
: private noncopyable
{
T* m_obj; //!< The instance pointer.
Mutex & m_mutex; //!< Mutex is used for scoped locking.
public:
/// Constructor.
locking_ptr(volatile T& obj, const volatile Mutex& mtx)
: m_obj(const_cast(&obj))
, m_mutex(*const_cast(&mtx))
{
// Lock mutex
m_mutex.lock();
}
/// Destructor.
~locking_ptr()
{
// Unlock mutex
m_mutex.unlock();
}
/*! Returns a reference to the stored instance.
* \return The instance's reference.
*/
T& operator*() const
{
return *m_obj;
}
/*! Returns a pointer to the stored instance.
* \return The instance's pointer.
*/
T* operator->() const
{
return m_obj;
}
};
} } } // namespace boost::threadpool::detail
#endif // THREADPOOL_DETAIL_LOCKING_PTR_HPP_INCLUDED
././@LongLink 0000000 0000000 0000000 00000000151 00000000000 011562 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/future.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/future0000644 0001750 0001750 00000010561 11644340035 032354 0 ustar dan dan /*! \file
* \brief TODO.
*
* TODO.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_DETAIL_FUTURE_IMPL_HPP_INCLUDED
#define THREADPOOL_DETAIL_FUTURE_IMPL_HPP_INCLUDED
#include "locking_ptr.hpp"
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace threadpool { namespace detail
{
template
class future_impl
{
public:
typedef Result const & result_type; //!< Indicates the functor's result type.
typedef Result future_result_type; //!< Indicates the future's result type.
typedef future_impl future_type;
private:
volatile bool m_ready;
volatile future_result_type m_result;
mutable mutex m_monitor;
mutable condition m_condition_ready;
volatile bool m_is_cancelled;
volatile bool m_executing;
public:
public:
future_impl()
: m_ready(false)
, m_is_cancelled(false)
{
}
bool ready() const volatile
{
return m_ready;
}
void wait() const volatile
{
const future_type* self = const_cast(this);
mutex::scoped_lock lock(self->m_monitor);
while(!m_ready)
{
self->m_condition_ready.wait(lock);
}
}
bool timed_wait(boost::xtime const & timestamp) const
{
const future_type* self = const_cast(this);
mutex::scoped_lock lock(self->m_monitor);
while(!m_ready)
{
if(!self->m_condition_ready.timed_wait(lock, timestamp)) return false;
}
return true;
}
result_type operator()() const volatile
{
wait();
/*
if( throw_exception_ != 0 )
{
throw_exception_( this );
}
*/
return *(const_cast(&m_result));
}
void set_value(future_result_type const & r) volatile
{
locking_ptr lockedThis(*this, m_monitor);
if(!m_ready && !m_is_cancelled)
{
lockedThis->m_result = r;
lockedThis->m_ready = true;
lockedThis->m_condition_ready.notify_all();
}
}
/*
template void set_exception() // throw()
{
m_impl->template set_exception();
}
template void set_exception( char const * what ) // throw()
{
m_impl->template set_exception( what );
}
*/
bool cancel() volatile
{
if(!m_ready || m_executing)
{
m_is_cancelled = true;
return true;
}
else
{
return false;
}
}
bool is_cancelled() const volatile
{
return m_is_cancelled;
}
void set_execution_status(bool executing) volatile
{
m_executing = executing;
}
};
template<
template class Future,
typename Function
>
class future_impl_task_func
{
public:
typedef void result_type; //!< Indicates the functor's result type.
typedef Function function_type; //!< Indicates the function's type.
typedef typename result_of::type future_result_type; //!< Indicates the future's result type.
typedef Future future_type; //!< Indicates the future's type.
// The task is required to be a nullary function.
BOOST_STATIC_ASSERT(function_traits::arity == 0);
// The task function's result type is required not to be void.
BOOST_STATIC_ASSERT(!is_void::value);
private:
function_type m_function;
shared_ptr m_future;
public:
future_impl_task_func(function_type const & function, shared_ptr const & future)
: m_function(function)
, m_future(future)
{
}
void operator()()
{
if(m_function)
{
m_future->set_execution_status(true);
if(!m_future->is_cancelled())
{
// TODO future exeception handling
m_future->set_value(m_function());
}
m_future->set_execution_status(false); // TODO consider exceptions
}
}
};
} } } // namespace boost::threadpool::detail
#endif // THREADPOOL_DETAIL_FUTURE_IMPL_HPP_INCLUDED
././@LongLink 0000000 0000000 0000000 00000000154 00000000000 011565 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/pool_core.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/detail/pool_c0000644 0001750 0001750 00000033150 11644340035 032314 0 ustar dan dan /*! \file
* \brief Thread pool core.
*
* This file contains the threadpool's core class: pool.
*
* Thread pools are a mechanism for asynchronous and parallel processing
* within the same process. The pool class provides a convenient way
* for dispatching asynchronous tasks as functions objects. The scheduling
* of these tasks can be easily controlled by using customized schedulers.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_POOL_CORE_HPP_INCLUDED
#define THREADPOOL_POOL_CORE_HPP_INCLUDED
#include "locking_ptr.hpp"
#include "worker_thread.hpp"
#include "../task_adaptors.hpp"
#include
#include
#include
#include
#include
#include
#include
#include
#include
/// The namespace threadpool contains a thread pool and related utility classes.
namespace boost { namespace threadpool { namespace detail
{
/*! \brief Thread pool.
*
* Thread pools are a mechanism for asynchronous and parallel processing
* within the same process. The pool class provides a convenient way
* for dispatching asynchronous tasks as functions objects. The scheduling
* of these tasks can be easily controlled by using customized schedulers.
* A task must not throw an exception.
*
* A pool_impl is DefaultConstructible and NonCopyable.
*
* \param Task A function object which implements the operator 'void operator() (void) const'. The operator () is called by the pool to execute the task. Exceptions are ignored.
* \param Scheduler A task container which determines how tasks are scheduled. It is guaranteed that this container is accessed only by one thread at a time. The scheduler shall not throw exceptions.
*
* \remarks The pool class is thread-safe.
*
* \see Tasks: task_func, prio_task_func
* \see Scheduling policies: fifo_scheduler, lifo_scheduler, prio_scheduler
*/
template <
typename Task,
template class SchedulingPolicy,
template class SizePolicy,
template class SizePolicyController,
template class ShutdownPolicy
>
class pool_core
: public enable_shared_from_this< pool_core >
, private noncopyable
{
public: // Type definitions
typedef Task task_type; //!< Indicates the task's type.
typedef SchedulingPolicy scheduler_type; //!< Indicates the scheduler's type.
typedef pool_core pool_type; //!< Indicates the thread pool's type.
typedef SizePolicy size_policy_type; //!< Indicates the sizer's type.
//typedef typename size_policy_type::size_controller size_controller_type;
typedef SizePolicyController size_controller_type;
// typedef SizePolicy::size_controller size_controller_type;
typedef ShutdownPolicy shutdown_policy_type;//!< Indicates the shutdown policy's type.
typedef worker_thread worker_type;
// The task is required to be a nullary function.
BOOST_STATIC_ASSERT(function_traits::arity == 0);
// The task function's result type is required to be void.
BOOST_STATIC_ASSERT(is_void::type >::value);
private: // Friends
friend class worker_thread;
#if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x580) // Tested with CC: Sun C++ 5.8 Patch 121018-08 2006/12/06
friend class SizePolicy;
friend class ShutdownPolicy;
#else
friend class SizePolicy;
friend class ShutdownPolicy;
#endif
private: // The following members may be accessed by _multiple_ threads at the same time:
volatile size_t m_worker_count;
volatile size_t m_target_worker_count;
volatile size_t m_active_worker_count;
private: // The following members are accessed only by _one_ thread at the same time:
scheduler_type m_scheduler;
scoped_ptr m_size_policy; // is never null
bool m_terminate_all_workers; // Indicates if termination of all workers was triggered.
std::vector > m_terminated_workers; // List of workers which are terminated but not fully destructed.
private: // The following members are implemented thread-safe:
mutable recursive_mutex m_monitor;
mutable condition m_worker_idle_or_terminated_event; // A worker is idle or was terminated.
mutable condition m_task_or_terminate_workers_event; // Task is available OR total worker count should be reduced.
public:
/// Constructor.
pool_core()
: m_worker_count(0)
, m_target_worker_count(0)
, m_active_worker_count(0)
, m_terminate_all_workers(false)
{
pool_type volatile & self_ref = *this;
m_size_policy.reset(new size_policy_type(self_ref));
m_scheduler.clear();
}
/// Destructor.
~pool_core()
{
}
/*! Gets the size controller which manages the number of threads in the pool.
* \return The size controller.
* \see SizePolicy
*/
size_controller_type size_controller()
{
return size_controller_type(*m_size_policy, this->shared_from_this());
}
/*! Gets the number of threads in the pool.
* \return The number of threads.
*/
size_t size() const volatile
{
return m_worker_count;
}
// TODO is only called once
void shutdown()
{
ShutdownPolicy::shutdown(*this);
}
/*! Schedules a task for asynchronous execution. The task will be executed once only.
* \param task The task function object. It should not throw execeptions.
* \return true, if the task could be scheduled and false otherwise.
*/
bool schedule(task_type const & task) volatile
{
locking_ptr lockedThis(*this, m_monitor);
if(lockedThis->m_scheduler.push(task))
{
lockedThis->m_task_or_terminate_workers_event.notify_one();
return true;
}
else
{
return false;
}
}
/*! Returns the number of tasks which are currently executed.
* \return The number of active tasks.
*/
size_t active() const volatile
{
return m_active_worker_count;
}
/*! Returns the number of tasks which are ready for execution.
* \return The number of pending tasks.
*/
size_t pending() const volatile
{
locking_ptr lockedThis(*this, m_monitor);
return lockedThis->m_scheduler.size();
}
/*! Removes all pending tasks from the pool's scheduler.
*/
void clear() volatile
{
locking_ptr lockedThis(*this, m_monitor);
lockedThis->m_scheduler.clear();
}
/*! Indicates that there are no tasks pending.
* \return true if there are no tasks ready for execution.
* \remarks This function is more efficient that the check 'pending() == 0'.
*/
bool empty() const volatile
{
locking_ptr lockedThis(*this, m_monitor);
return lockedThis->m_scheduler.empty();
}
/*! The current thread of execution is blocked until the sum of all active
* and pending tasks is equal or less than a given threshold.
* \param task_threshold The maximum number of tasks in pool and scheduler.
*/
void wait(size_t const task_threshold = 0) const volatile
{
const pool_type* self = const_cast(this);
recursive_mutex::scoped_lock lock(self->m_monitor);
if(0 == task_threshold)
{
while(0 != self->m_active_worker_count || !self->m_scheduler.empty())
{
self->m_worker_idle_or_terminated_event.wait(lock);
}
}
else
{
while(task_threshold < self->m_active_worker_count + self->m_scheduler.size())
{
self->m_worker_idle_or_terminated_event.wait(lock);
}
}
}
/*! The current thread of execution is blocked until the timestamp is met
* or the sum of all active and pending tasks is equal or less
* than a given threshold.
* \param timestamp The time when function returns at the latest.
* \param task_threshold The maximum number of tasks in pool and scheduler.
* \return true if the task sum is equal or less than the threshold, false otherwise.
*/
bool wait(xtime const & timestamp, size_t const task_threshold = 0) const volatile
{
const pool_type* self = const_cast(this);
recursive_mutex::scoped_lock lock(self->m_monitor);
if(0 == task_threshold)
{
while(0 != self->m_active_worker_count || !self->m_scheduler.empty())
{
if(!self->m_worker_idle_or_terminated_event.timed_wait(lock, timestamp)) return false;
}
}
else
{
while(task_threshold < self->m_active_worker_count + self->m_scheduler.size())
{
if(!self->m_worker_idle_or_terminated_event.timed_wait(lock, timestamp)) return false;
}
}
return true;
}
private:
void terminate_all_workers(bool const wait) volatile
{
pool_type* self = const_cast(this);
recursive_mutex::scoped_lock lock(self->m_monitor);
self->m_terminate_all_workers = true;
m_target_worker_count = 0;
self->m_task_or_terminate_workers_event.notify_all();
if(wait)
{
while(m_active_worker_count > 0)
{
self->m_worker_idle_or_terminated_event.wait(lock);
}
for(typename std::vector >::iterator it = self->m_terminated_workers.begin();
it != self->m_terminated_workers.end();
++it)
{
(*it)->join();
}
self->m_terminated_workers.clear();
}
}
/*! Changes the number of worker threads in the pool. The resizing
* is handled by the SizePolicy.
* \param threads The new number of worker threads.
* \return true, if pool will be resized and false if not.
*/
bool resize(size_t const worker_count) volatile
{
locking_ptr lockedThis(*this, m_monitor);
if(!m_terminate_all_workers)
{
m_target_worker_count = worker_count;
}
else
{
return false;
}
if(m_worker_count <= m_target_worker_count)
{ // increase worker count
while(m_worker_count < m_target_worker_count)
{
try
{
worker_thread::create_and_attach(lockedThis->shared_from_this());
m_worker_count++;
m_active_worker_count++;
}
catch(thread_resource_error)
{
return false;
}
}
}
else
{ // decrease worker count
lockedThis->m_task_or_terminate_workers_event.notify_all(); // TODO: Optimize number of notified workers
}
return true;
}
// worker died with unhandled exception
void worker_died_unexpectedly(shared_ptr worker) volatile
{
locking_ptr lockedThis(*this, m_monitor);
m_worker_count--;
m_active_worker_count--;
lockedThis->m_worker_idle_or_terminated_event.notify_all();
if(m_terminate_all_workers)
{
lockedThis->m_terminated_workers.push_back(worker);
}
else
{
lockedThis->m_size_policy->worker_died_unexpectedly(m_worker_count);
}
}
void worker_destructed(shared_ptr worker) volatile
{
locking_ptr lockedThis(*this, m_monitor);
m_worker_count--;
m_active_worker_count--;
lockedThis->m_worker_idle_or_terminated_event.notify_all();
if(m_terminate_all_workers)
{
lockedThis->m_terminated_workers.push_back(worker);
}
}
bool execute_task() volatile
{
function0 task;
{ // fetch task
pool_type* lockedThis = const_cast(this);
recursive_mutex::scoped_lock lock(lockedThis->m_monitor);
// decrease number of threads if necessary
if(m_worker_count > m_target_worker_count)
{
return false; // terminate worker
}
// wait for tasks
while(lockedThis->m_scheduler.empty())
{
// decrease number of workers if necessary
if(m_worker_count > m_target_worker_count)
{
return false; // terminate worker
}
else
{
m_active_worker_count--;
lockedThis->m_worker_idle_or_terminated_event.notify_all();
lockedThis->m_task_or_terminate_workers_event.wait(lock);
m_active_worker_count++;
}
}
task = lockedThis->m_scheduler.top();
lockedThis->m_scheduler.pop();
}
// call task function
if(task)
{
task();
}
//guard->disable();
return true;
}
};
} } } // namespace boost::threadpool::detail
#endif // THREADPOOL_POOL_CORE_HPP_INCLUDED
SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/future.hpp 0000644 0001750 0001750 00000005131 11644340035 031675 0 ustar dan dan /*! \file
* \brief TODO.
*
* TODO.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_FUTURE_HPP_INCLUDED
#define THREADPOOL_FUTURE_HPP_INCLUDED
#include "./detail/future.hpp"
#include
//#include "pool.hpp"
//#include
//#include
namespace boost { namespace threadpool
{
/*! \brief Experimental. Do not use in production code. TODO.
*
* TODO Future
*
* \see TODO
*
*/
template
class future
{
private:
shared_ptr > m_impl;
public:
typedef Result const & result_type; //!< Indicates the functor's result type.
typedef Result future_result_type; //!< Indicates the future's result type.
public:
future()
: m_impl(new detail::future_impl()) // TODO remove this
{
}
// only for internal usage
future(shared_ptr > const & impl)
: m_impl(impl)
{
}
bool ready() const
{
return m_impl->ready();
}
void wait() const
{
m_impl->wait();
}
bool timed_wait(boost::xtime const & timestamp) const
{
return m_impl->timed_wait(timestamp);
}
result_type operator()() // throw( thread::cancelation_exception, ... )
{
return (*m_impl)();
}
result_type get() // throw( thread::cancelation_exception, ... )
{
return (*m_impl)();
}
bool cancel()
{
return m_impl->cancel();
}
bool is_cancelled() const
{
return m_impl->is_cancelled();
}
};
template
typename disable_if <
is_void< typename result_of< Function() >::type >,
future< typename result_of< Function() >::type >
>::type
schedule(Pool& pool, const Function& task)
{
typedef typename result_of< Function() >::type future_result_type;
// create future impl and future
shared_ptr > impl(new detail::future_impl);
future res(impl);
// schedule future impl
pool.schedule(detail::future_impl_task_func(task, impl));
// return future
return res;
/*
TODO
if(pool->schedule(bind(&Future::run, future)))
{
return future;
}
else
{
// construct empty future
return error_future;
}
*/
}
} } // namespace boost::threadpool
#endif // THREADPOOL_FUTURE_HPP_INCLUDED
././@LongLink 0000000 0000000 0000000 00000000157 00000000000 011570 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/scheduling_policies.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/scheduling_po0000644 0001750 0001750 00000014626 11644340035 032431 0 ustar dan dan /*! \file
* \brief Task scheduling policies.
*
* This file contains some fundamental scheduling policies for the pool class.
* A scheduling policy is realized by a task container which controls the access to
* the tasks. Fundamentally the container determines the order the tasks are processed
* by the thread pool.
* The task containers need not to be thread-safe because they are used by the pool
* in thread-safe way.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_SCHEDULING_POLICIES_HPP_INCLUDED
#define THREADPOOL_SCHEDULING_POLICIES_HPP_INCLUDED
#include
#include
#include "task_adaptors.hpp"
namespace boost { namespace threadpool
{
/*! \brief SchedulingPolicy which implements FIFO ordering.
*
* This container implements a FIFO scheduling policy.
* The first task to be added to the scheduler will be the first to be removed.
* The processing proceeds sequentially in the same order.
* FIFO stands for "first in, first out".
*
* \param Task A function object which implements the operator()(void).
*
*/
template
class fifo_scheduler
{
public:
typedef Task task_type; //!< Indicates the scheduler's task type.
protected:
std::deque m_container; //!< Internal task container.
public:
/*! Adds a new task to the scheduler.
* \param task The task object.
* \return true, if the task could be scheduled and false otherwise.
*/
bool push(task_type const & task)
{
m_container.push_back(task);
return true;
}
/*! Removes the task which should be executed next.
*/
void pop()
{
m_container.pop_front();
}
/*! Gets the task which should be executed next.
* \return The task object to be executed.
*/
task_type const & top() const
{
return m_container.front();
}
/*! Gets the current number of tasks in the scheduler.
* \return The number of tasks.
* \remarks Prefer empty() to size() == 0 to check if the scheduler is empty.
*/
size_t size() const
{
return m_container.size();
}
/*! Checks if the scheduler is empty.
* \return true if the scheduler contains no tasks, false otherwise.
* \remarks Is more efficient than size() == 0.
*/
bool empty() const
{
return m_container.empty();
}
/*! Removes all tasks from the scheduler.
*/
void clear()
{
m_container.clear();
}
};
/*! \brief SchedulingPolicy which implements LIFO ordering.
*
* This container implements a LIFO scheduling policy.
* The last task to be added to the scheduler will be the first to be removed.
* LIFO stands for "last in, first out".
*
* \param Task A function object which implements the operator()(void).
*
*/
template
class lifo_scheduler
{
public:
typedef Task task_type; //!< Indicates the scheduler's task type.
protected:
std::deque m_container; //!< Internal task container.
public:
/*! Adds a new task to the scheduler.
* \param task The task object.
* \return true, if the task could be scheduled and false otherwise.
*/
bool push(task_type const & task)
{
m_container.push_front(task);
return true;
}
/*! Removes the task which should be executed next.
*/
void pop()
{
m_container.pop_front();
}
/*! Gets the task which should be executed next.
* \return The task object to be executed.
*/
task_type const & top() const
{
return m_container.front();
}
/*! Gets the current number of tasks in the scheduler.
* \return The number of tasks.
* \remarks Prefer empty() to size() == 0 to check if the scheduler is empty.
*/
size_t size() const
{
return m_container.size();
}
/*! Checks if the scheduler is empty.
* \return true if the scheduler contains no tasks, false otherwise.
* \remarks Is more efficient than size() == 0.
*/
bool empty() const
{
return m_container.empty();
}
/*! Removes all tasks from the scheduler.
*/
void clear()
{
m_container.clear();
}
};
/*! \brief SchedulingPolicy which implements prioritized ordering.
*
* This container implements a scheduling policy based on task priorities.
* The task with highest priority will be the first to be removed.
* It must be possible to compare two tasks using operator<.
*
* \param Task A function object which implements the operator() and operator<. operator< must be a partial ordering.
*
* \see prio_thread_func
*
*/
template
class prio_scheduler
{
public:
typedef Task task_type; //!< Indicates the scheduler's task type.
protected:
std::priority_queue m_container; //!< Internal task container.
public:
/*! Adds a new task to the scheduler.
* \param task The task object.
* \return true, if the task could be scheduled and false otherwise.
*/
bool push(task_type const & task)
{
m_container.push(task);
return true;
}
/*! Removes the task which should be executed next.
*/
void pop()
{
m_container.pop();
}
/*! Gets the task which should be executed next.
* \return The task object to be executed.
*/
task_type const & top() const
{
return m_container.top();
}
/*! Gets the current number of tasks in the scheduler.
* \return The number of tasks.
* \remarks Prefer empty() to size() == 0 to check if the scheduler is empty.
*/
size_t size() const
{
return m_container.size();
}
/*! Checks if the scheduler is empty.
* \return true if the scheduler contains no tasks, false otherwise.
* \remarks Is more efficient than size() == 0.
*/
bool empty() const
{
return m_container.empty();
}
/*! Removes all tasks from the scheduler.
*/
void clear()
{
while(!m_container.empty())
{
m_container.pop();
}
}
};
} } // namespace boost::threadpool
#endif // THREADPOOL_SCHEDULING_POLICIES_HPP_INCLUDED
././@LongLink 0000000 0000000 0000000 00000000155 00000000000 011566 L ustar root root SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/shutdown_policies.hpp SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/shutdown_poli0000644 0001750 0001750 00000003645 11644340035 032503 0 ustar dan dan /*! \file
* \brief Shutdown policies.
*
* This file contains shutdown policies for thread_pool.
* A shutdown policy controls the pool's behavior from the time
* when the pool is not referenced any longer.
*
* Copyright (c) 2005-2007 Philipp Henkel
*
* Use, modification, and distribution are subject to the
* Boost Software License, Version 1.0. (See accompanying file
* LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*
* http://threadpool.sourceforge.net
*
*/
#ifndef THREADPOOL_SHUTDOWN_POLICIES_HPP_INCLUDED
#define THREADPOOL_SHUTDOWN_POLICIES_HPP_INCLUDED
/// The namespace threadpool contains a thread pool and related utility classes.
namespace boost { namespace threadpool
{
/*! \brief ShutdownPolicy which waits for the completion of all tasks
* and the worker termination afterwards.
*
* \param Pool The pool's core type.
*/
template
class wait_for_all_tasks
{
public:
static void shutdown(Pool& pool)
{
pool.wait();
pool.terminate_all_workers(true);
}
};
/*! \brief ShutdownPolicy which waits for the completion of all active tasks
* and the worker termination afterwards.
*
* \param Pool The pool's core type.
*/
template
class wait_for_active_tasks
{
public:
static void shutdown(Pool& pool)
{
pool.clear();
pool.wait();
pool.terminate_all_workers(true);
}
};
/*! \brief ShutdownPolicy which does not wait for any tasks or worker termination.
*
* This policy does not wait for any tasks. Nevertheless all active tasks will be processed completely.
*
* \param Pool The pool's core type.
*/
template
class immediately
{
public:
static void shutdown(Pool& pool)
{
pool.clear();
pool.terminate_all_workers(false);
}
};
} } // namespace boost::threadpool
#endif // THREADPOOL_SHUTDOWN_POLICIES_HPP_INCLUDED
SuperCollider-3.6.3-Source-linux~repack/external_libraries/threadpool/boost/threadpool/pool.hpp 0000644 0001750 0001750 00000016720 11644340035 031342 0 ustar dan dan /*! \file
* \brief Thread pool core.
*
* This file contains the threadpool's core class: pool