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