From mboxrd@z Thu Jan  1 00:00:00 1970
From: Marcio de Oliveira Buss  <ra990898@ic.unicamp.br>
To: gcc@gcc.gnu.org
Subject: Post Dominator Tree
Date: Mon, 03 Jul 2000 10:37:00 -0000
Message-id: <Pine.GSO.4.10.10007031429330.10072-100000@xingu.dcc.unicamp.br>
X-SW-Source: 2000-07/msg00023.html

	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.