| tag | 649a5a062a2786f9698772890953868b7ab7e0ad | |
|---|---|---|
| tagger | Paul Wankadia <junyer@google.com> | Sat Dec 31 13:00:00 2016 |
| object | 09fc9ce11a634150a22d2a477ff7ba8866398a7a |
release 2017-01-01
| commit | 09fc9ce11a634150a22d2a477ff7ba8866398a7a | [log] [tgz] |
|---|---|---|
| author | Paul Wankadia <junyer@google.com> | Tue Dec 13 11:11:22 2016 |
| committer | Paul Wankadia <junyer@google.com> | Tue Dec 13 11:22:01 2016 |
| tree | 15a425d198f941db026f28791060ff3094c87ca3 | |
| parent | 13fb267cf32c0b2a87ecf1bf72d89dec57ab0e36 [diff] |
Make SimplifyWalker::SimplifyRepeat() use Regexp::Concat(). This builds a two-level tree for very large numbers of subexpressions. When min is greater than 65535 due to coalescing, for example. This bug was discovered by the LLVM fuzzer. Change-Id: I7e21d24f6546b9d8f3a3d844e0ed5c6af246aa1e Reviewed-on: https://code-review.googlesource.com/9890 Reviewed-by: Paul Wankadia <junyer@google.com>