Searched refs:Walk (Results 1 - 7 of 7) sorted by relevance
/external/v8/test/cctest/ |
H A D | test-profile-generator.cc | 115 ProfileNode* Walk(CodeEntry* entry1, function in class:__anon13535::ProfileTreeTestHelper 146 CHECK_EQ(NULL, helper.Walk(&entry1)); 147 CHECK_EQ(NULL, helper.Walk(&entry2)); 148 CHECK_EQ(NULL, helper.Walk(&entry3)); 153 CHECK_EQ(NULL, helper.Walk(&entry2)); 154 CHECK_EQ(NULL, helper.Walk(&entry3)); 155 ProfileNode* node1 = helper.Walk(&entry1); 159 CHECK_EQ(NULL, helper.Walk(&entry1, &entry1)); 160 CHECK_EQ(NULL, helper.Walk(&entry1, &entry3)); 161 ProfileNode* node2 = helper.Walk( [all...] |
/external/regex-re2/re2/ |
H A D | mimics_pcre.cc | 44 // Should never be called: we use Walk not WalkExponential. 103 return w.Walk(this, true); 121 // Should never be called: we use Walk not WalkExponential. 182 return w.Walk(re, true);
|
H A D | walker-inl.h | 51 // when Walk notices that more than one child is the same re. 67 T Walk(Regexp* re, T top_arg); 69 // Like Walk, but doesn't use Copy. This can lead to 80 // Walk always enters and exits with an empty stack. 88 // Walk state for the entire traversal. 143 // Walk always enters and exits with an empty stack. 160 LOG(DFATAL) << "Walk NULL"; 227 template<typename T> T Regexp::Walker<T>::Walk(Regexp* re, T top_arg) { function in class:re2::Regexp::Walker
|
H A D | simplify.cc | 149 return w.Walk(this, NULL); 159 // This should never be called, since we use Walk and not
|
H A D | regexp.cc | 502 // Should never be called: we use Walk not WalkExponential. 514 w.Walk(this, 0); 546 // Should never be called: we use Walk not WalkExponential. 558 w.Walk(this, 0); 586 // Should never be called: we use Walk not WalkExponential. 598 w.Walk(this, 0);
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.Tree.pas | 721 /// Walk tree with depth-first-search and fill nodes buffer. 944 /// Walk the entire tree and make a node name to nodes mapping. 1433 /// Walk tree with depth-first-search and fill nodes buffer. 2092 /// Walk upwards looking for a node with more children to walk.
|
H A D | Antlr.Runtime.pas | 6230 // Walk buffer, executing instructions and emitting tokens
|
Completed in 166 milliseconds