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