-
Notifications
You must be signed in to change notification settings - Fork 1k
Snap Server: sumListBytes fudge factor removed #9855
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
Draft
macfarla
wants to merge
4
commits into
besu-eth:main
Choose a base branch
from
macfarla:hive-more
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+11
−15
Draft
Changes from 3 commits
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
15c6bcc
ExceedingPredicate in SnapServer.java
macfarla d77995b
sumListBytes fudge factor removal
macfarla 7166fd1
Merge branch 'main' of github.com:hyperledger/besu into hive-more
macfarla 842c1e1
Merge branch 'main' of github.com:hyperledger/besu into hive-more
macfarla File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change | ||||
|---|---|---|---|---|---|---|
|
|
@@ -478,12 +478,11 @@ MessageData constructGetBytecodesResponse(final MessageData message) { | |||||
| } else { | ||||||
| Optional<Bytes> optCode = worldStateStorageCoordinator.getCode(Hash.wrap(codeHash), null); | ||||||
| if (optCode.isPresent()) { | ||||||
| if (!codeBytes.isEmpty() | ||||||
| && (sumListBytes(codeBytes) + optCode.get().size() > maxResponseBytes | ||||||
| || stopWatch.getTime() > ResponseSizePredicate.MAX_MILLIS_PER_REQUEST)) { | ||||||
| codeBytes.add(optCode.get()); | ||||||
| if (sumListBytes(codeBytes) > maxResponseBytes | ||||||
| || stopWatch.getTime() > ResponseSizePredicate.MAX_MILLIS_PER_REQUEST) { | ||||||
| break; | ||||||
| } | ||||||
| codeBytes.add(optCode.get()); | ||||||
| } | ||||||
| } | ||||||
| } | ||||||
|
|
@@ -598,8 +597,9 @@ && sumListBytes(trieNodes) + trieNode.size() > maxResponseBytes) { | |||||
| } | ||||||
|
|
||||||
| /** | ||||||
| * Predicate that doesn't immediately stop when the delegate predicate returns false, but instead | ||||||
| * sets a flag to stop after the current element is processed. | ||||||
| * Predicate that delegates to another predicate and allows one element past the limit. This | ||||||
| * implements the snap protocol's soft limit behavior where the response should include the | ||||||
| * element that first exceeds the limit, ensuring progress and providing proof of completeness. | ||||||
| */ | ||||||
| static class ExceedingPredicate implements Predicate<Pair<Bytes32, Bytes>> { | ||||||
| private final Predicate<Pair<Bytes32, Bytes>> delegate; | ||||||
|
|
@@ -611,8 +611,7 @@ public ExceedingPredicate(final Predicate<Pair<Bytes32, Bytes>> delegate) { | |||||
|
|
||||||
| @Override | ||||||
| public boolean test(final Pair<Bytes32, Bytes> pair) { | ||||||
| final boolean result = delegate.test(pair); | ||||||
| return shouldContinue.getAndSet(result); | ||||||
| return shouldContinue.getAndSet(delegate.test(pair)); | ||||||
| } | ||||||
|
|
||||||
| public boolean shouldGetMore() { | ||||||
|
|
@@ -701,8 +700,7 @@ Hash getAccountStorageRoot( | |||||
| } | ||||||
|
|
||||||
| private static int sumListBytes(final List<Bytes> listOfBytes) { | ||||||
| // TODO: remove hack, 10% is a fudge factor to account for the overhead of rlp encoding | ||||||
| return listOfBytes.stream().map(Bytes::size).reduce((a, b) -> a + b).orElse(0) * 11 / 10; | ||||||
| return listOfBytes.stream().map(Bytes::size).reduce((a, b) -> a + b).orElse(0); | ||||||
|
||||||
| return listOfBytes.stream().map(Bytes::size).reduce((a, b) -> a + b).orElse(0); | |
| return listOfBytes.stream().mapToInt(Bytes::size).sum(); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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 add-then-check pattern may cause the last added bytecode to be included in the response even if it should be excluded. After breaking from the loop, consider removing the last element if it caused the limit to be exceeded:
codeBytes.remove(codeBytes.size() - 1)before the break.