The man2html from jbasney on pkilab2 works whereas the standard one doesn't.

[gssapi-openssh.git] / openssh / match.c

diff --git a/openssh/match.c b/openssh/match.c
index 29fb7dab94e252bf0d4e61e7254b46bde41d84dd..188b9a4169f69e77477c2a35ad49b02812bd7fa0 100644 (file)
--- a/openssh/match.c
+++ b/openssh/match.c
@@ -35,7 +35,7 @@
  */
 
 #include "includes.h"
-RCSID("$OpenBSD: match.c,v 1.20 2005/06/17 02:44:32 djm Exp $");
+RCSID("$OpenBSD: match.c,v 1.14 2001/06/27 04:48:53 markus Exp $");
 
 #include "match.h"
 #include "xmalloc.h"
@@ -104,15 +104,14 @@ match_pattern(const char *s, const char *pattern)
 }
 
 /*
- * Tries to match the string against the
+ * Tries to match the host name (which must be in all lowercase) against the
  * comma-separated sequence of subpatterns (each possibly preceded by ! to
  * indicate negation).  Returns -1 if negation matches, 1 if there is
  * a positive match, 0 if there is no match at all.
  */
 
 int
-match_pattern_list(const char *string, const char *pattern, u_int len,
-    int dolower)
+match_hostname(const char *host, const char *pattern, u_int len)
 {
        char sub[1024];
        int negated;
@@ -133,10 +132,9 @@ match_pattern_list(const char *string, const char *pattern, u_int len,
                 * subpattern to lowercase.
                 */
                for (subi = 0;
-                   i < len && subi < sizeof(sub) - 1 && pattern[i] != ',';
-                   subi++, i++)
-                       sub[subi] = dolower && isupper(pattern[i]) ?
-                           tolower(pattern[i]) : pattern[i];
+                    i < len && subi < sizeof(sub) - 1 && pattern[i] != ',';
+                    subi++, i++)
+                       sub[subi] = isupper(pattern[i]) ? tolower(pattern[i]) : pattern[i];
                /* If subpattern too long, return failure (no match). */
                if (subi >= sizeof(sub) - 1)
                        return 0;
@@ -148,8 +146,8 @@ match_pattern_list(const char *string, const char *pattern, u_int len,
                /* Null-terminate the subpattern. */
                sub[subi] = '\0';
 
-               /* Try to match the subpattern against the string. */
-               if (match_pattern(string, sub)) {
+               /* Try to match the subpattern against the host name. */
+               if (match_pattern(host, sub)) {
                        if (negated)
                                return -1;              /* Negative */
                        else
@@ -164,18 +162,6 @@ match_pattern_list(const char *string, const char *pattern, u_int len,
        return got_positive;
 }
 
-/*
- * Tries to match the host name (which must be in all lowercase) against the
- * comma-separated sequence of subpatterns (each possibly preceded by ! to
- * indicate negation).  Returns -1 if negation matches, 1 if there is
- * a positive match, 0 if there is no match at all.
- */
-int
-match_hostname(const char *host, const char *pattern, u_int len)
-{
-       return match_pattern_list(host, pattern, len, 1);
-}
-
 /*
  * returns 0 if we get a negative match for the hostname or the ip
  * or if we get no match at all.  returns 1 otherwise.
@@ -226,7 +212,7 @@ match_user(const char *user, const char *host, const char *ipaddr,
  * Returns first item from client-list that is also supported by server-list,
  * caller must xfree() returned string.
  */
-#define        MAX_PROP        40
+#define        MAX_PROP        20
 #define        SEP     ","
 char *
 match_list(const char *client, const char *server, u_int *next)
@@ -239,7 +225,7 @@ match_list(const char *client, const char *server, u_int *next)
        s = sp = xstrdup(server);
 
        for ((p = strsep(&sp, SEP)), i=0; p && *p != '\0';
-           (p = strsep(&sp, SEP)), i++) {
+            (p = strsep(&sp, SEP)), i++) {
                if (i < MAX_PROP)
                        sproposals[i] = p;
                else
@@ -248,13 +234,13 @@ match_list(const char *client, const char *server, u_int *next)
        nproposals = i;
 
        for ((p = strsep(&cp, SEP)), i=0; p && *p != '\0';
-           (p = strsep(&cp, SEP)), i++) {
+            (p = strsep(&cp, SEP)), i++) {
                for (j = 0; j < nproposals; j++) {
                        if (strcmp(p, sproposals[j]) == 0) {
                                ret = xstrdup(p);
                                if (next != NULL)
                                        *next = (cp == NULL) ?
-                                           strlen(c) : (u_int)(cp - c);
+                                           strlen(c) : cp - c;
                                xfree(c);
                                xfree(s);
                                return ret;