-
Notifications
You must be signed in to change notification settings - Fork 6.2k
8253420: Refactor HeapRegionManager::find_highest_free #2193
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
Conversation
|
👋 Welcome back ayang! A progress list of the required criteria for merging this PR into |
|
@albertnetymk The following label will be automatically applied to this pull request:
When this pull request is ready to be reviewed, an "RFR" email will be sent to the corresponding mailing list. If you would like to change these labels, use the /label pull request command. |
Webrevs
|
| uint curr = reserved_length() - 1; | ||
| while (true) { | ||
| for (uint i = 0; i < reserved_length(); ++i) { | ||
| uint curr = reserved_length() - 1 - i; |
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.
Maybe this instead?
for (uint curr = reserved_length(); curr-- > 0; ) {
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 would prefer not having side effect in the condition. At first glance, it's not obvious how many iteration the loop entails, length or length - 1?
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.
Avoiding side effects is normally good, but in this case I think it actually make the whole intent of the code clearer. We could add to the comment that we loop backwards through all reserved regions to make it clear what the bound is.
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.
Updated as suggested, since you both think it's better.
|
@albertnetymk This change now passes all automated pre-integration checks. ℹ️ This project also has non-automated pre-integration requirements. Please see the file CONTRIBUTING.md for details. After integration, the commit message for the final commit will be: You can use pull request commands such as /summary, /contributor and /issue to adjust it as needed. At the time when this comment was updated there had been 78 new commits pushed to the
As there are no conflicts, your changes will automatically be rebased on top of these commits when integrating. If you prefer to avoid this automatic rebasing, please check the documentation for the /integrate command for further details. As you do not have Committer status in this project an existing Committer must agree to sponsor your change. Possible candidates are the reviewers of this PR (@kstefanj, @kimbarrett) but any other Committer may sponsor as well. ➡️ To flag this PR as ready for integration with the above commit message, type |
|
Thank you for the reviews. /integrate |
|
@albertnetymk |
|
/integrate |
|
@kstefanj Only the author (@albertnetymk) is allowed to issue the |
|
/sponsor |
|
@kstefanj @albertnetymk Since your change was applied there have been 80 commits pushed to the
Your commit was automatically rebased without conflicts. Pushed as commit fa40a96. 💡 You may see a message that your pull request was closed with unmerged commits. This can be safely ignored. |
Using for-loop to make the number of iterations more explicit. Direct backward iteration,
for (uint curr = reserved_length() - 1; curr >= 0; curr--)doesn't work due to underflow ofuinttype. Therefore, I went for current approach.Test: hotspot_gc
Progress
Issue
Reviewers
Download
$ git fetch https://git.openjdk.java.net/jdk pull/2193/head:pull/2193$ git checkout pull/2193