Enable Oilpan for core/xml/

Source/core/xml/XPathResult.cpp

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
@@ skipping 19 matching lines @@
 #include "bindings/core/v8/ExceptionState.h"
 #include "core/dom/Document.h"
 #include "core/dom/ExceptionCode.h"
 #include "core/xml/XPathEvaluator.h"
 #include "core/xml/XPathExpressionNode.h"
 
 namespace blink {
 
 using namespace XPath;
 
-DEFINE_EMPTY_DESTRUCTOR_WILL_BE_REMOVED(XPathResult);
-
 XPathResult::XPathResult(EvaluationContext& context, const Value& value)
     : m_value(value)
     , m_nodeSetPosition(0)
     , m_domTreeVersion(0)
 {
     switch (m_value.type()) {
     case Value::BooleanValue:
         m_resultType = BOOLEAN_TYPE;
         return;
     case Value::NumberValue:
         m_resultType = NUMBER_TYPE;
         return;
     case Value::StringValue:
         m_resultType = STRING_TYPE;
         return;
     case Value::NodeSetValue:
         m_resultType = UNORDERED_NODE_ITERATOR_TYPE;
         m_nodeSetPosition = 0;
         m_nodeSet = NodeSet::create(m_value.toNodeSet(&context));
         m_document = &context.node->document();
         m_domTreeVersion = m_document->domTreeVersion();
         return;
     }
     ASSERT_NOT_REACHED();
 }
 
+XPathResult::~XPathResult()
+{
+}
+
 void XPathResult::trace(Visitor* visitor)
 {
     visitor->trace(m_value);
     visitor->trace(m_nodeSet);
     visitor->trace(m_document);
 }
 
 void XPathResult::convertTo(unsigned short type, ExceptionState& exceptionState)
 {
     switch (type) {
@@ skipping 135 matching lines @@
     }
 
     const NodeSet& nodes = m_value.toNodeSet(0);
     if (index >= nodes.size())
         return 0;
 
     return nodes[index];
 }
 
 }