|
| RegExpNode (Zone *zone) |
|
virtual void | Accept (NodeVisitor *visitor)=0 |
|
virtual void | Emit (RegExpCompiler *compiler, Trace *trace)=0 |
|
virtual int | EatsAtLeast (int still_to_find, int budget, bool not_at_start)=0 |
|
bool | EmitQuickCheck (RegExpCompiler *compiler, Trace *bounds_check_trace, Trace *trace, bool preload_has_checked_bounds, Label *on_possible_success, QuickCheckDetails *details_return, bool fall_through_on_failure) |
|
virtual void | GetQuickCheckDetails (QuickCheckDetails *details, RegExpCompiler *compiler, int characters_filled_in, bool not_at_start)=0 |
|
virtual int | GreedyLoopTextLength () |
|
virtual RegExpNode * | GetSuccessorOfOmnivorousTextNode (RegExpCompiler *compiler) |
|
bool | KeepRecursing (RegExpCompiler *compiler) |
|
virtual void | FillInBMInfo (Isolate *isolate, int offset, int budget, BoyerMooreLookahead *bm, bool not_at_start) |
|
virtual RegExpNode * | FilterOneByte (int depth) |
|
RegExpNode * | replacement () |
|
RegExpNode * | set_replacement (RegExpNode *replacement) |
|
void | SaveBMInfo (BoyerMooreLookahead *bm, bool not_at_start, int offset) |
|
Label * | label () |
|
bool | on_work_list () |
|
void | set_on_work_list (bool value) |
|
NodeInfo * | info () |
|
BoyerMooreLookahead * | bm_info (bool not_at_start) |
|
Zone * | zone () const |
|
void * | operator new (size_t size, Zone *zone) |
|
void | operator delete (void *, size_t) |
|
void | operator delete (void *pointer, Zone *zone) |
|
|
static const int | kNodeIsTooComplexForGreedyLoops = kMinInt |
|
static const int | kRecursionBudget = 200 |
|
static const int | kMaxCopiesCodeGenerated = 10 |
|
|
enum | LimitResult { DONE,
CONTINUE
} |
|
Definition at line 459 of file jsregexp.h.
The documentation for this class was generated from the following files: