This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: [Patch, PR 61061] Add state limit for regex NFA
- From: Jonathan Wakely <jwakely at redhat dot com>
- To: Maksymilian A <max at cert dot cx>
- Cc: timshen at google dot com, libstdc++ at gcc dot gnu dot org, paolo dot carlini at oracle dot com
- Date: Thu, 17 Jul 2014 10:34:04 +0100
- Subject: Re: [Patch, PR 61061] Add state limit for regex NFA
- Authentication-results: sourceware.org; auth=none
- References: <CABLZJbw193qGxH7nZYe3fegmH38sEwRBps0E6QDax21zGJPTJQ at mail dot gmail dot com>
On 16/07/14 21:46 +0200, Maksymilian A wrote:
Implementation based on vectors are good idea. It seems to me that this
does not solve all problems. I would like to ask about the
regex_constants::error_type how it's implemented? From the safety point of
view the most important are error_space, error_stack and error_complexity.
In documentation I've found
error_complexity - the complexity of an attempted match against a regular
expression exceeded a pre-set level
How its implemented and where is exactly defined 'pre-set level'? Thanks
error_complexity is not used in our current implementation.