aboutsummaryrefslogtreecommitdiffstats
path: root/trie/database.go
Commit message (Collapse)AuthorAgeFilesLines
* Change import go github.com/dexon-foundation/dexonWei-Ning Huang2019-04-091-5/+5
|
* trie: there's no point in retrieving the metarootPéter Szilágyi2019-04-081-0/+5
|
* trie: fix overflow in write cache parent tracking (#18165)Martin Holst Swende2018-11-221-1/+1
| | | trie/database: fix overflow in parent tracking
* cmd, core, eth, light, trie: add trie read caching layerPéter Szilágyi2018-11-151-75/+130
|
* eth, trie: fix tracer GC which accidentally pruned the metarootPéter Szilágyi2018-08-091-0/+5
|
* trie: fix comment typo (#17350)Mymskmkt2018-08-081-1/+1
|
* trie: handle removing the freshest node tooPéter Szilágyi2018-07-301-4/+14
|
* trie: fix a temporary memory leak in the memcachePéter Szilágyi2018-07-021-1/+49
|
* trie: cache collapsed tries node, not rlp blobs (#16876)Péter Szilágyi2018-06-211-36/+238
| | | | | | | | | | | | The current trie memory database/cache that we do pruning on stores trie nodes as binary rlp encoded blobs, and also stores the node relationships/references for GC purposes. However, most of the trie nodes (everything apart from a value node) is in essence just a collection of references. This PR switches out the RLP encoded trie blobs with the collapsed-but-not-serialized trie nodes. This permits most of the references to be recovered from within the node data structure, avoiding the need to track them a second time (expensive memory wise).
* trie: don't report the root flushlist as an allocPéter Szilágyi2018-06-111-2/+2
|
* core, eth, trie: streaming GC for the trie cache (#16810)Péter Szilágyi2018-06-041-13/+175
| | | | | | * core, eth, trie: streaming GC for the trie cache * trie: track memcache statistics
* all: update license information (#16089)Felix Lange2018-02-141-1/+1
|
* core, trie: intermediate mempool between trie and database (#15857)Péter Szilágyi2018-02-061-0/+355
This commit reduces database I/O by not writing every state trie to disk.