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_direct.c 43 * 44 */ 45 46/* 47 * Direct file system 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/**************************************************************************** 57 *** FORWARD DEFINITIONS *** 58 ****************************************************************************/ 59static am_node *amfs_direct_readlink(am_node *mp, int *error_return); 60 61/**************************************************************************** 62 *** OPS STRUCTURES *** 63 ****************************************************************************/ 64am_ops amfs_direct_ops = 65{ 66 "direct", 67 amfs_generic_match, 68 0, /* amfs_direct_init */ 69 amfs_toplvl_mount, 70 amfs_toplvl_umount, 71 amfs_generic_lookup_child, 72 amfs_generic_mount_child, 73 amfs_error_readdir, 74 amfs_direct_readlink, 75 amfs_generic_mounted, 76 0, /* amfs_direct_umounted */ 77 amfs_generic_find_srvr, 78 0, /* amfs_direct_get_wchan */ 79 FS_DIRECT | FS_MKMNT | FS_NOTIMEOUT | FS_BACKGROUND | FS_AMQINFO, 80#ifdef HAVE_FS_AUTOFS 81 AUTOFS_DIRECT_FS_FLAGS, 82#endif /* HAVE_FS_AUTOFS */ 83}; 84 85 86/**************************************************************************** 87 *** FUNCTIONS *** 88 ****************************************************************************/ 89 90static am_node * 91amfs_direct_readlink(am_node *mp, int *error_return) 92{ 93 am_node *xp; 94 int rc = 0; 95 96 xp = next_nonerror_node(mp->am_child); 97 if (!xp) { 98 if (!mp->am_mnt->mf_private) 99 amfs_mkcacheref(mp->am_mnt); /* XXX */ 100 xp = amfs_generic_lookup_child(mp, mp->am_path + 1, &rc, VLOOK_CREATE); 101 if (xp && rc < 0) 102 xp = amfs_generic_mount_child(xp, &rc); 103 } 104 if (xp) { 105 new_ttl(xp); /* (7/12/89) from Rein Tollevik */ 106 return xp; 107 } 108 if (amd_state == Finishing) 109 rc = ENOENT; 110 *error_return = rc; 111 return 0; 112} 113