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 "core/dom/NodeRareData.h" | 31 #include "core/dom/NodeRareData.h" |
32 | 32 |
33 #include "bindings/core/v8/ScriptWrappableVisitor.h" | |
34 #include "core/dom/Element.h" | 33 #include "core/dom/Element.h" |
35 #include "core/dom/ElementRareData.h" | 34 #include "core/dom/ElementRareData.h" |
36 #include "core/page/Page.h" | 35 #include "core/page/Page.h" |
| 36 #include "platform/bindings/ScriptWrappableVisitor.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* pointer_; | 42 void* pointer_; |
43 Member<void*> willbe_member_[2]; | 43 Member<void*> willbe_member_[2]; |
44 unsigned bitfields_; | 44 unsigned bitfields_; |
45 }; | 45 }; |
46 | 46 |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
87 SECURITY_CHECK((connected_frame_count_ + 1) <= Page::kMaxNumberOfFrames); | 87 SECURITY_CHECK((connected_frame_count_ + 1) <= Page::kMaxNumberOfFrames); |
88 ++connected_frame_count_; | 88 ++connected_frame_count_; |
89 } | 89 } |
90 | 90 |
91 // Ensure the 10 bits reserved for the m_connectedFrameCount cannot overflow | 91 // Ensure the 10 bits reserved for the m_connectedFrameCount cannot overflow |
92 static_assert(Page::kMaxNumberOfFrames < | 92 static_assert(Page::kMaxNumberOfFrames < |
93 (1 << NodeRareData::kConnectedFrameCountBits), | 93 (1 << NodeRareData::kConnectedFrameCountBits), |
94 "Frame limit should fit in rare data count"); | 94 "Frame limit should fit in rare data count"); |
95 | 95 |
96 } // namespace blink | 96 } // namespace blink |
OLD | NEW |