besched.c 3.96 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
2
/* $Id$ */

Michael Beck's avatar
Michael Beck committed
3
#ifdef HAVE_CONFIG_H
Michael Beck's avatar
Michael Beck committed
4
# include "config.h"
Michael Beck's avatar
Michael Beck committed
5
#endif
6

Michael Beck's avatar
Michael Beck committed
7
8
9
#ifdef HAVE_STDLIB_H
# include <stdlib.h>
#endif
Sebastian Hack's avatar
Sebastian Hack committed
10

Sebastian Hack's avatar
Sebastian Hack committed
11
#include "impl.h"
12
13
#include "irprintf.h"
#include "irgwalk.h"
14
#include "firm_types.h"
Michael Beck's avatar
Michael Beck committed
15
#include "irgraph_t.h"
16
#include "iredges_t.h"
17
#include "ircons.h"
Christian Würdig's avatar
Christian Würdig committed
18
#include "irextbb.h"
Sebastian Hack's avatar
Sebastian Hack committed
19
#include "debug.h"
20

21
#include "bemodule.h"
Daniel Grund's avatar
Daniel Grund committed
22
#include "bearch.h"
Sebastian Hack's avatar
Sebastian Hack committed
23
#include "besched_t.h"
Sebastian Hack's avatar
Sebastian Hack committed
24
#include "beutil.h"
25
26
#include "belistsched.h"

Sebastian Hack's avatar
Sebastian Hack committed
27
FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
28
FIRM_IMPL1(sched_has_next, int, const ir_node *)
Sebastian Hack's avatar
Sebastian Hack committed
29
FIRM_IMPL1(sched_has_prev, int, const ir_node *)
30
FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
Sebastian Hack's avatar
Sebastian Hack committed
31
32
33
FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
Sebastian Hack's avatar
Sebastian Hack committed
34
35
FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
Michael Beck's avatar
Michael Beck committed
36
37
FIRM_IMPL1_VOID(sched_init_block, ir_node *)
FIRM_IMPL1_VOID(sched_reset, ir_node *)
Michael Beck's avatar
Michael Beck committed
38
FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
39
FIRM_IMPL1_VOID(sched_remove, ir_node *)
Sebastian Hack's avatar
Sebastian Hack committed
40

41
42
43
44
size_t sched_irn_data_offset = 0;

static void block_sched_dumper(ir_node *block, void *env)
{
45
	FILE  *f = env;
46
47
	const ir_node *curr;

48
	ir_fprintf(f, "%+F:\n", block);
49

50
	sched_foreach(block, curr) {
51
		sched_info_t *info = get_irn_sched_info(curr);
52
		ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
53
54
55
	}
}

Michael Beck's avatar
Michael Beck committed
56
void be_sched_dump(FILE *f, ir_graph *irg)
57
{
Michael Beck's avatar
Michael Beck committed
58
	irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
59
60
}

Michael Beck's avatar
Michael Beck committed
61
/* Init the scheduling stuff. */
62
void be_init_sched(void)
63
64
65
66
{
	sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
}

67
68
BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched);

Sebastian Hack's avatar
Sebastian Hack committed
69
70
void sched_renumber(const ir_node *block)
{
Michael Beck's avatar
BugFix:    
Michael Beck committed
71
72
	ir_node *irn;
	sched_info_t *inf;
73
	sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
Michael Beck's avatar
BugFix:    
Michael Beck committed
74
75
76
77
78
79

	sched_foreach(block, irn) {
		inf = get_irn_sched_info(irn);
		inf->time_step = step;
		step += SCHED_INITIAL_GRANULARITY;
	}
Sebastian Hack's avatar
Sebastian Hack committed
80
81
}

Daniel Grund's avatar
Daniel Grund committed
82
int sched_skip_cf_predicator(const ir_node *irn, void *data) {
Michael Beck's avatar
BugFix:    
Michael Beck committed
83
	arch_env_t *ae = data;
Christian Würdig's avatar
Christian Würdig committed
84
	return arch_irn_class_is(ae, irn, branch);
Daniel Grund's avatar
Daniel Grund committed
85
86
87
88
89
90
}

int sched_skip_phi_predicator(const ir_node *irn, void *data) {
	return is_Phi(irn);
}

91
/* Skip nodes in a schedule. */
Michael Beck's avatar
Michael Beck committed
92
ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
Sebastian Hack's avatar
Sebastian Hack committed
93
{
Daniel Grund's avatar
Daniel Grund committed
94
95
	const ir_node *bl = get_block(from);
	ir_node *curr;
Sebastian Hack's avatar
Sebastian Hack committed
96

97
98
99
100
101
102
103
104
105
106
107
	if (forward) {
		if (is_Block(from))
			from = sched_next(from);
		for (curr = from; curr != bl && predicator(curr, data); curr = sched_next(curr)) {
		}
	} else {
		if (is_Block(from))
			from = sched_prev(from);
		for (curr = from; curr != bl && predicator(curr, data); curr = sched_prev(curr)) {
		}
	}
Daniel Grund's avatar
Daniel Grund committed
108
109

	return curr;
Sebastian Hack's avatar
Sebastian Hack committed
110
}
111

112
//---------------------------------------------------------------------------
113
114
115
116
117
118

typedef struct remove_dead_nodes_env_t_ {
	ir_graph *irg;
	bitset_t *reachable;
} remove_dead_nodes_env_t;

119
120
121
/**
 * Post-walker: remember all visited nodes in a bitset.
 */
122
123
124
125
126
127
static void mark_dead_nodes_walker(ir_node *node, void *data)
{
	remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
	bitset_set(env->reachable, get_irn_idx(node));
}

128
129
130
131
/**
 * Post-block-walker:
 * Walk through the schedule of every block and remove all dead nodes from it.
 */
132
133
134
static void remove_dead_nodes_walker(ir_node *block, void *data)
{
	remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
135
	ir_node                 *node, *next;
136

137
138
	for (node = sched_first(block); ! sched_is_end(node); node = next) {
		/* get next node now, as after calling sched_remove it will be invalid */
Matthias Braun's avatar
Matthias Braun committed
139
140
		next = sched_next(node);

141
		if (bitset_is_set(env->reachable, get_irn_idx(node)))
142
143
			continue;

Matthias Braun's avatar
Matthias Braun committed
144
		sched_remove(node);
145
		be_kill_node(node);
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
	}
}

void be_remove_dead_nodes_from_schedule(ir_graph *irg)
{
	remove_dead_nodes_env_t env;
	env.irg = irg;
	env.reachable = bitset_alloca(get_irg_last_idx(irg));

	// mark all reachable nodes
	irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);

	// walk schedule and remove non-marked nodes
	irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);
}