mtab_bsd.c revision 51292
1/* 2 * Copyright (c) 1997-1999 Erez Zadok 3 * Copyright (c) 1990 Jan-Simon Pendry 4 * Copyright (c) 1990 Imperial College of Science, Technology & Medicine 5 * Copyright (c) 1990 The Regents of the University of California. 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * Jan-Simon Pendry at Imperial College, London. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgment: 21 * This product includes software developed by the University of 22 * California, Berkeley and its contributors. 23 * 4. Neither the name of the University nor the names of its contributors 24 * may be used to endorse or promote products derived from this software 25 * without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 * 39 * %W% (Berkeley) %G% 40 * 41 * $Id: mtab_bsd.c,v 1.2 1999/01/10 21:54:11 ezk Exp $ 42 * 43 */ 44 45/* 46 * BSD 4.4 systems don't write their mount tables on a file. Instead, they 47 * use a (better) system where the kernel keeps this state, and you access 48 * the mount tables via a known interface. 49 */ 50 51#ifdef HAVE_CONFIG_H 52# include <config.h> 53#endif /* HAVE_CONFIG_H */ 54#include <am_defs.h> 55#include <amu.h> 56 57 58static mntent_t * 59mnt_dup(struct statfs *mp) 60{ 61 mntent_t *new_mp = ALLOC(mntent_t); 62 char *ty; 63 64 new_mp->mnt_fsname = strdup(mp->f_mntfromname); 65 new_mp->mnt_dir = strdup(mp->f_mntonname); 66 67#ifdef HAVE_FIELD_STRUCT_STATFS_F_FSTYPENAME 68 ty = mp->f_fstypename; 69#else /* not HAVE_FIELD_STRUCT_STATFS_F_FSTYPENAME */ 70 switch (mp->f_type) { 71 72# if defined(MOUNT_UFS) && defined(MNTTAB_TYPE_UFS) 73 case MOUNT_UFS: 74 ty = MNTTAB_TYPE_UFS; 75 break; 76# endif /* defined(MOUNT_UFS) && defined(MNTTAB_TYPE_UFS) */ 77 78# if defined(MOUNT_NFS) && defined(MNTTAB_TYPE_NFS) 79 case MOUNT_NFS: 80 ty = MNTTAB_TYPE_NFS; 81 break; 82# endif /* defined(MOUNT_NFS) && defined(MNTTAB_TYPE_NFS) */ 83 84# if defined(MOUNT_MFS) && defined(MNTTAB_TYPE_MFS) 85 case MOUNT_MFS: 86 ty = MNTTAB_TYPE_MFS; 87 break; 88# endif /* defined(MOUNT_MFS) && defined(MNTTAB_TYPE_MFS) */ 89 90 default: 91 ty = "unknown"; 92 93 break; 94 } 95#endif /* not HAVE_FIELD_STRUCT_STATFS_F_FSTYPENAME */ 96 97 new_mp->mnt_type = strdup(ty); 98 new_mp->mnt_opts = strdup("unset"); 99 new_mp->mnt_freq = 0; 100 new_mp->mnt_passno = 0; 101 102 return new_mp; 103} 104 105 106/* 107 * Read a mount table into memory 108 */ 109mntlist * 110read_mtab(char *fs, const char *mnttabname) 111{ 112 mntlist **mpp, *mhp; 113 struct statfs *mntbufp, *mntp; 114 115 int nloc = getmntinfo(&mntbufp, MNT_NOWAIT); 116 117 if (nloc == 0) { 118 plog(XLOG_ERROR, "Can't read mount table"); 119 return 0; 120 } 121 mpp = &mhp; 122 for (mntp = mntbufp; mntp < mntbufp + nloc; mntp++) { 123 /* 124 * Allocate a new slot 125 */ 126 *mpp = ALLOC(struct mntlist); 127 128 /* 129 * Copy the data returned by getmntent 130 */ 131 (*mpp)->mnt = mnt_dup(mntp); 132 133 /* 134 * Move to next pointer 135 */ 136 mpp = &(*mpp)->mnext; 137 } 138 139 /* 140 * Terminate the list 141 */ 142 *mpp = 0; 143 144 return mhp; 145} 146