#include <regexp.h>

Inheritance diagram for dart::ActionNode:

Public Types
enum	ActionType { SET_REGISTER , INCREMENT_REGISTER , STORE_POSITION , BEGIN_SUBMATCH , POSITIVE_SUBMATCH_SUCCESS , EMPTY_MATCH_CHECK , CLEAR_CAPTURES }

Public Member Functions
virtual void	Accept (NodeVisitor *visitor)

virtual void	Emit (RegExpCompiler compiler, Trace trace)

virtual intptr_t	EatsAtLeast (intptr_t still_to_find, intptr_t budget, bool not_at_start)

virtual void	GetQuickCheckDetails (QuickCheckDetails details, RegExpCompiler compiler, intptr_t filled_in, bool not_at_start)

virtual void	FillInBMInfo (intptr_t offset, intptr_t budget, BoyerMooreLookahead *bm, bool not_at_start)

ActionType	action_type ()

virtual intptr_t	GreedyLoopTextLength ()

Public Member Functions inherited from dart::SeqRegExpNode
	SeqRegExpNode (RegExpNode *on_success)

RegExpNode *	on_success ()

void	set_on_success (RegExpNode *node)

virtual RegExpNode *	FilterOneByte (intptr_t depth)

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 ()

virtual void	Accept (NodeVisitor *visitor)=0

virtual void	Emit (RegExpCompiler compiler, Trace trace)=0

virtual intptr_t	EatsAtLeast (intptr_t still_to_find, intptr_t budget, bool not_at_start)=0

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 void	GetQuickCheckDetails (QuickCheckDetails details, RegExpCompiler compiler, intptr_t characters_filled_in, bool not_at_start)=0

virtual intptr_t	GreedyLoopTextLength ()

virtual RegExpNode *	GetSuccessorOfOmnivorousTextNode (RegExpCompiler *compiler)

virtual void	FillInBMInfo (intptr_t offset, intptr_t budget, BoyerMooreLookahead *bm, bool not_at_start)

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)

Static Public Member Functions
static ActionNode *	SetRegister (intptr_t reg, intptr_t val, RegExpNode *on_success)

static ActionNode *	IncrementRegister (intptr_t reg, RegExpNode *on_success)

static ActionNode *	StorePosition (intptr_t reg, bool is_capture, RegExpNode *on_success)

static ActionNode *	ClearCaptures (Interval range, RegExpNode *on_success)

static ActionNode *	BeginSubmatch (intptr_t stack_pointer_reg, intptr_t position_reg, RegExpNode *on_success)

static ActionNode *	PositiveSubmatchSuccess (intptr_t stack_pointer_reg, intptr_t restore_reg, intptr_t clear_capture_count, intptr_t clear_capture_from, RegExpNode *on_success)

static ActionNode *	EmptyMatchCheck (intptr_t start_register, intptr_t repetition_register, intptr_t repetition_limit, RegExpNode *on_success)

Friends
class	DotPrinter

Additional Inherited Members
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::SeqRegExpNode
RegExpNode *	FilterSuccessor (intptr_t depth)

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 562 of file regexp.h.

Member Enumeration Documentation

◆ ActionType

enum dart::ActionNode::ActionType

Enumerator
SET_REGISTER
INCREMENT_REGISTER
STORE_POSITION
BEGIN_SUBMATCH
POSITIVE_SUBMATCH_SUCCESS
EMPTY_MATCH_CHECK
CLEAR_CAPTURES

Definition at line 564 of file regexp.h.

                  {
    SET_REGISTER,
    INCREMENT_REGISTER,
    STORE_POSITION,
    BEGIN_SUBMATCH,
    POSITIVE_SUBMATCH_SUCCESS,
    EMPTY_MATCH_CHECK,
    CLEAR_CAPTURES
  };

Member Function Documentation

◆ Accept()

virtual void dart::ActionNode::Accept ( NodeVisitor * visitor )

virtual

Implements dart::RegExpNode.

◆ action_type()

ActionType dart::ActionNode::action_type ( )

inline

Definition at line 609 of file regexp.h.

609{ return action_type_; }

◆ BeginSubmatch()

ActionNode * dart::ActionNode::BeginSubmatch	(	intptr_t	stack_pointer_reg,
		intptr_t	position_reg,
		RegExpNode *	on_success
	)

static

