| 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) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. |
| 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) | 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) |
| 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) | 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) |
| 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 621 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 632 } | 632 } |
| 633 | 633 |
| 634 clearChildNeedsDistributionRecalc(); | 634 clearChildNeedsDistributionRecalc(); |
| 635 } | 635 } |
| 636 | 636 |
| 637 void Node::setIsLink(bool isLink) | 637 void Node::setIsLink(bool isLink) |
| 638 { | 638 { |
| 639 setFlag(isLink && !SVGImage::isInSVGImage(toElement(this)), IsLinkFlag); | 639 setFlag(isLink && !SVGImage::isInSVGImage(toElement(this)), IsLinkFlag); |
| 640 } | 640 } |
| 641 | 641 |
| 642 void Node::markAncestorsWithChildNeedsStyleInvalidation() |
| 643 { |
| 644 for (Node* node = this; node && !node->childNeedsDistributionRecalc(); node
= node->parentOrShadowHostNode()) |
| 645 node->setChildNeedsStyleInvalidation(); |
| 646 if (document().childNeedsStyleInvalidation()) |
| 647 document().scheduleStyleRecalc(); |
| 648 } |
| 649 |
| 642 void Node::markAncestorsWithChildNeedsDistributionRecalc() | 650 void Node::markAncestorsWithChildNeedsDistributionRecalc() |
| 643 { | 651 { |
| 644 for (Node* node = this; node && !node->childNeedsDistributionRecalc(); node
= node->parentOrShadowHostNode()) | 652 for (Node* node = this; node && !node->childNeedsDistributionRecalc(); node
= node->parentOrShadowHostNode()) |
| 645 node->setChildNeedsDistributionRecalc(); | 653 node->setChildNeedsDistributionRecalc(); |
| 646 if (document().childNeedsDistributionRecalc()) | 654 if (document().childNeedsDistributionRecalc()) |
| 647 document().scheduleStyleRecalc(); | 655 document().scheduleStyleRecalc(); |
| 648 } | 656 } |
| 649 | 657 |
| 650 namespace { | 658 namespace { |
| 651 | 659 |
| (...skipping 1909 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2561 node->showTreeForThis(); | 2569 node->showTreeForThis(); |
| 2562 } | 2570 } |
| 2563 | 2571 |
| 2564 void showNodePath(const WebCore::Node* node) | 2572 void showNodePath(const WebCore::Node* node) |
| 2565 { | 2573 { |
| 2566 if (node) | 2574 if (node) |
| 2567 node->showNodePathForThis(); | 2575 node->showNodePathForThis(); |
| 2568 } | 2576 } |
| 2569 | 2577 |
| 2570 #endif | 2578 #endif |
| OLD | NEW |