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