v8::internal::RegExpNode Class Reference

#include <jsregexp.h>

Inheritance diagram for v8::internal::RegExpNode:

Collaboration diagram for v8::internal::RegExpNode:

Public Member Functions
	RegExpNode (Zone *zone)
virtual	~RegExpNode ()
virtual void	Accept (NodeVisitor *visitor)=0
virtual void	Emit (RegExpCompiler *compiler, Trace *trace)=0
virtual int	EatsAtLeast (int still_to_find, int budget, bool not_at_start)=0
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 void	GetQuickCheckDetails (QuickCheckDetails *details, RegExpCompiler *compiler, int characters_filled_in, bool not_at_start)=0
virtual int	GreedyLoopTextLength ()
virtual RegExpNode *	GetSuccessorOfOmnivorousTextNode (RegExpCompiler *compiler)
virtual void	FillInBMInfo (int offset, int budget, BoyerMooreLookahead *bm, bool not_at_start)
virtual RegExpNode *	FilterOneByte (int depth, bool ignore_case)
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)

Static Public Attributes
static const int	kNodeIsTooComplexForGreedyLoops = -1
static const int	kRecursionBudget = 200
static const int	kMaxCopiesCodeGenerated = 10

Protected Types
enum	LimitResult { DONE , CONTINUE }

Protected Member Functions
LimitResult	LimitVersions (RegExpCompiler *compiler, Trace *trace)
void	set_bm_info (bool not_at_start, BoyerMooreLookahead *bm)

Protected Attributes
RegExpNode *	replacement_

Private Attributes
Label	label_
NodeInfo	info_
int	trace_count_
BoyerMooreLookahead *	bm_info_ [2]
Zone *	zone_

Static Private Attributes
static const int	kFirstCharBudget = 10

Detailed Description

Definition at line 571 of file jsregexp.h.

Member Enumeration Documentation

LimitResult

enum v8::internal::RegExpNode::LimitResult

protected

Enumerator
DONE
CONTINUE

Definition at line 671 of file jsregexp.h.

{ DONE, CONTINUE };

Constructor & Destructor Documentation

RegExpNode()

v8::internal::RegExpNode::RegExpNode ( Zone *  zone )

inlineexplicit

Definition at line 573 of file jsregexp.h.

  : replacement_(NULL), trace_count_(0), zone_(zone) {
    bm_info_[0] = bm_info_[1] = NULL;
  }

References bm_info_, and NULL.

~RegExpNode()

v8::internal::RegExpNode::~RegExpNode ( )

virtual

Definition at line 2225 of file jsregexp.cc.

                        {
}

Member Function Documentation

Accept()

virtual void v8::internal::RegExpNode::Accept ( NodeVisitor *  visitor )

pure virtual

Implemented in v8::internal::LoopChoiceNode, v8::internal::ChoiceNode, v8::internal::EndNode, v8::internal::BackReferenceNode, v8::internal::AssertionNode, v8::internal::TextNode, and v8::internal::ActionNode.

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

Here is the caller graph for this function:

bm_info()

BoyerMooreLookahead* v8::internal::RegExpNode::bm_info ( bool  not_at_start )

inline

Definition at line 664 of file jsregexp.h.

                                                  {
    return bm_info_[not_at_start ? 1 : 0];
  }

References bm_info_.

Referenced by v8::internal::ChoiceNode::EmitOptimizedUnanchoredSearch().

Here is the caller graph for this function:

EatsAtLeast()

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

pure virtual

Implemented in v8::internal::EndNode, v8::internal::BackReferenceNode, v8::internal::LoopChoiceNode, v8::internal::NegativeLookaheadChoiceNode, v8::internal::ChoiceNode, v8::internal::AssertionNode, v8::internal::TextNode, and v8::internal::ActionNode.

Referenced by v8::internal::NegativeLookaheadChoiceNode::EatsAtLeast(), and v8::internal::ChoiceNode::EatsAtLeastHelper().

Here is the caller graph for this function:

