Rename Node::attached() to confusingAndOftenMisusedAttached()

Source/core/dom/ContainerNodeAlgorithms.h

 /*
  * Copyright (C) 2007 Apple Inc. All rights reserved.
  *           (C) 2008 Nikolas Zimmermann <zimmermann@kde.org>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 210 matching lines @@
     if (m_insertionPoint->inDocument())
         notifyNodeInsertedIntoDocument(node);
     else if (node->isContainerNode())
         notifyNodeInsertedIntoTree(toContainerNode(node));
 
     // Script runs in didNotifySubtreeInsertions so we should lazy attach before
     // to ensure that triggering a style recalc in script attaches all nodes that
     // were inserted.
     // FIXME: We should merge the lazy attach logic into the tree traversal in
     // notifyNodeInsertedIntoDocument.
-    if (!node->attached() && node->parentNode() && node->parentNode()->attached())
+    if (!node->confusingAndOftenMisusedAttached() && node->parentNode() && node->parentNode()->confusingAndOftenMisusedAttached())
         node->lazyAttach();
 
     for (size_t i = 0; i < m_postInsertionNotificationTargets.size(); ++i) {
         Node* node = m_postInsertionNotificationTargets[i].get();
         if (node->inDocument())
             node->didNotifySubtreeInsertionsToDocument();
     }
 }
 
 inline void ChildNodeRemovalNotifier::notifyNodeRemovedFromDocument(Node* node)
@@ skipping 96 matching lines @@
         for (Node* child = m_root->firstChild(); child; child = child->nextSibling())
             collectFrameOwners(child);
     }
 
     disconnectCollectedFrameOwners();
 }
 
 } // namespace WebCore
 
 #endif // ContainerNodeAlgorithms_h