1/*	$NetBSD$	*/
2
3/*
4 * Copyright (c) 1997-2009 Erez Zadok
5 * Copyright (c) 1990 Jan-Simon Pendry
6 * Copyright (c) 1990 Imperial College of Science, Technology & Medicine
7 * Copyright (c) 1990 The Regents of the University of California.
8 * All rights reserved.
9 *
10 * This code is derived from software contributed to Berkeley by
11 * Jan-Simon Pendry at Imperial College, London.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
16 * 1. Redistributions of source code must retain the above copyright
17 *    notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 *    notice, this list of conditions and the following disclaimer in the
20 *    documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 *    must display the following acknowledgment:
23 *      This product includes software developed by the University of
24 *      California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 *    may be used to endorse or promote products derived from this software
27 *    without specific prior written permission.
28 *
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * SUCH DAMAGE.
40 *
41 *
42 * File: am-utils/amd/amfs_linkx.c
43 *
44 */
45
46/*
47 * Symbol-link file system, with test that the target of the link exists.
48 */
49
50#ifdef HAVE_CONFIG_H
51# include <config.h>
52#endif /* HAVE_CONFIG_H */
53#include <am_defs.h>
54#include <amd.h>
55
56/* forward declarations */
57static int amfs_linkx_mount(am_node *mp, mntfs *mf);
58static int amfs_linkx_umount(am_node *mp, mntfs *mf);
59
60/*
61 * linkx operations
62 */
63struct am_ops amfs_linkx_ops =
64{
65  "linkx",
66  amfs_link_match,
67  0,				/* amfs_linkx_init */
68  amfs_linkx_mount,
69  amfs_linkx_umount,
70  amfs_error_lookup_child,
71  amfs_error_mount_child,
72  amfs_error_readdir,
73  0,				/* amfs_linkx_readlink */
74  0,				/* amfs_linkx_mounted */
75  0,				/* amfs_linkx_umounted */
76  amfs_generic_find_srvr,
77  0,				/* amfs_linkx_get_wchan */
78  FS_MBACKGROUND,
79#ifdef HAVE_FS_AUTOFS
80  AUTOFS_LINKX_FS_FLAGS,
81#endif /* HAVE_FS_AUTOFS */
82};
83
84
85static int
86amfs_linkx_mount(am_node *mp, mntfs *mf)
87{
88  /*
89   * Check for existence of target.
90   */
91  struct stat stb;
92  char *ln;
93
94  if (mp->am_link)
95    ln = mp->am_link;
96  else				/* should never occur */
97    ln = mf->mf_mount;
98
99  /*
100   * Use lstat, not stat, since we don't
101   * want to know if the ultimate target of
102   * a symlink chain exists, just the first.
103   */
104  if (lstat(ln, &stb) < 0)
105    return errno;
106
107  return 0;
108}
109
110
111static int
112amfs_linkx_umount(am_node *mp, mntfs *mf)
113{
114  return 0;
115}
116