/external/regex-re2/re2/testing/ |
H A D | null_walker.cc | 20 // Should never be called: we use Walk not WalkExponential. 41 w.Walk(this, false);
|
/external/v8/test/cctest/ |
H A D | test-profile-generator.cc | 98 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 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 | 513 // 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 D | microdump_processor.cc | 80 if (!stackwalker->Walk(stack.get(),
|
H A D | stackwalker_arm_unittest.cc | 157 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 D | stackwalker_arm64_unittest.cc | 155 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 D | stackwalker_mips_unittest.cc | 160 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 D | stackwalker_address_list_unittest.cc | 135 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols, 169 ASSERT_TRUE(walker.Walk(&call_stack, &modules_without_symbols,
|
H A D | stackwalker_amd64_unittest.cc | 161 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 D | stackwalker_x86_unittest.cc | 171 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 D | stackwalker.cc | 105 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 D | stackwalker_selftest.cc | 348 stackwalker.Walk(&stack, &modules_without_symbols);
|
H A D | cfi_frame_info_unittest.cc | 493 TEST_F(SimpleWalker, Walk) {
|
H A D | minidump_processor.cc | 254 if (!stackwalker->Walk(stack.get(),
|
/external/google-breakpad/src/google_breakpad/processor/ |
H A D | stackwalker.h | 80 bool Walk(CallStack* stack,
|
/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
|