Deleted Added
sdiff udiff text old ( 63248 ) new ( 81965 )
full compact
genget.c (63248) genget.c (81965)
1/*-
2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 22 unchanged lines hidden (view full) ---

31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35#if 0
36static const char sccsid[] = "@(#)genget.c 8.2 (Berkeley) 5/30/95";
37#else
38static const char rcsid[] =
1/*-
2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 22 unchanged lines hidden (view full) ---

31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35#if 0
36static const char sccsid[] = "@(#)genget.c 8.2 (Berkeley) 5/30/95";
37#else
38static const char rcsid[] =
39 "$FreeBSD: head/contrib/telnet/libtelnet/genget.c 63248 2000-07-16 05:48:49Z peter $";
39 "$FreeBSD: head/contrib/telnet/libtelnet/genget.c 81965 2001-08-20 12:28:40Z markm $";
40#endif
41#endif /* not lint */
42
43
44#include <ctype.h>
45
46#define LOWER(x) (isupper(x) ? tolower(x) : (x))
47/*
48 * The prefix function returns 0 if *s1 is not a prefix
49 * of *s2. If *s1 exactly matches *s2, the negative of
50 * the length is returned. If *s1 is a prefix of *s2,
51 * the length of *s1 is returned.
52 */
40#endif
41#endif /* not lint */
42
43
44#include <ctype.h>
45
46#define LOWER(x) (isupper(x) ? tolower(x) : (x))
47/*
48 * The prefix function returns 0 if *s1 is not a prefix
49 * of *s2. If *s1 exactly matches *s2, the negative of
50 * the length is returned. If *s1 is a prefix of *s2,
51 * the length of *s1 is returned.
52 */
53 int
54isprefix(s1, s2)
55 register char *s1, *s2;
53int
54isprefix(char *s1, char *s2)
56{
57 char *os1;
55{
56 char *os1;
58 register char c1, c2;
57 char c1, c2;
59
60 if (*s1 == '\0')
61 return(-1);
62 os1 = s1;
63 c1 = *s1;
64 c2 = *s2;
65 while (LOWER(c1) == LOWER(c2)) {
66 if (c1 == '\0')
67 break;
68 c1 = *++s1;
69 c2 = *++s2;
70 }
71 return(*s1 ? 0 : (*s2 ? (s1 - os1) : (os1 - s1)));
72}
73
74static char *ambiguous; /* special return value for command routines */
75
58
59 if (*s1 == '\0')
60 return(-1);
61 os1 = s1;
62 c1 = *s1;
63 c2 = *s2;
64 while (LOWER(c1) == LOWER(c2)) {
65 if (c1 == '\0')
66 break;
67 c1 = *++s1;
68 c2 = *++s2;
69 }
70 return(*s1 ? 0 : (*s2 ? (s1 - os1) : (os1 - s1)));
71}
72
73static char *ambiguous; /* special return value for command routines */
74
76 char **
77genget(name, table, stlen)
78 char *name; /* name to match */
79 char **table; /* name entry in table */
80 int stlen;
75char **
76genget(char *name, char **table, int stlen)
81{
77{
82 register char **c, **found;
83 register int n;
78 char **c, **found;
79 int n;
84
85 if (name == 0)
86 return 0;
87
88 found = 0;
89 for (c = table; *c != 0; c = (char **)((char *)c + stlen)) {
90 if ((n = isprefix(name, *c)) == 0)
91 continue;

--- 4 unchanged lines hidden (view full) ---

96 found = c;
97 }
98 return(found);
99}
100
101/*
102 * Function call version of Ambiguous()
103 */
80
81 if (name == 0)
82 return 0;
83
84 found = 0;
85 for (c = table; *c != 0; c = (char **)((char *)c + stlen)) {
86 if ((n = isprefix(name, *c)) == 0)
87 continue;

--- 4 unchanged lines hidden (view full) ---

92 found = c;
93 }
94 return(found);
95}
96
97/*
98 * Function call version of Ambiguous()
99 */
104 int
105Ambiguous(s)
106 char **s;
100int
101Ambiguous(char *s)
107{
102{
108 return(s == &ambiguous);
103 return((char **)s == &ambiguous);
109}
104}