2002-01-17 18:39:37 +08:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1989, 1993, 1994
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Guido van Rossum.
|
|
|
|
*
|
2015-11-19 03:51:12 +08:00
|
|
|
* Copyright (c) 2011 The FreeBSD Foundation
|
|
|
|
* All rights reserved.
|
|
|
|
* Portions of this software were developed by David Chisnall
|
|
|
|
* under sponsorship from the FreeBSD Foundation.
|
|
|
|
*
|
2002-01-17 18:39:37 +08:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
|
|
static char sccsid[] = "@(#)fnmatch.c 8.2 (Berkeley) 4/16/94";
|
|
|
|
#endif /* LIBC_SCCS and not lint */
|
2016-03-15 05:19:42 +08:00
|
|
|
#include "winsup.h"
|
2010-01-16 23:11:56 +08:00
|
|
|
#include <sys/cdefs.h>
|
2015-11-19 03:51:12 +08:00
|
|
|
__FBSDID("$FreeBSD: head/lib/libc/gen/fnmatch.c 288309 2015-09-27 12:52:18Z jilles $");
|
2002-01-17 18:39:37 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Function fnmatch() as specified in POSIX 1003.2-1992, section B.6.
|
|
|
|
* Compares a filename or pathname to a pattern.
|
|
|
|
*/
|
|
|
|
|
2010-01-16 23:11:56 +08:00
|
|
|
/*
|
|
|
|
* Some notes on multibyte character support:
|
|
|
|
* 1. Patterns with illegal byte sequences match nothing.
|
|
|
|
* 2. Illegal byte sequences in the "string" argument are handled by treating
|
|
|
|
* them as single-byte characters with a value of the first byte of the
|
2023-02-14 19:47:54 +08:00
|
|
|
* sequence cast to wint_t.
|
2010-01-16 23:11:56 +08:00
|
|
|
* 3. Multibyte conversion state objects (mbstate_t) are passed around and
|
|
|
|
* used for most, but not all, conversions. Further work will be required
|
|
|
|
* to support state-dependent encodings.
|
|
|
|
*/
|
2002-01-17 18:39:37 +08:00
|
|
|
|
|
|
|
#include <fnmatch.h>
|
2010-01-16 23:11:56 +08:00
|
|
|
#include <limits.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <wchar.h>
|
|
|
|
#include <wctype.h>
|
|
|
|
|
2015-11-19 03:51:12 +08:00
|
|
|
#include "collate.h"
|
2002-01-17 18:39:37 +08:00
|
|
|
|
|
|
|
#define EOS '\0'
|
|
|
|
|
2010-01-16 23:11:56 +08:00
|
|
|
#define RANGE_MATCH 1
|
|
|
|
#define RANGE_NOMATCH 0
|
|
|
|
#define RANGE_ERROR (-1)
|
2002-01-17 18:39:37 +08:00
|
|
|
|
2023-03-01 17:54:00 +08:00
|
|
|
static int rangematch(const wint_t *, wint_t *, int, wint_t **, mbstate_t *);
|
2002-01-17 18:39:37 +08:00
|
|
|
|
|
|
|
int
|
2023-03-01 17:54:00 +08:00
|
|
|
fnmatch(const char *in_pattern, const char *in_string, int flags)
|
2010-01-16 23:11:56 +08:00
|
|
|
{
|
2023-03-01 17:54:00 +08:00
|
|
|
size_t pclen = strlen (in_pattern);
|
|
|
|
size_t sclen = strlen (in_string);
|
|
|
|
wint_t *pattern = (wint_t *) alloca ((pclen + 1) * sizeof (wint_t));
|
|
|
|
wint_t *string = (wint_t *) alloca ((sclen + 1) * sizeof (wint_t));
|
|
|
|
|
|
|
|
const wint_t *stringstart = string;
|
|
|
|
const wint_t *bt_pattern, *bt_string;
|
|
|
|
mbstate_t patmbs = { 0 };
|
|
|
|
mbstate_t strmbs = { 0 };
|
2015-11-19 03:51:12 +08:00
|
|
|
mbstate_t bt_patmbs, bt_strmbs;
|
2023-03-01 17:54:00 +08:00
|
|
|
wint_t *newp;
|
|
|
|
wint_t *c;
|
|
|
|
wint_t *pc, *sc;
|
|
|
|
|
|
|
|
pclen = mbsnrtowci (pattern, &in_pattern, (size_t) -1, pclen, &patmbs);
|
|
|
|
if (pclen == (size_t) -1)
|
|
|
|
return (FNM_NOMATCH);
|
|
|
|
pattern[pclen] = '\0';
|
|
|
|
sclen = mbsnrtowci (string, &in_string, (size_t) -1, sclen, &strmbs);
|
|
|
|
if (sclen == (size_t) -1)
|
|
|
|
return (FNM_NOMATCH);
|
|
|
|
string[sclen] = '\0';
|
2002-01-17 18:39:37 +08:00
|
|
|
|
2015-11-19 03:51:12 +08:00
|
|
|
bt_pattern = bt_string = NULL;
|
|
|
|
for (;;) {
|
2023-03-01 17:54:00 +08:00
|
|
|
pc = pattern++;
|
|
|
|
sc = string;
|
|
|
|
switch (*pc) {
|
2002-01-17 18:39:37 +08:00
|
|
|
case EOS:
|
2023-03-01 17:54:00 +08:00
|
|
|
if ((flags & FNM_LEADING_DIR) && *sc == '/')
|
2002-01-17 18:39:37 +08:00
|
|
|
return (0);
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == EOS)
|
2015-11-19 03:51:12 +08:00
|
|
|
return (0);
|
|
|
|
goto backtrack;
|
2002-01-17 18:39:37 +08:00
|
|
|
case '?':
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == EOS)
|
2002-01-17 18:39:37 +08:00
|
|
|
return (FNM_NOMATCH);
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == '/' && (flags & FNM_PATHNAME))
|
2015-11-19 03:51:12 +08:00
|
|
|
goto backtrack;
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == '.' && (flags & FNM_PERIOD) &&
|
2002-01-17 18:39:37 +08:00
|
|
|
(string == stringstart ||
|
|
|
|
((flags & FNM_PATHNAME) && *(string - 1) == '/')))
|
2015-11-19 03:51:12 +08:00
|
|
|
goto backtrack;
|
2023-03-01 17:54:00 +08:00
|
|
|
++string;
|
2002-01-17 18:39:37 +08:00
|
|
|
break;
|
|
|
|
case '*':
|
2023-03-01 17:54:00 +08:00
|
|
|
c = pattern;
|
2002-01-17 18:39:37 +08:00
|
|
|
/* Collapse multiple stars. */
|
2023-03-01 17:54:00 +08:00
|
|
|
while (*c == '*')
|
|
|
|
*c = *++pattern;
|
2002-01-17 18:39:37 +08:00
|
|
|
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == '.' && (flags & FNM_PERIOD) &&
|
2002-01-17 18:39:37 +08:00
|
|
|
(string == stringstart ||
|
|
|
|
((flags & FNM_PATHNAME) && *(string - 1) == '/')))
|
2015-11-19 03:51:12 +08:00
|
|
|
goto backtrack;
|
2002-01-17 18:39:37 +08:00
|
|
|
|
|
|
|
/* Optimize for pattern with * at end or before /. */
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*c == EOS)
|
2002-01-17 18:39:37 +08:00
|
|
|
if (flags & FNM_PATHNAME)
|
|
|
|
return ((flags & FNM_LEADING_DIR) ||
|
2023-03-01 17:54:00 +08:00
|
|
|
wcichr(string, '/') == NULL ?
|
2002-01-17 18:39:37 +08:00
|
|
|
0 : FNM_NOMATCH);
|
|
|
|
else
|
|
|
|
return (0);
|
2023-03-01 17:54:00 +08:00
|
|
|
else if (*c == '/' && flags & FNM_PATHNAME) {
|
|
|
|
if ((string = wcichr(string, '/')) == NULL)
|
2002-01-17 18:39:37 +08:00
|
|
|
return (FNM_NOMATCH);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2015-11-19 03:51:12 +08:00
|
|
|
/*
|
|
|
|
* First try the shortest match for the '*' that
|
|
|
|
* could work. We can forget any earlier '*' since
|
|
|
|
* there is no way having it match more characters
|
|
|
|
* can help us, given that we are already here.
|
|
|
|
*/
|
2023-03-01 17:54:00 +08:00
|
|
|
bt_pattern = pattern;
|
|
|
|
bt_patmbs = patmbs;
|
|
|
|
bt_string = string;
|
|
|
|
bt_strmbs = strmbs;
|
2015-11-19 03:51:12 +08:00
|
|
|
break;
|
2002-01-17 18:39:37 +08:00
|
|
|
case '[':
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == EOS)
|
2002-01-17 18:39:37 +08:00
|
|
|
return (FNM_NOMATCH);
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == '/' && (flags & FNM_PATHNAME))
|
2015-11-19 03:51:12 +08:00
|
|
|
goto backtrack;
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == '.' && (flags & FNM_PERIOD) &&
|
2002-01-17 18:39:37 +08:00
|
|
|
(string == stringstart ||
|
|
|
|
((flags & FNM_PATHNAME) && *(string - 1) == '/')))
|
2015-11-19 03:51:12 +08:00
|
|
|
goto backtrack;
|
2002-01-17 18:39:37 +08:00
|
|
|
|
2023-03-01 17:54:00 +08:00
|
|
|
int ret = rangematch(pattern, sc, flags, &newp,
|
|
|
|
&patmbs);
|
|
|
|
switch (ret) {
|
2002-01-17 18:39:37 +08:00
|
|
|
case RANGE_ERROR:
|
2010-01-16 23:11:56 +08:00
|
|
|
goto norm;
|
2002-01-17 18:39:37 +08:00
|
|
|
case RANGE_NOMATCH:
|
2015-11-19 03:51:12 +08:00
|
|
|
goto backtrack;
|
2023-03-01 17:54:00 +08:00
|
|
|
default: /* > 0 ... case RANGE_MATCH */
|
|
|
|
pattern = newp;
|
|
|
|
break;
|
2002-01-17 18:39:37 +08:00
|
|
|
}
|
2023-03-01 17:54:00 +08:00
|
|
|
string += ret;
|
2002-01-17 18:39:37 +08:00
|
|
|
break;
|
|
|
|
case '\\':
|
|
|
|
if (!(flags & FNM_NOESCAPE)) {
|
2023-03-01 17:54:00 +08:00
|
|
|
pc = pattern++;
|
2002-01-17 18:39:37 +08:00
|
|
|
}
|
2020-08-06 03:58:22 +08:00
|
|
|
fallthrough;
|
2002-01-17 18:39:37 +08:00
|
|
|
default:
|
2010-01-16 23:11:56 +08:00
|
|
|
norm:
|
2023-03-01 17:54:00 +08:00
|
|
|
++string;
|
|
|
|
if (*pc == *sc)
|
2010-01-16 23:11:56 +08:00
|
|
|
;
|
|
|
|
else if ((flags & FNM_CASEFOLD) &&
|
2023-03-01 17:54:00 +08:00
|
|
|
(towlower(*pc) == towlower(*sc)))
|
2010-01-16 23:11:56 +08:00
|
|
|
;
|
2015-11-19 03:51:12 +08:00
|
|
|
else {
|
|
|
|
backtrack:
|
|
|
|
/*
|
|
|
|
* If we have a mismatch (other than hitting
|
|
|
|
* the end of the string), go back to the last
|
|
|
|
* '*' seen and have it match one additional
|
|
|
|
* character.
|
|
|
|
*/
|
|
|
|
if (bt_pattern == NULL)
|
|
|
|
return (FNM_NOMATCH);
|
2023-03-01 17:54:00 +08:00
|
|
|
sc = (wint_t *) bt_string;
|
|
|
|
if (*sc == EOS)
|
2015-11-19 03:51:12 +08:00
|
|
|
return (FNM_NOMATCH);
|
2023-03-01 17:54:00 +08:00
|
|
|
if (*sc == '/' && flags & FNM_PATHNAME)
|
2015-11-19 03:51:12 +08:00
|
|
|
return (FNM_NOMATCH);
|
2023-03-01 17:54:00 +08:00
|
|
|
++bt_string;
|
|
|
|
pattern = (wint_t *) bt_pattern;
|
|
|
|
patmbs = bt_patmbs;
|
|
|
|
string = (wint_t *) bt_string;
|
|
|
|
strmbs = bt_strmbs;
|
2015-11-19 03:51:12 +08:00
|
|
|
}
|
2002-01-17 18:39:37 +08:00
|
|
|
break;
|
|
|
|
}
|
2010-01-16 23:11:56 +08:00
|
|
|
}
|
2002-01-17 18:39:37 +08:00
|
|
|
/* NOTREACHED */
|
|
|
|
}
|
|
|
|
|
2023-03-01 17:54:00 +08:00
|
|
|
/* Return value is either '\0', ':', '.', '=', or '[' if no class
|
|
|
|
expression found. cptr_p is set to the next character which needs
|
|
|
|
checking. */
|
|
|
|
static inline wint_t
|
|
|
|
check_classes_expr(const wint_t **cptr_p, wint_t *classbuf, size_t classbufsize)
|
|
|
|
{
|
|
|
|
const wint_t *ctype = NULL;
|
|
|
|
const wint_t *cptr = *cptr_p;
|
|
|
|
|
|
|
|
if (*cptr == '[' &&
|
|
|
|
(cptr[1] == ':' || cptr[1] == '.' || cptr[1] == '=')) {
|
|
|
|
ctype = ++cptr;
|
|
|
|
while (*++cptr && (*cptr != *ctype || cptr[1] != ']'))
|
|
|
|
;
|
|
|
|
if (!*cptr)
|
|
|
|
return '\0';
|
|
|
|
if (classbuf) {
|
|
|
|
const wint_t *class_p = ctype + 1;
|
|
|
|
size_t clen = cptr - class_p;
|
|
|
|
|
|
|
|
if (clen < classbufsize)
|
|
|
|
*wcipncpy (classbuf, class_p, clen) = '\0';
|
|
|
|
else
|
|
|
|
ctype = NULL;
|
|
|
|
}
|
|
|
|
cptr += 2; /* Advance cptr to next char after class expr. */
|
|
|
|
}
|
|
|
|
*cptr_p = cptr;
|
|
|
|
return ctype ? *ctype : '[';
|
|
|
|
}
|
|
|
|
|
2002-01-17 18:39:37 +08:00
|
|
|
static int
|
2023-03-01 17:54:00 +08:00
|
|
|
rangematch(const wint_t *pattern, wint_t *test, int flags, wint_t **newp,
|
2015-11-19 03:51:12 +08:00
|
|
|
mbstate_t *patmbs)
|
2002-01-17 18:39:37 +08:00
|
|
|
{
|
|
|
|
int negate, ok;
|
2023-03-01 17:54:00 +08:00
|
|
|
wint_t *c, *c2;
|
|
|
|
//size_t pclen;
|
|
|
|
const wint_t *origpat;
|
|
|
|
size_t tlen = next_unicode_char (test);
|
2002-01-17 18:39:37 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* A bracket expression starting with an unquoted circumflex
|
|
|
|
* character produces unspecified results (IEEE 1003.2-1992,
|
|
|
|
* 3.13.2). This implementation treats it like '!', for
|
|
|
|
* consistency with the regular expression syntax.
|
|
|
|
* J.T. Conklin (conklin@ngai.kaleida.com)
|
|
|
|
*/
|
2010-01-16 23:11:56 +08:00
|
|
|
if ( (negate = (*pattern == '!' || *pattern == '^')) )
|
2002-01-17 18:39:37 +08:00
|
|
|
++pattern;
|
|
|
|
|
2023-03-01 17:54:00 +08:00
|
|
|
if (flags & FNM_CASEFOLD) {
|
|
|
|
for (int idx = 0; idx < tlen; ++idx)
|
|
|
|
test[idx] = towlower(test[idx]);
|
|
|
|
}
|
2002-01-17 18:39:37 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* A right bracket shall lose its special meaning and represent
|
|
|
|
* itself in a bracket expression if it occurs first in the list.
|
|
|
|
* -- POSIX.2 2.8.3.2
|
|
|
|
*/
|
|
|
|
ok = 0;
|
2010-01-16 23:11:56 +08:00
|
|
|
origpat = pattern;
|
|
|
|
for (;;) {
|
2023-03-01 17:54:00 +08:00
|
|
|
wint_t wclass[64], wclass2[64];
|
|
|
|
char cclass[64];
|
|
|
|
wint_t ctype;
|
|
|
|
size_t clen = 1, c2len = 1;
|
|
|
|
|
2010-01-16 23:11:56 +08:00
|
|
|
if (*pattern == ']' && pattern > origpat) {
|
|
|
|
pattern++;
|
|
|
|
break;
|
|
|
|
} else if (*pattern == '\0') {
|
2002-01-17 18:39:37 +08:00
|
|
|
return (RANGE_ERROR);
|
2010-01-16 23:11:56 +08:00
|
|
|
} else if (*pattern == '/' && (flags & FNM_PATHNAME)) {
|
|
|
|
return (RANGE_NOMATCH);
|
|
|
|
} else if (*pattern == '\\' && !(flags & FNM_NOESCAPE))
|
|
|
|
pattern++;
|
2023-03-01 17:54:00 +08:00
|
|
|
switch (ctype = check_classes_expr (&pattern, wclass, 64)) {
|
|
|
|
case ':':
|
|
|
|
/* No worries, char classes are ASCII-only */
|
|
|
|
wcitoascii (cclass, wclass);
|
|
|
|
if (iswctype (*test, wctype (cclass)))
|
|
|
|
ok = 1;
|
2023-02-15 03:22:54 +08:00
|
|
|
continue;
|
2023-03-01 17:54:00 +08:00
|
|
|
case '=':
|
|
|
|
if (wcilen (wclass) == 1 &&
|
|
|
|
is_unicode_equiv (*test, *wclass))
|
|
|
|
ok = 1;
|
|
|
|
continue;
|
|
|
|
case '.':
|
|
|
|
if (!is_unicode_coll_elem (wclass))
|
|
|
|
return (RANGE_NOMATCH);
|
|
|
|
c = wclass;
|
|
|
|
clen = wcilen (wclass);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
c = (wint_t *) pattern++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (flags & FNM_CASEFOLD) {
|
|
|
|
for (int idx = 0; idx < tlen; ++idx)
|
|
|
|
c[idx] = towlower(c[idx]);
|
2023-02-15 03:22:54 +08:00
|
|
|
}
|
2010-01-16 23:11:56 +08:00
|
|
|
|
|
|
|
if (*pattern == '-' && *(pattern + 1) != EOS &&
|
|
|
|
*(pattern + 1) != ']') {
|
|
|
|
if (*++pattern == '\\' && !(flags & FNM_NOESCAPE))
|
|
|
|
if (*pattern != EOS)
|
|
|
|
pattern++;
|
2023-03-01 17:54:00 +08:00
|
|
|
const wint_t *orig_pattern = pattern;
|
|
|
|
switch (ctype = check_classes_expr (&pattern, wclass2,
|
|
|
|
64)) {
|
|
|
|
case '.':
|
|
|
|
if (!is_unicode_coll_elem (wclass2))
|
|
|
|
return (RANGE_NOMATCH);
|
|
|
|
c2 = wclass2;
|
|
|
|
c2len = wcilen (wclass2);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
pattern = orig_pattern;
|
|
|
|
c2 = (wint_t *) pattern++;
|
|
|
|
}
|
|
|
|
if (*c2 == EOS)
|
2002-01-17 18:39:37 +08:00
|
|
|
return (RANGE_ERROR);
|
2010-01-16 23:11:56 +08:00
|
|
|
|
2023-03-01 17:54:00 +08:00
|
|
|
if (flags & FNM_CASEFOLD) {
|
|
|
|
for (int idx = 0; idx < tlen; ++idx)
|
|
|
|
c2[idx] = towlower(c2[idx]);
|
|
|
|
}
|
2010-01-16 23:11:56 +08:00
|
|
|
|
2023-02-24 23:37:44 +08:00
|
|
|
if ((!__get_current_collate_locale ()->win_locale[0]) ?
|
2023-07-28 03:57:49 +08:00
|
|
|
*c <= *test && *test <= *c2 :
|
2023-03-01 17:54:00 +08:00
|
|
|
__wscollate_range_cmp(c, test, clen, tlen) <= 0
|
|
|
|
&& __wscollate_range_cmp(test, c2, tlen, c2len) <= 0
|
2015-11-19 03:51:12 +08:00
|
|
|
)
|
2002-01-17 18:39:37 +08:00
|
|
|
ok = 1;
|
2023-03-01 17:54:00 +08:00
|
|
|
} else if (clen == tlen && wcincmp (c, test, clen) == 0)
|
2002-01-17 18:39:37 +08:00
|
|
|
ok = 1;
|
2010-01-16 23:11:56 +08:00
|
|
|
}
|
2002-01-17 18:39:37 +08:00
|
|
|
|
2023-03-01 17:54:00 +08:00
|
|
|
*newp = (wint_t *) pattern;
|
|
|
|
return (ok == negate ? RANGE_NOMATCH : tlen);
|
2002-01-17 18:39:37 +08:00
|
|
|
}
|