blob: e49673e8c8af2f818479e7a9ee244de44d73ed9d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
+++
title = "Dominator calculations in CompCertSSA"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["3a8e"]
forwardlinks = ["2e1b", "3a8g"]
zettelid = "3a8f"
+++
CompCertSSA currently does not have the completeness proof of the
dominator trees, but does have dominator trees itself. These can be
calculated using the `compute_test_dom` function, which includes a
validator for the correct generation of the dominator tree.
This generates the whole structure of the dominator hierarchy, which can
then be used to do various analysis, such as finding out if one is in a
loop, and where the loop header is. This can be useful for generating
gated-SSA for example ([\#2e1b]).
[\#2e1b]: /zettel/2e1b
|
