Absolutify paths to dom/.

Source/core/dom/EventRetargeter.cpp

 /*
  * Copyright (C) 2013 Google Inc. All rights reserved.
  *
  * 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,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  * Library General Public License for more details.
  *
  * You should have received a copy of the GNU Library General Public License
  * along with this library; see the file COPYING.LIB.  If not, write to
  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  * Boston, MA 02110-1301, USA.
  */
 
 #include "config.h"
-#include "EventRetargeter.h"
+#include "core/dom/EventRetargeter.h"
 
-#include "ContainerNode.h"
-#include "EventContext.h"
-#include "EventPathWalker.h"
-#include "FocusEvent.h"
-#include "MouseEvent.h"
-#include "ShadowRoot.h"
-#include "Touch.h"
-#include "TouchEvent.h"
-#include "TouchList.h"
-#include "TreeScope.h"
+#include "core/dom/ContainerNode.h"
+#include "core/dom/EventContext.h"
+#include "core/dom/EventPathWalker.h"
+#include "core/dom/FocusEvent.h"
+#include "core/dom/MouseEvent.h"
+#include "core/dom/ShadowRoot.h"
+#include "core/dom/Touch.h"
+#include "core/dom/TouchEvent.h"
+#include "core/dom/TouchList.h"
+#include "core/dom/TreeScope.h"
 #include <wtf/PassRefPtr.h>
 #include <wtf/RefPtr.h>
 #include <wtf/Vector.h>
 
 namespace WebCore {
 
 static inline bool inTheSameScope(ShadowRoot* shadowRoot, EventTarget* target)
 {
     return target->toNode() && target->toNode()->treeScope()->rootNode() == shadowRoot;
 }
@@ skipping 199 matching lines @@
             break;
         }
         scope = scope->parentTreeScope();
     }
     for (Vector<TreeScope*, 32>::iterator iter = parentTreeScopes.begin(); iter < parentTreeScopes.end(); ++iter)
         relatedNodeMap.add(*iter, relatedNode);
     return relatedNode;
 }
 
 }