| 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 857 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 868 DCHECK(!needsStyleInvalidation()); | 868 DCHECK(!needsStyleInvalidation()); |
| 869 DCHECK(insertionPoint->inShadowIncludingDocument() || insertionPoint->isInSh
adowTree() || isContainerNode()); | 869 DCHECK(insertionPoint->inShadowIncludingDocument() || insertionPoint->isInSh
adowTree() || isContainerNode()); |
| 870 if (insertionPoint->inShadowIncludingDocument()) { | 870 if (insertionPoint->inShadowIncludingDocument()) { |
| 871 setFlag(InDocumentFlag); | 871 setFlag(InDocumentFlag); |
| 872 insertionPoint->document().incrementNodeCount(); | 872 insertionPoint->document().incrementNodeCount(); |
| 873 } | 873 } |
| 874 if (parentOrShadowHostNode()->isInShadowTree()) | 874 if (parentOrShadowHostNode()->isInShadowTree()) |
| 875 setFlag(IsInShadowTreeFlag); | 875 setFlag(IsInShadowTreeFlag); |
| 876 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio
nRecalc()) | 876 if (childNeedsDistributionRecalc() && !insertionPoint->childNeedsDistributio
nRecalc()) |
| 877 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); | 877 insertionPoint->markAncestorsWithChildNeedsDistributionRecalc(); |
| 878 if (document().shadowCascadeOrder() == ShadowCascadeOrder::ShadowCascadeV1) | |
| 879 updateAssignmentForInsertedInto(insertionPoint); | |
| 880 return InsertionDone; | 878 return InsertionDone; |
| 881 } | 879 } |
| 882 | 880 |
| 883 inline void Node::removedFrom(ContainerNode* insertionPoint) | 881 inline void Node::removedFrom(ContainerNode* insertionPoint) |
| 884 { | 882 { |
| 885 DCHECK(insertionPoint->inShadowIncludingDocument() || isContainerNode() || i
sInShadowTree()); | 883 DCHECK(insertionPoint->inShadowIncludingDocument() || isContainerNode() || i
sInShadowTree()); |
| 886 if (insertionPoint->inShadowIncludingDocument()) { | 884 if (insertionPoint->inShadowIncludingDocument()) { |
| 887 clearFlag(InDocumentFlag); | 885 clearFlag(InDocumentFlag); |
| 888 insertionPoint->document().decrementNodeCount(); | 886 insertionPoint->document().decrementNodeCount(); |
| 889 } | 887 } |
| (...skipping 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 967 static T* create(const QualifiedName&, Document&) | 965 static T* create(const QualifiedName&, Document&) |
| 968 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ | 966 #define DEFINE_ELEMENT_FACTORY_WITH_TAGNAME(T) \ |
| 969 T* T::create(const QualifiedName& tagName, Document& document) \ | 967 T* T::create(const QualifiedName& tagName, Document& document) \ |
| 970 { \ | 968 { \ |
| 971 return new T(tagName, document); \ | 969 return new T(tagName, document); \ |
| 972 } | 970 } |
| 973 | 971 |
| 974 } // namespace blink | 972 } // namespace blink |
| 975 | 973 |
| 976 #endif // Element_h | 974 #endif // Element_h |
| OLD | NEW |