Emit()

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

pure virtual

Implemented in v8::internal::LoopChoiceNode, v8::internal::ChoiceNode, v8::internal::NegativeSubmatchSuccess, v8::internal::EndNode, v8::internal::BackReferenceNode, v8::internal::AssertionNode, v8::internal::TextNode, and v8::internal::ActionNode.

Referenced by v8::internal::RegExpCompiler::Assemble(), v8::internal::ActionNode::Emit(), v8::internal::BackReferenceNode::Emit(), v8::internal::ChoiceNode::EmitChoices(), v8::internal::EmitHat(), v8::internal::ChoiceNode::EmitOutOfLineContinuation(), and v8::internal::Trace::Flush().

Here is the caller graph for this function:

EmitQuickCheck()

bool v8::internal::RegExpNode::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
	)

Definition at line 2445 of file jsregexp.cc.

                                                              {
  if (details->characters() == 0) return false;
  GetQuickCheckDetails(
      details, compiler, 0, trace->at_start() == Trace::FALSE_VALUE);
  if (details->cannot_match()) return false;
  if (!details->Rationalize(compiler->one_byte())) return false;
  DCHECK(details->characters() == 1 ||
         compiler->macro_assembler()->CanReadUnaligned());
  uint32_t mask = details->mask();
  uint32_t value = details->value();
 
  RegExpMacroAssembler* assembler = compiler->macro_assembler();
 
  if (trace->characters_preloaded() != details->characters()) {
    DCHECK(trace->cp_offset() == bounds_check_trace->cp_offset());
    // We are attempting to preload the minimum number of characters
    // any choice would eat, so if the bounds check fails, then none of the
    // choices can succeed, so we can just immediately backtrack, rather
    // than go to the next choice.
    assembler->LoadCurrentCharacter(trace->cp_offset(),
                                    bounds_check_trace->backtrack(),
                                    !preload_has_checked_bounds,
                                    details->characters());
  }
 
 
  bool need_mask = true;
 
  if (details->characters() == 1) {
    // If number of characters preloaded is 1 then we used a byte or 16 bit
    // load so the value is already masked down.
    uint32_t char_mask;
    if (compiler->one_byte()) {
      char_mask = String::kMaxOneByteCharCode;
    } else {
      char_mask = String::kMaxUtf16CodeUnit;
    }
    if ((mask & char_mask) == char_mask) need_mask = false;
    mask &= char_mask;
  } else {
    // For 2-character preloads in one-byte mode or 1-character preloads in
    // two-byte mode we also use a 16 bit load with zero extend.
    if (details->characters() == 2 && compiler->one_byte()) {
      if ((mask & 0xffff) == 0xffff) need_mask = false;
    } else if (details->characters() == 1 && !compiler->one_byte()) {
      if ((mask & 0xffff) == 0xffff) need_mask = false;
    } else {
      if (mask == 0xffffffff) need_mask = false;
    }
  }
 
  if (fall_through_on_failure) {
    if (need_mask) {
      assembler->CheckCharacterAfterAnd(value, mask, on_possible_success);
    } else {
      assembler->CheckCharacter(value, on_possible_success);
    }
  } else {
    if (need_mask) {
      assembler->CheckNotCharacterAfterAnd(value, mask, trace->backtrack());
    } else {
      assembler->CheckNotCharacter(value, trace->backtrack());
    }
  }
  return true;
}

References v8::internal::Trace::at_start(), v8::internal::Trace::backtrack(), v8::internal::QuickCheckDetails::cannot_match(), v8::internal::RegExpMacroAssembler::CanReadUnaligned(), v8::internal::QuickCheckDetails::characters(), v8::internal::Trace::characters_preloaded(), v8::internal::RegExpMacroAssembler::CheckCharacter(), v8::internal::RegExpMacroAssembler::CheckCharacterAfterAnd(), v8::internal::RegExpMacroAssembler::CheckNotCharacter(), v8::internal::RegExpMacroAssembler::CheckNotCharacterAfterAnd(), v8::internal::Trace::cp_offset(), DCHECK, v8::internal::Trace::FALSE_VALUE, v8::internal::String::kMaxOneByteCharCode, v8::internal::String::kMaxUtf16CodeUnit, v8::internal::RegExpMacroAssembler::LoadCurrentCharacter(), v8::internal::RegExpCompiler::macro_assembler(), v8::internal::QuickCheckDetails::mask(), v8::internal::RegExpCompiler::one_byte(), v8::internal::QuickCheckDetails::Rationalize(), and v8::internal::QuickCheckDetails::value().

