#include <jsregexp.h>

Inheritance diagram for v8::internal::LoopChoiceNode:

Collaboration diagram for v8::internal::LoopChoiceNode:

Public Member Functions
	LoopChoiceNode (bool body_can_be_zero_length, Zone *zone)

void	AddLoopAlternative (GuardedAlternative alt)

void	AddContinueAlternative (GuardedAlternative alt)

virtual void	Emit (RegExpCompiler compiler, Trace trace)

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

virtual void	GetQuickCheckDetails (QuickCheckDetails details, RegExpCompiler compiler, int characters_filled_in, bool not_at_start)

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

RegExpNode *	loop_node ()

RegExpNode *	continue_node ()

bool	body_can_be_zero_length ()

virtual void	Accept (NodeVisitor *visitor)

virtual RegExpNode *	FilterOneByte (int depth, bool ignore_case)

Public Member Functions inherited from v8::internal::ChoiceNode
	ChoiceNode (int expected_size, Zone *zone)

void	AddAlternative (GuardedAlternative node)

ZoneList< GuardedAlternative > *	alternatives ()

DispatchTable *	GetTable (bool ignore_case)

int	EatsAtLeastHelper (int still_to_find, int 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 v8::internal::RegExpNode
	RegExpNode (Zone *zone)

virtual	~RegExpNode ()

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)

virtual int	GreedyLoopTextLength ()

virtual RegExpNode *	GetSuccessorOfOmnivorousTextNode (RegExpCompiler *compiler)

RegExpNode *	replacement ()

RegExpNode *	set_replacement (RegExpNode *replacement)

void	SaveBMInfo (BoyerMooreLookahead *bm, bool not_at_start, int offset)

Label *	label ()

NodeInfo *	info ()

BoyerMooreLookahead *	bm_info (bool not_at_start)

Zone *	zone () const

Public Member Functions inherited from v8::internal::ZoneObject
	INLINE (void operator new(size_t size, Zone zone))

void	operator delete (void *, size_t)

void	operator delete (void pointer, Zone zone)

Private Member Functions
void	AddAlternative (GuardedAlternative node)

Private Attributes
RegExpNode *	loop_node_

RegExpNode *	continue_node_

bool	body_can_be_zero_length_

Additional Inherited Members
Static Public Attributes inherited from v8::internal::RegExpNode
static const int	kNodeIsTooComplexForGreedyLoops = -1

static const int	kRecursionBudget = 200

static const int	kMaxCopiesCodeGenerated = 10

Protected Types inherited from v8::internal::RegExpNode
enum	LimitResult { DONE , CONTINUE }

Protected Member Functions inherited from v8::internal::ChoiceNode
int	GreedyLoopTextLengthForAlternative (GuardedAlternative *alternative)

Protected Member Functions inherited from v8::internal::RegExpNode
LimitResult	LimitVersions (RegExpCompiler compiler, Trace trace)

void	set_bm_info (bool not_at_start, BoyerMooreLookahead *bm)

Protected Attributes inherited from v8::internal::ChoiceNode
ZoneList< GuardedAlternative > *	alternatives_

Protected Attributes inherited from v8::internal::RegExpNode
RegExpNode *	replacement_

Detailed Description

Definition at line 1165 of file jsregexp.h.

Constructor & Destructor Documentation

◆ LoopChoiceNode()

v8::internal::LoopChoiceNode::LoopChoiceNode	(	bool	body_can_be_zero_length,
		Zone *	zone
	)

inlineexplicit

Definition at line 1167 of file jsregexp.h.

       : ChoiceNode(2, zone),
         loop_node_(NULL),
         continue_node_(NULL),
         body_can_be_zero_length_(body_can_be_zero_length)
         { }

Member Function Documentation

◆ Accept()

void v8::internal::LoopChoiceNode::Accept ( NodeVisitor * visitor )

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 1559 of file jsregexp.cc.

                                                 {
   visitor->VisitLoopChoice(this);
 }

References v8::internal::NodeVisitor::VisitLoopChoice().

Here is the call graph for this function:

◆ AddAlternative()

void v8::internal::LoopChoiceNode::AddAlternative ( GuardedAlternative node )

inlineprivate

Definition at line 1195 of file jsregexp.h.

                                                {
     ChoiceNode::AddAlternative(node);
   }

References v8::internal::ChoiceNode::AddAlternative().

Here is the call graph for this function:

◆ AddContinueAlternative()

void v8::internal::LoopChoiceNode::AddContinueAlternative ( GuardedAlternative alt )

Definition at line 3476 of file jsregexp.cc.

                                                                   {
   DCHECK_EQ(continue_node_, NULL);
   AddAlternative(alt);
   continue_node_ = alt.node();
 }

References DCHECK_EQ, v8::internal::GuardedAlternative::node(), and NULL.

