HomeSort by relevance Sort by last modified time
    Searched refs:Traversal (Results 1 - 12 of 12) sorted by null

  /external/webkit/Source/WebCore/dom/
Traversal.cpp 26 #include "Traversal.h"
33 Traversal::Traversal(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> nodeFilter, bool expandEntityReferences)
41 short Traversal::acceptNode(ScriptState* state, Node* node) const
Traversal.h 36 class Traversal {
44 Traversal(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilter>, bool expandEntityReferences);
NodeIterator.h 29 #include "Traversal.h"
37 class NodeIterator : public RefCounted<NodeIterator>, public Traversal {
TreeWalker.h 29 #include "Traversal.h"
37 class TreeWalker : public RefCounted<TreeWalker>, public Traversal {
NodeIterator.cpp 75 : Traversal(rootNode, whatToShow, filter, expandEntityReferences)
TreeWalker.cpp 37 : Traversal(rootNode, whatToShow, filter, expandEntityReferences)
  /external/chromium/chrome/browser/sync/engine/
change_reorder_buffer.cc 23 // Traversal provides a way to collect a set of nodes from the syncable
26 // Traversal starts out empty and is grown by means of the ExpandToInclude
29 class ChangeReorderBuffer::Traversal {
34 Traversal() : top_(kInvalidId) { }
36 // Expand the traversal so that it includes the node indicated by
55 // upwards from |top_| to unite the original traversal with the
80 // Return the top node of the traversal. Use this as a starting point
84 // Return an iterator corresponding to the first child (in the traversal)
93 // Return an iterator corresponding to the last child in the traversal
100 // The topmost point in the directory hierarchy that is in the traversal,
132 Traversal traversal; local
    [all...]
change_reorder_buffer.h 96 class Traversal;
  /external/llvm/lib/Analysis/
LoopInfo.cpp 350 // Perform a post order CFG traversal of all blocks within this loop,
352 LoopBlocksTraversal Traversal(DFS, LI);
353 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
354 POE = Traversal.end(); POI != POE; ++POI) {
373 // the DFS result cached by Traversal.
617 /// visit blocks during the initial traversal.
619 LoopBlocksTraversal Traversal(*this, LI);
620 for (LoopBlocksTraversal::POTIterator POI = Traversal.begin(),
621 POE = Traversal.end(); POI != POE; ++POI) ;
  /external/mdnsresponder/mDNSCore/
mDNSEmbeddedAPI.h     [all...]
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/webkit/Source/WebCore/
Android.mk 205 dom/Traversal.cpp \
    [all...]

Completed in 1640 milliseconds