1. NAME▲
glob_match - match a text string against a glob-style pattern
2. SYNOPSIS ▲
int glob_match(const char * text , const char * pattern );
3. ARGUMENTS ▲
text
the string to be examined
pattern
the glob-style pattern to be matched against
4. DESCRIPTION ▲
Either/both of text and pattern can be empty strings.
Match text against a glob-style pattern, with wildcards and simple sets:
? matches any single character. * matches any run of characters. [xyz] matches a single character from the set: x, y, or z. [a-d] matches a single character from the range: a, b, c, or d. [a-d0-9] matches a single character from either range.
The special characters ?, [, -, or *, can be matched using a set, eg. [*] Behaviour with malformed patterns is undefined, though generally reasonable.
5. SAMPLE PATTERNS ▲
"SD1?« , »SD1[0-5]« , »*R0« , »SD*1?[012]*xx"
This function uses one level of recursion per Aq*Aq in pattern. Since it calls _nothing_ else, and has _no_ explicit local variables, this will not cause stack problems for any reasonable use here.
6. RETURNS ▲
0 on match, 1 otherwise.
7. AUTHOR ▲
Jeff Garzik
Author.
8. COPYRIGHT ▲