5 #define SCHED_INITIAL_GRANULARITY (1 << 14)
13 typedef unsigned int sched_timestep_t;
15 extern size_t sched_irn_data_offset;
18 * The schedule structure which is present at each ir node.
20 typedef struct _sched_info_t {
21 struct list_head list; /**< The list head to list the nodes in a schedule. */
22 sched_timestep_t time_step; /**< If a is after b in a schedule, its time step is
25 int scheduled : 1; /**< 1, if the node is in the schedule of the block, 0 else. */
28 #define _sched_entry(list_head) (list_entry(list_head, sched_info_t, list))
30 #define get_irn_sched_info(irn) get_irn_data(irn, sched_info_t, sched_irn_data_offset)
31 #define get_sched_info_irn(sched_info) get_irn_data_base(sched_info, sched_irn_data_offset)
34 * Init the scheduling stuff.
35 * To be called from the central backend initialization routine.
37 void be_sched_init(void);
40 * Get the time step of an irn in a schedule.
41 * @param irn The node.
42 * @return The time step in the schedule.
44 static INLINE int _sched_get_time_step(const ir_node *irn)
46 return get_irn_sched_info(irn)->time_step;
50 * Checks, if a node is to appear in a schedule. Such nodes either
51 * consume real data (mode datab) or produce such.
52 * @param irn The node to check for.
53 * @return 1, if the node consumes/produces data, false if not.
55 static INLINE int to_appear_in_schedule(ir_node *irn)
59 if(get_irn_opcode(irn) == iro_Start)
62 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
63 ir_node *op = get_irn_n(irn, i);
64 if(mode_is_datab(get_irn_mode(op)))
68 return mode_is_datab(get_irn_mode(irn));
72 * Check, if an ir_node has a scheduling successor.
73 * @param irn The ir node.
74 * @return 1, if the node has a scheduling successor, 0 if not.
76 static INLINE int _sched_has_next(const ir_node *irn)
78 const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
79 const sched_info_t *info = get_irn_sched_info(irn);
80 const sched_info_t *block_info = get_irn_sched_info(block);
81 return info->list.next != &block_info->list;
85 * Check, if an ir_node has a scheduling predecessor.
86 * @param irn The ir node.
87 * @return 1, if the node has a scheduling predecessor, 0 if not.
89 static INLINE int _sched_has_prev(const ir_node *irn)
91 const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
92 const sched_info_t *info = get_irn_sched_info(irn);
93 const sched_info_t *block_info = get_irn_sched_info(block);
94 return info->list.prev != &block_info->list;
98 * Get the scheduling successor of a node.
99 * @param irn The node.
100 * @return The next ir node in the schedule or the block, if the node has no next node.
102 static INLINE ir_node *_sched_next(const ir_node *irn)
104 const sched_info_t *info = get_irn_sched_info(irn);
105 return get_sched_info_irn(_sched_entry(info->list.next));
109 * Get the scheduling predecessor of a node.
110 * @param irn The node.
111 * @return The next ir node in the schedule or the block, if the node has no predecessor.
114 static INLINE ir_node *_sched_prev(const ir_node *irn)
116 const sched_info_t *info = get_irn_sched_info(irn);
117 return get_sched_info_irn(_sched_entry(info->list.prev));
121 * Get the first node in a block schedule.
122 * @param block The block of which to get the schedule.
123 * @return The first node in the schedule or the block itself
124 * if there is no node in the schedule.
126 static INLINE ir_node *_sched_first(const ir_node *block)
128 assert(is_Block(block) && "Need a block here");
129 return _sched_next(block);
133 * Get the last node in a schedule.
134 * @param block The block to get the schedule for.
135 * @return The last ir node in a schedule, or the block itself
136 * if there is no node in the schedule.
138 static INLINE ir_node *_sched_last(const ir_node *block)
140 assert(is_Block(block) && "Need a block here");
141 return _sched_prev(block);
145 * Reassign the time steps in the schedule.
146 * @param block The schedule to update.
148 void sched_renumber(const ir_node *block);
150 static INLINE void _sched_set_time_stamp(ir_node *irn)
152 sched_info_t *inf = get_irn_sched_info(irn);
153 sched_timestep_t before_ts = _sched_entry(inf->list.prev)->time_step;
154 sched_timestep_t after_ts = _sched_entry(inf->list.next)->time_step;
157 * If we are the last, we can give us a big time step,
158 * else we have to compute our time step from our
161 if(before_ts >= after_ts)
162 inf->time_step = before_ts + SCHED_INITIAL_GRANULARITY;
164 sched_timestep_t ts = (before_ts + after_ts) / 2;
167 * If the resolution went out, we have to renumber
170 if(ts == before_ts || ts == after_ts)
171 sched_renumber(get_nodes_block(irn));
178 * Add a node to a block schedule.
179 * @param block The block to whose schedule the node shall be added to.
180 * @param irn The node to add.
181 * @return The given node.
183 static INLINE ir_node *_sched_add_before(ir_node *before, ir_node *irn)
185 sched_info_t *info = get_irn_sched_info(irn);
186 list_add_tail(&info->list, &get_irn_sched_info(before)->list);
187 _sched_set_time_stamp(irn);
193 * Add a node to a block schedule.
194 * @param block The block to whose schedule the node shall be added to.
195 * @param irn The node to add.
196 * @return The given node.
198 static INLINE ir_node *_sched_add_after(ir_node *after, ir_node *irn)
200 sched_info_t *info = get_irn_sched_info(irn);
201 list_add(&info->list, &get_irn_sched_info(after)->list);
202 _sched_set_time_stamp(irn);
208 * Remove a node from the scheduled.
209 * @param irn The node.
211 static INLINE void _sched_remove(ir_node *irn)
213 sched_info_t *info = get_irn_sched_info(irn);
214 list_del(&info->list);
219 * Check, if thenode is scheduled.
220 * @param irn The node.
221 * @return 1, if the node is scheduled, 0 if not.
223 static INLINE int _sched_is_scheduled(const ir_node *irn)
225 return get_irn_sched_info(irn)->scheduled;
229 * Compare two nodes according to their position in the schedule.
230 * @param a The first node.
231 * @param b The second node.
232 * @return A number smaller, equals to or larger than 0, if a is
233 * before, the same, or after b in the schedule.
235 static INLINE int _sched_cmp(const ir_node *a, const ir_node *b)
237 assert(_sched_is_scheduled(a) && _sched_is_scheduled(b));
238 assert(get_nodes_block(a) == get_nodes_block(b));
240 return get_irn_sched_info(a)->time_step - get_irn_sched_info(b)->time_step;
245 * @param block The block whose schedule to verify.
246 * @return 1, if the schedule is proper, 0 if not.
248 extern int sched_verify(const ir_node *block);
251 * Verify the schedules in all blocks of the irg.
252 * @param irg The program graph.
253 * @return 1, if all schedules were right, 0 if not.
255 extern int sched_verify_irg(ir_graph *irg);
258 * A predicate for a node.
259 * @param irn The node.
260 * @param data The custom data.
261 * @return 1 if irn should be skipped. Else 0.
263 typedef int (sched_predicator_t)(const ir_node *irn, void *data);
266 int sched_skip_cf_predicator(const ir_node *irn, void *data);
267 int sched_skip_phi_predicator(const ir_node *irn, void *data);
270 * Skip nodes in a schedule.
271 * @param from The node to start from.
272 * @param forward The direction (1 for forward, 0 for backward).
273 * @param predicator The one who decides what is skipped.
274 * @param data Food for the predicator.
275 * @return The first node rejected by the predicator or the block
276 * itself if none was rejected.
278 extern ir_node *sched_skip(ir_node *from, int forward,
279 sched_predicator_t *predicator, void *data);
281 #define sched_get_time_step(irn) _sched_get_time_step(irn)
282 #define sched_has_succ(irn) _sched_has_succ(irn)
283 #define sched_has_prev(irn) _sched_has_prev(irn)
284 #define sched_succ(irn) _sched_succ(irn)
285 #define sched_prev(irn) _sched_prev(irn)
286 #define sched_first(irn) _sched_first(irn)
287 #define sched_last(irn) _sched_last(irn)
288 #define sched_add_before(before, irn) _sched_add_before(before, irn)
289 #define sched_add_after(after, irn) _sched_add_after(after, irn)
290 #define sched_remove(irn) _sched_remove(irn)
291 #define sched_is_scheduled(irn) _sched_is_scheduled(irn)
292 #define sched_cmp(a, b) _sched_cmp(a, b)