Here is the call graph for this function:

◆ AddLoopAlternative()

void v8::internal::LoopChoiceNode::AddLoopAlternative ( GuardedAlternative alt )

Definition at line 3469 of file jsregexp.cc.

                                                               {
   DCHECK_EQ(loop_node_, NULL);
   AddAlternative(alt);
   loop_node_ = alt.node();
 }

References DCHECK_EQ, v8::internal::GuardedAlternative::node(), and NULL.

Here is the call graph for this function:

◆ body_can_be_zero_length()

bool v8::internal::LoopChoiceNode::body_can_be_zero_length ( )

inline

Definition at line 1187 of file jsregexp.h.

1187 { return body_can_be_zero_length_; }

References body_can_be_zero_length_.

◆ continue_node()

RegExpNode* v8::internal::LoopChoiceNode::continue_node ( )

inline

Definition at line 1186 of file jsregexp.h.

1186 { return continue_node_; }

References continue_node_.

◆ EatsAtLeast()

int v8::internal::LoopChoiceNode::EatsAtLeast	(	int	still_to_find,
		int	budget,
		bool	not_at_start
	)

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 2390 of file jsregexp.cc.

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

◆ Emit()

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

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 3483 of file jsregexp.cc.

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

References v8::internal::RegExpMacroAssembler::AdvanceCurrentPosition(), v8::internal::Trace::cp_offset(), DCHECK, v8::internal::ChoiceNode::Emit(), v8::internal::Trace::Flush(), v8::internal::RegExpMacroAssembler::GoTo(), v8::internal::Trace::is_trivial(), v8::internal::Trace::loop_label(), v8::internal::RegExpCompiler::macro_assembler(), NULL, and v8::internal::Trace::stop_node().

Here is the call graph for this function:

◆ FillInBMInfo()

void v8::internal::LoopChoiceNode::FillInBMInfo	(	int	offset,
		int	budget,
		BoyerMooreLookahead *	bm,
		bool	not_at_start
	)

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 2948 of file jsregexp.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);
 }

References v8::internal::ChoiceNode::FillInBMInfo(), and v8::internal::BoyerMooreLookahead::SetRest().

Here is the call graph for this function:

◆ FilterOneByte()

RegExpNode * v8::internal::LoopChoiceNode::FilterOneByte	(	int	depth,
		bool	ignore_case
	)

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 2843 of file jsregexp.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, ignore_case);
     // If we can't continue after the loop then there is no sense in doing the
     // loop.
     if (continue_replacement == NULL) return set_replacement(NULL);
   }
  
   return ChoiceNode::FilterOneByte(depth - 1, ignore_case);
 }

References v8::internal::RegExpNode::FilterOneByte(), v8::internal::ChoiceNode::FilterOneByte(), and NULL.

Here is the call graph for this function:

◆ GetQuickCheckDetails()

void v8::internal::LoopChoiceNode::GetQuickCheckDetails	(	QuickCheckDetails *	details,
		RegExpCompiler *	compiler,
		int	characters_filled_in,
		bool	not_at_start
	)

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 2935 of file jsregexp.cc.

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

References v8::internal::ChoiceNode::GetQuickCheckDetails().

Here is the call graph for this function:

◆ loop_node()

RegExpNode* v8::internal::LoopChoiceNode::loop_node ( )

inline

Definition at line 1185 of file jsregexp.h.

1185 { return loop_node_; }

References loop_node_.

Referenced by v8::internal::Analysis::VisitLoopChoice().

Here is the caller graph for this function:

Member Data Documentation

◆ body_can_be_zero_length_

bool v8::internal::LoopChoiceNode::body_can_be_zero_length_

private

Definition at line 1201 of file jsregexp.h.

Referenced by body_can_be_zero_length().

◆ continue_node_

RegExpNode* v8::internal::LoopChoiceNode::continue_node_

private

Definition at line 1200 of file jsregexp.h.

Referenced by continue_node().

◆ loop_node_

RegExpNode* v8::internal::LoopChoiceNode::loop_node_

private

Definition at line 1199 of file jsregexp.h.

Referenced by loop_node().

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

/mnt/V8SourceCode/src/jsregexp.h
/mnt/V8SourceCode/src/jsregexp.cc

Public Member Functions

Private Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ LoopChoiceNode()

Member Function Documentation

◆ Accept()

◆ AddAlternative()

◆ AddContinueAlternative()

◆ AddLoopAlternative()

◆ body_can_be_zero_length()

◆ continue_node()

◆ EatsAtLeast()

◆ Emit()

◆ FillInBMInfo()

◆ FilterOneByte()

◆ GetQuickCheckDetails()

◆ loop_node()

Member Data Documentation

◆ body_can_be_zero_length_

◆ continue_node_

◆ loop_node_