1*8bae5d40Schristos /* $NetBSD: hasmntopt.c,v 1.1.1.3 2015/01/17 16:34:18 christos Exp $ */
2a53f50b9Schristos
3a53f50b9Schristos /*
4*8bae5d40Schristos * Copyright (c) 1997-2014 Erez Zadok
5a53f50b9Schristos * Copyright (c) 1990 Jan-Simon Pendry
6a53f50b9Schristos * Copyright (c) 1990 Imperial College of Science, Technology & Medicine
7a53f50b9Schristos * Copyright (c) 1990 The Regents of the University of California.
8a53f50b9Schristos * All rights reserved.
9a53f50b9Schristos *
10a53f50b9Schristos * This code is derived from software contributed to Berkeley by
11a53f50b9Schristos * Jan-Simon Pendry at Imperial College, London.
12a53f50b9Schristos *
13a53f50b9Schristos * Redistribution and use in source and binary forms, with or without
14a53f50b9Schristos n * modification, are permitted provided that the following conditions
15a53f50b9Schristos * are met:
16a53f50b9Schristos * 1. Redistributions of source code must retain the above copyright
17a53f50b9Schristos * notice, this list of conditions and the following disclaimer.
18a53f50b9Schristos * 2. Redistributions in binary form must reproduce the above copyright
19a53f50b9Schristos * notice, this list of conditions and the following disclaimer in the
20a53f50b9Schristos * documentation and/or other materials provided with the distribution.
21*8bae5d40Schristos * 3. Neither the name of the University nor the names of its contributors
22a53f50b9Schristos * may be used to endorse or promote products derived from this software
23a53f50b9Schristos * without specific prior written permission.
24a53f50b9Schristos *
25a53f50b9Schristos * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26a53f50b9Schristos * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27a53f50b9Schristos * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28a53f50b9Schristos * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29a53f50b9Schristos * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30a53f50b9Schristos * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31a53f50b9Schristos * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32a53f50b9Schristos * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33a53f50b9Schristos * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34a53f50b9Schristos * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35a53f50b9Schristos * SUCH DAMAGE.
36a53f50b9Schristos *
37a53f50b9Schristos *
38a53f50b9Schristos * File: am-utils/libamu/hasmntopt.c
39a53f50b9Schristos *
40a53f50b9Schristos */
41a53f50b9Schristos
42a53f50b9Schristos #ifdef HAVE_CONFIG_H
43a53f50b9Schristos # include <config.h>
44a53f50b9Schristos #endif /* HAVE_CONFIG_H */
45a53f50b9Schristos #include <am_defs.h>
46a53f50b9Schristos #include <amu.h>
47a53f50b9Schristos
48a53f50b9Schristos #ifndef MNTMAXSTR
49a53f50b9Schristos # define MNTMAXSTR 256
50a53f50b9Schristos #endif /* not MNTMAXSTR */
51a53f50b9Schristos
52a53f50b9Schristos
53a53f50b9Schristos /*
54a53f50b9Schristos * Some systems don't provide these to the user,
55a53f50b9Schristos * but amd needs them, so...
56a53f50b9Schristos *
57a53f50b9Schristos * From: Piete Brooks <pb@cl.cam.ac.uk>
58a53f50b9Schristos */
59a53f50b9Schristos static char *
nextmntopt(char ** p)60a53f50b9Schristos nextmntopt(char **p)
61a53f50b9Schristos {
62a53f50b9Schristos char *cp = *p;
63a53f50b9Schristos char *rp;
64a53f50b9Schristos
65a53f50b9Schristos /*
66a53f50b9Schristos * Skip past white space
67a53f50b9Schristos */
68a53f50b9Schristos while (*cp && isspace((unsigned char) *cp))
69a53f50b9Schristos cp++;
70a53f50b9Schristos
71a53f50b9Schristos /*
72a53f50b9Schristos * Word starts here
73a53f50b9Schristos */
74a53f50b9Schristos rp = cp;
75a53f50b9Schristos
76a53f50b9Schristos /*
77a53f50b9Schristos * Scan to send of string or separator
78a53f50b9Schristos */
79a53f50b9Schristos while (*cp && *cp != ',')
80a53f50b9Schristos cp++;
81a53f50b9Schristos
82a53f50b9Schristos /*
83a53f50b9Schristos * If separator found the overwrite with null char.
84a53f50b9Schristos */
85a53f50b9Schristos if (*cp) {
86a53f50b9Schristos *cp = '\0';
87a53f50b9Schristos cp++;
88a53f50b9Schristos }
89a53f50b9Schristos
90a53f50b9Schristos /*
91a53f50b9Schristos * Return value for next call
92a53f50b9Schristos */
93a53f50b9Schristos *p = cp;
94a53f50b9Schristos return rp;
95a53f50b9Schristos }
96a53f50b9Schristos
97a53f50b9Schristos
98a53f50b9Schristos /*
99a53f50b9Schristos * replacement for hasmntopt if the system does not have it.
100a53f50b9Schristos */
101a53f50b9Schristos char *
amu_hasmntopt(mntent_t * mnt,char * opt)102a53f50b9Schristos amu_hasmntopt(mntent_t *mnt, char *opt)
103a53f50b9Schristos {
104a53f50b9Schristos char t[MNTMAXSTR];
105a53f50b9Schristos char *f;
106a53f50b9Schristos char *o = t;
107a53f50b9Schristos size_t l = strlen(opt);
108a53f50b9Schristos
109a53f50b9Schristos xstrlcpy(t, mnt->mnt_opts, sizeof(t));
110a53f50b9Schristos
111a53f50b9Schristos while (*(f = nextmntopt(&o)))
112a53f50b9Schristos if (NSTREQ(opt, f, l))
113a53f50b9Schristos return f - t + mnt->mnt_opts;
114a53f50b9Schristos
115a53f50b9Schristos return 0;
116a53f50b9Schristos }
117