X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbessaconstr.h;h=951edc81ec73e8d87d5c9378ff28645e632fcdd1;hb=9c456297552bb20d04e2fe76fd4a712afa8aa63f;hp=f65cdfc7c915c1166a20f954b4a5ff7ff1535ea4;hpb=1a3b7d363474ab544c13093a2f0b578718d37c7a;p=libfirm diff --git a/ir/be/bessaconstr.h b/ir/be/bessaconstr.h index f65cdfc7c..951edc81e 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 @@ -49,25 +48,24 @@ #ifndef FIRM_BE_BESSACONSTR_H #define FIRM_BE_BESSACONSTR_H +#include #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; /** @@ -84,9 +82,6 @@ void be_ssa_construction_add_copy(be_ssa_construction_env_t *env, void be_ssa_construction_add_copies(be_ssa_construction_env_t *env, ir_node **copies, size_t copies_len); -void be_ssa_construction_set_ignore_uses(be_ssa_construction_env_t *env, - const ir_nodeset_t *ignore_uses); - /** * Reconstructs the SSA form for all users of node @p node */