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) 2005 Allan Sandfeld Jensen (kde@carewolf.com) | 4 * (C) 2005 Allan Sandfeld Jensen (kde@carewolf.com) |
5 * (C) 2005, 2006 Samuel Weinig (sam.weinig@gmail.com) | 5 * (C) 2005, 2006 Samuel Weinig (sam.weinig@gmail.com) |
6 * Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. | 6 * Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
7 * Copyright (C) 2010 Google Inc. All rights reserved. | 7 * Copyright (C) 2010 Google Inc. All rights reserved. |
8 * | 8 * |
9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
(...skipping 2525 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2536 if (continuation) { | 2536 if (continuation) { |
2537 if (!continuationMap) | 2537 if (!continuationMap) |
2538 continuationMap = new ContinuationMap; | 2538 continuationMap = new ContinuationMap; |
2539 continuationMap->set(this, continuation); | 2539 continuationMap->set(this, continuation); |
2540 } else { | 2540 } else { |
2541 if (continuationMap) | 2541 if (continuationMap) |
2542 continuationMap->remove(this); | 2542 continuationMap->remove(this); |
2543 } | 2543 } |
2544 } | 2544 } |
2545 | 2545 |
| 2546 void RenderBoxModelObject::computeLayerHitTestRects(LayerHitTestRects& rects) co
nst |
| 2547 { |
| 2548 RenderLayerModelObject::computeLayerHitTestRects(rects); |
| 2549 |
| 2550 // If there is a continuation then we need to consult it here, since this is |
| 2551 // the root of the tree walk and it wouldn't otherwise get picked up. |
| 2552 // Continuations should always be siblings in the tree, so any others should |
| 2553 // get picked up already by the tree walk. |
| 2554 if (continuation()) |
| 2555 continuation()->computeLayerHitTestRects(rects); |
| 2556 } |
| 2557 |
2546 RenderObject* RenderBoxModelObject::firstLetterRemainingText() const | 2558 RenderObject* RenderBoxModelObject::firstLetterRemainingText() const |
2547 { | 2559 { |
2548 if (!firstLetterRemainingTextMap) | 2560 if (!firstLetterRemainingTextMap) |
2549 return 0; | 2561 return 0; |
2550 return firstLetterRemainingTextMap->get(this); | 2562 return firstLetterRemainingTextMap->get(this); |
2551 } | 2563 } |
2552 | 2564 |
2553 void RenderBoxModelObject::setFirstLetterRemainingText(RenderObject* remainingTe
xt) | 2565 void RenderBoxModelObject::setFirstLetterRemainingText(RenderObject* remainingTe
xt) |
2554 { | 2566 { |
2555 if (remainingText) { | 2567 if (remainingText) { |
(...skipping 186 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2742 ASSERT(!beforeChild || toBoxModelObject == beforeChild->parent()); | 2754 ASSERT(!beforeChild || toBoxModelObject == beforeChild->parent()); |
2743 for (RenderObject* child = startChild; child && child != endChild; ) { | 2755 for (RenderObject* child = startChild; child && child != endChild; ) { |
2744 // Save our next sibling as moveChildTo will clear it. | 2756 // Save our next sibling as moveChildTo will clear it. |
2745 RenderObject* nextSibling = child->nextSibling(); | 2757 RenderObject* nextSibling = child->nextSibling(); |
2746 moveChildTo(toBoxModelObject, child, beforeChild, fullRemoveInsert); | 2758 moveChildTo(toBoxModelObject, child, beforeChild, fullRemoveInsert); |
2747 child = nextSibling; | 2759 child = nextSibling; |
2748 } | 2760 } |
2749 } | 2761 } |
2750 | 2762 |
2751 } // namespace WebCore | 2763 } // namespace WebCore |
OLD | NEW |