Referenced by v8::internal::ChoiceNode::EmitChoices().

Here is the call graph for this function:

Here is the caller graph for this function:

FillInBMInfo()

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

inlinevirtual

Reimplemented in v8::internal::LoopChoiceNode, v8::internal::NegativeLookaheadChoiceNode, v8::internal::ChoiceNode, v8::internal::EndNode, v8::internal::BackReferenceNode, v8::internal::AssertionNode, v8::internal::TextNode, v8::internal::ActionNode, and v8::internal::SeqRegExpNode.

Definition at line 622 of file jsregexp.h.

                                               {
    UNREACHABLE();
  }

References UNREACHABLE.

Referenced by v8::internal::ChoiceNode::EmitOptimizedUnanchoredSearch(), v8::internal::SeqRegExpNode::FillInBMInfo(), v8::internal::TextNode::FillInBMInfo(), and v8::internal::ChoiceNode::FillInBMInfo().

Here is the caller graph for this function:

FilterOneByte()

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

inlinevirtual

Reimplemented in v8::internal::LoopChoiceNode, v8::internal::NegativeLookaheadChoiceNode, v8::internal::ChoiceNode, v8::internal::TextNode, and v8::internal::SeqRegExpNode.

Definition at line 632 of file jsregexp.h.

                                                                 {
    return this;
  }

Referenced by v8::internal::RegExpEngine::Compile(), v8::internal::ChoiceNode::FilterOneByte(), v8::internal::NegativeLookaheadChoiceNode::FilterOneByte(), v8::internal::LoopChoiceNode::FilterOneByte(), and v8::internal::SeqRegExpNode::FilterSuccessor().

Here is the caller graph for this function:

GetQuickCheckDetails()

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

pure virtual

Implemented in v8::internal::AssertionNode, v8::internal::ActionNode, v8::internal::LoopChoiceNode, v8::internal::NegativeLookaheadChoiceNode, v8::internal::ChoiceNode, v8::internal::EndNode, v8::internal::BackReferenceNode, and v8::internal::TextNode.

Referenced by v8::internal::ChoiceNode::GetQuickCheckDetails(), v8::internal::NegativeLookaheadChoiceNode::GetQuickCheckDetails(), and v8::internal::ActionNode::GetQuickCheckDetails().

Here is the caller graph for this function:

GetSuccessorOfOmnivorousTextNode()

virtual RegExpNode* v8::internal::RegExpNode::GetSuccessorOfOmnivorousTextNode ( RegExpCompiler *  compiler )

inlinevirtual

Reimplemented in v8::internal::TextNode.

Definition at line 611 of file jsregexp.h.

                                {
    return NULL;
  }

References NULL.

Referenced by v8::internal::ChoiceNode::EmitOptimizedUnanchoredSearch().

Here is the caller graph for this function:

GreedyLoopTextLength()

virtual int v8::internal::RegExpNode::GreedyLoopTextLength ( )

inlinevirtual

Reimplemented in v8::internal::TextNode, and v8::internal::ActionNode.

Definition at line 608 of file jsregexp.h.

{ return kNodeIsTooComplexForGreedyLoops; }

References kNodeIsTooComplexForGreedyLoops.

Referenced by v8::internal::ChoiceNode::GreedyLoopTextLengthForAlternative().

Here is the caller graph for this function:

info()

NodeInfo* v8::internal::RegExpNode::info ( )

