X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fbe%2Fbelistsched.h;h=5eea82e8e7ee405c4234d53440ef28fbfe0125d2;hb=2176caea24ef5a9786dc4ada2bd2eaf74ad88b4d;hp=010863b8227fba3adb7b59c0bcec3f7a61fc527e;hpb=87965f5c94d561cb15233b80711123f6edc80b30;p=libfirm diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h index 010863b82..5eea82e8e 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 "bearch_t.h" + #include "be.h" +#include "bearch.h" #include "beirg.h" typedef struct _list_sched_selector_t list_sched_selector_t; @@ -26,11 +45,11 @@ struct _list_sched_selector_t { /** * Called before a graph is being scheduled. - * @param arch_env The architecture environment. - * @param irg The graph. + * @param vtab The selector vtab. + * @param birg The backend graph. * @return The environment pointer that is passed to all other functions in this struct. */ - void *(*init_graph)(const list_sched_selector_t *vtab, const arch_env_t *arch_env, ir_graph *irg); + void *(*init_graph)(const list_sched_selector_t *vtab, const be_irg_t *birg); /** * Called before scheduling starts on a block. @@ -113,26 +132,31 @@ struct _list_sched_selector_t { /** * A trivial selector, that just selects the first ready node. */ -extern const list_sched_selector_t *trivial_selector; +extern const list_sched_selector_t trivial_selector; -extern const list_sched_selector_t *random_selector; +extern const list_sched_selector_t random_selector; /** * A selector that tries to minimize the register pressure. * @note Not really operational yet. */ -extern const list_sched_selector_t *reg_pressure_selector; +extern const list_sched_selector_t reg_pressure_selector; /** * A selector based on trace scheduling as introduced by Muchnik[TM] */ -extern const list_sched_selector_t *muchnik_selector; +extern const list_sched_selector_t muchnik_selector; /** * A selector based on trace scheduling as introduced by Muchnik[TM] * but using the mueller heuristic selector. */ -extern const list_sched_selector_t *heuristic_selector; +extern const list_sched_selector_t heuristic_selector; + +/** + * A selector based on the strong normal form theorem + */ +extern const list_sched_selector_t normal_selector; /** * List schedule a graph. @@ -143,7 +167,7 @@ extern const list_sched_selector_t *heuristic_selector; * @param birg The backend irg. * @param be_opts The backend options */ -void list_sched(const be_irg_t *birg, be_options_t *be_opts); +void list_sched(be_irg_t *birg, be_options_t *be_opts); /** * List schedule a block. @@ -151,4 +175,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 */