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 | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All |
6 * rights reserved. | 6 * rights reserved. |
7 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) | 7 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) |
8 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. | 8 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. |
9 * (http://www.torchmobile.com/) | 9 * (http://www.torchmobile.com/) |
10 * | 10 * |
(...skipping 852 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
863 if (RuntimeEnabledFeatures::InertAttributeEnabled()) { | 863 if (RuntimeEnabledFeatures::InertAttributeEnabled()) { |
864 const Element* element = this->IsElementNode() | 864 const Element* element = this->IsElementNode() |
865 ? ToElement(this) | 865 ? ToElement(this) |
866 : FlatTreeTraversal::ParentElement(*this); | 866 : FlatTreeTraversal::ParentElement(*this); |
867 while (element) { | 867 while (element) { |
868 if (element->hasAttribute(HTMLNames::inertAttr)) | 868 if (element->hasAttribute(HTMLNames::inertAttr)) |
869 return true; | 869 return true; |
870 element = FlatTreeTraversal::ParentElement(*element); | 870 element = FlatTreeTraversal::ParentElement(*element); |
871 } | 871 } |
872 } | 872 } |
873 return GetDocument().LocalOwner() && GetDocument().LocalOwner()->IsInert(); | 873 return GetDocument().GetFrame() && GetDocument().GetFrame()->IsInert(); |
874 } | 874 } |
875 | 875 |
876 unsigned Node::NodeIndex() const { | 876 unsigned Node::NodeIndex() const { |
877 const Node* temp_node = previousSibling(); | 877 const Node* temp_node = previousSibling(); |
878 unsigned count = 0; | 878 unsigned count = 0; |
879 for (count = 0; temp_node; count++) | 879 for (count = 0; temp_node; count++) |
880 temp_node = temp_node->previousSibling(); | 880 temp_node = temp_node->previousSibling(); |
881 return count; | 881 return count; |
882 } | 882 } |
883 | 883 |
(...skipping 1774 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2658 if (node) { | 2658 if (node) { |
2659 std::stringstream stream; | 2659 std::stringstream stream; |
2660 node->PrintNodePathTo(stream); | 2660 node->PrintNodePathTo(stream); |
2661 LOG(INFO) << stream.str(); | 2661 LOG(INFO) << stream.str(); |
2662 } else { | 2662 } else { |
2663 LOG(INFO) << "Cannot showNodePath for <null>"; | 2663 LOG(INFO) << "Cannot showNodePath for <null>"; |
2664 } | 2664 } |
2665 } | 2665 } |
2666 | 2666 |
2667 #endif | 2667 #endif |
OLD | NEW |