* @brief SSA construction for a set of nodes
* @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
* @date 30.03.2007
* @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
*
* 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 it's copies. Link the copies ordered by dominance to the blocks. The
- * we search for each use all all definitions in the current block, if none is
+ * 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
*
* A copy in this context means, that you want to introduce several new
* abstract values (in Firm: nodes) for which you know, that they
*
* A copy in this context means, that you want to introduce several new
* abstract values (in Firm: nodes) for which you know, that they
- ir_graph *irg;
- const be_dom_front_info_t *domfronts;
- ir_mode *mode;
- waitq *worklist;
- const ir_nodeset_t *ignore_uses;
- ir_node **new_phis;
- int iterated_domfront_calculated;
+ ir_graph *irg;
+ const be_dom_front_info_t *domfronts;
+ ir_mode *mode;
+ const arch_register_class_t *phi_cls;
+ waitq *worklist;
+ const ir_nodeset_t *ignore_uses;
+ ir_node **new_phis;
+ int iterated_domfront_calculated;
+ ir_nodemap infos;
+ struct obstack obst;