1*7c478bd9Sstevel@tonic-gate /*
2*7c478bd9Sstevel@tonic-gate * Copyright 2002 Sun Microsystems, Inc. All rights reserved.
3*7c478bd9Sstevel@tonic-gate * Use is subject to license terms.
4*7c478bd9Sstevel@tonic-gate */
5*7c478bd9Sstevel@tonic-gate
6*7c478bd9Sstevel@tonic-gate /*
7*7c478bd9Sstevel@tonic-gate * Copyright (c) 1991, 1993
8*7c478bd9Sstevel@tonic-gate * The Regents of the University of California. All rights reserved.
9*7c478bd9Sstevel@tonic-gate *
10*7c478bd9Sstevel@tonic-gate * Redistribution and use in source and binary forms, with or without
11*7c478bd9Sstevel@tonic-gate * modification, are permitted provided that the following conditions
12*7c478bd9Sstevel@tonic-gate * are met:
13*7c478bd9Sstevel@tonic-gate * 1. Redistributions of source code must retain the above copyright
14*7c478bd9Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer.
15*7c478bd9Sstevel@tonic-gate * 2. Redistributions in binary form must reproduce the above copyright
16*7c478bd9Sstevel@tonic-gate * notice, this list of conditions and the following disclaimer in the
17*7c478bd9Sstevel@tonic-gate * documentation and/or other materials provided with the distribution.
18*7c478bd9Sstevel@tonic-gate * 3. All advertising materials mentioning features or use of this software
19*7c478bd9Sstevel@tonic-gate * must display the following acknowledgement:
20*7c478bd9Sstevel@tonic-gate * This product includes software developed by the University of
21*7c478bd9Sstevel@tonic-gate * California, Berkeley and its contributors.
22*7c478bd9Sstevel@tonic-gate * 4. Neither the name of the University nor the names of its contributors
23*7c478bd9Sstevel@tonic-gate * may be used to endorse or promote products derived from this software
24*7c478bd9Sstevel@tonic-gate * without specific prior written permission.
25*7c478bd9Sstevel@tonic-gate *
26*7c478bd9Sstevel@tonic-gate * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27*7c478bd9Sstevel@tonic-gate * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28*7c478bd9Sstevel@tonic-gate * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29*7c478bd9Sstevel@tonic-gate * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30*7c478bd9Sstevel@tonic-gate * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31*7c478bd9Sstevel@tonic-gate * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32*7c478bd9Sstevel@tonic-gate * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33*7c478bd9Sstevel@tonic-gate * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34*7c478bd9Sstevel@tonic-gate * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35*7c478bd9Sstevel@tonic-gate * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36*7c478bd9Sstevel@tonic-gate * SUCH DAMAGE.
37*7c478bd9Sstevel@tonic-gate */
38*7c478bd9Sstevel@tonic-gate
39*7c478bd9Sstevel@tonic-gate #ifndef lint
40*7c478bd9Sstevel@tonic-gate static char sccsid[] = "@(#)genget.c 8.1 (Berkeley) 6/4/93";
41*7c478bd9Sstevel@tonic-gate #endif /* not lint */
42*7c478bd9Sstevel@tonic-gate
43*7c478bd9Sstevel@tonic-gate #include <ctype.h>
44*7c478bd9Sstevel@tonic-gate #include <sys/types.h>
45*7c478bd9Sstevel@tonic-gate
46*7c478bd9Sstevel@tonic-gate #define LOWER(x) (isupper(x) ? tolower(x) : (x))
47*7c478bd9Sstevel@tonic-gate
48*7c478bd9Sstevel@tonic-gate static char *ambiguous; /* special return value for command routines */
49*7c478bd9Sstevel@tonic-gate
50*7c478bd9Sstevel@tonic-gate /*
51*7c478bd9Sstevel@tonic-gate * The prefix function returns 0 if *s1 is not a prefix
52*7c478bd9Sstevel@tonic-gate * of *s2. If *s1 exactly matches *s2, the negative of
53*7c478bd9Sstevel@tonic-gate * the length is returned. If *s1 is a prefix of *s2,
54*7c478bd9Sstevel@tonic-gate * the length of *s1 is returned.
55*7c478bd9Sstevel@tonic-gate */
56*7c478bd9Sstevel@tonic-gate int
isprefix(char * s1,char * s2)57*7c478bd9Sstevel@tonic-gate isprefix(char *s1, char *s2)
58*7c478bd9Sstevel@tonic-gate {
59*7c478bd9Sstevel@tonic-gate char *os1;
60*7c478bd9Sstevel@tonic-gate char c1, c2;
61*7c478bd9Sstevel@tonic-gate
62*7c478bd9Sstevel@tonic-gate if (*s1 == '\0')
63*7c478bd9Sstevel@tonic-gate return (-1);
64*7c478bd9Sstevel@tonic-gate os1 = s1;
65*7c478bd9Sstevel@tonic-gate c1 = *s1;
66*7c478bd9Sstevel@tonic-gate c2 = *s2;
67*7c478bd9Sstevel@tonic-gate while (LOWER(c1) == LOWER(c2)) {
68*7c478bd9Sstevel@tonic-gate if (c1 == '\0')
69*7c478bd9Sstevel@tonic-gate break;
70*7c478bd9Sstevel@tonic-gate c1 = *++s1;
71*7c478bd9Sstevel@tonic-gate c2 = *++s2;
72*7c478bd9Sstevel@tonic-gate }
73*7c478bd9Sstevel@tonic-gate return (*s1 ? 0 : (*s2 ? (s1 - os1) : (os1 - s1)));
74*7c478bd9Sstevel@tonic-gate }
75*7c478bd9Sstevel@tonic-gate
76*7c478bd9Sstevel@tonic-gate
77*7c478bd9Sstevel@tonic-gate /*
78*7c478bd9Sstevel@tonic-gate * Get an entry from the table, from what might be a prefix
79*7c478bd9Sstevel@tonic-gate *
80*7c478bd9Sstevel@tonic-gate * name = name to match
81*7c478bd9Sstevel@tonic-gate * table = name entry in table
82*7c478bd9Sstevel@tonic-gate */
83*7c478bd9Sstevel@tonic-gate char **
genget(char * name,char ** table,int stlen)84*7c478bd9Sstevel@tonic-gate genget(char *name, char **table, int stlen)
85*7c478bd9Sstevel@tonic-gate {
86*7c478bd9Sstevel@tonic-gate register char **c, **found;
87*7c478bd9Sstevel@tonic-gate register int n;
88*7c478bd9Sstevel@tonic-gate
89*7c478bd9Sstevel@tonic-gate if (name == 0)
90*7c478bd9Sstevel@tonic-gate return (0);
91*7c478bd9Sstevel@tonic-gate
92*7c478bd9Sstevel@tonic-gate found = 0;
93*7c478bd9Sstevel@tonic-gate /*LINTED*/
94*7c478bd9Sstevel@tonic-gate for (c = table; *c != NULL; c = (char **)((char *)c + stlen)) {
95*7c478bd9Sstevel@tonic-gate if ((n = isprefix(name, *c)) == 0)
96*7c478bd9Sstevel@tonic-gate continue;
97*7c478bd9Sstevel@tonic-gate if (n < 0) /* exact match */
98*7c478bd9Sstevel@tonic-gate return (c);
99*7c478bd9Sstevel@tonic-gate if (found)
100*7c478bd9Sstevel@tonic-gate return (&ambiguous);
101*7c478bd9Sstevel@tonic-gate found = c;
102*7c478bd9Sstevel@tonic-gate }
103*7c478bd9Sstevel@tonic-gate return (found);
104*7c478bd9Sstevel@tonic-gate }
105*7c478bd9Sstevel@tonic-gate
106*7c478bd9Sstevel@tonic-gate /*
107*7c478bd9Sstevel@tonic-gate * Function call version of Ambiguous()
108*7c478bd9Sstevel@tonic-gate */
109*7c478bd9Sstevel@tonic-gate boolean_t
Ambiguous(void * s)110*7c478bd9Sstevel@tonic-gate Ambiguous(void *s)
111*7c478bd9Sstevel@tonic-gate {
112*7c478bd9Sstevel@tonic-gate return ((char **)s == &ambiguous);
113*7c478bd9Sstevel@tonic-gate }
114