beifg: Factorise code to count interference components.

[libfirm] / ir / be / belistsched.h

diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h
index be13a97..fd59bca 100644 (file)
--- a/ir/be/belistsched.h
+++ b/ir/be/belistsched.h
@@ -1,20 +1,6 @@
 /*
- * 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.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
@@ -22,7 +8,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
@@ -33,35 +18,6 @@
 #include "be.h"
 #include "be_types.h"
 #include "bearch.h"
-#include "beirg.h"
-
-/**
- * Checks, if a node is to appear in a schedule. Such nodes either
- * consume real data (mode datab) or produce such.
- * @param irn The node to check for.
- * @return 1, if the node consumes/produces data, false if not.
- */
-static inline bool to_appear_in_schedule(const ir_node *irn)
-{
-       switch(get_irn_opcode(irn)) {
-       case iro_Anchor:
-       case iro_Bad:
-       case iro_Block:
-       case iro_Confirm:
-       case iro_Dummy:
-       case iro_End:
-       case iro_NoMem:
-       case iro_Pin:
-       case iro_Proj:
-       case iro_Sync:
-       case iro_Unknown:
-               return false;
-       case iro_Phi:
-               return mode_is_data(get_irn_mode(irn));
-       default:
-               return ! (arch_irn_get_flags(irn) & arch_irn_flags_not_scheduled);
-       }
-}
 
 /**
  * A selector interface which is used by the list schedule framework.
@@ -74,9 +30,9 @@ typedef struct list_sched_selector_t {
         * Called before a graph is being scheduled.
         * May be NULL.
         *
-        * @param vtab     The selector vtab.
         * @param irg      The backend graph.
-        * @return         The environment pointer that is passed to all other functions in this struct.
+        * @return         The environment pointer that is passed to all other
+        *                 functions in this struct.
         */
        void *(*init_graph)(ir_graph *irg);
 
@@ -99,11 +55,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.