diff --git a/blockstore/splitstore/splitstore_compact.go b/blockstore/splitstore/splitstore_compact.go index d3afdd25736..d3122083897 100644 --- a/blockstore/splitstore/splitstore_compact.go +++ b/blockstore/splitstore/splitstore_compact.go @@ -457,7 +457,7 @@ func (s *SplitStore) doTxnProtect(root cid.Cid, markSet MarkSet) (int64, error) return 0, err } - // Note: cold objects are deleted heaviest first, so the consituents of an object + // Note: cold objects are deleted heaviest first, so the constituents of an object // cannot be deleted before the object itself. return s.walkObjectIncomplete(root, newTmpVisitor(), func(c cid.Cid) error { diff --git a/blockstore/splitstore/splitstore_prune.go b/blockstore/splitstore/splitstore_prune.go index f9e786d1555..1757530ae3f 100644 --- a/blockstore/splitstore/splitstore_prune.go +++ b/blockstore/splitstore/splitstore_prune.go @@ -177,7 +177,7 @@ func (s *SplitStore) doPrune(curTs *types.TipSet, retainStateP func(int64) bool, } // 1. mark reachable objects by walking the chain from the current epoch; we keep all messages - // and chain headers; state and reciepts are retained only if it is within retention policy scope + // and chain headers; state and receipts are retained only if it is within retention policy scope log.Info("marking reachable objects") startMark := time.Now() @@ -402,7 +402,7 @@ func (s *SplitStore) completePrune() error { return nil } -// like walkChain but peforms a deep walk, using parallel walking with walkObjectLax, +// like walkChain but performs a deep walk, using parallel walking with walkObjectLax, // whereby all extant messages are retained and state roots are retained if they satisfy // the given predicate. // missing references are ignored, as we expect to have plenty for snapshot syncs. diff --git a/chain/events/observer.go b/chain/events/observer.go index 896440eacbc..909cee1875d 100644 --- a/chain/events/observer.go +++ b/chain/events/observer.go @@ -185,7 +185,7 @@ func (o *observer) headChange(ctx context.Context, rev, app []*types.TipSet) err // If we have more reverts, the next revert is the next head. to = rev[i+1] } else { - // At the end of the revert sequenece, we need to lookup the joint tipset + // At the end of the revert sequence, we need to lookup the joint tipset // between the revert sequence and the apply sequence. var err error to, err = o.api.ChainGetTipSet(ctx, from.Parents()) diff --git a/itests/worker_test.go b/itests/worker_test.go index aacc0b58e79..8c314b7bb88 100644 --- a/itests/worker_test.go +++ b/itests/worker_test.go @@ -480,7 +480,7 @@ func TestSchedulerRemoveRequest(t *testing.T) { err = miner.SealingRemoveRequest(ctx, b.SchedInfo.Requests[0].SchedId) require.NoError(t, err) - // Dump the schduler again and compare the UUID if a request is present + // Dump the scheduler again and compare the UUID if a request is present // If no request present then pass the test a := miner.SchedInfo(ctx) diff --git a/storage/pipeline/precommit_policy.go b/storage/pipeline/precommit_policy.go index b368afdf82f..b8d5b9a6fb2 100644 --- a/storage/pipeline/precommit_policy.go +++ b/storage/pipeline/precommit_policy.go @@ -132,11 +132,11 @@ func (p *BasicPreCommitPolicy) getCCSectorLifetime(nv network.Version) (abi.Chai } if minExpiration := policy.GetMinSectorExpiration(); ccLifetimeEpochs < minExpiration { - log.Warnf("value for CommittedCapacitySectorLiftime is too short, using default minimum (%d epochs)", minExpiration) + log.Warnf("value for CommittedCapacitySectorLifetime is too short, using default minimum (%d epochs)", minExpiration) return minExpiration, nil } if ccLifetimeEpochs > maxCommitment { - log.Warnf("value for CommittedCapacitySectorLiftime is too long, using default maximum (%d epochs)", maxCommitment) + log.Warnf("value for CommittedCapacitySectorLifetime is too long, using default maximum (%d epochs)", maxCommitment) return maxCommitment, nil }