Definition at line 792 of file regexp.cc.

                                                              {
  ActionNode* result =
      new (on_success->zone()) ActionNode(BEGIN_SUBMATCH, on_success);
  result->data_.u_submatch.stack_pointer_register = stack_reg;
  result->data_.u_submatch.current_position_register = position_reg;
  return result;
}

◆ ClearCaptures()

ActionNode * dart::ActionNode::ClearCaptures	(	Interval	range,
		RegExpNode *	on_success
	)

static

Definition at line 784 of file regexp.cc.

                                                                            {
  ActionNode* result =
      new (on_success->zone()) ActionNode(CLEAR_CAPTURES, on_success);
  result->data_.u_clear_captures.range_from = range.from();
  result->data_.u_clear_captures.range_to = range.to();
  return result;
}

◆ EatsAtLeast()

intptr_t dart::ActionNode::EatsAtLeast	(	intptr_t	still_to_find,
		intptr_t	budget,
		bool	not_at_start
	)

virtual

Implements dart::RegExpNode.

Definition at line 1473 of file regexp.cc.

                                                    {
  if (budget <= 0) return 0;
  if (action_type_ == POSITIVE_SUBMATCH_SUCCESS) return 0;  // Rewinds input!
  return on_success()->EatsAtLeast(still_to_find, budget - 1, not_at_start);
}

◆ Emit()

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

virtual

Implements dart::RegExpNode.

Definition at line 3407 of file regexp.cc.

                                                            {
  RegExpMacroAssembler* assembler = compiler->macro_assembler();
  LimitResult limit_result = LimitVersions(compiler, trace);
  if (limit_result == DONE) return;
  ASSERT(limit_result == CONTINUE);
 
  RecursionCheck rc(compiler);
 
  switch (action_type_) {
    case STORE_POSITION: {
      Trace::DeferredCapture new_capture(data_.u_position_register.reg,
                                         data_.u_position_register.is_capture,
                                         trace);
      Trace new_trace = *trace;
      new_trace.add_action(&new_capture);
      on_success()->Emit(compiler, &new_trace);
      break;
    }
    case INCREMENT_REGISTER: {
      Trace::DeferredIncrementRegister new_increment(
          data_.u_increment_register.reg);
      Trace new_trace = *trace;
      new_trace.add_action(&new_increment);
      on_success()->Emit(compiler, &new_trace);
      break;
    }
    case SET_REGISTER: {
      Trace::DeferredSetRegister new_set(data_.u_store_register.reg,
                                         data_.u_store_register.value);
      Trace new_trace = *trace;
      new_trace.add_action(&new_set);
      on_success()->Emit(compiler, &new_trace);
      break;
    }
    case CLEAR_CAPTURES: {
      Trace::DeferredClearCaptures new_capture(Interval(
          data_.u_clear_captures.range_from, data_.u_clear_captures.range_to));
      Trace new_trace = *trace;
      new_trace.add_action(&new_capture);
      on_success()->Emit(compiler, &new_trace);
      break;
    }
    case BEGIN_SUBMATCH:
      if (!trace->is_trivial()) {
        trace->Flush(compiler, this);
      } else {
        assembler->WriteCurrentPositionToRegister(
            data_.u_submatch.current_position_register, 0);
        assembler->WriteStackPointerToRegister(
            data_.u_submatch.stack_pointer_register);
        on_success()->Emit(compiler, trace);
      }
      break;
    case EMPTY_MATCH_CHECK: {
      intptr_t start_pos_reg = data_.u_empty_match_check.start_register;
      intptr_t stored_pos = 0;
      intptr_t rep_reg = data_.u_empty_match_check.repetition_register;
      bool has_minimum = (rep_reg != RegExpCompiler::kNoRegister);
      bool know_dist = trace->GetStoredPosition(start_pos_reg, &stored_pos);
      if (know_dist && !has_minimum && stored_pos == trace->cp_offset()) {
        // If we know we haven't advanced and there is no minimum we
        // can just backtrack immediately.
        assembler->GoTo(trace->backtrack());
      } else if (know_dist && stored_pos < trace->cp_offset()) {
        // If we know we've advanced we can generate the continuation
        // immediately.
        on_success()->Emit(compiler, trace);
      } else if (!trace->is_trivial()) {
        trace->Flush(compiler, this);
      } else {
        BlockLabel skip_empty_check;
        // If we have a minimum number of repetitions we check the current
        // number first and skip the empty check if it's not enough.
        if (has_minimum) {
          intptr_t limit = data_.u_empty_match_check.repetition_limit;
          assembler->IfRegisterLT(rep_reg, limit, &skip_empty_check);
        }
        // If the match is empty we bail out, otherwise we fall through
        // to the on-success continuation.
        assembler->IfRegisterEqPos(data_.u_empty_match_check.start_register,
                                   trace->backtrack());
        assembler->BindBlock(&skip_empty_check);
        on_success()->Emit(compiler, trace);
      }
      break;
    }
    case POSITIVE_SUBMATCH_SUCCESS: {
      if (!trace->is_trivial()) {
        trace->Flush(compiler, this);
        return;
      }
      assembler->ReadCurrentPositionFromRegister(
          data_.u_submatch.current_position_register);
      assembler->ReadStackPointerFromRegister(
          data_.u_submatch.stack_pointer_register);
      intptr_t clear_register_count = data_.u_submatch.clear_register_count;
      if (clear_register_count == 0) {
        on_success()->Emit(compiler, trace);
        return;
      }
      intptr_t clear_registers_from = data_.u_submatch.clear_register_from;
      BlockLabel clear_registers_backtrack;
      Trace new_trace = *trace;
      new_trace.set_backtrack(&clear_registers_backtrack);
      on_success()->Emit(compiler, &new_trace);
 
      assembler->BindBlock(&clear_registers_backtrack);
      intptr_t clear_registers_to =
          clear_registers_from + clear_register_count - 1;
      assembler->ClearRegisters(clear_registers_from, clear_registers_to);
 
      ASSERT(trace->backtrack() == nullptr);
      assembler->Backtrack();
      return;
    }
    default:
      UNREACHABLE();
  }
}

