Lines Matching refs:ChoiceNode
665 DispatchTable* ChoiceNode::GetTable(bool ignore_case) {
1203 void ChoiceNode::GenerateGuard(RegExpMacroAssembler* macro_assembler,
1621 int ChoiceNode::EatsAtLeastHelper(int still_to_find,
1643 int ChoiceNode::EatsAtLeast(int still_to_find, int recursion_depth) {
1987 return ChoiceNode::GetQuickCheckDetails(details,
1994 void ChoiceNode::GetQuickCheckDetails(QuickCheckDetails* details,
2492 int ChoiceNode::GreedyLoopTextLength(GuardedAlternative* alternative) {
2545 ChoiceNode::Emit(compiler, trace);
2549 int ChoiceNode::CalculatePreloadCharacters(RegExpCompiler* compiler) {
2694 void ChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
2795 // On the last choice in the ChoiceNode we generated the quick
2868 void ChoiceNode::EmitOutOfLineContinuation(RegExpCompiler* compiler,
3121 TableEntryBodyPrinter(StringStream* stream, ChoiceNode* choice)
3137 ChoiceNode* choice() { return choice_; }
3139 ChoiceNode* choice_;
3218 void DotPrinter::VisitChoice(ChoiceNode* that) {
3545 ChoiceNode* result = new ChoiceNode(length);
3623 ChoiceNode* alternation = new ChoiceNode(2);
3713 // The ChoiceNode to distinguish between a newline and end-of-input.
3714 ChoiceNode* result = new ChoiceNode(2);
3732 // Add the two alternatives to the ChoiceNode.
3785 // We use a ChoiceNode for a negative lookahead because it has most of
3793 // ChoiceNode that knows to ignore the first exit when calculating quick
3802 ChoiceNode* choice_node =
4797 void Analysis::VisitChoice(ChoiceNode* that) {
5043 void DispatchTableConstructor::BuildTable(ChoiceNode* node) {
5070 void DispatchTableConstructor::VisitChoice(ChoiceNode* node) {
5179 ChoiceNode* first_step_node = new ChoiceNode(2);
