* @brief SSA construction for a set of nodes
* @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
* @date 30.03.2007
- * @version $Id$
*
* 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
#ifndef FIRM_BE_BESSACONSTR_H
#define FIRM_BE_BESSACONSTR_H
+#include <stdbool.h>
#include "firm_types.h"
-#include "bedomfront.h"
#include "irnodeset.h"
#include "belive.h"
#include "bitset.h"
#include "beirg.h"
#include "pdeq.h"
-#include "irphase.h"
+#include "irnodemap.h"
+#include "obst.h"
typedef struct be_ssa_construction_env_t {
ir_graph *irg;
- const be_dom_front_info_t *domfronts;
ir_mode *mode;
- const arch_register_class_t *phi_cls;
+ const arch_register_req_t *phi_req;
waitq *worklist;
const ir_nodeset_t *ignore_uses;
ir_node **new_phis;
- int iterated_domfront_calculated;
- ir_phase *phase;
+ bool iterated_domfront_calculated;
+ ir_nodemap infos;
+ struct obstack obst;
} be_ssa_construction_env_t;
/**