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