| /external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
| D | ObjectGraphMeasurer.java | 198 @Override public Traversal visit(Chain chain) { in visit()
201 return Traversal.SKIP; in visit()
211 return Traversal.EXPLORE; in visit()
213 return Traversal.SKIP; in visit()
|
| D | ObjectVisitor.java | 43 Traversal visit(Chain chain); in visit()
55 enum Traversal { enum
|
| D | ObjectExplorer.java | 106 ObjectVisitor.Traversal traversal = visitor.visit(chain); in exploreObject()
|
| /external/clang/lib/ASTMatchers/ |
| D | ASTMatchFinder.cpp | 91 ASTMatchFinder::TraversalKind Traversal, in MatchChildASTVisitor() argument
98 Traversal(Traversal), in MatchChildASTVisitor()
149 if (Traversal == in TraverseStmt()
286 const ASTMatchFinder::TraversalKind Traversal; member in clang::ast_matchers::internal::__anon018ced360111::MatchChildASTVisitor
379 TraversalKind Traversal, BindKind Bind) { in memoizedMatchesRecursively() argument
382 return matchesRecursively(Node, Matcher, Builder, MaxDepth, Traversal, in memoizedMatchesRecursively()
400 MaxDepth, Traversal, Bind); in memoizedMatchesRecursively()
413 TraversalKind Traversal, BindKind Bind) { in matchesRecursively() argument
415 &Matcher, this, Builder, MaxDepth, Traversal, Bind); in matchesRecursively()
427 TraversalKind Traversal, in matchesChildOf() argument
[all …]
|
| /external/eigen/Eigen/src/Core/ |
| D | AssignEvaluator.h | 100 …Traversal = int(MayLinearVectorize) && (LinearPacketSize>InnerPacketSize) ? int(LinearVectorizedTr… enumerator
106 Vectorized = int(Traversal) == InnerVectorizedTraversal
107 || int(Traversal) == LinearVectorizedTraversal
108 || int(Traversal) == SliceVectorizedTraversal
111 …typedef typename conditional<int(Traversal)==LinearVectorizedTraversal, LinearPacketType, InnerPac…
115 ActualPacketSize = int(Traversal)==LinearVectorizedTraversal ? LinearPacketSize
127 …Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTrave…
133 : int(Traversal) == int(LinearVectorizedTraversal)
137 : int(Traversal) == int(LinearTraversal)
141 : int(Traversal) == int(SliceVectorizedTraversal)
[all …]
|
| D | Assign_MKL.h | 65 Traversal = MightLinearize ? LinearTraversal : DefaultTraversal enumerator
89 …if(vml_assign_traits<DstXprType,SrcXprNested>::Traversal==LinearTraversal) { …
150 …if(vml_assign_traits<DstXprType,SrcXprNested>::Traversal==LinearTraversal) …
|
| D | Redux.h | 47 Traversal = int(MayLinearVectorize) ? int(LinearVectorizedTraversal) enumerator
56 …UnrollingLimit = EIGEN_UNROLLING_LIMIT * (int(Traversal) == int(DefaultTraversal) ? 1 : int(Packet…
76 EIGEN_DEBUG_VAR(Traversal) in debug()
180 int Traversal = redux_traits<Func, Derived>::Traversal,
|
| D | ProductEvaluators.h | 430 template<int Traversal, int UnrollingIndex, typename Lhs, typename Rhs, typename RetScalar>
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | LoopInfo.cpp | 433 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents() local
434 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(), in updateBlockParents()
435 POE = Traversal.end(); POI != POE; ++POI) { in updateBlockParents()
702 LoopBlocksTraversal Traversal(*this, LI); in perform() local
703 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(), in perform()
704 POE = Traversal.end(); POI != POE; ++POI) ; in perform()
|
| /external/eigen/test/ |
| D | vectorization_logic.cpp | 33 bool res = traits::Traversal==traversal; in test_assign()
46 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_assign()
57 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_assign()
66 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_assign()
79 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_redux()
87 << " got " << demangle_traversal(traits::Traversal) << "\n"; in test_redux()
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 436 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents() local
437 for (BasicBlock *POI : Traversal) { in updateBlockParents()
726 LoopBlocksTraversal Traversal(*this, LI); in perform() local
727 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(), in perform()
728 POE = Traversal.end(); POI != POE; ++POI) ; in perform()
|
| /external/pdfium/xfa/fxfa/parser/ |
| D | xfa_basic_data_element_properties.cpp | 218 {XFA_Element::Traversal, 1, 0},
241 {XFA_Element::Traversal, 1, 0},
269 {XFA_Element::Traversal, 1, 0},
407 {XFA_Element::Traversal, 1, 0},
|
| D | xfa_basic_data.cpp | 321 {0x67fe7334, L"traversal", XFA_Element::Traversal,
|
| /external/ipsec-tools/src/racoon/doc/ |
| D | FAQ | 36 Enable NAT-Traversal. This needs kernel support, which is
37 available on Linux. On NetBSD, NAT-Traversal kernel support
41 using NAT-Traversal might infringe a patent.
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 134 enum Traversal { enum in BinaryTreeTraverserBenchmark
166 Traversal traversal;
|
| /external/ipsec-tools/src/racoon/samples/ |
| D | racoon.conf.sample-natt | 4 # This file can be used as a template for NAT-Traversal setups.
34 # whom it does NAT-Traversal.
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyTraverse.h | 53 class Traversal {
176 class VisitReducer : public Traversal<Self, VisitReducerBase>,
|
| /external/ipsec-tools/ |
| D | NEWS | 123 o Support for NAT Traversal (NAT-T)
|
| /external/pdfium/xfa/fxfa/app/ |
| D | xfa_ffpageview.cpp | 299 CXFA_Node* pTraversal = pAcc->GetNode()->GetChild(0, XFA_Element::Traversal); in GetTraverseWidget()
|
| /external/python/cpython2/Doc/c-api/ |
| D | gcsupport.rst | 126 Traversal function for a container object. Implementations must call the
|
| /external/pdfium/xfa/fxfa/ |
| D | fxfa_basic.h | 763 Traversal, enumerator
|
| /external/mdnsresponder/mDNSCore/ |
| D | mDNSEmbeddedAPI.h | 905 #pragma mark - NAT Traversal structures and constants
|
| D | uDNS.c | 416 #pragma mark - NAT Traversal
|
| /external/llvm/docs/ |
| D | ProgrammersManual.rst | 1762 Basic Inspection and Traversal Routines
|