4 * @author Sebastian Hack
6 * Backend node support.
8 * Copyright (C) 2005 Universitaet Karlsruhe
9 * Released under the GPL
23 struct _be_node_factory_t {
24 const arch_isa_if_t *isa;
31 arch_irn_handler_t handler;
32 arch_irn_ops_t irn_ops;
35 typedef struct _be_node_factory_t be_node_factory_t;
37 be_node_factory_t *be_node_factory_init(be_node_factory_t *factory, const arch_isa_t *isa);
39 const arch_irn_handler_t *be_node_get_irn_handler(const be_node_factory_t *f);
41 ir_node *new_Spill(const be_node_factory_t *factory,
42 const arch_register_class_t *cls,
43 ir_graph *irg, ir_node *bl, ir_node *node_to_spill, ir_node *ctx);
45 ir_node *new_Reload(const be_node_factory_t *factory,
46 const arch_register_class_t *cls, ir_graph *irg,
47 ir_node *bl, ir_mode *mode, ir_node *spill_node);
49 ir_node *new_Perm(const be_node_factory_t *factory,
50 const arch_register_class_t *cls,
51 ir_graph *irg, ir_node *bl, int arity, ir_node **in);
53 ir_node *new_Copy(const be_node_factory_t *factory,
54 const arch_register_class_t *cls,
55 ir_graph *irg, ir_node *block, ir_node *in);
58 const be_node_factory_t *factory,
59 const arch_env_t *arch_env,
64 const be_node_factory_t *factory,
65 const arch_env_t *arch_env,
66 const arch_register_class_t *cls,
67 ir_node *irn, int pos, ir_mode *mode, ir_node *spill);
69 ir_node *new_Keep(ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
71 int be_is_Spill(const ir_node *irn);
72 int be_is_Reload(const ir_node *irn);
73 int be_is_Copy(const ir_node *irn);
74 int be_is_Perm(const ir_node *irn);
76 const arch_register_class_t *be_node_get_reg_class(const ir_node *irn);
78 void set_Spill_offset(ir_node *irn, unsigned offset);
79 unsigned get_Spill_offset(ir_node *irn);
81 ir_node *get_Spill_context(const ir_node *irn);
85 * Modify the output register requirements of a Perm.
86 * This function incur register constraints to an output value of a Perm.
87 * This is used when handling register constraints in general,
90 void be_set_Perm_out_req(ir_node *irn, int pos, const arch_register_req_t *req);
93 * Insert a Perm node after a specific node in the schedule.
94 * The Perm permutes over all values live at the given node.
95 * This means that all liveness intervals are cut apart at this
96 * location in the program.
98 ir_node *insert_Perm_after(const be_main_env_t *env,
99 const arch_register_class_t *cls,
100 dom_front_info_t *dom_front,
103 #endif /* _BENODE_T_H */