Home
last modified time | relevance | path

Searched refs:on_success (Results 1 - 15 of 15) sorted by relevance

/third_party/node/deps/v8/src/regexp/
H A Dregexp-nodes.h295 explicit SeqRegExpNode(RegExpNode* on_success) in SeqRegExpNode() argument
296 : RegExpNode(on_success->zone()), on_success_(on_success) {} in SeqRegExpNode()
297 RegExpNode* on_success() { return on_success_; } in on_success() function in v8::internal::SeqRegExpNode
326 RegExpNode* on_success);
327 static ActionNode* IncrementRegister(int reg, RegExpNode* on_success);
329 RegExpNode* on_success);
330 static ActionNode* ClearCaptures(Interval range, RegExpNode* on_success);
333 RegExpNode* on_success);
336 RegExpNode* on_success);
388 ActionNode(ActionType action_type, RegExpNode* on_success) ActionNode() argument
397 TextNode(ZoneList<TextElement>* elms, bool read_backward, RegExpNode* on_success) TextNode() argument
400 TextNode(RegExpCharacterClass* that, bool read_backward, RegExpNode* on_success) TextNode() argument
467 AtEnd(RegExpNode* on_success) AtEnd() argument
470 AtStart(RegExpNode* on_success) AtStart() argument
473 AtBoundary(RegExpNode* on_success) AtBoundary() argument
476 AtNonBoundary(RegExpNode* on_success) AtNonBoundary() argument
479 AfterNewline(RegExpNode* on_success) AfterNewline() argument
498 AssertionNode(AssertionType t, RegExpNode* on_success) AssertionNode() argument
505 BackReferenceNode(int start_reg, int end_reg, RegExpFlags flags, bool read_backward, RegExpNode* on_success) BackReferenceNode() argument
[all...]
H A Dregexp-compiler-tonode.cc34 RegExpNode* on_success) { in ToNode()
39 on_success); in ToNode()
43 RegExpNode* on_success) { in ToNode()
45 on_success); in ToNode()
208 RegExpNode* on_success, UnicodeRangeSplitter* splitter) { in AddBmpCharacters()
213 compiler->zone(), bmp, compiler->read_backward(), on_success))); in AddBmpCharacters()
228 RegExpNode* on_success, in AddNonBmpSurrogatePairs()
312 compiler->read_backward(), on_success))); in AddNonBmpSurrogatePairs()
321 on_success))); in AddNonBmpSurrogatePairs()
327 ZoneList<CharacterRange>* match, RegExpNode* on_success, in NegativeLookaroundAgainstReadDirectionAndMatch()
33 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) ToNode() argument
42 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) ToNode() argument
207 AddBmpCharacters(RegExpCompiler* compiler, ChoiceNode* result, RegExpNode* on_success, UnicodeRangeSplitter* splitter) AddBmpCharacters() argument
227 AddNonBmpSurrogatePairs(RegExpCompiler* compiler, ChoiceNode* result, RegExpNode* on_success, UnicodeRangeSplitter* splitter) AddNonBmpSurrogatePairs() argument
325 NegativeLookaroundAgainstReadDirectionAndMatch( RegExpCompiler* compiler, ZoneList<CharacterRange>* lookbehind, ZoneList<CharacterRange>* match, RegExpNode* on_success, bool read_backward) NegativeLookaroundAgainstReadDirectionAndMatch() argument
341 MatchAndNegativeLookaroundInReadDirection( RegExpCompiler* compiler, ZoneList<CharacterRange>* match, ZoneList<CharacterRange>* lookahead, RegExpNode* on_success, bool read_backward) MatchAndNegativeLookaroundInReadDirection() argument
356 AddLoneLeadSurrogates(RegExpCompiler* compiler, ChoiceNode* result, RegExpNode* on_success, UnicodeRangeSplitter* splitter) AddLoneLeadSurrogates() argument
382 AddLoneTrailSurrogates(RegExpCompiler* compiler, ChoiceNode* result, RegExpNode* on_success, UnicodeRangeSplitter* splitter) AddLoneTrailSurrogates() argument
408 UnanchoredAdvance(RegExpCompiler* compiler, RegExpNode* on_success) UnanchoredAdvance() argument
457 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) ToNode() argument
818 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
845 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
853 BoundaryAssertionAsLookaround(RegExpCompiler* compiler, RegExpNode* on_success, RegExpAssertion::Type type, RegExpFlags flags) RationalizeConsecutiveAtoms() argument
889 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
949 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
957 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
962 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
967 Builder(bool is_positive, RegExpNode* on_success, int stack_pointer_register, int position_register, int capture_register_count, int capture_register_start) RationalizeConsecutiveAtoms() argument
1006 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
1020 Builder builder(is_positive(), on_success, stack_pointer_register, RationalizeConsecutiveAtoms() local
1028 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
1033 ToNode(RegExpTree* body, int index, RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
1131 ToNode(RegExpCompiler* compiler, RegExpNode* on_success) RationalizeConsecutiveAtoms() argument
1588 ToNode(int min, int max, bool is_greedy, RegExpTree* body, RegExpCompiler* compiler, RegExpNode* on_success, bool not_at_start) RationalizeConsecutiveAtoms() argument
[all...]
H A Dregexp-compiler.cc640 RegExpNode* on_success) { in SetRegisterForLoop()
642 on_success->zone()->New<ActionNode>(SET_REGISTER_FOR_LOOP, on_success); in SetRegisterForLoop()
648 ActionNode* ActionNode::IncrementRegister(int reg, RegExpNode* on_success) { in IncrementRegister() argument
650 on_success->zone()->New<ActionNode>(INCREMENT_REGISTER, on_success); in IncrementRegister()
656 RegExpNode* on_success) { in StorePosition()
658 on_success->zone()->New<ActionNode>(STORE_POSITION, on_success); in StorePosition()
664 ActionNode* ActionNode::ClearCaptures(Interval range, RegExpNode* on_success) { in ClearCaptures() argument
639 SetRegisterForLoop(int reg, int val, RegExpNode* on_success) SetRegisterForLoop() argument
655 StorePosition(int reg, bool is_capture, RegExpNode* on_success) StorePosition() argument
672 BeginPositiveSubmatch(int stack_reg, int position_reg, RegExpNode* on_success) BeginPositiveSubmatch() argument
681 BeginNegativeSubmatch(int stack_reg, int position_reg, RegExpNode* on_success) BeginNegativeSubmatch() argument
690 PositiveSubmatchSuccess(int stack_reg, int position_reg, int clear_register_count, int clear_register_from, RegExpNode* on_success) PositiveSubmatchSuccess() argument
703 EmptyMatchCheck(int start_register, int repetition_register, int repetition_limit, RegExpNode* on_success) EmptyMatchCheck() argument
2116 EmitHat(RegExpCompiler* compiler, RegExpNode* on_success, Trace* trace) EmitHat() argument
2419 CreateForCharacterRanges(Zone* zone, ZoneList<CharacterRange>* ranges, bool read_backward, RegExpNode* on_success) CreateForCharacterRanges() argument
2430 CreateForSurrogatePair( Zone* zone, CharacterRange lead, ZoneList<CharacterRange>* trail_ranges, bool read_backward, RegExpNode* on_success) CreateForSurrogatePair() argument
2444 CreateForSurrogatePair( Zone* zone, ZoneList<CharacterRange>* lead_ranges, CharacterRange trail, bool read_backward, RegExpNode* on_success) CreateForSurrogatePair() argument
3884 OptionallyStepBackToLeadSurrogate( RegExpNode* on_success) OptionallyStepBackToLeadSurrogate() argument
[all...]
H A Dregexp-dotprinter.cc155 os_ << " n" << that << " -> n" << that->on_success() << ";\n"; in VisitText()
156 Visit(that->on_success()); in VisitText()
163 os_ << " n" << that << " -> n" << that->on_success() << ";\n"; in VisitBackReference()
164 Visit(that->on_success()); in VisitBackReference()
193 RegExpNode* successor = that->on_success(); in VisitAssertion()
239 RegExpNode* successor = that->on_success(); in VisitAction()
H A Dregexp-ast.h155 RegExpNode* ToNode(RegExpCompiler* compiler, RegExpNode* on_success) \
166 RegExpNode* on_success) = 0;
429 RegExpCompiler* compiler, RegExpNode* on_success,
464 RegExpCompiler* compiler, RegExpNode* on_success);
538 Builder(bool is_positive, RegExpNode* on_success,
H A Dregexp-compiler.h512 RegExpNode* OptionallyStepBackToLeadSurrogate(RegExpNode* on_success);
/third_party/nghttp2/src/
H A Dshrpx_live_check.cc374 on_success(); in connected()
443 on_success(); in tls_handshake()
515 on_success(); in write_tls()
583 on_success(); in write_clear()
675 void LiveCheck::on_success() { in on_success() function in shrpx::LiveCheck
H A Dshrpx_connect_blocker.h48 void on_success();
H A Dshrpx_live_check.h55 void on_success();
H A Dshrpx_connect_blocker.cc59 void ConnectBlocker::on_success() { in on_success() function in shrpx::ConnectBlocker
H A Dshrpx_memcached_connection.cc248 connect_blocker_.on_success(); in connected()
291 connect_blocker_.on_success(); in tls_handshake()
H A Dshrpx_http_downstream_connection.cc394 worker_blocker->on_success(); in initiate_connection()
1364 connect_blocker->on_success(); in tls_handshake()
1578 connect_blocker->on_success(); in connected()
H A Dshrpx_http2_session.cc422 worker_blocker->on_success(); in initiate_connection()
529 worker_blocker->on_success(); in initiate_connection()
594 worker_blocker->on_success(); in initiate_connection()
1333 connect_blocker->on_success(); in on_frame_recv_callback()
/third_party/node/deps/v8/src/compiler/
H A Djs-inlining.cc174 Node* on_success = graph()->NewNode(common()->IfSuccess(), subcall); in InlineCall() local
175 NodeProperties::ReplaceUses(subcall, subcall, subcall, on_success); in InlineCall()
176 NodeProperties::ReplaceControlInput(on_success, subcall); in InlineCall()
H A Dbytecode-graph-builder.cc4312 Node* on_success = graph()->NewNode(if_success, result); in MakeNode() local
4313 environment()->UpdateControlDependency(on_success); in MakeNode()

Completed in 30 milliseconds