2 * Author: Tatu Ylonen <ylo@cs.hut.fi>
3 * Copyright (c) 1995 Tatu Ylonen <ylo@cs.hut.fi>, Espoo, Finland
5 * Simple pattern matching, with '*' and '?' as wildcards.
7 * As far as I am concerned, the code I have written for this software
8 * can be used freely for any purpose. Any derived versions of this
9 * software must be clearly marked as such, and if the derived work is
10 * incompatible with the protocol description in the RFC file, it must be
11 * called by a name other than "ssh" or "Secure Shell".
14 * Copyright (c) 2000 Markus Friedl. All rights reserved.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
25 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
26 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
27 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
28 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
29 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
30 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
31 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
32 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
33 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
34 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
38 RCSID("$OpenBSD: match.c,v 1.12 2001/03/10 17:51:04 markus Exp $");
44 * Returns true if the given string matches the pattern (which may contain ?
45 * and * as wildcards), and zero if it does not match.
49 match_pattern(const char *s, const char *pattern)
52 /* If at end of pattern, accept if also at end of string. */
56 if (*pattern == '*') {
57 /* Skip the asterisk. */
60 /* If at end of pattern, accept immediately. */
64 /* If next character in pattern is known, optimize. */
65 if (*pattern != '?' && *pattern != '*') {
67 * Look instances of the next character in
68 * pattern, and try to match starting from
73 match_pattern(s + 1, pattern + 1))
79 * Move ahead one character at a time and try to
80 * match at each position.
83 if (match_pattern(s, pattern))
89 * There must be at least one more character in the string.
90 * If we are at the end, fail.
95 /* Check if the next character of the string is acceptable. */
96 if (*pattern != '?' && *pattern != *s)
99 /* Move to the next character, both in string and in pattern. */
107 * Tries to match the host name (which must be in all lowercase) against the
108 * comma-separated sequence of subpatterns (each possibly preceded by ! to
109 * indicate negation). Returns -1 if negation matches, 1 if there is
110 * a positive match, 0 if there is no match at all.
114 match_hostname(const char *host, const char *pattern, u_int len)
122 for (i = 0; i < len;) {
123 /* Check if the subpattern is negated. */
124 if (pattern[i] == '!') {
131 * Extract the subpattern up to a comma or end. Convert the
132 * subpattern to lowercase.
135 i < len && subi < sizeof(sub) - 1 && pattern[i] != ',';
137 sub[subi] = isupper(pattern[i]) ? tolower(pattern[i]) : pattern[i];
138 /* If subpattern too long, return failure (no match). */
139 if (subi >= sizeof(sub) - 1)
142 /* If the subpattern was terminated by a comma, skip the comma. */
143 if (i < len && pattern[i] == ',')
146 /* Null-terminate the subpattern. */
149 /* Try to match the subpattern against the host name. */
150 if (match_pattern(host, sub)) {
152 return -1; /* Negative */
154 got_positive = 1; /* Positive */
159 * Return success if got a positive match. If there was a negative
160 * match, we have already returned -1 and never get here.
169 match_list(const char *client, const char *server, u_int *next)
171 char *sproposals[MAX_PROP];
172 char *c, *s, *p, *ret, *cp, *sp;
173 int i, j, nproposals;
175 c = cp = xstrdup(client);
176 s = sp = xstrdup(server);
178 for ((p = strsep(&sp, SEP)), i=0; p && *p != '\0';
179 (p = strsep(&sp, SEP)), i++) {
187 for ((p = strsep(&cp, SEP)), i=0; p && *p != '\0';
188 (p = strsep(&cp, SEP)), i++) {
189 for (j = 0; j < nproposals; j++) {
190 if (strcmp(p, sproposals[j]) == 0) {
193 *next = (cp == NULL) ?