dart::NegativeSubmatchSuccess Class Reference

#include <regexp.h>

Inheritance diagram for dart::NegativeSubmatchSuccess:

Public Member Functions
	NegativeSubmatchSuccess (intptr_t stack_pointer_reg, intptr_t position_reg, intptr_t clear_capture_count, intptr_t clear_capture_start, Zone *zone)
virtual void	Emit (RegExpCompiler *compiler, Trace *trace)
Public Member Functions inherited from dart::EndNode
	EndNode (Action action, Zone *zone)
virtual void	Accept (NodeVisitor *visitor)
virtual intptr_t	EatsAtLeast (intptr_t still_to_find, intptr_t recursion_depth, bool not_at_start)
virtual void	GetQuickCheckDetails (QuickCheckDetails *details, RegExpCompiler *compiler, intptr_t characters_filled_in, bool not_at_start)
virtual void	FillInBMInfo (intptr_t offset, intptr_t budget, BoyerMooreLookahead *bm, bool not_at_start)
Public Member Functions inherited from dart::RegExpNode
	RegExpNode (Zone *zone)
virtual	~RegExpNode ()
bool	EmitQuickCheck (RegExpCompiler *compiler, Trace *bounds_check_trace, Trace *trace, bool preload_has_checked_bounds, BlockLabel *on_possible_success, QuickCheckDetails *details_return, bool fall_through_on_failure)
virtual intptr_t	GreedyLoopTextLength ()
virtual RegExpNode *	GetSuccessorOfOmnivorousTextNode (RegExpCompiler *compiler)
virtual RegExpNode *	FilterOneByte (intptr_t depth)
RegExpNode *	replacement ()
RegExpNode *	set_replacement (RegExpNode *replacement)
void	SaveBMInfo (BoyerMooreLookahead *bm, bool not_at_start, intptr_t offset)
BlockLabel *	label ()
NodeInfo *	info ()
BoyerMooreLookahead *	bm_info (bool not_at_start)
Zone *	zone () const
Public Member Functions inherited from dart::ZoneAllocated
	ZoneAllocated ()
void *	operator new (size_t size)
void *	operator new (size_t size, Zone *zone)
void	operator delete (void *pointer)

Additional Inherited Members
Public Types inherited from dart::EndNode
enum	Action { ACCEPT , BACKTRACK , NEGATIVE_SUBMATCH_SUCCESS }
Static Public Attributes inherited from dart::RegExpNode
static constexpr intptr_t	kNodeIsTooComplexForGreedyLoops = -1
static constexpr intptr_t	kRecursionBudget = 200
static constexpr intptr_t	kMaxCopiesCodeGenerated = 10
Protected Types inherited from dart::RegExpNode
enum	LimitResult { DONE , CONTINUE }
Protected Member Functions inherited from dart::RegExpNode
LimitResult	LimitVersions (RegExpCompiler *compiler, Trace *trace)
void	set_bm_info (bool not_at_start, BoyerMooreLookahead *bm)
Protected Attributes inherited from dart::RegExpNode
RegExpNode *	replacement_

Detailed Description

Definition at line 840 of file regexp.h.

Constructor & Destructor Documentation

NegativeSubmatchSuccess()

dart::NegativeSubmatchSuccess::NegativeSubmatchSuccess ( intptr_t  stack_pointer_reg, intptr_t  position_reg, intptr_t  clear_capture_count, intptr_t  clear_capture_start, Zone *  zone  )

inline

Definition at line 842 of file regexp.h.

      : EndNode(NEGATIVE_SUBMATCH_SUCCESS, zone),
        stack_pointer_register_(stack_pointer_reg),
        current_position_register_(position_reg),
        clear_capture_count_(clear_capture_count),
        clear_capture_start_(clear_capture_start) {}

Member Function Documentation

Emit()

void dart::NegativeSubmatchSuccess::Emit ( RegExpCompiler *  compiler, Trace *  trace  )

virtual

Reimplemented from dart::EndNode.

Definition at line 702 of file regexp.cc.

                                                                         {
  RegExpMacroAssembler* assembler = compiler->macro_assembler();
 
  // Omit flushing the trace. We discard the entire stack frame anyway.
 
  if (!label()->is_bound()) {
    // We are completely independent of the trace, since we ignore it,
    // so this code can be used as the generic version.
    assembler->BindBlock(label());
  }
 
  // Throw away everything on the backtrack stack since the start
  // of the negative submatch and restore the character position.
  assembler->ReadCurrentPositionFromRegister(current_position_register_);
  assembler->ReadStackPointerFromRegister(stack_pointer_register_);
  if (clear_capture_count_ > 0) {
    // Clear any captures that might have been performed during the success
    // of the body of the negative look-ahead.
    int clear_capture_end = clear_capture_start_ + clear_capture_count_ - 1;
    assembler->ClearRegisters(clear_capture_start_, clear_capture_end);
  }
  // Now that we have unwound the stack we find at the top of the stack the
  // backtrack that the BeginSubmatch node got.
  assembler->Backtrack();
}

---

The documentation for this class was generated from the following files:

• third_party/dart-lang/sdk/runtime/vm/regexp.h
• third_party/dart-lang/sdk/runtime/vm/regexp.cc