dart::LoopChoiceNode Class Reference

#include <regexp.h>

Inheritance diagram for dart::LoopChoiceNode:

Public Member Functions
	LoopChoiceNode (bool body_can_be_zero_length, bool read_backward, Zone *zone)
void	AddLoopAlternative (GuardedAlternative alt)
void	AddContinueAlternative (GuardedAlternative alt)
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 characters_filled_in, bool not_at_start)
virtual void	FillInBMInfo (intptr_t offset, intptr_t budget, BoyerMooreLookahead *bm, bool not_at_start)
RegExpNode *	loop_node ()
RegExpNode *	continue_node ()
bool	body_can_be_zero_length ()
virtual bool	read_backward ()
virtual void	Accept (NodeVisitor *visitor)
virtual RegExpNode *	FilterOneByte (intptr_t depth)
Public Member Functions inherited from dart::ChoiceNode
	ChoiceNode (intptr_t expected_size, Zone *zone)
void	AddAlternative (GuardedAlternative node)
ZoneGrowableArray< GuardedAlternative > *	alternatives ()
intptr_t	EatsAtLeastHelper (intptr_t still_to_find, intptr_t budget, RegExpNode *ignore_this_node, bool not_at_start)
bool	being_calculated ()
bool	not_at_start ()
void	set_not_at_start ()
void	set_being_calculated (bool b)
virtual bool	try_to_emit_quick_check_for_alternative (bool is_first)
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)
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
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::ChoiceNode
intptr_t	GreedyLoopTextLengthForAlternative (const GuardedAlternative *alternative)
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::ChoiceNode
ZoneGrowableArray< GuardedAlternative > *	alternatives_
Protected Attributes inherited from dart::RegExpNode
RegExpNode *	replacement_

Detailed Description

Definition at line 1010 of file regexp.h.

Constructor & Destructor Documentation

LoopChoiceNode()

dart::LoopChoiceNode::LoopChoiceNode ( bool  body_can_be_zero_length, bool  read_backward, Zone *  zone  )

inlineexplicit

Definition at line 1012 of file regexp.h.

      : ChoiceNode(2, zone),
        loop_node_(nullptr),
        continue_node_(nullptr),
        body_can_be_zero_length_(body_can_be_zero_length),
        read_backward_(read_backward) {}

Member Function Documentation

Accept()

void dart::LoopChoiceNode::Accept ( NodeVisitor *  visitor )

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 835 of file regexp.cc.

                                                {
  visitor->VisitLoopChoice(this);
}

AddContinueAlternative()

void dart::LoopChoiceNode::AddContinueAlternative

(

GuardedAlternative

alt

)

Definition at line 2660 of file regexp.cc.

                                                                  {
  ASSERT(continue_node_ == nullptr);
  AddAlternative(alt);
  continue_node_ = alt.node();
}

AddLoopAlternative()

void dart::LoopChoiceNode::AddLoopAlternative

(

GuardedAlternative

alt

)

Definition at line 2654 of file regexp.cc.

                                                              {
  ASSERT(loop_node_ == nullptr);
  AddAlternative(alt);
  loop_node_ = alt.node();
}

body_can_be_zero_length()

bool dart::LoopChoiceNode::body_can_be_zero_length ( )

inline

Definition at line 1036 of file regexp.h.

{ return body_can_be_zero_length_; }

continue_node()

RegExpNode * dart::LoopChoiceNode::continue_node ( )

inline

Definition at line 1035 of file regexp.h.

{ return continue_node_; }

EatsAtLeast()

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

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 1576 of file regexp.cc.

                                                        {
  return EatsAtLeastHelper(still_to_find, budget - 1, loop_node_, not_at_start);
}

Emit()

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

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 2666 of file regexp.cc.

                                                                {
  RegExpMacroAssembler* macro_assembler = compiler->macro_assembler();
  if (trace->stop_node() == this) {
    // Back edge of greedy optimized loop node graph.
    intptr_t text_length =
        GreedyLoopTextLengthForAlternative(&alternatives_->At(0));
    ASSERT(text_length != kNodeIsTooComplexForGreedyLoops);
    // Update the counter-based backtracking info on the stack.  This is an
    // optimization for greedy loops (see below).
    ASSERT(trace->cp_offset() == text_length);
    macro_assembler->AdvanceCurrentPosition(text_length);
    macro_assembler->GoTo(trace->loop_label());
    return;
  }
  ASSERT(trace->stop_node() == nullptr);
  if (!trace->is_trivial()) {
    trace->Flush(compiler, this);
    return;
  }
  ChoiceNode::Emit(compiler, trace);
}

FillInBMInfo()

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

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 2130 of file regexp.cc.

                                                     {
  if (body_can_be_zero_length_ || budget <= 0) {
    bm->SetRest(offset);
    SaveBMInfo(bm, not_at_start, offset);
    return;
  }
  ChoiceNode::FillInBMInfo(offset, budget - 1, bm, not_at_start);
  SaveBMInfo(bm, not_at_start, offset);
}

FilterOneByte()

RegExpNode * dart::LoopChoiceNode::FilterOneByte ( intptr_t  depth )

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 2033 of file regexp.cc.

                                                        {
  if (info()->replacement_calculated) return replacement();
  if (depth < 0) return this;
  if (info()->visited) return this;
  {
    VisitMarker marker(info());
 
    RegExpNode* continue_replacement = continue_node_->FilterOneByte(depth - 1);
    // If we can't continue after the loop then there is no sense in doing the
    // loop.
    if (continue_replacement == nullptr) return set_replacement(nullptr);
  }
 
  return ChoiceNode::FilterOneByte(depth - 1);
}

GetQuickCheckDetails()

void dart::LoopChoiceNode::GetQuickCheckDetails ( QuickCheckDetails *  details, RegExpCompiler *  compiler, intptr_t  characters_filled_in, bool  not_at_start  )

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 2120 of file regexp.cc.

                                                             {
  if (body_can_be_zero_length_ || info()->visited) return;
  VisitMarker marker(info());
  return ChoiceNode::GetQuickCheckDetails(details, compiler,
                                          characters_filled_in, not_at_start);
}

loop_node()

RegExpNode * dart::LoopChoiceNode::loop_node ( )

inline

Definition at line 1034 of file regexp.h.

{ return loop_node_; }

read_backward()

virtual bool dart::LoopChoiceNode::read_backward ( )

inlinevirtual

Reimplemented from dart::ChoiceNode.

Definition at line 1037 of file regexp.h.

{ return read_backward_; }

---

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