v8::internal::NegativeLookaheadChoiceNode Class Reference

#include <jsregexp.h>

Inheritance diagram for v8::internal::NegativeLookaheadChoiceNode:

Collaboration diagram for v8::internal::NegativeLookaheadChoiceNode:

Public Member Functions
	NegativeLookaheadChoiceNode (GuardedAlternative this_must_fail, GuardedAlternative then_do_this, Zone *zone)
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)
virtual bool	try_to_emit_quick_check_for_alternative (bool is_first)
virtual RegExpNode *	FilterOneByte (int depth, bool ignore_case)
Public Member Functions inherited from v8::internal::ChoiceNode
	ChoiceNode (int expected_size, Zone *zone)
virtual void	Accept (NodeVisitor *visitor)
void	AddAlternative (GuardedAlternative node)
ZoneList< GuardedAlternative > *	alternatives ()
DispatchTable *	GetTable (bool ignore_case)
virtual void	Emit (RegExpCompiler *compiler, Trace *trace)
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)
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)

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 1131 of file jsregexp.h.

Constructor & Destructor Documentation

NegativeLookaheadChoiceNode()

v8::internal::NegativeLookaheadChoiceNode::NegativeLookaheadChoiceNode ( GuardedAlternative  this_must_fail, GuardedAlternative  then_do_this, Zone *  zone  )

inlineexplicit

Definition at line 1133 of file jsregexp.h.

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

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

Here is the call graph for this function:

Member Function Documentation

EatsAtLeast()

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

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 2347 of file jsregexp.cc.

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

References v8::internal::RegExpNode::EatsAtLeast().

Here is the call graph for this function:

FillInBMInfo()

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

inlinevirtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 1145 of file jsregexp.h.

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

References v8::internal::ChoiceNode::alternatives_, v8::internal::ChoiceNode::not_at_start(), and v8::internal::RegExpNode::set_bm_info().

Here is the call graph for this function:

FilterOneByte()

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

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 2912 of file jsregexp.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_->at(1).node();
  RegExpNode* replacement = node->FilterOneByte(depth - 1, ignore_case);
  if (replacement == NULL) return set_replacement(NULL);
  alternatives_->at(1).set_node(replacement);
 
  RegExpNode* neg_node = alternatives_->at(0).node();
  RegExpNode* neg_replacement = neg_node->FilterOneByte(depth - 1, ignore_case);
  // If the negative lookahead is always going to fail then
  // we don't need to check it.
  if (neg_replacement == NULL) return set_replacement(replacement);
  alternatives_->at(0).set_node(neg_replacement);
  return set_replacement(this);
}

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

Here is the call graph for this function:

GetQuickCheckDetails()

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

virtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 2358 of file jsregexp.cc.

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

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

Here is the call graph for this function:

try_to_emit_quick_check_for_alternative()

virtual bool v8::internal::NegativeLookaheadChoiceNode::try_to_emit_quick_check_for_alternative ( bool  is_first )

inlinevirtual

Reimplemented from v8::internal::ChoiceNode.

Definition at line 1158 of file jsregexp.h.

                                                                      {
    return !is_first;
  }

---

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

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