| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| PostOrderIterator.h | 31 // visited nodes during the po_iterator's depth-first traversal.
36 // It is possible to prune the depth-first traversal in several ways:
40 // post-order traversal on a graph with nodes that aren't dominated by a
45 // confine a CFG traversal to blocks in a specific loop.
271 // Because it does the traversal in its constructor, it won't invalidate when
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| PostOrderIterator.h | 31 // visited nodes during the po_iterator's depth-first traversal.
36 // It is possible to prune the depth-first traversal in several ways:
40 // post-order traversal on a graph with nodes that aren't dominated by a
45 // confine a CFG traversal to blocks in a specific loop.
271 // Because it does the traversal in its constructor, it won't invalidate when
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| PostOrderIterator.h | 31 // visited nodes during the po_iterator's depth-first traversal.
36 // It is possible to prune the depth-first traversal in several ways:
40 // post-order traversal on a graph with nodes that aren't dominated by a
45 // confine a CFG traversal to blocks in a specific loop.
271 // Because it does the traversal in its constructor, it won't invalidate when
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| PostOrderIterator.h | 31 // visited nodes during the po_iterator's depth-first traversal.
36 // It is possible to prune the depth-first traversal in several ways:
40 // post-order traversal on a graph with nodes that aren't dominated by a
45 // confine a CFG traversal to blocks in a specific loop.
271 // Because it does the traversal in its constructor, it won't invalidate when
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| PostOrderIterator.h | 31 // visited nodes during the po_iterator's depth-first traversal.
36 // It is possible to prune the depth-first traversal in several ways:
40 // post-order traversal on a graph with nodes that aren't dominated by a
45 // confine a CFG traversal to blocks in a specific loop.
271 // Because it does the traversal in its constructor, it won't invalidate when
|
| /prebuilts/tools/common/m2/repository/xml-apis/xml-apis/1.3.04/ |
| xml-apis-1.3.04-sources.jar | |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 358 // Perform a backward CFG traversal using a worklist.
393 // Continue traversal along predecessors that are not loop-back edges from
459 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
461 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
463 /// Block vectors are then populated during a single forward CFG traversal
467 /// 1) Discovered and mapped by a reverse CFG traversal.
468 /// 2) Visited during a forward DFS CFG traversal.
477 // Postorder traversal of the dominator tree.
498 // Perform a backward CFG traversal to discover and map blocks in this loop.
504 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| LoopInfoImpl.h | 371 // Perform a backward CFG traversal using a worklist.
405 // Continue traversal along predecessors that are not loop-back edges from
468 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
470 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
472 /// Block vectors are then populated during a single forward CFG traversal
476 /// 1) Discovered and mapped by a reverse CFG traversal.
477 /// 2) Visited during a forward DFS CFG traversal.
484 // Postorder traversal of the dominator tree.
499 // Perform a backward CFG traversal to discover and map blocks in this loop.
505 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| LoopInfoImpl.h | 371 // Perform a backward CFG traversal using a worklist.
405 // Continue traversal along predecessors that are not loop-back edges from
468 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
470 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
472 /// Block vectors are then populated during a single forward CFG traversal
476 /// 1) Discovered and mapped by a reverse CFG traversal.
477 /// 2) Visited during a forward DFS CFG traversal.
484 // Postorder traversal of the dominator tree.
499 // Perform a backward CFG traversal to discover and map blocks in this loop.
505 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| LoopInfoImpl.h | 371 // Perform a backward CFG traversal using a worklist.
405 // Continue traversal along predecessors that are not loop-back edges from
468 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
470 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
472 /// Block vectors are then populated during a single forward CFG traversal
476 /// 1) Discovered and mapped by a reverse CFG traversal.
477 /// 2) Visited during a forward DFS CFG traversal.
484 // Postorder traversal of the dominator tree.
499 // Perform a backward CFG traversal to discover and map blocks in this loop.
505 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| LoopInfoImpl.h | 371 // Perform a backward CFG traversal using a worklist.
405 // Continue traversal along predecessors that are not loop-back edges from
468 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
470 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
472 /// Block vectors are then populated during a single forward CFG traversal
476 /// 1) Discovered and mapped by a reverse CFG traversal.
477 /// 2) Visited during a forward DFS CFG traversal.
484 // Postorder traversal of the dominator tree.
499 // Perform a backward CFG traversal to discover and map blocks in this loop.
505 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 358 // Perform a backward CFG traversal using a worklist.
393 // Continue traversal along predecessors that are not loop-back edges from
459 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
461 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
463 /// Block vectors are then populated during a single forward CFG traversal
467 /// 1) Discovered and mapped by a reverse CFG traversal.
468 /// 2) Visited during a forward DFS CFG traversal.
477 // Postorder traversal of the dominator tree.
498 // Perform a backward CFG traversal to discover and map blocks in this loop.
504 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| LoopInfoImpl.h | 371 // Perform a backward CFG traversal using a worklist.
405 // Continue traversal along predecessors that are not loop-back edges from
468 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
470 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
472 /// Block vectors are then populated during a single forward CFG traversal
476 /// 1) Discovered and mapped by a reverse CFG traversal.
477 /// 2) Visited during a forward DFS CFG traversal.
484 // Postorder traversal of the dominator tree.
499 // Perform a backward CFG traversal to discover and map blocks in this loop.
505 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| LoopInfoImpl.h | 371 // Perform a backward CFG traversal using a worklist.
405 // Continue traversal along predecessors that are not loop-back edges from
468 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
470 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
472 /// Block vectors are then populated during a single forward CFG traversal
476 /// 1) Discovered and mapped by a reverse CFG traversal.
477 /// 2) Visited during a forward DFS CFG traversal.
484 // Postorder traversal of the dominator tree.
499 // Perform a backward CFG traversal to discover and map blocks in this loop.
505 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| LoopInfoImpl.h | 371 // Perform a backward CFG traversal using a worklist.
405 // Continue traversal along predecessors that are not loop-back edges from
468 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
470 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
472 /// Block vectors are then populated during a single forward CFG traversal
476 /// 1) Discovered and mapped by a reverse CFG traversal.
477 /// 2) Visited during a forward DFS CFG traversal.
484 // Postorder traversal of the dominator tree.
499 // Perform a backward CFG traversal to discover and map blocks in this loop.
505 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| LoopInfoImpl.h | 371 // Perform a backward CFG traversal using a worklist.
405 // Continue traversal along predecessors that are not loop-back edges from
468 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
470 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
472 /// Block vectors are then populated during a single forward CFG traversal
476 /// 1) Discovered and mapped by a reverse CFG traversal.
477 /// 2) Visited during a forward DFS CFG traversal.
484 // Postorder traversal of the dominator tree.
499 // Perform a backward CFG traversal to discover and map blocks in this loop.
505 // Perform a single forward CFG traversal to populate block and subloo
[all...] |
| /external/mdnsresponder/mDNSCore/ |
| uDNS.c | 416 #pragma mark - NAT Traversal
554 mDNSexport mStatus mDNS_StartNATOperation_internal(mDNS *const m, NATTraversalInfo *traversal)
558 LogInfo("mDNS_StartNATOperation_internal %p Protocol %d IntPort %d RequestedPort %d NATLease %d", traversal,
559 traversal->Protocol, mDNSVal16(traversal->IntPort), mDNSVal16(traversal->RequestedPort), traversal->NATLease);
561 // Note: It important that new traversal requests are appended at the *end* of the list, not prepended at the start
564 if (traversal == *n)
566 LogMsg("Error! Tried to add a NAT traversal that's already in the active list: request %p Prot %d Int %d TTL %d"
[all...] |
| /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>,
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/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>,
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/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>,
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/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>,
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/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>,
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/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>,
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/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>,
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/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>,
|
