// Copyright Fuzamei Corp. 2018 All Rights Reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package blockchain

import (
	"container/list"
	"math/big"
	"sync"

	"github.com/33cn/chain33/common"
	"github.com/33cn/chain33/common/difficulty"
	"github.com/33cn/chain33/types"
)

type blockNode struct {
	parent     *blockNode
	hash       []byte
	Difficulty *big.Int
	height     int64
	statehash  []byte
	broadcast  bool
	pid        string
	sequence   int64
}

type blockIndex struct {
	sync.RWMutex
	index      map[string]*list.Element
	cacheQueue *list.List
}

const (
	indexCacheLimit = 102400 //目前 暂定index链缓存blocknode的个数
)

func initBlockNode(node *blockNode, block *types.Block, broadcast bool, pid string, sequence int64) {
	*node = blockNode{
		hash:       block.Hash(),
		Difficulty: difficulty.CalcWork(block.Difficulty),
		height:     block.Height,
		statehash:  block.GetStateHash(),
		broadcast:  broadcast,
		pid:        pid,
		sequence:   sequence,
	}
}

func newBlockNode(broadcast bool, block *types.Block, pid string, sequence int64) *blockNode {
	var node blockNode
	initBlockNode(&node, block, broadcast, pid, sequence)
	return &node
}

//通过区块头构造blocknode节点
func newBlockNodeByHeader(broadcast bool, header *types.Header, pid string, sequence int64) *blockNode {
	node := &blockNode{
		hash:       header.Hash,
		Difficulty: difficulty.CalcWork(header.Difficulty),
		height:     header.Height,
		statehash:  header.GetStateHash(),
		broadcast:  broadcast,
		pid:        pid,
		sequence:   sequence,
	}
	return node
}

func newPreGenBlockNode() *blockNode {
	node := &blockNode{
		hash:       common.Hash{}.Bytes(),
		Difficulty: big.NewInt(-1),
		height:     -1,
		statehash:  common.Hash{}.Bytes(),
		broadcast:  false,
		pid:        "self",
	}
	return node
}

func (node *blockNode) Ancestor(height int64) *blockNode {
	if height < 0 || height > node.height {
		return nil
	}

	n := node
	for ; n != nil && n.height != height; n = n.parent {
		// Intentionally left blank
	}

	return n
}
func (node *blockNode) RelativeAncestor(distance int64) *blockNode {
	return node.Ancestor(node.height - distance)
}

func newBlockIndex() *blockIndex {
	return &blockIndex{
		index:      make(map[string]*list.Element),
		cacheQueue: list.New(),
	}
}

func (bi *blockIndex) HaveBlock(hash []byte) bool {
	bi.Lock()
	defer bi.Unlock()
	_, hasBlock := bi.index[string(hash)]

	return hasBlock
}

func (bi *blockIndex) LookupNode(hash []byte) *blockNode {
	bi.Lock()
	defer bi.Unlock()

	elem, ok := bi.index[string(hash)]
	if ok {
		return elem.Value.(*blockNode)
	}

	return nil
}

func (bi *blockIndex) AddNode(node *blockNode) {
	bi.Lock()
	defer bi.Unlock()

	// Create entry in cache and append to cacheQueue.
	elem := bi.cacheQueue.PushBack(node)
	bi.index[string(node.hash)] = elem

	// Maybe expire an item.
	if int64(bi.cacheQueue.Len()) > indexCacheLimit {
		delnode := bi.cacheQueue.Remove(bi.cacheQueue.Front()).(*blockNode)
		//将删除节点的parent指针设置成空，用于释放parent节点
		delnode.parent = nil
		delete(bi.index, string(delnode.hash))
	}
}

func (bi *blockIndex) UpdateNode(hash []byte, node *blockNode) bool {
	bi.Lock()
	defer bi.Unlock()
	elem, ok := bi.index[string(hash)]
	if !ok {
		return false
	}
	elem.Value = node
	delete(bi.index, string(hash))
	bi.index[string(node.hash)] = elem
	return true
}

//删除index节点
func (bi *blockIndex) DelNode(hash []byte) {
	bi.Lock()
	defer bi.Unlock()

	elem, ok := bi.index[string(hash)]
	if ok {
		delnode := bi.cacheQueue.Remove(elem).(*blockNode)
		delnode.parent = nil
		delete(bi.index, string(hash))
	}
}