Searched refs:Walk (Results 1 - 20 of 20) sorted by relevance

/external/regex-re2/re2/testing/
H A Dnull_walker.cc20 // Should never be called: we use Walk not WalkExponential.
41 w.Walk(this, false);
/external/v8/test/cctest/
H A Dtest-profile-generator.cc98 ProfileNode* Walk(CodeEntry* entry1, function in class:__anon14957::ProfileTreeTestHelper
126 CHECK_EQ(NULL, helper.Walk(&entry1));
127 CHECK_EQ(NULL, helper.Walk(&entry2));
128 CHECK_EQ(NULL, helper.Walk(&entry3));
133 CHECK_EQ(NULL, helper.Walk(&entry2));
134 CHECK_EQ(NULL, helper.Walk(&entry3));
135 ProfileNode* node1 = helper.Walk(&entry1);
138 CHECK_EQ(NULL, helper.Walk(&entry1, &entry1));
139 CHECK_EQ(NULL, helper.Walk(&entry1, &entry3));
140 ProfileNode* node2 = helper.Walk(
[all...]
/external/regex-re2/re2/
H A Dmimics_pcre.cc44 // 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 Dwalker-inl.h51 // 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 Dsimplify.cc149 return w.Walk(this, NULL);
159 // This should never be called, since we use Walk and not
H A Dregexp.cc513 // Should never be called: we use Walk not WalkExponential.
525 w.Walk(this, 0);
557 // Should never be called: we use Walk not WalkExponential.
569 w.Walk(this, 0);
597 // Should never be called: we use Walk not WalkExponential.
609 w.Walk(this, 0);
/external/google-breakpad/src/processor/
H A Dmicrodump_processor.cc80 if (!stackwalker->Walk(stack.get(),
H A Dstackwalker_arm_unittest.cc157 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
180 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
200 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
253 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
324 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
390 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
454 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
545 // Walk the stack, using stack_section as the contents of the stack
560 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
757 ASSERT_TRUE(walker.Walk(
[all...]
H A Dstackwalker_arm64_unittest.cc155 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
177 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
230 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
302 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
369 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
434 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
496 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
622 // Walk the stack, using stack_section as the contents of the stack
637 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
857 ASSERT_TRUE(walker.Walk(
[all...]
H A Dstackwalker_mips_unittest.cc160 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
187 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
210 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
266 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
341 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
412 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
485 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
576 // Walk the stack, using stack_section as the contents of the stack
590 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
672 ASSERT_TRUE(walker.Walk(
[all...]
H A Dstackwalker_address_list_unittest.cc135 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
169 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
H A Dstackwalker_amd64_unittest.cc161 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
187 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
211 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
272 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
347 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
421 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
479 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
546 // Walk the stack, using stack_section as the contents of the stack
560 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
H A Dstackwalker_x86_unittest.cc171 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
197 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
220 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
237 // Walk a traditional frame. A traditional frame saves the caller's
262 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
294 // Walk a traditional frame, but use a bogus %ebp value, forcing a scan
326 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
392 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
458 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
518 ASSERT_TRUE(walker.Walk(
[all...]
H A Dstackwalker.cc105 bool Stackwalker::Walk( function in class:google_breakpad::Stackwalker
109 BPLOG_IF(ERROR, !stack) << "Stackwalker::Walk requires |stack|";
113 BPLOG_IF(ERROR, !modules_without_symbols) << "Stackwalker::Walk requires "
115 BPLOG_IF(ERROR, !modules_without_symbols) << "Stackwalker::Walk requires "
H A Dstackwalker_selftest.cc348 stackwalker.Walk(&stack, &modules_without_symbols);
H A Dcfi_frame_info_unittest.cc493 TEST_F(SimpleWalker, Walk) {
H A Dminidump_processor.cc254 if (!stackwalker->Walk(stack.get(),
/external/google-breakpad/src/google_breakpad/processor/
H A Dstackwalker.h80 bool Walk(CallStack* stack,
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas721 /// 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 DAntlr.Runtime.pas6230 // Walk buffer, executing instructions and emitting tokens

Completed in 1275 milliseconds