HomeSort by relevance Sort by last modified time
    Searched full:traversal (Results 151 - 175 of 1617) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/ipsec-tools/src/racoon/doc/
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/python/cpython3/Modules/clinic/
_gdbmmodule.c.h 106 "Return the starting key for the traversal.\n"
109 "and the nextkey() method. The traversal is ordered by GDBM\'s internal\n"
128 "Returns the key that follows key in the traversal.\n"
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 25 /// A RecursiveASTVisitor subclass that guarantees that AST traversal is
57 /// contained in the @implementation, so the traversal of all of the
149 "post-order traversal is not supported for lexically ordered "
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 25 /// A RecursiveASTVisitor subclass that guarantees that AST traversal is
57 /// contained in the @implementation, so the traversal of all of the
149 "post-order traversal is not supported for lexically ordered "
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 25 /// A RecursiveASTVisitor subclass that guarantees that AST traversal is
57 /// contained in the @implementation, so the traversal of all of the
149 "post-order traversal is not supported for lexically ordered "
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 25 /// A RecursiveASTVisitor subclass that guarantees that AST traversal is
57 /// contained in the @implementation, so the traversal of all of the
149 "post-order traversal is not supported for lexically ordered "
  /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 25 /// A RecursiveASTVisitor subclass that guarantees that AST traversal is
57 /// contained in the @implementation, so the traversal of all of the
149 "post-order traversal is not supported for lexically ordered "
  /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 25 /// A RecursiveASTVisitor subclass that guarantees that AST traversal is
57 /// contained in the @implementation, so the traversal of all of the
149 "post-order traversal is not supported for lexically ordered "
  /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 25 /// A RecursiveASTVisitor subclass that guarantees that AST traversal is
57 /// contained in the @implementation, so the traversal of all of the
149 "post-order traversal is not supported for lexically ordered "
  /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/AST/
LexicallyOrderedRecursiveASTVisitor.h 25 /// A RecursiveASTVisitor subclass that guarantees that AST traversal is
57 /// contained in the @implementation, so the traversal of all of the
149 "post-order traversal is not supported for lexically ordered "
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/
pfkeyv2.h 199 /* This defines the TYPE of Nat Traversal in use. Currently only one
210 /* Pass a NAT Traversal port (Source or Dest port) */
353 /* The next four entries are for setting up NAT Traversal */
  /libcore/ojluni/src/main/java/java/util/
