Improve time complexity of tokenization regex used in diffSentences #580
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The performance bug here was essentially the same as what I describe at https://markamery.com/blog/quadratic-time-regexes/; essentially, doing a regex search using a regex that starts with a pattern repeated with
+
or*
is by default a quadratic time operation, unless you put a lookbehind before it, which we weren't doing.While adding tests to check I wasn't breaking anything with this fix, I realised some existing behaviour was perverse, so settled on a fix that changed some of the perverse behaviour while also fixing the "ReDOS" issue (Snyk reported it via email as such).
(As with many "ReDOS" "vulns", I have conflicting & complicated thoughts on whether it's reasonable to consider this a security vulnerability in the first place, as Snyk do. That question of labeling doesn't change that it's bad and should be fixed, though.)