mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-08-17 17:33:47 +00:00
Merge remote-tracking branch 'upstream/master'
This commit is contained in:
commit
10f5dddcfd
11 changed files with 180 additions and 131 deletions
|
|
@ -266,7 +266,7 @@ instance for mining, run it with all your usual flags, extended by:
|
||||||
$ geth <usual-flags> --mine --minerthreads=1 --etherbase=0x0000000000000000000000000000000000000000
|
$ geth <usual-flags> --mine --minerthreads=1 --etherbase=0x0000000000000000000000000000000000000000
|
||||||
```
|
```
|
||||||
|
|
||||||
Which will start mining bocks and transactions on a single CPU thread, crediting all proceedings to
|
Which will start mining blocks and transactions on a single CPU thread, crediting all proceedings to
|
||||||
the account specified by `--etherbase`. You can further tune the mining by changing the default gas
|
the account specified by `--etherbase`. You can further tune the mining by changing the default gas
|
||||||
limit blocks converge to (`--targetgaslimit`) and the price transactions are accepted at (`--gasprice`).
|
limit blocks converge to (`--targetgaslimit`) and the price transactions are accepted at (`--gasprice`).
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -192,10 +192,12 @@ func (m *Matcher) Start(ctx context.Context, begin, end uint64, results chan uin
|
||||||
}
|
}
|
||||||
// Iterate over all the blocks in the section and return the matching ones
|
// Iterate over all the blocks in the section and return the matching ones
|
||||||
for i := first; i <= last; i++ {
|
for i := first; i <= last; i++ {
|
||||||
// Skip the entire byte if no matches are found inside
|
// Skip the entire byte if no matches are found inside (and we're processing an entire byte!)
|
||||||
next := res.bitset[(i-sectionStart)/8]
|
next := res.bitset[(i-sectionStart)/8]
|
||||||
if next == 0 {
|
if next == 0 {
|
||||||
i += 7
|
if i%8 == 0 {
|
||||||
|
i += 7
|
||||||
|
}
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
// Some bit it set, do the actual submatching
|
// Some bit it set, do the actual submatching
|
||||||
|
|
|
||||||
|
|
@ -56,33 +56,48 @@ func TestMatcherWildcards(t *testing.T) {
|
||||||
|
|
||||||
// Tests the matcher pipeline on a single continuous workflow without interrupts.
|
// Tests the matcher pipeline on a single continuous workflow without interrupts.
|
||||||
func TestMatcherContinuous(t *testing.T) {
|
func TestMatcherContinuous(t *testing.T) {
|
||||||
testMatcherDiffBatches(t, [][]bloomIndexes{{{10, 20, 30}}}, 100000, false, 75)
|
testMatcherDiffBatches(t, [][]bloomIndexes{{{10, 20, 30}}}, 0, 100000, false, 75)
|
||||||
testMatcherDiffBatches(t, [][]bloomIndexes{{{32, 3125, 100}}, {{40, 50, 10}}}, 100000, false, 81)
|
testMatcherDiffBatches(t, [][]bloomIndexes{{{32, 3125, 100}}, {{40, 50, 10}}}, 0, 100000, false, 81)
|
||||||
testMatcherDiffBatches(t, [][]bloomIndexes{{{4, 8, 11}, {7, 8, 17}}, {{9, 9, 12}, {15, 20, 13}}, {{18, 15, 15}, {12, 10, 4}}}, 10000, false, 36)
|
testMatcherDiffBatches(t, [][]bloomIndexes{{{4, 8, 11}, {7, 8, 17}}, {{9, 9, 12}, {15, 20, 13}}, {{18, 15, 15}, {12, 10, 4}}}, 0, 10000, false, 36)
|
||||||
}
|
}
|
||||||
|
|
||||||
// Tests the matcher pipeline on a constantly interrupted and resumed work pattern
|
// Tests the matcher pipeline on a constantly interrupted and resumed work pattern
|
||||||
// with the aim of ensuring data items are requested only once.
|
// with the aim of ensuring data items are requested only once.
|
||||||
func TestMatcherIntermittent(t *testing.T) {
|
func TestMatcherIntermittent(t *testing.T) {
|
||||||
testMatcherDiffBatches(t, [][]bloomIndexes{{{10, 20, 30}}}, 100000, true, 75)
|
testMatcherDiffBatches(t, [][]bloomIndexes{{{10, 20, 30}}}, 0, 100000, true, 75)
|
||||||
testMatcherDiffBatches(t, [][]bloomIndexes{{{32, 3125, 100}}, {{40, 50, 10}}}, 100000, true, 81)
|
testMatcherDiffBatches(t, [][]bloomIndexes{{{32, 3125, 100}}, {{40, 50, 10}}}, 0, 100000, true, 81)
|
||||||
testMatcherDiffBatches(t, [][]bloomIndexes{{{4, 8, 11}, {7, 8, 17}}, {{9, 9, 12}, {15, 20, 13}}, {{18, 15, 15}, {12, 10, 4}}}, 10000, true, 36)
|
testMatcherDiffBatches(t, [][]bloomIndexes{{{4, 8, 11}, {7, 8, 17}}, {{9, 9, 12}, {15, 20, 13}}, {{18, 15, 15}, {12, 10, 4}}}, 0, 10000, true, 36)
|
||||||
}
|
}
|
||||||
|
|
||||||
// Tests the matcher pipeline on random input to hopefully catch anomalies.
|
// Tests the matcher pipeline on random input to hopefully catch anomalies.
|
||||||
func TestMatcherRandom(t *testing.T) {
|
func TestMatcherRandom(t *testing.T) {
|
||||||
for i := 0; i < 10; i++ {
|
for i := 0; i < 10; i++ {
|
||||||
testMatcherBothModes(t, makeRandomIndexes([]int{1}, 50), 10000, 0)
|
testMatcherBothModes(t, makeRandomIndexes([]int{1}, 50), 0, 10000, 0)
|
||||||
testMatcherBothModes(t, makeRandomIndexes([]int{3}, 50), 10000, 0)
|
testMatcherBothModes(t, makeRandomIndexes([]int{3}, 50), 0, 10000, 0)
|
||||||
testMatcherBothModes(t, makeRandomIndexes([]int{2, 2, 2}, 20), 10000, 0)
|
testMatcherBothModes(t, makeRandomIndexes([]int{2, 2, 2}, 20), 0, 10000, 0)
|
||||||
testMatcherBothModes(t, makeRandomIndexes([]int{5, 5, 5}, 50), 10000, 0)
|
testMatcherBothModes(t, makeRandomIndexes([]int{5, 5, 5}, 50), 0, 10000, 0)
|
||||||
testMatcherBothModes(t, makeRandomIndexes([]int{4, 4, 4}, 20), 10000, 0)
|
testMatcherBothModes(t, makeRandomIndexes([]int{4, 4, 4}, 20), 0, 10000, 0)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Tests that the matcher can properly find matches if the starting block is
|
||||||
|
// shifter from a multiple of 8. This is needed to cover an optimisation with
|
||||||
|
// bitset matching https://github.com/ethereum/go-ethereum/issues/15309.
|
||||||
|
func TestMatcherShifted(t *testing.T) {
|
||||||
|
// Block 0 always matches in the tests, skip ahead of first 8 blocks with the
|
||||||
|
// start to get a potential zero byte in the matcher bitset.
|
||||||
|
|
||||||
|
// To keep the second bitset byte zero, the filter must only match for the first
|
||||||
|
// time in block 16, so doing an all-16 bit filter should suffice.
|
||||||
|
|
||||||
|
// To keep the starting block non divisible by 8, block number 9 is the first
|
||||||
|
// that would introduce a shift and not match block 0.
|
||||||
|
testMatcherBothModes(t, [][]bloomIndexes{{{16, 16, 16}}}, 9, 64, 0)
|
||||||
|
}
|
||||||
|
|
||||||
// Tests that matching on everything doesn't crash (special case internally).
|
// Tests that matching on everything doesn't crash (special case internally).
|
||||||
func TestWildcardMatcher(t *testing.T) {
|
func TestWildcardMatcher(t *testing.T) {
|
||||||
testMatcherBothModes(t, nil, 10000, 0)
|
testMatcherBothModes(t, nil, 0, 10000, 0)
|
||||||
}
|
}
|
||||||
|
|
||||||
// makeRandomIndexes generates a random filter system, composed on multiple filter
|
// makeRandomIndexes generates a random filter system, composed on multiple filter
|
||||||
|
|
@ -104,9 +119,9 @@ func makeRandomIndexes(lengths []int, max int) [][]bloomIndexes {
|
||||||
// testMatcherDiffBatches runs the given matches test in single-delivery and also
|
// testMatcherDiffBatches runs the given matches test in single-delivery and also
|
||||||
// in batches delivery mode, verifying that all kinds of deliveries are handled
|
// in batches delivery mode, verifying that all kinds of deliveries are handled
|
||||||
// correctly withn.
|
// correctly withn.
|
||||||
func testMatcherDiffBatches(t *testing.T, filter [][]bloomIndexes, blocks uint64, intermittent bool, retrievals uint32) {
|
func testMatcherDiffBatches(t *testing.T, filter [][]bloomIndexes, start, blocks uint64, intermittent bool, retrievals uint32) {
|
||||||
singleton := testMatcher(t, filter, blocks, intermittent, retrievals, 1)
|
singleton := testMatcher(t, filter, start, blocks, intermittent, retrievals, 1)
|
||||||
batched := testMatcher(t, filter, blocks, intermittent, retrievals, 16)
|
batched := testMatcher(t, filter, start, blocks, intermittent, retrievals, 16)
|
||||||
|
|
||||||
if singleton != batched {
|
if singleton != batched {
|
||||||
t.Errorf("filter = %v blocks = %v intermittent = %v: request count mismatch, %v in signleton vs. %v in batched mode", filter, blocks, intermittent, singleton, batched)
|
t.Errorf("filter = %v blocks = %v intermittent = %v: request count mismatch, %v in signleton vs. %v in batched mode", filter, blocks, intermittent, singleton, batched)
|
||||||
|
|
@ -115,9 +130,9 @@ func testMatcherDiffBatches(t *testing.T, filter [][]bloomIndexes, blocks uint64
|
||||||
|
|
||||||
// testMatcherBothModes runs the given matcher test in both continuous as well as
|
// testMatcherBothModes runs the given matcher test in both continuous as well as
|
||||||
// in intermittent mode, verifying that the request counts match each other.
|
// in intermittent mode, verifying that the request counts match each other.
|
||||||
func testMatcherBothModes(t *testing.T, filter [][]bloomIndexes, blocks uint64, retrievals uint32) {
|
func testMatcherBothModes(t *testing.T, filter [][]bloomIndexes, start, blocks uint64, retrievals uint32) {
|
||||||
continuous := testMatcher(t, filter, blocks, false, retrievals, 16)
|
continuous := testMatcher(t, filter, start, blocks, false, retrievals, 16)
|
||||||
intermittent := testMatcher(t, filter, blocks, true, retrievals, 16)
|
intermittent := testMatcher(t, filter, start, blocks, true, retrievals, 16)
|
||||||
|
|
||||||
if continuous != intermittent {
|
if continuous != intermittent {
|
||||||
t.Errorf("filter = %v blocks = %v: request count mismatch, %v in continuous vs. %v in intermittent mode", filter, blocks, continuous, intermittent)
|
t.Errorf("filter = %v blocks = %v: request count mismatch, %v in continuous vs. %v in intermittent mode", filter, blocks, continuous, intermittent)
|
||||||
|
|
@ -126,7 +141,7 @@ func testMatcherBothModes(t *testing.T, filter [][]bloomIndexes, blocks uint64,
|
||||||
|
|
||||||
// testMatcher is a generic tester to run the given matcher test and return the
|
// testMatcher is a generic tester to run the given matcher test and return the
|
||||||
// number of requests made for cross validation between different modes.
|
// number of requests made for cross validation between different modes.
|
||||||
func testMatcher(t *testing.T, filter [][]bloomIndexes, blocks uint64, intermittent bool, retrievals uint32, maxReqCount int) uint32 {
|
func testMatcher(t *testing.T, filter [][]bloomIndexes, start, blocks uint64, intermittent bool, retrievals uint32, maxReqCount int) uint32 {
|
||||||
// Create a new matcher an simulate our explicit random bitsets
|
// Create a new matcher an simulate our explicit random bitsets
|
||||||
matcher := NewMatcher(testSectionSize, nil)
|
matcher := NewMatcher(testSectionSize, nil)
|
||||||
matcher.filters = filter
|
matcher.filters = filter
|
||||||
|
|
@ -145,14 +160,14 @@ func testMatcher(t *testing.T, filter [][]bloomIndexes, blocks uint64, intermitt
|
||||||
quit := make(chan struct{})
|
quit := make(chan struct{})
|
||||||
matches := make(chan uint64, 16)
|
matches := make(chan uint64, 16)
|
||||||
|
|
||||||
session, err := matcher.Start(context.Background(), 0, blocks-1, matches)
|
session, err := matcher.Start(context.Background(), start, blocks-1, matches)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatalf("failed to stat matcher session: %v", err)
|
t.Fatalf("failed to stat matcher session: %v", err)
|
||||||
}
|
}
|
||||||
startRetrievers(session, quit, &requested, maxReqCount)
|
startRetrievers(session, quit, &requested, maxReqCount)
|
||||||
|
|
||||||
// Iterate over all the blocks and verify that the pipeline produces the correct matches
|
// Iterate over all the blocks and verify that the pipeline produces the correct matches
|
||||||
for i := uint64(0); i < blocks; i++ {
|
for i := start; i < blocks; i++ {
|
||||||
if expMatch3(filter, i) {
|
if expMatch3(filter, i) {
|
||||||
match, ok := <-matches
|
match, ok := <-matches
|
||||||
if !ok {
|
if !ok {
|
||||||
|
|
|
||||||
|
|
@ -45,7 +45,6 @@ type LogConfig struct {
|
||||||
DisableMemory bool // disable memory capture
|
DisableMemory bool // disable memory capture
|
||||||
DisableStack bool // disable stack capture
|
DisableStack bool // disable stack capture
|
||||||
DisableStorage bool // disable storage capture
|
DisableStorage bool // disable storage capture
|
||||||
FullStorage bool // show full storage (slow)
|
|
||||||
Limit int // maximum length of output, but zero means unlimited
|
Limit int // maximum length of output, but zero means unlimited
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
@ -136,14 +135,13 @@ func (l *StructLogger) CaptureState(env *EVM, pc uint64, op OpCode, gas, cost ui
|
||||||
)
|
)
|
||||||
l.changedValues[contract.Address()][address] = value
|
l.changedValues[contract.Address()][address] = value
|
||||||
}
|
}
|
||||||
// copy a snapstot of the current memory state to a new buffer
|
// Copy a snapstot of the current memory state to a new buffer
|
||||||
var mem []byte
|
var mem []byte
|
||||||
if !l.cfg.DisableMemory {
|
if !l.cfg.DisableMemory {
|
||||||
mem = make([]byte, len(memory.Data()))
|
mem = make([]byte, len(memory.Data()))
|
||||||
copy(mem, memory.Data())
|
copy(mem, memory.Data())
|
||||||
}
|
}
|
||||||
|
// Copy a snapshot of the current stack state to a new buffer
|
||||||
// copy a snapshot of the current stack state to a new buffer
|
|
||||||
var stck []*big.Int
|
var stck []*big.Int
|
||||||
if !l.cfg.DisableStack {
|
if !l.cfg.DisableStack {
|
||||||
stck = make([]*big.Int, len(stack.Data()))
|
stck = make([]*big.Int, len(stack.Data()))
|
||||||
|
|
@ -151,26 +149,10 @@ func (l *StructLogger) CaptureState(env *EVM, pc uint64, op OpCode, gas, cost ui
|
||||||
stck[i] = new(big.Int).Set(item)
|
stck[i] = new(big.Int).Set(item)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
// Copy a snapshot of the current storage to a new container
|
||||||
// Copy the storage based on the settings specified in the log config. If full storage
|
|
||||||
// is disabled (default) we can use the simple Storage.Copy method, otherwise we use
|
|
||||||
// the state object to query for all values (slow process).
|
|
||||||
var storage Storage
|
var storage Storage
|
||||||
if !l.cfg.DisableStorage {
|
if !l.cfg.DisableStorage {
|
||||||
if l.cfg.FullStorage {
|
storage = l.changedValues[contract.Address()].Copy()
|
||||||
storage = make(Storage)
|
|
||||||
// Get the contract account and loop over each storage entry. This may involve looping over
|
|
||||||
// the trie and is a very expensive process.
|
|
||||||
|
|
||||||
env.StateDB.ForEachStorage(contract.Address(), func(key, value common.Hash) bool {
|
|
||||||
storage[key] = value
|
|
||||||
// Return true, indicating we'd like to continue.
|
|
||||||
return true
|
|
||||||
})
|
|
||||||
} else {
|
|
||||||
// copy a snapshot of the current storage to a new container.
|
|
||||||
storage = l.changedValues[contract.Address()].Copy()
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
// create a new snaptshot of the EVM.
|
// create a new snaptshot of the EVM.
|
||||||
log := StructLog{pc, op, gas, cost, mem, memory.Len(), stck, storage, depth, err}
|
log := StructLog{pc, op, gas, cost, mem, memory.Len(), stck, storage, depth, err}
|
||||||
|
|
|
||||||
|
|
@ -63,32 +63,8 @@ func TestStoreCapture(t *testing.T) {
|
||||||
if len(logger.changedValues[contract.Address()]) == 0 {
|
if len(logger.changedValues[contract.Address()]) == 0 {
|
||||||
t.Fatalf("expected exactly 1 changed value on address %x, got %d", contract.Address(), len(logger.changedValues[contract.Address()]))
|
t.Fatalf("expected exactly 1 changed value on address %x, got %d", contract.Address(), len(logger.changedValues[contract.Address()]))
|
||||||
}
|
}
|
||||||
|
|
||||||
exp := common.BigToHash(big.NewInt(1))
|
exp := common.BigToHash(big.NewInt(1))
|
||||||
if logger.changedValues[contract.Address()][index] != exp {
|
if logger.changedValues[contract.Address()][index] != exp {
|
||||||
t.Errorf("expected %x, got %x", exp, logger.changedValues[contract.Address()][index])
|
t.Errorf("expected %x, got %x", exp, logger.changedValues[contract.Address()][index])
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestStorageCapture(t *testing.T) {
|
|
||||||
t.Skip("implementing this function is difficult. it requires all sort of interfaces to be implemented which isn't trivial. The value (the actual test) isn't worth it")
|
|
||||||
var (
|
|
||||||
ref = &dummyContractRef{}
|
|
||||||
contract = NewContract(ref, ref, new(big.Int), 0)
|
|
||||||
env = NewEVM(Context{}, dummyStateDB{ref: ref}, params.TestChainConfig, Config{EnableJit: false, ForceJit: false})
|
|
||||||
logger = NewStructLogger(nil)
|
|
||||||
mem = NewMemory()
|
|
||||||
stack = newstack()
|
|
||||||
)
|
|
||||||
|
|
||||||
logger.CaptureState(env, 0, STOP, 0, 0, mem, stack, contract, 0, nil)
|
|
||||||
if ref.calledForEach {
|
|
||||||
t.Error("didn't expect for each to be called")
|
|
||||||
}
|
|
||||||
|
|
||||||
logger = NewStructLogger(&LogConfig{FullStorage: true})
|
|
||||||
logger.CaptureState(env, 0, STOP, 0, 0, mem, stack, contract, 0, nil)
|
|
||||||
if !ref.calledForEach {
|
|
||||||
t.Error("expected for each to be called")
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
|
||||||
|
|
@ -333,7 +333,7 @@ func (d *Downloader) Synchronise(id string, head common.Hash, td *big.Int, mode
|
||||||
}
|
}
|
||||||
|
|
||||||
// synchronise will select the peer and use it for synchronising. If an empty string is given
|
// synchronise will select the peer and use it for synchronising. If an empty string is given
|
||||||
// it will use the best peer possible and synchronize if it's TD is higher than our own. If any of the
|
// it will use the best peer possible and synchronize if its TD is higher than our own. If any of the
|
||||||
// checks fail an error will be returned. This method is synchronous
|
// checks fail an error will be returned. This method is synchronous
|
||||||
func (d *Downloader) synchronise(id string, hash common.Hash, td *big.Int, mode SyncMode) error {
|
func (d *Downloader) synchronise(id string, hash common.Hash, td *big.Int, mode SyncMode) error {
|
||||||
// Mock out the synchronisation if testing
|
// Mock out the synchronisation if testing
|
||||||
|
|
@ -1003,8 +1003,8 @@ func (d *Downloader) fetchParts(errCancel error, deliveryCh chan dataPack, deliv
|
||||||
return errCancel
|
return errCancel
|
||||||
|
|
||||||
case packet := <-deliveryCh:
|
case packet := <-deliveryCh:
|
||||||
// If the peer was previously banned and failed to deliver it's pack
|
// If the peer was previously banned and failed to deliver its pack
|
||||||
// in a reasonable time frame, ignore it's message.
|
// in a reasonable time frame, ignore its message.
|
||||||
if peer := d.peers.Peer(packet.PeerId()); peer != nil {
|
if peer := d.peers.Peer(packet.PeerId()); peer != nil {
|
||||||
// Deliver the received chunk of data and check chain validity
|
// Deliver the received chunk of data and check chain validity
|
||||||
accepted, err := deliver(packet)
|
accepted, err := deliver(packet)
|
||||||
|
|
@ -1205,8 +1205,8 @@ func (d *Downloader) processHeaders(origin uint64, td *big.Int) error {
|
||||||
case <-d.cancelCh:
|
case <-d.cancelCh:
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
// If no headers were retrieved at all, the peer violated it's TD promise that it had a
|
// If no headers were retrieved at all, the peer violated its TD promise that it had a
|
||||||
// better chain compared to ours. The only exception is if it's promised blocks were
|
// better chain compared to ours. The only exception is if its promised blocks were
|
||||||
// already imported by other means (e.g. fecher):
|
// already imported by other means (e.g. fecher):
|
||||||
//
|
//
|
||||||
// R <remote peer>, L <local node>: Both at block 10
|
// R <remote peer>, L <local node>: Both at block 10
|
||||||
|
|
|
||||||
|
|
@ -158,6 +158,7 @@ func (f *Filter) indexedLogs(ctx context.Context, end uint64) ([]*types.Log, err
|
||||||
return logs, err
|
return logs, err
|
||||||
}
|
}
|
||||||
f.begin = int64(number) + 1
|
f.begin = int64(number) + 1
|
||||||
|
|
||||||
// Retrieve the suggested block and pull any truly matching logs
|
// Retrieve the suggested block and pull any truly matching logs
|
||||||
header, err := f.backend.HeaderByNumber(ctx, rpc.BlockNumber(number))
|
header, err := f.backend.HeaderByNumber(ctx, rpc.BlockNumber(number))
|
||||||
if header == nil || err != nil {
|
if header == nil || err != nil {
|
||||||
|
|
|
||||||
|
|
@ -151,9 +151,9 @@ func (s *PublicTxPoolAPI) Inspect() map[string]map[string]map[string]string {
|
||||||
// Define a formatter to flatten a transaction into a string
|
// Define a formatter to flatten a transaction into a string
|
||||||
var format = func(tx *types.Transaction) string {
|
var format = func(tx *types.Transaction) string {
|
||||||
if to := tx.To(); to != nil {
|
if to := tx.To(); to != nil {
|
||||||
return fmt.Sprintf("%s: %v wei + %v × %v gas", tx.To().Hex(), tx.Value(), tx.Gas(), tx.GasPrice())
|
return fmt.Sprintf("%s: %v wei + %v gas × %v wei", tx.To().Hex(), tx.Value(), tx.Gas(), tx.GasPrice())
|
||||||
}
|
}
|
||||||
return fmt.Sprintf("contract creation: %v wei + %v × %v gas", tx.Value(), tx.Gas(), tx.GasPrice())
|
return fmt.Sprintf("contract creation: %v wei + %v gas × %v wei", tx.Value(), tx.Gas(), tx.GasPrice())
|
||||||
}
|
}
|
||||||
// Flatten the pending transactions
|
// Flatten the pending transactions
|
||||||
for account, txs := range pending {
|
for account, txs := range pending {
|
||||||
|
|
@ -710,45 +710,52 @@ type ExecutionResult struct {
|
||||||
// StructLogRes stores a structured log emitted by the EVM while replaying a
|
// StructLogRes stores a structured log emitted by the EVM while replaying a
|
||||||
// transaction in debug mode
|
// transaction in debug mode
|
||||||
type StructLogRes struct {
|
type StructLogRes struct {
|
||||||
Pc uint64 `json:"pc"`
|
Pc uint64 `json:"pc"`
|
||||||
Op string `json:"op"`
|
Op string `json:"op"`
|
||||||
Gas uint64 `json:"gas"`
|
Gas uint64 `json:"gas"`
|
||||||
GasCost uint64 `json:"gasCost"`
|
GasCost uint64 `json:"gasCost"`
|
||||||
Depth int `json:"depth"`
|
Depth int `json:"depth"`
|
||||||
Error error `json:"error"`
|
Error error `json:"error,omitempty"`
|
||||||
Stack []string `json:"stack"`
|
Stack *[]string `json:"stack,omitempty"`
|
||||||
Memory []string `json:"memory"`
|
Memory *[]string `json:"memory,omitempty"`
|
||||||
Storage map[string]string `json:"storage"`
|
Storage *map[string]string `json:"storage,omitempty"`
|
||||||
}
|
}
|
||||||
|
|
||||||
// formatLogs formats EVM returned structured logs for json output
|
// formatLogs formats EVM returned structured logs for json output
|
||||||
func FormatLogs(structLogs []vm.StructLog) []StructLogRes {
|
func FormatLogs(logs []vm.StructLog) []StructLogRes {
|
||||||
formattedStructLogs := make([]StructLogRes, len(structLogs))
|
formatted := make([]StructLogRes, len(logs))
|
||||||
for index, trace := range structLogs {
|
for index, trace := range logs {
|
||||||
formattedStructLogs[index] = StructLogRes{
|
formatted[index] = StructLogRes{
|
||||||
Pc: trace.Pc,
|
Pc: trace.Pc,
|
||||||
Op: trace.Op.String(),
|
Op: trace.Op.String(),
|
||||||
Gas: trace.Gas,
|
Gas: trace.Gas,
|
||||||
GasCost: trace.GasCost,
|
GasCost: trace.GasCost,
|
||||||
Depth: trace.Depth,
|
Depth: trace.Depth,
|
||||||
Error: trace.Err,
|
Error: trace.Err,
|
||||||
Stack: make([]string, len(trace.Stack)),
|
|
||||||
Storage: make(map[string]string),
|
|
||||||
}
|
}
|
||||||
|
if trace.Stack != nil {
|
||||||
for i, stackValue := range trace.Stack {
|
stack := make([]string, len(trace.Stack))
|
||||||
formattedStructLogs[index].Stack[i] = fmt.Sprintf("%x", math.PaddedBigBytes(stackValue, 32))
|
for i, stackValue := range trace.Stack {
|
||||||
|
stack[i] = fmt.Sprintf("%x", math.PaddedBigBytes(stackValue, 32))
|
||||||
|
}
|
||||||
|
formatted[index].Stack = &stack
|
||||||
}
|
}
|
||||||
|
if trace.Memory != nil {
|
||||||
for i := 0; i+32 <= len(trace.Memory); i += 32 {
|
memory := make([]string, 0, (len(trace.Memory)+31)/32)
|
||||||
formattedStructLogs[index].Memory = append(formattedStructLogs[index].Memory, fmt.Sprintf("%x", trace.Memory[i:i+32]))
|
for i := 0; i+32 <= len(trace.Memory); i += 32 {
|
||||||
|
memory = append(memory, fmt.Sprintf("%x", trace.Memory[i:i+32]))
|
||||||
|
}
|
||||||
|
formatted[index].Memory = &memory
|
||||||
}
|
}
|
||||||
|
if trace.Storage != nil {
|
||||||
for i, storageValue := range trace.Storage {
|
storage := make(map[string]string)
|
||||||
formattedStructLogs[index].Storage[fmt.Sprintf("%x", i)] = fmt.Sprintf("%x", storageValue)
|
for i, storageValue := range trace.Storage {
|
||||||
|
storage[fmt.Sprintf("%x", i)] = fmt.Sprintf("%x", storageValue)
|
||||||
|
}
|
||||||
|
formatted[index].Storage = &storage
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return formattedStructLogs
|
return formatted
|
||||||
}
|
}
|
||||||
|
|
||||||
// rpcOutputBlock converts the given block to the RPC output which depends on fullTx. If inclTx is true transactions are
|
// rpcOutputBlock converts the given block to the RPC output which depends on fullTx. If inclTx is true transactions are
|
||||||
|
|
|
||||||
|
|
@ -130,28 +130,28 @@ type dbWrapper struct {
|
||||||
}
|
}
|
||||||
|
|
||||||
// getBalance retrieves an account's balance
|
// getBalance retrieves an account's balance
|
||||||
func (dw *dbWrapper) getBalance(addr common.Address) *big.Int {
|
func (dw *dbWrapper) getBalance(addr []byte) *big.Int {
|
||||||
return dw.db.GetBalance(addr)
|
return dw.db.GetBalance(common.BytesToAddress(addr))
|
||||||
}
|
}
|
||||||
|
|
||||||
// getNonce retrieves an account's nonce
|
// getNonce retrieves an account's nonce
|
||||||
func (dw *dbWrapper) getNonce(addr common.Address) uint64 {
|
func (dw *dbWrapper) getNonce(addr []byte) uint64 {
|
||||||
return dw.db.GetNonce(addr)
|
return dw.db.GetNonce(common.BytesToAddress(addr))
|
||||||
}
|
}
|
||||||
|
|
||||||
// getCode retrieves an account's code
|
// getCode retrieves an account's code
|
||||||
func (dw *dbWrapper) getCode(addr common.Address) []byte {
|
func (dw *dbWrapper) getCode(addr []byte) []byte {
|
||||||
return dw.db.GetCode(addr)
|
return dw.db.GetCode(common.BytesToAddress(addr))
|
||||||
}
|
}
|
||||||
|
|
||||||
// getState retrieves an account's state data for the given hash
|
// getState retrieves an account's state data for the given hash
|
||||||
func (dw *dbWrapper) getState(addr common.Address, hash common.Hash) common.Hash {
|
func (dw *dbWrapper) getState(addr []byte, hash common.Hash) common.Hash {
|
||||||
return dw.db.GetState(addr, hash)
|
return dw.db.GetState(common.BytesToAddress(addr), hash)
|
||||||
}
|
}
|
||||||
|
|
||||||
// exists returns true iff the account exists
|
// exists returns true iff the account exists
|
||||||
func (dw *dbWrapper) exists(addr common.Address) bool {
|
func (dw *dbWrapper) exists(addr []byte) bool {
|
||||||
return dw.db.Exist(addr)
|
return dw.db.Exist(common.BytesToAddress(addr))
|
||||||
}
|
}
|
||||||
|
|
||||||
// toValue returns an otto.Value for the dbWrapper
|
// toValue returns an otto.Value for the dbWrapper
|
||||||
|
|
|
||||||
50
rpc/http.go
50
rpc/http.go
|
|
@ -20,6 +20,7 @@ import (
|
||||||
"bytes"
|
"bytes"
|
||||||
"context"
|
"context"
|
||||||
"encoding/json"
|
"encoding/json"
|
||||||
|
"errors"
|
||||||
"fmt"
|
"fmt"
|
||||||
"io"
|
"io"
|
||||||
"io/ioutil"
|
"io/ioutil"
|
||||||
|
|
@ -33,6 +34,7 @@ import (
|
||||||
)
|
)
|
||||||
|
|
||||||
const (
|
const (
|
||||||
|
contentType = "application/json"
|
||||||
maxHTTPRequestContentLength = 1024 * 128
|
maxHTTPRequestContentLength = 1024 * 128
|
||||||
)
|
)
|
||||||
|
|
||||||
|
|
@ -69,8 +71,8 @@ func DialHTTP(endpoint string) (*Client, error) {
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return nil, err
|
return nil, err
|
||||||
}
|
}
|
||||||
req.Header.Set("Content-Type", "application/json")
|
req.Header.Set("Content-Type", contentType)
|
||||||
req.Header.Set("Accept", "application/json")
|
req.Header.Set("Accept", contentType)
|
||||||
|
|
||||||
initctx := context.Background()
|
initctx := context.Background()
|
||||||
return newClient(initctx, func(context.Context) (net.Conn, error) {
|
return newClient(initctx, func(context.Context) (net.Conn, error) {
|
||||||
|
|
@ -146,32 +148,42 @@ func NewHTTPServer(cors []string, srv *Server) *http.Server {
|
||||||
|
|
||||||
// ServeHTTP serves JSON-RPC requests over HTTP.
|
// ServeHTTP serves JSON-RPC requests over HTTP.
|
||||||
func (srv *Server) ServeHTTP(w http.ResponseWriter, r *http.Request) {
|
func (srv *Server) ServeHTTP(w http.ResponseWriter, r *http.Request) {
|
||||||
if r.ContentLength > maxHTTPRequestContentLength {
|
// Permit dumb empty requests for remote health-checks (AWS)
|
||||||
http.Error(w,
|
if r.Method == "GET" && r.ContentLength == 0 && r.URL.RawQuery == "" {
|
||||||
fmt.Sprintf("content length too large (%d>%d)", r.ContentLength, maxHTTPRequestContentLength),
|
|
||||||
http.StatusRequestEntityTooLarge)
|
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
if code, err := validateRequest(r); err != nil {
|
||||||
ct := r.Header.Get("content-type")
|
http.Error(w, err.Error(), code)
|
||||||
mt, _, err := mime.ParseMediaType(ct)
|
|
||||||
if err != nil || mt != "application/json" {
|
|
||||||
http.Error(w,
|
|
||||||
"invalid content type, only application/json is supported",
|
|
||||||
http.StatusUnsupportedMediaType)
|
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
// All checks passed, create a codec that reads direct from the request body
|
||||||
w.Header().Set("content-type", "application/json")
|
// untilEOF and writes the response to w and order the server to process a
|
||||||
|
// single request.
|
||||||
// create a codec that reads direct from the request body until
|
|
||||||
// EOF and writes the response to w and order the server to process
|
|
||||||
// a single request.
|
|
||||||
codec := NewJSONCodec(&httpReadWriteNopCloser{r.Body, w})
|
codec := NewJSONCodec(&httpReadWriteNopCloser{r.Body, w})
|
||||||
defer codec.Close()
|
defer codec.Close()
|
||||||
|
|
||||||
|
w.Header().Set("content-type", contentType)
|
||||||
srv.ServeSingleRequest(codec, OptionMethodInvocation)
|
srv.ServeSingleRequest(codec, OptionMethodInvocation)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// validateRequest returns a non-zero response code and error message if the
|
||||||
|
// request is invalid.
|
||||||
|
func validateRequest(r *http.Request) (int, error) {
|
||||||
|
if r.Method == "PUT" || r.Method == "DELETE" {
|
||||||
|
return http.StatusMethodNotAllowed, errors.New("method not allowed")
|
||||||
|
}
|
||||||
|
if r.ContentLength > maxHTTPRequestContentLength {
|
||||||
|
err := fmt.Errorf("content length too large (%d>%d)", r.ContentLength, maxHTTPRequestContentLength)
|
||||||
|
return http.StatusRequestEntityTooLarge, err
|
||||||
|
}
|
||||||
|
mt, _, err := mime.ParseMediaType(r.Header.Get("content-type"))
|
||||||
|
if err != nil || mt != contentType {
|
||||||
|
err := fmt.Errorf("invalid content type, only %s is supported", contentType)
|
||||||
|
return http.StatusUnsupportedMediaType, err
|
||||||
|
}
|
||||||
|
return 0, nil
|
||||||
|
}
|
||||||
|
|
||||||
func newCorsHandler(srv *Server, allowedOrigins []string) http.Handler {
|
func newCorsHandler(srv *Server, allowedOrigins []string) http.Handler {
|
||||||
// disable CORS support if user has not specified a custom CORS configuration
|
// disable CORS support if user has not specified a custom CORS configuration
|
||||||
if len(allowedOrigins) == 0 {
|
if len(allowedOrigins) == 0 {
|
||||||
|
|
|
||||||
54
rpc/http_test.go
Normal file
54
rpc/http_test.go
Normal file
|
|
@ -0,0 +1,54 @@
|
||||||
|
// Copyright 2017 The go-ethereum Authors
|
||||||
|
// This file is part of the go-ethereum library.
|
||||||
|
//
|
||||||
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
||||||
|
// it under the terms of the GNU Lesser General Public License as published by
|
||||||
|
// the Free Software Foundation, either version 3 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
||||||
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
// GNU Lesser General Public License for more details.
|
||||||
|
//
|
||||||
|
// You should have received a copy of the GNU Lesser General Public License
|
||||||
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
package rpc
|
||||||
|
|
||||||
|
import (
|
||||||
|
"net/http"
|
||||||
|
"net/http/httptest"
|
||||||
|
"strings"
|
||||||
|
"testing"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestHTTPErrorResponseWithDelete(t *testing.T) {
|
||||||
|
testHTTPErrorResponse(t, "DELETE", contentType, "", http.StatusMethodNotAllowed)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestHTTPErrorResponseWithPut(t *testing.T) {
|
||||||
|
testHTTPErrorResponse(t, "PUT", contentType, "", http.StatusMethodNotAllowed)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestHTTPErrorResponseWithMaxContentLength(t *testing.T) {
|
||||||
|
body := make([]rune, maxHTTPRequestContentLength+1, maxHTTPRequestContentLength+1)
|
||||||
|
testHTTPErrorResponse(t,
|
||||||
|
"POST", contentType, string(body), http.StatusRequestEntityTooLarge)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestHTTPErrorResponseWithEmptyContentType(t *testing.T) {
|
||||||
|
testHTTPErrorResponse(t, "POST", "", "", http.StatusUnsupportedMediaType)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestHTTPErrorResponseWithValidRequest(t *testing.T) {
|
||||||
|
testHTTPErrorResponse(t, "POST", contentType, "", 0)
|
||||||
|
}
|
||||||
|
|
||||||
|
func testHTTPErrorResponse(t *testing.T, method, contentType, body string, expected int) {
|
||||||
|
request := httptest.NewRequest(method, "http://url.com", strings.NewReader(body))
|
||||||
|
request.Header.Set("content-type", contentType)
|
||||||
|
if code, _ := validateRequest(request); code != expected {
|
||||||
|
t.Fatalf("response code should be %d not %d", expected, code)
|
||||||
|
}
|
||||||
|
}
|
||||||
Loading…
Reference in a new issue