Minor simplification in Node::previousNodeConsideringAtomicNodes.

Source/core/dom/Node.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
  * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 988 matching lines @@
 
 // FIXME: This code is used by editing.  Seems like it could move over there and not pollute Node.
 Node* Node::previousNodeConsideringAtomicNodes() const
 {
     if (previousSibling()) {
         Node* n = previousSibling();
         while (!isAtomicNode(n) && n->lastChild())
             n = n->lastChild();
         return n;
     }
-    if (parentNode()) {
-        return parentNode();
-    }
-    return nullptr;
+    return parentNode();
 }
 
 Node* Node::nextNodeConsideringAtomicNodes() const
 {
     if (!isAtomicNode(this) && hasChildren())
         return firstChild();
     if (nextSibling())
         return nextSibling();
     const Node* n = this;
     while (n && !n->nextSibling())
@@ skipping 1476 matching lines @@
 
 void showNodePath(const blink::Node* node)
 {
     if (node)
         node->showNodePathForThis();
     else
         fprintf(stderr, "Cannot showNodePath for (nil)\n");
 }
 
 #endif