| 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) 2000 Dirk Mueller (mueller@kde.org) | 4 * (C) 2000 Dirk Mueller (mueller@kde.org) |
| 5 * (C) 2004 Allan Sandfeld Jensen (kde@carewolf.com) | 5 * (C) 2004 Allan Sandfeld Jensen (kde@carewolf.com) |
| 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2011 Apple Inc. All rights reserv
ed. | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2011 Apple Inc. All rights reserv
ed. |
| 7 * Copyright (C) 2009 Google Inc. All rights reserved. | 7 * Copyright (C) 2009 Google Inc. All rights reserved. |
| 8 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) | 8 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) |
| 9 * | 9 * |
| 10 * This library is free software; you can redistribute it and/or | 10 * This library is free software; you can redistribute it and/or |
| (...skipping 100 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 111 } | 111 } |
| 112 | 112 |
| 113 LayoutObject::SetLayoutNeededForbiddenScope::~SetLayoutNeededForbiddenScope() | 113 LayoutObject::SetLayoutNeededForbiddenScope::~SetLayoutNeededForbiddenScope() |
| 114 { | 114 { |
| 115 m_layoutObject.setNeedsLayoutIsForbidden(m_preexistingForbidden); | 115 m_layoutObject.setNeedsLayoutIsForbidden(m_preexistingForbidden); |
| 116 } | 116 } |
| 117 #endif | 117 #endif |
| 118 | 118 |
| 119 struct SameSizeAsLayoutObject : DisplayItemClient { | 119 struct SameSizeAsLayoutObject : DisplayItemClient { |
| 120 virtual ~SameSizeAsLayoutObject() { } // Allocate vtable pointer. | 120 virtual ~SameSizeAsLayoutObject() { } // Allocate vtable pointer. |
| 121 LayoutPoint position; | |
| 122 LayoutRect rect; | |
| 123 void* pointers[6]; | 121 void* pointers[6]; |
| 124 #if ENABLE(ASSERT) | 122 #if ENABLE(ASSERT) |
| 125 unsigned m_debugBitfields : 2; | 123 unsigned m_debugBitfields : 2; |
| 126 #endif | 124 #endif |
| 127 unsigned m_bitfields; | 125 unsigned m_bitfields; |
| 128 unsigned m_bitfields2; | 126 unsigned m_bitfields2; |
| 127 LayoutRect rect; // Stores the previous paint invalidation rect. |
| 128 LayoutPoint position; // Stores the previous position from the paint invalid
ation container. |
| 129 }; | 129 }; |
| 130 | 130 |
| 131 static_assert(sizeof(LayoutObject) == sizeof(SameSizeAsLayoutObject), "LayoutObj
ect should stay small"); | 131 static_assert(sizeof(LayoutObject) == sizeof(SameSizeAsLayoutObject), "LayoutObj
ect should stay small"); |
| 132 | 132 |
| 133 bool LayoutObject::s_affectsParentBlock = false; | 133 bool LayoutObject::s_affectsParentBlock = false; |
| 134 | 134 |
| 135 typedef HashMap<const LayoutObject*, LayoutRect> SelectionPaintInvalidationMap; | 135 typedef HashMap<const LayoutObject*, LayoutRect> SelectionPaintInvalidationMap; |
| 136 static SelectionPaintInvalidationMap* selectionPaintInvalidationMap = nullptr; | 136 static SelectionPaintInvalidationMap* selectionPaintInvalidationMap = nullptr; |
| 137 | 137 |
| 138 // The pointer to paint properties is implemented as a global hash map temporari
ly, | 138 // The pointer to paint properties is implemented as a global hash map temporari
ly, |
| (...skipping 3506 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3645 const blink::LayoutObject* root = object1; | 3645 const blink::LayoutObject* root = object1; |
| 3646 while (root->parent()) | 3646 while (root->parent()) |
| 3647 root = root->parent(); | 3647 root = root->parent(); |
| 3648 root->showLayoutTreeAndMark(object1, "*", object2, "-", 0); | 3648 root->showLayoutTreeAndMark(object1, "*", object2, "-", 0); |
| 3649 } else { | 3649 } else { |
| 3650 WTFLogAlways("%s", "Cannot showLayoutTree. Root is (nil)"); | 3650 WTFLogAlways("%s", "Cannot showLayoutTree. Root is (nil)"); |
| 3651 } | 3651 } |
| 3652 } | 3652 } |
| 3653 | 3653 |
| 3654 #endif | 3654 #endif |
| OLD | NEW |