/art/compiler/sea_ir/ir/ |
visitor.h | 65 virtual void Traverse(SeaGraph* graph); 66 virtual void Traverse(Region* region); 68 // because the parameter classes have no children to traverse. 69 virtual void Traverse(InstructionNode* region) { } 70 virtual void Traverse(ConstInstructionNode* instruction) { } 71 virtual void Traverse(ReturnInstructionNode* instruction) { } 72 virtual void Traverse(IfNeInstructionNode* instruction) { } 73 virtual void Traverse(AddIntLit8InstructionNode* instruction) { } 74 virtual void Traverse(MoveResultInstructionNode* instruction) { } 75 virtual void Traverse(InvokeStaticInstructionNode* instruction) { [all...] |
instruction_nodes.h | 84 v->Traverse(this); 116 v->Traverse(this); 131 v->Traverse(this); 151 v->Traverse(this); 162 v->Traverse(this); 178 v->Traverse(this); 195 v->Traverse(this); 207 v->Traverse(this); 224 v->Traverse(this); 233 v->Traverse(this) [all...] |
sea.h | 71 v->Traverse(this); 128 v->Traverse(this); 218 v->Traverse(this); 287 visitor->Traverse(this);
|
sea.cc | 32 void IRVisitor::Traverse(Region* region) { 45 void IRVisitor::Traverse(SeaGraph* graph) {
|
/external/chromium_org/tools/telemetry_tools/ |
telemetry_bootstrap.py | 69 def Traverse(self, src_path, dst_path): 88 self.Traverse(os.path.join(src_path, subdir), 157 dav_client.Traverse(parsed_url.path, full_dst_path)
|
/external/v8/test/cctest/ |
test-strings.cc | 3 // Check that we can traverse very deep stacks of ConsStrings using 201 static void Traverse(Handle<String> s1, Handle<String> s2) { 231 TEST(Traverse) { 244 Traverse(flat, symmetric); 246 Traverse(flat, left_asymmetric); 248 Traverse(flat, right_asymmetric); 261 Traverse(flat, left_asymmetric); 265 Traverse(flat, right_asymmetric); 269 Traverse(flat, symmetric);
|
/external/chromium_org/sandbox/linux/seccomp-bpf/ |
codegen.h | 80 // Traverse the graph of instructions and visit each instruction once. 86 void Traverse(Instruction *, void (*fnc)(Instruction *, void *aux),
|
sandbox_bpf.cc | 131 // Function that can be passed as a callback function to CodeGen::Traverse(). 160 // Function that can be passed as a callback function to CodeGen::Traverse(). 569 gen->Traverse(jumptable, CheckForUnsafeErrorCodes, &has_unsafe_traps); 615 gen->Traverse(jumptable, RedirectToUserspace, this); [all...] |
codegen.cc | 12 // Helper function for Traverse(). 219 void CodeGen::Traverse(Instruction *instruction, 251 // We haven't seen the "true" branch yet. Traverse it now. We have 253 // traverse it later. 528 // basic block. But we only traverse recursively the very first time we
|
/external/chromium_org/tools/idl_parser/ |
idl_node.py | 128 def Traverse(self, search, filter_nodes): 135 child.Traverse(search, filter_nodes) 163 self.Traverse(search, filter_nodes)
|
/external/clang/include/clang/AST/ |
RecursiveASTVisitor.h | 82 /// 1. traverse the AST (i.e. go to each node); 104 /// These three method groups are tiered (Traverse* > WalkUpFrom* > 105 /// Visit*). A method (e.g. Traverse*) may call methods from the same 106 /// tier (e.g. other Traverse*) or one tier lower (e.g. WalkUpFrom*). 121 /// template pattern) and override any of the Traverse*, WalkUpFrom*, 125 /// users may override Traverse* and WalkUpFrom* to implement custom 165 /// dispatching to Traverse*() based on the argument's dynamic type. 172 /// Traverse*Type() based on the argument's getTypeClass() property. 179 /// Traverse*TypeLoc() based on the argument type's getTypeClass() property. 186 /// Traverse*Decl() based on the argument's dynamic type [all...] |
/external/clang/tools/libclang/ |
RecursiveASTVisitor.h | 83 /// 1. traverse the AST (i.e. go to each node); 105 /// These three method groups are tiered (Traverse* > WalkUpFrom* > 106 /// Visit*). A method (e.g. Traverse*) may call methods from the same 107 /// tier (e.g. other Traverse*) or one tier lower (e.g. WalkUpFrom*). 125 /// template pattern) and override any of the Traverse*, WalkUpFrom*, 129 /// users may override Traverse* and WalkUpFrom* to implement custom 158 /// dispatching to Traverse*() based on the argument's dynamic type. 165 /// Traverse*Type() based on the argument's getTypeClass() property. 172 /// Traverse*TypeLoc() based on the argument type's getTypeClass() property. 179 /// Traverse*Decl() based on the argument's dynamic type [all...] |
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/core/controls/ |
CTableCombo.java | 134 SWT.Traverse, 144 SWT.Traverse, 218 case SWT.Traverse : { 233 notifyListeners(SWT.Traverse, e); 470 case SWT.Traverse : { 490 notifyListeners(SWT.Traverse, e);
|
CCombo3.java | 67 SWT.Traverse,
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
malloc_hook.cc | 257 int HookList<T>::Traverse(T* output_array, int n) const { 509 int num_hooks = hook_list.Traverse(hooks, kHookListMaxValues); \ 519 int num_hooks = hook_list.Traverse(hooks, kHookListMaxValues); \
|
malloc_hook-inl.h | 123 int Traverse(T* output_array, int n) const;
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
malloc_hook.cc | 257 int HookList<T>::Traverse(T* output_array, int n) const { 509 int num_hooks = hook_list.Traverse(hooks, kHookListMaxValues); \ 519 int num_hooks = hook_list.Traverse(hooks, kHookListMaxValues); \
|
malloc_hook-inl.h | 123 int Traverse(T* output_array, int n) const;
|
/external/chromium_org/chrome/common/extensions/docs/examples/api/bookmarks/basic/ |
popup.js | 12 // Traverse the bookmark tree, and print the folder and nodes.
|
/external/chromium_org/chrome/common/extensions/docs/server2/test_data/example_zipper/basic/ |
popup.js | 12 // Traverse the bookmark tree, and print the folder and nodes.
|
/external/chromium_org/v8/test/cctest/ |
test-strings.cc | 28 // Check that we can traverse very deep stacks of ConsStrings using 538 static void Traverse(Handle<String> s1, Handle<String> s2) { 570 TEST(Traverse) { 582 Traverse(flat, symmetric); 584 Traverse(flat, left_asymmetric); 586 Traverse(flat, right_asymmetric); 599 Traverse(flat, left_asymmetric); 603 Traverse(flat, right_asymmetric); 607 Traverse(flat, symmetric); [all...] |
/external/chromium_org/ppapi/generators/ |
idl_node.py | 413 def Traverse(self, data, func): 416 child.Traverse(data, func)
|
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
malloc_hook_test.cc | 102 int result = list.Traverse(values_as_hooks, min(n, kHookListMaxValues));
|
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
malloc_hook_test.cc | 102 int result = list.Traverse(values_as_hooks, min(n, kHookListMaxValues));
|
/external/clang/include/clang/ASTMatchers/ |
ASTMatchersInternal.h | 612 /// \brief Interface that allows matchers to traverse the AST. 635 /// Will traverse any child nodes. 637 /// Will not traverse implicit casts and parentheses. 671 TraversalKind Traverse, 682 Matcher, Builder, Traverse, Bind); 721 TraversalKind Traverse, [all...] |