X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.h;h=496ff77400047e7af6d6932c0db9722720ebf9d4;hb=dfc341ac6f54b4b0922d605e28333be76f487c68;hp=90633a762828dedb3fafebc01b61ef484d02e824;hpb=3fb0ea8b22c5cc0665f8a74e27857cd304fac912;p=libfirm diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h index 90633a762..496ff7740 100644 --- a/ir/be/belistsched.h +++ b/ir/be/belistsched.h @@ -1,18 +1,37 @@ -/** - * Primitive list scheduling. - * @date 20.10.2004 - * @author Sebastian Hack +/* + * 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. */ -#ifndef _FIRM_LIST_SCHED -#define _FIRM_LIST_SCHED -#include "firm_config.h" +/** + * @file + * @brief Primitive list scheduling with different node selectors. + * @author Sebastian Hack + * @date 20.10.2004 + * @version $Id$ + */ +#ifndef FIRM_BE_BELISTSCHED_H +#define FIRM_BE_BELISTSCHED_H #include "firm_types.h" +#include "irnodeset.h" -#include "benodesets.h" -#include "bearch_t.h" #include "be.h" +#include "bearch.h" #include "beirg.h" typedef struct _list_sched_selector_t list_sched_selector_t; @@ -51,7 +70,8 @@ struct _list_sched_selector_t { * @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. @@ -150,4 +170,4 @@ void list_sched(const be_irg_t *birg, be_options_t *be_opts); */ void list_sched_single_block(const be_irg_t *birg, ir_node *block, be_options_t *be_opts); -#endif /* _FIRM_LIST_SCHED */ +#endif /* FIRM_BE_BELISTSCHED_H */