package p2p

import (
	"bytes"
	"crypto/sha1"
	"fmt"
	"log"
	"net"
	"sync"

	"github.com/veggiedefender/torrent-client/message"
)

const maxBlockSize = 32768

// Peer encodes connection information for a peer
type Peer struct {
	IP   net.IP
	Port uint16
}

// Download holds data required to download a torrent from a list of peers
type Download struct {
	Peers       []Peer
	PeerID      [20]byte
	InfoHash    [20]byte
	PieceHashes [][20]byte
	Length      int
}

type pieceWork struct {
	index int
	hash  [20]byte
}

type swarm struct {
	clients    []*client
	queue      chan *pieceWork
	buf        []byte
	piecesDone int
	mux        sync.Mutex
}

// Download downloads a torrent
func (d *Download) Download() ([]byte, error) {
	clients := d.initClients()
	if len(clients) == 0 {
		return nil, fmt.Errorf("Could not connect to any of %d clients", len(d.Peers))
	}
	log.Printf("Connected to %d clients\n", len(clients))

	queue := make(chan *pieceWork, len(d.PieceHashes))
	for index, hash := range d.PieceHashes {
		queue <- &pieceWork{index, hash}
	}
	return d.processQueue(clients, queue), nil
}

func (d *Download) initClients() []*client {
	// Create clients in parallel
	c := make(chan *client)
	for _, p := range d.Peers {
		go func(p Peer) {
			client, err := newClient(p, d.PeerID, d.InfoHash)
			if err != nil {
				c <- nil
			} else {
				c <- client
			}
		}(p)
	}

	// Gather clients into a slice
	clients := make([]*client, 0)
	for range d.Peers {
		client := <-c
		if client != nil {
			clients = append(clients, client)
		}
	}
	return clients
}

func (s *swarm) selectClient(index int) (*client, error) {
	for _, c := range s.clients {
		if !c.engaged && !c.choked && c.hasPiece(index) {
			return c, nil
		}
	}
	for _, c := range s.clients {
		if !c.engaged && c.hasPiece(index) {
			return c, nil
		}
	}
	return nil, fmt.Errorf("Could not find client for piece %d", index)
}

func calculateBoundsForPiece(index, numPieces, length int) (int, int) {
	pieceLength := length / numPieces
	begin := index * pieceLength
	end := begin + pieceLength
	if end > length-1 {
		end = length - 1
	}
	return begin, end
}

func checkIntegrity(pw *pieceWork, buf []byte) error {
	hash := sha1.Sum(buf)
	if !bytes.Equal(hash[:], pw.hash[:]) {
		return fmt.Errorf("Index %d failed integrity check", pw.index)
	}
	return nil
}

func downloadPiece(c *client, pw *pieceWork, pieceLength int) ([]byte, error) {
	buf := make([]byte, pieceLength)
	c.unchoke()
	c.interested()
	offset := 0
	for c.hasNext() {
		msg, err := c.read() // this call blocks
		if err != nil {
			return nil, err
		}
		if msg == nil { // keep-alive
			continue
		}
		fmt.Println("CATCHING UP ON", msg)
		switch msg.ID {
		case message.MsgUnchoke:
			c.choked = false
		case message.MsgChoke:
			c.choked = true
		}
	}

	for offset < pieceLength {
		if !c.choked {
			blockSize := maxBlockSize
			if pieceLength-offset < blockSize {
				// Last block might be shorter than the typical block
				blockSize = pieceLength - offset
			}
			c.request(pw.index, offset, blockSize)
		}

		msg, err := c.read() // this call blocks
		if err != nil {
			return nil, err
		}
		if msg == nil { // keep-alive
			continue
		}
		if msg.ID != message.MsgPiece {
			fmt.Println(msg)
		}
		switch msg.ID {
		case message.MsgUnchoke:
			c.choked = false
		case message.MsgChoke:
			c.choked = true
		case message.MsgPiece:
			n, err := message.ParsePiece(pw.index, buf, msg)
			if err != nil {
				return nil, err
			}
			offset += n
		}
	}

	c.have(pw.index)
	c.notInterested()

	err := checkIntegrity(pw, buf)
	if err != nil {
		return nil, err
	}

	return buf, nil
}

func (s *swarm) removeClient(c *client) {
	log.Printf("Removing client. %d clients remaining\n", len(s.clients))
	s.mux.Lock()
	var i int
	for i = 0; i < len(s.clients); i++ {
		if s.clients[i] == c {
			break
		}
	}
	s.clients = append(s.clients[:i], s.clients[i+1:]...)
	s.mux.Unlock()
}

func (s *swarm) worker(d *Download, wg *sync.WaitGroup) {
	for pw := range s.queue {
		s.mux.Lock()
		c, err := s.selectClient(pw.index)
		if err != nil {
			// Re-enqueue the piece to try again
			s.queue <- pw
			s.mux.Unlock()
			continue
		}
		c.engaged = true
		s.mux.Unlock()

		begin, end := calculateBoundsForPiece(pw.index, len(d.PieceHashes), d.Length)
		pieceLength := end - begin
		pieceBuf, err := downloadPiece(c, pw, pieceLength)
		if err != nil {
			// Re-enqueue the piece to try again
			log.Println(err)
			s.removeClient(c)
			s.queue <- pw
		} else {
			// Copy into buffer should not overlap with other workers
			copy(s.buf[begin:end], pieceBuf)

			s.mux.Lock()
			s.piecesDone++
			log.Printf("Downloaded piece %d (%d/%d) %0.2f%%\n", pw.index, s.piecesDone, len(d.PieceHashes), float64(s.piecesDone)/float64(len(d.PieceHashes)))
			s.mux.Unlock()

			if s.piecesDone == len(d.PieceHashes) {
				close(s.queue)
			}
		}

		s.mux.Lock()
		c.engaged = false
		s.mux.Unlock()
	}
	wg.Done()
}

func (d *Download) processQueue(clients []*client, queue chan *pieceWork) []byte {
	s := swarm{
		clients: clients,
		queue:   queue,
		buf:     make([]byte, d.Length),
		mux:     sync.Mutex{},
	}

	numWorkers := len(s.clients) / 2
	log.Printf("Spawning %d workers\n", numWorkers)
	wg := sync.WaitGroup{}
	wg.Add(numWorkers)

	for i := 0; i < numWorkers; i++ {
		go s.worker(d, &wg)
	}

	wg.Wait()
	return s.buf
}