inline

Definition at line 662 of file jsregexp.h.

{ return &info_; }

References info_.

Referenced by v8::internal::Analysis::EnsureAnalyzed(), replacement(), set_replacement(), and v8::internal::Analysis::VisitLoopChoice().

Here is the caller graph for this function:

label()

Label* v8::internal::RegExpNode::label ( )

inline

Definition at line 654 of file jsregexp.h.

{ return &label_; }

References label_.

LimitVersions()

RegExpNode::LimitResult v8::internal::RegExpNode::LimitVersions ( RegExpCompiler *  compiler, Trace *  trace  )

protected

Definition at line 2229 of file jsregexp.cc.

                                                                {
  // If we are generating a greedy loop then don't stop and don't reuse code.
  if (trace->stop_node() != NULL) {
    return CONTINUE;
  }
 
  RegExpMacroAssembler* macro_assembler = compiler->macro_assembler();
  if (trace->is_trivial()) {
    if (label_.is_bound()) {
      // We are being asked to generate a generic version, but that's already
      // been done so just go to it.
      macro_assembler->GoTo(&label_);
      return DONE;
    }
    if (compiler->recursion_depth() >= RegExpCompiler::kMaxRecursion) {
      // To avoid too deep recursion we push the node to the work queue and just
      // generate a goto here.
      compiler->AddWork(this);
      macro_assembler->GoTo(&label_);
      return DONE;
    }
    // Generate generic version of the node and bind the label for later use.
    macro_assembler->Bind(&label_);
    return CONTINUE;
  }
 
  // We are being asked to make a non-generic version.  Keep track of how many
  // non-generic versions we generate so as not to overdo it.
  trace_count_++;
  if (FLAG_regexp_optimization &&
      trace_count_ < kMaxCopiesCodeGenerated &&
      compiler->recursion_depth() <= RegExpCompiler::kMaxRecursion) {
    return CONTINUE;
  }
 
  // If we get here code has been generated for this node too many times or
  // recursion is too deep.  Time to switch to a generic version.  The code for
  // generic versions above can handle deep recursion properly.
  trace->Flush(compiler, this);
  return DONE;
}

References v8::internal::RegExpCompiler::AddWork(), v8::internal::RegExpMacroAssembler::Bind(), v8::internal::DONE, v8::internal::Trace::Flush(), v8::internal::RegExpMacroAssembler::GoTo(), v8::internal::Trace::is_trivial(), v8::internal::RegExpCompiler::kMaxRecursion, v8::internal::RegExpCompiler::macro_assembler(), NULL, v8::internal::RegExpCompiler::recursion_depth(), and v8::internal::Trace::stop_node().

Referenced by v8::internal::ActionNode::Emit(), v8::internal::BackReferenceNode::Emit(), and v8::internal::ChoiceNode::Emit().

Here is the call graph for this function:

Here is the caller graph for this function:

replacement()

RegExpNode* v8::internal::RegExpNode::replacement ( )

inline

Definition at line 636 of file jsregexp.h.

                            {
    DCHECK(info()->replacement_calculated);
    return replacement_;
  }

References DCHECK, info(), and replacement_.

Referenced by set_replacement().

Here is the call graph for this function:

Here is the caller graph for this function:

SaveBMInfo()

void v8::internal::RegExpNode::SaveBMInfo ( BoyerMooreLookahead *  bm, bool  not_at_start, int  offset  )

inline

Definition at line 650 of file jsregexp.h.

                                                                          {
    if (offset == 0) set_bm_info(not_at_start, bm);
  }

References set_bm_info().

Referenced by v8::internal::BackReferenceNode::FillInBMInfo(), and v8::internal::ChoiceNode::FillInBMInfo().

Here is the call graph for this function:

Here is the caller graph for this function:

set_bm_info()

void v8::internal::RegExpNode::set_bm_info ( bool  not_at_start, BoyerMooreLookahead *  bm  )

inlineprotected

