| /prebuilts/go/darwin-x86/doc/play/ |
| tree.go | 32 // Walk traverses a tree depth-first,
34 func Walk(t *Tree, ch chan int) {
38 Walk(t.Left, ch)
40 Walk(t.Right, ch)
43 // Walker launches Walk in a new goroutine,
48 Walk(t, ch)
|
| /prebuilts/go/linux-x86/doc/play/ |
| tree.go | 32 // Walk traverses a tree depth-first,
34 func Walk(t *Tree, ch chan int) {
38 Walk(t.Left, ch)
40 Walk(t.Right, ch)
43 // Walker launches Walk in a new goroutine,
48 Walk(t, ch)
|
| /prebuilts/go/darwin-x86/src/go/ast/ |
| walk.go | 9 // A Visitor's Visit method is invoked for each node encountered by Walk.
10 // If the result visitor w is not nil, Walk visits each of the children
20 Walk(v, x)
26 Walk(v, x)
32 Walk(v, x)
38 Walk(v, x)
42 // TODO(gri): Investigate if providing a closure to Walk leads to
45 // Walk traverses an AST in depth-first order: It starts by calling
47 // v.Visit(node) is not nil, Walk is invoked recursively with visitor
51 func Walk(v Visitor, node Node)
[all...] |
| /prebuilts/go/linux-x86/src/go/ast/ |
| walk.go | 9 // A Visitor's Visit method is invoked for each node encountered by Walk.
10 // If the result visitor w is not nil, Walk visits each of the children
20 Walk(v, x)
26 Walk(v, x)
32 Walk(v, x)
38 Walk(v, x)
42 // TODO(gri): Investigate if providing a closure to Walk leads to
45 // Walk traverses an AST in depth-first order: It starts by calling
47 // v.Visit(node) is not nil, Walk is invoked recursively with visitor
51 func Walk(v Visitor, node Node)
[all...] |
| /art/runtime/gc/space/ |
| bump_pointer_space-walk-inl.h | 31 inline void BumpPointerSpace::Walk(Visitor&& visitor) {
38 // on Walk to expose the interprocedural nature of locks here without having to duplicate the
63 // Walk all of the objects in the main block first.
77 // Walk the other blocks (currently only TLABs).
|
| dlmalloc_space.cc | 235 void DlMallocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg),
308 // To allow the Walk/InspectAll() to exclusively-lock the mutator
313 Walk(MSpaceChunkCallback, &max_contiguous_allocation);
|
| rosalloc_space.cc | 262 void RosAllocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg),
|
| large_object_space.cc | 224 void LargeObjectMapSpace::Walk(DlMallocSpace::WalkCallback callback, void* arg) {
376 void FreeListSpace::Walk(DlMallocSpace::WalkCallback callback, void* arg) {
|
| /build/blueprint/ |
| context_test.go | 23 Walk() bool
50 func (f *fooModule) Walk() bool {
78 func (b *barModule) Walk() bool {
186 if dep.module.logicModule.(Walker).Walk() {
193 if dep.module.logicModule.(Walker).Walk() {
|
| /external/google-breakpad/src/processor/ |
| stackwalker.cc | 105 bool Stackwalker::Walk(
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 "
141 BPLOG(INFO) << "Stack walk is interrupted.";
|
| /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...] |
| /prebuilts/go/darwin-x86/src/path/filepath/ |
| path.go | 332 // visited by Walk. The path argument contains the argument to Walk as a
333 // prefix; that is, if Walk is called with "dir", which is a directory
334 // containing the file "a", the walk function will be called with argument
339 // to handle that error (and Walk will not descend into that directory). If
342 // on a directory, Walk skips the directory's contents entirely.
344 // Walk skips the remaining files in the containing directory.
349 // walk recursively descends path, calling w.
350 func walk(path string, info os.FileInfo, walkFn WalkFunc) error { func
376 err = walk(filename, fileInfo, walkFn
[all...] |
| /prebuilts/go/linux-x86/src/path/filepath/ |
| path.go | 332 // visited by Walk. The path argument contains the argument to Walk as a
333 // prefix; that is, if Walk is called with "dir", which is a directory
334 // containing the file "a", the walk function will be called with argument
339 // to handle that error (and Walk will not descend into that directory). If
342 // on a directory, Walk skips the directory's contents entirely.
344 // Walk skips the remaining files in the containing directory.
349 // walk recursively descends path, calling w.
350 func walk(path string, info os.FileInfo, walkFn WalkFunc) error { func
376 err = walk(filename, fileInfo, walkFn
[all...] |
| /art/runtime/gc/accounting/ |
| space_bitmap-inl.h | 160 void SpaceBitmap<kAlignment>::Walk(Visitor&& visitor) {
|
| /device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/ |
| BaseOrderedCollectionRedBlackTreeLib.c | 308 RED_BLACK_TREE_NODE *Walk;
319 Walk = Node->Right;
320 if (Walk != NULL) {
321 while (Walk->Left != NULL) {
322 Walk = Walk->Left;
324 return Walk;
332 Walk = Child->Parent;
333 while (Walk != NULL && Child == Walk->Right) {
[all...] |
| /prebuilts/go/darwin-x86/src/net/ |
| dnsmsg.go | 10 // Each message structure has a Walk method that is used by
74 // Walk iterates over fields of a structure and calls f
80 // Whenever f returns false, Walk must stop and return
82 Walk(f func(v interface{}, name, tag string) (ok bool)) (ok bool)
92 func (h *dnsHeader) Walk(f func(v interface{}, name, tag string) bool) bool {
117 func (q *dnsQuestion) Walk(f func(v interface{}, name, tag string) bool) bool {
138 func (h *dnsRR_Header) Walk(f func(v interface{}, name, tag string) bool) bool {
162 func (rr *dnsRR_CNAME) Walk(f func(v interface{}, name, tag string) bool) bool {
163 return rr.Hdr.Walk(f) && f(&rr.Cname, "Cname", "domain")
176 func (rr *dnsRR_MX) Walk(f func(v interface{}, name, tag string) bool) bool
[all...] |
| /prebuilts/go/linux-x86/src/net/ |
| dnsmsg.go | 10 // Each message structure has a Walk method that is used by
74 // Walk iterates over fields of a structure and calls f
80 // Whenever f returns false, Walk must stop and return
82 Walk(f func(v interface{}, name, tag string) (ok bool)) (ok bool)
92 func (h *dnsHeader) Walk(f func(v interface{}, name, tag string) bool) bool {
117 func (q *dnsQuestion) Walk(f func(v interface{}, name, tag string) bool) bool {
138 func (h *dnsRR_Header) Walk(f func(v interface{}, name, tag string) bool) bool {
162 func (rr *dnsRR_CNAME) Walk(f func(v interface{}, name, tag string) bool) bool {
163 return rr.Hdr.Walk(f) && f(&rr.Cname, "Cname", "domain")
176 func (rr *dnsRR_MX) Walk(f func(v interface{}, name, tag string) bool) bool
[all...] |
| /art/oatdump/ |
| oatdump.cc | 179 Walk();
204 void Walk() {
246 // Note: even if this is an interface or a native class, we still have to walk it, as there
[all...] |
