/*
- * 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.
*/
/**
* @brief Helper functions for handling ABI constraints in the code
* selection phase.
* @author Matthias Braun
- * @version $Id$
*/
#ifndef FIRM_BE_BEABI_HELPER_H
#define FIRM_BE_BEABI_HELPER_H
#include "bearch.h"
typedef struct beabi_helper_env_t beabi_helper_env_t;
+typedef struct be_stackorder_t be_stackorder_t;
/**
* Creates a helper object for the ABI constraint handling.
void be_add_missing_keeps(ir_graph *irg);
/**
- * Collect firm nodes that will probably modify the stack.
- * Put them into an order that respects all their dependencies.
+ * Make sure all outputs of a node are used, add keeps otherwise
*/
-void be_collect_stacknodes(beabi_helper_env_t *env);
+void be_add_missing_keeps_node(ir_node *node);
+
+/**
+ * In the normal firm representation some nodes like pure calls, builtins
+ * have no memory inputs+outputs. However in the backend these sometimes have to
+ * access the stack to work and therefore suddenly need to be enqueued into the
+ * memory edge again.
+ * This API creates a possible order to enqueue them so we can be sure to create
+ * a legal dependency graph when transforming them.
+ */
+be_stackorder_t *be_collect_stacknodes(ir_graph *irg);
/**
* return node that should produce the predecessor stack node in a block.
* returns NULL if there's no predecessor in the current block.
*/
-ir_node *be_get_stack_pred(const beabi_helper_env_t *env, const ir_node *node);
+ir_node *be_get_stack_pred(const be_stackorder_t *env, const ir_node *node);
+
+/**
+ * free memory associated with a stackorder structure
+ */
+void be_free_stackorder(be_stackorder_t *env);
+
+/**
+ * In case where a parameter is transmitted via register but someone takes its
+ * address a store to the frame which can be references is necessary.
+ * This function can be used as a preprocessing phase before transformation to
+ * do this. The assumption is that all parameter_entities which are passed
+ * through the stack are already moved to the arg_type and all remaining
+ * parameter_entities on the frame type need stores.
+ */
+void be_add_parameter_entity_stores(ir_graph *irg);
#endif