/* A Bison parser, made from exports.y
by GNU bison 1.35. */
#define YYBISON 1 /* Identify Bison output. */
# define PATH 257
# define ID 258
# define OPTVALUE 259
# define WHITE 260
# define IP 261
# define NET 262
# define OLDNET 263
#line 1 "exports.y"
/*
* UNFS3 exports parser and export controls
* (C) 2004, Pascal Schmidt
* see file LICENSE for license details
*/
#include "../config.h"
#include <rpc/rpc.h>
#include <limits.h>
#include <netdb.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <unistd.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include "../nfs.h"
#include "../mount.h"
#include "../daemon.h"
#include "../backend.h"
#include "exports.h"
#ifndef PATH_MAX
# define PATH_MAX 4096
#endif
/* for lack of a better place */
#ifdef __GNUC__
#define U(x) x __attribute__ ((unused))
#else
#define U(x) x
#endif
/* lexer stuff, to avoid compiler warnings */
int yylex(void);
extern FILE *yyin;
/*
* C code used by yacc parser
*/
typedef struct {
char orig[NFS_MAXPATHLEN];
int options;
unsigned char password[PASSWORD_MAXLEN+1];
uint32 password_hash;
struct in_addr addr;
struct in_addr mask;
struct e_host *next;
} e_host;
typedef struct {
char path[NFS_MAXPATHLEN];
char orig[NFS_MAXPATHLEN];
e_host *hosts;
uint32 fsid; /* export point fsid (for removables) */
time_t last_mtime; /* Last returned mtime (for removables) */
uint32 dir_hash; /* Hash of dir contents (for removables) */
struct e_item *next;
} e_item;
/* export list, item, and host filled during parse */
static e_item *e_list = NULL;
static e_item cur_item;
static e_host cur_host;
/* mount protocol compatible variants */
static exports ne_list = NULL;
static struct exportnode ne_item;
static struct groupnode ne_host;
/* error status of last parse */
int e_error = FALSE;
/*
* The FNV1a-32 hash algorithm
* (http://www.isthe.com/chongo/tech/comp/fnv/)
*/
uint32 fnv1a_32(const char *str, uint32 hval)
{
static const uint32 fnv_32_prime = 0x01000193;
while (*str) {
hval ^= *str++;
hval *= fnv_32_prime;
}
return hval;
}
/*
* get static fsid, for use with removable media export points
*/
static uint32 get_free_fsid(const char *path)
{
uint32 hval;
/* The 32:th bit is set to one on all special filehandles. The
last 31 bits are hashed from the export point path. */
hval = fnv1a_32(path, 0);
hval |= 0x10000000UL;
return hval;
}
/*
* clear current host
*/
static void clear_host(void)
{
memset(&cur_host, 0, sizeof(e_host));
strcpy(cur_host.orig, "<anon clnt>");
memset(&ne_host, 0, sizeof(struct groupnode));
}
/*
* clear current item
*/
static void clear_item(void)
{
memset(&cur_item, 0, sizeof(e_item));
memset(&ne_item, 0, sizeof(struct exportnode));
}
/*
* add current host to current export item
*/
static void add_host(void)
{
e_host *new;
e_host *iter;
groups ne_new;
groups ne_iter;
new = malloc(sizeof(e_host));
ne_new = malloc(sizeof(struct groupnode));
if (!new || !ne_new) {
logmsg(LOG_EMERG, "out of memory, aborting");
daemon_exit(CRISIS);
}
*new = cur_host;
*ne_new = ne_host;
ne_new->gr_name = new->orig;
/* internal list */
if (cur_item.hosts) {
iter = cur_item.hosts;
while (iter->next)
iter = (e_host *) iter->next;
iter->next = (struct e_host *) new;
} else
cur_item.hosts = new;
/* matching mount protocol list */
if (ne_item.ex_groups) {
ne_iter = ne_item.ex_groups;
while (ne_iter->gr_next)
ne_iter = (groups) ne_iter->gr_next;
ne_iter->gr_next = ne_new;
} else
ne_item.ex_groups = ne_new;
clear_host();
}
/*
* add current item to current export list
*/
static void add_item(const char *path)
{
char buf[PATH_MAX];
e_item *new;
e_item *iter;
e_host *host;
/* Is this item marked as removable for all hosts? */
int removable_for_all = 1;
exports ne_new;
exports ne_iter;
new = malloc(sizeof(e_item));
ne_new = malloc(sizeof(struct exportnode));
if (!new || !ne_new) {
logmsg(LOG_EMERG, "out of memory, aborting");
daemon_exit(CRISIS);
}
/* Loop over all hosts and check if marked as removable. */
host = cur_item.hosts;
while (host) {
if (!(host->options & OPT_REMOVABLE))
removable_for_all = 0;
host = (e_host *) host->next;
}
if (removable_for_all) {
/* If marked as removable for all hosts, don't try
realpath. */
strncpy(buf, path, PATH_MAX);
} else if (!backend_realpath(path, buf)) {
logmsg(LOG_CRIT, "realpath for %s failed", path);
e_error = TRUE;
free(new);
free(ne_new);
clear_item();
return;
}
if (strlen(buf) + 1 > NFS_MAXPATHLEN) {
logmsg(LOG_CRIT, "attempted to export too long path");
e_error = TRUE;
free(new);
free(ne_new);
clear_item();
return;
}
/* if no hosts listed, list default host */
if (!cur_item.hosts)
add_host();
*new = cur_item;
strcpy(new->path, buf);
strcpy(new->orig, path);
new->fsid = get_free_fsid(path);
new->last_mtime = 0;
new->dir_hash = 0;
*ne_new = ne_item;
ne_new->ex_dir = new->orig;
/* internal list */
if (e_list) {
iter = e_list;
while (iter->next)
iter = (e_item *) iter->next;
iter->next = (struct e_item *) new;
} else
e_list = new;
/* matching mount protocol list */
if (ne_list) {
ne_iter = ne_list;
while (ne_iter->ex_next)
ne_iter = (exports) ne_iter->ex_next;
ne_iter->ex_next = ne_new;
} else
ne_list = ne_new;
clear_item();
}
/*
* fill current host's address given a hostname
*/
static void set_hostname(const char *name)
{
struct hostent *ent;
if (strlen(name) + 1 > NFS_MAXPATHLEN) {
e_error = TRUE;
return;
}
strcpy(cur_host.orig, name);
ent = gethostbyname(name);
if (ent) {
memcpy(&cur_host.addr, ent->h_addr_list[0],
sizeof(struct in_addr));
cur_host.mask.s_addr = ~0UL;
} else {
logmsg(LOG_CRIT, "could not resolve hostname '%s'", name);
e_error = TRUE;
}
}
/*
* fill current host's address given an IP address
*/
static void set_ipaddr(const char *addr)
{
strcpy(cur_host.orig, addr);
if (!inet_aton(addr, &cur_host.addr))
e_error = TRUE;
cur_host.mask.s_addr = ~0UL;
}
/*
* compute network bitmask
*/
static unsigned long make_netmask(int bits) {
unsigned long buf = 0;
int i;
for (i=0; i<bits; i++)
buf = (buf << 1) + 1;
return buf;
}
/*
* fill current host's address given IP address and netmask
*/
static void set_ipnet(char *addr, int new)
{
char *pos, *net;
pos = strchr(addr, '/');
net = pos + 1;
*pos = 0;
set_ipaddr(addr);
if (new)
cur_host.mask.s_addr = make_netmask(atoi(net));
else
if (!inet_aton(net, &cur_host.mask))
e_error = TRUE;
*pos = '/';
strcpy(cur_host.orig, addr);
}
/*
* add an option bit to the current host
*/
static void add_option(const char *opt)
{
if (strcmp(opt,"no_root_squash") == 0)
cur_host.options |= OPT_NO_ROOT_SQUASH;
else if (strcmp(opt,"root_squash") == 0)
cur_host.options &= ~OPT_NO_ROOT_SQUASH;
else if (strcmp(opt,"all_squash") == 0)
cur_host.options |= OPT_ALL_SQUASH;
else if (strcmp(opt,"no_all_sqash") == 0)
cur_host.options &= ~OPT_ALL_SQUASH;
else if (strcmp(opt,"rw") == 0)
cur_host.options |= OPT_RW;
else if (strcmp(opt,"ro") == 0)
cur_host.options &= ~OPT_RW;
else if (strcmp(opt,"removable") == 0)
cur_host.options |= OPT_REMOVABLE;
else if (strcmp(opt,"fixed") == 0)
cur_host.options &= ~OPT_REMOVABLE;
else if (strcmp(opt,"insecure") == 0)
cur_host.options |= OPT_INSECURE;
else if (strcmp(opt,"secure") == 0)
cur_host.options &= ~OPT_INSECURE;
}
static void add_option_with_value(const char *opt, const char *val)
{
if (strcmp(opt,"password") == 0) {
if (strlen(val) > PASSWORD_MAXLEN) {
logmsg(LOG_WARNING, "Warning: password for export %s truncated to 64 chars",
cur_item.orig);
}
strncpy(cur_host.password, val, sizeof(password));
cur_host.password[PASSWORD_MAXLEN] = '\0';
/* Calculate hash */
cur_host.password_hash = fnv1a_32(cur_host.password, 0);
}
}
/*
* dummy error function
*/
void yyerror(U(char *s))
{
e_error = TRUE;
return;
}
#line 381 "exports.y"
#ifndef YYSTYPE
typedef union {
char text[NFS_MAXPATHLEN];
} yystype;
# define YYSTYPE yystype
# define YYSTYPE_IS_TRIVIAL 1
#endif
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#define YYFINAL 28
#define YYFLAG -32768
#define YYNTBASE 14
/* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */
#define YYTRANSLATE(x) ((unsigned)(x) <= 263 ? yytranslate[x] : 21)
/* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */
static const char yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
10, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
11, 12, 2, 2, 13, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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
};
#if YYDEBUG
static const short yyprhs[] =
{
0, 0, 2, 6, 7, 9, 13, 16, 18, 22,
25, 27, 32, 36, 38, 40, 42, 44, 46, 50,
51, 53
};
static const short yyrhs[] =
{
15, 0, 15, 10, 14, 0, 0, 3, 0, 3,
6, 16, 0, 3, 6, 0, 17, 0, 17, 6,
16, 0, 17, 6, 0, 18, 0, 18, 11, 19,
12, 0, 11, 19, 12, 0, 4, 0, 7, 0,
8, 0, 9, 0, 20, 0, 20, 13, 19, 0,
0, 4, 0, 4, 5, 0
};
#endif
#if YYDEBUG
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const short yyrline[] =
{
0, 395, 397, 398, 401, 403, 404, 407, 409, 410,
413, 415, 416, 419, 421, 422, 423, 426, 428, 429,
432, 434
};
#endif
#if (YYDEBUG) || defined YYERROR_VERBOSE
/* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */
static const char *const yytname[] =
{
"$", "error", "$undefined.", "PATH", "ID", "OPTVALUE", "WHITE", "IP",
"NET", "OLDNET", "'\\n'", "'('", "')'", "','", "exports", "export",
"hosts", "host", "name", "opts", "opt", 0
};
#endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const short yyr1[] =
{
0, 14, 14, 14, 15, 15, 15, 16, 16, 16,
17, 17, 17, 18, 18, 18, 18, 19, 19, 19,
20, 20
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const short yyr2[] =
{
0, 1, 3, 0, 1, 3, 2, 1, 3, 2,
1, 4, 3, 1, 1, 1, 1, 1, 3, 0,
1, 2
};
/* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE
doesn't specify something else to do. Zero means the default is an
error. */
static const short yydefact[] =
{
3, 4, 1, 6, 3, 13, 14, 15, 16, 19,
5, 7, 10, 2, 20, 0, 17, 9, 19, 21,
12, 19, 8, 0, 18, 11, 0, 0, 0
};
static const short yydefgoto[] =
{
13, 2, 10, 11, 12, 15, 16
};
static const short yypact[] =
{
-2, 2, -8, -4, -2,-32768,-32768,-32768,-32768, 6,
-32768, 5, 1,-32768, 8, 3, 4, -4, 6,-32768,
-32768, 6,-32768, 7,-32768,-32768, 14, 16,-32768
};
static const short yypgoto[] =
{
18,-32768, 9,-32768,-32768, -12,-32768
};
#define YYLAST 26
static const short yytable[] =
{
5, 1, 4, 6, 7, 8, 23, 9, 3, 24,
14, 17, 18, 19, 27, 20, 28, 21, 26, 25,
0, 0, 0, 0, 0, 0, 22
};
static const short yycheck[] =
{
4, 3, 10, 7, 8, 9, 18, 11, 6, 21,
4, 6, 11, 5, 0, 12, 0, 13, 0, 12,
-1, -1, -1, -1, -1, -1, 17
};
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
#line 3 "/usr/local/share/bison/bison.simple"
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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. */
/* 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. */
#if ! defined (yyoverflow) || defined (YYERROR_VERBOSE)
/* The parser invokes alloca or malloc; define the necessary symbols. */
# if YYSTACK_USE_ALLOCA
# define YYSTACK_ALLOC alloca
# else
# ifndef YYSTACK_USE_ALLOCA
# if defined (alloca) || defined (_ALLOCA_H)
# define YYSTACK_ALLOC alloca
# else
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's `empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# else
# if defined (__STDC__) || defined (__cplusplus)
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# endif
# define YYSTACK_ALLOC malloc
# define YYSTACK_FREE free
# endif
#endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */
#if (! defined (yyoverflow) \
&& (! defined (__cplusplus) \
|| (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
short yyss;
YYSTYPE yyvs;
# if YYLSP_NEEDED
YYLTYPE yyls;
# endif
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# if YYLSP_NEEDED
# define YYSTACK_BYTES(N) \
((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+ 2 * YYSTACK_GAP_MAX)
# else
# define YYSTACK_BYTES(N) \
((N) * (sizeof (short) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAX)
# endif
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if 1 < __GNUC__
# define YYCOPY(To, From, Count) \
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
# else
# define YYCOPY(To, From, Count) \
do \
{ \
register YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(To)[yyi] = (From)[yyi]; \
} \
while (0)
# endif
# endif
/* 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) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack, Stack, yysize); \
Stack = &yyptr->Stack; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAX; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (0)
#endif
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
# define YYSIZE_T __SIZE_TYPE__
#endif
#if ! defined (YYSIZE_T) && defined (size_t)
# define YYSIZE_T size_t
#endif
#if ! defined (YYSIZE_T)
# if defined (__STDC__) || defined (__cplusplus)
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# endif
#endif
#if ! defined (YYSIZE_T)
# define YYSIZE_T unsigned int
#endif
#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
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
are run).
When YYLLOC_DEFAULT is run, CURRENT is set the location of the
first token. By default, to implement support for ranges, extend
its range to the last symbol. */
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
Current.last_line = Rhs[N].last_line; \
Current.last_column = Rhs[N].last_column;
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#if YYPURE
# if YYLSP_NEEDED
# ifdef YYLEX_PARAM
# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
# else
# define YYLEX yylex (&yylval, &yylloc)
# endif
# else /* !YYLSP_NEEDED */
# ifdef YYLEX_PARAM
# define YYLEX yylex (&yylval, YYLEX_PARAM)
# else
# define YYLEX yylex (&yylval)
# endif
# endif /* !YYLSP_NEEDED */
#else /* !YYPURE */
# define YYLEX yylex ()
#endif /* !YYPURE */
/* 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)
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
#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
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#if YYMAXDEPTH == 0
# undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#ifdef YYERROR_VERBOSE
# ifndef yystrlen
# if defined (__GLIBC__) && defined (_STRING_H)
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
static YYSIZE_T
# if defined (__STDC__) || defined (__cplusplus)
yystrlen (const char *yystr)
# else
yystrlen (yystr)
const char *yystr;
# endif
{
register const char *yys = yystr;
while (*yys++ != '\0')
continue;
return yys - yystr - 1;
}
# endif
# endif
# ifndef yystpcpy
# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
static char *
# if defined (__STDC__) || defined (__cplusplus)
yystpcpy (char *yydest, const char *yysrc)
# else
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
# endif
{
register char *yyd = yydest;
register const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
#endif
#line 315 "/usr/local/share/bison/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
# if defined (__STDC__) || defined (__cplusplus)
# define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
# define YYPARSE_PARAM_DECL
# else
# define YYPARSE_PARAM_ARG YYPARSE_PARAM
# define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
# endif
#else /* !YYPARSE_PARAM */
# define YYPARSE_PARAM_ARG
# define YYPARSE_PARAM_DECL
#endif /* !YYPARSE_PARAM */
/* Prevent warning if -Wstrict-prototypes. */
#ifdef __GNUC__
# ifdef YYPARSE_PARAM
int yyparse (void *);
# else
int yyparse (void);
# endif
#endif
/* YY_DECL_VARIABLES -- depending whether we use a pure parser,
variables are global, or local to YYPARSE. */
#define YY_DECL_NON_LSP_VARIABLES \
/* The lookahead symbol. */ \
int yychar; \
\
/* The semantic value of the lookahead symbol. */ \
YYSTYPE yylval; \
\
/* Number of parse errors so far. */ \
int yynerrs;
#if YYLSP_NEEDED
# define YY_DECL_VARIABLES \
YY_DECL_NON_LSP_VARIABLES \
\
/* Location data for the lookahead symbol. */ \
YYLTYPE yylloc;
#else
# define YY_DECL_VARIABLES \
YY_DECL_NON_LSP_VARIABLES
#endif
/* If nonreentrant, generate the variables here. */
#if !YYPURE
YY_DECL_VARIABLES
#endif /* !YYPURE */
int
yyparse (YYPARSE_PARAM_ARG)
YYPARSE_PARAM_DECL
{
/* If reentrant, generate the variables here. */
#if YYPURE
YY_DECL_VARIABLES
#endif /* !YYPURE */
register int yystate;
register int yyn;
int yyresult;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* Lookahead token as an internal (translated) token number. */
int yychar1 = 0;
/* Three stacks and their tools:
`yyss': related to states,
`yyvs': related to semantic values,
`yyls': related to locations.
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
short yyssa[YYINITDEPTH];
short *yyss = yyssa;
register short *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
register YYSTYPE *yyvsp;
#if YYLSP_NEEDED
/* The location stack. */
YYLTYPE yylsa[YYINITDEPTH];
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#endif
#if YYLSP_NEEDED
# define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
#else
# define YYPOPSTACK (yyvsp--, yyssp--)
#endif
YYSIZE_T yystacksize = YYINITDEPTH;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYLSP_NEEDED
YYLTYPE yyloc;
#endif
/* When reducing, the number of symbols on the RHS of the reduced
rule. */
int yylen;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss;
yyvsp = yyvs;
#if YYLSP_NEEDED
yylsp = yyls;
#endif
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks.
*/
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. */
# if YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
/* 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, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yyls1, yysize * sizeof (*yylsp),
&yystacksize);
yyls = yyls1;
# else
yyoverflow ("parser stack overflow",
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
# endif
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyoverflowlab;
# else
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
goto yyoverflowlab;
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
{
short *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyoverflowlab;
YYSTACK_RELOCATE (yyss);
YYSTACK_RELOCATE (yyvs);
# if YYLSP_NEEDED
YYSTACK_RELOCATE (yyls);
# endif
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
#if YYLSP_NEEDED
yylsp = yyls + yysize - 1;
#endif
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
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. */
/* 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)
{
YYDPRINTF ((stderr, "Reading a token: "));
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 */
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yychar1 = YYTRANSLATE (yychar);
#if YYDEBUG
/* We have to keep this `#if YYDEBUG', since we use variables
which are defined only if `YYDEBUG' is set. */
if (yydebug)
{
YYFPRINTF (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
YYFPRINTF (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. */
YYDPRINTF ((stderr, "Shifting token %d (%s), ",
yychar, yytname[yychar1]));
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#if YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
yystate = yyn;
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 the semantic value of
the lookahead token. 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];
#if YYLSP_NEEDED
/* Similarly for the default location. Let the user run additional
commands if for instance locations are ranges. */
yyloc = yylsp[1-yylen];
YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
#endif
#if YYDEBUG
/* We have to keep this `#if YYDEBUG', since we use variables which
are defined only if `YYDEBUG' is set. */
if (yydebug)
{
int yyi;
YYFPRINTF (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++)
YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 4:
#line 402 "exports.y"
{ add_item(yyvsp[0].text); }
break;
case 5:
#line 403 "exports.y"
{ add_item(yyvsp[-2].text); }
break;
case 6:
#line 404 "exports.y"
{ add_item(yyvsp[-1].text); }
break;
case 10:
#line 414 "exports.y"
{ add_host(); }
break;
case 11:
#line 415 "exports.y"
{ add_host(); }
break;
case 12:
#line 416 "exports.y"
{ add_host(); }
break;
case 13:
#line 420 "exports.y"
{ set_hostname(yyvsp[0].text); }
break;
case 14:
#line 421 "exports.y"
{ set_ipaddr(yyvsp[0].text); }
break;
case 15:
#line 422 "exports.y"
{ set_ipnet(yyvsp[0].text, TRUE); }
break;
case 16:
#line 423 "exports.y"
{ set_ipnet(yyvsp[0].text, FALSE); }
break;
case 20:
#line 433 "exports.y"
{ add_option(yyvsp[0].text); }
break;
case 21:
#line 434 "exports.y"
{ add_option_with_value(yyvsp[-1].text,yyvsp[0].text); }
break;
}
#line 705 "/usr/local/share/bison/bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#if YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#if YYLSP_NEEDED
*++yylsp = yyloc;
#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 |
`------------------------------------*/
yyerrlab:
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
YYSIZE_T yysize = 0;
char *yymsg;
int yyx, yycount;
yycount = 0;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
if (yycheck[yyx + yyn] == yyx)
yysize += yystrlen (yytname[yyx]) + 15, yycount++;
yysize += yystrlen ("parse error, unexpected ") + 1;
yysize += yystrlen (yytname[YYTRANSLATE (yychar)]);
yymsg = (char *) YYSTACK_ALLOC (yysize);
if (yymsg != 0)
{
char *yyp = yystpcpy (yymsg, "parse error, unexpected ");
yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]);
if (yycount < 5)
{
yycount = 0;
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *));
yyx++)
if (yycheck[yyx + yyn] == yyx)
{
const char *yyq = ! yycount ? ", expecting " : " or ";
yyp = yystpcpy (yyp, yyq);
yyp = yystpcpy (yyp, yytname[yyx]);
yycount++;
}
}
yyerror (yymsg);
YYSTACK_FREE (yymsg);
}
else
yyerror ("parse error; also virtual memory exhausted");
}
else
#endif /* defined (YYERROR_VERBOSE) */
yyerror ("parse error");
}
goto yyerrlab1;
/*--------------------------------------------------.
| yyerrlab1 -- error raised explicitly by an action |
`--------------------------------------------------*/
yyerrlab1:
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;
YYDPRINTF ((stderr, "Discarding token %d (%s).\n",
yychar, yytname[yychar1]));
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. |
`-------------------------------------------------------------------*/
yyerrdefault:
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
/* If its default is to accept any token, ok. Otherwise pop it. */
yyn = yydefact[yystate];
if (yyn)
goto yydefault;
#endif
/*---------------------------------------------------------------.
| yyerrpop -- pop the current state because it cannot handle the |
| error token |
`---------------------------------------------------------------*/
yyerrpop:
if (yyssp == yyss)
YYABORT;
yyvsp--;
yystate = *--yyssp;
#if YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "Error: state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
/*--------------.
| yyerrhandle. |
`--------------*/
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;
YYDPRINTF ((stderr, "Shifting error token, "));
*++yyvsp = yylval;
#if YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
/*---------------------------------------------.
| yyoverflowab -- parser overflow comes here. |
`---------------------------------------------*/
yyoverflowlab:
yyerror ("parser stack overflow");
yyresult = 2;
/* Fall through. */
yyreturn:
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
return yyresult;
}
#line 436 "exports.y"
/*
* C code using yacc parser + access code for exports list
*/
/* effective export list and access flag */
static e_item *export_list = NULL;
static volatile int exports_access = FALSE;
/* mount protocol compatible exports list */
exports exports_nfslist = NULL;
/*
* free NFS groups list
*/
void free_nfsgroups(groups group)
{
groups list, next;
list = group;
while (list) {
next = (groups) list->gr_next;
free(list);
list = next;
}
}
/*
* free NFS exports list
*/
void free_nfslist(exports elist)
{
exports list, next;
list = elist;
while(list) {
next = (exports) list->ex_next;
free_nfsgroups(list->ex_groups);
free(list);
list = next;
}
}
/*
* free list of host structures
*/
static void free_hosts(e_item *item)
{
e_host *host, *cur;
host = item->hosts;
while (host) {
cur = host;
host = (e_host *) host->next;
free(cur);
}
}
/*
* free list of export items
*/
static void free_list(e_item *item)
{
e_item *cur;
while (item) {
free_hosts(item);
cur = item;
item = (e_item *) item->next;
free(cur);
}
}
/*
* print out the current exports list (for debugging)
*/
void print_list(void)
{
char addrbuf[16], maskbuf[16];
e_item *item;
e_host *host;
item = e_list;
while (item) {
host = item->hosts;
while (host) {
/* inet_ntoa returns static buffer */
strcpy(addrbuf, inet_ntoa(host->addr));
strcpy(maskbuf, inet_ntoa(host->mask));
printf("%s: ip %s mask %s options %i\n",
item->path, addrbuf, maskbuf,
host->options);
host = (e_host *) host->next;
}
item = (e_item *) item->next;
}
}
/*
* clear current parse state
*/
static void clear_cur(void)
{
e_list = NULL;
ne_list = NULL;
e_error = FALSE;
clear_host();
clear_item();
}
/*
* parse an exports file
*/
void exports_parse(void)
{
FILE *efile;
/*
* if we are in the SIGHUP handler, a may_mount or get_options
* may currently be accessing the list
*/
if (exports_access) {
logmsg(LOG_CRIT, "export list is being traversed, no reload\n");
return;
}
efile = fopen(opt_exports, "r");
if (!efile) {
logmsg(LOG_CRIT, "could not open '%s', exporting nothing",
opt_exports);
free_list(export_list);
free_nfslist(exports_nfslist);
export_list = NULL;
exports_nfslist = NULL;
return;
}
yyin = efile;
clear_cur();
yyparse();
fclose(efile);
if (e_error) {
logmsg(LOG_CRIT, "syntax error in '%s', exporting nothing",
opt_exports);
free_list(export_list);
free_nfslist(exports_nfslist);
export_list = NULL;
exports_nfslist = NULL;
return;
}
/* print out new list for debugging */
if (!opt_detach)
print_list();
free_list(export_list);
free_nfslist(exports_nfslist);
export_list = e_list;
exports_nfslist = ne_list;
}
/*
* find a given host inside a host list, return options
*/
static int find_host(struct in_addr remote, e_item *item,
char **password, uint32 *password_hash)
{
e_host *host;
host = item->hosts;
while (host) {
if ((remote.s_addr & host->mask.s_addr) == host->addr.s_addr) {
if (password != NULL)
*password = host->password;
if (password_hash != NULL)
*password_hash = host->password_hash;
return host->options;
}
host = (e_host *) host->next;
}
return -1;
}
/* options cache */
int exports_opts = -1;
uint32 export_password_hash = 0;
/*
* given a path, return client's effective options
*/
int exports_options(const char *path, struct svc_req *rqstp,
char **password, uint32 *fsid)
{
e_item *list;
struct in_addr remote;
unsigned int last_len = 0;
int cur_opts;
exports_opts = -1;
/* check for client attempting to use invalid pathname */
if (!path || strstr(path, "/../"))
return exports_opts;
remote = get_remote(rqstp);
/* protect against SIGHUP reloading the list */
exports_access = TRUE;
list = export_list;
while (list) {
/* longest matching prefix wins */
if (strlen(list->path) > last_len &&
strstr(path, list->path) == path) {
cur_opts = find_host(remote, list, password, &export_password_hash);
if (fsid != NULL)
*fsid = list->fsid;
if (cur_opts != -1) {
exports_opts = cur_opts;
last_len = strlen(list->path);
}
}
list = (e_item *) list->next;
}
exports_access = FALSE;
return exports_opts;
}
/*
* check whether path is an export point
*/
int export_point(const char *path)
{
e_item *list;
exports_access = TRUE;
list = export_list;
while (list) {
if (strcmp(path, list->path) == 0) {
exports_access = FALSE;
return TRUE;
}
list = (e_item *) list->next;
}
exports_access = FALSE;
return FALSE;
}
/*
* return exported path from static fsid
*/
char *export_point_from_fsid(uint32 fsid, time_t **last_mtime, uint32 **dir_hash)
{
e_item *list;
exports_access = TRUE;
list = export_list;
while (list) {
if (list->fsid == fsid) {
if (last_mtime != NULL)
*last_mtime = &list->last_mtime;
if (dir_hash != NULL)
*dir_hash = &list->dir_hash;
exports_access = FALSE;
return list->path;
}
list = (e_item *) list->next;
}
exports_access = FALSE;
return NULL;
}
/*
* check whether export options of a path match with last set of options
*/
nfsstat3 exports_compat(const char *path, struct svc_req *rqstp)
{
int prev;
prev = exports_opts;
if (exports_options(path, rqstp, NULL, NULL) == prev)
return NFS3_OK;
else if (exports_opts == -1)
return NFS3ERR_ACCES;
else
return NFS3ERR_XDEV;
}
/*
* check whether options indicate rw mount
*/
nfsstat3 exports_rw(void)
{
if (exports_opts != -1 && (exports_opts & OPT_RW))
return NFS3_OK;
else
return NFS3ERR_ROFS;
}
syntax highlighted by Code2HTML, v. 0.9.1