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 630 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
641 } | 641 } |
642 | 642 |
643 void Node::setNeedsStyleInvalidation() | 643 void Node::setNeedsStyleInvalidation() |
644 { | 644 { |
645 setFlag(NeedsStyleInvalidation); | 645 setFlag(NeedsStyleInvalidation); |
646 markAncestorsWithChildNeedsStyleInvalidation(); | 646 markAncestorsWithChildNeedsStyleInvalidation(); |
647 } | 647 } |
648 | 648 |
649 void Node::markAncestorsWithChildNeedsStyleInvalidation() | 649 void Node::markAncestorsWithChildNeedsStyleInvalidation() |
650 { | 650 { |
651 Node* node = this; | 651 for (Node* node = parentOrShadowHostNode(); node && !node->childNeedsStyleIn
validation(); node = node->parentOrShadowHostNode()) |
652 for (; node && !node->childNeedsStyleInvalidation(); node = node->parentOrSh
adowHostNode()) | |
653 node->setChildNeedsStyleInvalidation(); | 652 node->setChildNeedsStyleInvalidation(); |
654 if (document().childNeedsStyleInvalidation()) | 653 if (document().childNeedsStyleInvalidation()) |
655 document().scheduleStyleRecalc(); | 654 document().scheduleStyleRecalc(); |
656 } | 655 } |
657 | 656 |
658 void Node::markAncestorsWithChildNeedsDistributionRecalc() | 657 void Node::markAncestorsWithChildNeedsDistributionRecalc() |
659 { | 658 { |
660 for (Node* node = this; node && !node->childNeedsDistributionRecalc(); node
= node->parentOrShadowHostNode()) | 659 for (Node* node = this; node && !node->childNeedsDistributionRecalc(); node
= node->parentOrShadowHostNode()) |
661 node->setChildNeedsDistributionRecalc(); | 660 node->setChildNeedsDistributionRecalc(); |
662 if (document().childNeedsDistributionRecalc()) | 661 if (document().childNeedsDistributionRecalc()) |
(...skipping 1872 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2535 node->showTreeForThis(); | 2534 node->showTreeForThis(); |
2536 } | 2535 } |
2537 | 2536 |
2538 void showNodePath(const WebCore::Node* node) | 2537 void showNodePath(const WebCore::Node* node) |
2539 { | 2538 { |
2540 if (node) | 2539 if (node) |
2541 node->showNodePathForThis(); | 2540 node->showNodePathForThis(); |
2542 } | 2541 } |
2543 | 2542 |
2544 #endif | 2543 #endif |
OLD | NEW |