#include <regexp-nodes.h>
|
| AssertionNode * | AsAssertionNode () override |
| |
| void | Accept (NodeVisitor *visitor) override |
| |
| void | Emit (RegExpCompiler *compiler, Trace *trace) override |
| |
| void | GetQuickCheckDetails (QuickCheckDetails *details, RegExpCompiler *compiler, int filled_in, bool not_at_start) override |
| |
| void | FillInBMInfo (Isolate *isolate, int offset, int budget, BoyerMooreLookahead *bm, bool not_at_start) override |
| |
| AssertionType | assertion_type () |
| |
| | SeqRegExpNode (RegExpNode *on_success) |
| |
| RegExpNode * | on_success () |
| |
| void | set_on_success (RegExpNode *node) |
| |
| RegExpNode * | FilterOneByte (int depth, RegExpCompiler *compiler) override |
| |
| void | FillInBMInfo (Isolate *isolate, int offset, int budget, BoyerMooreLookahead *bm, bool not_at_start) override |
| |
| SeqRegExpNode * | AsSeqRegExpNode () override |
| |
| | RegExpNode (Zone *zone) |
| |
| virtual | ~RegExpNode () |
| |
| uint32_t | EatsAtLeast (bool not_at_start) |
| |
| virtual EatsAtLeastInfo | EatsAtLeastFromLoopEntry () |
| |
| 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, ChoiceNode *predecessor) |
| |
| virtual void | GetQuickCheckDetailsFromLoopEntry (QuickCheckDetails *details, RegExpCompiler *compiler, int characters_filled_in, bool not_at_start) |
| |
| virtual int | GreedyLoopTextLength () |
| |
| virtual RegExpNode * | GetSuccessorOfOmnivorousTextNode (RegExpCompiler *compiler) |
| |
| bool | KeepRecursing (RegExpCompiler *compiler) |
| |
| 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 () |
| |
| const EatsAtLeastInfo * | eats_at_least_info () const |
| |
| void | set_eats_at_least_info (const EatsAtLeastInfo &eats_at_least) |
| |
| void | SetDoNotInline () |
| |
| BoyerMooreLookahead * | bm_info (bool not_at_start) |
| |
| Zone * | zone () const |
| |
| void * | operator new (size_t, Zone *)=delete |
| |
| void * | operator new (size_t size, void *ptr) |
| |
| void | operator delete (void *, size_t) |
| |
| void | operator delete (void *pointer, Zone *zone)=delete |
| |
Definition at line 485 of file regexp-nodes.h.
◆ AssertionType
| Enumerator |
|---|
| AT_END | |
| AT_START | |
| AT_BOUNDARY | |
| AT_NON_BOUNDARY | |
| AFTER_NEWLINE | |
Definition at line 487 of file regexp-nodes.h.
◆ IfPrevious
◆ AssertionNode()
◆ Accept()
| void v8::internal::AssertionNode::Accept |
( |
NodeVisitor * | visitor | ) |
|
|
overridevirtual |
◆ AfterNewline()
◆ AsAssertionNode()
◆ assertion_type()
◆ AtBoundary()
◆ AtEnd()
◆ AtNonBoundary()
◆ AtStart()
◆ BacktrackIfPrevious()
◆ Emit()
◆ EmitBoundaryCheck()
| void v8::internal::AssertionNode::EmitBoundaryCheck |
( |
RegExpCompiler * | compiler, |
|
|
Trace * | trace ) |
|
private |
◆ FillInBMInfo()
◆ GetQuickCheckDetails()
◆ assertion_type_
◆ Zone
| friend v8::internal::AssertionNode::Zone |
|
private |
The documentation for this class was generated from the following files: