HomeSort by relevance Sort by last modified time
    Searched defs:Traverse (Results 1 - 20 of 20) sorted by null

  /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...]
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/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/chromium_org/ppapi/generators/
idl_node.py 413 def Traverse(self, data, func):
416 child.Traverse(data, func)
  /external/chromium_org/sandbox/linux/seccomp-bpf/
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/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/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); \
  /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); \
  /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/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.equinox.p2.metadata_2.0.0.v20100601.jar 
org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar 
org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar 
  /prebuilts/tools/common/m2/internal/com/android/external/eclipse/swt/3.5.0/
swt-3.5.0.jar 
  /prebuilts/tools/darwin-x86/swt/
swt.jar 
  /prebuilts/tools/darwin-x86_64/swt/
swt.jar 
  /prebuilts/tools/linux-x86/swt/
swt.jar 
  /prebuilts/tools/linux-x86_64/swt/
swt.jar 
  /prebuilts/tools/windows/swt/
swt.jar 
  /prebuilts/tools/windows-x86_64/swt/
swt.jar 

Completed in 4293 milliseconds