#include "bearch.h"
#include "beabi_t.h"
-/** Flag: if set, try to omit the frame pointer if alled by the backend */
-extern int be_omit_fp;
-
struct _be_abi_call_flags_bits_t {
unsigned left_to_right : 1; /**< Arguments are from left to right. */
unsigned store_args_sequential : 1; /**< Use sequential stores for arguments. */
* Generate the prologue.
* @param self The callback object.
* @param mem A pointer to the mem node. Update this if you define new memory.
- * @param reg_map A mapping mapping all callee_save/ignore/parameter registers to their defining nodes.
+ * @param reg_map A map mapping all callee_save/ignore/parameter registers to their defining nodes.
* @return The register which shall be used as a stack frame base.
*
* All nodes which define registers in @p reg_map must keep @p reg_map current.
* Also, the @p mem variable must be updated, if memory producing nodes are inserted.
*/
void (*epilogue)(void *self, ir_node *bl, ir_node **mem, pmap *reg_map);
+
+ int (*collect_stack_phis)(void *self);
};
/**
*/
void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb);
+/**
+ * Set register class for call address.
+ * @param call The call.
+ * @param cls The register class for call address.
+ */
+void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls);
+
void be_abi_call_param_stack(be_abi_call_t *call, int pos, unsigned alignment, unsigned space_before, unsigned space_after);
void be_abi_call_param_reg(be_abi_call_t *call, int pos, const arch_register_t *reg);
void be_abi_call_res_reg(be_abi_call_t *call, int pos, const arch_register_t *reg);
be_abi_irg_t *be_abi_introduce(be_irg_t *bi);
void be_abi_fix_stack_bias(be_abi_irg_t *env);
-void be_abi_fix_stack_nodes(be_abi_irg_t *env);
void be_abi_free(be_abi_irg_t *abi);
+/**
+ * Rewire all stack modifying nodes and their users to assure SSA property.
+ * @param env The abi
+ * @param lv Liveness object, so the liveness of changed and newly introduces nodes
+ * can be recomputed. Maybe NULL (no liveness information update then)
+ */
+void be_abi_fix_stack_nodes(be_abi_irg_t *env, be_lv_t *lv);
+
+/**
+ * Put the registers which are forbidden specifically for this IRG in a bitset.
+ */
void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs);
ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg);
+ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg);
+ir_node *be_abi_get_start_barrier(be_abi_irg_t *abi);
#define be_abi_reg_map_get(map, reg) pmap_get((map), (void *) (reg))
#define be_abi_reg_map_set(map, reg, irn) pmap_insert((map), (void *) (reg), (irn))
+/** The number of parts of the stack layout. */
+#define N_FRAME_TYPES 3
+
+/**
+ * This type describes the stack layout.
+ * The stack is divided into 3 parts:
+ * - arg_type: A struct type describing the stack arguments and it's order.
+ * - between_type: A struct type describing the stack layout between arguments
+ * and frame type. In architectures that put the return address
+ * automatically on the stack, the return address is put here.
+ * - frame_type: A class type describing the frame layout
+ */
+struct _be_stack_layout_t {
+ ir_type *arg_type; /**< A type describing the stack argument layout. */
+ ir_type *between_type; /**< A type describing the "between" layout. */
+ ir_type *frame_type; /**< The frame type. */
+
+ ir_type *order[N_FRAME_TYPES]; /**< arg, between and frame types ordered. */
+
+ int initial_offset;
+ int stack_dir; /**< -1 for decreasing, 1 for increasing. */
+ ir_entity **param_map; /**< An array mapping type parameters to arg_type entries */
+};
+
+/**
+ * Returns the stack layout from a abi environment.
+ */
+const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi);
+
+/**
+ * Returns non-zero if the ABI has omitted the frame pointer in
+ * the current graph.
+ */
+int be_abi_omit_fp(const be_abi_irg_t *abi);
+
#endif /* _BEABI_H */