| 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 47 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 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 (Element* element = ElementTraversal::firstWithin(m_document); element;
element = ElementTraversal::next(*element)) { | 66 for (Element* element = ElementTraversal::firstWithin(m_document); element;
element = ElementTraversal::next(*element)) { |
| 67 if (element->isLink()) | 67 if (element->isLink()) |
| 68 element->setNeedsStyleRecalc(); | 68 element->setNeedsStyleRecalc(SubtreeStyleChange); |
| 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 (Element* element = ElementTraversal::firstWithin(m_document); element;
element = ElementTraversal::next(*element)) { | 76 for (Element* element = ElementTraversal::firstWithin(m_document); element;
element = ElementTraversal::next(*element)) { |
| 77 if (element->isLink() && linkHashForElement(*element) == linkHash) | 77 if (element->isLink() && linkHashForElement(*element) == linkHash) |
| 78 element->setNeedsStyleRecalc(); | 78 element->setNeedsStyleRecalc(SubtreeStyleChange); |
| 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(m_document.isActive()); | 85 ASSERT(m_document.isActive()); |
| 86 ASSERT(m_document == element.document()); | 86 ASSERT(m_document == element.document()); |
| 87 | 87 |
| 88 const AtomicString& attribute = linkAttribute(element); | 88 const AtomicString& attribute = linkAttribute(element); |
| (...skipping 11 matching lines...) Expand all Loading... |
| 100 if (LinkHash hash = linkHashForElement(element, attribute)) { | 100 if (LinkHash hash = linkHashForElement(element, attribute)) { |
| 101 m_linksCheckedForVisitedState.add(hash); | 101 m_linksCheckedForVisitedState.add(hash); |
| 102 if (blink::Platform::current()->isLinkVisited(hash)) | 102 if (blink::Platform::current()->isLinkVisited(hash)) |
| 103 return InsideVisitedLink; | 103 return InsideVisitedLink; |
| 104 } | 104 } |
| 105 | 105 |
| 106 return InsideUnvisitedLink; | 106 return InsideUnvisitedLink; |
| 107 } | 107 } |
| 108 | 108 |
| 109 } | 109 } |
| OLD | NEW |