Index: src/jsregexp.h |
=================================================================== |
--- src/jsregexp.h (revision 9202) |
+++ src/jsregexp.h (working copy) |
@@ -255,6 +255,7 @@ |
return (bits_ == (kInFirst | kInSecond | kInBoth)); |
} |
int value() { return bits_; } |
+ |
private: |
int bits_; |
}; |
@@ -404,6 +405,7 @@ |
template <typename Callback> |
void ForEach(Callback* callback) { return tree()->ForEach(callback); } |
+ |
private: |
// There can't be a static empty set since it allocates its |
// successors in a zone and caches them. |
@@ -793,6 +795,7 @@ |
virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } |
virtual ActionNode* Clone() { return new ActionNode(*this); } |
virtual int ComputeFirstCharacterSet(int budget); |
+ |
private: |
union { |
struct { |
@@ -861,6 +864,7 @@ |
} |
void CalculateOffsets(); |
virtual int ComputeFirstCharacterSet(int budget); |
+ |
private: |
enum TextEmitPassType { |
NON_ASCII_MATCH, // Check for characters that can't match. |
@@ -925,6 +929,7 @@ |
virtual AssertionNode* Clone() { return new AssertionNode(*this); } |
AssertionNodeType type() { return type_; } |
void set_type(AssertionNodeType type) { type_ = type; } |
+ |
private: |
AssertionNode(AssertionNodeType t, RegExpNode* on_success) |
: SeqRegExpNode(on_success), type_(t) { } |
@@ -955,6 +960,7 @@ |
} |
virtual BackReferenceNode* Clone() { return new BackReferenceNode(*this); } |
virtual int ComputeFirstCharacterSet(int budget); |
+ |
private: |
int start_reg_; |
int end_reg_; |
@@ -1301,6 +1307,7 @@ |
} |
void InvalidateCurrentCharacter(); |
void AdvanceCurrentPositionInTrace(int by, RegExpCompiler* compiler); |
+ |
private: |
int FindAffectedRegisters(OutSet* affected_registers); |
void PerformDeferredActions(RegExpMacroAssembler* macro, |
@@ -1402,6 +1409,7 @@ |
void fail(const char* error_message) { |
error_message_ = error_message; |
} |
+ |
private: |
bool ignore_case_; |
bool is_ascii_; |