+/*
+ * Copyright (C) 1995-2007 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.
+ */
+
/**
* Primitive list scheduling.
* @date 20.10.2004
#include "firm_types.h"
-#include "benodesets.h"
+#include "irnodeset.h"
#include "bearch_t.h"
#include "be.h"
#include "beirg.h"
* @param live_set A set containing all nodes currently alive.
* @return The chosen node.
*/
- ir_node *(*select)(void *block_env, nodeset *ready_set, nodeset *live_set);
+ ir_node *(*select)(void *block_env, ir_nodeset_t *ready_set,
+ ir_nodeset_t *live_set);
/**
* This function decides, if a node should appear in a schedule.