|
|
|
@ -22,6 +22,8 @@ import ( |
|
|
|
|
"math/big" |
|
|
|
|
"sort" |
|
|
|
|
|
|
|
|
|
"github.com/pkg/errors" |
|
|
|
|
|
|
|
|
|
"github.com/ethereum/go-ethereum/common" |
|
|
|
|
"github.com/harmony-one/harmony/core/types" |
|
|
|
|
"github.com/harmony-one/harmony/internal/utils" |
|
|
|
@ -123,6 +125,36 @@ func (m *txSortedMap) Filter(filter func(types.PoolTransaction) bool) types.Pool |
|
|
|
|
return removed |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// Filter iterates over the list of transactions and removes all of them for which
|
|
|
|
|
// the specified function evaluates to true. Return the filtered transactions and
|
|
|
|
|
// corresponding errors.
|
|
|
|
|
func (m *txSortedMap) FilterWithError(filter func(types.PoolTransaction) error) (types.PoolTransactions, []error) { |
|
|
|
|
var ( |
|
|
|
|
removed types.PoolTransactions |
|
|
|
|
errs []error |
|
|
|
|
) |
|
|
|
|
|
|
|
|
|
// Collect all the transactions to filter out
|
|
|
|
|
for nonce, tx := range m.items { |
|
|
|
|
if err := filter(tx); err != nil { |
|
|
|
|
removed = append(removed, tx) |
|
|
|
|
errs = append(errs, err) |
|
|
|
|
delete(m.items, nonce) |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
// If transactions were removed, the heap and cache are ruined
|
|
|
|
|
if len(removed) > 0 { |
|
|
|
|
*m.index = make([]uint64, 0, len(m.items)) |
|
|
|
|
for nonce := range m.items { |
|
|
|
|
*m.index = append(*m.index, nonce) |
|
|
|
|
} |
|
|
|
|
heap.Init(m.index) |
|
|
|
|
|
|
|
|
|
m.cache = nil |
|
|
|
|
} |
|
|
|
|
return removed, errs |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// Cap places a hard limit on the number of items, returning all transactions
|
|
|
|
|
// exceeding that limit.
|
|
|
|
|
func (m *txSortedMap) Cap(threshold int) types.PoolTransactions { |
|
|
|
@ -287,26 +319,34 @@ func (l *txList) Forward(threshold uint64) types.PoolTransactions { |
|
|
|
|
// than the provided thresholds and all staking transactions that can not be validated.
|
|
|
|
|
func (l *txList) FilterValid( |
|
|
|
|
txPool *TxPool, address common.Address, |
|
|
|
|
) (types.PoolTransactions, types.PoolTransactions) { |
|
|
|
|
) (types.PoolTransactions, types.PoolTransactions, []error) { |
|
|
|
|
costLimit := txPool.currentState.GetBalance(address) |
|
|
|
|
gasLimit := txPool.currentMaxGas |
|
|
|
|
// If all transactions are below the threshold, short circuit
|
|
|
|
|
if l.costcap.Cmp(costLimit) <= 0 && l.gascap <= gasLimit { |
|
|
|
|
return nil, nil |
|
|
|
|
return nil, nil, nil |
|
|
|
|
} |
|
|
|
|
l.costcap = new(big.Int).Set(costLimit) // Lower the caps to the thresholds
|
|
|
|
|
l.gascap = gasLimit |
|
|
|
|
|
|
|
|
|
return l.Filter(func(tx types.PoolTransaction) bool { |
|
|
|
|
return l.Filter(func(tx types.PoolTransaction) error { |
|
|
|
|
cost, err := tx.Cost() |
|
|
|
|
if err != nil { |
|
|
|
|
return true // failure should lead to removal of the tx
|
|
|
|
|
return err // failure should lead to removal of the tx
|
|
|
|
|
} |
|
|
|
|
if cost.Cmp(costLimit) > 0 { |
|
|
|
|
return errors.New("not enough balance") |
|
|
|
|
} |
|
|
|
|
if tx.GasLimit() > gasLimit { |
|
|
|
|
return errors.New("transaction gas limit exceeding block limit") |
|
|
|
|
} |
|
|
|
|
if _, ok := tx.(*staking.StakingTransaction); ok { |
|
|
|
|
err := txPool.validateTx(tx, false) |
|
|
|
|
return err != nil |
|
|
|
|
if err != nil { |
|
|
|
|
return err |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
return cost.Cmp(costLimit) == 1 || tx.GasLimit() > gasLimit |
|
|
|
|
return nil |
|
|
|
|
}) |
|
|
|
|
} |
|
|
|
|
|
|
|
|
@ -314,13 +354,13 @@ func (l *txList) FilterValid( |
|
|
|
|
// the specified function evaluates to true. Moreover, it returns all transactions
|
|
|
|
|
// that were invalidated from the filter
|
|
|
|
|
func (l *txList) Filter( |
|
|
|
|
filter func(types.PoolTransaction) bool, |
|
|
|
|
) (types.PoolTransactions, types.PoolTransactions) { |
|
|
|
|
filter func(types.PoolTransaction) error, |
|
|
|
|
) (types.PoolTransactions, types.PoolTransactions, []error) { |
|
|
|
|
// If the list was strict, filter anything above the lowest nonce
|
|
|
|
|
var invalids types.PoolTransactions |
|
|
|
|
|
|
|
|
|
// Filter out all the transactions above the account's funds
|
|
|
|
|
removed := l.txs.Filter(filter) |
|
|
|
|
removed, errs := l.txs.FilterWithError(filter) |
|
|
|
|
if l.strict && len(removed) > 0 { |
|
|
|
|
lowest := uint64(math.MaxUint64) |
|
|
|
|
for _, tx := range removed { |
|
|
|
@ -330,7 +370,7 @@ func (l *txList) Filter( |
|
|
|
|
} |
|
|
|
|
invalids = l.txs.Filter(func(tx types.PoolTransaction) bool { return tx.Nonce() > lowest }) |
|
|
|
|
} |
|
|
|
|
return removed, invalids |
|
|
|
|
return removed, invalids, errs |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// Cap places a hard limit on the number of items, returning all transactions
|
|
|
|
|