reset

Author: shantichanal

core/state/statedb.go

@@ -1464,11 +1464,3 @@ func (s *StateDB) Witness() *stateless.Witness {
 func (s *StateDB) AccessEvents() *AccessEvents {
 	return s.accessEvents
 }
-
-func (s *StateDB) BeginTrieDepthWindow() {
-	trie.StateDepthMetricsStartBlock()
-}
-
-func (s *StateDB) EndTrieDepthWindow() {
-	trie.StateDepthMetricsEndBlock()
-}

core/state_processor.go

@@ -64,9 +64,6 @@ func (p *StateProcessor) Process(block *types.Block, statedb *state.StateDB, cfg
 		allLogs     []*types.Log
 		gp          = new(GasPool).AddGas(block.GasLimit())
 	)
-	// Start the trie depth metrics window
-	statedb.BeginTrieDepthWindow()
-	defer statedb.EndTrieDepthWindow()
 
 	// Mutate the block and state according to any hard-fork specs
 	if p.config.DAOForkSupport && p.config.DAOForkBlock != nil && p.config.DAOForkBlock.Cmp(block.Number()) == 0 {

trie/trie.go

@@ -326,10 +326,6 @@ func (t *Trie) update(key, value []byte) error {
 
 func (t *Trie) insert(n node, prefix, key []byte, value node) (bool, node, error) {
 	if len(key) == 0 {
-		if t.owner == (common.Hash{}) {
-			stateDepthAggregator.record(int64(len(prefix)))
-		}
-
 		if v, ok := n.(valueNode); ok {
 			return !bytes.Equal(v, value.(valueNode)), value, nil
 		}
@@ -449,9 +445,6 @@ func (t *Trie) delete(n node, prefix, key []byte) (bool, node, error) {
 			// it in the deletion set. The same the valueNode doesn't
 			// need to be tracked at all since it's always embedded.
 			t.tracer.onDelete(prefix)
-			if t.owner == (common.Hash{}) {
-				stateDepthAggregator.record(int64(len(prefix)))
-			}
 			return true, nil, nil // remove n entirely for whole matches
 		}
 		// The key is longer than n.Key. Remove the remaining suffix
@@ -474,9 +467,6 @@ func (t *Trie) delete(n node, prefix, key []byte) (bool, node, error) {
 			// always creates a new slice) instead of append to
 			// avoid modifying n.Key since it might be shared with
 			// other nodes.
-			if t.owner == (common.Hash{}) {
-				stateDepthAggregator.record(int64(len(prefix) + len(key)))
-			}
 			return true, &shortNode{concat(n.Key, child.Key...), child.Val, t.newFlag()}, nil
 		default:
 			return true, &shortNode{n.Key, child, t.newFlag()}, nil
@@ -535,10 +525,6 @@ func (t *Trie) delete(n node, prefix, key []byte) (bool, node, error) {
 					// Mark the original short node as deleted since the
 					// value is embedded into the parent now.
 					t.tracer.onDelete(append(prefix, byte(pos)))
-					if t.owner == (common.Hash{}) {
-						stateDepthAggregator.record(int64(len(prefix) + 1))
-					}
-
 					k := append([]byte{byte(pos)}, cnode.Key...)
 					return true, &shortNode{k, cnode.Val, t.newFlag()}, nil
 				}