◆ EmptyMatchCheck()

ActionNode * dart::ActionNode::EmptyMatchCheck	(	intptr_t	start_register,
		intptr_t	repetition_register,
		intptr_t	repetition_limit,
		RegExpNode *	on_success
	)

static

Definition at line 816 of file regexp.cc.

                                                                {
  ActionNode* result =
      new (on_success->zone()) ActionNode(EMPTY_MATCH_CHECK, on_success);
  result->data_.u_empty_match_check.start_register = start_register;
  result->data_.u_empty_match_check.repetition_register = repetition_register;
  result->data_.u_empty_match_check.repetition_limit = repetition_limit;
  return result;
}

◆ FillInBMInfo()

void dart::ActionNode::FillInBMInfo	(	intptr_t	offset,
		intptr_t	budget,
		BoyerMooreLookahead *	bm,
		bool	not_at_start
	)

virtual

Reimplemented from dart::SeqRegExpNode.

Definition at line 1481 of file regexp.cc.

                                                 {
  if (action_type_ == BEGIN_SUBMATCH) {
    bm->SetRest(offset);
  } else if (action_type_ != POSITIVE_SUBMATCH_SUCCESS) {
    on_success()->FillInBMInfo(offset, budget - 1, bm, not_at_start);
  }
  SaveBMInfo(bm, not_at_start, offset);
}

◆ GetQuickCheckDetails()

virtual void dart::ActionNode::GetQuickCheckDetails	(	QuickCheckDetails *	details,
		RegExpCompiler *	compiler,
		intptr_t	filled_in,
		bool	not_at_start
	)

inlinevirtual

Implements dart::RegExpNode.

Definition at line 598 of file regexp.h.

                                                       {
    return on_success()->GetQuickCheckDetails(details, compiler, filled_in,
                                              not_at_start);
  }

◆ GreedyLoopTextLength()

virtual intptr_t dart::ActionNode::GreedyLoopTextLength ( )

inlinevirtual

Reimplemented from dart::RegExpNode.

Definition at line 611 of file regexp.h.

                                          {
    return kNodeIsTooComplexForGreedyLoops;
  }

◆ IncrementRegister()

ActionNode * dart::ActionNode::IncrementRegister	(	intptr_t	reg,
		RegExpNode *	on_success
	)

static

Definition at line 766 of file regexp.cc.

                                                                  {
  ActionNode* result =
      new (on_success->zone()) ActionNode(INCREMENT_REGISTER, on_success);
  result->data_.u_increment_register.reg = reg;
  return result;
}

◆ PositiveSubmatchSuccess()

ActionNode * dart::ActionNode::PositiveSubmatchSuccess	(	intptr_t	stack_pointer_reg,
		intptr_t	restore_reg,
		intptr_t	clear_capture_count,
		intptr_t	clear_capture_from,
		RegExpNode *	on_success
	)

