/* <!-- copyright */
/*
 * aria2 - The high speed download utility
 *
 * Copyright (C) 2006 Tatsuhiro Tsujikawa
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 *
 * In addition, as a special exception, the copyright holders give
 * permission to link the code of portions of this program with the
 * OpenSSL library under certain conditions as described in each
 * individual source file, and distribute linked combinations
 * including the two.
 * You must obey the GNU General Public License in all respects
 * for all of the code used other than OpenSSL.  If you modify
 * file(s) with this exception, you may extend this exception to your
 * version of the file(s), but you are not obligated to do so.  If you
 * do not wish to do so, delete this exception statement from your
 * version.  If you delete this exception statement from all source
 * files in the program, then also delete it here.
 */
/* copyright --> */
#include "DHTFindNodeMessage.h"
#include "DHTNode.h"
#include "Data.h"
#include "Dictionary.h"
#include "DHTRoutingTable.h"
#include "DHTMessageFactory.h"
#include "DHTMessageDispatcher.h"
#include "DHTMessageCallback.h"
#include "Util.h"
#include <cstring>

namespace aria2 {

const std::string DHTFindNodeMessage::FIND_NODE("find_node");

const std::string DHTFindNodeMessage::TARGET_NODE("target");

DHTFindNodeMessage::DHTFindNodeMessage(const SharedHandle<DHTNode>& localNode,
				       const SharedHandle<DHTNode>& remoteNode,
				       const unsigned char* targetNodeID,
				       const std::string& transactionID):
  DHTQueryMessage(localNode, remoteNode, transactionID)
{
  memcpy(_targetNodeID, targetNodeID, DHT_ID_LENGTH);
}

DHTFindNodeMessage::~DHTFindNodeMessage() {}

void DHTFindNodeMessage::doReceivedAction()
{
  std::deque<SharedHandle<DHTNode> > nodes;
  _routingTable->getClosestKNodes(nodes, _targetNodeID);
  SharedHandle<DHTMessage> reply =
    _factory->createFindNodeReplyMessage(_remoteNode, nodes, _transactionID);
  _dispatcher->addMessageToQueue(reply);
}

Dictionary* DHTFindNodeMessage::getArgument()
{
  Dictionary* a = new Dictionary();
  a->put(DHTMessage::ID, new Data(reinterpret_cast<const char*>(_localNode->getID()),
			DHT_ID_LENGTH));
  a->put(TARGET_NODE, new Data(reinterpret_cast<const char*>(_targetNodeID),
			    DHT_ID_LENGTH));
  return a;
}

std::string DHTFindNodeMessage::getMessageType() const
{
  return FIND_NODE;
}

void DHTFindNodeMessage::validate() const {}

std::string DHTFindNodeMessage::toStringOptional() const
{
  return "targetNodeID="+Util::toHex(_targetNodeID, DHT_ID_LENGTH);
}

} // namespace aria2
