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 853 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
864 DCHECK(!needsStyleInvalidation()); | 864 DCHECK(!needsStyleInvalidation()); |
865 DCHECK(insertionPoint->inShadowIncludingDocument() || insertionPoint->isInSh adowTree() || isContainerNode()); | 865 DCHECK(insertionPoint->inShadowIncludingDocument() || insertionPoint->isInSh adowTree() || isContainerNode()); |
866 if (insertionPoint->inShadowIncludingDocument()) { | 866 if (insertionPoint->inShadowIncludingDocument()) { |
867 setFlag(InDocumentFlag); | 867 setFlag(InDocumentFlag); |
868 insertionPoint->document().incrementNodeCount(); | 868 insertionPoint->document().incrementNodeCount(); |
869 } | 869 } |
870 if (parentOrShadowHostNode()->isInShadowTree()) | 870 if (parentOrShadowHostNode()->isInShadowTree()) |
871 setFlag(IsInShadowTreeFlag); | 871 setFlag(IsInShadowTreeFlag); |
872 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio nRecalc()) | 872 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio nRecalc()) |
873 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); | 873 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); |
874 if (document().shadowCascadeOrder() == ShadowCascadeOrder::ShadowCascadeV1) { | |
hayato
2016/04/18 07:16:31
Given that CSS is no longer only the client of thi
yuzuchan
2016/04/18 09:43:27
Found out that I do not need to use the function h
| |
875 if (isChildOfV1ShadowHost() || isChildOfSlot()) | |
876 document().updateAssignment(); | |
877 } | |
874 return InsertionDone; | 878 return InsertionDone; |
875 } | 879 } |
876 | 880 |
877 inline void Node::removedFrom(ContainerNode* insertionPoint) | 881 inline void Node::removedFrom(ContainerNode* insertionPoint) |
878 { | 882 { |
879 DCHECK(insertionPoint->inShadowIncludingDocument() || isContainerNode() || i sInShadowTree()); | 883 DCHECK(insertionPoint->inShadowIncludingDocument() || isContainerNode() || i sInShadowTree()); |
880 if (insertionPoint->inShadowIncludingDocument()) { | 884 if (insertionPoint->inShadowIncludingDocument()) { |
881 clearFlag(InDocumentFlag); | 885 clearFlag(InDocumentFlag); |
882 insertionPoint->document().decrementNodeCount(); | 886 insertionPoint->document().decrementNodeCount(); |
883 } | 887 } |
(...skipping 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
961 static T* create(const QualifiedName&, Document&) | 965 static T* create(const QualifiedName&, Document&) |
962 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ | 966 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ |
963 T* T::create(const QualifiedName& tagName, Document& document) \ | 967 T* T::create(const QualifiedName& tagName, Document& document) \ |
964 { \ | 968 { \ |
965 return new T(tagName, document); \ | 969 return new T(tagName, document); \ |
966 } | 970 } |
967 | 971 |
968 } // namespace blink | 972 } // namespace blink |
969 | 973 |
970 #endif // Element_h | 974 #endif // Element_h |
OLD | NEW |