diff options
| author | 2023-10-13 14:21:30 +0100 | |
|---|---|---|
| committer | 2023-10-16 09:38:31 +0000 | |
| commit | a5ab063a82b7d4d5e120e5d81899a731397e186a (patch) | |
| tree | 1e7df1e6331e4986443abf6ba349fdfc64262f74 /compiler/optimizing/nodes.h | |
| parent | 754bdc0a8caf6c05f091afd674759bf7a54a4289 (diff) | |
Add a new helper RecomputeDominatorTree
It clears loop and dominance information, and builds the dominator
tree. It also dchecks that we are not calling this methods with
irreducible loops, as it is not supported.
When adding this helper we found a partial LSE bug as it was
recomputing dominator tree for irreducible loops.
Test: art/test/testrunner/testrunner.py --host --64 -b --optimizing
Bug: 304749506
Change-Id: Ia4cc72cd19779ad881fa686e52b43679fe5a64d3
Diffstat (limited to 'compiler/optimizing/nodes.h')
| -rw-r--r-- | compiler/optimizing/nodes.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/compiler/optimizing/nodes.h b/compiler/optimizing/nodes.h index 9cf52183b8..3613b9519b 100644 --- a/compiler/optimizing/nodes.h +++ b/compiler/optimizing/nodes.h @@ -467,6 +467,7 @@ class HGraph : public ArenaObject<kArenaAllocGraph> { void ClearLoopInformation(); void FindBackEdges(ArenaBitVector* visited); GraphAnalysisResult BuildDominatorTree(); + GraphAnalysisResult RecomputeDominatorTree(); void SimplifyCFG(); void SimplifyCatchBlocks(); |