-
Notifications
You must be signed in to change notification settings - Fork 1.3k
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
converted DominatorTree to DominatorTreePreorder in alias_analysis file #8535
Conversation
Signed-off-by: Vamshi Reddy <vamshiproject02@gmail.com>
@jameysharp, sounds like you have some previous context for this change? |
I do, thanks Andrew! I proposed doing this in #7954. @VamshiReddy02, this is a good start! I'm excited that you're working on it. I labeled this issue "easy" but there are some things that are not so easy about it, and you've started with one of the more difficult cases: Comparing two instructions, instead of two blocks. That's okay! Let's figure out how to make it work. Instruction
You've implemented the second condition, but not the first. The first thing I think you should do is add a new method to Then you can call I hope that helps. One more request: Could you run Thank you for working on this! |
Hey @jameysharp, impl DominatorTreePreorder {
pub fn dominates_inst(&self, a: Inst, b: Inst, layout: &Layout) -> bool {
match (layout.inst_block(a), layout.inst_block(b)) {
(Some(block_a), Some(block_b)) => {
if block_a == block_b {
layout.pp_cmp::<ProgramPoint, ProgramPoint>(a.into(), b.into()) != Ordering::Greater
} else {
self.dominates(block_a, block_b)
}
}
_ => false,
}
}
} Then I need to call the let aliased =
if let Some((def_inst, value)) = self.mem_values.get(&mem_loc).cloned() {
trace!(
" -> sees known value v{} from inst{}",
value.index(),
def_inst.index()
);
if let (Some(_def_block), Some(_inst_block)) = (
func.layout.inst_block(def_inst),
func.layout.inst_block(inst),
) {
if self.domtree.`dominates_inst(def_inst, inst, &func.layout)` {
trace!(
" -> dominates; value equiv from v{} to v{} inserted",
load_result.index(),
value.index()
);
Some(value)
} else {
None
}
} else {
None
}
} else {
None
}; Am I going in the correct direction? |
Yes, that is the correct direction! There are a few ways to make this easier though:
But yes, you are most of the way there! I look forward to seeing your updated pull request. Some other projects expect "perfect" git commits, so I just want to let you know that we don't care about that for Wasmtime and Cranelift. As you make further changes, just commit them and push them to your |
Signed-off-by: Vamshi Reddy <vamshiproject02@gmail.com>
Signed-off-by: Vamshi Reddy <vamshiproject02@gmail.com>
Hey @jameysharp, I made some changes, let me know if any changes need to be made. |
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.
This is almost exactly what I wanted! Let's just figure out why the test suite is failing in CI.
Based on the logs from CI, you should be able to reproduce the test failures by running cargo test -p wasi-common --test all
. It looks like Cranelift's tests all passed, which I think means we need some more tests…
The key error messages I'm looking at say "cranelift/codegen/src/egraph/elaborate.rs:691:21: something has gone very wrong if we are elaborating effectful instructions, they should have remained in the skeleton". This is not very helpful if you don't already know how the egraph optimization pass works, but as you make changes you can at least check whether this message changes or goes away.
My guess is that what happened is that you've called DominatorTreePreorder::new
but it's uninitialized and empty. I looked at the implementation of DominatorTreePreorder::dominates
and I think it always returns true
when it isn't initialized. This seems like a reasonable explanation for the test failures to me: if it falsely reports that things dominate each other when they actually don't, then we would "optimize" in places where we aren't actually allowed to.
The first thing I would like you to do is add this to the existing DominatorTreePreorder::dominates
function, and commit this change because if other people have the same problem this will help them figure it out more quickly:
// Check that both blocks are reachable.
debug_assert!(na.pre_number != 0);
debug_assert!(nb.pre_number != 0);
When you do that, I predict that more tests will start failing at these asserts. In particular, I hope that cargo test -p cranelift-tools
will have some failing tests.
If you can confirm that those asserts fail for some tests, then you can try fixing this and then make sure that the tests pass afterward. I think all you need to do is, in cranelift/codegen/src/context.rs
, change compute_domtree
so after it calls self.domtree.compute
it also calls self.domtree_preorder.compute
.
If any of that doesn't work, I'm happy to look at it more carefully.
Once the tests are all passing, I have a couple more comments below. But again, I think this is almost ready!
let _inst_block = func | ||
.layout | ||
.inst_block(inst) | ||
.expect("Instruction not in layout."); |
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.
This statement can be removed, because the instruction's block is not used here.
The place that I meant you could use this pattern is in the dominates_inst
function, where you could use it instead of the match
expression. But you don't have to do that if you don't want to; that function is okay the way you wrote it.
@@ -464,6 +464,20 @@ impl DominatorTreePreorder { | |||
} | |||
} | |||
|
|||
/// Checks if one instruction dominates another. | |||
pub fn dominates_inst(&self, a: Inst, b: Inst, layout: &Layout) -> bool { |
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.
This is a minor thing, but I would prefer to have dominates_inst
next to the dominates
method that it uses. Then someone looking at one of them can easily see the other one too.
I think you are very close to having this working, so I just want to check how you're doing with it. I'd love to merge this PR once it passes the test suite! |
happy to take a look if @VamshiReddy02 does not enough bandwith. |
Sure! Sorry for being inactive, caught up with some work. I'll close this PR. @fbrv you can create a new PR. |
Thank you for your effort on this, @VamshiReddy02! I think you got most of the way there and I appreciate the time that you put into it. @fbrv, welcome! Let me know if you have any questions. |
ref: #7954
Hey @jameysharp,
I made a few changes; this is my first time contributing to wasmtime. please let me know if there are any changes to make.