/*
 * Copyright (C) 2009-2010 Big Muscle, http://strongdc.sf.net
 *
 * 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.
 */

#ifndef _SEARCHMANAGER_H
#define _SEARCHMANAGER_H

#include "KBucket.h"

#include "dcpp/CID.h"
#include "dcpp/FastAlloc.h"
#include "dcpp/MerkleTree.h"
#include "dcpp/Singleton.h"
#include "dcpp/TimerManager.h"
#include "dcpp/User.h"

namespace dht
{

	struct Search :
		public FastAlloc<Search>
	{

		Search() : partial(false), stopping(false)
		{
		}

		~Search();

		enum SearchType { TYPE_FILE = 1, TYPE_NODE = 3, TYPE_STOREFILE = 4 };	// standard types should match ADC protocol

		Node::Map possibleNodes;	// nodes where send search request soon to
		Node::Map triedNodes;		// nodes where search request has already been sent to
		Node::Map respondedNodes;	// nodes who responded to this search request

		string token;				// search identificator
		string term;				// search term (TTH/CID)
		uint64_t lifeTime;			// time when this search has been started
		int64_t filesize;			// file size
		SearchType type;			// search type
		bool partial;				// is this partial file search?
		bool stopping;				// search is being stopped

		/** Processes this search request */
		void process();
	};

	class SearchManager :
		public Singleton<SearchManager>
	{
	public:
		SearchManager(void);
		~SearchManager(void);

		/** Performs node lookup in the network */
		void findNode(const CID& cid);

		/** Performs value lookup in the network */
		void findFile(const string& tth, const string& token);

		/** Performs node lookup to store key/value pair in the network */
		void findStore(const string& tth, int64_t size, bool partial);

		/** Process incoming search request */
		void processSearchRequest(const Node::Ptr& node, const AdcCommand& cmd);

		/** Process incoming search result */
		void processSearchResult(const Node::Ptr& node, const AdcCommand& cmd);

		/** Processes all running searches and removes long-time ones */
		void processSearches();

		/** Processes incoming search results */
		bool processSearchResults(const UserPtr& user, size_t slots);

	private:

		/** Running search operations */
		typedef unordered_map<string*, Search*, noCaseStringHash, noCaseStringEq> SearchMap;
		SearchMap searches;

		/** Locks access to "searches" */
		CriticalSection cs;

		typedef unordered_multimap< CID, std::pair<uint64_t, SearchResultPtr> > ResultsMap;
		ResultsMap searchResults;

		/** Performs general search operation in the network */
		void search(Search& s);

		/** Sends publishing request */
		void publishFile(const Node::Map& nodes, const string& tth, int64_t size, bool partial);

		/** Checks whether we are alreading searching for a term */
		bool isAlreadySearchingFor(const string& term);

		uint64_t lastSearchFile;

	};

}

#endif	// _SEARCHMANAGER_H
