OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) | 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) |
4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) | 4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) |
5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights
reserved. | 5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights
reserved. |
6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> | 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> |
7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> | 7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> |
8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. | 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. |
10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. | 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. |
(...skipping 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
56 | 56 |
57 VisitedLinkState::VisitedLinkState(const Document& document) | 57 VisitedLinkState::VisitedLinkState(const Document& document) |
58 : m_document(document) | 58 : m_document(document) |
59 { | 59 { |
60 } | 60 } |
61 | 61 |
62 void VisitedLinkState::invalidateStyleForAllLinks() | 62 void VisitedLinkState::invalidateStyleForAllLinks() |
63 { | 63 { |
64 if (m_linksCheckedForVisitedState.isEmpty()) | 64 if (m_linksCheckedForVisitedState.isEmpty()) |
65 return; | 65 return; |
66 for (Node& node : NodeTraversal::from(document().firstChild())) { | 66 for (Node& node : NodeTraversal::startsAt(document().firstChild())) { |
67 if (node.isLink()) | 67 if (node.isLink()) |
68 node.setNeedsStyleRecalc(SubtreeStyleChange, StyleChangeReasonForTra
cing::create(StyleChangeReason::VisitedLink)); | 68 node.setNeedsStyleRecalc(SubtreeStyleChange, StyleChangeReasonForTra
cing::create(StyleChangeReason::VisitedLink)); |
69 } | 69 } |
70 } | 70 } |
71 | 71 |
72 void VisitedLinkState::invalidateStyleForLink(LinkHash linkHash) | 72 void VisitedLinkState::invalidateStyleForLink(LinkHash linkHash) |
73 { | 73 { |
74 if (!m_linksCheckedForVisitedState.contains(linkHash)) | 74 if (!m_linksCheckedForVisitedState.contains(linkHash)) |
75 return; | 75 return; |
76 for (Node& node : NodeTraversal::from(document().firstChild())) { | 76 for (Node& node : NodeTraversal::startsAt(document().firstChild())) { |
77 if (node.isLink() && linkHashForElement(toElement(node)) == linkHash) | 77 if (node.isLink() && linkHashForElement(toElement(node)) == linkHash) |
78 node.setNeedsStyleRecalc(SubtreeStyleChange, StyleChangeReasonForTra
cing::create(StyleChangeReason::VisitedLink)); | 78 node.setNeedsStyleRecalc(SubtreeStyleChange, StyleChangeReasonForTra
cing::create(StyleChangeReason::VisitedLink)); |
79 } | 79 } |
80 } | 80 } |
81 | 81 |
82 EInsideLink VisitedLinkState::determineLinkStateSlowCase(const Element& element) | 82 EInsideLink VisitedLinkState::determineLinkStateSlowCase(const Element& element) |
83 { | 83 { |
84 ASSERT(element.isLink()); | 84 ASSERT(element.isLink()); |
85 ASSERT(document().isActive()); | 85 ASSERT(document().isActive()); |
86 ASSERT(document() == element.document()); | 86 ASSERT(document() == element.document()); |
(...skipping 18 matching lines...) Expand all Loading... |
105 | 105 |
106 return InsideUnvisitedLink; | 106 return InsideUnvisitedLink; |
107 } | 107 } |
108 | 108 |
109 void VisitedLinkState::trace(Visitor* visitor) | 109 void VisitedLinkState::trace(Visitor* visitor) |
110 { | 110 { |
111 visitor->trace(m_document); | 111 visitor->trace(m_document); |
112 } | 112 } |
113 | 113 |
114 } // namespace blink | 114 } // namespace blink |
OLD | NEW |