Searched refs:visiting (Results 1 - 9 of 9) sorted by relevance
| /third_party/libabigail/src/ |
| H A D | abg-traverse.cc | 28 priv(bool visiting = false) in priv()
29 : visiting_(visiting) in priv()
43 /// visiting. During the visiting of the node (and of its children)
48 traversable_base::visiting() const in visiting() function in abigail::ir::traversable_base
54 /// This is the setter of the "visiting" flag of the node being
59 /// @param f the new value of the "visiting" flag.
61 traversable_base::visiting(bool f) in visiting() function in abigail::ir::traversable_base
|
| H A D | abg-ir.cc | 8077 if (visiting()) in traverse()
8082 visiting(true); in traverse()
8089 visiting(false); in traverse()
15419 /// Traverses an instance of @ref scope_type_decl, visiting all the
15434 if (visiting()) in traverse()
15442 visiting(true); in traverse()
15449 visiting(false); in traverse()
15572 if (visiting()) in traverse()
15577 visiting(true); in traverse()
15589 visiting(fals in traverse()
[all...] |
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/ |
| H A D | CallDAG.cpp | 90 : definitionNode(nullptr), name(""), index(0), indexAssigned(false), visiting(false) in CreatorFunctionData()
98 bool visiting; member
163 // recursion we need to know which functions we are currently visiting. For that reason in assignIndicesInternal()
165 // [F visiting = true, subset of F callees with visiting = false] and the following in assignIndicesInternal()
167 // This way we can remember when we started visiting a function, to put visiting back in assignIndicesInternal()
180 if (function->visiting) in assignIndicesInternal()
182 function->visiting = false; in assignIndicesInternal()
204 function->visiting in assignIndicesInternal()
[all...] |
| /third_party/musl/scripts/ |
| H A D | print_so_deps.py | 37 self.visiting = []
152 self.visiting.append(so_name)
154 while len(self.visiting) > 0:
155 cur = self.visiting.pop(0)
167 self.visiting.extend(deps)
|
| /third_party/libabigail/include/ |
| H A D | abg-traverse.h | 47 bool visiting() const;
49 void visiting(bool f);
|
| /third_party/node/tools/gyp/pylib/gyp/ |
| H A D | common.py | 618 visiting = set()
622 if node in visiting:
623 raise CycleError(visiting)
627 visiting.add(node)
630 visiting.remove(node)
|
| /third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/ |
| H A D | common.py | 612 visiting = set()
616 if node in visiting:
617 raise CycleError(visiting)
621 visiting.add(node)
624 visiting.remove(node)
|
| /third_party/rust/crates/regex/regex-syntax/src/ast/ |
| H A D | visitor.rs | 5 /// A trait for visiting an abstract syntax tree (AST) in depth first order.
24 /// The result of visiting an AST.
26 /// An error that visiting an AST might return.
30 /// yields the result of visiting the AST or an error.
117 /// If the visitor returns an error at any point, then visiting is stopped and
144 /// The stack frame used while visiting every child node of a concatenation
147 /// The child node we are currently visiting.
152 /// The stack frame used while visiting every child node of an alternation
155 /// The child node we are currently visiting.
165 /// The stack frame used while visiting ever
[all...] |
| /third_party/rust/crates/regex/regex-syntax/src/hir/ |
| H A D | visitor.rs | 3 /// A trait for visiting the high-level IR (HIR) in depth first order.
14 /// The result of visiting an HIR.
16 /// An error that visiting an HIR might return.
20 /// yields the result of visiting the HIR or an error.
57 /// If the visitor returns an error at any point, then visiting is stopped and
80 /// The stack frame used while visiting every child node of a concatenation
83 /// The child node we are currently visiting.
88 /// The stack frame used while visiting every child node of an alternation
91 /// The child node we are currently visiting.
140 // Otherwise, we've finished visiting al in visit()
[all...] |
Completed in 26 milliseconds