HomeSort by relevance Sort by last modified time
    Searched refs:InsertionPoint (Results 1 - 25 of 34) sorted by null

1 2

  /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
ShadowRootRareData.h 34 #include "core/dom/shadow/InsertionPoint.h"
52 void didAddInsertionPoint(InsertionPoint*);
53 void didRemoveInsertionPoint(InsertionPoint*);
66 const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& descendantInsertionPoints() { return m_descendantInsertionPoints; }
67 void setDescendantInsertionPoints(WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& list) { m_descendantInsertionPoints.swap(list); }
85 WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> > m_descendantInsertionPoints;
89 inline void ShadowRootRareData::didAddInsertionPoint(InsertionPoint* point)
100 inline void ShadowRootRareData::didRemoveInsertionPoint(InsertionPoint* point)
InsertionPoint.cpp 32 #include "core/dom/shadow/InsertionPoint.h"
44 InsertionPoint::InsertionPoint(const QualifiedName& tagName, Document& document)
51 InsertionPoint::~InsertionPoint()
55 void InsertionPoint::setDistribution(ContentDistribution& distribution)
98 void InsertionPoint::attach(const AttachContext& context)
112 void InsertionPoint::detach(const AttachContext& context)
120 void InsertionPoint::willRecalcStyle(StyleRecalcChange change)
128 bool InsertionPoint::shouldUseFallbackElements() cons
    [all...]
