OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Walk
(Results
1 - 11
of
11
) sorted by null
/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
...]
/external/regex-re2/re2/
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);
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
...]
simplify.cc
100
// The simplify
walk
is purely post-recursive: given the simplified children,
149
return w.
Walk
(this, NULL);
159
// This should never be called, since we use
Walk
and not
regexp.cc
502
// Should never be called: we use
Walk
not WalkExponential.
514
w.
Walk
(this, 0);
546
// Should never be called: we use
Walk
not WalkExponential.
558
w.
Walk
(this, 0);
586
// Should never be called: we use
Walk
not WalkExponential.
598
w.
Walk
(this, 0);
/external/webkit/Source/WebCore/manual-tests/inspector-wrappers/
inspector-wrappers-test-utils.js
3
//
Walk
up the caller chain and try to find a reference to the Inspector's window
/external/chromium/chrome/browser/resources/net_internals/
loggrouper.js
66
//
Walk
up the parent stack to find the corresponding BEGIN for this END.
/external/clang/include/clang/AST/
RecursiveASTVisitor.h
81
/// 2. at a given node,
walk
up the class hierarchy, starting from
407
bool
Walk
(Stmt *S);
437
if (!
Walk
(CurrS)) return false;
458
bool RecursiveASTVisitor<Derived>::
Walk
(Stmt *S) {
[
all
...]
/external/chromium/chrome/common/extensions/docs/examples/extensions/proxy_configuration/
proxy_form_controller.js
430
//
Walk
up the tree until we hit `form > fieldset` or fall off the top
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tree.pas
365
///
walk
recursively from start until stop. You can always return
721
///
Walk
tree with depth-first-search and fill nodes buffer.
[
all
...]
Antlr.Runtime.pas
[
all
...]
Completed in 733 milliseconds