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

  /external/chromium_org/tools/
include_tracer.py 140 def Walk(seen, filename, parent, indent):
183 total_bytes += Walk(
187 total_bytes += Walk(
190 total_bytes += Walk(
196 bytes = Walk(set(), sys.argv[1], '', 0)
  /art/runtime/gc/accounting/
heap_bitmap.cc 63 void HeapBitmap::Walk(SpaceBitmap::Callback* callback, void* arg) {
65 bitmap->Walk(callback, arg);
70 space_set->Walk(callback, arg);
space_bitmap.cc 47 void SpaceSetMap::Walk(SpaceBitmap::Callback* callback, void* arg) {
103 void SpaceBitmap::Walk(SpaceBitmap::Callback* callback, void* arg) {
123 // Walk through the bitmaps in increasing address order, and find the
178 // Walk instance fields of the given Class. Separate function to allow recursion on the super
188 // Walk instance fields
214 // Walk instance fields of all objects
217 // Walk static fields of a Class
233 // Walk elements of an object array
248 UniquePtr<SpaceBitmap> visited(Create("bitmap for in-order walk",
  /external/chromium_org/chrome/common/extensions/docs/server2/
file_system.py 76 def Walk(self, root):
77 '''Recursively walk the directories in a file system, starting with root.
78 Emulates os.walk from the standard os module.
82 def walk(root): function in function:FileSystem.Walk
97 for walkinfo in walk(root + d):
100 for walkinfo in walk(root):
  /external/chromium_org/third_party/re2/re2/
walker-inl.h 31 // At the top-most Regexp, parent_arg is arg passed to walk.
32 // If PreVisit sets *stop to true, the walk does not recurse
51 // when Walk notices that more than one child is the same re.
56 // has been used up and we're trying to abort the walk
67 T Walk(Regexp* re, T top_arg);
69 // Like Walk, but doesn't use Copy. This can lead to
73 // the walk will be cut off early.
74 // If the walk *is* cut off early, ShortVisit(re)
80 // Walk always enters and exits with an empty stack.
84 // Returns whether walk was cut off
    [all...]
  /external/regex-re2/re2/
walker-inl.h 31 // At the top-most Regexp, parent_arg is arg passed to walk.
32 // If PreVisit sets *stop to true, the walk does not recurse
51 // when Walk notices that more than one child is the same re.
56 // has been used up and we're trying to abort the walk
67 T Walk(Regexp* re, T top_arg);
69 // Like Walk, but doesn't use Copy. This can lead to
73 // the walk will be cut off early.
74 // If the walk *is* cut off early, ShortVisit(re)
80 // Walk always enters and exits with an empty stack.
84 // Returns whether walk was cut off
    [all...]
  /art/runtime/gc/space/
dlmalloc_space.cc 466 void DlMallocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg),
large_object_space.cc 109 void LargeObjectMapSpace::Walk(DlMallocSpace::WalkCallback callback, void* arg) {
148 void FreeListSpace::Walk(DlMallocSpace::WalkCallback callback, void* arg) {
  /external/chromium_org/v8/test/cctest/
test-profile-generator.cc 96 ProfileNode* Walk(CodeEntry* entry1,
124 CHECK_EQ(NULL, helper.Walk(&entry1));
125 CHECK_EQ(NULL, helper.Walk(&entry2));
126 CHECK_EQ(NULL, helper.Walk(&entry3));
131 CHECK_EQ(NULL, helper.Walk(&entry2));
132 CHECK_EQ(NULL, helper.Walk(&entry3));
133 ProfileNode* node1 = helper.Walk(&entry1);
137 CHECK_EQ(NULL, helper.Walk(&entry1, &entry1));
138 CHECK_EQ(NULL, helper.Walk(&entry1, &entry3));
139 ProfileNode* node2 = helper.Walk(&entry1, &entry2)
    [all...]
  /external/v8/test/cctest/
test-profile-generator.cc 115 ProfileNode* Walk(CodeEntry* entry1,
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(&entry1, &entry2)
    [all...]

Completed in 110 milliseconds