InsertionPoint.h 41 class InsertionPoint : public HTMLElement {
43 virtual ~InsertionPoint();
73 InsertionPoint(const QualifiedName&, Document&);
85 typedef WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> > DestinationInsertionPoints;
87 DEFINE_ELEMENT_TYPE_CASTS(InsertionPoint, isInsertionPoint());
113 const InsertionPoint* resolveReprojection(const Node*);
115 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>& results);
ElementShadow.h 30 #include "core/dom/shadow/InsertionPoint.h"
67 const InsertionPoint* finalDestinationInsertionPointFor(const Node*) const;
70 void didDistributeNode(const Node*, InsertionPoint*);
85 void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*);
ShadowRoot.h 42 class InsertionPoint;
103 void didAddInsertionPoint(InsertionPoint*);
104 void didRemoveInsertionPoint(InsertionPoint*);
105 const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& descendantInsertionPoints();
ComposedTreeWalker.cpp 72 const InsertionPoint* insertionPoint = toInsertionPoint(node);
73 if (Node* found = traverseDistributedNodes(direction == TraversalDirectionForward ? insertionPoint->first() : insertionPoint->last(), insertionPoint, direction))
79 Node* ComposedTreeWalker::traverseDistributedNodes(const Node* node, const InsertionPoint* insertionPoint, TraversalDirection direction)
81 for (const Node* next = node; next; next = (direction == TraversalDirectionForward ? insertionPoint->nextTo(next) : insertionPoint->previousTo(next))) {
95 const InsertionPoint* insertionPoint = resolveReprojection(node)
    [all...]
ShadowRoot.cpp 38 #include "core/dom/shadow/InsertionPoint.h"
172 Node::InsertionNotificationRequest ShadowRoot::insertedInto(ContainerNode* insertionPoint)
174 DocumentFragment::insertedInto(insertionPoint);
176 if (!insertionPoint->inDocument() || !isOldest())
193 void ShadowRoot::removedFrom(ContainerNode* insertionPoint)
195 if (insertionPoint->inDocument() && m_registeredWithParentShadowRoot) {
198 root = insertionPoint->containingShadowRoot();
204 DocumentFragment::removedFrom(insertionPoint);
213 if (InsertionPoint* point = shadowInsertionPointOfYoungerShadowRoot()) {
271 void ShadowRoot::didAddInsertionPoint(InsertionPoint* insertionPoint
    [all...]
ElementShadow.cpp 47 void distributeTo(InsertionPoint*, ElementShadow*);
73 InsertionPoint* insertionPoint = toInsertionPoint(child);
74 for (size_t i = 0; i < insertionPoint->size(); ++i)
75 m_nodes.append(insertionPoint->at(i));
84 void DistributionPool::distributeTo(InsertionPoint* insertionPoint, ElementShadow* elementShadow)
92 if (isHTMLContentElement(*insertionPoint) && !toHTMLContentElement(insertionPoint)->canSelectNode(m_nodes, i))
97 elementShadow->didDistributeNode(node, insertionPoint);
    [all...]
ComposedTreeWalker.h 31 #include "core/dom/shadow/InsertionPoint.h"
107 static Node* traverseDistributedNodes(const Node*, const InsertionPoint*, TraversalDirection);
  /external/chromium_org/third_party/WebKit/Source/core/dom/
NodeRenderingTraversal.h 34 class InsertionPoint;
45 const InsertionPoint* insertionPoint() const { return m_insertionPoint; }
47 void didTraverseInsertionPoint(const InsertionPoint*);
55 const InsertionPoint* m_insertionPoint;
NodeRenderingTraversal.cpp 48 void ParentDetails::didTraverseInsertionPoint(const InsertionPoint* insertionPoint)
51 m_insertionPoint = insertionPoint;
Node.cpp 60 #include "core/dom/shadow/InsertionPoint.h"
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLShadowElement.h 34 #include "core/dom/shadow/InsertionPoint.h"
39 class HTMLShadowElement FINAL : public InsertionPoint {
48 virtual InsertionNotificationRequest insertedInto(ContainerNode* insertionPoint) OVERRIDE;
HTMLShadowElement.cpp 42 : InsertionPoint(HTMLNames::shadowTag, document)
69 Node::InsertionNotificationRequest HTMLShadowElement::insertedInto(ContainerNode* insertionPoint)
71 if (insertionPoint->inDocument()) {
79 return InsertionPoint::insertedInto(insertionPoint);
HTMLContentElement.h 35 #include "core/dom/shadow/InsertionPoint.h"
39 class HTMLContentElement FINAL : public InsertionPoint {
HTMLContentElement.cpp 44 : InsertionPoint(contentTag, document)
79 InsertionPoint::parseAttribute(name, value);
  /external/llvm/lib/Target/AArch64/
AArch64PromoteConstant.cpp 336 Instruction *InsertionPoint;
338 InsertionPoint =
341 InsertionPoint = dyn_cast<Instruction>(*Use);
342 assert(InsertionPoint && "User is not an instruction!");
343 return InsertionPoint;
442 Instruction *InsertionPoint = findInsertionPoint(UseIt);
445 DEBUG(InsertionPoint->print(dbgs()));
451 InsPtsPerFunc[InsertionPoint->getParent()->getParent()];
452 if (isDominated(InsertionPoint, UseIt, InsertPts))
456 if (tryAndMerge(InsertionPoint, UseIt, InsertPts)
    [all...]
AArch64LoadStoreOptimizer.cpp 289 MachineBasicBlock::iterator InsertionPoint = MergeForward ? Paired : I;
311 MachineInstrBuilder MIB = BuildMI(*I->getParent(), InsertionPoint,
    [all...]
  /external/llvm/lib/CodeGen/
EarlyIfConversion.cpp 138 MachineBasicBlock::iterator InsertionPoint;
267 /// This function sets InsertionPoint and returns true when successful, it
327 InsertionPoint = I;
519 Head->splice(InsertionPoint, TBB, TBB->begin(), TBB->getFirstTerminator());
521 Head->splice(InsertionPoint, FBB, FBB->begin(), FBB->getFirstTerminator());
  /external/chromium_org/third_party/WebKit/Source/core/events/
EventPath.cpp 35 #include "core/dom/shadow/InsertionPoint.h"
126 WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8> insertionPoints;
130 InsertionPoint* insertionPoint = insertionPoints[i];
131 if (insertionPoint->isShadowInsertionPoint()) {
132 ShadowRoot* containingShadowRoot = insertionPoint->containingShadowRoot();
137 addNodeEventContext(insertionPoint);
  /external/chromium_org/third_party/WebKit/Source/core/css/resolver/
SharedStyleFinder.cpp 45 #include "core/dom/shadow/InsertionPoint.h"
185 WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8> insertionPoints, candidateInsertionPoints;
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/
aepack.py 338 if want == 'cins': return aetypes.InsertionPoint(seld, fr)
  /external/llvm/lib/Transforms/Scalar/
SROA.cpp     [all...]
  /external/chromium_org/third_party/WebKit/Source/core/
webcore_dom.target.darwin-arm.mk 168 third_party/WebKit/Source/core/dom/shadow/InsertionPoint.cpp \
webcore_dom.target.darwin-arm64.mk 168 third_party/WebKit/Source/core/dom/shadow/InsertionPoint.cpp \

Completed in 444 milliseconds

1 2