OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Peter Kelly (pmk@post.com) | 4 * (C) 2001 Peter Kelly (pmk@post.com) |
5 * (C) 2001 Dirk Mueller (mueller@kde.org) | 5 * (C) 2001 Dirk Mueller (mueller@kde.org) |
6 * Copyright (C) 2003-2011, 2013, 2014 Apple Inc. All rights reserved. | 6 * Copyright (C) 2003-2011, 2013, 2014 Apple Inc. All rights reserved. |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 850 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
861 DCHECK(!needsStyleInvalidation()); | 861 DCHECK(!needsStyleInvalidation()); |
862 DCHECK(insertionPoint->inShadowIncludingDocument() || insertionPoint->isInSh
adowTree() || isContainerNode()); | 862 DCHECK(insertionPoint->inShadowIncludingDocument() || insertionPoint->isInSh
adowTree() || isContainerNode()); |
863 if (insertionPoint->inShadowIncludingDocument()) { | 863 if (insertionPoint->inShadowIncludingDocument()) { |
864 setFlag(InDocumentFlag); | 864 setFlag(InDocumentFlag); |
865 insertionPoint->document().incrementNodeCount(); | 865 insertionPoint->document().incrementNodeCount(); |
866 } | 866 } |
867 if (parentOrShadowHostNode()->isInShadowTree()) | 867 if (parentOrShadowHostNode()->isInShadowTree()) |
868 setFlag(IsInShadowTreeFlag); | 868 setFlag(IsInShadowTreeFlag); |
869 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio
nRecalc()) | 869 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio
nRecalc()) |
870 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); | 870 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); |
| 871 if (document().shadowCascadeOrder() == ShadowCascadeOrder::ShadowCascadeV1) |
| 872 updateAssignmentForInsertedInto(insertionPoint); |
871 return InsertionDone; | 873 return InsertionDone; |
872 } | 874 } |
873 | 875 |
874 inline void Node::removedFrom(ContainerNode* insertionPoint) | 876 inline void Node::removedFrom(ContainerNode* insertionPoint) |
875 { | 877 { |
876 DCHECK(insertionPoint->inShadowIncludingDocument() || isContainerNode() || i
sInShadowTree()); | 878 DCHECK(insertionPoint->inShadowIncludingDocument() || isContainerNode() || i
sInShadowTree()); |
877 if (insertionPoint->inShadowIncludingDocument()) { | 879 if (insertionPoint->inShadowIncludingDocument()) { |
878 clearFlag(InDocumentFlag); | 880 clearFlag(InDocumentFlag); |
879 insertionPoint->document().decrementNodeCount(); | 881 insertionPoint->document().decrementNodeCount(); |
880 } | 882 } |
(...skipping 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
958 static T* create(const QualifiedName&, Document&) | 960 static T* create(const QualifiedName&, Document&) |
959 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ | 961 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ |
960 T* T::create(const QualifiedName& tagName, Document& document) \ | 962 T* T::create(const QualifiedName& tagName, Document& document) \ |
961 { \ | 963 { \ |
962 return new T(tagName, document); \ | 964 return new T(tagName, document); \ |
963 } | 965 } |
964 | 966 |
965 } // namespace blink | 967 } // namespace blink |
966 | 968 |
967 #endif // Element_h | 969 #endif // Element_h |
OLD | NEW |