opensource/lotus
1
0
Fork 0
mirror of https://github.com/filecoin-project/lotus.git synced 2025-05-17 07:08:26 +08:00
Code Issues Projects Releases Wiki Activity

chore: fix some typos in comment (#13099)

Browse Source 
fix: typos and spelling corrections
This commit is contained in:
Degen Dev
2025-05-08 15:44:39 +08:00
committed by GitHub
parent 198db9e909
commit e2fad0dbe5
5 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
blockstore/splitstore/splitstore_compact.go
View File

@ -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 {

4
blockstore/splitstore/splitstore_prune.go
View File

@ -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.

2
chain/events/observer.go
View File

@ -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())

2
itests/worker_test.go
View File

@ -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)

4
storage/pipeline/precommit_policy.go
View File

@ -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
}