-
Notifications
You must be signed in to change notification settings - Fork 137
tapdb: switch proof cache to size-based limits and add deep size estimation #1870
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
Summary of ChangesHello @ffranr, I'm Gemini Code Assist1! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed! This pull request significantly refactors the Highlights
Using Gemini Code AssistThe full guide for Gemini Code Assist can be found on our documentation page, here are some quick tips. Invoking Gemini You can request assistance from Gemini at any point by creating a comment using either
Customization To customize Gemini Code Assist for GitHub experience, repository maintainers can create a configuration file and/or provide a custom code review style guide (such as PEP-8 for Python) by creating and adding files to a Limitations & Feedback Gemini Code Assist may make mistakes. Please leave feedback on any instances where its feedback is incorrect or counter productive. You can react with 👍 and 👎 on @gemini-code-assist comments. If you're interested in giving your feedback about your experience with Gemini Code Assist for Github and other Google products, sign up here. You can also get AI-powered code generation, chat, as well as code reviews directly in the IDE at no cost with the Gemini Code Assist IDE Extension. Footnotes
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Code Review
This pull request introduces a significant improvement by switching the proof cache from count-based to size-based limits, incorporating deep size estimation for more accurate memory management. The changes also include finer-grained eviction strategies for cache entries and enhanced error handling and logging around cache initialization. The new LowerBoundByteSize function, utilizing reflect and unsafe, provides a conservative estimate of an object's memory footprint, which is crucial for the new cache mechanism. Comprehensive unit tests have been added for this new functionality, covering various data types and edge cases like pointer cycles. Configuration options have been updated to support human-readable size values for the cache limit. Overall, the changes align well with the stated objective of improving cache efficiency and control.
f273430 to
e2c0aad
Compare
e2c0aad to
7e26748
Compare
Pull Request Test Coverage Report for Build 19709230089Details
💛 - Coveralls |
2b3ac4f to
035a840
Compare
|
@darioAnongba: review reminder |
Introduce `LowerBoundByteSize` for deep-size estimation of various data types, handling primitives, structs, slices, maps, and pointer cycles. Add unit tests to ensure correctness and coverage.
- Replace `ProofKey` with `UniverseProofKey` for clearer cache key distinction, enabling removal of individual proofs by leaf key instead of all proofs for a universe ID. - Refactor proof cache methods: add `RemoveLeafKeyProofs` and enhance `RemoveUniverseProofs` for more granular control. - Implement deep size estimation in the `Size` method to improve memory management accuracy. - Change cache size limit from number of proofs to total memory size of all proofs, as proof sizes can vary due to inclusion of parent proof files.
- Replace `proofs-per-universe` configuration with `max-proof-cache-size`, allowing proof cache limits to be defined by total memory size instead of proof count. - Add logic to parse and handle human-readable size values (e.g., "32MB"). - Update default configuration and related comments. - Adjust `NewMultiverseStore` to use parsed cache size values and improve error handling.
Updates the dependency to expose the Size() method on cache implementations, enabling direct access to cache size.
* Add support for an optional cache size callback to newCacheLogger. * Enable cache size logging in the universe proof cache.
362970f to
8619862
Compare
8619862 to
140f544
Compare
| } | ||
|
|
||
| // LowerBoundByteSize returns the lower bound on the byte size of the proof. | ||
| func (p *Proof) LowerBoundByteSize() uint64 { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
could also add some test coverage for the LowerBoundByteSize function of universe.Proof
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
universe.Proof.LowerBoundByteSize just delegates to fn.LowerBoundByteSize, and the underlying function already has test coverage.
Maybe I've misunderstood what you mean.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I mean we should create dummy universe.Proof instances and verify that an iteration of fn.LowerBoundByteSize over it actually returns the size of it.
I guess if we're very confident on the fn function coverage this is actually not needed. Would only be a sanity check that it can iterate a proof properly.
| ), | ||
| transferProofDistributor: fn.NewEventDistributor[proof.Blob](), | ||
| } | ||
| }, nil |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can drop this commit -- seems like no error is ever returned?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The next commit adds an error return code path to NewMultiverseStore.
| return lru.NewCache[ProofKey, *cachedProofs](proofCacheSize) | ||
| // | ||
| // nolint: lll | ||
| func newProofCache(totalCacheBytesSize uint64) *lru.Cache[UniverseProofKey, *cachedProofs] { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I wonder if a direction where proof entries lack the recursive element (i.e size within bounds or fixed) is a better approach to this overall. Even with a fully fledged size aware cache we'll still have overlapping content between various proof files.
The PR seems in good shape so def not worth changing our mind now. Should make sure there's an issue tracking the elimination of the recursive element of the entries.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think we need both this size aware cache and also proof reference optimisation. This issue tracks most of the proof optimisation work: #503
Also, enhance the release notes template with a section to aid in reporting breaking config changes.
140f544 to
edce8ac
Compare
Issue: #1865
This PR introduces a size-based proof cache and supporting deep-size logic.
Summary
LowerBoundByteSize) and apply it to proof cache entries.Note
It's pretty trivial to get from here to logging cache size, but we need lightninglabs/neutrino#330 for that.