| |
| /* A Bison parser, made from subversion/libsvn_subr/getdate.y |
| by GNU Bison version 1.28 */ |
| |
| /* This file should be copied to getdate.c by the Win32 build system since |
| in Unix-land it is generated by yacc/bison and getdate.y */ |
| |
| #define YYBISON 1 /* Identify Bison output. */ |
| |
| #define tAGO 257 |
| #define tDAY 258 |
| #define tDAYZONE 259 |
| #define tID 260 |
| #define tMERIDIAN 261 |
| #define tMINUTE_UNIT 262 |
| #define tMONTH 263 |
| #define tMONTH_UNIT 264 |
| #define tSEC_UNIT 265 |
| #define tSNUMBER 266 |
| #define tUNUMBER 267 |
| #define tZONE 268 |
| #define tDST 269 |
| |
| #line 1 "subversion/libsvn_subr/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 grammar has 10 shift/reduce conflicts. |
| ** |
| ** This code is in the public domain and has no copyright. |
| ** |
| ** July 3rd, 2001: added to Subversion project and slightly |
| ** tweaked by Ben Collins-Sussman <sussman@collab.net> |
| */ |
| /* SUPPRESS 287 on yaccpar_sccsid *//* Unused static variable */ |
| /* SUPPRESS 288 on yyerrlab *//* Label unused */ |
| |
| #ifdef HAVE_CONFIG_H |
| #if defined (emacs) || defined (CONFIG_BROKETS) |
| #include <config.h> |
| #else |
| #include "config.h" |
| #endif |
| #endif |
| |
| /* 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> |
| |
| /* The code at the top of svn_parse_date which figures out the offset of the |
| current time zone checks various CPP symbols to see if special |
| tricks are need, but defaults to using the gettimeofday system call. |
| Include <sys/time.h> if that will be used. */ |
| |
| #if defined(vms) |
| #include <types.h> |
| #else /* defined(vms) */ |
| #include <sys/types.h> |
| #include <time.h> |
| #include "svn_time.h" |
| #endif /* !defined(vms) */ |
| |
| #include <string.h> |
| |
| |
| /* 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 |
| |
| #if defined (STDC_HEADERS) |
| #include <stdlib.h> |
| #endif |
| |
| /* NOTES on rebuilding getdate.c (particularly for inclusion in CVS |
| releases): |
| |
| We don't want to mess with all the portability hassles of alloca. |
| In particular, most (all?) versions of bison will use alloca in |
| their parser. If bison works on your system (e.g. it should work |
| with gcc), then go ahead and use it, but the more general solution |
| is to use byacc instead of bison, which should generate a portable |
| parser. I played with adding "#define alloca dont_use_alloca", to |
| give an error if the parser generator uses alloca (and thus detect |
| unportable getdate.c's), but that seems to cause as many problems |
| as it solves. */ |
| |
| /* ### if these prototypes don't match the system's prototypes all |
| * this will break. */ |
| extern struct tm *gmtime(const time_t *t); |
| extern struct tm *localtime(const time_t *t); |
| |
| #define yyparse getdate_yyparse |
| #define yylex getdate_yylex |
| #define yyerror getdate_yyerror |
| |
| static int yyparse (void); |
| static int yylex (void); |
| static int yyerror (const char *s); |
| |
| #define EPOCH 1970 |
| #define HOUR(x) ((time_t)(x) * 60) |
| #define SECSPERDAY (24L * 60L * 60L) |
| |
| |
| /* |
| ** An entry in the lexical lookup table. |
| */ |
| typedef struct _TABLE { |
| const char *name; |
| int type; |
| time_t value; |
| } TABLE; |
| |
| |
| /* |
| ** Daylight-savings mode: on, off, or not yet known. |
| */ |
| typedef enum _DSTMODE { |
| DSTon, DSToff, DSTmaybe |
| } DSTMODE; |
| |
| /* |
| ** 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 char *yyInput; |
| static DSTMODE yyDSTmode; |
| static time_t yyDayOrdinal; |
| static time_t yyDayNumber; |
| static int yyHaveDate; |
| static int yyHaveDay; |
| static int yyHaveRel; |
| static int yyHaveTime; |
| static int yyHaveZone; |
| static time_t yyTimezone; |
| static time_t yyDay; |
| static time_t yyHour; |
| static time_t yyMinutes; |
| static time_t yyMonth; |
| static time_t yySeconds; |
| static time_t yyYear; |
| static MERIDIAN yyMeridian; |
| static time_t yyRelMonth; |
| static time_t yyRelSeconds; |
| |
| |
| #line 150 "subversion/libsvn_subr/getdate.y" |
| typedef union { |
| time_t Number; |
| enum _MERIDIAN Meridian; |
| } YYSTYPE; |
| #include <stdio.h> |
| |
| #ifndef __cplusplus |
| #ifndef __STDC__ |
| #define const |
| #endif |
| #endif |
| |
| |
| |
| #define YYFINAL 52 |
| #define YYFLAG -32768 |
| #define YYNTBASE 19 |
| |
| #define YYTRANSLATE(x) ((unsigned)(x) <= 269 ? yytranslate[x] : 29) |
| |
| static const char 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, 17, 2, 2, 18, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 16, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 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, 3, 4, 5, 6, |
| 7, 8, 9, 10, 11, 12, 13, 14, 15 |
| }; |
| |
| #if YYDEBUG != 0 |
| static const short yyprhs[] = { 0, |
| 0, 1, 4, 6, 8, 10, 12, 14, 16, 19, |
| 24, 29, 36, 43, 45, 47, 50, 52, 55, 58, |
| 62, 68, 72, 76, 79, 84, 87, 91, 94, 96, |
| 99, 102, 104, 107, 110, 112, 115, 118, 120, 122, |
| 123 |
| }; |
| |
| static const short yyrhs[] = { -1, |
| 19, 20, 0, 21, 0, 22, 0, 24, 0, 23, |
| 0, 25, 0, 27, 0, 13, 7, 0, 13, 16, |
| 13, 28, 0, 13, 16, 13, 12, 0, 13, 16, |
| 13, 16, 13, 28, 0, 13, 16, 13, 16, 13, |
| 12, 0, 14, 0, 5, 0, 14, 15, 0, 4, |
| 0, 4, 17, 0, 13, 4, 0, 13, 18, 13, |
| 0, 13, 18, 13, 18, 13, 0, 13, 12, 12, |
| 0, 13, 9, 12, 0, 9, 13, 0, 9, 13, |
| 17, 13, 0, 13, 9, 0, 13, 9, 13, 0, |
| 26, 3, 0, 26, 0, 13, 8, 0, 12, 8, |
| 0, 8, 0, 12, 11, 0, 13, 11, 0, 11, |
| 0, 12, 10, 0, 13, 10, 0, 10, 0, 13, |
| 0, 0, 7, 0 |
| }; |
| |
| #endif |
| |
| #if YYDEBUG != 0 |
| static const short yyrline[] = { 0, |
| 164, 165, 168, 171, 174, 177, 180, 183, 186, 192, |
| 198, 205, 211, 221, 225, 229, 236, 240, 244, 250, |
| 254, 265, 271, 277, 281, 286, 290, 297, 301, 304, |
| 307, 310, 313, 316, 319, 322, 325, 328, 333, 360, |
| 363 |
| }; |
| #endif |
| |
| |
| #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) |
| |
| static const char * const yytname[] = { "$","error","$undefined.","tAGO","tDAY", |
| "tDAYZONE","tID","tMERIDIAN","tMINUTE_UNIT","tMONTH","tMONTH_UNIT","tSEC_UNIT", |
| "tSNUMBER","tUNUMBER","tZONE","tDST","':'","','","'/'","spec","item","time", |
| "zone","day","date","rel","relunit","number","o_merid", NULL |
| }; |
| #endif |
| |
| static const short yyr1[] = { 0, |
| 19, 19, 20, 20, 20, 20, 20, 20, 21, 21, |
| 21, 21, 21, 22, 22, 22, 23, 23, 23, 24, |
| 24, 24, 24, 24, 24, 24, 24, 25, 25, 26, |
| 26, 26, 26, 26, 26, 26, 26, 26, 27, 28, |
| 28 |
| }; |
| |
| static const short yyr2[] = { 0, |
| 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, 1, 0, |
| 1 |
| }; |
| |
| static const short yydefact[] = { 1, |
| 0, 17, 15, 32, 0, 38, 35, 0, 39, 14, |
| 2, 3, 4, 6, 5, 7, 29, 8, 18, 24, |
| 31, 36, 33, 19, 9, 30, 26, 37, 34, 0, |
| 0, 0, 16, 28, 0, 23, 27, 22, 40, 20, |
| 25, 41, 11, 0, 10, 0, 40, 21, 13, 12, |
| 0, 0 |
| }; |
| |
| static const short yydefgoto[] = { 1, |
| 11, 12, 13, 14, 15, 16, 17, 18, 45 |
| }; |
| |
| static const short yypact[] = {-32768, |
| 0, -1,-32768,-32768, 4,-32768,-32768, 25, 11, -8, |
| -32768,-32768,-32768,-32768,-32768,-32768, 21,-32768,-32768, 9, |
| -32768,-32768,-32768,-32768,-32768,-32768, -10,-32768,-32768, 16, |
| 19, 24,-32768,-32768, 26,-32768,-32768,-32768, 18, 13, |
| -32768,-32768,-32768, 27,-32768, 28, -6,-32768,-32768,-32768, |
| 38,-32768 |
| }; |
| |
| static const short yypgoto[] = {-32768, |
| -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -5 |
| }; |
| |
| |
| #define YYLAST 42 |
| |
| |
| static const short yytable[] = { 51, |
| 42, 36, 37, 2, 3, 49, 33, 4, 5, 6, |
| 7, 8, 9, 10, 24, 19, 20, 25, 26, 27, |
| 28, 29, 30, 34, 42, 35, 31, 38, 32, 43, |
| 46, 39, 21, 44, 22, 23, 40, 52, 41, 47, |
| 48, 50 |
| }; |
| |
| static const short yycheck[] = { 0, |
| 7, 12, 13, 4, 5, 12, 15, 8, 9, 10, |
| 11, 12, 13, 14, 4, 17, 13, 7, 8, 9, |
| 10, 11, 12, 3, 7, 17, 16, 12, 18, 12, |
| 18, 13, 8, 16, 10, 11, 13, 0, 13, 13, |
| 13, 47 |
| }; |
| /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ |
| #line 3 "/usr/lib/bison.simple" |
| /* This file comes from bison-1.28. */ |
| |
| /* Skeleton output parser for bison, |
| Copyright (C) 1984, 1989, 1990 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, or (at your option) |
| any later version. |
| |
| This program is distributed in the hope that it will be useful, |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| GNU General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with this program; if not, write to the Free Software |
| Foundation, Inc., 59 Temple Place - Suite 330, |
| Boston, MA 02111-1307, USA. */ |
| |
| /* As a special exception, when this file is copied by Bison into a |
| Bison output file, you may use that output file without restriction. |
| This special exception was added by the Free Software Foundation |
| in version 1.24 of Bison. */ |
| |
| /* This is the parser code that is written into each bison parser |
| when the %semantic_parser declaration is not specified in the grammar. |
| It was written by Richard Stallman by simplifying the hairy parser |
| used when %semantic_parser is specified. */ |
| |
| #ifndef YYSTACK_USE_ALLOCA |
| #ifdef alloca |
| #define YYSTACK_USE_ALLOCA |
| #else /* alloca not defined */ |
| #ifdef __GNUC__ |
| #define YYSTACK_USE_ALLOCA |
| #define alloca __builtin_alloca |
| #else /* not GNU C. */ |
| #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) |
| #define YYSTACK_USE_ALLOCA |
| #include <alloca.h> |
| #else /* not sparc */ |
| /* We think this test detects Watcom and Microsoft C. */ |
| /* This used to test MSDOS, but that is a bad idea |
| since that symbol is in the user namespace. */ |
| #if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) |
| #if 0 /* No need for malloc.h, which pollutes the namespace; |
| instead, just don't use alloca. */ |
| #include <malloc.h> |
| #endif |
| #else /* not MSDOS, or __TURBOC__ */ |
| #if defined(_AIX) |
| /* I don't know what this was needed for, but it pollutes the namespace. |
| So I turned it off. rms, 2 May 1997. */ |
| /* #include <malloc.h> */ |
| #pragma alloca |
| #define YYSTACK_USE_ALLOCA |
| #else /* not MSDOS, or __TURBOC__, or _AIX */ |
| #if 0 |
| #ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, |
| and on HPUX 10. Eventually we can turn this on. */ |
| #define YYSTACK_USE_ALLOCA |
| #define alloca __builtin_alloca |
| #endif /* __hpux */ |
| #endif |
| #endif /* not _AIX */ |
| #endif /* not MSDOS, or __TURBOC__ */ |
| #endif /* not sparc */ |
| #endif /* not GNU C */ |
| #endif /* alloca not defined */ |
| #endif /* YYSTACK_USE_ALLOCA not defined */ |
| |
| #ifdef YYSTACK_USE_ALLOCA |
| #define YYSTACK_ALLOC alloca |
| #else |
| #define YYSTACK_ALLOC malloc |
| #endif |
| |
| /* Note: there must be only one dollar sign in this file. |
| It is replaced by the list of actions, each action |
| as one case of the switch. */ |
| |
| #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 yyerrlab1 |
| /* 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. */ |
| #define YYFAIL goto yyerrlab |
| #define YYRECOVERING() (!!yyerrstatus) |
| #define YYBACKUP(token, value) \ |
| do \ |
| if (yychar == YYEMPTY && yylen == 1) \ |
| { yychar = (token), yylval = (value); \ |
| yychar1 = YYTRANSLATE (yychar); \ |
| YYPOPSTACK; \ |
| goto yybackup; \ |
| } \ |
| else \ |
| { yyerror ("syntax error: cannot back up"); YYERROR; } \ |
| while (0) |
| |
| #define YYTERROR 1 |
| #define YYERRCODE 256 |
| |
| #ifndef YYPURE |
| #define YYLEX yylex() |
| #endif |
| |
| #ifdef YYPURE |
| #ifdef YYLSP_NEEDED |
| #ifdef YYLEX_PARAM |
| #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) |
| #else |
| #define YYLEX yylex(&yylval, &yylloc) |
| #endif |
| #else /* not YYLSP_NEEDED */ |
| #ifdef YYLEX_PARAM |
| #define YYLEX yylex(&yylval, YYLEX_PARAM) |
| #else |
| #define YYLEX yylex(&yylval) |
| #endif |
| #endif /* not YYLSP_NEEDED */ |
| #endif |
| |
| /* If nonreentrant, generate the variables here */ |
| |
| #ifndef YYPURE |
| |
| int yychar; /* the lookahead symbol */ |
| YYSTYPE yylval; /* the semantic value of the */ |
| /* lookahead symbol */ |
| |
| #ifdef YYLSP_NEEDED |
| YYLTYPE yylloc; /* location data for the lookahead */ |
| /* symbol */ |
| #endif |
| |
| int yynerrs; /* number of parse errors so far */ |
| #endif /* not YYPURE */ |
| |
| #if YYDEBUG != 0 |
| int yydebug; /* nonzero means print parse trace */ |
| /* Since this is uninitialized, it does not stop multiple parsers |
| from coexisting. */ |
| #endif |
| |
| /* YYINITDEPTH indicates the initial size of the parser's stacks */ |
| |
| #ifndef YYINITDEPTH |
| #define YYINITDEPTH 200 |
| #endif |
| |
| /* YYMAXDEPTH is the maximum size the stacks can grow to |
| (effective only if the built-in stack extension method is used). */ |
| |
| #if YYMAXDEPTH == 0 |
| #undef YYMAXDEPTH |
| #endif |
| |
| #ifndef YYMAXDEPTH |
| #define YYMAXDEPTH 10000 |
| #endif |
| |
| /* Define __yy_memcpy. Note that the size argument |
| should be passed with type unsigned int, because that is what the non-GCC |
| definitions require. With GCC, __builtin_memcpy takes an arg |
| of type size_t, but it can handle unsigned int. */ |
| |
| #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ |
| #define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) |
| #else /* not GNU C or C++ */ |
| #ifndef __cplusplus |
| |
| /* This is the most reliable way to avoid incompatibilities |
| in available built-in functions on various systems. */ |
| static void |
| __yy_memcpy (to, from, count) |
| char *to; |
| char *from; |
| unsigned int count; |
| { |
| register char *f = from; |
| register char *t = to; |
| register int i = count; |
| |
| while (i-- > 0) |
| *t++ = *f++; |
| } |
| |
| #else /* __cplusplus */ |
| |
| /* This is the most reliable way to avoid incompatibilities |
| in available built-in functions on various systems. */ |
| static void |
| __yy_memcpy (char *to, char *from, unsigned int count) |
| { |
| register char *t = to; |
| register char *f = from; |
| register int i = count; |
| |
| while (i-- > 0) |
| *t++ = *f++; |
| } |
| |
| #endif |
| #endif |
| |
| #line 217 "/usr/lib/bison.simple" |
| |
| /* The user can define YYPARSE_PARAM as the name of an argument to be passed |
| into yyparse. The argument should have type void *. |
| It should actually point to an object. |
| Grammar actions can access the variable by casting it |
| to the proper pointer type. */ |
| |
| #ifdef YYPARSE_PARAM |
| #ifdef __cplusplus |
| #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM |
| #define YYPARSE_PARAM_DECL |
| #else /* not __cplusplus */ |
| #define YYPARSE_PARAM_ARG YYPARSE_PARAM |
| #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; |
| #endif /* not __cplusplus */ |
| #else /* not YYPARSE_PARAM */ |
| #define YYPARSE_PARAM_ARG |
| #define YYPARSE_PARAM_DECL |
| #endif /* not YYPARSE_PARAM */ |
| |
| /* Prevent warning if -Wstrict-prototypes. */ |
| #ifdef __GNUC__ |
| #ifdef YYPARSE_PARAM |
| int yyparse (void *); |
| #else |
| int yyparse (void); |
| #endif |
| #endif |
| |
| int |
| yyparse(YYPARSE_PARAM_ARG) |
| YYPARSE_PARAM_DECL |
| { |
| register int yystate; |
| register int yyn; |
| register short *yyssp; |
| register YYSTYPE *yyvsp; |
| int yyerrstatus; /* number of tokens to shift before error messages enabled */ |
| int yychar1 = 0; /* lookahead token as an internal (translated) token number */ |
| |
| short yyssa[YYINITDEPTH]; /* the state stack */ |
| YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ |
| |
| short *yyss = yyssa; /* refer to the stacks thru separate pointers */ |
| YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ |
| |
| #ifdef YYLSP_NEEDED |
| YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ |
| YYLTYPE *yyls = yylsa; |
| YYLTYPE *yylsp; |
| |
| #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) |
| #else |
| #define YYPOPSTACK (yyvsp--, yyssp--) |
| #endif |
| |
| int yystacksize = YYINITDEPTH; |
| int yyfree_stacks = 0; |
| |
| #ifdef YYPURE |
| int yychar; |
| YYSTYPE yylval; |
| int yynerrs; |
| #ifdef YYLSP_NEEDED |
| YYLTYPE yylloc; |
| #endif |
| #endif |
| |
| YYSTYPE yyval; /* the variable used to return */ |
| /* semantic values from the action */ |
| /* routines */ |
| |
| int yylen; |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| fprintf(stderr, "Starting parse\n"); |
| #endif |
| |
| 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 - 1; |
| yyvsp = yyvs; |
| #ifdef YYLSP_NEEDED |
| yylsp = yyls; |
| #endif |
| |
| /* Push a new state, which is found in yystate . */ |
| /* In all cases, when you get here, the value and location stacks |
| have just been pushed. so pushing a state here evens the stacks. */ |
| yynewstate: |
| |
| *++yyssp = yystate; |
| |
| if (yyssp >= yyss + yystacksize - 1) |
| { |
| /* 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; |
| short *yyss1 = yyss; |
| #ifdef YYLSP_NEEDED |
| YYLTYPE *yyls1 = yyls; |
| #endif |
| |
| /* Get the current used size of the three stacks, in elements. */ |
| int size = yyssp - yyss + 1; |
| |
| #ifdef yyoverflow |
| /* Each stack pointer address is followed by the size of |
| the data in use in that stack, in bytes. */ |
| #ifdef YYLSP_NEEDED |
| /* This used to be a conditional around just the two extra args, |
| but that might be undefined if yyoverflow is a macro. */ |
| yyoverflow("parser stack overflow", |
| &yyss1, size * sizeof (*yyssp), |
| &yyvs1, size * sizeof (*yyvsp), |
| &yyls1, size * sizeof (*yylsp), |
| &yystacksize); |
| #else |
| yyoverflow("parser stack overflow", |
| &yyss1, size * sizeof (*yyssp), |
| &yyvs1, size * sizeof (*yyvsp), |
| &yystacksize); |
| #endif |
| |
| yyss = yyss1; yyvs = yyvs1; |
| #ifdef YYLSP_NEEDED |
| yyls = yyls1; |
| #endif |
| #else /* no yyoverflow */ |
| /* Extend the stack our own way. */ |
| if (yystacksize >= YYMAXDEPTH) |
| { |
| yyerror("parser stack overflow"); |
| if (yyfree_stacks) |
| { |
| free (yyss); |
| free (yyvs); |
| #ifdef YYLSP_NEEDED |
| free (yyls); |
| #endif |
| } |
| return 2; |
| } |
| yystacksize *= 2; |
| if (yystacksize > YYMAXDEPTH) |
| yystacksize = YYMAXDEPTH; |
| #ifndef YYSTACK_USE_ALLOCA |
| yyfree_stacks = 1; |
| #endif |
| yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); |
| __yy_memcpy ((char *)yyss, (char *)yyss1, |
| size * (unsigned int) sizeof (*yyssp)); |
| yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); |
| __yy_memcpy ((char *)yyvs, (char *)yyvs1, |
| size * (unsigned int) sizeof (*yyvsp)); |
| #ifdef YYLSP_NEEDED |
| yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); |
| __yy_memcpy ((char *)yyls, (char *)yyls1, |
| size * (unsigned int) sizeof (*yylsp)); |
| #endif |
| #endif /* no yyoverflow */ |
| |
| yyssp = yyss + size - 1; |
| yyvsp = yyvs + size - 1; |
| #ifdef YYLSP_NEEDED |
| yylsp = yyls + size - 1; |
| #endif |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| fprintf(stderr, "Stack size increased to %d\n", yystacksize); |
| #endif |
| |
| if (yyssp >= yyss + yystacksize - 1) |
| YYABORT; |
| } |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| fprintf(stderr, "Entering state %d\n", yystate); |
| #endif |
| |
| goto yybackup; |
| yybackup: |
| |
| /* Do appropriate processing given the current state. */ |
| /* Read a lookahead token if we need one and don't already have one. */ |
| /* yyresume: */ |
| |
| /* First try to decide what to do without reference to lookahead token. */ |
| |
| yyn = yypact[yystate]; |
| if (yyn == YYFLAG) |
| goto yydefault; |
| |
| /* Not known => get a lookahead token if don't already have one. */ |
| |
| /* yychar is either YYEMPTY or YYEOF |
| or a valid token in external form. */ |
| |
| if (yychar == YYEMPTY) |
| { |
| #if YYDEBUG != 0 |
| if (yydebug) |
| fprintf(stderr, "Reading a token: "); |
| #endif |
| yychar = YYLEX; |
| } |
| |
| /* Convert token to internal form (in yychar1) for indexing tables with */ |
| |
| if (yychar <= 0) /* This means end of input. */ |
| { |
| yychar1 = 0; |
| yychar = YYEOF; /* Don't call YYLEX any more */ |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| fprintf(stderr, "Now at end of input.\n"); |
| #endif |
| } |
| else |
| { |
| yychar1 = YYTRANSLATE(yychar); |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| { |
| fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); |
| /* Give the individual parser a way to print the precise meaning |
| of a token, for further debugging info. */ |
| #ifdef YYPRINT |
| YYPRINT (stderr, yychar, yylval); |
| #endif |
| fprintf (stderr, ")\n"); |
| } |
| #endif |
| } |
| |
| yyn += yychar1; |
| if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) |
| goto yydefault; |
| |
| yyn = yytable[yyn]; |
| |
| /* yyn is what to do for this token type in this state. |
| Negative => reduce, -yyn is rule number. |
| Positive => shift, yyn is new state. |
| New state is final state => don't bother to shift, |
| just return success. |
| 0, or most negative number => error. */ |
| |
| if (yyn < 0) |
| { |
| if (yyn == YYFLAG) |
| goto yyerrlab; |
| yyn = -yyn; |
| goto yyreduce; |
| } |
| else if (yyn == 0) |
| goto yyerrlab; |
| |
| if (yyn == YYFINAL) |
| YYACCEPT; |
| |
| /* Shift the lookahead token. */ |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); |
| #endif |
| |
| /* Discard the token being shifted unless it is eof. */ |
| if (yychar != YYEOF) |
| yychar = YYEMPTY; |
| |
| *++yyvsp = yylval; |
| #ifdef YYLSP_NEEDED |
| *++yylsp = yylloc; |
| #endif |
| |
| /* count tokens shifted since error; after three, turn off error status. */ |
| if (yyerrstatus) yyerrstatus--; |
| |
| yystate = yyn; |
| goto yynewstate; |
| |
| /* Do the default action for the current state. */ |
| yydefault: |
| |
| yyn = yydefact[yystate]; |
| if (yyn == 0) |
| goto yyerrlab; |
| |
| /* Do a reduction. yyn is the number of a rule to reduce with. */ |
| yyreduce: |
| yylen = yyr2[yyn]; |
| if (yylen > 0) |
| yyval = yyvsp[1-yylen]; /* implement default value of the action */ |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| { |
| int i; |
| |
| fprintf (stderr, "Reducing via rule %d (line %d), ", |
| yyn, yyrline[yyn]); |
| |
| /* Print the symbols being reduced, and their result. */ |
| for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) |
| fprintf (stderr, "%s ", yytname[yyrhs[i]]); |
| fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); |
| } |
| #endif |
| |
| |
| switch (yyn) { |
| |
| case 3: |
| #line 168 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHaveTime++; |
| ; |
| break;} |
| case 4: |
| #line 171 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHaveZone++; |
| ; |
| break;} |
| case 5: |
| #line 174 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHaveDate++; |
| ; |
| break;} |
| case 6: |
| #line 177 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHaveDay++; |
| ; |
| break;} |
| case 7: |
| #line 180 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHaveRel++; |
| ; |
| break;} |
| case 9: |
| #line 186 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHour = yyvsp[-1].Number; |
| yyMinutes = 0; |
| yySeconds = 0; |
| yyMeridian = yyvsp[0].Meridian; |
| ; |
| break;} |
| case 10: |
| #line 192 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHour = yyvsp[-3].Number; |
| yyMinutes = yyvsp[-1].Number; |
| yySeconds = 0; |
| yyMeridian = yyvsp[0].Meridian; |
| ; |
| break;} |
| case 11: |
| #line 198 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHour = yyvsp[-3].Number; |
| yyMinutes = yyvsp[-1].Number; |
| yyMeridian = MER24; |
| yyDSTmode = DSToff; |
| yyTimezone = - (yyvsp[0].Number % 100 + (yyvsp[0].Number / 100) * 60); |
| ; |
| break;} |
| case 12: |
| #line 205 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHour = yyvsp[-5].Number; |
| yyMinutes = yyvsp[-3].Number; |
| yySeconds = yyvsp[-1].Number; |
| yyMeridian = yyvsp[0].Meridian; |
| ; |
| break;} |
| case 13: |
| #line 211 "subversion/libsvn_subr/getdate.y" |
| { |
| yyHour = yyvsp[-5].Number; |
| yyMinutes = yyvsp[-3].Number; |
| yySeconds = yyvsp[-1].Number; |
| yyMeridian = MER24; |
| yyDSTmode = DSToff; |
| yyTimezone = - (yyvsp[0].Number % 100 + (yyvsp[0].Number / 100) * 60); |
| ; |
| break;} |
| case 14: |
| #line 221 "subversion/libsvn_subr/getdate.y" |
| { |
| yyTimezone = yyvsp[0].Number; |
| yyDSTmode = DSToff; |
| ; |
| break;} |
| case 15: |
| #line 225 "subversion/libsvn_subr/getdate.y" |
| { |
| yyTimezone = yyvsp[0].Number; |
| yyDSTmode = DSTon; |
| ; |
| break;} |
| case 16: |
| #line 230 "subversion/libsvn_subr/getdate.y" |
| { |
| yyTimezone = yyvsp[-1].Number; |
| yyDSTmode = DSTon; |
| ; |
| break;} |
| case 17: |
| #line 236 "subversion/libsvn_subr/getdate.y" |
| { |
| yyDayOrdinal = 1; |
| yyDayNumber = yyvsp[0].Number; |
| ; |
| break;} |
| case 18: |
| #line 240 "subversion/libsvn_subr/getdate.y" |
| { |
| yyDayOrdinal = 1; |
| yyDayNumber = yyvsp[-1].Number; |
| ; |
| break;} |
| case 19: |
| #line 244 "subversion/libsvn_subr/getdate.y" |
| { |
| yyDayOrdinal = yyvsp[-1].Number; |
| yyDayNumber = yyvsp[0].Number; |
| ; |
| break;} |
| case 20: |
| #line 250 "subversion/libsvn_subr/getdate.y" |
| { |
| yyMonth = yyvsp[-2].Number; |
| yyDay = yyvsp[0].Number; |
| ; |
| break;} |
| case 21: |
| #line 254 "subversion/libsvn_subr/getdate.y" |
| { |
| if (yyvsp[-4].Number >= 100) { |
| 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; |
| } |
| ; |
| break;} |
| case 22: |
| #line 265 "subversion/libsvn_subr/getdate.y" |
| { |
| /* ISO 8601 format. yyyy-mm-dd. */ |
| yyYear = yyvsp[-2].Number; |
| yyMonth = -yyvsp[-1].Number; |
| yyDay = -yyvsp[0].Number; |
| ; |
| break;} |
| case 23: |
| #line 271 "subversion/libsvn_subr/getdate.y" |
| { |
| /* e.g. 17-JUN-1992. */ |
| yyDay = yyvsp[-2].Number; |
| yyMonth = yyvsp[-1].Number; |
| yyYear = -yyvsp[0].Number; |
| ; |
| break;} |
| case 24: |
| #line 277 "subversion/libsvn_subr/getdate.y" |
| { |
| yyMonth = yyvsp[-1].Number; |
| yyDay = yyvsp[0].Number; |
| ; |
| break;} |
| case 25: |
| #line 281 "subversion/libsvn_subr/getdate.y" |
| { |
| yyMonth = yyvsp[-3].Number; |
| yyDay = yyvsp[-2].Number; |
| yyYear = yyvsp[0].Number; |
| ; |
| break;} |
| case 26: |
| #line 286 "subversion/libsvn_subr/getdate.y" |
| { |
| yyMonth = yyvsp[0].Number; |
| yyDay = yyvsp[-1].Number; |
| ; |
| break;} |
| case 27: |
| #line 290 "subversion/libsvn_subr/getdate.y" |
| { |
| yyMonth = yyvsp[-1].Number; |
| yyDay = yyvsp[-2].Number; |
| yyYear = yyvsp[0].Number; |
| ; |
| break;} |
| case 28: |
| #line 297 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelSeconds = -yyRelSeconds; |
| yyRelMonth = -yyRelMonth; |
| ; |
| break;} |
| case 30: |
| #line 304 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelSeconds += yyvsp[-1].Number * yyvsp[0].Number * 60L; |
| ; |
| break;} |
| case 31: |
| #line 307 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelSeconds += yyvsp[-1].Number * yyvsp[0].Number * 60L; |
| ; |
| break;} |
| case 32: |
| #line 310 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelSeconds += yyvsp[0].Number * 60L; |
| ; |
| break;} |
| case 33: |
| #line 313 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelSeconds += yyvsp[-1].Number; |
| ; |
| break;} |
| case 34: |
| #line 316 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelSeconds += yyvsp[-1].Number; |
| ; |
| break;} |
| case 35: |
| #line 319 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelSeconds++; |
| ; |
| break;} |
| case 36: |
| #line 322 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelMonth += yyvsp[-1].Number * yyvsp[0].Number; |
| ; |
| break;} |
| case 37: |
| #line 325 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelMonth += yyvsp[-1].Number * yyvsp[0].Number; |
| ; |
| break;} |
| case 38: |
| #line 328 "subversion/libsvn_subr/getdate.y" |
| { |
| yyRelMonth += yyvsp[0].Number; |
| ; |
| break;} |
| case 39: |
| #line 333 "subversion/libsvn_subr/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; |
| } |
| } |
| ; |
| break;} |
| case 40: |
| #line 360 "subversion/libsvn_subr/getdate.y" |
| { |
| yyval.Meridian = MER24; |
| ; |
| break;} |
| case 41: |
| #line 363 "subversion/libsvn_subr/getdate.y" |
| { |
| yyval.Meridian = yyvsp[0].Meridian; |
| ; |
| break;} |
| } |
| /* the action file gets copied in in place of this dollarsign */ |
| #line 543 "/usr/lib/bison.simple" |
| |
| yyvsp -= yylen; |
| yyssp -= yylen; |
| #ifdef YYLSP_NEEDED |
| yylsp -= yylen; |
| #endif |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| { |
| short *ssp1 = yyss - 1; |
| fprintf (stderr, "state stack now"); |
| while (ssp1 != yyssp) |
| fprintf (stderr, " %d", *++ssp1); |
| fprintf (stderr, "\n"); |
| } |
| #endif |
| |
| *++yyvsp = yyval; |
| |
| #ifdef YYLSP_NEEDED |
| yylsp++; |
| if (yylen == 0) |
| { |
| yylsp->first_line = yylloc.first_line; |
| yylsp->first_column = yylloc.first_column; |
| yylsp->last_line = (yylsp-1)->last_line; |
| yylsp->last_column = (yylsp-1)->last_column; |
| yylsp->text = 0; |
| } |
| else |
| { |
| yylsp->last_line = (yylsp+yylen-1)->last_line; |
| yylsp->last_column = (yylsp+yylen-1)->last_column; |
| } |
| #endif |
| |
| /* 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 - YYNTBASE] + *yyssp; |
| if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) |
| yystate = yytable[yystate]; |
| else |
| yystate = yydefgoto[yyn - YYNTBASE]; |
| |
| goto yynewstate; |
| |
| yyerrlab: /* here on detecting error */ |
| |
| if (! yyerrstatus) |
| /* If not already recovering from an error, report this error. */ |
| { |
| ++yynerrs; |
| |
| #ifdef YYERROR_VERBOSE |
| yyn = yypact[yystate]; |
| |
| if (yyn > YYFLAG && yyn < YYLAST) |
| { |
| int size = 0; |
| char *msg; |
| int x, count; |
| |
| count = 0; |
| /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ |
| for (x = (yyn < 0 ? -yyn : 0); |
| x < (sizeof(yytname) / sizeof(char *)); x++) |
| if (yycheck[x + yyn] == x) |
| size += strlen(yytname[x]) + 15, count++; |
| msg = (char *) malloc(size + 15); |
| if (msg != 0) |
| { |
| strcpy(msg, "parse error"); |
| |
| if (count < 5) |
| { |
| count = 0; |
| for (x = (yyn < 0 ? -yyn : 0); |
| x < (sizeof(yytname) / sizeof(char *)); x++) |
| if (yycheck[x + yyn] == x) |
| { |
| strcat(msg, count == 0 ? ", expecting `" : " or `"); |
| strcat(msg, yytname[x]); |
| strcat(msg, "'"); |
| count++; |
| } |
| } |
| yyerror(msg); |
| free(msg); |
| } |
| else |
| yyerror ("parse error; also virtual memory exceeded"); |
| } |
| else |
| #endif /* YYERROR_VERBOSE */ |
| yyerror("parse error"); |
| } |
| |
| goto yyerrlab1; |
| yyerrlab1: /* here on error raised explicitly by an action */ |
| |
| if (yyerrstatus == 3) |
| { |
| /* if just tried and failed to reuse lookahead token after an error, discard it. */ |
| |
| /* return failure if at end of input */ |
| if (yychar == YYEOF) |
| YYABORT; |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); |
| #endif |
| |
| yychar = YYEMPTY; |
| } |
| |
| /* Else will try to reuse lookahead token |
| after shifting the error token. */ |
| |
| yyerrstatus = 3; /* Each real token shifted decrements this */ |
| |
| goto yyerrhandle; |
| |
| yyerrdefault: /* current state does not do anything special for the error token. */ |
| |
| #if 0 |
| /* This is wrong; only states that explicitly want error tokens |
| should shift them. */ |
| yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ |
| if (yyn) goto yydefault; |
| #endif |
| |
| yyerrpop: /* pop the current state because it cannot handle the error token */ |
| |
| if (yyssp == yyss) YYABORT; |
| yyvsp--; |
| yystate = *--yyssp; |
| #ifdef YYLSP_NEEDED |
| yylsp--; |
| #endif |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| { |
| short *ssp1 = yyss - 1; |
| fprintf (stderr, "Error: state stack now"); |
| while (ssp1 != yyssp) |
| fprintf (stderr, " %d", *++ssp1); |
| fprintf (stderr, "\n"); |
| } |
| #endif |
| |
| yyerrhandle: |
| |
| yyn = yypact[yystate]; |
| if (yyn == YYFLAG) |
| goto yyerrdefault; |
| |
| yyn += YYTERROR; |
| if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) |
| goto yyerrdefault; |
| |
| yyn = yytable[yyn]; |
| if (yyn < 0) |
| { |
| if (yyn == YYFLAG) |
| goto yyerrpop; |
| yyn = -yyn; |
| goto yyreduce; |
| } |
| else if (yyn == 0) |
| goto yyerrpop; |
| |
| if (yyn == YYFINAL) |
| YYACCEPT; |
| |
| #if YYDEBUG != 0 |
| if (yydebug) |
| fprintf(stderr, "Shifting error token, "); |
| #endif |
| |
| *++yyvsp = yylval; |
| #ifdef YYLSP_NEEDED |
| *++yylsp = yylloc; |
| #endif |
| |
| yystate = yyn; |
| goto yynewstate; |
| |
| yyacceptlab: |
| /* YYACCEPT comes here. */ |
| if (yyfree_stacks) |
| { |
| free (yyss); |
| free (yyvs); |
| #ifdef YYLSP_NEEDED |
| free (yyls); |
| #endif |
| } |
| return 0; |
| |
| yyabortlab: |
| /* YYABORT comes here. */ |
| if (yyfree_stacks) |
| { |
| free (yyss); |
| free (yyvs); |
| #ifdef YYLSP_NEEDED |
| free (yyls); |
| #endif |
| } |
| return 1; |
| } |
| #line 368 "subversion/libsvn_subr/getdate.y" |
| |
| |
| /* 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 } |
| }; |
| |
| /* Time units table. */ |
| static TABLE const UnitsTable[] = { |
| { "year", tMONTH_UNIT, 12 }, |
| { "month", tMONTH_UNIT, 1 }, |
| { "fortnight", tMINUTE_UNIT, 14 * 24 * 60 }, |
| { "week", tMINUTE_UNIT, 7 * 24 * 60 }, |
| { "day", tMINUTE_UNIT, 1 * 24 * 60 }, |
| { "hour", tMINUTE_UNIT, 60 }, |
| { "minute", tMINUTE_UNIT, 1 }, |
| { "min", tMINUTE_UNIT, 1 }, |
| { "second", tSEC_UNIT, 1 }, |
| { "sec", tSEC_UNIT, 1 }, |
| { NULL } |
| }; |
| |
| /* 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, 2 }, |
| { "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 } |
| }; |
| |
| /* The timezone table. */ |
| /* Some of these are commented out because a time_t can't store a float. */ |
| 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 */ |
| { "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 Stanard, 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 } |
| }; |
| |
| /* 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 } |
| }; |
| |
| |
| |
| |
| /* ARGSUSED */ |
| static int |
| yyerror(s) |
| const char *s; |
| { |
| return 0; |
| } |
| |
| |
| static time_t |
| ToSeconds(time_t Hours, |
| time_t Minutes, |
| time_t Seconds, |
| MERIDIAN Meridian) |
| { |
| if (Minutes < 0 || Minutes > 59 || Seconds < 0 || Seconds > 59) |
| return -1; |
| switch (Meridian) { |
| case MER24: |
| if (Hours < 0 || Hours > 23) |
| return -1; |
| return (Hours * 60L + Minutes) * 60L + Seconds; |
| case MERam: |
| if (Hours < 1 || Hours > 12) |
| return -1; |
| if (Hours == 12) |
| Hours = 0; |
| return (Hours * 60L + Minutes) * 60L + Seconds; |
| case MERpm: |
| if (Hours < 1 || Hours > 12) |
| return -1; |
| if (Hours == 12) |
| Hours = 0; |
| return ((Hours + 12) * 60L + Minutes) * 60L + Seconds; |
| default: |
| abort (); |
| } |
| /* NOTREACHED */ |
| } |
| |
| |
| /* Year is either |
| * A negative number, which means to use its absolute value (why?) |
| * A number from 0 to 99, which means a year from 1900 to 1999, or |
| * The actual year (>=100). */ |
| static time_t |
| Convert (time_t Month, |
| time_t Day, |
| time_t Year, |
| time_t Hours, |
| time_t Minutes, |
| time_t Seconds, |
| MERIDIAN Meridian, |
| DSTMODE DSTmode) |
| { |
| static int DaysInMonth[12] = { |
| 31, 0, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 |
| }; |
| time_t tod; |
| time_t Julian; |
| int i; |
| |
| if (Year < 0) |
| Year = -Year; |
| if (Year < 69) |
| Year += 2000; |
| else if (Year < 100) |
| Year += 1900; |
| DaysInMonth[1] = Year % 4 == 0 && (Year % 100 != 0 || Year % 400 == 0) |
| ? 29 : 28; |
| /* Checking for 2038 bogusly assumes that time_t is 32 bits. But |
| I'm too lazy to try to check for time_t overflow in another way. */ |
| if (Year < EPOCH || Year > 2038 |
| || Month < 1 || Month > 12 |
| /* Lint fluff: "conversion from long may lose accuracy" */ |
| || Day < 1 || Day > DaysInMonth[(int)--Month]) |
| return -1; |
| |
| for (Julian = Day - 1, i = 0; i < Month; i++) |
| Julian += DaysInMonth[i]; |
| for (i = EPOCH; i < Year; i++) |
| Julian += 365 + (i % 4 == 0); |
| Julian *= SECSPERDAY; |
| Julian += yyTimezone * 60L; |
| if ((tod = ToSeconds(Hours, Minutes, Seconds, Meridian)) < 0) |
| return -1; |
| Julian += tod; |
| if (DSTmode == DSTon |
| || (DSTmode == DSTmaybe && localtime(&Julian)->tm_isdst)) |
| Julian -= 60 * 60; |
| return Julian; |
| } |
| |
| |
| static time_t |
| DSTcorrect(time_t Start, time_t Future) |
| { |
| time_t StartDay; |
| time_t FutureDay; |
| |
| StartDay = (localtime(&Start)->tm_hour + 1) % 24; |
| FutureDay = (localtime(&Future)->tm_hour + 1) % 24; |
| return (Future - Start) + (StartDay - FutureDay) * 60L * 60L; |
| } |
| |
| |
| static time_t |
| RelativeDate(time_t Start, time_t DayOrdinal, time_t DayNumber) |
| { |
| struct tm *tm; |
| time_t now; |
| |
| now = Start; |
| tm = localtime(&now); |
| now += SECSPERDAY * ((DayNumber - tm->tm_wday + 7) % 7); |
| now += 7 * SECSPERDAY * (DayOrdinal <= 0 ? DayOrdinal : DayOrdinal - 1); |
| return DSTcorrect(Start, now); |
| } |
| |
| |
| static time_t |
| RelativeMonth(time_t Start, time_t RelMonth) |
| { |
| struct tm *tm; |
| time_t Month; |
| time_t Year; |
| |
| if (RelMonth == 0) |
| return 0; |
| tm = localtime(&Start); |
| Month = 12 * (tm->tm_year + 1900) + tm->tm_mon + RelMonth; |
| Year = Month / 12; |
| Month = Month % 12 + 1; |
| return DSTcorrect(Start, |
| Convert(Month, (time_t)tm->tm_mday, Year, |
| (time_t)tm->tm_hour, (time_t)tm->tm_min, (time_t)tm->tm_sec, |
| MER24, DSTmaybe)); |
| } |
| |
| |
| static int |
| LookupWord(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(*p)) |
| *p = tolower(*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(*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 char c; |
| register char *p; |
| char buff[20]; |
| int Count; |
| int sign; |
| |
| for ( ; ; ) { |
| while (isspace(*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; isalpha(c = *yyInput++) || 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); |
| int 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 |
| svn_parse_date(char *p, struct getdate_time *now) |
| { |
| struct tm *tm, gmt; |
| struct getdate_time ftz; |
| time_t Start; |
| time_t tod; |
| time_t nowtime; |
| |
| yyInput = p; |
| if (now == NULL) { |
| struct tm *gmt_ptr; |
| |
| now = &ftz; |
| (void)time (&nowtime); |
| |
| gmt_ptr = gmtime (&nowtime); |
| if (gmt_ptr != NULL) |
| { |
| /* Make a copy, in case localtime modifies *tm (I think |
| that comment now applies to *gmt_ptr, but I am too |
| lazy to dig into how gmtime and locatime allocate the |
| structures they return pointers to). */ |
| gmt = *gmt_ptr; |
| } |
| |
| if (! (tm = localtime (&nowtime))) |
| return -1; |
| |
| if (gmt_ptr != NULL) |
| ftz.timezone = difftm (&gmt, tm) / 60; |
| else |
| /* We are on a system like VMS, where the system clock is |
| in local time and the system has no concept of timezones. |
| Hopefully we can fake this out (for the case in which the |
| user specifies no timezone) by just saying the timezone |
| is zero. */ |
| ftz.timezone = 0; |
| |
| if(tm->tm_isdst) |
| ftz.timezone += 60; |
| } |
| else |
| { |
| nowtime = now->time; |
| } |
| |
| tm = localtime(&nowtime); |
| yyYear = tm->tm_year + 1900; |
| yyMonth = tm->tm_mon + 1; |
| yyDay = tm->tm_mday; |
| yyTimezone = now->timezone; |
| yyDSTmode = DSTmaybe; |
| yyHour = 0; |
| yyMinutes = 0; |
| yySeconds = 0; |
| yyMeridian = MER24; |
| yyRelSeconds = 0; |
| yyRelMonth = 0; |
| yyHaveDate = 0; |
| yyHaveDay = 0; |
| yyHaveRel = 0; |
| yyHaveTime = 0; |
| yyHaveZone = 0; |
| |
| if (yyparse() |
| || yyHaveTime > 1 || yyHaveZone > 1 || yyHaveDate > 1 || yyHaveDay > 1) |
| return -1; |
| |
| if (yyHaveDate || yyHaveTime || yyHaveDay) { |
| Start = Convert(yyMonth, yyDay, yyYear, yyHour, yyMinutes, yySeconds, |
| yyMeridian, yyDSTmode); |
| if (Start < 0) |
| return -1; |
| } |
| else { |
| Start = nowtime; |
| if (!yyHaveRel) |
| Start -= ((tm->tm_hour * 60L + tm->tm_min) * 60L) + tm->tm_sec; |
| } |
| |
| Start += yyRelSeconds; |
| Start += RelativeMonth(Start, yyRelMonth); |
| |
| if (yyHaveDay && !yyHaveDate) { |
| tod = RelativeDate(Start, yyDayOrdinal, yyDayNumber); |
| Start += tod; |
| } |
| |
| /* Have to do *something* with a legitimate -1 so it's distinguishable |
| * from the error return value. (Alternately could set errno on error.) */ |
| return Start == -1 ? 0 : Start; |
| } |
| |
| |
| #if defined(TEST) |
| |
| /* ARGSUSED */ |
| int |
| main(int ac, char *av[]) |
| { |
| char buff[128]; |
| time_t d; |
| |
| (void)printf("Enter date, or blank line to exit.\n\t> "); |
| (void)fflush(stdout); |
| while (gets(buff) && buff[0]) { |
| d = svn_parse_date(buff, (struct getdate_time *)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) */ |