+/**
+ * Collect firm nodes that will probably modify the stack.
+ * Put them into an order that respects all their dependencies.
+ */
+void be_collect_stacknodes(beabi_helper_env_t *env);
+
+/**
+ * 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);
+