static

Definition at line 802 of file regexp.cc.

                                                                        {
  ActionNode* result = new (on_success->zone())
      ActionNode(POSITIVE_SUBMATCH_SUCCESS, on_success);
  result->data_.u_submatch.stack_pointer_register = stack_reg;
  result->data_.u_submatch.current_position_register = position_reg;
  result->data_.u_submatch.clear_register_count = clear_register_count;
  result->data_.u_submatch.clear_register_from = clear_register_from;
  return result;
}

◆ SetRegister()

ActionNode * dart::ActionNode::SetRegister	(	intptr_t	reg,
		intptr_t	val,
		RegExpNode *	on_success
	)

static

Definition at line 756 of file regexp.cc.

                                                            {
  ActionNode* result =
      new (on_success->zone()) ActionNode(SET_REGISTER, on_success);
  result->data_.u_store_register.reg = reg;
  result->data_.u_store_register.value = val;
  return result;
}

◆ StorePosition()

ActionNode * dart::ActionNode::StorePosition	(	intptr_t	reg,
		bool	is_capture,
		RegExpNode *	on_success
	)

static

Definition at line 774 of file regexp.cc.

                                                              {
  ActionNode* result =
      new (on_success->zone()) ActionNode(STORE_POSITION, on_success);
  result->data_.u_position_register.reg = reg;
  result->data_.u_position_register.is_capture = is_capture;
  return result;
}

Friends And Related Function Documentation

◆ DotPrinter

friend class DotPrinter

friend

Definition at line 647 of file regexp.h.

Member Data Documentation

◆ clear_register_count

intptr_t dart::ActionNode::clear_register_count

Definition at line 631 of file regexp.h.

◆ clear_register_from

intptr_t dart::ActionNode::clear_register_from

Definition at line 632 of file regexp.h.

◆ current_position_register

intptr_t dart::ActionNode::current_position_register

Definition at line 630 of file regexp.h.

◆ is_capture

bool dart::ActionNode::is_capture

Definition at line 626 of file regexp.h.

◆ range_from

intptr_t dart::ActionNode::range_from

Definition at line 640 of file regexp.h.

◆ range_to

intptr_t dart::ActionNode::range_to

Definition at line 641 of file regexp.h.

◆ reg

intptr_t dart::ActionNode::reg

Definition at line 618 of file regexp.h.

◆ repetition_limit

intptr_t dart::ActionNode::repetition_limit

Definition at line 637 of file regexp.h.

◆ repetition_register

intptr_t dart::ActionNode::repetition_register

Definition at line 636 of file regexp.h.

◆ stack_pointer_register

intptr_t dart::ActionNode::stack_pointer_register

Definition at line 629 of file regexp.h.

◆ start_register

intptr_t dart::ActionNode::start_register

Definition at line 635 of file regexp.h.

◆

struct { ... } dart::ActionNode::u_clear_captures

◆

struct { ... } dart::ActionNode::u_empty_match_check

◆

struct { ... } dart::ActionNode::u_increment_register

◆

struct { ... } dart::ActionNode::u_position_register

◆

struct { ... } dart::ActionNode::u_store_register

◆

struct { ... } dart::ActionNode::u_submatch

◆ value

intptr_t dart::ActionNode::value

Definition at line 619 of file regexp.h.

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

Public Types

Public Member Functions

Static Public Member Functions

Friends

Additional Inherited Members

Detailed Description

Member Enumeration Documentation

◆ ActionType

Member Function Documentation

◆ Accept()

◆ action_type()

◆ BeginSubmatch()

◆ ClearCaptures()

◆ EatsAtLeast()

◆ Emit()

◆ EmptyMatchCheck()

◆ FillInBMInfo()

◆ GetQuickCheckDetails()

◆ GreedyLoopTextLength()

◆ IncrementRegister()

◆ PositiveSubmatchSuccess()

◆ SetRegister()

◆ StorePosition()

Friends And Related Function Documentation

◆ DotPrinter

Member Data Documentation

◆ clear_register_count

◆ clear_register_from

◆ current_position_register

◆ is_capture

◆ range_from

◆ range_to

◆ reg

◆ repetition_limit

◆ repetition_register

◆ stack_pointer_register

◆ start_register

◆

◆

◆

◆

◆

◆

◆ value