interesting
/
go-ethereum
mirror of https://github.com/ethereum/go-ethereum.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

core/bloombits, light: fix typos (#17235)

This commit is contained in:
Sheldon 2018-07-24 16:24:27 +08:00 committed by Péter Szilágyi
parent b536460f8e
commit 9e24491c65
3 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
core/bloombits/matcher.go
View File

@ -59,7 +59,7 @@ type partialMatches struct {
// It can also have the actual results set to be used as a delivery data struct. // It can also have the actual results set to be used as a delivery data struct.
// //
// The contest and error fields are used by the light client to terminate matching // The contest and error fields are used by the light client to terminate matching
// early if an error is enountered on some path of the pipeline. // early if an error is encountered on some path of the pipeline.
type Retrieval struct { type Retrieval struct {
Bit uint Bit uint
Sections []uint64 Sections []uint64
@ -218,7 +218,7 @@ func (m *Matcher) Start(ctx context.Context, begin, end uint64, results chan uin
// run creates a daisy-chain of sub-matchers, one for the address set and one // run creates a daisy-chain of sub-matchers, one for the address set and one
// for each topic set, each sub-matcher receiving a section only if the previous // for each topic set, each sub-matcher receiving a section only if the previous
// ones have all found a potential match in one of the blocks of the section, // ones have all found a potential match in one of the blocks of the section,
// then binary AND-ing its own matches and forwaring the result to the next one. // then binary AND-ing its own matches and forwarding the result to the next one.
// //
// The method starts feeding the section indexes into the first sub-matcher on a // The method starts feeding the section indexes into the first sub-matcher on a
// new goroutine and returns a sink channel receiving the results. // new goroutine and returns a sink channel receiving the results.
@ -543,7 +543,7 @@ func (s *MatcherSession) Error() error {
} }
// AllocateRetrieval assigns a bloom bit index to a client process that can either // AllocateRetrieval assigns a bloom bit index to a client process that can either
// immediately reuest and fetch the section contents assigned to this bit or wait // immediately request and fetch the section contents assigned to this bit or wait
// a little while for more sections to be requested. // a little while for more sections to be requested.
func (s *MatcherSession) AllocateRetrieval() (uint, bool) { func (s *MatcherSession) AllocateRetrieval() (uint, bool) {
fetcher := make(chan uint) fetcher := make(chan uint)
@ -599,8 +599,8 @@ func (s *MatcherSession) DeliverSections(bit uint, sections []uint64, bitsets []
} }
} }
// Multiplex polls the matcher session for rerieval tasks and multiplexes it into // Multiplex polls the matcher session for retrieval tasks and multiplexes it into
// the reuested retrieval queue to be serviced together with other sessions. // the requested retrieval queue to be serviced together with other sessions.
// //
// This method will block for the lifetime of the session. Even after termination // This method will block for the lifetime of the session. Even after termination
// of the session, any request in-flight need to be responded to! Empty responses // of the session, any request in-flight need to be responded to! Empty responses

2
core/bloombits/matcher_test.go
View File

@ -156,7 +156,7 @@ func testMatcher(t *testing.T, filter [][]bloomIndexes, start, blocks uint64, in
// Track the number of retrieval requests made // Track the number of retrieval requests made
var requested uint32 var requested uint32
// Start the matching session for the filter and the retriver goroutines // Start the matching session for the filter and the retriever goroutines
quit := make(chan struct{}) quit := make(chan struct{})
matches := make(chan uint64, 16) matches := make(chan uint64, 16)

2
light/lightchain_test.go
View File

@ -326,7 +326,7 @@ func TestBadHeaderHashes(t *testing.T) {
func TestReorgBadHeaderHashes(t *testing.T) { func TestReorgBadHeaderHashes(t *testing.T) {
bc := newTestLightChain() bc := newTestLightChain()
// Create a chain, import and ban aferwards // Create a chain, import and ban afterwards
headers := makeHeaderChainWithDiff(bc.genesisBlock, []int{1, 2, 3, 4}, 10) headers := makeHeaderChainWithDiff(bc.genesisBlock, []int{1, 2, 3, 4}, 10)
if _, err := bc.InsertHeaderChain(headers, 1); err != nil { if _, err := bc.InsertHeaderChain(headers, 1); err != nil {