• Home
  • Raw
  • Download

Lines Matching refs:ChoiceNode

696 DispatchTable* ChoiceNode::GetTable(bool ignore_case) {  in GetTable()
1234 void ChoiceNode::GenerateGuard(RegExpMacroAssembler* macro_assembler, in GenerateGuard()
1654 int ChoiceNode::EatsAtLeastHelper(int still_to_find, in EatsAtLeastHelper()
1676 int ChoiceNode::EatsAtLeast(int still_to_find, int recursion_depth) { in EatsAtLeast()
2020 return ChoiceNode::GetQuickCheckDetails(details, in GetQuickCheckDetails()
2027 void ChoiceNode::GetQuickCheckDetails(QuickCheckDetails* details, in GetQuickCheckDetails()
2468 int ChoiceNode::GreedyLoopTextLength(GuardedAlternative* alternative) { in GreedyLoopTextLength()
2521 ChoiceNode::Emit(compiler, trace); in Emit()
2525 int ChoiceNode::CalculatePreloadCharacters(RegExpCompiler* compiler) { in CalculatePreloadCharacters()
2670 void ChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
2844 void ChoiceNode::EmitOutOfLineContinuation(RegExpCompiler* compiler, in EmitOutOfLineContinuation()
3097 TableEntryBodyPrinter(StringStream* stream, ChoiceNode* choice) in TableEntryBodyPrinter()
3113 ChoiceNode* choice() { return choice_; } in choice()
3115 ChoiceNode* choice_;
3194 void DotPrinter::VisitChoice(ChoiceNode* that) { in VisitChoice()
3501 ChoiceNode* result = new ChoiceNode(length); in ToNode()
3579 ChoiceNode* alternation = new ChoiceNode(2); in ToNode()
3670 ChoiceNode* result = new ChoiceNode(2); in ToNode()
3758 ChoiceNode* choice_node = in ToNode()
4260 void Analysis::VisitChoice(ChoiceNode* that) { in VisitChoice()
4311 void DispatchTableConstructor::BuildTable(ChoiceNode* node) { in BuildTable()
4338 void DispatchTableConstructor::VisitChoice(ChoiceNode* node) { in VisitChoice()
4448 ChoiceNode* first_step_node = new ChoiceNode(2); in Compile()