X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeabihelper.h;h=b5441eb7c5290d5992cb0b7325ce963fa9b41d24;hb=2232b14b4acf810ae96a69d1d2a33cf150b695d9;hp=10bff0a34bb5978c0c84273f13b21e857bbe823b;hpb=9a78c10bb1c78b0513f31e8b2a0222e3c497c454;p=libfirm

diff --git a/ir/be/beabihelper.h b/ir/be/beabihelper.h
index 10bff0a34..b5441eb7c 100644
--- a/ir/be/beabihelper.h
+++ b/ir/be/beabihelper.h
@@ -32,6 +32,7 @@
 #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.
@@ -113,16 +114,25 @@ ir_node *be_epilog_create_return(beabi_helper_env_t *env, dbg_info *dbgi,
 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.
+ * 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.
  */
-void be_collect_stacknodes(beabi_helper_env_t *env);
+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