You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Dominator trees store the dominance relation between basic blocks in a function.
A dominance tree allows us to quickly compute:
The dominance frontier
Immediate dominators for a node
The dominator tree is very useful in figuring out which nodes are not dominated by the entry block and for example, can be used for reachability analysis.
Proposed solution
Implement a dominator tree in a modular way with comments and tests
Alternatives considered
No response
Additional context
No response
Submission Checklist
Once I hit submit, I will assign this issue to the Project Board with the appropriate tags.
The text was updated successfully, but these errors were encountered:
Problem
Dominator trees store the dominance relation between basic blocks in a function.
A dominance tree allows us to quickly compute:
The dominator tree is very useful in figuring out which nodes are not dominated by the entry block and for example, can be used for reachability analysis.
Proposed solution
Implement a dominator tree in a modular way with comments and tests
Alternatives considered
No response
Additional context
No response
Submission Checklist
The text was updated successfully, but these errors were encountered: