| 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 22 matching lines...) Expand all Loading... |
| 33 #include "core/dom/Element.h" | 33 #include "core/dom/Element.h" |
| 34 #include "core/dom/ElementRareData.h" | 34 #include "core/dom/ElementRareData.h" |
| 35 #include "core/frame/FrameHost.h" | 35 #include "core/frame/FrameHost.h" |
| 36 #include "core/layout/LayoutObject.h" | 36 #include "core/layout/LayoutObject.h" |
| 37 #include "platform/heap/Handle.h" | 37 #include "platform/heap/Handle.h" |
| 38 | 38 |
| 39 namespace blink { | 39 namespace blink { |
| 40 | 40 |
| 41 struct SameSizeAsNodeRareData { | 41 struct SameSizeAsNodeRareData { |
| 42 void* m_pointer; | 42 void* m_pointer; |
| 43 RawPtrWillBeMember<void*> m_willbeMember[2]; | 43 Member<void*> m_willbeMember[2]; |
| 44 unsigned m_bitfields; | 44 unsigned m_bitfields; |
| 45 }; | 45 }; |
| 46 | 46 |
| 47 static_assert(sizeof(NodeRareData) == sizeof(SameSizeAsNodeRareData), "NodeRareD
ata should stay small"); | 47 static_assert(sizeof(NodeRareData) == sizeof(SameSizeAsNodeRareData), "NodeRareD
ata should stay small"); |
| 48 | 48 |
| 49 DEFINE_TRACE_AFTER_DISPATCH(NodeRareData) | 49 DEFINE_TRACE_AFTER_DISPATCH(NodeRareData) |
| 50 { | 50 { |
| 51 visitor->trace(m_mutationObserverData); | 51 visitor->trace(m_mutationObserverData); |
| 52 // Do not keep empty NodeListsNodeData objects around. | 52 // Do not keep empty NodeListsNodeData objects around. |
| 53 if (m_nodeLists && m_nodeLists->isEmpty()) | 53 if (m_nodeLists && m_nodeLists->isEmpty()) |
| (...skipping 22 matching lines...) Expand all Loading... |
| 76 void NodeRareData::incrementConnectedSubframeCount() | 76 void NodeRareData::incrementConnectedSubframeCount() |
| 77 { | 77 { |
| 78 RELEASE_ASSERT_WITH_SECURITY_IMPLICATION((m_connectedFrameCount + 1) <= Fram
eHost::maxNumberOfFrames); | 78 RELEASE_ASSERT_WITH_SECURITY_IMPLICATION((m_connectedFrameCount + 1) <= Fram
eHost::maxNumberOfFrames); |
| 79 ++m_connectedFrameCount; | 79 ++m_connectedFrameCount; |
| 80 } | 80 } |
| 81 | 81 |
| 82 // Ensure the 10 bits reserved for the m_connectedFrameCount cannot overflow | 82 // Ensure the 10 bits reserved for the m_connectedFrameCount cannot overflow |
| 83 static_assert(FrameHost::maxNumberOfFrames < (1 << NodeRareData::ConnectedFrameC
ountBits), "Frame limit should fit in rare data count"); | 83 static_assert(FrameHost::maxNumberOfFrames < (1 << NodeRareData::ConnectedFrameC
ountBits), "Frame limit should fit in rare data count"); |
| 84 | 84 |
| 85 } // namespace blink | 85 } // namespace blink |
| OLD | NEW |