X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbessaconstr.h;h=832d21fa8952da9f4abbcc354361176569f6b5a6;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=89a69af6d3cfdb231f249839b216b124b523fd06;hpb=bed05ed2d3b2ae84849fd2e75603e8834153cd5b;p=libfirm

diff --git a/ir/be/bessaconstr.h b/ir/be/bessaconstr.h
index 89a69af6d..832d21fa8 100644
--- a/ir/be/bessaconstr.h
+++ b/ir/be/bessaconstr.h
@@ -22,7 +22,6 @@
  * @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
@@ -56,6 +55,8 @@
 #include "bitset.h"
 #include "beirg.h"
 #include "pdeq.h"
+#include "irnodemap.h"
+#include "obst.h"
 
 typedef struct be_ssa_construction_env_t {
 	ir_graph                    *irg;
@@ -66,6 +67,8 @@ typedef struct be_ssa_construction_env_t {
 	const ir_nodeset_t          *ignore_uses;
 	ir_node                    **new_phis;
 	int                          iterated_domfront_calculated;
+	ir_nodemap                   infos;
+	struct obstack               obst;
 } be_ssa_construction_env_t;
 
 /**