+/*
+ * Copyright (C) 1995-2007 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.
+ */
/**
- * Backend ABI implementation.
+ * @file
+ * @brief Backend ABI implementation.
+ * @author Sebastian Hack
+ * @version $Id$
*/
-
-#ifndef _BEABI_H
-#define _BEABI_H
+#ifndef FIRM_BE_BEABI_H
+#define FIRM_BE_BEABI_H
#include "firm_types.h"
#include "bitset.h"
#include "be.h"
+#include "beirg.h"
#include "bearch.h"
#include "beabi_t.h"
* 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);
};
/**
/**
* 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);
+void be_abi_fix_stack_nodes(be_abi_irg_t *env);
/**
* Put the registers which are forbidden specifically for this IRG in a bitset.
*/
int be_abi_omit_fp(const be_abi_irg_t *abi);
-#endif /* _BEABI_H */
+#endif /* FIRM_BE_BEABI_H */