package torrent

import (
	"math/rand"
	"sync"

	pp "github.com/anacrolix/torrent/peer_protocol"
)

type piecePriority byte

const (
	piecePriorityNone piecePriority = iota
	piecePriorityNormal
	piecePriorityReadahead
	piecePriorityNext
	piecePriorityNow
)

type piece struct {
	Hash pieceSum
	// Chunks we don't have. The offset and length can be determined by our
	// request chunkSize in use.
	PendingChunkSpecs []bool
	Hashing           bool
	QueuedForHash     bool
	EverHashed        bool
	Event             sync.Cond
	Priority          piecePriority
}

func (p *piece) pendingChunk(cs chunkSpec) bool {
	if p.PendingChunkSpecs == nil {
		return false
	}
	return p.PendingChunkSpecs[chunkIndex(cs)]
}

func (p *piece) numPendingChunks() (ret int) {
	for _, pending := range p.PendingChunkSpecs {
		if pending {
			ret++
		}
	}
	return
}

func (p *piece) unpendChunkIndex(i int) {
	if p.PendingChunkSpecs == nil {
		return
	}
	p.PendingChunkSpecs[i] = false
}

func chunkIndexSpec(index int, pieceLength pp.Integer) chunkSpec {
	ret := chunkSpec{pp.Integer(index) * chunkSize, chunkSize}
	if ret.Begin+ret.Length > pieceLength {
		ret.Length = pieceLength - ret.Begin
	}
	return ret
}

func (p *piece) shuffledPendingChunkSpecs(pieceLength pp.Integer) (css []chunkSpec) {
	if p.numPendingChunks() == 0 {
		return
	}
	css = make([]chunkSpec, 0, p.numPendingChunks())
	for i, pending := range p.PendingChunkSpecs {
		if pending {
			css = append(css, chunkIndexSpec(i, pieceLength))
		}
	}
	if len(css) <= 1 {
		return
	}
	for i := range css {
		j := rand.Intn(i + 1)
		css[i], css[j] = css[j], css[i]
	}
	return
}