| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 11 matching lines...) Expand all Loading... |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "core/dom/ElementRareData.h" | 31 #include "core/dom/ElementRareData.h" |
| 32 | |
| 33 #include "core/dom/CompositorProxiedPropertySet.h" | 32 #include "core/dom/CompositorProxiedPropertySet.h" |
| 34 #include "core/style/ComputedStyle.h" | 33 #include "core/style/ComputedStyle.h" |
| 35 | 34 |
| 36 namespace blink { | 35 namespace blink { |
| 37 | 36 |
| 38 struct SameSizeAsElementRareData : NodeRareData { | 37 struct SameSizeAsElementRareData : NodeRareData { |
| 39 short indices[1]; | 38 short indices[1]; |
| 40 LayoutSize sizeForResizing; | 39 LayoutSize sizeForResizing; |
| 41 IntSize scrollOffset; | 40 IntSize scrollOffset; |
| 42 void* pointers[13]; | 41 void* pointers[13]; |
| 43 PersistentWillBeMember<void*> member[1]; | 42 PersistentWillBeMember<void*> persistentMember[2]; |
| 44 }; | 43 }; |
| 45 | 44 |
| 46 CSSStyleDeclaration& ElementRareData::ensureInlineCSSStyleDeclaration(Element* o
wnerElement) | 45 CSSStyleDeclaration& ElementRareData::ensureInlineCSSStyleDeclaration(Element* o
wnerElement) |
| 47 { | 46 { |
| 48 if (!m_cssomWrapper) | 47 if (!m_cssomWrapper) |
| 49 m_cssomWrapper = adoptPtrWillBeNoop(new InlineCSSStyleDeclaration(ownerE
lement)); | 48 m_cssomWrapper = adoptPtrWillBeNoop(new InlineCSSStyleDeclaration(ownerE
lement)); |
| 50 return *m_cssomWrapper; | 49 return *m_cssomWrapper; |
| 51 } | 50 } |
| 52 | 51 |
| 53 AttrNodeList& ElementRareData::ensureAttrNodeList() | 52 AttrNodeList& ElementRareData::ensureAttrNodeList() |
| (...skipping 12 matching lines...) Expand all Loading... |
| 66 #if ENABLE(OILPAN) | 65 #if ENABLE(OILPAN) |
| 67 visitor->trace(m_attrNodeList); | 66 visitor->trace(m_attrNodeList); |
| 68 #endif | 67 #endif |
| 69 visitor->trace(m_elementAnimations); | 68 visitor->trace(m_elementAnimations); |
| 70 visitor->trace(m_cssomWrapper); | 69 visitor->trace(m_cssomWrapper); |
| 71 visitor->trace(m_customElementDefinition); | 70 visitor->trace(m_customElementDefinition); |
| 72 visitor->trace(m_generatedBefore); | 71 visitor->trace(m_generatedBefore); |
| 73 visitor->trace(m_generatedAfter); | 72 visitor->trace(m_generatedAfter); |
| 74 visitor->trace(m_generatedFirstLetter); | 73 visitor->trace(m_generatedFirstLetter); |
| 75 visitor->trace(m_backdrop); | 74 visitor->trace(m_backdrop); |
| 75 visitor->trace(m_intersectionObserverData); |
| 76 NodeRareData::traceAfterDispatch(visitor); | 76 NodeRareData::traceAfterDispatch(visitor); |
| 77 } | 77 } |
| 78 | 78 |
| 79 static_assert(sizeof(ElementRareData) == sizeof(SameSizeAsElementRareData), "Ele
mentRareData should stay small"); | 79 static_assert(sizeof(ElementRareData) == sizeof(SameSizeAsElementRareData), "Ele
mentRareData should stay small"); |
| 80 | 80 |
| 81 } // namespace blink | 81 } // namespace blink |
| OLD | NEW |