X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeschedrand.c;h=3388907a3f7033ba24b7096c92f28697c5df4cd6;hb=0cc8bfc863da28d3799e9eca1d1765d564b6e573;hp=900689e0f18fe5fafc8f594c1f21e85e560634a7;hpb=311439dee8e33414f35d7b262c5c49c52f4108d6;p=libfirm

diff --git a/ir/be/beschedrand.c b/ir/be/beschedrand.c
index 900689e0f..3388907a3 100644
--- a/ir/be/beschedrand.c
+++ b/ir/be/beschedrand.c
@@ -1,8 +1,28 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
 /**
- * Trivial node selector.
- * @author Matthias Braun
- * @date   29.08.2006
- * @cvs-id $Id$
+ * @file
+ * @brief       Random node selector.
+ * @author      Matthias Braun
+ * @date        29.08.2006
+ * @version     $Id$
  */
 #ifdef HAVE_CONFIG_H
 #include "config.h"
@@ -24,6 +44,7 @@ static ir_node *random_select(void *block_env, ir_nodeset_t *ready_set,
 	const arch_env_t *arch_env = block_env;
 	ir_node          *irn      = NULL;
 	int only_branches_left = 1;
+	(void) live_set;
 
 	/* assure that branches and constants are executed last */
 	ir_nodeset_iterator_init(&iter, ready_set);
@@ -34,17 +55,17 @@ static ir_node *random_select(void *block_env, ir_nodeset_t *ready_set,
 		}
 	}
 
-	if(only_branches_left) {
+	if (only_branches_left) {
 		/* at last: schedule branches */
 		ir_nodeset_iterator_init(&iter, ready_set);
 		irn = ir_nodeset_iterator_next(&iter);
 	} else {
 		do {
-			// take 1 random node
+			/* take 1 random node */
 			int n = rand() % ir_nodeset_size(ready_set);
 			int i = 0;
 			ir_nodeset_iterator_init(&iter, ready_set);
-			while( (irn = ir_nodeset_iterator_next(&iter)) != NULL) {
+			while ((irn = ir_nodeset_iterator_next(&iter)) != NULL) {
 				if(i == n) {
 					break;
 				}
@@ -56,21 +77,23 @@ static ir_node *random_select(void *block_env, ir_nodeset_t *ready_set,
 	return irn;
 }
 
-static void *random_init_graph(const list_sched_selector_t *vtab, const arch_env_t *arch_env, ir_graph *irg)
+static void *random_init_graph(const list_sched_selector_t *vtab, const be_irg_t *birg)
 {
+	(void) vtab;
 	/* Using time(NULL) as a seed here gives really random results,
 	   but is NOT deterministic which makes debugging impossible.
 	   Moreover no-one want non-deterministic compilers ... */
 	srand(0x4711);
-	return (void *)arch_env;
+	return (void *) be_get_birg_arch_env(birg);
 }
 
-static void *random_init_block(void *graph_env, ir_node *bl)
+static void *random_init_block(void *graph_env, ir_node *block)
 {
+	(void) block;
 	return graph_env;
 }
 
-static const list_sched_selector_t random_selector_struct = {
+const list_sched_selector_t random_selector = {
 	random_init_graph,
 	random_init_block,
 	random_select,
@@ -82,5 +105,3 @@ static const list_sched_selector_t random_selector_struct = {
 	NULL,                /* finish_block */
 	NULL                 /* finish_graph */
 };
-
-const list_sched_selector_t *random_selector = &random_selector_struct;