X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.h;h=3af7e370f307a98569eced3a31c986d90fb0df87;hb=79268f7122ba8f5820658967157b3a9c78ea492a;hp=e7ff9d75be2bd57d43d731d98768f27abd79e2e6;hpb=52abe23f2fa0d4bd16ec0f2d707f99b201dc9fc2;p=libfirm

diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h
index e7ff9d75b..3af7e370f 100644
--- a/ir/be/belistsched.h
+++ b/ir/be/belistsched.h
@@ -22,7 +22,6 @@
  * @brief       Common functions for creating listscheduling algorithms
  * @author      Sebastian Hack
  * @date        20.10.2004
- * @version     $Id$
  */
 #ifndef FIRM_BE_BELISTSCHED_H
 #define FIRM_BE_BELISTSCHED_H
@@ -71,11 +70,9 @@ typedef struct list_sched_selector_t {
 	 * @param block_env   Some private information as returned by init_block().
 	 * @param sched_head  The schedule so far.
 	 * @param ready_set   A set containing all ready nodes. Pick one of these nodes.
-	 * @param live_set    A set containing all nodes currently alive.
 	 * @return The chosen node.
 	 */
-	ir_node *(*select)(void *block_env, ir_nodeset_t *ready_set,
-                       ir_nodeset_t *live_set);
+	ir_node *(*select)(void *block_env, ir_nodeset_t *ready_set);
 
 	/**
 	 * This function gets executed after a node finally has been made ready.