save

Author: sudeepdino008

db/integrity/rcache_no_duplicates.go

@@ -67,6 +67,13 @@ func RCacheNoDupsRange(ctx context.Context, fromBlock, toBlock uint64, tx kv.Tem
 	var _min, _max uint64
 	_min, _ = txNumsReader.Min(tx, fromBlock)
 	_max, _ = txNumsReader.Max(tx, fromBlock)
+
+	it, err := rawdb.ReceiptCacheV2Stream(tx, fromTxNum, toTxNum)
+	if err != nil {
+		return err
+	}
+	defer it.Close()
+
 	for txNum := fromTxNum; txNum <= toTxNum; txNum++ {
 		r, found, err := rawdb.ReadReceiptCacheV2(tx, rawdb.RCacheV2Query{
 			TxNum:         txNum,

db/kv/stream/stream.go

@@ -312,6 +312,29 @@ func (m *TransformedDuo[K, v]) Close() {
 	}
 }
 
+// TransformedDuoV - analog `map` (in terms of map-filter-reduce pattern) but with different value type
+type TransformedDuoV[K, V, VR any] struct {
+	it        Duo[K, V]
+	transform func(K, V) (K, VR, error)
+}
+
+func TransformDuoV[K, V, VR any](it Duo[K, V], transform func(K, V) (K, VR, error)) *TransformedDuoV[K, V, VR] {
+	return &TransformedDuoV[K, V, VR]{it: it, transform: transform}
+}
+func (m *TransformedDuoV[K, V, VR]) HasNext() bool { return m.it.HasNext() }
+func (m *TransformedDuoV[K, V, VR]) Next() (k K, vr VR, err error) {
+	k, v, err := m.it.Next()
+	if err != nil {
+		return k, vr, err
+	}
+	return m.transform(k, v)
+}
+func (m *TransformedDuoV[K, V, VR]) Close() {
+	if x, ok := m.it.(Closer); ok {
+		x.Close()
+	}
+}
+
 // FilteredDuo - analog `map` (in terms of map-filter-reduce pattern)
 // please avoid reading from Disk/DB more elements and then filter them. Better
 // push-down filter conditions to lower-level iterator to reduce disk reads amount.

db/rawdb/accessors_chain.go

@@ -36,6 +36,7 @@ import (
 	"github.com/erigontech/erigon/db/kv"
 	"github.com/erigontech/erigon/db/kv/dbutils"
 	"github.com/erigontech/erigon/db/kv/rawdbv3"
+	"github.com/erigontech/erigon/db/kv/stream"
 	"github.com/erigontech/erigon/db/rawdb/utils"
 	"github.com/erigontech/erigon/execution/rlp"
 	"github.com/erigontech/erigon/execution/types"
@@ -1222,6 +1223,27 @@ type RCacheV2Query struct {
 	DontCalcBloom bool // avoid calculating bloom (can be bottleneck)
 }
 
+func ReceiptCacheV2Stream(tx kv.TemporalTx, fromTxNum, toTxNum uint64) (stream.Duo[uint64, *types.Receipt], error) {
+	it, err := tx.Debug().HistoryKeyTrace(kv.RCacheDomain, receiptCacheKey, fromTxNum, toTxNum)
+	if err != nil {
+		return nil, err
+	}
+
+	return stream.TransformDuoV(it, func(txNum uint64, v []byte) (uint64, *types.Receipt, error) {
+		if len(v) == 0 {
+			return txNum, nil, nil
+		}
+
+		receipt := &types.ReceiptForStorage{}
+		if err := rlp.DecodeBytes(v, receipt); err != nil {
+			return txNum, nil, fmt.Errorf("%w, of txNum %d, len(v)=%d", err, txNum, len(v))
+		}
+		res := (*types.Receipt)(receipt)
+		//res.DeriveFieldsV4ForCachedReceipt(query.BlockHash, query.BlockNum, query.TxnHash, !query.DontCalcBloom)
+		return txNum, res, nil
+	}), nil
+}
+
 func ReadReceiptCacheV2(tx kv.TemporalTx, query RCacheV2Query) (*types.Receipt, bool, error) {
 	v, ok, err := tx.HistorySeek(kv.RCacheDomain, receiptCacheKey, query.TxNum+1 /*history storing value BEFORE-change*/)
 	if err != nil {