2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 static char sccsid[] = "@(#)genget.c 8.1 (Berkeley) 6/4/93";
41 #define LOWER(x) (isupper(x) ? tolower(x) : (x))
43 * The prefix function returns 0 if *s1 is not a prefix
44 * of *s2. If *s1 exactly matches *s2, the negative of
45 * the length is returned. If *s1 is a prefix of *s2,
46 * the length of *s1 is returned.
50 register char *s1, *s2;
60 while (LOWER(c1) == LOWER(c2)) {
66 return(*s1 ? 0 : (*s2 ? (s1 - os1) : (os1 - s1)));
69 static char *ambiguous; /* special return value for command routines */
72 genget(name, table, stlen)
73 char *name; /* name to match */
74 char **table; /* name entry in table */
77 register char **c, **found;
84 for (c = table; *c != 0; c = (char **)((char *)c + stlen)) {
85 if ((n = isprefix(name, *c)) == 0)
87 if (n < 0) /* exact match */
97 * Function call version of Ambiguous()
103 return((char **)s == &ambiguous);