staketree.go

package txhelpers

import (
	"fmt"
	"os"

	"github.com/bitum-project/bitumd/blockchain/stake"
	"github.com/bitum-project/bitumd/chaincfg"
	"github.com/bitum-project/bitumd/chaincfg/chainhash"
	"github.com/bitum-project/bitumd/database"
	_ "github.com/bitum-project/bitumd/database/ffldb" // init the ffldb driver
	"github.com/bitum-project/bitumd/bitumutil"
	"github.com/bitum-project/bitumd/rpcclient"
	"github.com/bitum-project/bitumd/wire"
)

const (
	// dbType is the database backend type to use
	dbType = "ffldb"
	// DefaultStakeDbName is the default database name
	DefaultStakeDbName = "ffldb_stake"
)

// TODO: maybe kill this function, but definitely make a new one that is a stake
// tree update with a single block or chunk of blocks.  This does NOT SCALE!

// BuildStakeTree returns a database with a stake tree
func BuildStakeTree(blocks map[int64]*bitumutil.Block, netParams *chaincfg.Params,
	nodeClient *rpcclient.Client, poolRequiredHeight int64, DBName ...string) (database.DB, []int64, error) {

	if blocks[0] == nil || blocks[0].Height() != 0 {
		return nil, nil, fmt.Errorf("Must start at height 0")
	}

	height := int64(len(blocks) - 1)

	// Create a new database to store the accepted stake node data into.
	dbName := DefaultStakeDbName
	if len(DBName) > 0 {
		dbName = DBName[0]
	}
	_ = os.RemoveAll(dbName)
	db, err := database.Create(dbType, dbName, netParams.Net)
	if err != nil {
		return db, nil, fmt.Errorf("error creating db: %v", err)
	}
	//defer db.Close()

	// Load the genesis block
	var bestNode *stake.Node
	err = db.Update(func(dbTx database.Tx) error {
		var errLocal error
		bestNode, errLocal = stake.InitDatabaseState(dbTx, netParams)
		return errLocal
	})
	if err != nil {
		db.Close()
		return nil, nil, err
	}

	poolValues := make([]int64, height+1)
	// a ticket treap would be nice, but a map will do for a cache
	liveTicketMap := make(map[chainhash.Hash]int64)
	err = db.Update(func(dbTx database.Tx) error {
		for i := int64(1); i <= height; i++ {
			block := blocks[i]
			//header := &block.MsgBlock().Header
			numLive := bestNode.PoolSize()
			// if int(header.PoolSize) != numLive {
			// 	fmt.Printf("bad number of live tickets: want %v, got %v (%v)\n",
			// 		header.PoolSize, numLive, numLive-int(header.PoolSize))
			// }
			// if header.FinalState != bestNode.FinalState() {
			// 	fmt.Printf("bad final state: want %x, got %x\n",
			// 		header.FinalState, bestNode.FinalState())
			// }

			if i >= poolRequiredHeight {
				liveTickets := bestNode.LiveTickets()
				var amt int64
				for _, hash := range liveTickets {
					val, ok := liveTicketMap[hash]
					if !ok {
						tx, err := nodeClient.GetRawTransaction(&hash)
						if err != nil {
							fmt.Printf("Unable to get transaction %v: %v\n", hash, err)
							continue
						}
						// This isn't quite right for pool tickets where the small
						// pool fees are included in vout[0], but it's close.
						val = tx.MsgTx().TxOut[0].Value
						liveTicketMap[hash] = val
					}
					amt += val
				}
				poolValues[i] = amt
			}

			if i%100 == 0 {
				fmt.Printf("%d (%d, %d)\n", i, len(liveTicketMap), numLive)
			}

			var ticketsToAdd []chainhash.Hash
			if i >= netParams.StakeEnabledHeight {
				matureHeight := (i - int64(netParams.TicketMaturity))
				ticketsToAdd, _ = TicketsInBlock(blocks[matureHeight])
			}

			spentTickets := TicketsSpentInBlock(block)
			for i := range spentTickets {
				delete(liveTicketMap, spentTickets[i])
			}
			revokedTickets := RevokedTicketsInBlock(block)
			for i := range revokedTickets {
				delete(liveTicketMap, revokedTickets[i])
			}

			hB, errx := block.BlockHeaderBytes()
			if errx != nil {
				return fmt.Errorf("unable to serialize block header: %v", errx)
			}

			bestNode, err = bestNode.ConnectNode(stake.CalcHash256PRNGIV(hB),
				spentTickets, revokedTickets, ticketsToAdd)
			if err != nil {
				return fmt.Errorf("couldn't connect node: %v", err.Error())
			}

			// Write the new node to db.
			err = stake.WriteConnectedBestNode(dbTx, bestNode, *block.Hash())
			if err != nil {
				return fmt.Errorf("failure writing the best node: %v",
					err.Error())
			}
		}

		return nil
	})

	return db, poolValues, err
}

/// kang

// TicketsInBlock finds all the new tickets in the block.
func TicketsInBlock(bl *bitumutil.Block) ([]chainhash.Hash, []*wire.MsgTx) {
	tickets := make([]chainhash.Hash, 0)
	ticketsMsgTx := make([]*wire.MsgTx, 0)
	for _, stx := range bl.STransactions() {
		if stake.DetermineTxType(stx.MsgTx()) == stake.TxTypeSStx {
			h := stx.Hash()
			tickets = append(tickets, *h)
			ticketsMsgTx = append(ticketsMsgTx, stx.MsgTx())
		}
	}

	return tickets, ticketsMsgTx
}

// TicketTxnsInBlock finds all the new tickets in the block.
func TicketTxnsInBlock(bl *bitumutil.Block) ([]chainhash.Hash, []*bitumutil.Tx) {
	tickets := make([]chainhash.Hash, 0)
	ticketTxns := make([]*bitumutil.Tx, 0)
	for _, stx := range bl.STransactions() {
		if stake.DetermineTxType(stx.MsgTx()) == stake.TxTypeSStx {
			h := stx.Hash()
			tickets = append(tickets, *h)
			ticketTxns = append(ticketTxns, stx)
		}
	}

	return tickets, ticketTxns
}

// TicketsSpentInBlock finds all the tickets spent in the block.
func TicketsSpentInBlock(bl *bitumutil.Block) []chainhash.Hash {
	tickets := make([]chainhash.Hash, 0)
	for _, stx := range bl.STransactions() {
		if stake.DetermineTxType(stx.MsgTx()) == stake.TxTypeSSGen {
			// Hash of the original STtx
			tickets = append(tickets, stx.MsgTx().TxIn[1].PreviousOutPoint.Hash)
		}
	}

	return tickets
}

// VotesInBlock finds all the votes in the block.
func VotesInBlock(bl *bitumutil.Block) []chainhash.Hash {
	votes := make([]chainhash.Hash, 0)
	for _, stx := range bl.STransactions() {
		if stake.DetermineTxType(stx.MsgTx()) == stake.TxTypeSSGen {
			h := stx.Hash()
			votes = append(votes, *h)
		}
	}

	return votes
}

// RevokedTicketsInBlock finds all the revoked tickets in the block.
func RevokedTicketsInBlock(bl *bitumutil.Block) []chainhash.Hash {
	tickets := make([]chainhash.Hash, 0)
	for _, stx := range bl.STransactions() {
		if stake.DetermineTxType(stx.MsgTx()) == stake.TxTypeSSRtx {
			tickets = append(tickets, stx.MsgTx().TxIn[0].PreviousOutPoint.Hash)
		}
	}

	return tickets
}