X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.h;h=f3a971b6902ae59a8671ce80e0bd6347d46eb44f;hb=3f807bf48426a29da4129ff29c44a4b4690c45f6;hp=b39140163bee8b8bfc3873e584096d8063ef2464;hpb=e75b04273cb928f5a2dfd63326b147c7a26857da;p=libfirm diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h index b39140163..f3a971b69 100644 --- a/ir/be/belistsched.h +++ b/ir/be/belistsched.h @@ -1,17 +1,38 @@ -/** - * Primitive list scheduling. - * @date 20.10.2004 - * @author Sebastian Hack +/* + * 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. */ -#ifndef _FIRM_LIST_SCHED -#define _FIRM_LIST_SCHED +/** + * @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; @@ -24,16 +45,16 @@ 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. - * @param graph_env The environment. - * @param block The block which is to be scheduled. + * @param graph_env The environment. + * @param block The block which is to be scheduled. * @return A per-block pointer that is additionally passed to select. */ void *(*init_block)(void *graph_env, ir_node *block); @@ -43,15 +64,14 @@ struct _list_sched_selector_t { * It picks one node out of the ready list to be scheduled next. * The function does not have to delete the node from the ready set. * - * @return block_env Some private information as returned by init_block(). - * @param sched_head The schedule so far. - * @param curr_time The current time step which the picked node - * will be assigned to. - * @param ready_list A set containing all ready nodes. Pick one of these - * nodes. + * @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, nodeset *ready_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. @@ -61,6 +81,21 @@ struct _list_sched_selector_t { */ int (*to_appear_in_schedule)(void *block_env, const ir_node *irn); + /** + * This function gets executed after a node finally has been made ready. + * @param block_env The block environment. + * @param irn The node made ready. + * @param pred The previously scheduled node. + */ + void (*node_ready)(void *block_env, ir_node *irn, ir_node *pred); + + /** + * This function gets executed after a node finally has been selected. + * @param block_env The block environment. + * @param irn The selected node. + */ + void (*node_selected)(void *block_env, ir_node *irn); + /** * Returns the execution time of node irn. */ @@ -97,21 +132,47 @@ 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; /** * 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; + +/** + * 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; + +/** + * A selector based on the strong normal form theorem + */ +extern const list_sched_selector_t normal_selector; /** * List schedule a graph. * Each block in the graph gets a list head to its link field being the * head of the schedule. You can walk this list using the functions in * list.h. - * @param birg The backend irg. + * + * @param birg The backend irg. + * @param be_opts The backend options + */ +void list_sched(be_irg_t *birg, be_options_t *be_opts); + +/** + * List schedule a block. + * Same as list_sched but only for a certain block (needed for ILP fallback). */ -void list_sched(const be_irg_t *birg, int disable_mris); +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 */