241eb37e29
Adapt glob's match() routine to use a greedy algorithm that avoids exponential runtime in byzantine inputs. While here, add a testcase for the byzantine input. Prompted by: https://research.swtch.com/glob Authored by: Yves Orton <demerphq at gmail.com> Obtained from: Perl (33252c318625f3c6c89b816ee88481940e3e6f95) Sponsored by: Dell EMC Isilon |
||
|---|---|---|
| .. | ||
| execve | ||
| posix_spawn | ||
| arc4random_test.c | ||
| dlopen_empty_test.c | ||
| fmtcheck_test.c | ||
| fmtmsg_test.c | ||
| fnmatch_test.c | ||
| fnmatch_testcases.h | ||
| fpclassify2_test.c | ||
| ftw_test.c | ||
| glob2_test.c | ||
| Makefile | ||
| Makefile.depend | ||
| popen_test.c | ||
| posix_spawn_test.c | ||
| test-fnmatch.c | ||
| wordexp_test.c | ||