| /external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
| ObjectVisitor.java | 20 * A visitor that controls an object traversal. Implementations
39 * @return {@link Traversal#EXPLORE} to denote that the visited object
40 * should be further explored, or {@link Traversal#SKIP} to avoid
43 Traversal visit(Chain chain);
47 * graph traversal).
52 * Constants that denote how the traversal of a given object (chain)
55 enum Traversal {
|
| ObjectGraphMeasurer.java | 170 * to forbid the traversal to traverse the given object
198 @Override public Traversal visit(Chain chain) {
201 return Traversal.SKIP;
211 return Traversal.EXPLORE;
213 return Traversal.SKIP;
|
| ObjectExplorer.java | 39 * A depth-first object graph explorer. The traversal starts at a root (an
41 * primitive value, excluding static fields from the traversal. The traversal
44 * also return a value at the end of the traversal.
52 * {@link ObjectVisitor} to both control the traversal and return a value.
57 * @param <T> the type of the value obtained (after the traversal) by the
64 * traversal
74 * {@link ObjectVisitor} to both control the traversal and return a value.
88 * @param <T> the type of the value obtained (after the traversal) by the
95 * @return whatever value is returned by the visitor at the end of the traversal
106 ObjectVisitor.Traversal traversal = visitor.visit(chain); local
[all...] |
| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_traversal.cpp | 22 constexpr wchar_t kName[] = L"traversal";
31 XFA_Element::Traversal,
|
| cxfa_draw.cpp | 17 {XFA_Element::Assist, 1, 0}, {XFA_Element::Traversal, 1, 0},
|
| cxfa_exclgroup.cpp | 17 {XFA_Element::Traversal, 1, 0}, {XFA_Element::Validate, 1, 0},
|
| cxfa_field.cpp | 18 {XFA_Element::Traversal, 1, 0}, {XFA_Element::Keep, 1, 0},
|
| cxfa_subform.cpp | 17 {XFA_Element::Assist, 1, 0}, {XFA_Element::Traversal, 1, 0},
|
| cxfa_node_statics.cpp | 466 {0x67fe7334 /* traversal */, XFA_Element::Traversal},
[all...] |
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 91 ASTMatchFinder::TraversalKind Traversal,
98 Traversal(Traversal),
149 if (Traversal ==
202 // Used for updating the depth during traversal.
242 // Returns 'true' if traversal should continue after this function
270 // traversal should continue after this function returns.
286 const ASTMatchFinder::TraversalKind Traversal;
291 // Controls the outermost traversal of the AST and allows to match multiple
379 TraversalKind Traversal, BindKind Bind)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Assign_MKL.h | 65 Traversal = MightLinearize ? LinearTraversal : DefaultTraversal
89 if(vml_assign_traits<DstXprType,SrcXprNested>::Traversal==LinearTraversal) { \
150 if(vml_assign_traits<DstXprType,SrcXprNested>::Traversal==LinearTraversal) \
|
| AssignEvaluator.h | 22 * Part 1 : the logic deciding a strategy for traversal and unrolling *
58 // TODO distinguish between linear traversal and inner-traversals
100 Traversal = int(MayLinearVectorize) && (LinearPacketSize>InnerPacketSize) ? int(LinearVectorizedTraversal)
106 Vectorized = int(Traversal) == InnerVectorizedTraversal
107 || int(Traversal) == LinearVectorizedTraversal
108 || int(Traversal) == SliceVectorizedTraversal
111 typedef typename conditional<int(Traversal)==LinearVectorizedTraversal, LinearPacketType, InnerPacketType>::type PacketType;
115 ActualPacketSize = int(Traversal)==LinearVectorizedTraversal ? LinearPacketSize
127 Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTraversal)
[all...] |
| Redux.h | 47 Traversal = int(MayLinearVectorize) ? int(LinearVectorizedTraversal)
56 UnrollingLimit = EIGEN_UNROLLING_LIMIT * (int(Traversal) == int(DefaultTraversal) ? 1 : int(PacketSize))
76 EIGEN_DEBUG_VAR(Traversal)
180 int Traversal = redux_traits<Func, Derived>::Traversal,
|
| ProductEvaluators.h | 430 template<int Traversal, int UnrollingIndex, typename Lhs, typename Rhs, typename RetScalar>
[all...] |
| /external/eigen/test/ |
| vectorization_logic.cpp | 30 bool test_assign(const Dst&, const Src&, int traversal, int unrolling)
33 bool res = traits::Traversal==traversal;
45 std::cerr << " Expected Traversal == " << demangle_traversal(traversal)
46 << " got " << demangle_traversal(traits::Traversal) << "\n";
54 bool test_assign(int traversal, int unrolling)
57 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling;
65 std::cerr << " Expected Traversal == " << demangle_traversal(traversal
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| LoopInfo.cpp | 431 // Perform a post order CFG traversal of all blocks within this loop,
433 LoopBlocksTraversal Traversal(DFS, LI);
434 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
435 POE = Traversal.end(); POI != POE; ++POI) {
454 // the DFS result cached by Traversal.
700 /// visit blocks during the initial traversal.
702 LoopBlocksTraversal Traversal(*this, LI);
703 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
704 POE = Traversal.end(); POI != POE; ++POI) ;
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| BinaryTreeTraverserBenchmark.java | 134 enum Traversal {
166 Traversal traversal; field in class:BinaryTreeTraverserBenchmark
176 this.view = traversal.view(
181 @Benchmark int traversal(int reps) { method in class:BinaryTreeTraverserBenchmark
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| ReachingDefAnalysis.cpp | 151 LoopTraversal Traversal;
152 LoopTraversal::TraversalOrder TraversedMBBOrder = Traversal.traverse(mf);
|
| ExecutionDomainFix.cpp | 456 LoopTraversal Traversal;
457 LoopTraversal::TraversalOrder TraversedMBBOrder = Traversal.traverse(mf);
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 434 // Perform a post order CFG traversal of all blocks within this loop,
436 LoopBlocksTraversal Traversal(DFS, LI);
437 for (BasicBlock *POI : Traversal) {
456 // the DFS result cached by Traversal.
724 /// visit blocks during the initial traversal.
726 LoopBlocksTraversal Traversal(*this, LI);
727 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
728 POE = Traversal.end(); POI != POE; ++POI) ;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| LoopInfo.cpp | 431 // Perform a post order CFG traversal of all blocks within this loop,
433 LoopBlocksTraversal Traversal(DFS, LI);
434 for (BasicBlock *POI : Traversal) {
452 // the DFS result cached by Traversal.
763 /// visit blocks during the initial traversal.
765 LoopBlocksTraversal Traversal(*this, LI);
766 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
767 POE = Traversal.end();
|
| /external/pdfium/xfa/fxfa/ |
| cxfa_ffpageview.cpp | 314 0, XFA_Element::Traversal, false);
|
| fxfa_basic.h | 764 Traversal,
|
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTraverse.h | 40 // A visitor can control the traversal by overriding the following methods:
48 // The reduceX methods control the kind of traversal (visitor, copy, etc.).
53 class Traversal {
106 // R_Ctx defines a "context" for the traversal, which encodes information
130 // R_SExpr is the result type for a traversal.
173 // Implements a traversal that visits each subexpression, and returns either
176 class VisitReducer : public Traversal<Self, VisitReducerBase>,
|
| /external/mdnsresponder/mDNSCore/ |
| mDNSEmbeddedAPI.h | [all...] |
