Merge pull request #6503 from vastonus/master

chore: fix a large number of spelling issues in comments

Author: simlecode

app/node/inspector_api.go

@@ -75,7 +75,7 @@ type MemoryInfo struct {
 	Virtual uint64
 }
 
-// Runtime returns infrormation about the golang runtime.
+// Runtime returns information about the golang runtime.
 func (g *inspector) Runtime() *RuntimeInfo {
 	return &RuntimeInfo{
 		OS:            runtime.GOOS,

pkg/chain/store.go

@@ -195,7 +195,7 @@ func NewStore(chainDs repo.Datastore,
 // then Load could be tricked into loading an invalid chain. Load will error if the
 // head does not link back to the expected genesis block, or the Store's
 // datastore does not store a link in the chain.  In case of error the caller
-// should not consider the chain useable and propagate the error.
+// should not consider the chain usable and propagate the error.
 func (store *Store) Load(ctx context.Context) (err error) {
 	ctx, span := trace.StartSpan(ctx, "Store.Load")
 	defer tracing.AddErrorEndSpan(ctx, span, &err)

pkg/chain/waiter.go

@@ -332,7 +332,7 @@ func (w *Waiter) receiptByIndex(ctx context.Context, ts *types.TipSet, targetCid
 
 	receiptIndex := 0
 	for _, blkInfo := range blockMsgs {
-		// todo aggrate bls and secp msg to one msg
+		// todo: aggregate bls and secp msg to one msg
 		for _, msg := range append(blkInfo.BlsMessages, blkInfo.SecpkMessages...) {
 			if msg.Cid().Equals(targetCid) {
 				if receiptIndex >= len(receipts) {

pkg/journal/testing.go

@@ -40,7 +40,7 @@ type entry struct {
 	kvs   []interface{}
 }
 
-// MemoryWriter writes journal entires in memory.
+// MemoryWriter writes journal entries in memory.
 type MemoryWriter struct {
 	topic   string
 	journal *MemoryJournal

pkg/messagepool/selection_test.go

@@ -967,7 +967,7 @@ func TestOptimalMessageSelection1(t *testing.T) {
 	tf.UnitTest(t)
 
 	// this test uses just a single actor sending messages with a low tq
-	// the chain depenent merging algorithm should pick messages from the actor
+	// the chain dependent merging algorithm should pick messages from the actor
 	// from the start
 	mp, tma := makeTestMpool()
 
@@ -1028,7 +1028,7 @@ func TestOptimalMessageSelection2(t *testing.T) {
 
 	// this test uses two actors sending messages to each other, with the first
 	// actor paying (much) higher gas premium than the second.
-	// We select with a low ticket quality; the chain depenent merging algorithm should pick
+	// We select with a low ticket quality; the chain dependent merging algorithm should pick
 	// messages from the second actor from the start
 	mp, tma := makeTestMpool()
 
@@ -1101,7 +1101,7 @@ func TestOptimalMessageSelection3(t *testing.T) {
 
 	// this test uses 10 actors sending a block of messages to each other, with the first
 	// actors paying higher gas premium than the subsequent actors.
-	// We select with a low ticket quality; the chain depenent merging algorithm should pick
+	// We select with a low ticket quality; the chain dependent merging algorithm should pick
 	// messages from the median actor from the start
 	mp, tma := makeTestMpool()
 

pkg/statemanger/state_manger.go

@@ -246,7 +246,7 @@ func (s *Stmgr) RunStateTransition(ctx context.Context, ts *types.TipSet, cb vm.
 	if nil != s.stopFlag(false) {
 		return cid.Undef, cid.Undef, fmt.Errorf("state manager is stopping")
 	}
-	ctx, span := trace.StartSpan(ctx, "Exected.RunStateTransition")
+	ctx, span := trace.StartSpan(ctx, "Executed.RunStateTransition")
 	defer span.End()
 
 	key := ts.Key()
@@ -358,7 +358,7 @@ func (s *Stmgr) GetActorRaw(ctx context.Context, addr address.Address, stateCid
 
 // deprecated: in future use.
 func (s *Stmgr) RunStateTransitionV2(ctx context.Context, ts *types.TipSet) (cid.Cid, cid.Cid, error) {
-	ctx, span := trace.StartSpan(ctx, "Exected.RunStateTransition")
+	ctx, span := trace.StartSpan(ctx, "Executed.RunStateTransition")
 	defer span.End()
 
 	var state stateComputeResult