Spliterators.java 433 * <p>Traversal of elements should be accomplished through the spliterator.
434 * The behaviour of splitting and traversal is undefined if the iterator is
464 * <p>Traversal of elements should be accomplished through the spliterator.
465 * The behaviour of splitting and traversal is undefined if the iterator is
491 * <p>Traversal of elements should be accomplished through the spliterator.
492 * The behaviour of splitting and traversal is undefined if the iterator is
522 * <p>Traversal of elements should be accomplished through the spliterator.
523 * The behaviour of splitting and traversal is undefined if the iterator is
548 * <p>Traversal of elements should be accomplished through the spliterator.
549 * The behaviour of splitting and traversal is undefined if the iterator i
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DTMTreeWalker.java 97 /** Perform a non-recursive pre-order/post-order traversal,
102 * @param pos Node in the tree at which to start (and end) traversal --
147 /** Perform a non-recursive pre-order/post-order traversal,
152 * @param pos Node in the tree where to start traversal
153 * @param top Node in the tree where to end traversal.
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
SCCIterator.h 68 // A single "visit" within the non-recursive DFS traversal.
79 // The stack-based DFS traversal; defined below.
97 // Compute the next SCC using the DFS traversal.
121 // the DFS traversal till the next ++).
155 // Iterator traversal: forward iteration only
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
TreeWalker.java 125 * Perform a pre-order traversal non-recursive style.
129 * traversal, startDocument and endDocument will always be issued to the
132 * @param pos Node in the tree where to start traversal
180 * Perform a pre-order traversal non-recursive style.
184 * traversal, startDocument and endDocument will always be issued to the
187 * @param pos Node in the tree where to start traversal
188 * @param top Node in the tree where to end traversal
  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 354 // Perform a backward CFG traversal using a worklist.
389 // Continue traversal along predecessors that are not loop-back edges from
455 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
457 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
459 /// Block vectors are then populated during a single forward CFG traversal
463 /// 1) Discovered and mapped by a reverse CFG traversal.
464 /// 2) Visited during a forward DFS CFG traversal.
473 // Postorder traversal of the dominator tree.
494 // Perform a backward CFG traversal to discover and map blocks in this loop.
500 // Perform a single forward CFG traversal to populate block and subloo
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/
LoopInfoImpl.h 347 // Perform a backward CFG traversal using a worklist.
382 // Continue traversal along predecessors that are not loop-back edges from
446 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
448 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
450 /// Block vectors are then populated during a single forward CFG traversal
454 /// 1) Discovered and mapped by a reverse CFG traversal.
455 /// 2) Visited during a forward DFS CFG traversal.
464 // Postorder traversal of the dominator tree.
479 // Perform a backward CFG traversal to discover and map blocks in this loop.
485 // Perform a single forward CFG traversal to populate block and subloo
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/
LoopInfoImpl.h 347 // Perform a backward CFG traversal using a worklist.
382 // Continue traversal along predecessors that are not loop-back edges from
446 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
448 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
450 /// Block vectors are then populated during a single forward CFG traversal
454 /// 1) Discovered and mapped by a reverse CFG traversal.
455 /// 2) Visited during a forward DFS CFG traversal.
464 // Postorder traversal of the dominator tree.
479 // Perform a backward CFG traversal to discover and map blocks in this loop.
485 // Perform a single forward CFG traversal to populate block and subloo
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/
LoopInfoImpl.h 347 // Perform a backward CFG traversal using a worklist.
382 // Continue traversal along predecessors that are not loop-back edges from
446 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
448 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
450 /// Block vectors are then populated during a single forward CFG traversal
454 /// 1) Discovered and mapped by a reverse CFG traversal.
455 /// 2) Visited during a forward DFS CFG traversal.
464 // Postorder traversal of the dominator tree.
479 // Perform a backward CFG traversal to discover and map blocks in this loop.
485 // Perform a single forward CFG traversal to populate block and subloo
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/
LoopInfoImpl.h 347 // Perform a backward CFG traversal using a worklist.
382 // Continue traversal along predecessors that are not loop-back edges from
446 /// Analyze LoopInfo discovers loops during a postorder DominatorTree traversal
448 /// (discoverAndMapSubloop). The backward traversal skips inner subloops, so
450 /// Block vectors are then populated during a single forward CFG traversal
454 /// 1) Discovered and mapped by a reverse CFG traversal.
455 /// 2) Visited during a forward DFS CFG traversal.
464 // Postorder traversal of the dominator tree.
479 // Perform a backward CFG traversal to discover and map blocks in this loop.
485 // Perform a single forward CFG traversal to populate block and subloo
    [all...]
  /external/apache-xml/src/main/java/org/apache/xpath/axes/
MatchPatternIterator.java 38 * traversal against the LocationPath interpreted as a match pattern. This
49 /** The traversal axis from where the nodes will be filtered. */
52 /** The DTM inner traversal class, that corresponds to the super axis. */
  /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) \
  /external/iproute2/include/uapi/linux/
pfkeyv2.h 200 /* This defines the TYPE of Nat Traversal in use. Currently only one
211 /* Pass a NAT Traversal port (Source or Dest port) */
366 /* The next four entries are for setting up NAT Traversal */
  /external/jsoncpp/devtools/
antglob.py 13 # while doing the recursive traversal in the glob_impl method of glob function.
17 # while doing the recursive traversal in the glob_impl method of glob function.
21 # while doing the recursive traversal in the glob_impl method of glob function.
  /external/kernel-headers/original/uapi/linux/
pfkeyv2.h 200 /* This defines the TYPE of Nat Traversal in use. Currently only one
211 /* Pass a NAT Traversal port (Source or Dest port) */
366 /* The next four entries are for setting up NAT Traversal */

Completed in 1147 milliseconds

1 2 3 4 5 67 8 91011>>