- * @brief Introduce several copies for one node.
- * @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
- * @date 30.03.2007
- * @version $Id$
- * Copyright: (c) Universitaet Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
-
+ * @brief SSA construction for a set of nodes
+ * @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
+ * @date 30.03.2007
+ *
+ * The problem: Given a value and a set of "copies" that are known to
+ * represent the same abstract value, rewire all usages of the original value
+ * to their closest copy while introducing phis as necessary.
+ *
+ * Algorithm: Mark all blocks in the iterated dominance frontiers of the value
+ * and its copies. Link the copies ordered by dominance to the blocks. Then
+ * we search for each use all definitions in the current block, if none is
+ * found, then we search one in the immediate dominator. If we are in a block
+ * of the dominance frontier, create a phi and do the same search for all
+ * phi arguments.
+ *