420 lines
9.2 KiB
C
420 lines
9.2 KiB
C
/* $NetBSD: autil.c,v 1.1.1.1 2000/06/07 00:52:22 dogcow Exp $ */
|
|
/*
|
|
* Copyright (c) 1997-2000 Erez Zadok
|
|
* Copyright (c) 1990 Jan-Simon Pendry
|
|
* Copyright (c) 1990 Imperial College of Science, Technology & Medicine
|
|
* Copyright (c) 1990 The Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Jan-Simon Pendry at Imperial College, London.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgment:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* %W% (Berkeley) %G%
|
|
*
|
|
* Id: autil.c,v 1.4 2000/01/12 16:44:17 ezk Exp
|
|
*
|
|
*/
|
|
|
|
/*
|
|
* utilities specified to amd, taken out of the older amd/util.c.
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
# include <config.h>
|
|
#endif /* HAVE_CONFIG_H */
|
|
#include <am_defs.h>
|
|
#include <amd.h>
|
|
|
|
int NumChild = 0; /* number of children of primary amd */
|
|
static char invalid_keys[] = "\"'!;@ \t\n";
|
|
|
|
#ifdef HAVE_TRANSPORT_TYPE_TLI
|
|
# define PARENT_USLEEP_TIME 100000 /* 0.1 seconds */
|
|
#endif /* HAVE_TRANSPORT_TYPE_TLI */
|
|
|
|
|
|
char *
|
|
strealloc(char *p, char *s)
|
|
{
|
|
int len = strlen(s) + 1;
|
|
|
|
p = (char *) xrealloc((voidp) p, len);
|
|
|
|
strcpy(p, s);
|
|
#ifdef DEBUG_MEM
|
|
malloc_verify();
|
|
#endif /* DEBUG_MEM */
|
|
return p;
|
|
}
|
|
|
|
|
|
char **
|
|
strsplit(char *s, int ch, int qc)
|
|
{
|
|
char **ivec;
|
|
int ic = 0;
|
|
int done = 0;
|
|
|
|
ivec = (char **) xmalloc((ic + 1) * sizeof(char *));
|
|
|
|
while (!done) {
|
|
char *v;
|
|
|
|
/*
|
|
* skip to split char
|
|
*/
|
|
while (*s && (ch == ' ' ? (isascii(*s) && isspace((int)*s)) : *s == ch))
|
|
*s++ = '\0';
|
|
|
|
/*
|
|
* End of string?
|
|
*/
|
|
if (!*s)
|
|
break;
|
|
|
|
/*
|
|
* remember start of string
|
|
*/
|
|
v = s;
|
|
|
|
/*
|
|
* skip to split char
|
|
*/
|
|
while (*s && !(ch == ' ' ? (isascii(*s) && isspace((int)*s)) : *s == ch)) {
|
|
if (*s++ == qc) {
|
|
/*
|
|
* Skip past string.
|
|
*/
|
|
s++;
|
|
while (*s && *s != qc)
|
|
s++;
|
|
if (*s == qc)
|
|
s++;
|
|
}
|
|
}
|
|
|
|
if (!*s)
|
|
done = 1;
|
|
*s++ = '\0';
|
|
|
|
/*
|
|
* save string in new ivec slot
|
|
*/
|
|
ivec[ic++] = v;
|
|
ivec = (char **) xrealloc((voidp) ivec, (ic + 1) * sizeof(char *));
|
|
#ifdef DEBUG
|
|
amuDebug(D_STR)
|
|
plog(XLOG_DEBUG, "strsplit saved \"%s\"", v);
|
|
#endif /* DEBUG */
|
|
}
|
|
|
|
#ifdef DEBUG
|
|
amuDebug(D_STR)
|
|
plog(XLOG_DEBUG, "strsplit saved a total of %d strings", ic);
|
|
#endif /* DEBUG */
|
|
|
|
ivec[ic] = 0;
|
|
|
|
return ivec;
|
|
}
|
|
|
|
|
|
/*
|
|
* Strip off the trailing part of a domain
|
|
* to produce a short-form domain relative
|
|
* to the local host domain.
|
|
* Note that this has no effect if the domain
|
|
* names do not have the same number of
|
|
* components. If that restriction proves
|
|
* to be a problem then the loop needs recoding
|
|
* to skip from right to left and do partial
|
|
* matches along the way -- ie more expensive.
|
|
*/
|
|
static void
|
|
domain_strip(char *otherdom, char *localdom)
|
|
{
|
|
char *p1, *p2;
|
|
|
|
if ((p1 = strchr(otherdom, '.')) &&
|
|
(p2 = strchr(localdom, '.')) &&
|
|
STREQ(p1 + 1, p2 + 1))
|
|
*p1 = '\0';
|
|
}
|
|
|
|
|
|
/*
|
|
* Normalize a host name
|
|
*/
|
|
void
|
|
host_normalize(char **chp)
|
|
{
|
|
/*
|
|
* Normalize hosts is used to resolve host name aliases
|
|
* and replace them with the standard-form name.
|
|
* Invoked with "-n" command line option.
|
|
*/
|
|
if (gopt.flags & CFM_NORMALIZE_HOSTNAMES) {
|
|
struct hostent *hp;
|
|
clock_valid = 0;
|
|
hp = gethostbyname(*chp);
|
|
if (hp && hp->h_addrtype == AF_INET) {
|
|
#ifdef DEBUG
|
|
dlog("Hostname %s normalized to %s", *chp, hp->h_name);
|
|
#endif /* DEBUG */
|
|
*chp = strealloc(*chp, (char *) hp->h_name);
|
|
}
|
|
}
|
|
domain_strip(*chp, hostd);
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
* Keys are not allowed to contain " ' ! or ; to avoid
|
|
* problems with macro expansions.
|
|
*/
|
|
int
|
|
valid_key(char *key)
|
|
{
|
|
while (*key)
|
|
if (strchr(invalid_keys, *key++))
|
|
return FALSE;
|
|
return TRUE;
|
|
}
|
|
|
|
|
|
void
|
|
forcibly_timeout_mp(am_node *mp)
|
|
{
|
|
mntfs *mf = mp->am_mnt;
|
|
/*
|
|
* Arrange to timeout this node
|
|
*/
|
|
if (mf && ((mp->am_flags & AMF_ROOT) ||
|
|
(mf->mf_flags & (MFF_MOUNTING | MFF_UNMOUNTING)))) {
|
|
if (!(mf->mf_flags & MFF_UNMOUNTING))
|
|
plog(XLOG_WARNING, "ignoring timeout request for active node %s", mp->am_path);
|
|
} else {
|
|
plog(XLOG_INFO, "\"%s\" forcibly timed out", mp->am_path);
|
|
mp->am_flags &= ~AMF_NOTIMEOUT;
|
|
mp->am_ttl = clocktime();
|
|
reschedule_timeout_mp();
|
|
}
|
|
}
|
|
|
|
|
|
void
|
|
mf_mounted(mntfs *mf)
|
|
{
|
|
int quoted;
|
|
int wasmounted = mf->mf_flags & MFF_MOUNTED;
|
|
|
|
if (!wasmounted) {
|
|
/*
|
|
* If this is a freshly mounted
|
|
* filesystem then update the
|
|
* mntfs structure...
|
|
*/
|
|
mf->mf_flags |= MFF_MOUNTED;
|
|
mf->mf_error = 0;
|
|
|
|
/*
|
|
* Do mounted callback
|
|
*/
|
|
if (mf->mf_ops->mounted) {
|
|
(*mf->mf_ops->mounted) (mf);
|
|
}
|
|
mf->mf_fo = 0;
|
|
}
|
|
|
|
/*
|
|
* Log message
|
|
*/
|
|
quoted = strchr(mf->mf_info, ' ') != 0;
|
|
plog(XLOG_INFO, "%s%s%s %s fstype %s on %s",
|
|
quoted ? "\"" : "",
|
|
mf->mf_info,
|
|
quoted ? "\"" : "",
|
|
wasmounted ? "referenced" : "mounted",
|
|
mf->mf_ops->fs_type, mf->mf_mount);
|
|
}
|
|
|
|
|
|
void
|
|
am_mounted(am_node *mp)
|
|
{
|
|
mntfs *mf = mp->am_mnt;
|
|
|
|
mf_mounted(mf);
|
|
|
|
/*
|
|
* Patch up path for direct mounts
|
|
*/
|
|
if (mp->am_parent && mp->am_parent->am_mnt->mf_ops == &amfs_direct_ops)
|
|
mp->am_path = str3cat(mp->am_path, mp->am_parent->am_path, "/", ".");
|
|
|
|
/*
|
|
* Check whether this mount should be cached permanently
|
|
*/
|
|
if (mf->mf_ops->fs_flags & FS_NOTIMEOUT) {
|
|
mp->am_flags |= AMF_NOTIMEOUT;
|
|
} else if (mf->mf_mount[1] == '\0' && mf->mf_mount[0] == '/') {
|
|
mp->am_flags |= AMF_NOTIMEOUT;
|
|
} else {
|
|
mntent_t mnt;
|
|
if (mf->mf_mopts) {
|
|
mnt.mnt_opts = mf->mf_mopts;
|
|
if (hasmntopt(&mnt, "nounmount"))
|
|
mp->am_flags |= AMF_NOTIMEOUT;
|
|
if ((mp->am_timeo = hasmntval(&mnt, "utimeout")) == 0)
|
|
mp->am_timeo = gopt.am_timeo;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* If this node is a symlink then
|
|
* compute the length of the returned string.
|
|
*/
|
|
if (mp->am_fattr.na_type == NFLNK)
|
|
mp->am_fattr.na_size = strlen(mp->am_link ? mp->am_link : mp->am_mnt->mf_mount);
|
|
|
|
/*
|
|
* Record mount time
|
|
*/
|
|
mp->am_fattr.na_mtime.nt_seconds = mp->am_stats.s_mtime = clocktime();
|
|
new_ttl(mp);
|
|
|
|
/*
|
|
* Update mtime of parent node
|
|
*/
|
|
if (mp->am_parent && mp->am_parent->am_mnt)
|
|
mp->am_parent->am_fattr.na_mtime.nt_seconds = mp->am_stats.s_mtime;
|
|
|
|
/*
|
|
* Now, if we can, do a reply to our NFS client here
|
|
* to speed things up.
|
|
*/
|
|
quick_reply(mp, 0);
|
|
|
|
/*
|
|
* Update stats
|
|
*/
|
|
amd_stats.d_mok++;
|
|
}
|
|
|
|
|
|
int
|
|
mount_node(am_node *mp)
|
|
{
|
|
mntfs *mf = mp->am_mnt;
|
|
int error = 0;
|
|
|
|
mf->mf_flags |= MFF_MOUNTING;
|
|
error = (*mf->mf_ops->mount_fs) (mp);
|
|
|
|
mf = mp->am_mnt;
|
|
if (error >= 0)
|
|
mf->mf_flags &= ~MFF_MOUNTING;
|
|
if (!error && !(mf->mf_ops->fs_flags & FS_MBACKGROUND)) {
|
|
/* ...but see ifs_mount */
|
|
am_mounted(mp);
|
|
}
|
|
|
|
return error;
|
|
}
|
|
|
|
|
|
void
|
|
am_unmounted(am_node *mp)
|
|
{
|
|
mntfs *mf = mp->am_mnt;
|
|
|
|
if (!foreground) /* firewall - should never happen */
|
|
return;
|
|
|
|
/*
|
|
* Do unmounted callback
|
|
*/
|
|
if (mf->mf_ops->umounted)
|
|
(*mf->mf_ops->umounted) (mp);
|
|
|
|
/*
|
|
* Update mtime of parent node
|
|
*/
|
|
if (mp->am_parent && mp->am_parent->am_mnt)
|
|
mp->am_parent->am_fattr.na_mtime.nt_seconds = clocktime();
|
|
|
|
free_map(mp);
|
|
}
|
|
|
|
|
|
/*
|
|
* Fork the automounter
|
|
*
|
|
* TODO: Need a better strategy for handling errors
|
|
*/
|
|
static int
|
|
dofork(void)
|
|
{
|
|
int pid;
|
|
|
|
top:
|
|
pid = fork();
|
|
|
|
if (pid < 0) { /* fork error, retry in 1 second */
|
|
sleep(1);
|
|
goto top;
|
|
}
|
|
if (pid == 0) { /* child process (foreground==false) */
|
|
am_set_mypid();
|
|
foreground = 0;
|
|
} else { /* parent process, has one more child */
|
|
NumChild++;
|
|
}
|
|
|
|
return pid;
|
|
}
|
|
|
|
|
|
int
|
|
background(void)
|
|
{
|
|
int pid = dofork();
|
|
|
|
if (pid == 0) {
|
|
#ifdef DEBUG
|
|
dlog("backgrounded");
|
|
#endif /* DEBUG */
|
|
foreground = 0;
|
|
}
|
|
return pid;
|
|
}
|