Chromium Code Reviews| 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 12 matching lines...) Expand all Loading... | |
| 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 "config.h" | 31 #include "config.h" |
| 32 #include "core/dom/ElementRareData.h" | 32 #include "core/dom/ElementRareData.h" |
| 33 | |
| 34 #include "core/dom/CompositorProxiedPropertySet.h" | 33 #include "core/dom/CompositorProxiedPropertySet.h" |
| 34 #include "core/dom/Document.h" | |
|
esprehn
2015/12/17 01:40:28
still needed?
szager1
2015/12/17 20:27:25
Nope, removed it.
| |
| 35 #include "core/style/ComputedStyle.h" | 35 #include "core/style/ComputedStyle.h" |
| 36 | 36 |
| 37 namespace blink { | 37 namespace blink { |
| 38 | 38 |
| 39 struct SameSizeAsElementRareData : NodeRareData { | 39 struct SameSizeAsElementRareData : NodeRareData { |
| 40 short indices[1]; | 40 short indices[1]; |
| 41 LayoutSize sizeForResizing; | 41 LayoutSize sizeForResizing; |
| 42 IntSize scrollOffset; | 42 IntSize scrollOffset; |
| 43 void* pointers[13]; | 43 void* pointers[13]; |
| 44 PersistentWillBeMember<void*> member[1]; | 44 PersistentWillBeMember<void*> persistentMember[2]; |
| 45 }; | 45 }; |
| 46 | 46 |
| 47 CSSStyleDeclaration& ElementRareData::ensureInlineCSSStyleDeclaration(Element* o wnerElement) | 47 CSSStyleDeclaration& ElementRareData::ensureInlineCSSStyleDeclaration(Element* o wnerElement) |
| 48 { | 48 { |
| 49 if (!m_cssomWrapper) | 49 if (!m_cssomWrapper) |
| 50 m_cssomWrapper = adoptPtrWillBeNoop(new InlineCSSStyleDeclaration(ownerE lement)); | 50 m_cssomWrapper = adoptPtrWillBeNoop(new InlineCSSStyleDeclaration(ownerE lement)); |
| 51 return *m_cssomWrapper; | 51 return *m_cssomWrapper; |
| 52 } | 52 } |
| 53 | 53 |
| 54 AttrNodeList& ElementRareData::ensureAttrNodeList() | 54 AttrNodeList& ElementRareData::ensureAttrNodeList() |
| (...skipping 12 matching lines...) Expand all Loading... | |
| 67 #if ENABLE(OILPAN) | 67 #if ENABLE(OILPAN) |
| 68 visitor->trace(m_attrNodeList); | 68 visitor->trace(m_attrNodeList); |
| 69 #endif | 69 #endif |
| 70 visitor->trace(m_elementAnimations); | 70 visitor->trace(m_elementAnimations); |
| 71 visitor->trace(m_cssomWrapper); | 71 visitor->trace(m_cssomWrapper); |
| 72 visitor->trace(m_customElementDefinition); | 72 visitor->trace(m_customElementDefinition); |
| 73 visitor->trace(m_generatedBefore); | 73 visitor->trace(m_generatedBefore); |
| 74 visitor->trace(m_generatedAfter); | 74 visitor->trace(m_generatedAfter); |
| 75 visitor->trace(m_generatedFirstLetter); | 75 visitor->trace(m_generatedFirstLetter); |
| 76 visitor->trace(m_backdrop); | 76 visitor->trace(m_backdrop); |
| 77 visitor->trace(m_intersectionObserverData); | |
| 77 NodeRareData::traceAfterDispatch(visitor); | 78 NodeRareData::traceAfterDispatch(visitor); |
| 78 } | 79 } |
| 79 | 80 |
| 80 static_assert(sizeof(ElementRareData) == sizeof(SameSizeAsElementRareData), "Ele mentRareData should stay small"); | 81 static_assert(sizeof(ElementRareData) == sizeof(SameSizeAsElementRareData), "Ele mentRareData should stay small"); |
| 81 | 82 |
| 82 } // namespace blink | 83 } // namespace blink |
| OLD | NEW |