| /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>,
|
| /external/libchrome/base/files/ |
| file_util_posix.cc | 220 FileEnumerator traversal(path, true,
223 for (FilePath current = traversal.Next(); success && !current.empty();
224 current = traversal.Next()) {
225 if (traversal.GetInfo().IsDirectory())
287 FileEnumerator traversal(from_path, recursive, traverse_type);
344 current = traversal.Next();
346 from_stat = traversal.GetInfo().stat();
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 482 // Perform a post order CFG traversal of all blocks within this loop,
484 LoopBlocksTraversal Traversal(DFS, LI);
485 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
486 POE = Traversal.end(); POI != POE; ++POI) {
505 // the DFS result cached by Traversal.
773 /// visit blocks during the initial traversal.
775 LoopBlocksTraversal Traversal(*this, LI);
776 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
777 POE = Traversal.end(); POI != POE; ++POI) ;
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedTransferQueue.java | 35 * of elements requires a traversal of the elements, and so may report
36 * inaccurate results if this collection is modified during traversal.
138 * traversal steps to locate the first and/or last unmatched
153 * costs of cache misses and risks of long traversal chains, while
161 * per-operation counter incremented on each traversal step, and
165 * with a given probability per traversal step.
178 * As an accompaniment to such techniques, traversal overhead can
198 * adds some further complexity to traversal: If any "next"
200 * has lagged behind a head-update, and so the traversal must
225 * traversal pointers except when the list has only one element
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/extensions/ |
| ExpressionContext.java | 27 import org.w3c.dom.traversal.NodeIterator;
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| AVTPart.java | 74 * @return true if traversal outside the context node's subtree can occur.
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| TransformState.java | 30 import org.w3c.dom.traversal.NodeIterator;
|
| XalanTransformState.java | 31 import org.w3c.dom.traversal.NodeIterator;
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| AxesWalker.java | 243 * traversal occurs relative to currentNode even if it is not part of the
245 * changing currentNode where no traversal is possible).
585 /** The traversal axis from where the nodes will be filtered. */
588 /** The DTM inner traversal class, that corresponds to the super axis. */
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| XNodeSetForDOM.java | 29 import org.w3c.dom.traversal.NodeIterator;
|
| /external/apache-xml/src/main/java/org/apache/xpath/operations/ |
| UnaryOperation.java | 59 * @return true if traversal outside the context node's subtree can occur.
|
| /external/chromium-trace/catapult/perf_insights/perf_insights/ |
| function_handle.py | 80 is serving, in order to prevent directory traversal attacks. In addition, we
|
| /external/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 164 // Sorts the CFGs blocks using a reverse post-order depth-first traversal.
181 // Performs a reverse topological traversal, starting from the exit block and
184 // before their post-dominator (because it's a reverse topological traversal).
189 // and no blocks are accessable via traversal of back-edges from the exit that
|
| /external/dbus-binding-generator/chromeos-dbus-bindings/ |
| xml_interface_parser.h | 128 // Tracks where in the element traversal our parse has taken us.
|
| /external/e2fsprogs/lib/ext2fs/ |
| ext3_extents.h | 59 * creation/lookup routines use it for traversal/splitting/etc
|
| /external/eigen/Eigen/src/Core/ |
| Redux.h | 46 Traversal = int(MayLinearVectorize) ? int(LinearVectorizedTraversal)
59 UnrollingLimit = EIGEN_UNROLLING_LIMIT * (int(Traversal) == int(DefaultTraversal) ? 1 : int(PacketSize))
163 int Traversal = redux_traits<Func, Derived>::Traversal,
|
| /external/libchrome/sandbox/linux/syscall_broker/ |
| broker_file_permission.h | 95 // * No /../ path traversal
|
| /external/libmicrohttpd/doc/chapters/ |
| sessions.inc | 61 Note that the example uses a simple, $O(n)$ linked list traversal to
|
| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 28 // visited nodes during the po_iterator's depth-first traversal.
33 // It is possible to prune the depth-first traversal in several ways:
37 // post-order traversal on a graph with nodes that aren't dominated by a
42 // confine a CFG traversal to blocks in a specific loop.
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| InlinerPass.h | 47 // processing to avoid breaking the SCC traversal.
|
| /external/skia/src/gpu/glsl/ |
| GrGLSLFragmentProcessor.cpp | 55 * traversal). Suppose procs A, B, C, D, E, F have 1, 2, 1, 1, 3, 2 transforms respectively.
|
| /external/v8/src/compiler/ |
| graph.h | 21 // Marks are used during traversal of the graph to distinguish states of nodes.
|
| /external/v8/tools/ |
| consarray.js | 30 * Constructs a ConsArray object. It is used mainly for tree traversal.
|
| /frameworks/base/core/java/android/view/ |
| ViewGroupOverlay.java | 46 * events and do not participate in focus traversal. Overlay views
|