Definition at line 676 of file jsregexp.h.

                                                               {
    bm_info_[not_at_start ? 1 : 0] = bm;
  }

References bm_info_.

Referenced by v8::internal::SeqRegExpNode::FillInBMInfo(), v8::internal::TextNode::FillInBMInfo(), v8::internal::NegativeLookaheadChoiceNode::FillInBMInfo(), and SaveBMInfo().

Here is the caller graph for this function:

set_replacement()

RegExpNode* v8::internal::RegExpNode::set_replacement ( RegExpNode *  replacement )

inline

Definition at line 640 of file jsregexp.h.

                                                       {
    info()->replacement_calculated = true;
    replacement_ =  replacement;
    return replacement;  // For convenience.
  }

References info(), replacement(), replacement_, and v8::internal::NodeInfo::replacement_calculated.

Here is the call graph for this function:

zone()

Zone* v8::internal::RegExpNode::zone ( ) const

inline

Definition at line 668 of file jsregexp.h.

{ return zone_; }

References zone_.

Referenced by v8::internal::ChoiceNode::AddAlternative(), v8::internal::AssertionNode::AfterNewline(), v8::internal::AssertionNode::AtBoundary(), v8::internal::AssertionNode::AtEnd(), v8::internal::AssertionNode::AtNonBoundary(), v8::internal::AssertionNode::AtStart(), v8::internal::ActionNode::BeginSubmatch(), v8::internal::ActionNode::ClearCaptures(), v8::internal::ChoiceNode::Emit(), v8::internal::ChoiceNode::EmitOptimizedUnanchoredSearch(), v8::internal::ActionNode::EmptyMatchCheck(), v8::internal::Analysis::EnsureAnalyzed(), v8::internal::TextNode::FillInBMInfo(), v8::internal::ActionNode::IncrementRegister(), v8::internal::ActionNode::PositiveSubmatchSuccess(), v8::internal::ActionNode::SetRegister(), v8::internal::ActionNode::StorePosition(), and v8::internal::TextNode::TextNode().

Here is the caller graph for this function:

Member Data Documentation

bm_info_

BoyerMooreLookahead* v8::internal::RegExpNode::bm_info_[2]

private

Definition at line 690 of file jsregexp.h.

Referenced by bm_info(), RegExpNode(), and set_bm_info().

info_

NodeInfo v8::internal::RegExpNode::info_

private

Definition at line 683 of file jsregexp.h.

Referenced by info().

kFirstCharBudget

const int v8::internal::RegExpNode::kFirstCharBudget = 10

staticprivate

Definition at line 681 of file jsregexp.h.

kMaxCopiesCodeGenerated

const int v8::internal::RegExpNode::kMaxCopiesCodeGenerated = 10

static

Definition at line 660 of file jsregexp.h.

kNodeIsTooComplexForGreedyLoops

const int v8::internal::RegExpNode::kNodeIsTooComplexForGreedyLoops = -1

static

Definition at line 607 of file jsregexp.h.

Referenced by v8::internal::ChoiceNode::Emit(), GreedyLoopTextLength(), and v8::internal::ActionNode::GreedyLoopTextLength().

kRecursionBudget

const int v8::internal::RegExpNode::kRecursionBudget = 200

static

Definition at line 621 of file jsregexp.h.

Referenced by v8::internal::ChoiceNode::EmitOptimizedUnanchoredSearch(), and v8::internal::ChoiceNode::SetUpPreLoad().

label_

Label v8::internal::RegExpNode::label_

private

Definition at line 682 of file jsregexp.h.

Referenced by label().

replacement_

RegExpNode* v8::internal::RegExpNode::replacement_

protected

Definition at line 672 of file jsregexp.h.

Referenced by replacement(), and set_replacement().

trace_count_

int v8::internal::RegExpNode::trace_count_

private

Definition at line 689 of file jsregexp.h.

zone_

Zone* v8::internal::RegExpNode::zone_

private

Definition at line 692 of file jsregexp.h.

Referenced by zone().

---

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

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