/*

Copyright (c) 2003, Arvid Norberg
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:

    * Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.
    * Redistributions in binary form must reproduce the above copyright
      notice, this list of conditions and the following disclaimer in
      the documentation and/or other materials provided with the distribution.
    * Neither the name of the author nor the names of its
      contributors may be used to endorse or promote products derived
      from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.

*/

#ifndef TORRENT_POLICY_HPP_INCLUDED
#define TORRENT_POLICY_HPP_INCLUDED

#include <algorithm>
#include <vector>

#include <boost/weak_ptr.hpp>
#include <boost/date_time/posix_time/posix_time.hpp>

#include "libtorrent/peer.hpp"
#include "libtorrent/piece_picker.hpp"

// TODO: should be able to close connections with too low bandwidth to save memory

namespace libtorrent
{

	class torrent;
	class address;
	class peer_connection;

	class policy
	{
	public:

		policy(torrent* t);

		// this is called every 10 seconds to allow
		// for peer choking management
		void pulse();

		// called when an incoming connection is accepted
		void new_connection(const boost::weak_ptr<peer_connection>& c);

		// this is called once for every peer we get from
		// the tracker
		void peer_from_tracker(const address& remote, const peer_id& id);

		// the given connection was just closed
		void connection_closed(const peer_connection& c);

		// the peer has got at least one interesting piece
		void peer_is_interesting(peer_connection& c);

		void piece_finished(peer_connection& c, int index, bool successfully_verified);

		void block_finished(peer_connection& c, piece_block b);

		// the peer choked us
		void choked(peer_connection& c);

		// the peer unchoked us
		void unchoked(peer_connection& c);

		// the peer is interested in our pieces
		void interested(peer_connection& c);

		// the peer is not interested in our pieces
		void not_interested(peer_connection& c);

#ifndef NDEBUG
		bool has_connection(const peer_connection* p);
#endif

	private:

		struct peer
		{
			peer(const peer_id& pid)
				: id(pid)
				, last_optimistically_unchoked(boost::posix_time::second_clock::local_time())
				, connected(boost::posix_time::second_clock::local_time())
				, optimistic_unchokes(0)
				, prev_amount_upload(0)
				, prev_amount_download(0)
			{}

			bool operator==(const peer_id& pid) const
			{ return id == pid; }

			// the id of the peer. This is needed to store information
			// about peers that aren't connected right now. This
			// is to avoid peers reconnecting. unconnected entries
			// will be saved a limited amount of time
			peer_id id;

			// the time when this peer was optimistically unchoked
			// the last time.
			boost::posix_time::ptime last_optimistically_unchoked;

			// the time when the peer connected to us
			// or disconnected if it isn't connected right now
			boost::posix_time::ptime connected;

			// the number of optimistic unchokes this peer has
			// been given
			int optimistic_unchokes;

			// this is the accumulated amount of
			// uploaded and downloaded data to this
			// peer. It only accounts for what was
			// shared during the last connection to
			// this peer. i.e. These are only updated
			// when the connection is closed. For the
			// total amount of upload and download
			// we'll have to add thes figures with the
			// statistics from the peer_connection.
			int prev_amount_upload;
			int prev_amount_download;

			// if the peer is connected now, this
			// will refer to a valid peer_connection
			boost::weak_ptr<peer_connection> connection;
		};

		// a functor that identifies peers that have disconnected and that
		// are too old for still being saved.
		struct old_disconnected_peer
		{
			bool operator()(const peer& p)
			{
				using namespace boost::posix_time;

				return p.connection.expired()
					&& second_clock::local_time() - p.connected > seconds(5*60);
			}
		};


		std::vector<peer> m_peers;

		int m_num_peers;
		torrent* m_torrent;

	};

}

#endif // TORRENT_POLICY_HPP_INCLUDED