Ruby
3.4.0dev (2024-11-22 revision 0989400a925cd201defdca9eb28eb87200b30785)
|
Ruby's regular expression. More...
#include <rregexp.h>
Data Fields | |
struct RBasic | basic |
Basic part, including flags and class. More... | |
struct re_pattern_buffer * | ptr |
The pattern buffer. More... | |
const VALUE | src |
Source code of this expression. More... | |
unsigned long | usecnt |
Reference count. More... | |
Ruby's regular expression.
A regexp is compiled into its own intermediate representation. This one holds that info. Regexp "match" operation then executes that IR.
struct RBasic RRegexp::basic |
struct re_pattern_buffer* RRegexp::ptr |
unsigned long RRegexp::usecnt |
Reference count.
A regexp match can take extraordinarily long time to run. Ruby's regular expression is heavily extended and not a regular language any longer; runs in NP-time in practice. Now, Ruby also has threads and GVL. In order to prevent long GVL lockup, our regexp engine can release it on occasions. This means that multiple threads can touch a regular expressions at once. That itself is okay. But their cleanup phase shall wait for all the concurrent runs, to prevent use-after-free situation. This field is used to count such threads that are executing this particular pattern buffer.