perf: speedup pbss trienode read

[will-2012]

Description

In the native transfer test scenario, we found that the bottleneck of pbss trienode reading is the recursive query of the 128-layer difflayer. The current PR is mainly to optimize the pbss trienode reading latency.

Rationale

In difflayer, a new cache map with node hash as key is added. The Node interface gives priority to accessing the cache. If a hit is found, it is returned directly. If it is not found, the disklayer is queried. Compared with the recursive query of the 128-layer difflayer, this cache query is O(1). The original query path is optimized, and most of them are fastpath.
The cache is added when the difflayer is added to the layertree and is released when the difflayer is merged into the disklayer.

Performance

pbss+cache has better performance, and the optimization effects are as follows:

• As a validator test scenario, 1 million accounts were randomly selected from 25 million accounts, and native transfer transactions were performed at 600qps. The difflayer cache optimization effect was significant, and the validation phase was reduced from 450ms to 100ms.
• As a test scenario for bsc fullnode, starting from block 34.1 million, the validate node was reduced from 73ms to 54ms, which accounts for a small proportion of the entire import block, so the overall optimization effect is not obvious.

Changes

Notable changes:

• Pbss difflayer: add hash cache.
• Pbss disklayer: adjust clean cache size.

[sysvm]

LGTM

[fynnss]

LGTM

[RenRick]

LGTM