dart::NegativeLookaroundChoiceNode Class Reference

#include <regexp.h>

Inheritance diagram for dart::NegativeLookaroundChoiceNode:

Public Member Functions
	NegativeLookaroundChoiceNode (GuardedAlternative this_must_fail, GuardedAlternative then_do_this, Zone *zone)
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)
virtual bool	try_to_emit_quick_check_for_alternative (bool is_first)
virtual RegExpNode *	FilterOneByte (intptr_t depth)
Public Member Functions inherited from dart::ChoiceNode
	ChoiceNode (intptr_t expected_size, Zone *zone)
virtual void	Accept (NodeVisitor *visitor)
void	AddAlternative (GuardedAlternative node)
ZoneGrowableArray< GuardedAlternative > *	alternatives ()
virtual void	Emit (RegExpCompiler *compiler, Trace *trace)
virtual intptr_t	EatsAtLeast (intptr_t still_to_find, intptr_t budget, bool not_at_start)
intptr_t	EatsAtLeastHelper (intptr_t still_to_find, intptr_t budget, RegExpNode *ignore_this_node, 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)
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)
virtual RegExpNode *	FilterOneByte (intptr_t depth)
virtual bool	read_backward ()
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)

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

Constructor & Destructor Documentation

NegativeLookaroundChoiceNode()

dart::NegativeLookaroundChoiceNode::NegativeLookaroundChoiceNode ( GuardedAlternative  this_must_fail, GuardedAlternative  then_do_this, Zone *  zone  )

inlineexplicit

Definition at line 977 of file regexp.h.

      : ChoiceNode(2, zone) {
    AddAlternative(this_must_fail);
    AddAlternative(then_do_this);
  }

Member Function Documentation

EatsAtLeast()

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

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 1536 of file regexp.cc.

                                                                      {
  if (budget <= 0) return 0;
  // Alternative 0 is the negative lookahead, alternative 1 is what comes
  // afterwards.
  RegExpNode* node = (*alternatives_)[1].node();
  return node->EatsAtLeast(still_to_find, budget - 1, not_at_start);
}

FillInBMInfo()

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

inlinevirtual

Reimplemented from dart::ChoiceNode.

Definition at line 991 of file regexp.h.

                                               {
    (*alternatives_)[1].node()->FillInBMInfo(offset, budget - 1, bm,
                                             not_at_start);
    if (offset == 0) set_bm_info(not_at_start, bm);
  }

FilterOneByte()

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

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 2099 of file regexp.cc.

                                                                      {
  if (info()->replacement_calculated) return replacement();
  if (depth < 0) return this;
  if (info()->visited) return this;
  VisitMarker marker(info());
  // Alternative 0 is the negative lookahead, alternative 1 is what comes
  // afterwards.
  RegExpNode* node = (*alternatives_)[1].node();
  RegExpNode* replacement = node->FilterOneByte(depth - 1);
  if (replacement == nullptr) return set_replacement(nullptr);
  (*alternatives_)[1].set_node(replacement);
 
  RegExpNode* neg_node = (*alternatives_)[0].node();
  RegExpNode* neg_replacement = neg_node->FilterOneByte(depth - 1);
  // If the negative lookahead is always going to fail then
  // we don't need to check it.
  if (neg_replacement == nullptr) return set_replacement(replacement);
  (*alternatives_)[0].set_node(neg_replacement);
  return set_replacement(this);
}

GetQuickCheckDetails()

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

virtual

Reimplemented from dart::ChoiceNode.

Definition at line 1546 of file regexp.cc.

                       {
  // Alternative 0 is the negative lookahead, alternative 1 is what comes
  // afterwards.
  RegExpNode* node = (*alternatives_)[1].node();
  return node->GetQuickCheckDetails(details, compiler, filled_in, not_at_start);
}

try_to_emit_quick_check_for_alternative()

virtual bool dart::NegativeLookaroundChoiceNode::try_to_emit_quick_check_for_alternative ( bool  is_first )

inlinevirtual

Reimplemented from dart::ChoiceNode.

Definition at line 1004 of file regexp.h.

                                                                      {
    return !is_first;
  }

---

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