+void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node);
+
+ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
+ ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_entity *ent);
+ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
+ ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, ir_entity *ent);
+ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent);
+
+/**
+ * Position numbers for the be_AddSP inputs
+ */
+enum {
+ be_pos_AddSP_old_sp = 0,
+ be_pos_AddSP_size = 1,
+ be_pos_AddSP_last = 2
+};
+
+enum {
+ pn_be_AddSP_res = 0,
+ pn_be_AddSP_M = 1,
+ pn_be_AddSP_last = 2
+};
+
+/**
+ * Make a new AddSP node.
+ * An AddSP node expresses an increase of the stack pointer in the direction the stack
+ * grows. In contrast to IncSP, the amount of bytes the stack pointer is grown, is not
+ * given by a constant but an ordinary Firm node.
+ * @param sp The stack pointer register.
+ * @param irg The graph.
+ * @param bl The block.
+ * @param old_sp The node representing the old stack pointer value.
+ * @param sz The node expressing the size by which the stack pointer shall be grown.
+ * @return A new AddSP node.
+ */
+ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz);
+
+/**
+ * Position numbers for the be_SubSP inputs
+ */
+enum {
+ be_pos_SubSP_old_sp = 0,
+ be_pos_SubSP_size = 1,
+ be_pos_SubSP_last = 2
+};
+
+enum {
+ pn_be_SubSP_res = 0,
+ pn_be_SubSP_M = 1,
+ pn_be_SubSP_last = 2
+};
+
+/**
+ * Make a new SubSP node.
+ * A SubSP node expresses a decrease of the stack pointer in the direction the stack
+ * grows. In contrast to IncSP, the amount of bytes the stack pointer is grown, is not
+ * given by a constant but an ordinary Firm node.
+ * @param sp The stack pointer register.
+ * @param irg The graph.
+ * @param bl The block.
+ * @param old_sp The node representing the old stack pointer value.
+ * @param sz The node expressing the size by which the stack pointer shall be grown.
+ * @return A new DecSP node.
+ */
+ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz);
+
+ir_node *be_new_SetSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *operand, ir_node *mem);
+
+/**
+ * Make a stack pointer increase/decrease node.
+ * @param sp The stack pointer register.
+ * @param irg The graph to insert the node to.
+ * @param bl The block to insert the node into.
+ * @param old_sp The node defining the former stack pointer.
+ * @param amount The mount of bytes the stack shall be expanded/shrinked (see set_IncSP_offset)
+ * @param dir The direction in which the stack pointer shall be modified:
+ * Along the stack's growing direction or against.
+ * @return A new stack pointer increment/decrement node.
+ * @note This node sets a register constraint to the @p sp register on its output.
+ */
+ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, int offset);
+
+/** Returns the previous node that computes the stack pointer. */
+ir_node *be_get_IncSP_pred(ir_node *incsp);
+
+/** Sets the previous node that computes the stack pointer. */
+void be_set_IncSP_pred(ir_node *incsp, ir_node *pred);
+
+/**
+ * Sets a new offset to a IncSP node.
+ * A positive offset means expanding the stack, a negative offset shrinking
+ * an offset is == BE_STACK_FRAME_SIZE will be replaced by the real size of the
+ * stackframe in the fix_stack_offsets phase.
+ */
+void be_set_IncSP_offset(ir_node *irn, int offset);
+
+/** Gets the offset from a IncSP node. */
+int be_get_IncSP_offset(const ir_node *irn);
+
+/** Gets the call entity or NULL if this is no static call. */
+ir_entity *be_Call_get_entity(const ir_node *call);
+/** Sets the call entity. */
+void be_Call_set_entity(ir_node *call, ir_entity *ent);
+/** Gets the call type. */
+ir_type *be_Call_get_type(ir_node *call);
+/** Sets the call type. */
+void be_Call_set_type(ir_node *call, ir_type *call_tp);
+
+/**
+ * Position numbers for the be_Call inputs.
+ */
+enum {
+ be_pos_Call_mem = 0, /**< memory input of a be_Call node */
+ be_pos_Call_sp = 1, /**< stack pointer input of a be_Call node */
+ be_pos_Call_ptr = 2, /**< call pointer input of a be_Call node */
+ be_pos_Call_first_arg = 3 /**< first argument input of a be_Call node */
+};
+
+/**
+ * Projection numbers for result of be_Call node: use for Proj nodes!
+ */
+typedef enum {
+ pn_be_Call_M_regular = pn_Call_M_regular, /**< The memory result of a be_Call. */
+ pn_be_Call_first_res = pn_Call_max /**< The first result proj number of a be_Call. */
+} pn_be_Call;
+
+/**
+ * Construct a new be_Call
+ */
+ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
+ int n_outs, int n, ir_node *in[], ir_type *call_tp);
+
+/**
+ * Position numbers for the be_Return inputs.
+ */
+enum {
+ be_pos_Return_mem = 0, /**< memory input of a be_Return node */
+ be_pos_Return_sp = 1, /**< stack pointer input of a be_Return node */
+ be_pos_Return_val = 2, /**< first "real" return value if any */
+};
+
+/**
+ * Construct a new be_Return.
+ * @param irg the graph where the new node will be placed
+ * @param bl the block where the new node will be placed
+ * @param n_res number of "real" results
+ * @param n number of inputs
+ * @param in input array
+ */
+ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n_res, int n, ir_node *in[]);
+
+/** Returns the number of real returns values */
+int be_Return_get_n_rets(ir_node *ret);
+
+/** appends a node to the return node, returns the position of the node */
+int be_Return_append_node(ir_node *ret, ir_node *node);
+
+/**
+ * Construct a new Stack Parameter node.
+ */
+ir_node *be_new_StackParam(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, ir_entity *ent);
+ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_out);
+
+ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
+
+/**
+ * Appends a node to a barrier, returns the result proj of the node
+ */
+ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node);
+
+/**
+ * Appends a register out requirement to a RegParams node
+ *
+ * @returns the proj node for the new register
+ */
+ir_node *be_RegParams_append_out_reg(ir_node *regparams,
+ const arch_env_t *arch_env,
+ const arch_register_t *reg);
+
+/**
+ * Make a spill node.
+ *
+ * @param arch_env The architecture environment.
+ * @param irn The node to be spilled.
+ * @param spill_ctx The context in which the spill is introduced (This is mostly == irn up to the case of Phis).
+ * @return The new spill node.
+ */
+ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn);
+
+/**
+ * Make a reload and insert it into the schedule.
+ *
+ * @param arch_env The architecture environment.
+ * @param cls The register class of the reloaded value.
+ * @param insert The node in the schedule in front of which the reload is inserted.
+ * @param mode The mode of the original (spilled) value.
+ * @param spill The spill node corresponding to this reload.
+ * @return A freshly made reload.
+ */
+ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill);
+
+enum {
+ be_pos_CopyKeep_op = 0
+};
+ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, int n, ir_node *in_keep[], ir_mode *mode);
+ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode);
+ir_node *be_get_CopyKeep_op(const ir_node *cpy);
+void be_set_CopyKeep_op(ir_node *cpy, ir_node *op);
+
+/**
+ * Get the backend opcode of a backend node.
+ * @param irn The node.
+ * @return The backend opcode.
+ */
+be_opcode_t be_get_irn_opcode(const ir_node *irn);