projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
cleanup beabi so it doesn't need its own obstack anymore
[libfirm]
/
ir
/
be
/
belistsched.h
diff --git
a/ir/be/belistsched.h
b/ir/be/belistsched.h
index
564251a
..
f171575
100644
(file)
--- a/
ir/be/belistsched.h
+++ b/
ir/be/belistsched.h
@@
-1,5
+1,5
@@
/*
/*
- * Copyright (C) 1995-200
7
University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-200
8
University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
*
* This file is part of libFirm.
*
@@
-27,16
+27,14
@@
#ifndef FIRM_BE_BELISTSCHED_H
#define FIRM_BE_BELISTSCHED_H
#ifndef FIRM_BE_BELISTSCHED_H
#define FIRM_BE_BELISTSCHED_H
-#include "irgraph.h"
-#include "irnode.h"
+#include "firm_types.h"
#include "irnodeset.h"
#include "be.h"
#include "irnodeset.h"
#include "be.h"
+#include "be_types.h"
#include "bearch.h"
#include "beirg.h"
#include "bearch.h"
#include "beirg.h"
-typedef struct _list_sched_selector_t list_sched_selector_t;
-
/**
* A selector interface which is used by the list schedule framework.
* You can implement your own list scheduler by implementing these
/**
* A selector interface which is used by the list schedule framework.
* You can implement your own list scheduler by implementing these
@@
-46,14
+44,18
@@
struct _list_sched_selector_t {
/**
* Called before a graph is being scheduled.
/**
* Called before a graph is being scheduled.
- * @param arch_env The architecture environment.
- * @param irg The graph.
+ * May be NULL.
+ *
+ * @param vtab The selector vtab.
+ * @param birg The backend graph.
* @return The environment pointer that is passed to all other functions in this struct.
*/
* @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 *b
irg);
/**
* Called before scheduling starts on a block.
/**
* Called before scheduling starts on a block.
+ * 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.
* @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.
@@
-64,6
+66,7
@@
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.
* 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.
*
* @param block_env Some private information as returned by init_block().
* @param sched_head The schedule so far.
*
* @param block_env Some private information as returned by init_block().
* @param sched_head The schedule so far.
@@
-76,6
+79,8
@@
struct _list_sched_selector_t {
/**
* This function decides, if a node should appear in a schedule.
/**
* This function decides, if a node should appear in a schedule.
+ * 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 block_env The block environment.
* @param irn The node.
* @return 1, if the node should be scheduled, 0 if not.
@@
-84,6
+89,8
@@
struct _list_sched_selector_t {
/**
* This function gets executed after a node finally has been made ready.
/**
* 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.
* @param block_env The block environment.
* @param irn The node made ready.
* @param pred The previously scheduled node.
@@
-92,6
+99,8
@@
struct _list_sched_selector_t {
/**
* This function gets executed after a node finally has been selected.
/**
* This function gets executed after a node finally has been selected.
+ * May be NULL.
+ *
* @param block_env The block environment.
* @param irn The selected node.
*/
* @param block_env The block environment.
* @param irn The selected node.
*/
@@
-99,12
+108,17
@@
struct _list_sched_selector_t {
/**
* Returns the execution time of node irn.
/**
* Returns the execution time of node irn.
+ * May be NULL.
+ *
+ * @param block_env The block environment.
+ * @param irn The selected node.
*/
unsigned (*exectime)(void *block_env, const ir_node *irn);
/**
* Calculates the latency of executing cycle curr_cycle of node curr in cycle pred_cycle
* of node pred.
*/
unsigned (*exectime)(void *block_env, const ir_node *irn);
/**
* Calculates the latency of executing cycle curr_cycle of node curr in cycle pred_cycle
* of node pred.
+ * May be NULL.
*
* @param block_env The block environment.
* @param pred The previous node.
*
* @param block_env The block environment.
* @param pred The previous node.
@@
-116,6
+130,8
@@
struct _list_sched_selector_t {
/**
* Called after a block has been scheduled.
/**
* 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().
*/
* @param env The environment.
* @param block_env The per block environment as returned by init_block().
*/
@@
-123,36
+139,46
@@
struct _list_sched_selector_t {
/**
* Called after a whole graph has been scheduled.
/**
* Called after a whole graph has been scheduled.
+ * May be NULL.
+ *
* @param env The environment.
*/
void (*finish_graph)(void *env);
* @param env The environment.
*/
void (*finish_graph)(void *env);
-
};
/**
* A trivial selector, that just selects the first ready node.
*/
};
/**
* 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 trivial selector that selects a pseudo-random-node (deterministic).
+ */
+extern const list_sched_selector_t random_selector;
/**
* A selector that tries to minimize the register pressure.
* @note Not really operational yet.
*/
/**
* 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]
*/
/**
* 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]
/**
* A selector based on trace scheduling as introduced by Muchnik[TM]
- * but using the mueller heuristic selector.
+ * but using the Mueller heuristic selector.
+ */
+extern const list_sched_selector_t heuristic_selector;
+
+/**
+ * A selector based on the strong normal form theorem (ie minimizing
+ * the register pressure).
*/
*/
-extern const list_sched_selector_t
*heuristic
_selector;
+extern const list_sched_selector_t
normal
_selector;
/**
* List schedule a graph.
/**
* List schedule a graph.
@@
-163,7
+189,7
@@
extern const list_sched_selector_t *heuristic_selector;
* @param birg The backend irg.
* @param be_opts The backend options
*/
* @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.
/**
* List schedule a block.