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 14n * 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/libamu/hasmntopt.c 43 * 44 */ 45 46#ifdef HAVE_CONFIG_H 47# include <config.h> 48#endif /* HAVE_CONFIG_H */ 49#include <am_defs.h> 50#include <amu.h> 51 52#ifndef MNTMAXSTR 53# define MNTMAXSTR 256 54#endif /* not MNTMAXSTR */ 55 56 57/* 58 * Some systems don't provide these to the user, 59 * but amd needs them, so... 60 * 61 * From: Piete Brooks <pb@cl.cam.ac.uk> 62 */ 63static char * 64nextmntopt(char **p) 65{ 66 char *cp = *p; 67 char *rp; 68 69 /* 70 * Skip past white space 71 */ 72 while (*cp && isspace((unsigned char) *cp)) 73 cp++; 74 75 /* 76 * Word starts here 77 */ 78 rp = cp; 79 80 /* 81 * Scan to send of string or separator 82 */ 83 while (*cp && *cp != ',') 84 cp++; 85 86 /* 87 * If separator found the overwrite with null char. 88 */ 89 if (*cp) { 90 *cp = '\0'; 91 cp++; 92 } 93 94 /* 95 * Return value for next call 96 */ 97 *p = cp; 98 return rp; 99} 100 101 102/* 103 * replacement for hasmntopt if the system does not have it. 104 */ 105char * 106amu_hasmntopt(mntent_t *mnt, char *opt) 107{ 108 char t[MNTMAXSTR]; 109 char *f; 110 char *o = t; 111 size_t l = strlen(opt); 112 113 xstrlcpy(t, mnt->mnt_opts, sizeof(t)); 114 115 while (*(f = nextmntopt(&o))) 116 if (NSTREQ(opt, f, l)) 117 return f - t + mnt->mnt_opts; 118 119 return 0; 120} 121