X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeschedtrivial.c;h=6f6b596280ff5c7bf08d389ca484c1fdb867a06c;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=6d272ccbe77ea267945c9f1d9716e8a52e378f04;hpb=a09efb2ccc91c6d720aa6aa8c5f7e3c562528b2a;p=libfirm

diff --git a/ir/be/beschedtrivial.c b/ir/be/beschedtrivial.c
index 6d272ccbe..6f6b59628 100644
--- a/ir/be/beschedtrivial.c
+++ b/ir/be/beschedtrivial.c
@@ -22,7 +22,6 @@
  * @brief       Trivial node selector.
  * @author      Sebastian Hack
  * @date        29.08.2006
- * @version     $Id$
  */
 #include "config.h"
 
@@ -42,13 +41,11 @@
  * Just assure that branches are executed last, otherwise select
  * the first node ready.
  */
-static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set,
-                               ir_nodeset_t *live_set)
+static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set)
 {
 	ir_node               *irn;
 	ir_nodeset_iterator_t  iter;
 	(void)block_env;
-	(void)live_set;
 
 	/* assure that branches and constants are executed last */
 	foreach_ir_nodeset(ready_set, irn, iter) {
@@ -91,7 +88,7 @@ static void sched_trivial(ir_graph *irg)
 	be_list_sched_graph(irg, &trivial_selector);
 }
 
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_trivial);
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_trivial)
 void be_init_sched_trivial(void)
 {
 	be_register_scheduler("trivial", sched_trivial);