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
8285558: IGV: scheduling crashes on control-unreachable CFG nodes #8916
Conversation
|
@robcasloz 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. |
@robcasloz This change now passes all automated pre-integration checks. 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 19 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.
|
Thanks for reviewing, Vladimir! |
Looks good! That's useful to mark them with a warning when analyzing dead loop problems.
Thanks for reviewing, Christian! |
/integrate |
Going to push as commit 8f59422.
Your commit was automatically rebased without conflicts. |
@robcasloz Pushed as commit 8f59422. |
This changeset relaxes IGV's schedule approximation algorithm to handle CFG nodes that are not reachable from the root node via a control path. This is done by 1) removing the assumption that, after
ServerCompilerScheduler::buildBlocks()
,Node::block
is non-null for CFG nodes; and 2) leaving the assignment of blockless nodes to an artificial "no block" toInputGraph::ensureNodesInBlocks()
, which is always called after running the schedule approximation algorithm.Additionally, the changeset marks unreachable CFG nodes with a warning, making it easier to identify ill-formed graphs:
Testing
Tested manually on the two graphs reported in the JBS issue.
Tested automatically that scheduling tens of thousands of graphs (by instrumenting IGV to schedule parsed graphs eagerly and running
java -Xcomp -XX:-TieredCompilation -XX:PrintIdealGraphLevel=4
) does not introduce any exception or assertion failure.Progress
Issue
Reviewers
Reviewing
Using
git
Checkout this PR locally:
$ git fetch https://git.openjdk.java.net/jdk pull/8916/head:pull/8916
$ git checkout pull/8916
Update a local copy of the PR:
$ git checkout pull/8916
$ git pull https://git.openjdk.java.net/jdk pull/8916/head
Using Skara CLI tools
Checkout this PR locally:
$ git pr checkout 8916
View PR using the GUI difftool:
$ git pr show -t 8916
Using diff file
Download this PR as a diff file:
https://git.openjdk.java.net/jdk/pull/8916.diff