package core
|
|
|
|
import (
|
|
"errors"
|
|
"fmt"
|
|
"sort"
|
|
|
|
tmmath "github.com/tendermint/tendermint/libs/math"
|
|
tmquery "github.com/tendermint/tendermint/libs/pubsub/query"
|
|
ctypes "github.com/tendermint/tendermint/rpc/core/types"
|
|
rpctypes "github.com/tendermint/tendermint/rpc/jsonrpc/types"
|
|
"github.com/tendermint/tendermint/state/txindex/null"
|
|
"github.com/tendermint/tendermint/types"
|
|
)
|
|
|
|
// Tx allows you to query the transaction results. `nil` could mean the
|
|
// transaction is in the mempool, invalidated, or was not sent in the first
|
|
// place.
|
|
// More: https://docs.tendermint.com/master/rpc/#/Info/tx
|
|
func Tx(ctx *rpctypes.Context, hash []byte, prove bool) (*ctypes.ResultTx, error) {
|
|
// if index is disabled, return error
|
|
if _, ok := env.TxIndexer.(*null.TxIndex); ok {
|
|
return nil, fmt.Errorf("transaction indexing is disabled")
|
|
}
|
|
|
|
r, err := env.TxIndexer.Get(hash)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
if r == nil {
|
|
return nil, fmt.Errorf("tx (%X) not found", hash)
|
|
}
|
|
|
|
height := r.Height
|
|
index := r.Index
|
|
|
|
var proof types.TxProof
|
|
if prove {
|
|
block := env.BlockStore.LoadBlock(height)
|
|
proof = block.Data.Txs.Proof(int(index)) // XXX: overflow on 32-bit machines
|
|
}
|
|
|
|
return &ctypes.ResultTx{
|
|
Hash: hash,
|
|
Height: height,
|
|
Index: index,
|
|
TxResult: r.Result,
|
|
Tx: r.Tx,
|
|
Proof: proof,
|
|
}, nil
|
|
}
|
|
|
|
// TxSearch allows you to query for multiple transactions results. It returns a
|
|
// list of transactions (maximum ?per_page entries) and the total count.
|
|
// More: https://docs.tendermint.com/master/rpc/#/Info/tx_search
|
|
func TxSearch(ctx *rpctypes.Context, query string, prove bool, pagePtr, perPagePtr *int, orderBy string) (
|
|
*ctypes.ResultTxSearch, error) {
|
|
// if index is disabled, return error
|
|
if _, ok := env.TxIndexer.(*null.TxIndex); ok {
|
|
return nil, errors.New("transaction indexing is disabled")
|
|
}
|
|
|
|
q, err := tmquery.New(query)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
results, err := env.TxIndexer.Search(ctx.Context(), q)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
// sort results (must be done before pagination)
|
|
switch orderBy {
|
|
case "desc":
|
|
sort.Slice(results, func(i, j int) bool {
|
|
if results[i].Height == results[j].Height {
|
|
return results[i].Index > results[j].Index
|
|
}
|
|
return results[i].Height > results[j].Height
|
|
})
|
|
case "asc", "":
|
|
sort.Slice(results, func(i, j int) bool {
|
|
if results[i].Height == results[j].Height {
|
|
return results[i].Index < results[j].Index
|
|
}
|
|
return results[i].Height < results[j].Height
|
|
})
|
|
default:
|
|
return nil, errors.New("expected order_by to be either `asc` or `desc` or empty")
|
|
}
|
|
|
|
// paginate results
|
|
totalCount := len(results)
|
|
perPage := validatePerPage(perPagePtr)
|
|
page, err := validatePage(pagePtr, perPage, totalCount)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
skipCount := validateSkipCount(page, perPage)
|
|
pageSize := tmmath.MinInt(perPage, totalCount-skipCount)
|
|
|
|
apiResults := make([]*ctypes.ResultTx, 0, pageSize)
|
|
for i := skipCount; i < skipCount+pageSize; i++ {
|
|
r := results[i]
|
|
|
|
var proof types.TxProof
|
|
if prove {
|
|
block := env.BlockStore.LoadBlock(r.Height)
|
|
proof = block.Data.Txs.Proof(int(r.Index)) // XXX: overflow on 32-bit machines
|
|
}
|
|
|
|
apiResults = append(apiResults, &ctypes.ResultTx{
|
|
Hash: r.Tx.Hash(),
|
|
Height: r.Height,
|
|
Index: r.Index,
|
|
TxResult: r.Result,
|
|
Tx: r.Tx,
|
|
Proof: proof,
|
|
})
|
|
}
|
|
|
|
return &ctypes.ResultTxSearch{Txs: apiResults, TotalCount: totalCount}, nil
|
|
}
|