| /* A Bison parser, made by GNU Bison 3.7.6. */ |
| |
| /* Bison implementation for Yacc-like parsers in C |
| |
| Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 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 <https://www.gnu.org/licenses/>. */ |
| |
| /* 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. */ |
| |
| /* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual, |
| especially those whose name start with YY_ or yy_. They are |
| private implementation details that can be changed or removed. */ |
| |
| /* 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, and Bison version. */ |
| #define YYBISON 30706 |
| |
| /* Bison version string. */ |
| #define YYBISON_VERSION "3.7.6" |
| |
| /* Skeleton name. */ |
| #define YYSKELETON_NAME "yacc.c" |
| |
| /* Pure parsers. */ |
| #define YYPURE 0 |
| |
| /* Push parsers. */ |
| #define YYPUSH 0 |
| |
| /* Pull parsers. */ |
| #define YYPULL 1 |
| |
| |
| |
| |
| /* First part of user prologue. */ |
| #line 1 "getdate.y" |
| |
| /* |
| ** Originally written by Steven M. Bellovin <smb@research.att.com> while |
| ** at the University of North Carolina at Chapel Hill. Later tweaked by |
| ** a couple of people on Usenet. Completely overhauled by Rich $alz |
| ** <rsalz@bbn.com> and Jim Berets <jberets@bbn.com> in August, 1990. |
| ** |
| ** This code is in the public domain and has no copyright. |
| */ |
| |
| #include "config.h" |
| |
| /* Since the code of getdate.y is not included in the Emacs executable |
| itself, there is no need to #define static in this file. Even if |
| the code were included in the Emacs executable, it probably |
| wouldn't do any harm to #undef it here; this will only cause |
| problems if we try to write to a static variable, which I don't |
| think this code needs to do. */ |
| #ifdef emacs |
| # undef static |
| #endif |
| |
| #include <stdio.h> |
| #include <ctype.h> |
| |
| #if HAVE_STDLIB_H |
| # include <stdlib.h> /* for `free'; used by Bison 1.27 */ |
| #endif |
| |
| #if defined (STDC_HEADERS) || (!defined (isascii) && !defined (HAVE_ISASCII)) |
| # define IN_CTYPE_DOMAIN(c) 1 |
| #else |
| # define IN_CTYPE_DOMAIN(c) isascii(c) |
| #endif |
| |
| #define ISSPACE(c) (IN_CTYPE_DOMAIN (c) && isspace (c)) |
| #define ISALPHA(c) (IN_CTYPE_DOMAIN (c) && isalpha (c)) |
| #define ISUPPER(c) (IN_CTYPE_DOMAIN (c) && isupper (c)) |
| #define ISDIGIT_LOCALE(c) (IN_CTYPE_DOMAIN (c) && isdigit (c)) |
| |
| /* ISDIGIT differs from ISDIGIT_LOCALE, as follows: |
| - Its arg may be any int or unsigned int; it need not be an unsigned char. |
| - It's guaranteed to evaluate its argument exactly once. |
| - It's typically faster. |
| Posix 1003.2-1992 section 2.5.2.1 page 50 lines 1556-1558 says that |
| only '0' through '9' are digits. Prefer ISDIGIT to ISDIGIT_LOCALE unless |
| it's important to use the locale's definition of `digit' even when the |
| host does not conform to Posix. */ |
| #define ISDIGIT(c) ((unsigned) (c) - '0' <= 9) |
| |
| #if defined (STDC_HEADERS) || defined (USG) |
| # include <string.h> |
| #endif |
| |
| #if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 7) |
| # define __attribute__(x) |
| #endif |
| |
| #ifndef ATTRIBUTE_UNUSED |
| # define ATTRIBUTE_UNUSED __attribute__ ((__unused__)) |
| #endif |
| |
| /* Some old versions of bison generate parsers that use bcopy. |
| That loses on systems that don't provide the function, so we have |
| to redefine it here. */ |
| #if !defined (HAVE_BCOPY) && defined (HAVE_MEMCPY) && !defined (bcopy) |
| # define bcopy(from, to, len) memcpy ((to), (from), (len)) |
| #endif |
| |
| /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc), |
| as well as gratuitiously global symbol names, so we can have multiple |
| yacc generated parsers in the same program. Note that these are only |
| the variables produced by yacc. If other parser generators (bison, |
| byacc, etc) produce additional global names that conflict at link time, |
| then those parser generators need to be fixed instead of adding those |
| names to this list. */ |
| |
| #define yymaxdepth gd_maxdepth |
| #define yyparse gd_parse |
| #define yylex gd_lex |
| #define yyerror gd_error |
| #define yylval gd_lval |
| #define yychar gd_char |
| #define yydebug gd_debug |
| #define yypact gd_pact |
| #define yyr1 gd_r1 |
| #define yyr2 gd_r2 |
| #define yydef gd_def |
| #define yychk gd_chk |
| #define yypgo gd_pgo |
| #define yyact gd_act |
| #define yyexca gd_exca |
| #define yyerrflag gd_errflag |
| #define yynerrs gd_nerrs |
| #define yyps gd_ps |
| #define yypv gd_pv |
| #define yys gd_s |
| #define yy_yys gd_yys |
| #define yystate gd_state |
| #define yytmp gd_tmp |
| #define yyv gd_v |
| #define yy_yyv gd_yyv |
| #define yyval gd_val |
| #define yylloc gd_lloc |
| #define yyreds gd_reds /* With YYDEBUG defined */ |
| #define yytoks gd_toks /* With YYDEBUG defined */ |
| #define yylhs gd_yylhs |
| #define yylen gd_yylen |
| #define yydefred gd_yydefred |
| #define yydgoto gd_yydgoto |
| #define yysindex gd_yysindex |
| #define yyrindex gd_yyrindex |
| #define yygindex gd_yygindex |
| #define yytable gd_yytable |
| #define yycheck gd_yycheck |
| |
| static int yylex (void); |
| static int yyerror (char *s); |
| |
| #define EPOCH 1970 |
| #define HOUR(x) ((x) * 60) |
| |
| #define MAX_BUFF_LEN 128 /* size of buffer to read the date into */ |
| |
| /* |
| ** An entry in the lexical lookup table. |
| */ |
| typedef struct _TABLE { |
| const char *name; |
| int type; |
| int value; |
| } TABLE; |
| |
| |
| /* |
| ** Meridian: am, pm, or 24-hour style. |
| */ |
| typedef enum _MERIDIAN { |
| MERam, MERpm, MER24 |
| } MERIDIAN; |
| |
| |
| /* |
| ** Global variables. We could get rid of most of these by using a good |
| ** union as the yacc stack. (This routine was originally written before |
| ** yacc had the %union construct.) Maybe someday; right now we only use |
| ** the %union very rarely. |
| */ |
| static const char *yyInput; |
| static int yyDayOrdinal; |
| static int yyDayNumber; |
| static int yyHaveDate; |
| static int yyHaveDay; |
| static int yyHaveRel; |
| static int yyHaveTime; |
| static int yyHaveZone; |
| static int yyTimezone; |
| static int yyDay; |
| static int yyHour; |
| static int yyMinutes; |
| static int yyMonth; |
| static int yySeconds; |
| static int yyYear; |
| static MERIDIAN yyMeridian; |
| static int yyRelDay; |
| static int yyRelHour; |
| static int yyRelMinutes; |
| static int yyRelMonth; |
| static int yyRelSeconds; |
| static int yyRelYear; |
| |
| |
| #line 244 "getdate.c" |
| |
| # ifndef YY_CAST |
| # ifdef __cplusplus |
| # define YY_CAST(Type, Val) static_cast<Type> (Val) |
| # define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val) |
| # else |
| # define YY_CAST(Type, Val) ((Type) (Val)) |
| # define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val)) |
| # endif |
| # endif |
| # ifndef YY_NULLPTR |
| # if defined __cplusplus |
| # if 201103L <= __cplusplus |
| # define YY_NULLPTR nullptr |
| # else |
| # define YY_NULLPTR 0 |
| # endif |
| # else |
| # define YY_NULLPTR ((void*)0) |
| # endif |
| # endif |
| |
| |
| /* Debug traces. */ |
| #ifndef YYDEBUG |
| # define YYDEBUG 0 |
| #endif |
| #if YYDEBUG |
| extern int yydebug; |
| #endif |
| |
| /* Token kinds. */ |
| #ifndef YYTOKENTYPE |
| # define YYTOKENTYPE |
| enum yytokentype |
| { |
| YYEMPTY = -2, |
| YYEOF = 0, /* "end of file" */ |
| YYerror = 256, /* error */ |
| YYUNDEF = 257, /* "invalid token" */ |
| tAGO = 258, /* tAGO */ |
| tDAY = 259, /* tDAY */ |
| tDAY_UNIT = 260, /* tDAY_UNIT */ |
| tDAYZONE = 261, /* tDAYZONE */ |
| tDST = 262, /* tDST */ |
| tHOUR_UNIT = 263, /* tHOUR_UNIT */ |
| tID = 264, /* tID */ |
| tMERIDIAN = 265, /* tMERIDIAN */ |
| tMINUTE_UNIT = 266, /* tMINUTE_UNIT */ |
| tMONTH = 267, /* tMONTH */ |
| tMONTH_UNIT = 268, /* tMONTH_UNIT */ |
| tSEC_UNIT = 269, /* tSEC_UNIT */ |
| tSNUMBER = 270, /* tSNUMBER */ |
| tUNUMBER = 271, /* tUNUMBER */ |
| tYEAR_UNIT = 272, /* tYEAR_UNIT */ |
| tZONE = 273 /* tZONE */ |
| }; |
| typedef enum yytokentype yytoken_kind_t; |
| #endif |
| |
| /* Value type. */ |
| #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED |
| union YYSTYPE |
| { |
| #line 177 "getdate.y" |
| |
| int Number; |
| enum _MERIDIAN Meridian; |
| |
| #line 314 "getdate.c" |
| |
| }; |
| typedef union YYSTYPE YYSTYPE; |
| # define YYSTYPE_IS_TRIVIAL 1 |
| # define YYSTYPE_IS_DECLARED 1 |
| #endif |
| |
| |
| extern YYSTYPE yylval; |
| |
| int yyparse (void); |
| |
| |
| /* Symbol kind. */ |
| enum yysymbol_kind_t |
| { |
| YYSYMBOL_YYEMPTY = -2, |
| YYSYMBOL_YYEOF = 0, /* "end of file" */ |
| YYSYMBOL_YYerror = 1, /* error */ |
| YYSYMBOL_YYUNDEF = 2, /* "invalid token" */ |
| YYSYMBOL_tAGO = 3, /* tAGO */ |
| YYSYMBOL_tDAY = 4, /* tDAY */ |
| YYSYMBOL_tDAY_UNIT = 5, /* tDAY_UNIT */ |
| YYSYMBOL_tDAYZONE = 6, /* tDAYZONE */ |
| YYSYMBOL_tDST = 7, /* tDST */ |
| YYSYMBOL_tHOUR_UNIT = 8, /* tHOUR_UNIT */ |
| YYSYMBOL_tID = 9, /* tID */ |
| YYSYMBOL_tMERIDIAN = 10, /* tMERIDIAN */ |
| YYSYMBOL_tMINUTE_UNIT = 11, /* tMINUTE_UNIT */ |
| YYSYMBOL_tMONTH = 12, /* tMONTH */ |
| YYSYMBOL_tMONTH_UNIT = 13, /* tMONTH_UNIT */ |
| YYSYMBOL_tSEC_UNIT = 14, /* tSEC_UNIT */ |
| YYSYMBOL_tSNUMBER = 15, /* tSNUMBER */ |
| YYSYMBOL_tUNUMBER = 16, /* tUNUMBER */ |
| YYSYMBOL_tYEAR_UNIT = 17, /* tYEAR_UNIT */ |
| YYSYMBOL_tZONE = 18, /* tZONE */ |
| YYSYMBOL_19_ = 19, /* ':' */ |
| YYSYMBOL_20_ = 20, /* ',' */ |
| YYSYMBOL_21_ = 21, /* '/' */ |
| YYSYMBOL_YYACCEPT = 22, /* $accept */ |
| YYSYMBOL_spec = 23, /* spec */ |
| YYSYMBOL_item = 24, /* item */ |
| YYSYMBOL_time = 25, /* time */ |
| YYSYMBOL_zone = 26, /* zone */ |
| YYSYMBOL_day = 27, /* day */ |
| YYSYMBOL_date = 28, /* date */ |
| YYSYMBOL_rel = 29, /* rel */ |
| YYSYMBOL_relunit = 30, /* relunit */ |
| YYSYMBOL_number = 31, /* number */ |
| YYSYMBOL_o_merid = 32 /* o_merid */ |
| }; |
| typedef enum yysymbol_kind_t yysymbol_kind_t; |
| |
| |
| |
| |
| #ifdef short |
| # undef short |
| #endif |
| |
| /* On compilers that do not define __PTRDIFF_MAX__ etc., make sure |
| <limits.h> and (if available) <stdint.h> are included |
| so that the code can choose integer types of a good width. */ |
| |
| #ifndef __PTRDIFF_MAX__ |
| # include <limits.h> /* INFRINGES ON USER NAME SPACE */ |
| # if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__ |
| # include <stdint.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YY_STDINT_H |
| # endif |
| #endif |
| |
| /* Narrow types that promote to a signed type and that can represent a |
| signed or unsigned integer of at least N bits. In tables they can |
| save space and decrease cache pressure. Promoting to a signed type |
| helps avoid bugs in integer arithmetic. */ |
| |
| #ifdef __INT_LEAST8_MAX__ |
| typedef __INT_LEAST8_TYPE__ yytype_int8; |
| #elif defined YY_STDINT_H |
| typedef int_least8_t yytype_int8; |
| #else |
| typedef signed char yytype_int8; |
| #endif |
| |
| #ifdef __INT_LEAST16_MAX__ |
| typedef __INT_LEAST16_TYPE__ yytype_int16; |
| #elif defined YY_STDINT_H |
| typedef int_least16_t yytype_int16; |
| #else |
| typedef short yytype_int16; |
| #endif |
| |
| /* Work around bug in HP-UX 11.23, which defines these macros |
| incorrectly for preprocessor constants. This workaround can likely |
| be removed in 2023, as HPE has promised support for HP-UX 11.23 |
| (aka HP-UX 11i v2) only through the end of 2022; see Table 2 of |
| <https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>. */ |
| #ifdef __hpux |
| # undef UINT_LEAST8_MAX |
| # undef UINT_LEAST16_MAX |
| # define UINT_LEAST8_MAX 255 |
| # define UINT_LEAST16_MAX 65535 |
| #endif |
| |
| #if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__ |
| typedef __UINT_LEAST8_TYPE__ yytype_uint8; |
| #elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \ |
| && UINT_LEAST8_MAX <= INT_MAX) |
| typedef uint_least8_t yytype_uint8; |
| #elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX |
| typedef unsigned char yytype_uint8; |
| #else |
| typedef short yytype_uint8; |
| #endif |
| |
| #if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__ |
| typedef __UINT_LEAST16_TYPE__ yytype_uint16; |
| #elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \ |
| && UINT_LEAST16_MAX <= INT_MAX) |
| typedef uint_least16_t yytype_uint16; |
| #elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX |
| typedef unsigned short yytype_uint16; |
| #else |
| typedef int yytype_uint16; |
| #endif |
| |
| #ifndef YYPTRDIFF_T |
| # if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__ |
| # define YYPTRDIFF_T __PTRDIFF_TYPE__ |
| # define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__ |
| # elif defined PTRDIFF_MAX |
| # ifndef ptrdiff_t |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # define YYPTRDIFF_T ptrdiff_t |
| # define YYPTRDIFF_MAXIMUM PTRDIFF_MAX |
| # else |
| # define YYPTRDIFF_T long |
| # define YYPTRDIFF_MAXIMUM LONG_MAX |
| # endif |
| #endif |
| |
| #ifndef YYSIZE_T |
| # ifdef __SIZE_TYPE__ |
| # define YYSIZE_T __SIZE_TYPE__ |
| # elif defined size_t |
| # define YYSIZE_T size_t |
| # elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__ |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYSIZE_T size_t |
| # else |
| # define YYSIZE_T unsigned |
| # endif |
| #endif |
| |
| #define YYSIZE_MAXIMUM \ |
| YY_CAST (YYPTRDIFF_T, \ |
| (YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \ |
| ? YYPTRDIFF_MAXIMUM \ |
| : YY_CAST (YYSIZE_T, -1))) |
| |
| #define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X)) |
| |
| |
| /* Stored state numbers (used for stacks). */ |
| typedef yytype_int8 yy_state_t; |
| |
| /* State numbers in computations. */ |
| typedef int yy_state_fast_t; |
| |
| #ifndef YY_ |
| # if defined YYENABLE_NLS && YYENABLE_NLS |
| # if ENABLE_NLS |
| # include <libintl.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YY_(Msgid) dgettext ("bison-runtime", Msgid) |
| # endif |
| # endif |
| # ifndef YY_ |
| # define YY_(Msgid) Msgid |
| # endif |
| #endif |
| |
| |
| #ifndef YY_ATTRIBUTE_PURE |
| # if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__) |
| # define YY_ATTRIBUTE_PURE __attribute__ ((__pure__)) |
| # else |
| # define YY_ATTRIBUTE_PURE |
| # endif |
| #endif |
| |
| #ifndef YY_ATTRIBUTE_UNUSED |
| # if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__) |
| # define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__)) |
| # else |
| # define YY_ATTRIBUTE_UNUSED |
| # endif |
| #endif |
| |
| /* Suppress unused-variable warnings by "using" E. */ |
| #if ! defined lint || defined __GNUC__ |
| # define YY_USE(E) ((void) (E)) |
| #else |
| # define YY_USE(E) /* empty */ |
| #endif |
| |
| #if defined __GNUC__ && ! defined __ICC && 407 <= __GNUC__ * 100 + __GNUC_MINOR__ |
| /* Suppress an incorrect diagnostic about yylval being uninitialized. */ |
| # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ |
| _Pragma ("GCC diagnostic push") \ |
| _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \ |
| _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"") |
| # define YY_IGNORE_MAYBE_UNINITIALIZED_END \ |
| _Pragma ("GCC diagnostic pop") |
| #else |
| # define YY_INITIAL_VALUE(Value) Value |
| #endif |
| #ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| # define YY_IGNORE_MAYBE_UNINITIALIZED_END |
| #endif |
| #ifndef YY_INITIAL_VALUE |
| # define YY_INITIAL_VALUE(Value) /* Nothing. */ |
| #endif |
| |
| #if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__ |
| # define YY_IGNORE_USELESS_CAST_BEGIN \ |
| _Pragma ("GCC diagnostic push") \ |
| _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"") |
| # define YY_IGNORE_USELESS_CAST_END \ |
| _Pragma ("GCC diagnostic pop") |
| #endif |
| #ifndef YY_IGNORE_USELESS_CAST_BEGIN |
| # define YY_IGNORE_USELESS_CAST_BEGIN |
| # define YY_IGNORE_USELESS_CAST_END |
| #endif |
| |
| |
| #define YY_ASSERT(E) ((void) (0 && (E))) |
| |
| #if !defined yyoverflow |
| |
| /* 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 <alloca.h> /* INFRINGES ON USER NAME SPACE */ |
| # elif defined _AIX |
| # define YYSTACK_ALLOC __alloca |
| # elif defined _MSC_VER |
| # include <malloc.h> /* INFRINGES ON USER NAME SPACE */ |
| # define alloca _alloca |
| # else |
| # define YYSTACK_ALLOC alloca |
| # if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS |
| # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ |
| /* Use EXIT_SUCCESS as a witness for stdlib.h. */ |
| # 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 (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 <stdlib.h> /* 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 |
| void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # ifndef YYFREE |
| # define YYFREE free |
| # if ! defined free && ! defined EXIT_SUCCESS |
| void free (void *); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # endif |
| #endif /* !defined yyoverflow */ |
| |
| #if (! defined yyoverflow \ |
| && (! defined __cplusplus \ |
| || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) |
| |
| /* A type that is properly aligned for any stack member. */ |
| union yyalloc |
| { |
| yy_state_t yyss_alloc; |
| YYSTYPE yyvs_alloc; |
| }; |
| |
| /* The size of the maximum gap between one aligned stack and the next. */ |
| # define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1) |
| |
| /* The size of an array large to enough to hold all stacks, each with |
| N elements. */ |
| # define YYSTACK_BYTES(N) \ |
| ((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \ |
| + 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 \ |
| { \ |
| YYPTRDIFF_T yynewbytes; \ |
| YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ |
| Stack = &yyptr->Stack_alloc; \ |
| yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \ |
| yyptr += yynewbytes / YYSIZEOF (*yyptr); \ |
| } \ |
| while (0) |
| |
| #endif |
| |
| #if defined YYCOPY_NEEDED && YYCOPY_NEEDED |
| /* Copy COUNT objects from SRC to DST. The source and destination do |
| not overlap. */ |
| # ifndef YYCOPY |
| # if defined __GNUC__ && 1 < __GNUC__ |
| # define YYCOPY(Dst, Src, Count) \ |
| __builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src))) |
| # else |
| # define YYCOPY(Dst, Src, Count) \ |
| do \ |
| { \ |
| YYPTRDIFF_T yyi; \ |
| for (yyi = 0; yyi < (Count); yyi++) \ |
| (Dst)[yyi] = (Src)[yyi]; \ |
| } \ |
| while (0) |
| # endif |
| # endif |
| #endif /* !YYCOPY_NEEDED */ |
| |
| /* YYFINAL -- State number of the termination state. */ |
| #define YYFINAL 2 |
| /* YYLAST -- Last index in YYTABLE. */ |
| #define YYLAST 50 |
| |
| /* YYNTOKENS -- Number of terminals. */ |
| #define YYNTOKENS 22 |
| /* YYNNTS -- Number of nonterminals. */ |
| #define YYNNTS 11 |
| /* YYNRULES -- Number of rules. */ |
| #define YYNRULES 51 |
| /* YYNSTATES -- Number of states. */ |
| #define YYNSTATES 61 |
| |
| /* YYMAXUTOK -- Last valid token kind. */ |
| #define YYMAXUTOK 273 |
| |
| |
| /* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM |
| as returned by yylex, with out-of-bounds checking. */ |
| #define YYTRANSLATE(YYX) \ |
| (0 <= (YYX) && (YYX) <= YYMAXUTOK \ |
| ? YY_CAST (yysymbol_kind_t, yytranslate[YYX]) \ |
| : YYSYMBOL_YYUNDEF) |
| |
| /* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM |
| as returned by yylex. */ |
| static const yytype_int8 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, 20, 2, 2, 21, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 19, 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 |
| }; |
| |
| #if YYDEBUG |
| /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ |
| static const yytype_int16 yyrline[] = |
| { |
| 0, 193, 193, 194, 197, 200, 203, 206, 209, 212, |
| 215, 221, 227, 236, 242, 254, 257, 261, 266, 270, |
| 274, 280, 284, 302, 308, 314, 318, 323, 327, 334, |
| 342, 345, 348, 351, 354, 357, 360, 363, 366, 369, |
| 372, 375, 378, 381, 384, 387, 390, 393, 396, 401, |
| 435, 438 |
| }; |
| #endif |
| |
| /** Accessing symbol of state STATE. */ |
| #define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State]) |
| |
| #if YYDEBUG || 0 |
| /* The user-facing name of the symbol whose (internal) number is |
| YYSYMBOL. No bounds checking. */ |
| static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED; |
| |
| /* 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", "\"invalid token\"", "tAGO", "tDAY", |
| "tDAY_UNIT", "tDAYZONE", "tDST", "tHOUR_UNIT", "tID", "tMERIDIAN", |
| "tMINUTE_UNIT", "tMONTH", "tMONTH_UNIT", "tSEC_UNIT", "tSNUMBER", |
| "tUNUMBER", "tYEAR_UNIT", "tZONE", "':'", "','", "'/'", "$accept", |
| "spec", "item", "time", "zone", "day", "date", "rel", "relunit", |
| "number", "o_merid", YY_NULLPTR |
| }; |
| |
| static const char * |
| yysymbol_name (yysymbol_kind_t yysymbol) |
| { |
| return yytname[yysymbol]; |
| } |
| #endif |
| |
| #ifdef YYPRINT |
| /* YYTOKNUM[NUM] -- (External) token number corresponding to the |
| (internal) symbol number NUM (which must be that of a token). */ |
| static const yytype_int16 yytoknum[] = |
| { |
| 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, |
| 265, 266, 267, 268, 269, 270, 271, 272, 273, 58, |
| 44, 47 |
| }; |
| #endif |
| |
| #define YYPACT_NINF (-20) |
| |
| #define yypact_value_is_default(Yyn) \ |
| ((Yyn) == YYPACT_NINF) |
| |
| #define YYTABLE_NINF (-1) |
| |
| #define yytable_value_is_error(Yyn) \ |
| 0 |
| |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing |
| STATE-NUM. */ |
| static const yytype_int8 yypact[] = |
| { |
| -20, 0, -20, -19, -20, -20, -20, -20, -13, -20, |
| -20, 30, 15, -20, 14, -20, -20, -20, -20, -20, |
| -20, 19, -20, -20, 4, -20, -20, -20, -20, -20, |
| -20, -20, -20, -20, -20, -20, -6, -20, -20, 16, |
| -20, 17, 23, -20, -20, 24, -20, -20, -20, 27, |
| 28, -20, -20, -20, 29, -20, 32, -8, -20, -20, |
| -20 |
| }; |
| |
| /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. |
| Performed when YYTABLE does not specify something else to do. Zero |
| means the default is an error. */ |
| static const yytype_int8 yydefact[] = |
| { |
| 2, 0, 1, 18, 39, 16, 42, 45, 0, 36, |
| 48, 0, 49, 33, 15, 3, 4, 5, 7, 6, |
| 8, 30, 9, 19, 25, 38, 41, 44, 35, 47, |
| 32, 20, 37, 40, 10, 43, 27, 34, 46, 0, |
| 31, 0, 0, 17, 29, 0, 24, 28, 23, 50, |
| 21, 26, 51, 12, 0, 11, 0, 50, 22, 14, |
| 13 |
| }; |
| |
| /* YYPGOTO[NTERM-NUM]. */ |
| static const yytype_int8 yypgoto[] = |
| { |
| -20, -20, -20, -20, -20, -20, -20, -20, -20, -20, |
| -7 |
| }; |
| |
| /* YYDEFGOTO[NTERM-NUM]. */ |
| static const yytype_int8 yydefgoto[] = |
| { |
| 0, 1, 15, 16, 17, 18, 19, 20, 21, 22, |
| 55 |
| }; |
| |
| /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If |
| positive, shift that token. If negative, reduce the rule whose |
| number is the opposite. If YYTABLE_NINF, syntax error. */ |
| static const yytype_int8 yytable[] = |
| { |
| 2, 23, 52, 24, 3, 4, 5, 59, 6, 46, |
| 47, 7, 8, 9, 10, 11, 12, 13, 14, 31, |
| 32, 43, 44, 33, 45, 34, 35, 36, 37, 38, |
| 39, 48, 40, 49, 41, 25, 42, 52, 26, 50, |
| 51, 27, 53, 28, 29, 57, 54, 30, 58, 56, |
| 60 |
| }; |
| |
| static const yytype_int8 yycheck[] = |
| { |
| 0, 20, 10, 16, 4, 5, 6, 15, 8, 15, |
| 16, 11, 12, 13, 14, 15, 16, 17, 18, 4, |
| 5, 7, 3, 8, 20, 10, 11, 12, 13, 14, |
| 15, 15, 17, 16, 19, 5, 21, 10, 8, 16, |
| 16, 11, 15, 13, 14, 16, 19, 17, 16, 21, |
| 57 |
| }; |
| |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing |
| symbol of state STATE-NUM. */ |
| static const yytype_int8 yystos[] = |
| { |
| 0, 23, 0, 4, 5, 6, 8, 11, 12, 13, |
| 14, 15, 16, 17, 18, 24, 25, 26, 27, 28, |
| 29, 30, 31, 20, 16, 5, 8, 11, 13, 14, |
| 17, 4, 5, 8, 10, 11, 12, 13, 14, 15, |
| 17, 19, 21, 7, 3, 20, 15, 16, 15, 16, |
| 16, 16, 10, 15, 19, 32, 21, 16, 16, 15, |
| 32 |
| }; |
| |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ |
| static const yytype_int8 yyr1[] = |
| { |
| 0, 22, 23, 23, 24, 24, 24, 24, 24, 24, |
| 25, 25, 25, 25, 25, 26, 26, 26, 27, 27, |
| 27, 28, 28, 28, 28, 28, 28, 28, 28, 29, |
| 29, 30, 30, 30, 30, 30, 30, 30, 30, 30, |
| 30, 30, 30, 30, 30, 30, 30, 30, 30, 31, |
| 32, 32 |
| }; |
| |
| /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */ |
| static const yytype_int8 yyr2[] = |
| { |
| 0, 2, 0, 2, 1, 1, 1, 1, 1, 1, |
| 2, 4, 4, 6, 6, 1, 1, 2, 1, 2, |
| 2, 3, 5, 3, 3, 2, 4, 2, 3, 2, |
| 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, |
| 2, 2, 1, 2, 2, 1, 2, 2, 1, 1, |
| 0, 1 |
| }; |
| |
| |
| enum { YYENOMEM = -2 }; |
| |
| #define yyerrok (yyerrstatus = 0) |
| #define yyclearin (yychar = YYEMPTY) |
| |
| #define YYACCEPT goto yyacceptlab |
| #define YYABORT goto yyabortlab |
| #define YYERROR goto yyerrorlab |
| |
| |
| #define YYRECOVERING() (!!yyerrstatus) |
| |
| #define YYBACKUP(Token, Value) \ |
| do \ |
| if (yychar == YYEMPTY) \ |
| { \ |
| yychar = (Token); \ |
| yylval = (Value); \ |
| YYPOPSTACK (yylen); \ |
| yystate = *yyssp; \ |
| goto yybackup; \ |
| } \ |
| else \ |
| { \ |
| yyerror (YY_("syntax error: cannot back up")); \ |
| YYERROR; \ |
| } \ |
| while (0) |
| |
| /* Backward compatibility with an undocumented macro. |
| Use YYerror or YYUNDEF. */ |
| #define YYERRCODE YYUNDEF |
| |
| |
| /* Enable debugging if requested. */ |
| #if YYDEBUG |
| |
| # ifndef YYFPRINTF |
| # include <stdio.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYFPRINTF fprintf |
| # endif |
| |
| # define YYDPRINTF(Args) \ |
| do { \ |
| if (yydebug) \ |
| YYFPRINTF Args; \ |
| } while (0) |
| |
| /* This macro is provided for backward compatibility. */ |
| # ifndef YY_LOCATION_PRINT |
| # define YY_LOCATION_PRINT(File, Loc) ((void) 0) |
| # endif |
| |
| |
| # define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \ |
| do { \ |
| if (yydebug) \ |
| { \ |
| YYFPRINTF (stderr, "%s ", Title); \ |
| yy_symbol_print (stderr, \ |
| Kind, Value); \ |
| YYFPRINTF (stderr, "\n"); \ |
| } \ |
| } while (0) |
| |
| |
| /*-----------------------------------. |
| | Print this symbol's value on YYO. | |
| `-----------------------------------*/ |
| |
| static void |
| yy_symbol_value_print (FILE *yyo, |
| yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep) |
| { |
| FILE *yyoutput = yyo; |
| YY_USE (yyoutput); |
| if (!yyvaluep) |
| return; |
| # ifdef YYPRINT |
| if (yykind < YYNTOKENS) |
| YYPRINT (yyo, yytoknum[yykind], *yyvaluep); |
| # endif |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| YY_USE (yykind); |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| } |
| |
| |
| /*---------------------------. |
| | Print this symbol on YYO. | |
| `---------------------------*/ |
| |
| static void |
| yy_symbol_print (FILE *yyo, |
| yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep) |
| { |
| YYFPRINTF (yyo, "%s %s (", |
| yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind)); |
| |
| yy_symbol_value_print (yyo, yykind, yyvaluep); |
| YYFPRINTF (yyo, ")"); |
| } |
| |
| /*------------------------------------------------------------------. |
| | yy_stack_print -- Print the state stack from its BOTTOM up to its | |
| | TOP (included). | |
| `------------------------------------------------------------------*/ |
| |
| static void |
| yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop) |
| { |
| 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 (0) |
| |
| |
| /*------------------------------------------------. |
| | Report that the YYRULE is going to be reduced. | |
| `------------------------------------------------*/ |
| |
| static void |
| yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp, |
| int yyrule) |
| { |
| int yylno = yyrline[yyrule]; |
| int yynrhs = yyr2[yyrule]; |
| int yyi; |
| YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n", |
| yyrule - 1, yylno); |
| /* The symbols being reduced. */ |
| for (yyi = 0; yyi < yynrhs; yyi++) |
| { |
| YYFPRINTF (stderr, " $%d = ", yyi + 1); |
| yy_symbol_print (stderr, |
| YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]), |
| &yyvsp[(yyi + 1) - (yynrhs)]); |
| YYFPRINTF (stderr, "\n"); |
| } |
| } |
| |
| # define YY_REDUCE_PRINT(Rule) \ |
| do { \ |
| if (yydebug) \ |
| yy_reduce_print (yyssp, yyvsp, Rule); \ |
| } while (0) |
| |
| /* Nonzero means print parse trace. It is left uninitialized so that |
| multiple parsers can coexist. */ |
| int yydebug; |
| #else /* !YYDEBUG */ |
| # define YYDPRINTF(Args) ((void) 0) |
| # define YY_SYMBOL_PRINT(Title, Kind, 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 |
| |
| |
| |
| |
| |
| |
| /*-----------------------------------------------. |
| | Release the memory associated to this symbol. | |
| `-----------------------------------------------*/ |
| |
| static void |
| yydestruct (const char *yymsg, |
| yysymbol_kind_t yykind, YYSTYPE *yyvaluep) |
| { |
| YY_USE (yyvaluep); |
| if (!yymsg) |
| yymsg = "Deleting"; |
| YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp); |
| |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| YY_USE (yykind); |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| } |
| |
| |
| /* Lookahead token kind. */ |
| int yychar; |
| |
| /* The semantic value of the lookahead symbol. */ |
| YYSTYPE yylval; |
| /* Number of syntax errors so far. */ |
| int yynerrs; |
| |
| |
| |
| |
| /*----------. |
| | yyparse. | |
| `----------*/ |
| |
| int |
| yyparse (void) |
| { |
| yy_state_fast_t yystate = 0; |
| /* Number of tokens to shift before error messages enabled. */ |
| int yyerrstatus = 0; |
| |
| /* Refer to the stacks through separate pointers, to allow yyoverflow |
| to reallocate them elsewhere. */ |
| |
| /* Their size. */ |
| YYPTRDIFF_T yystacksize = YYINITDEPTH; |
| |
| /* The state stack: array, bottom, top. */ |
| yy_state_t yyssa[YYINITDEPTH]; |
| yy_state_t *yyss = yyssa; |
| yy_state_t *yyssp = yyss; |
| |
| /* The semantic value stack: array, bottom, top. */ |
| YYSTYPE yyvsa[YYINITDEPTH]; |
| YYSTYPE *yyvs = yyvsa; |
| YYSTYPE *yyvsp = yyvs; |
| |
| int yyn; |
| /* The return value of yyparse. */ |
| int yyresult; |
| /* Lookahead symbol kind. */ |
| yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY; |
| /* The variables used to return semantic value and location from the |
| action routines. */ |
| YYSTYPE yyval; |
| |
| |
| |
| #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) |
| |
| /* The number of symbols on the RHS of the reduced rule. |
| Keep to zero when no symbol should be popped. */ |
| int yylen = 0; |
| |
| YYDPRINTF ((stderr, "Starting parse\n")); |
| |
| yychar = YYEMPTY; /* Cause a token to be read. */ |
| 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 -- set current state (the top of the stack) to yystate. | |
| `--------------------------------------------------------------------*/ |
| yysetstate: |
| YYDPRINTF ((stderr, "Entering state %d\n", yystate)); |
| YY_ASSERT (0 <= yystate && yystate < YYNSTATES); |
| YY_IGNORE_USELESS_CAST_BEGIN |
| *yyssp = YY_CAST (yy_state_t, yystate); |
| YY_IGNORE_USELESS_CAST_END |
| YY_STACK_PRINT (yyss, yyssp); |
| |
| if (yyss + yystacksize - 1 <= yyssp) |
| #if !defined yyoverflow && !defined YYSTACK_RELOCATE |
| goto yyexhaustedlab; |
| #else |
| { |
| /* Get the current used size of the three stacks, in elements. */ |
| YYPTRDIFF_T yysize = yyssp - yyss + 1; |
| |
| # if defined 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. */ |
| yy_state_t *yyss1 = yyss; |
| YYSTYPE *yyvs1 = yyvs; |
| |
| /* 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 * YYSIZEOF (*yyssp), |
| &yyvs1, yysize * YYSIZEOF (*yyvsp), |
| &yystacksize); |
| yyss = yyss1; |
| yyvs = yyvs1; |
| } |
| # else /* defined YYSTACK_RELOCATE */ |
| /* Extend the stack our own way. */ |
| if (YYMAXDEPTH <= yystacksize) |
| goto yyexhaustedlab; |
| yystacksize *= 2; |
| if (YYMAXDEPTH < yystacksize) |
| yystacksize = YYMAXDEPTH; |
| |
| { |
| yy_state_t *yyss1 = yyss; |
| union yyalloc *yyptr = |
| YY_CAST (union yyalloc *, |
| YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize)))); |
| if (! yyptr) |
| goto yyexhaustedlab; |
| YYSTACK_RELOCATE (yyss_alloc, yyss); |
| YYSTACK_RELOCATE (yyvs_alloc, yyvs); |
| # undef YYSTACK_RELOCATE |
| if (yyss1 != yyssa) |
| YYSTACK_FREE (yyss1); |
| } |
| # endif |
| |
| yyssp = yyss + yysize - 1; |
| yyvsp = yyvs + yysize - 1; |
| |
| YY_IGNORE_USELESS_CAST_BEGIN |
| YYDPRINTF ((stderr, "Stack size increased to %ld\n", |
| YY_CAST (long, yystacksize))); |
| YY_IGNORE_USELESS_CAST_END |
| |
| if (yyss + yystacksize - 1 <= yyssp) |
| YYABORT; |
| } |
| #endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */ |
| |
| 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 empty, or end-of-input, or a valid lookahead. */ |
| if (yychar == YYEMPTY) |
| { |
| YYDPRINTF ((stderr, "Reading a token\n")); |
| yychar = yylex (); |
| } |
| |
| if (yychar <= YYEOF) |
| { |
| yychar = YYEOF; |
| yytoken = YYSYMBOL_YYEOF; |
| YYDPRINTF ((stderr, "Now at end of input.\n")); |
| } |
| else if (yychar == YYerror) |
| { |
| /* The scanner already issued an error message, process directly |
| to error recovery. But do not keep the error token as |
| lookahead, it is too special and may lead us to an endless |
| loop in error recovery. */ |
| yychar = YYUNDEF; |
| yytoken = YYSYMBOL_YYerror; |
| goto yyerrlab1; |
| } |
| 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); |
| yystate = yyn; |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| *++yyvsp = yylval; |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| |
| /* Discard the shifted token. */ |
| yychar = YYEMPTY; |
| 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]; |
| |
| |
| YY_REDUCE_PRINT (yyn); |
| switch (yyn) |
| { |
| case 4: /* item: time */ |
| #line 197 "getdate.y" |
| { |
| yyHaveTime++; |
| } |
| #line 1371 "getdate.c" |
| break; |
| |
| case 5: /* item: zone */ |
| #line 200 "getdate.y" |
| { |
| yyHaveZone++; |
| } |
| #line 1379 "getdate.c" |
| break; |
| |
| case 6: /* item: date */ |
| #line 203 "getdate.y" |
| { |
| yyHaveDate++; |
| } |
| #line 1387 "getdate.c" |
| break; |
| |
| case 7: /* item: day */ |
| #line 206 "getdate.y" |
| { |
| yyHaveDay++; |
| } |
| #line 1395 "getdate.c" |
| break; |
| |
| case 8: /* item: rel */ |
| #line 209 "getdate.y" |
| { |
| yyHaveRel++; |
| } |
| #line 1403 "getdate.c" |
| break; |
| |
| case 10: /* time: tUNUMBER tMERIDIAN */ |
| #line 215 "getdate.y" |
| { |
| yyHour = (yyvsp[-1].Number); |
| yyMinutes = 0; |
| yySeconds = 0; |
| yyMeridian = (yyvsp[0].Meridian); |
| } |
| #line 1414 "getdate.c" |
| break; |
| |
| case 11: /* time: tUNUMBER ':' tUNUMBER o_merid */ |
| #line 221 "getdate.y" |
| { |
| yyHour = (yyvsp[-3].Number); |
| yyMinutes = (yyvsp[-1].Number); |
| yySeconds = 0; |
| yyMeridian = (yyvsp[0].Meridian); |
| } |
| #line 1425 "getdate.c" |
| break; |
| |
| case 12: /* time: tUNUMBER ':' tUNUMBER tSNUMBER */ |
| #line 227 "getdate.y" |
| { |
| yyHour = (yyvsp[-3].Number); |
| yyMinutes = (yyvsp[-1].Number); |
| yyMeridian = MER24; |
| yyHaveZone++; |
| yyTimezone = ((yyvsp[0].Number) < 0 |
| ? -(yyvsp[0].Number) % 100 + (-(yyvsp[0].Number) / 100) * 60 |
| : - ((yyvsp[0].Number) % 100 + ((yyvsp[0].Number) / 100) * 60)); |
| } |
| #line 1439 "getdate.c" |
| break; |
| |
| case 13: /* time: tUNUMBER ':' tUNUMBER ':' tUNUMBER o_merid */ |
| #line 236 "getdate.y" |
| { |
| yyHour = (yyvsp[-5].Number); |
| yyMinutes = (yyvsp[-3].Number); |
| yySeconds = (yyvsp[-1].Number); |
| yyMeridian = (yyvsp[0].Meridian); |
| } |
| #line 1450 "getdate.c" |
| break; |
| |
| case 14: /* time: tUNUMBER ':' tUNUMBER ':' tUNUMBER tSNUMBER */ |
| #line 242 "getdate.y" |
| { |
| yyHour = (yyvsp[-5].Number); |
| yyMinutes = (yyvsp[-3].Number); |
| yySeconds = (yyvsp[-1].Number); |
| yyMeridian = MER24; |
| yyHaveZone++; |
| yyTimezone = ((yyvsp[0].Number) < 0 |
| ? -(yyvsp[0].Number) % 100 + (-(yyvsp[0].Number) / 100) * 60 |
| : - ((yyvsp[0].Number) % 100 + ((yyvsp[0].Number) / 100) * 60)); |
| } |
| #line 1465 "getdate.c" |
| break; |
| |
| case 15: /* zone: tZONE */ |
| #line 254 "getdate.y" |
| { |
| yyTimezone = (yyvsp[0].Number); |
| } |
| #line 1473 "getdate.c" |
| break; |
| |
| case 16: /* zone: tDAYZONE */ |
| #line 257 "getdate.y" |
| { |
| yyTimezone = (yyvsp[0].Number) - 60; |
| } |
| #line 1481 "getdate.c" |
| break; |
| |
| case 17: /* zone: tZONE tDST */ |
| #line 261 "getdate.y" |
| { |
| yyTimezone = (yyvsp[-1].Number) - 60; |
| } |
| #line 1489 "getdate.c" |
| break; |
| |
| case 18: /* day: tDAY */ |
| #line 266 "getdate.y" |
| { |
| yyDayOrdinal = 1; |
| yyDayNumber = (yyvsp[0].Number); |
| } |
| #line 1498 "getdate.c" |
| break; |
| |
| case 19: /* day: tDAY ',' */ |
| #line 270 "getdate.y" |
| { |
| yyDayOrdinal = 1; |
| yyDayNumber = (yyvsp[-1].Number); |
| } |
| #line 1507 "getdate.c" |
| break; |
| |
| case 20: /* day: tUNUMBER tDAY */ |
| #line 274 "getdate.y" |
| { |
| yyDayOrdinal = (yyvsp[-1].Number); |
| yyDayNumber = (yyvsp[0].Number); |
| } |
| #line 1516 "getdate.c" |
| break; |
| |
| case 21: /* date: tUNUMBER '/' tUNUMBER */ |
| #line 280 "getdate.y" |
| { |
| yyMonth = (yyvsp[-2].Number); |
| yyDay = (yyvsp[0].Number); |
| } |
| #line 1525 "getdate.c" |
| break; |
| |
| case 22: /* date: tUNUMBER '/' tUNUMBER '/' tUNUMBER */ |
| #line 284 "getdate.y" |
| { |
| /* Interpret as YYYY/MM/DD if $1 >= 1000, otherwise as MM/DD/YY. |
| The goal in recognizing YYYY/MM/DD is solely to support legacy |
| machine-generated dates like those in an RCS log listing. If |
| you want portability, use the ISO 8601 format. */ |
| if ((yyvsp[-4].Number) >= 1000) |
| { |
| yyYear = (yyvsp[-4].Number); |
| yyMonth = (yyvsp[-2].Number); |
| yyDay = (yyvsp[0].Number); |
| } |
| else |
| { |
| yyMonth = (yyvsp[-4].Number); |
| yyDay = (yyvsp[-2].Number); |
| yyYear = (yyvsp[0].Number); |
| } |
| } |
| #line 1548 "getdate.c" |
| break; |
| |
| case 23: /* date: tUNUMBER tSNUMBER tSNUMBER */ |
| #line 302 "getdate.y" |
| { |
| /* ISO 8601 format. yyyy-mm-dd. */ |
| yyYear = (yyvsp[-2].Number); |
| yyMonth = -(yyvsp[-1].Number); |
| yyDay = -(yyvsp[0].Number); |
| } |
| #line 1559 "getdate.c" |
| break; |
| |
| case 24: /* date: tUNUMBER tMONTH tSNUMBER */ |
| #line 308 "getdate.y" |
| { |
| /* e.g. 17-JUN-1992. */ |
| yyDay = (yyvsp[-2].Number); |
| yyMonth = (yyvsp[-1].Number); |
| yyYear = -(yyvsp[0].Number); |
| } |
| #line 1570 "getdate.c" |
| break; |
| |
| case 25: /* date: tMONTH tUNUMBER */ |
| #line 314 "getdate.y" |
| { |
| yyMonth = (yyvsp[-1].Number); |
| yyDay = (yyvsp[0].Number); |
| } |
| #line 1579 "getdate.c" |
| break; |
| |
| case 26: /* date: tMONTH tUNUMBER ',' tUNUMBER */ |
| #line 318 "getdate.y" |
| { |
| yyMonth = (yyvsp[-3].Number); |
| yyDay = (yyvsp[-2].Number); |
| yyYear = (yyvsp[0].Number); |
| } |
| #line 1589 "getdate.c" |
| break; |
| |
| case 27: /* date: tUNUMBER tMONTH */ |
| #line 323 "getdate.y" |
| { |
| yyMonth = (yyvsp[0].Number); |
| yyDay = (yyvsp[-1].Number); |
| } |
| #line 1598 "getdate.c" |
| break; |
| |
| case 28: /* date: tUNUMBER tMONTH tUNUMBER */ |
| #line 327 "getdate.y" |
| { |
| yyMonth = (yyvsp[-1].Number); |
| yyDay = (yyvsp[-2].Number); |
| yyYear = (yyvsp[0].Number); |
| } |
| #line 1608 "getdate.c" |
| break; |
| |
| case 29: /* rel: relunit tAGO */ |
| #line 334 "getdate.y" |
| { |
| yyRelSeconds = -yyRelSeconds; |
| yyRelMinutes = -yyRelMinutes; |
| yyRelHour = -yyRelHour; |
| yyRelDay = -yyRelDay; |
| yyRelMonth = -yyRelMonth; |
| yyRelYear = -yyRelYear; |
| } |
| #line 1621 "getdate.c" |
| break; |
| |
| case 31: /* relunit: tUNUMBER tYEAR_UNIT */ |
| #line 345 "getdate.y" |
| { |
| yyRelYear += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1629 "getdate.c" |
| break; |
| |
| case 32: /* relunit: tSNUMBER tYEAR_UNIT */ |
| #line 348 "getdate.y" |
| { |
| yyRelYear += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1637 "getdate.c" |
| break; |
| |
| case 33: /* relunit: tYEAR_UNIT */ |
| #line 351 "getdate.y" |
| { |
| yyRelYear += (yyvsp[0].Number); |
| } |
| #line 1645 "getdate.c" |
| break; |
| |
| case 34: /* relunit: tUNUMBER tMONTH_UNIT */ |
| #line 354 "getdate.y" |
| { |
| yyRelMonth += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1653 "getdate.c" |
| break; |
| |
| case 35: /* relunit: tSNUMBER tMONTH_UNIT */ |
| #line 357 "getdate.y" |
| { |
| yyRelMonth += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1661 "getdate.c" |
| break; |
| |
| case 36: /* relunit: tMONTH_UNIT */ |
| #line 360 "getdate.y" |
| { |
| yyRelMonth += (yyvsp[0].Number); |
| } |
| #line 1669 "getdate.c" |
| break; |
| |
| case 37: /* relunit: tUNUMBER tDAY_UNIT */ |
| #line 363 "getdate.y" |
| { |
| yyRelDay += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1677 "getdate.c" |
| break; |
| |
| case 38: /* relunit: tSNUMBER tDAY_UNIT */ |
| #line 366 "getdate.y" |
| { |
| yyRelDay += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1685 "getdate.c" |
| break; |
| |
| case 39: /* relunit: tDAY_UNIT */ |
| #line 369 "getdate.y" |
| { |
| yyRelDay += (yyvsp[0].Number); |
| } |
| #line 1693 "getdate.c" |
| break; |
| |
| case 40: /* relunit: tUNUMBER tHOUR_UNIT */ |
| #line 372 "getdate.y" |
| { |
| yyRelHour += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1701 "getdate.c" |
| break; |
| |
| case 41: /* relunit: tSNUMBER tHOUR_UNIT */ |
| #line 375 "getdate.y" |
| { |
| yyRelHour += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1709 "getdate.c" |
| break; |
| |
| case 42: /* relunit: tHOUR_UNIT */ |
| #line 378 "getdate.y" |
| { |
| yyRelHour += (yyvsp[0].Number); |
| } |
| #line 1717 "getdate.c" |
| break; |
| |
| case 43: /* relunit: tUNUMBER tMINUTE_UNIT */ |
| #line 381 "getdate.y" |
| { |
| yyRelMinutes += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1725 "getdate.c" |
| break; |
| |
| case 44: /* relunit: tSNUMBER tMINUTE_UNIT */ |
| #line 384 "getdate.y" |
| { |
| yyRelMinutes += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1733 "getdate.c" |
| break; |
| |
| case 45: /* relunit: tMINUTE_UNIT */ |
| #line 387 "getdate.y" |
| { |
| yyRelMinutes += (yyvsp[0].Number); |
| } |
| #line 1741 "getdate.c" |
| break; |
| |
| case 46: /* relunit: tUNUMBER tSEC_UNIT */ |
| #line 390 "getdate.y" |
| { |
| yyRelSeconds += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1749 "getdate.c" |
| break; |
| |
| case 47: /* relunit: tSNUMBER tSEC_UNIT */ |
| #line 393 "getdate.y" |
| { |
| yyRelSeconds += (yyvsp[-1].Number) * (yyvsp[0].Number); |
| } |
| #line 1757 "getdate.c" |
| break; |
| |
| case 48: /* relunit: tSEC_UNIT */ |
| #line 396 "getdate.y" |
| { |
| yyRelSeconds += (yyvsp[0].Number); |
| } |
| #line 1765 "getdate.c" |
| break; |
| |
| case 49: /* number: tUNUMBER */ |
| #line 402 "getdate.y" |
| { |
| if (yyHaveTime && yyHaveDate && !yyHaveRel) |
| yyYear = (yyvsp[0].Number); |
| else |
| { |
| if ((yyvsp[0].Number)>10000) |
| { |
| yyHaveDate++; |
| yyDay= ((yyvsp[0].Number))%100; |
| yyMonth= ((yyvsp[0].Number)/100)%100; |
| yyYear = (yyvsp[0].Number)/10000; |
| } |
| else |
| { |
| yyHaveTime++; |
| if ((yyvsp[0].Number) < 100) |
| { |
| yyHour = (yyvsp[0].Number); |
| yyMinutes = 0; |
| } |
| else |
| { |
| yyHour = (yyvsp[0].Number) / 100; |
| yyMinutes = (yyvsp[0].Number) % 100; |
| } |
| yySeconds = 0; |
| yyMeridian = MER24; |
| } |
| } |
| } |
| #line 1800 "getdate.c" |
| break; |
| |
| case 50: /* o_merid: %empty */ |
| #line 435 "getdate.y" |
| { |
| (yyval.Meridian) = MER24; |
| } |
| #line 1808 "getdate.c" |
| break; |
| |
| case 51: /* o_merid: tMERIDIAN */ |
| #line 439 "getdate.y" |
| { |
| (yyval.Meridian) = (yyvsp[0].Meridian); |
| } |
| #line 1816 "getdate.c" |
| break; |
| |
| |
| #line 1820 "getdate.c" |
| |
| 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 ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc); |
| |
| YYPOPSTACK (yylen); |
| yylen = 0; |
| |
| *++yyvsp = yyval; |
| |
| /* 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. */ |
| { |
| const int yylhs = yyr1[yyn] - YYNTOKENS; |
| const int yyi = yypgoto[yylhs] + *yyssp; |
| yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp |
| ? yytable[yyi] |
| : yydefgoto[yylhs]); |
| } |
| |
| 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 ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar); |
| /* If not already recovering from an error, report this error. */ |
| if (!yyerrstatus) |
| { |
| ++yynerrs; |
| yyerror (YY_("syntax error")); |
| } |
| |
| 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); |
| 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 when the user code never invokes YYERROR and the |
| label yyerrorlab therefore never appears in user code. */ |
| if (0) |
| YYERROR; |
| |
| /* Do not reclaim the symbols of the rule whose 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. */ |
| |
| /* Pop stack until we find a state that shifts the error token. */ |
| for (;;) |
| { |
| yyn = yypact[yystate]; |
| if (!yypact_value_is_default (yyn)) |
| { |
| yyn += YYSYMBOL_YYerror; |
| if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror) |
| { |
| yyn = yytable[yyn]; |
| if (0 < yyn) |
| break; |
| } |
| } |
| |
| /* Pop the current state because it cannot handle the error token. */ |
| if (yyssp == yyss) |
| YYABORT; |
| |
| |
| yydestruct ("Error: popping", |
| YY_ACCESSING_SYMBOL (yystate), yyvsp); |
| YYPOPSTACK (1); |
| yystate = *yyssp; |
| YY_STACK_PRINT (yyss, yyssp); |
| } |
| |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| *++yyvsp = yylval; |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| |
| |
| /* Shift the error token. */ |
| YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (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 |
| /*-------------------------------------------------. |
| | yyexhaustedlab -- memory exhaustion comes here. | |
| `-------------------------------------------------*/ |
| yyexhaustedlab: |
| yyerror (YY_("memory exhausted")); |
| yyresult = 2; |
| goto yyreturn; |
| #endif |
| |
| |
| /*-------------------------------------------------------. |
| | yyreturn -- parsing is finished, clean up and return. | |
| `-------------------------------------------------------*/ |
| 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); |
| } |
| /* Do not reclaim the symbols of the rule whose action triggered |
| this YYABORT or YYACCEPT. */ |
| YYPOPSTACK (yylen); |
| YY_STACK_PRINT (yyss, yyssp); |
| while (yyssp != yyss) |
| { |
| yydestruct ("Cleanup: popping", |
| YY_ACCESSING_SYMBOL (+*yyssp), yyvsp); |
| YYPOPSTACK (1); |
| } |
| #ifndef yyoverflow |
| if (yyss != yyssa) |
| YYSTACK_FREE (yyss); |
| #endif |
| |
| return yyresult; |
| } |
| |
| #line 444 "getdate.y" |
| |
| |
| /* Include this file down here because bison inserts code above which |
| may define-away `const'. We want the prototype for get_date to have |
| the same signature as the function definition does. */ |
| #include "getdate.h" |
| |
| extern struct tm *gmtime (); |
| extern struct tm *localtime (); |
| extern time_t mktime (); |
| |
| /* Month and day table. */ |
| static TABLE const MonthDayTable[] = { |
| { "january", tMONTH, 1 }, |
| { "february", tMONTH, 2 }, |
| { "march", tMONTH, 3 }, |
| { "april", tMONTH, 4 }, |
| { "may", tMONTH, 5 }, |
| { "june", tMONTH, 6 }, |
| { "july", tMONTH, 7 }, |
| { "august", tMONTH, 8 }, |
| { "september", tMONTH, 9 }, |
| { "sept", tMONTH, 9 }, |
| { "october", tMONTH, 10 }, |
| { "november", tMONTH, 11 }, |
| { "december", tMONTH, 12 }, |
| { "sunday", tDAY, 0 }, |
| { "monday", tDAY, 1 }, |
| { "tuesday", tDAY, 2 }, |
| { "tues", tDAY, 2 }, |
| { "wednesday", tDAY, 3 }, |
| { "wednes", tDAY, 3 }, |
| { "thursday", tDAY, 4 }, |
| { "thur", tDAY, 4 }, |
| { "thurs", tDAY, 4 }, |
| { "friday", tDAY, 5 }, |
| { "saturday", tDAY, 6 }, |
| { NULL, 0, 0 } |
| }; |
| |
| /* Time units table. */ |
| static TABLE const UnitsTable[] = { |
| { "year", tYEAR_UNIT, 1 }, |
| { "month", tMONTH_UNIT, 1 }, |
| { "fortnight", tDAY_UNIT, 14 }, |
| { "week", tDAY_UNIT, 7 }, |
| { "day", tDAY_UNIT, 1 }, |
| { "hour", tHOUR_UNIT, 1 }, |
| { "minute", tMINUTE_UNIT, 1 }, |
| { "min", tMINUTE_UNIT, 1 }, |
| { "second", tSEC_UNIT, 1 }, |
| { "sec", tSEC_UNIT, 1 }, |
| { NULL, 0, 0 } |
| }; |
| |
| /* Assorted relative-time words. */ |
| static TABLE const OtherTable[] = { |
| { "tomorrow", tMINUTE_UNIT, 1 * 24 * 60 }, |
| { "yesterday", tMINUTE_UNIT, -1 * 24 * 60 }, |
| { "today", tMINUTE_UNIT, 0 }, |
| { "now", tMINUTE_UNIT, 0 }, |
| { "last", tUNUMBER, -1 }, |
| { "this", tMINUTE_UNIT, 0 }, |
| { "next", tUNUMBER, 1 }, |
| { "first", tUNUMBER, 1 }, |
| /* { "second", tUNUMBER, 2 }, */ |
| { "third", tUNUMBER, 3 }, |
| { "fourth", tUNUMBER, 4 }, |
| { "fifth", tUNUMBER, 5 }, |
| { "sixth", tUNUMBER, 6 }, |
| { "seventh", tUNUMBER, 7 }, |
| { "eighth", tUNUMBER, 8 }, |
| { "ninth", tUNUMBER, 9 }, |
| { "tenth", tUNUMBER, 10 }, |
| { "eleventh", tUNUMBER, 11 }, |
| { "twelfth", tUNUMBER, 12 }, |
| { "ago", tAGO, 1 }, |
| { NULL, 0, 0 } |
| }; |
| |
| /* The timezone table. */ |
| static TABLE const TimezoneTable[] = { |
| { "gmt", tZONE, HOUR ( 0) }, /* Greenwich Mean */ |
| { "ut", tZONE, HOUR ( 0) }, /* Universal (Coordinated) */ |
| { "utc", tZONE, HOUR ( 0) }, |
| { "wet", tZONE, HOUR ( 0) }, /* Western European */ |
| { "bst", tDAYZONE, HOUR ( 0) }, /* British Summer */ |
| { "wat", tZONE, HOUR ( 1) }, /* West Africa */ |
| { "at", tZONE, HOUR ( 2) }, /* Azores */ |
| #if 0 |
| /* For completeness. BST is also British Summer, and GST is |
| * also Guam Standard. */ |
| { "bst", tZONE, HOUR ( 3) }, /* Brazil Standard */ |
| { "gst", tZONE, HOUR ( 3) }, /* Greenland Standard */ |
| #endif |
| #if 0 |
| { "nft", tZONE, HOUR (3.5) }, /* Newfoundland */ |
| { "nst", tZONE, HOUR (3.5) }, /* Newfoundland Standard */ |
| { "ndt", tDAYZONE, HOUR (3.5) }, /* Newfoundland Daylight */ |
| #endif |
| { "ast", tZONE, HOUR ( 4) }, /* Atlantic Standard */ |
| { "adt", tDAYZONE, HOUR ( 4) }, /* Atlantic Daylight */ |
| { "est", tZONE, HOUR ( 5) }, /* Eastern Standard */ |
| { "edt", tDAYZONE, HOUR ( 5) }, /* Eastern Daylight */ |
| { "cst", tZONE, HOUR ( 6) }, /* Central Standard */ |
| { "cdt", tDAYZONE, HOUR ( 6) }, /* Central Daylight */ |
| { "mst", tZONE, HOUR ( 7) }, /* Mountain Standard */ |
| { "mdt", tDAYZONE, HOUR ( 7) }, /* Mountain Daylight */ |
| { "pst", tZONE, HOUR ( 8) }, /* Pacific Standard */ |
| { "pdt", tDAYZONE, HOUR ( 8) }, /* Pacific Daylight */ |
| { "yst", tZONE, HOUR ( 9) }, /* Yukon Standard */ |
| { "ydt", tDAYZONE, HOUR ( 9) }, /* Yukon Daylight */ |
| { "hst", tZONE, HOUR (10) }, /* Hawaii Standard */ |
| { "hdt", tDAYZONE, HOUR (10) }, /* Hawaii Daylight */ |
| { "cat", tZONE, HOUR (10) }, /* Central Alaska */ |
| { "ahst", tZONE, HOUR (10) }, /* Alaska-Hawaii Standard */ |
| { "nt", tZONE, HOUR (11) }, /* Nome */ |
| { "idlw", tZONE, HOUR (12) }, /* International Date Line West */ |
| { "cet", tZONE, -HOUR (1) }, /* Central European */ |
| { "met", tZONE, -HOUR (1) }, /* Middle European */ |
| { "mewt", tZONE, -HOUR (1) }, /* Middle European Winter */ |
| { "mest", tDAYZONE, -HOUR (1) }, /* Middle European Summer */ |
| { "mesz", tDAYZONE, -HOUR (1) }, /* Middle European Summer */ |
| { "swt", tZONE, -HOUR (1) }, /* Swedish Winter */ |
| { "sst", tDAYZONE, -HOUR (1) }, /* Swedish Summer */ |
| { "fwt", tZONE, -HOUR (1) }, /* French Winter */ |
| { "fst", tDAYZONE, -HOUR (1) }, /* French Summer */ |
| { "eet", tZONE, -HOUR (2) }, /* Eastern Europe, USSR Zone 1 */ |
| { "bt", tZONE, -HOUR (3) }, /* Baghdad, USSR Zone 2 */ |
| #if 0 |
| { "it", tZONE, -HOUR (3.5) },/* Iran */ |
| #endif |
| { "zp4", tZONE, -HOUR (4) }, /* USSR Zone 3 */ |
| { "zp5", tZONE, -HOUR (5) }, /* USSR Zone 4 */ |
| #if 0 |
| { "ist", tZONE, -HOUR (5.5) },/* Indian Standard */ |
| #endif |
| { "zp6", tZONE, -HOUR (6) }, /* USSR Zone 5 */ |
| #if 0 |
| /* For completeness. NST is also Newfoundland Standard, and SST is |
| * also Swedish Summer. */ |
| { "nst", tZONE, -HOUR (6.5) },/* North Sumatra */ |
| { "sst", tZONE, -HOUR (7) }, /* South Sumatra, USSR Zone 6 */ |
| #endif /* 0 */ |
| { "wast", tZONE, -HOUR (7) }, /* West Australian Standard */ |
| { "wadt", tDAYZONE, -HOUR (7) }, /* West Australian Daylight */ |
| #if 0 |
| { "jt", tZONE, -HOUR (7.5) },/* Java (3pm in Cronusland!) */ |
| #endif |
| { "cct", tZONE, -HOUR (8) }, /* China Coast, USSR Zone 7 */ |
| { "jst", tZONE, -HOUR (9) }, /* Japan Standard, USSR Zone 8 */ |
| #if 0 |
| { "cast", tZONE, -HOUR (9.5) },/* Central Australian Standard */ |
| { "cadt", tDAYZONE, -HOUR (9.5) },/* Central Australian Daylight */ |
| #endif |
| { "east", tZONE, -HOUR (10) }, /* Eastern Australian Standard */ |
| { "eadt", tDAYZONE, -HOUR (10) }, /* Eastern Australian Daylight */ |
| { "gst", tZONE, -HOUR (10) }, /* Guam Standard, USSR Zone 9 */ |
| { "nzt", tZONE, -HOUR (12) }, /* New Zealand */ |
| { "nzst", tZONE, -HOUR (12) }, /* New Zealand Standard */ |
| { "nzdt", tDAYZONE, -HOUR (12) }, /* New Zealand Daylight */ |
| { "idle", tZONE, -HOUR (12) }, /* International Date Line East */ |
| { NULL, 0, 0 } |
| }; |
| |
| /* Military timezone table. */ |
| static TABLE const MilitaryTable[] = { |
| { "a", tZONE, HOUR ( 1) }, |
| { "b", tZONE, HOUR ( 2) }, |
| { "c", tZONE, HOUR ( 3) }, |
| { "d", tZONE, HOUR ( 4) }, |
| { "e", tZONE, HOUR ( 5) }, |
| { "f", tZONE, HOUR ( 6) }, |
| { "g", tZONE, HOUR ( 7) }, |
| { "h", tZONE, HOUR ( 8) }, |
| { "i", tZONE, HOUR ( 9) }, |
| { "k", tZONE, HOUR ( 10) }, |
| { "l", tZONE, HOUR ( 11) }, |
| { "m", tZONE, HOUR ( 12) }, |
| { "n", tZONE, HOUR (- 1) }, |
| { "o", tZONE, HOUR (- 2) }, |
| { "p", tZONE, HOUR (- 3) }, |
| { "q", tZONE, HOUR (- 4) }, |
| { "r", tZONE, HOUR (- 5) }, |
| { "s", tZONE, HOUR (- 6) }, |
| { "t", tZONE, HOUR (- 7) }, |
| { "u", tZONE, HOUR (- 8) }, |
| { "v", tZONE, HOUR (- 9) }, |
| { "w", tZONE, HOUR (-10) }, |
| { "x", tZONE, HOUR (-11) }, |
| { "y", tZONE, HOUR (-12) }, |
| { "z", tZONE, HOUR ( 0) }, |
| { NULL, 0, 0 } |
| }; |
| |
| |
| |
| |
| /* ARGSUSED */ |
| static int |
| yyerror (s) |
| char *s ATTRIBUTE_UNUSED; |
| { |
| return 0; |
| } |
| |
| static int |
| ToHour (Hours, Meridian) |
| int Hours; |
| MERIDIAN Meridian; |
| { |
| switch (Meridian) |
| { |
| case MER24: |
| if (Hours < 0 || Hours > 23) |
| return -1; |
| return Hours; |
| case MERam: |
| if (Hours < 1 || Hours > 12) |
| return -1; |
| if (Hours == 12) |
| Hours = 0; |
| return Hours; |
| case MERpm: |
| if (Hours < 1 || Hours > 12) |
| return -1; |
| if (Hours == 12) |
| Hours = 0; |
| return Hours + 12; |
| default: |
| abort (); |
| } |
| /* NOTREACHED */ |
| } |
| |
| static int |
| ToYear (Year) |
| int Year; |
| { |
| if (Year < 0) |
| Year = -Year; |
| |
| /* XPG4 suggests that years 00-68 map to 2000-2068, and |
| years 69-99 map to 1969-1999. */ |
| if (Year < 69) |
| Year += 2000; |
| else if (Year < 100) |
| Year += 1900; |
| |
| return Year; |
| } |
| |
| static int |
| LookupWord (buff) |
| char *buff; |
| { |
| register char *p; |
| register char *q; |
| register const TABLE *tp; |
| int i; |
| int abbrev; |
| |
| /* Make it lowercase. */ |
| for (p = buff; *p; p++) |
| if (ISUPPER ((unsigned char) *p)) |
| *p = tolower ((unsigned char) *p); |
| |
| if (strcmp (buff, "am") == 0 || strcmp (buff, "a.m.") == 0) |
| { |
| yylval.Meridian = MERam; |
| return tMERIDIAN; |
| } |
| if (strcmp (buff, "pm") == 0 || strcmp (buff, "p.m.") == 0) |
| { |
| yylval.Meridian = MERpm; |
| return tMERIDIAN; |
| } |
| |
| /* See if we have an abbreviation for a month. */ |
| if (strlen (buff) == 3) |
| abbrev = 1; |
| else if (strlen (buff) == 4 && buff[3] == '.') |
| { |
| abbrev = 1; |
| buff[3] = '\0'; |
| } |
| else |
| abbrev = 0; |
| |
| for (tp = MonthDayTable; tp->name; tp++) |
| { |
| if (abbrev) |
| { |
| if (strncmp (buff, tp->name, 3) == 0) |
| { |
| yylval.Number = tp->value; |
| return tp->type; |
| } |
| } |
| else if (strcmp (buff, tp->name) == 0) |
| { |
| yylval.Number = tp->value; |
| return tp->type; |
| } |
| } |
| |
| for (tp = TimezoneTable; tp->name; tp++) |
| if (strcmp (buff, tp->name) == 0) |
| { |
| yylval.Number = tp->value; |
| return tp->type; |
| } |
| |
| if (strcmp (buff, "dst") == 0) |
| return tDST; |
| |
| for (tp = UnitsTable; tp->name; tp++) |
| if (strcmp (buff, tp->name) == 0) |
| { |
| yylval.Number = tp->value; |
| return tp->type; |
| } |
| |
| /* Strip off any plural and try the units table again. */ |
| i = strlen (buff) - 1; |
| if (buff[i] == 's') |
| { |
| buff[i] = '\0'; |
| for (tp = UnitsTable; tp->name; tp++) |
| if (strcmp (buff, tp->name) == 0) |
| { |
| yylval.Number = tp->value; |
| return tp->type; |
| } |
| buff[i] = 's'; /* Put back for "this" in OtherTable. */ |
| } |
| |
| for (tp = OtherTable; tp->name; tp++) |
| if (strcmp (buff, tp->name) == 0) |
| { |
| yylval.Number = tp->value; |
| return tp->type; |
| } |
| |
| /* Military timezones. */ |
| if (buff[1] == '\0' && ISALPHA ((unsigned char) *buff)) |
| { |
| for (tp = MilitaryTable; tp->name; tp++) |
| if (strcmp (buff, tp->name) == 0) |
| { |
| yylval.Number = tp->value; |
| return tp->type; |
| } |
| } |
| |
| /* Drop out any periods and try the timezone table again. */ |
| for (i = 0, p = q = buff; *q; q++) |
| if (*q != '.') |
| *p++ = *q; |
| else |
| i++; |
| *p = '\0'; |
| if (i) |
| for (tp = TimezoneTable; tp->name; tp++) |
| if (strcmp (buff, tp->name) == 0) |
| { |
| yylval.Number = tp->value; |
| return tp->type; |
| } |
| |
| return tID; |
| } |
| |
| static int |
| yylex () |
| { |
| register unsigned char c; |
| register char *p; |
| char buff[20]; |
| int Count; |
| int sign; |
| |
| for (;;) |
| { |
| while (ISSPACE ((unsigned char) *yyInput)) |
| yyInput++; |
| |
| if (ISDIGIT (c = *yyInput) || c == '-' || c == '+') |
| { |
| if (c == '-' || c == '+') |
| { |
| sign = c == '-' ? -1 : 1; |
| if (!ISDIGIT (*++yyInput)) |
| /* skip the '-' sign */ |
| continue; |
| } |
| else |
| sign = 0; |
| for (yylval.Number = 0; ISDIGIT (c = *yyInput++);) |
| yylval.Number = 10 * yylval.Number + c - '0'; |
| yyInput--; |
| if (sign < 0) |
| yylval.Number = -yylval.Number; |
| return sign ? tSNUMBER : tUNUMBER; |
| } |
| if (ISALPHA (c)) |
| { |
| for (p = buff; (c = *yyInput++, ISALPHA (c)) || c == '.';) |
| if (p < &buff[sizeof buff - 1]) |
| *p++ = c; |
| *p = '\0'; |
| yyInput--; |
| return LookupWord (buff); |
| } |
| if (c != '(') |
| return *yyInput++; |
| Count = 0; |
| do |
| { |
| c = *yyInput++; |
| if (c == '\0') |
| return c; |
| if (c == '(') |
| Count++; |
| else if (c == ')') |
| Count--; |
| } |
| while (Count > 0); |
| } |
| } |
| |
| #define TM_YEAR_ORIGIN 1900 |
| |
| /* Yield A - B, measured in seconds. */ |
| static long |
| difftm (struct tm *a, struct tm *b) |
| { |
| int ay = a->tm_year + (TM_YEAR_ORIGIN - 1); |
| int by = b->tm_year + (TM_YEAR_ORIGIN - 1); |
| long days = ( |
| /* difference in day of year */ |
| a->tm_yday - b->tm_yday |
| /* + intervening leap days */ |
| + ((ay >> 2) - (by >> 2)) |
| - (ay / 100 - by / 100) |
| + ((ay / 100 >> 2) - (by / 100 >> 2)) |
| /* + difference in years * 365 */ |
| + (long) (ay - by) * 365 |
| ); |
| return (60 * (60 * (24 * days + (a->tm_hour - b->tm_hour)) |
| + (a->tm_min - b->tm_min)) |
| + (a->tm_sec - b->tm_sec)); |
| } |
| |
| time_t |
| get_date (const char *p, const time_t *now) |
| { |
| struct tm tm, tm0, *tmp; |
| time_t Start; |
| |
| yyInput = p; |
| Start = now ? *now : time ((time_t *) NULL); |
| tmp = localtime (&Start); |
| if (!tmp) |
| return -1; |
| yyYear = tmp->tm_year + TM_YEAR_ORIGIN; |
| yyMonth = tmp->tm_mon + 1; |
| yyDay = tmp->tm_mday; |
| yyHour = tmp->tm_hour; |
| yyMinutes = tmp->tm_min; |
| yySeconds = tmp->tm_sec; |
| tm.tm_isdst = tmp->tm_isdst; |
| yyMeridian = MER24; |
| yyRelSeconds = 0; |
| yyRelMinutes = 0; |
| yyRelHour = 0; |
| yyRelDay = 0; |
| yyRelMonth = 0; |
| yyRelYear = 0; |
| yyHaveDate = 0; |
| yyHaveDay = 0; |
| yyHaveRel = 0; |
| yyHaveTime = 0; |
| yyHaveZone = 0; |
| |
| if (yyparse () |
| || yyHaveTime > 1 || yyHaveZone > 1 || yyHaveDate > 1 || yyHaveDay > 1) |
| return -1; |
| |
| tm.tm_year = ToYear (yyYear) - TM_YEAR_ORIGIN + yyRelYear; |
| tm.tm_mon = yyMonth - 1 + yyRelMonth; |
| tm.tm_mday = yyDay + yyRelDay; |
| if (yyHaveTime || (yyHaveRel && !yyHaveDate && !yyHaveDay)) |
| { |
| tm.tm_hour = ToHour (yyHour, yyMeridian); |
| if (tm.tm_hour < 0) |
| return -1; |
| tm.tm_min = yyMinutes; |
| tm.tm_sec = yySeconds; |
| } |
| else |
| { |
| tm.tm_hour = tm.tm_min = tm.tm_sec = 0; |
| } |
| tm.tm_hour += yyRelHour; |
| tm.tm_min += yyRelMinutes; |
| tm.tm_sec += yyRelSeconds; |
| |
| /* Let mktime deduce tm_isdst if we have an absolute timestamp, |
| or if the relative timestamp mentions days, months, or years. */ |
| if (yyHaveDate | yyHaveDay | yyHaveTime | yyRelDay | yyRelMonth | yyRelYear) |
| tm.tm_isdst = -1; |
| |
| tm0 = tm; |
| |
| Start = mktime (&tm); |
| |
| if (Start == (time_t) -1) |
| { |
| |
| /* Guard against falsely reporting errors near the time_t boundaries |
| when parsing times in other time zones. For example, if the min |
| time_t value is 1970-01-01 00:00:00 UTC and we are 8 hours ahead |
| of UTC, then the min localtime value is 1970-01-01 08:00:00; if |
| we apply mktime to 1970-01-01 00:00:00 we will get an error, so |
| we apply mktime to 1970-01-02 08:00:00 instead and adjust the time |
| zone by 24 hours to compensate. This algorithm assumes that |
| there is no DST transition within a day of the time_t boundaries. */ |
| if (yyHaveZone) |
| { |
| tm = tm0; |
| if (tm.tm_year <= EPOCH - TM_YEAR_ORIGIN) |
| { |
| tm.tm_mday++; |
| yyTimezone -= 24 * 60; |
| } |
| else |
| { |
| tm.tm_mday--; |
| yyTimezone += 24 * 60; |
| } |
| Start = mktime (&tm); |
| } |
| |
| if (Start == (time_t) -1) |
| return Start; |
| } |
| |
| if (yyHaveDay && !yyHaveDate) |
| { |
| tm.tm_mday += ((yyDayNumber - tm.tm_wday + 7) % 7 |
| + 7 * (yyDayOrdinal - (0 < yyDayOrdinal))); |
| Start = mktime (&tm); |
| if (Start == (time_t) -1) |
| return Start; |
| } |
| |
| if (yyHaveZone) |
| { |
| long delta; |
| struct tm *gmt = gmtime (&Start); |
| if (!gmt) |
| return -1; |
| delta = yyTimezone * 60L + difftm (&tm, gmt); |
| if ((Start + delta < Start) != (delta < 0)) |
| return -1; /* time_t overflow */ |
| Start += delta; |
| } |
| |
| return Start; |
| } |
| |
| #if defined (TEST) |
| |
| /* ARGSUSED */ |
| int |
| main (ac, av) |
| int ac; |
| char *av[]; |
| { |
| char buff[MAX_BUFF_LEN + 1]; |
| time_t d; |
| |
| (void) printf ("Enter date, or blank line to exit.\n\t> "); |
| (void) fflush (stdout); |
| |
| buff[MAX_BUFF_LEN] = 0; |
| while (fgets (buff, MAX_BUFF_LEN, stdin) && buff[0]) |
| { |
| d = get_date (buff, (time_t *) NULL); |
| if (d == -1) |
| (void) printf ("Bad format - couldn't convert.\n"); |
| else |
| (void) printf ("%s", ctime (&d)); |
| (void) printf ("\t> "); |
| (void) fflush (stdout); |
| } |
| exit (0); |
| /* NOTREACHED */ |
| } |
| #endif /* defined (TEST) */ |