Andreas Kling c828c87408 LibRegex: Leave suffix minima for repeated simple loops ...

Repeated simple loops like "a+".repeat(100) compile to a chain of
greedy loop instructions. When one loop failed, the VM only knew how
to give back one character at a time unless the next instruction was a
literal char, so V8's regexp-fallback case ran into the backtrack
limit instead of finding the obvious match.

When a greedy simple loop is followed by more loops for the same
matcher, sum their minimum counts and backtrack far enough to leave the
missing suffix in one step. If that suffix is already available to the
right, still give back one character so the VM makes progress instead
of reusing the same greedy state forever.

The RegExp runtime test now covers the Chromium regexp-fallback case
through exec(), global exec(), and both replace() paths, plus bounded
same-matcher chains where the suffix minimum is partly missing or
already available.

2026-03-31 15:59:04 +02:00

..

src

LibRegex: Leave suffix minima for repeated simple loops

2026-03-31 15:59:04 +02:00

build.rs

Meta: Make Rust FFI headers reproducible

2026-03-31 15:59:04 +02:00

Cargo.toml

…

cbindgen.toml

…