version 1.15, 2001/12/05 16:54:51 |
version 1.16, 2001/12/19 07:18:56 |
|
|
* subpattern to lowercase. |
* subpattern to lowercase. |
*/ |
*/ |
for (subi = 0; |
for (subi = 0; |
i < len && subi < sizeof(sub) - 1 && pattern[i] != ','; |
i < len && subi < sizeof(sub) - 1 && pattern[i] != ','; |
subi++, i++) |
subi++, i++) |
sub[subi] = dolower && isupper(pattern[i]) ? |
sub[subi] = dolower && isupper(pattern[i]) ? |
tolower(pattern[i]) : pattern[i]; |
tolower(pattern[i]) : pattern[i]; |
/* If subpattern too long, return failure (no match). */ |
/* If subpattern too long, return failure (no match). */ |
if (subi >= sizeof(sub) - 1) |
if (subi >= sizeof(sub) - 1) |
return 0; |
return 0; |
|
|
s = sp = xstrdup(server); |
s = sp = xstrdup(server); |
|
|
for ((p = strsep(&sp, SEP)), i=0; p && *p != '\0'; |
for ((p = strsep(&sp, SEP)), i=0; p && *p != '\0'; |
(p = strsep(&sp, SEP)), i++) { |
(p = strsep(&sp, SEP)), i++) { |
if (i < MAX_PROP) |
if (i < MAX_PROP) |
sproposals[i] = p; |
sproposals[i] = p; |
else |
else |
|
|
nproposals = i; |
nproposals = i; |
|
|
for ((p = strsep(&cp, SEP)), i=0; p && *p != '\0'; |
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++) { |
for (j = 0; j < nproposals; j++) { |
if (strcmp(p, sproposals[j]) == 0) { |
if (strcmp(p, sproposals[j]) == 0) { |
ret = xstrdup(p); |
ret = xstrdup(p); |