/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
*/
void be_init_op(void);
+void be_finish_op(void);
+
/**
* Position numbers for the be_Spill inputs.
*/
ir_node *be_new_Copy(ir_node *block, ir_node *in);
/** Returns the Copy Argument. */
ir_node *be_get_Copy_op(const ir_node *cpy);
-/** Sets the Copy Argument. */
-void be_set_Copy_op(ir_node *cpy, ir_node *op);
/**
* Make a new Perm node.
* (negative offset). Note that the offset is independent of the
* natural stack direction of the architecture but just specifies
* abstract expanding/shrinking of the stack area.
- * @param align force stack alignment to this power of 2. (ie. specifying 3
+ * @param align force stack alignment to this power of 2. (i.e. specifying 3
* results in a 2^3 = 8byte stack alignment)
* @return A new stack pointer increment/decrement node.
* @note This node sets a register constraint to the @p sp register on
* Construct a new be_Call.
*
* @param dbg debug info
- * @param irg the graph where the call is placed
* @param block the block where the call is placed
* @param mem the memory input of the call
* @param sp the stack pointer input of the call
* @param in the (register) inputs of this call
* @param call_tp the call type of this call
*/
-ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *block, ir_node *mem,
- ir_node *sp, ir_node *ptr, int n_outs,
- int n, ir_node *in[], ir_type *call_tp);
+ir_node *be_new_Call(dbg_info *dbg, ir_node *block, ir_node *mem,
+ const arch_register_req_t *sp_req, ir_node *sp,
+ const arch_register_req_t *ptr_req, ir_node *ptr,
+ int n_outs, int n, ir_node *in[], ir_type *call_tp);
/**
* Position numbers for the be_Return inputs.
* Construct a new be_Return.
*
* @param dbg debug info
- * @param irg the graph where the new node will be placed
* @param block the block where the new node will be placed
* @param n_res number of "real" results
* @param pop pop number of bytes on return
* @param n number of inputs
* @param in input array
*/
-ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
- unsigned pop, int n, ir_node *in[]);
+ir_node *be_new_Return(dbg_info *dbg, ir_node *block, int n_res, unsigned pop, int n, ir_node *in[]);
/** Returns the number of real returns values */
int be_Return_get_n_rets(const ir_node *ret);
*/
void be_Return_set_emit_pop(ir_node *ret, int emit_pop);
-/** appends a node to the return node, returns the position of the node */
-int be_Return_append_node(ir_node *ret, ir_node *node);
-
ir_node *be_new_Start(dbg_info *dbgi, ir_node *block, int n_out);
enum {
* Creates a new phi with associated backend informations
*/
ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode,
- const arch_register_class_t *cls);
+ const arch_register_req_t *req);
/**
* Search for output of start node with a specific register
*/
ir_node *be_get_initial_reg_value(ir_graph *irg, const arch_register_t *reg);
-/**
- * Search for input of a return node with a specific register and return
- * its number.
- */
-int be_find_return_reg_input(ir_node *ret, const arch_register_t *reg);
-
static inline int be_is_Spill (const ir_node *irn) { return get_irn_opcode(irn) == beo_Spill ; }
static inline int be_is_Reload (const ir_node *irn) { return get_irn_opcode(irn) == beo_Reload ; }
static inline int be_is_Copy (const ir_node *irn) { return get_irn_opcode(irn) == beo_Copy ; }