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/conf/mtab/mtab_bsd.c 43 * 44 */ 45 46/* 47 * BSD 4.4 systems don't write their mount tables on a file. Instead, they 48 * use a (better) system where the kernel keeps this state, and you access 49 * the mount tables via a known interface. 50 */ 51 52#ifdef HAVE_CONFIG_H 53# include <config.h> 54#endif /* HAVE_CONFIG_H */ 55#include <am_defs.h> 56#include <amu.h> 57 58#if __NetBSD_Version__ > 200030000 59#define statfs statvfs 60#endif 61 62static mntent_t * 63mnt_dup(struct statfs *mp) 64{ 65 mntent_t *new_mp = ALLOC(mntent_t); 66 char *ty; 67 68 new_mp->mnt_fsname = strdup(mp->f_mntfromname); 69 new_mp->mnt_dir = strdup(mp->f_mntonname); 70 71#ifdef HAVE_STRUCT_STATFS_F_FSTYPENAME 72 ty = mp->f_fstypename; 73#else /* not HAVE_STRUCT_STATFS_F_FSTYPENAME */ 74 switch (mp->f_type) { 75 76# if defined(MOUNT_UFS) && defined(MNTTAB_TYPE_UFS) 77 case MOUNT_UFS: 78 ty = MNTTAB_TYPE_UFS; 79 break; 80# endif /* defined(MOUNT_UFS) && defined(MNTTAB_TYPE_UFS) */ 81 82# if defined(MOUNT_NFS) && defined(MNTTAB_TYPE_NFS) 83 case MOUNT_NFS: 84 ty = MNTTAB_TYPE_NFS; 85 break; 86# endif /* defined(MOUNT_NFS) && defined(MNTTAB_TYPE_NFS) */ 87 88# if defined(MOUNT_MFS) && defined(MNTTAB_TYPE_MFS) 89 case MOUNT_MFS: 90 ty = MNTTAB_TYPE_MFS; 91 break; 92# endif /* defined(MOUNT_MFS) && defined(MNTTAB_TYPE_MFS) */ 93 94 default: 95 ty = "unknown"; 96 97 break; 98 } 99#endif /* not HAVE_STRUCT_STATFS_F_FSTYPENAME */ 100 101 new_mp->mnt_type = strdup(ty); 102 new_mp->mnt_opts = strdup("unset"); 103 new_mp->mnt_freq = 0; 104 new_mp->mnt_passno = 0; 105 106 return new_mp; 107} 108 109 110/* 111 * Read a mount table into memory 112 */ 113mntlist * 114read_mtab(char *fs, const char *mnttabname) 115{ 116 mntlist **mpp, *mhp; 117 struct statfs *mntbufp, *mntp; 118 119 int nloc = getmntinfo(&mntbufp, MNT_NOWAIT); 120 121 if (nloc == 0) { 122 plog(XLOG_ERROR, "Can't read mount table"); 123 return 0; 124 } 125 mpp = &mhp; 126 for (mntp = mntbufp; mntp < mntbufp + nloc; mntp++) { 127 /* 128 * Allocate a new slot 129 */ 130 *mpp = ALLOC(struct mntlist); 131 132 /* 133 * Copy the data returned by getmntent 134 */ 135 (*mpp)->mnt = mnt_dup(mntp); 136 137 /* 138 * Move to next pointer 139 */ 140 mpp = &(*mpp)->mnext; 141 } 142 143 /* 144 * Terminate the list 145 */ 146 *mpp = NULL; 147 148 return mhp; 149} 150