/**
* Update the liveness information for a single node.
* It is irrelevant if there is liveness information present for the node.
- * The liveness information for the node is firstly deleted and then recompute.
- * So, if the node is fresh and never recorded inf the liveness information
- * before, it is more efficient to call be_liveness_introduce().
+ * The liveness information for the node is firstly deleted and then recomputed.
+ * If the node is fresh and never recorded inf the liveness information before,
+ * it is more efficient to call be_liveness_introduce().
*/
void be_liveness_update(be_lv_t *lv, ir_node *irn);
/**
* Check, if the SSA dominance property is fulfilled.
* @param irg The graph.
+ * @return 1 if dominance property is fulfilled, 0 otherwise
*/
-void be_check_dominance(ir_graph *irg);
+int be_check_dominance(ir_graph *irg);
/**
* The liveness transfer function.
/**
* Compute a set of nodes which are live at another node.
+ * BEWARE: This is the liveness immediately after the node,
+ * so the node itself is alive but it's operands maybe not.
* @param arch_env The architecture environment.
* @param cls The register class to consider.
* @param pos The node.
*/
pset *be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live);
+/**
+ * Compute a set of nodes which are live at another node.
+ * BEWARE: This is the liveness immediately before the node,
+ * so the node itself is not alive but it's operands are.
+ * @param arch_env The architecture environment.
+ * @param cls The register class to consider.
+ * @param pos The node.
+ * @param live The set to put them into.
+ * @return live.
+ */
+pset *be_liveness_nodes_live_at_input(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live);
+
/**
* FIXME: Need comment