This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Post Dominator Tree
- To: gcc at gcc dot gnu dot org
- Subject: Post Dominator Tree
- From: Marcio de Oliveira Buss <ra990898 at ic dot unicamp dot br>
- Date: Mon, 3 Jul 2000 14:36:26 -0300 (EST)
Good Morning (afternoon) for all...
I need to implement the Post-Dominator Tree in the flow
pass of the gcc. I found the compute_dominators function in the
file flow.c, but I realize that this function does not implement
a tree, but only a bitmap that represent the dominator relationship.
Am I right? Also, the Tarjan's algorithm sounds more efficient,
but this algorithm is not implemented there. If I implemented this
algorithm, it would be a contribution to gcc or it is not relevant?
Buss.