X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.h;h=387b6d730e5eb6484394de07af39d3f4cf6c761e;hb=7e4c680661ca3e15ae8d58fb50b4e8e9c10d5f4c;hp=6e518ce3d24cf96b8e0d0d0a8db0a1e264d3c7b1;hpb=c49f890e2075c541c38544d7b1f9c6cfc5be4fb4;p=libfirm diff --git a/ir/be/belistsched.h b/ir/be/belistsched.h index 6e518ce3d..387b6d730 100644 --- a/ir/be/belistsched.h +++ b/ir/be/belistsched.h @@ -1,43 +1,63 @@ -/** - * 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 - -#include "irgraph.h" -#include "irnode.h" - -#include "pset.h" -#include "pmap.h" -#include "list.h" +/** + * @file + * @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 -struct _arch_isa_t; +#include "firm_types.h" +#include "irnodeset.h" -typedef struct _list_sched_selector_t list_sched_selector_t; +#include "be.h" +#include "be_types.h" +#include "bearch.h" +#include "beirg.h" /** * A selector interface which is used by the list schedule framework. * You can implement your own list scheduler by implementing these * functions. */ -struct _list_sched_selector_t { +typedef struct list_sched_selector_t { /** * Called before a graph is being scheduled. - * @param isa The isa. - * @param irg The graph. - * @return The environment pointer that is passed to all other - * functions in this struct. + * May be NULL. + * + * @param irg 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 struct _arch_isa_t *isa, ir_graph *irg); + void *(*init_graph)(ir_graph *irg); /** * Called before scheduling starts on a block. - * @param graph_env The environment. - * @param block The block which is to be scheduled. + * May be NULL. + * + * @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); @@ -46,27 +66,38 @@ struct _list_sched_selector_t { * The selection function. * 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. + * MUST be implemented. * - * @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. * @return The chosen node. */ - ir_node *(*select)(void *block_env, pset *ready_set); + ir_node *(*select)(void *block_env, ir_nodeset_t *ready_set); /** - * This function descides, if a node should appear in a schedule. + * This function gets executed after a node finally has been made ready. + * May be NULL. + * + * @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. + * May be NULL. + * * @param block_env The block environment. - * @param irn The node. - * @return 1, if the node should be scheduled, 0 if not. + * @param irn The selected node. */ - int (*to_appear_in_schedule)(void *block_env, const ir_node *irn); + void (*node_selected)(void *block_env, ir_node *irn); /** * Called after a block has been scheduled. + * May be NULL. + * * @param env The environment. * @param block_env The per block environment as returned by init_block(). */ @@ -74,37 +105,21 @@ struct _list_sched_selector_t { /** * Called after a whole graph has been scheduled. + * May be NULL. + * * @param env The environment. */ void (*finish_graph)(void *env); - -}; - -/** - * A default implementation of to_appear_in_schedule, - * as required in list_sched_selector_t. - */ -extern be_default_to_appear_in_schedule(void *env, const ir_node *irn); - -/** - * A trivial selector, that just selects the first ready node. - */ -extern const list_sched_selector_t *trivial_selector; - -/** - * A selector that tries to minimize the register pressure. - * @note Not really operational yet. - */ -extern const list_sched_selector_t *reg_pressure_selector; +} list_sched_selector_t; /** * 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 isa The isa which implements the scheduler. - * @param irg The graph to schedule. + * + * @param irg The backend irg. */ -void list_sched(const struct _arch_isa_t *isa, ir_graph *irg); +void be_list_sched_graph(ir_graph *irg, const list_sched_selector_t *selector); #endif