mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-08 10:41:19 +00:00
fd80f73286
* attestationutil.AttestingIndices: Minor improvement on indices array allocation * progress * more progress on makes * progress * more progress * Merge branch 'master' of github.com:prysmaticlabs/prysm into memory1 * gaz * fmt and imports * Merge branch 'master' into memory2 * Min() * remove spaces * Merge branch 'master' of github.com:prysmaticlabs/prysm into memory2 * revert beacon-chain/operations/attestations/kv/block.go * partially revert beacon-chain/operations/attestations/kv/aggregated.go * Merge branch 'master' into memory2 * Merge branch 'master' into memory2
98 lines
2.7 KiB
Go
98 lines
2.7 KiB
Go
package kv
|
|
|
|
import (
|
|
"github.com/pkg/errors"
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/helpers"
|
|
stateTrie "github.com/prysmaticlabs/prysm/beacon-chain/state"
|
|
)
|
|
|
|
// SaveUnaggregatedAttestation saves an unaggregated attestation in cache.
|
|
func (p *AttCaches) SaveUnaggregatedAttestation(att *ethpb.Attestation) error {
|
|
if att == nil {
|
|
return nil
|
|
}
|
|
if helpers.IsAggregated(att) {
|
|
return errors.New("attestation is aggregated")
|
|
}
|
|
|
|
r, err := hashFn(att)
|
|
if err != nil {
|
|
return errors.Wrap(err, "could not tree hash attestation")
|
|
}
|
|
|
|
p.unAggregateAttLock.Lock()
|
|
defer p.unAggregateAttLock.Unlock()
|
|
p.unAggregatedAtt[r] = stateTrie.CopyAttestation(att) // Copied.
|
|
|
|
return nil
|
|
}
|
|
|
|
// SaveUnaggregatedAttestations saves a list of unaggregated attestations in cache.
|
|
func (p *AttCaches) SaveUnaggregatedAttestations(atts []*ethpb.Attestation) error {
|
|
for _, att := range atts {
|
|
if err := p.SaveUnaggregatedAttestation(att); err != nil {
|
|
return err
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
// UnaggregatedAttestations returns all the unaggregated attestations in cache.
|
|
func (p *AttCaches) UnaggregatedAttestations() []*ethpb.Attestation {
|
|
p.unAggregateAttLock.RLock()
|
|
defer p.unAggregateAttLock.RUnlock()
|
|
|
|
atts := make([]*ethpb.Attestation, 0, len(p.unAggregatedAtt))
|
|
for _, att := range p.unAggregatedAtt {
|
|
atts = append(atts, stateTrie.CopyAttestation(att) /* Copied */)
|
|
}
|
|
|
|
return atts
|
|
}
|
|
|
|
// UnaggregatedAttestationsBySlotIndex returns the unaggregated attestations in cache,
|
|
// filtered by committee index and slot.
|
|
func (p *AttCaches) UnaggregatedAttestationsBySlotIndex(slot uint64, committeeIndex uint64) []*ethpb.Attestation {
|
|
atts := make([]*ethpb.Attestation, 0)
|
|
|
|
p.unAggregateAttLock.RLock()
|
|
defer p.unAggregateAttLock.RUnlock()
|
|
for _, a := range p.unAggregatedAtt {
|
|
if slot == a.Data.Slot && committeeIndex == a.Data.CommitteeIndex {
|
|
atts = append(atts, a)
|
|
}
|
|
}
|
|
|
|
return atts
|
|
}
|
|
|
|
// DeleteUnaggregatedAttestation deletes the unaggregated attestations in cache.
|
|
func (p *AttCaches) DeleteUnaggregatedAttestation(att *ethpb.Attestation) error {
|
|
if att == nil {
|
|
return nil
|
|
}
|
|
if helpers.IsAggregated(att) {
|
|
return errors.New("attestation is aggregated")
|
|
}
|
|
|
|
r, err := hashFn(att)
|
|
if err != nil {
|
|
return errors.Wrap(err, "could not tree hash attestation")
|
|
}
|
|
|
|
p.unAggregateAttLock.Lock()
|
|
defer p.unAggregateAttLock.Unlock()
|
|
delete(p.unAggregatedAtt, r)
|
|
|
|
return nil
|
|
}
|
|
|
|
// UnaggregatedAttestationCount returns the number of unaggregated attestations key in the pool.
|
|
func (p *AttCaches) UnaggregatedAttestationCount() int {
|
|
p.unAggregateAttLock.RLock()
|
|
defer p.unAggregateAttLock.RUnlock()
|
|
return len(p.unAggregatedAtt)
|
|
}
|