#include <jsregexp.h>

Inheritance diagram for ActionNode:

Collaboration diagram for ActionNode:

Public Types
enum	Type { 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 int	EatsAtLeast (int still_to_find, int recursion_depth, bool not_at_start)

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

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

Type	type ()

virtual int	GreedyLoopTextLength ()

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

RegExpNode *	on_success ()

void	set_on_success (RegExpNode *node)

virtual RegExpNode *	FilterASCII (int depth)

Public Member Functions inherited from RegExpNode
	RegExpNode (Zone *zone)

virtual	~RegExpNode ()

bool	EmitQuickCheck (RegExpCompiler compiler, Trace trace, bool preload_has_checked_bounds, Label on_possible_success, QuickCheckDetails details_return, bool fall_through_on_failure)

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 ZoneObject
	INLINE (void operator new(size_t size, Zone zone))

void	operator delete (void *, size_t)

void	operator delete (void pointer, Zone zone)

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

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

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

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

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

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

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

Friends
class	DotPrinter

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

static const int	kFillInBMBudget = 200

static const int	kMaxCopiesCodeGenerated = 10

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

Protected Member Functions inherited from SeqRegExpNode
RegExpNode *	FilterSuccessor (int depth)

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

void	set_bm_info (bool not_at_start, BoyerMooreLookahead *bm)

Protected Attributes inherited from RegExpNode
RegExpNode *	replacement_

Detailed Description

Definition at line 745 of file jsregexp.h.

Member Enumeration Documentation

enum Type

Enumerator
SET_REGISTER
INCREMENT_REGISTER
STORE_POSITION
BEGIN_SUBMATCH
POSITIVE_SUBMATCH_SUCCESS
EMPTY_MATCH_CHECK
CLEAR_CAPTURES

Definition at line 747 of file jsregexp.h.

Member Function Documentation

virtual void Accept ( NodeVisitor * visitor )

virtual

Implements RegExpNode.

ActionNode * BeginSubmatch	(	int	stack_pointer_reg,
		int	position_reg,
		RegExpNode *	on_success
	)

static

Definition at line 1594 of file jsregexp.cc.

References ActionNode::u_submatch, and RegExpNode::zone().

Referenced by RegExpAssertion::ToNode(), and RegExpLookahead::ToNode().

ActionNode * ClearCaptures	(	Interval	range,
		RegExpNode *	on_success
	)

static

Definition at line 1584 of file jsregexp.cc.

References Interval::from(), Interval::to(), ActionNode::u_clear_captures, and RegExpNode::zone().

Referenced by RegExpQuantifier::ToNode().

int EatsAtLeast	(	int	still_to_find,
		int	recursion_depth,
		bool	not_at_start
	)

virtual

Implements RegExpNode.

Definition at line 2361 of file jsregexp.cc.

References RegExpCompiler::kMaxRecursion.

void Emit	(	RegExpCompiler *	compiler,
		Trace *	trace
	)

virtual

Implements RegExpNode.

Definition at line 4224 of file jsregexp.cc.

ActionNode * EmptyMatchCheck	(	int	start_register,
		int	repetition_register,
		int	repetition_limit,
		RegExpNode *	on_success
	)

static

Definition at line 1620 of file jsregexp.cc.

References ActionNode::u_empty_match_check, and RegExpNode::zone().

Referenced by RegExpQuantifier::ToNode().

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

virtual

Reimplemented from SeqRegExpNode.

Definition at line 2372 of file jsregexp.cc.

References BoyerMooreLookahead::SetRest().

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

inlinevirtual

Implements RegExpNode.

Definition at line 779 of file jsregexp.h.

References RegExpNode::GetQuickCheckDetails(), and SeqRegExpNode::on_success().

virtual int GreedyLoopTextLength ( )

inlinevirtual

Reimplemented from RegExpNode.

Definition at line 793 of file jsregexp.h.

References RegExpNode::kNodeIsTooComplexForGreedyLoops.

ActionNode * IncrementRegister	(	int	reg,
		RegExpNode *	on_success
	)

static

Definition at line 1565 of file jsregexp.cc.

References ActionNode::u_increment_register, and RegExpNode::zone().

Referenced by RegExpQuantifier::ToNode().

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