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_ultrix.c 43 * 44 */ 45 46/* 47 * Include before config.h to force single definition of gt_names[] here. 48 * This can be done unconditionally since this file is Ultrix specific 49 * anyway and <sys/fs_types.h> is properly protected from multiple inclusion. 50 * - Rainer Orth <ro@TechFak.Uni-Bielefeld.DE> 51 * Hack hack hack. Sigh. -Erez. 52 */ 53#include <sys/fs_types.h> 54 55#ifdef HAVE_CONFIG_H 56# include <config.h> 57#endif /* HAVE_CONFIG_H */ 58#include <am_defs.h> 59#include <amu.h> 60 61#ifndef NMOUNT 62# define NMOUNT 20 63#endif /* NMOUNT */ 64 65 66static mntent_t * 67mnt_dup(struct fs_data *mp) 68{ 69 mntent_t *new_mp = ALLOC(mntent_t); 70 71 new_mp->mnt_fsname = strdup(mp->fd_devname); 72 new_mp->mnt_dir = strdup(mp->fd_path); 73 if (mp->fd_fstype >= GT_NUMTYPES) 74 mp->fd_fstype = GT_UNKWN; 75 else if (gt_names[mp->fd_fstype] == 0) 76 mp->fd_fstype = GT_UNKWN; 77 new_mp->mnt_type = strdup(gt_names[mp->fd_fstype]); 78 new_mp->mnt_opts = strdup("unset"); 79 80 new_mp->mnt_freq = 0; 81 new_mp->mnt_passno = mp->fd_dev; 82 83 return new_mp; 84} 85 86 87/* 88 * Read a mount table into memory 89 */ 90mntlist * 91read_mtab(char *fs, const char *mnttabname) 92{ 93 mntlist **mpp, *mhp; 94 /* From: Piete Brooks <pb@cl.cam.ac.uk> */ 95 int loc = 0; 96 struct fs_data mountbuffer[NMOUNT], *fs_data; 97 int ret; 98 99 mpp = &mhp; 100 while ((ret = getmountent(&loc, mountbuffer, NMOUNT)) > 0) { 101 for (fs_data = mountbuffer; fs_data < &mountbuffer[ret]; fs_data++) { 102 /* 103 * Allocate a new slot 104 */ 105 *mpp = ALLOC(struct mntlist); 106 107 /* 108 * Copy the data returned by getmntent 109 */ 110 (*mpp)->mnt = mnt_dup(fs_data); 111 112 /* 113 * Move to next pointer 114 */ 115 mpp = &(*mpp)->mnext; 116 } 117 } 118 if (ret < 0) { 119 plog(XLOG_ERROR, "getmountent: %m"); 120 return 0; 121 } 122 *mpp = NULL; 123 124 return mhp; 125} 126