172 Commits (48e3b95e774535aee1104d1283d2536cd47c9389)

Author	SHA1	Message	Date
gary rong	65ce550b37	trie: extend range proofs with non-existence (#21000) ... * trie: implement range proof with non-existent edge proof * trie: fix cornercase * trie: consider empty range * trie: add singleSide test * trie: support all-elements range proof * trie: fix typo * trie: tiny typos and formulations Co-authored-by: Péter Szilágyi <peterke@gmail.com>	5 years ago
Guillaume Ballet	234cc8e77f	eth/downloader: minor typo fixes in comments (#21035)	5 years ago
gary rong	5cdc2dffda	trie: fix TestBadRangeProof unit test (#21034)	5 years ago
gary rong	44ff3f3dc9	trie: initial implementation for range proof (#20908) ... * trie: initial implementation for range proof * trie: add benchmark * trie: fix lint * trie: fix minor issue * trie: unset the edge valuenode as well * trie: unset the edge valuenode as nilValuenode	5 years ago
Martin Holst Swende	6402c42b67	all: simplify and fix database iteration with prefix/start (#20808) ... * core/state/snapshot: start fixing disk iterator seek * ethdb, rawdb, leveldb, memorydb: implement iterators with prefix and start * les, core/state/snapshot: iterator fixes * all: remove two iterator methods * all: rename Iteratee.NewIteratorWith -> NewIterator * ethdb: fix review concerns	5 years ago
Martin Holst Swende	af4080b4b7	trie: fix concurrent usage of secKeyBuf, ref #20920	5 years ago
Péter Szilágyi	351a5903b0	core/rawdb, core/state/snapshot: runtime snapshot generation	5 years ago
Péter Szilágyi	542df8898e	core: initial version of state snapshots	5 years ago
Martin Holst Swende	a1313b5b1e	trie: make hasher parallel when number of changes are large (#20488) ... * trie: make hasher parallel when number of changes are large * trie: remove unused field dirtyCount * trie: rename unhashedCount/unhashed	5 years ago
Martin Holst Swende	5a9c96454e	trie: separate hashes and committer, collapse on commit ... * trie: make db insert use size instead of full data * core/state: minor optimization in state onleaf allocation * trie: implement dedicated committer and hasher * trie: use dedicated committer/hasher * trie: linter nitpicks * core/state, trie: avoid unnecessary storage trie load+commit * trie: review feedback, mainly docs + minor changes * trie: start deprecating old hasher * trie: fix misspell+lint * trie: deprecate hasher.go, make proof framework use new hasher * trie: rename pure_committer/hasher to committer/hasher * trie, core/state: fix review concerns * trie: more review concerns * trie: make commit collapse into hashnode, don't touch dirtyness * trie: goimports fixes * trie: remove panics	5 years ago
Martin Holst Swende	9b09c0fc83	* trie: utilize callbacks instead of amassing lists in ref/unref (#20529) ... * trie/tests: add benchmarks and update trie tests * trie: update benchmark tests * trie: utilize callbacks instead of amassing lists of hashes in database ref/unref * trie: replace remaining non-callback based accesses	5 years ago
me020523	4f7b7f84ae	add node.go unit test file node_test.go (#20028) ... * add node.go unit test file node_test.go * add node_test.go file license and rollback trie_test.go * fix unused variable v * trie: fix license year Co-authored-by: Péter Szilágyi <peterke@gmail.com>	5 years ago
Péter Szilágyi	13ccf6016e	trie: track dirty cache metrics, track clean writes on commit	5 years ago
gary rong	08611cfd75	trie: remove dead code (#20405)	5 years ago
gary rong	9d67222f4e	trie: replace bigcache with fastcache (#19971)	5 years ago
Felix Lange	0abcf03fde	trie: remove unused code (#20366)	5 years ago
gary rong	ecdbb402ee	trie: remove node ordering slice in sync batch (#19929) ... When we flush a batch of trie nodes into database during the state sync, we should guarantee that all children should be flushed before parent. Actually the trie nodes commit order is strict by: children -> parent. But when we flush all ready nodes into db, we don't need the order anymore since (1) they are all ready nodes (no more dependency) (2) underlying database provides write atomicity	5 years ago
gary rong	df6c08a485	core, trie: decode the value for storage dump (#19943) ... * core, trie: decode the value for storage dump * core/state: address comment	5 years ago
Christian Muehlhaeuser	5183483c53	core/state, p2p/discover, trie, whisper: avoid unnecessary conversions (#19870) ... No need to convert these types.	5 years ago
Guillaume Ballet	dcc4adfcd7	cmd/geth: wrong memory size sanitizing on OpenBSD (#19793)	5 years ago
Péter Szilágyi	536b3b416c	cosensus, core, eth, params, trie: fixes + clique history cap	6 years ago
gary rong	80469bea0c	all: integrate the freezer with fast sync ... * all: freezer style syncing core, eth, les, light: clean up freezer relative APIs core, eth, les, trie, ethdb, light: clean a bit core, eth, les, light: add unit tests core, light: rewrite setHead function core, eth: fix downloader unit tests core: add receipt chain insertion test core: use constant instead of hardcoding table name core: fix rollback core: fix setHead core/rawdb: remove canonical block first and then iterate side chain core/rawdb, ethdb: add hasAncient interface eth/downloader: calculate ancient limit via cht first core, eth, ethdb: lots of fixes * eth/downloader: print ancient disable log only for fast sync	6 years ago
Péter Szilágyi	9effd64290	core, eth, trie: bloom filter for trie node dedup during fast sync (#19489) ... * core, eth, trie: bloom filter for trie node dedup during fast sync * eth/downloader, trie: address review comments * core, ethdb, trie: restart fast-sync bloom construction now and again * eth/downloader: initialize fast sync bloom on startup * eth: reenable eth/62 until we properly remove it	6 years ago
gary rong	14868a37fb	trie: clarify why verifyProof doesn't check hashes (#19530) ... * trie: fix merkle proof * trie: use hasher instead of allocate keccack256 every time * trie: add comments	6 years ago
Péter Szilágyi	4a4abc41d4	trie: approximate the wasted cache metaspace closer	6 years ago
Péter Szilágyi	4bf0d11e7c	trie: there's no point in retrieving the metaroot	6 years ago
Martin Holst Swende	59e1953246	core, ethdb, trie: mode dirty data to clean cache on flush (#19307) ... This PR is a more advanced form of the dirty-to-clean cacher (#18995), where we reuse previous database write batches as datasets to uncache, saving a dirty-trie-iteration and a dirty-trie-rlp-reencoding per block.	6 years ago
Martin Holst Swende	876f357364	trie: disable fnv64a hashing of hashes for bigcache (#19314) ... * trie: disable fnv64a hashing of hashes for bigcache * trie/database: add very important period	6 years ago
Péter Szilágyi	91eec1251c	cmd, core, eth, trie: get rid of trie cache generations (#19262) ... * cmd, core, eth, trie: get rid of trie cache generations * core, trie: get rid of remainder of cache gen boilerplate	6 years ago
Péter Szilágyi	8111b9dda5	ethdb, trie: tiny API tidy-up from the database rework pr	6 years ago
Péter Szilágyi	054412e335	all: clean up and proerly abstract database access	6 years ago
Matthew Halpern	514a9472ad	trie: prefer nil slices over zero-length slices (#19084)	6 years ago
Martin Holst Swende	4f85c2b88b	trie: fix error in node decoding (#19111)	6 years ago
HackyMiner	bb7c786b09	trie: add missing unlock call in error case (#18985)	6 years ago
Dave McGregor	33d233d3e1	vendor, crypto, swarm: switch over to upstream sha3 package	6 years ago
Martin Holst Swende	2843001ac2	trie: fix overflow in write cache parent tracking (#18165) ... trie/database: fix overflow in parent tracking	6 years ago
Péter Szilágyi	d136e985e8	trie: go fmt package	6 years ago
Łukasz Kurowski	68be45e5f8	trie: return hasher to pool (#18116) ... * trie: return hasher to pool * trie: minor code formatting fix	6 years ago
Péter Szilágyi	434dd5bc00	cmd, core, eth, light, trie: add trie read caching layer	6 years ago
Péter Szilágyi	53634f1e04	trie: remove unused originalRoot field (#17862)	6 years ago
Wenbiao Zheng	6a33954731	core, eth, trie: use common/prque (#17508)	6 years ago
Mymskmkt	70398d300d	trie: fix typo (#17498)	6 years ago
Péter Szilágyi	11bbc66082	eth, trie: fix tracer GC which accidentally pruned the metaroot	6 years ago
Mymskmkt	8051a0768a	trie: fix comment typo (#17350)	6 years ago
Oleg Kovalov	cf05ef9106	p2p, swarm, trie: avoid copying slices in loops (#17265)	6 years ago
Péter Szilágyi	8a9c31a307	trie: handle removing the freshest node too	6 years ago
Péter Szilágyi	319098cc1c	trie: fix a temporary memory leak in the memcache	6 years ago
Péter Szilágyi	d926bf2c7e	trie: cache collapsed tries node, not rlp blobs (#16876) ... 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).	6 years ago
Péter Szilágyi	a3267ed929	trie: don't report the root flushlist as an alloc	7 years ago
Sarlor	ea06da0892	trie: avoid unnecessary slicing on shortnode decoding (#16917) ... optimization code	7 years ago