Security Advisories (1)
CVE-2026-15534 (2026-08-09)

Perl versions through 5.45.1 have out-of-bounds heap reads and writes during regular expression matching via an undersized superlinear cache in S_regmatch. The regex engine's superlinear cache holds one bit per subject position for each participating WHILEM node, so the bit count is the subject length plus one times the number of nodes. Nothing checks that product for positive overflow of the signed 32-bit count: a 286331153 byte subject matched against a pattern with 15 participating nodes stores the count as 14, leaving a two byte cache. The cache is then indexed from the real match position and node number, so reads go past the end of the allocation, and on failure CACHEsayNO sets a bit past it. A caller that matches an attacker controlled subject of this size against a pattern of this shape can crash the process or corrupt heap memory.

NAME

t/tml - run .tml files matching a pattern

SYNOPSIS

t/tml [prove options] [patterns]

USAGE

This program runs prove against a set of .tml files using their corresponding test bridge functions.

Any arguments beginning with - will be passed through to prove. All other arguments will be used as patterns to select .tml files found anywhere under the t directory. You can use shell globbing syntax, and let the shell expand the patterns, or you can quote/escape the patterns and let them be treated as Perl regular expressions.

For example:

t/tml unicode       # paths matching qr/unicode/
t/tml basic uni     # paths matching qr/basic/ or qr/uni/
t/tml 'local.*re'   # paths matching qr/local.*re/
t/tml '\d+'         # paths matching qr/\d+/

Examples of options for prove:

t/tml -v quoting    # verbose run of paths matching qr/quoting/
t/tml -j9 world     # parallel run of paths matching qr/world/
t/tml -j9           # parallel run of all .tml files