861 DispatchTable* ChoiceNode::GetTable(bool ignore_case) {  in GetTable()
1526 void ChoiceNode::GenerateGuard(RegExpMacroAssembler* macro_assembler,  in GenerateGuard()
2314 int ChoiceNode::EatsAtLeastHelper(int still_to_find,  in EatsAtLeastHelper()
2344 int ChoiceNode::EatsAtLeast(int still_to_find,  in EatsAtLeast()
2797   return ChoiceNode::FilterOneByte(depth - 1);  in FilterOneByte()
2800 RegExpNode* ChoiceNode::FilterOneByte(int depth) {  in FilterOneByte()
2878   return ChoiceNode::GetQuickCheckDetails(details,  in GetQuickCheckDetails()
2892   ChoiceNode::FillInBMInfo(isolate, offset, budget - 1, bm, not_at_start);  in FillInBMInfo()
2897 void ChoiceNode::GetQuickCheckDetails(QuickCheckDetails* details,  in GetQuickCheckDetails()
3409 int ChoiceNode::GreedyLoopTextLengthForAlternative(  in GreedyLoopTextLengthForAlternative()
3465   ChoiceNode::Emit(compiler, trace);  in Emit()
3469 int ChoiceNode::CalculatePreloadCharacters(RegExpCompiler* compiler,  in CalculatePreloadCharacters()
3865 void ChoiceNode::AssertGuardsMentionRegisters(Trace* trace) {  in AssertGuardsMentionRegisters()
3880 void ChoiceNode::SetUpPreLoad(RegExpCompiler* compiler,  in SetUpPreLoad()
3898 void ChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {  in Emit()
3975 Trace* ChoiceNode::EmitGreedyLoop(RegExpCompiler* compiler,  in EmitGreedyLoop()
4022 int ChoiceNode::EmitOptimizedUnanchoredSearch(RegExpCompiler* compiler,  in EmitOptimizedUnanchoredSearch()
4074 void ChoiceNode::EmitChoices(RegExpCompiler* compiler,  in EmitChoices()
4160 void ChoiceNode::EmitOutOfLineContinuation(RegExpCompiler* compiler,  in EmitOutOfLineContinuation()
4416   TableEntryBodyPrinter(std::ostream& os, ChoiceNode* choice)  // NOLINT  in TableEntryBodyPrinter()
4429   ChoiceNode* choice() { return choice_; }  in choice()
4431   ChoiceNode* choice_;
4512 void DotPrinter::VisitChoice(ChoiceNode* that) {  in VisitChoice()
4870 void AddBmpCharacters(RegExpCompiler* compiler, ChoiceNode* result,  in AddBmpCharacters()
4880 void AddNonBmpSurrogatePairs(RegExpCompiler* compiler, ChoiceNode* result,  in AddNonBmpSurrogatePairs()
4970 void AddLoneLeadSurrogates(RegExpCompiler* compiler, ChoiceNode* result,  in AddLoneLeadSurrogates()
4998 void AddLoneTrailSurrogates(RegExpCompiler* compiler, ChoiceNode* result,  in AddLoneTrailSurrogates()
5100       ChoiceNode* result = new (zone) ChoiceNode(2, zone);  in ToNode()
5376   ChoiceNode* result =  in ToNode()
5377       new(compiler->zone()) ChoiceNode(length, compiler->zone());  in ToNode()
5502           ChoiceNode* alternation = new(zone) ChoiceNode(2, zone);  in ToNode()
5590   ChoiceNode* result = new (zone) ChoiceNode(2, zone);  in BoundaryAssertionAsLookaround()
5643       ChoiceNode* result = new(zone) ChoiceNode(2, zone);  in ToNode()
5724     ChoiceNode* choice_node = new (zone) NegativeLookaroundChoiceNode(  in ForMatch()
6355 void Analysis::VisitChoice(ChoiceNode* that) {  in VisitChoice()
6411 void ChoiceNode::FillInBMInfo(Isolate* isolate, int offset, int budget,  in FillInBMInfo()
6495 void DispatchTableConstructor::BuildTable(ChoiceNode* node) {  in BuildTable()
6521 void DispatchTableConstructor::VisitChoice(ChoiceNode* node) {  in VisitChoice()
6611   ChoiceNode* optional_step_back = new (zone) ChoiceNode(2, zone);  in OptionallyStepBackToLeadSurrogate()
6678       ChoiceNode* first_step_node = new(zone) ChoiceNode(2, zone);  in Compile()