HomeSort by relevance Sort by last modified time
    Searched full:traversal (Results 51 - 75 of 888) sorted by null

1 23 4 5 6 7 8 91011>>

  /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/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
Graph.java 71 * the post-order DFA traversal. Amazingly simple but true.
78 * So if this gives nonreversed postorder traversal, I get the order
  /external/eigen/Eigen/src/SparseLU/
SparseLU_relax_snode.h 60 // Identify the relaxed supernodes by postorder traversal of the etree
76 } // End postorder traversal of the etree
  /external/ipsec-tools/src/racoon/
genlist.h 63 * NULL the list traversal continues, once it returns non-NULL (usually the
64 * 'entry' arg), the list traversal exits and the return value is returned
  /external/ipsec-tools/src/racoon/samples/
racoon.conf.sample-natt 4 # This file can be used as a template for NAT-Traversal setups.
34 # whom it does NAT-Traversal.
  /external/curl/tests/data/
test2016 38 Metalink local XML file, attempt Unix path traversal
test2017 38 Metalink local XML file, attempt Unix home path traversal
  /external/iptables/extensions/
libxt_LOG.man 8 This is a "non-terminating target", i.e. rule traversal continues at
libxt_NFLOG.man 9 non-terminating target, i.e. rule traversal continues at the next rule.
  /external/kernel-headers/original/uapi/linux/
fcntl.h 63 #define AT_NO_AUTOMOUNT 0x800 /* Suppress terminal automount traversal */
  /external/llvm/include/llvm/Analysis/
LoopIterator.h 13 // allow skipping subloops during traversal.
51 /// to nonzero after it is finished by postorder traversal.
124 /// Graph traversal iterator.
135 /// Postorder traversal over the graph. This only needs to be done once.
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...]
  /external/llvm/test/CodeGen/ARM/
2011-04-27-IfCvtBug.ll 6 ; traversal of all BBs work just fine.
  /frameworks/compile/mclinker/unittests/
BinTreeTest.h 24 * \brief Make sure the interface of BinTree , such as insert , traversal ,
  /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/
fix_renames.py 46 order = "pre" # Pre-order tree traversal
  /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/
fix_renames.py 46 order = "pre" # Pre-order tree traversal
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_renames.py 46 order = "pre" # Pre-order tree traversal
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_renames.py 46 order = "pre" # Pre-order tree traversal
  /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.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-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) */
352 /* The next four entries are for setting up NAT Traversal */
  /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/chromium-trace/catapult/telemetry/third_party/altgraph/doc/
graph.rst 195 Graph traversal
233 Yield nodes in a depth first traversal starting at the *start*
236 If *end* is specified traversal stops when reaching that node.
243 Yield the associated data for nodes in a depth first traversal
247 If *end* is specified traversal stops when reaching that node.
  /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

Completed in 648 milliseconds

1 23 4 5 6 7 8 91011>>