GHSA-7r86-cg39-jmmj
HIGHCVE-2026-27903matchOne() performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent (GLOBSTAR) segments and the input path does not match. The time complexity is O(C(n, k)) -- binomial -- where n is the number of path segments and k is the number of globstars. With k=11 and n=30, a call to the default minimatch() API stalls for roughly 5 seconds. With k=13, it exceeds 15 secon
- Affected
- >= 10.0.0, < 10.2.3
- Fixed in
- 10.2.3
- Weakness
- CWE-407
- Published
- 2026-02-26
- Source
- github