5 #define SCHED_INITIAL_GRANULARITY (1 << 14)
14 typedef unsigned int sched_timestep_t;
16 extern size_t sched_irn_data_offset;
19 * The schedule structure which is present at each ir node.
21 * Currently, only basic blocks are scheduled. The list head of
22 * every block schedule list is the Block list.
24 typedef struct _sched_info_t {
25 struct list_head list; /**< The list head to list the nodes in a schedule. */
26 sched_timestep_t time_step; /**< If a is after b in a schedule, its time step is
29 int scheduled : 1; /**< 1, if the node is in the schedule of the block, 0 else. */
32 #define _sched_entry(list_head) (list_entry(list_head, sched_info_t, list))
34 #define get_irn_sched_info(irn) get_irn_data(irn, sched_info_t, sched_irn_data_offset)
35 #define get_sched_info_irn(sched_info) get_irn_data_base(sched_info, sched_irn_data_offset)
38 * Init the scheduling stuff.
39 * To be called from the central backend initialization routine.
41 void be_sched_init(void);
44 * Check, if the node is scheduled.
45 * @param irn The node.
46 * @return 1, if the node is scheduled, 0 if not.
48 static INLINE int _sched_is_scheduled(const ir_node *irn)
50 return get_irn_sched_info(irn)->scheduled;
54 * Get the time step of an irn in a schedule.
55 * @param irn The node.
56 * @return The time step in the schedule.
58 static INLINE int _sched_get_time_step(const ir_node *irn)
60 assert(_sched_is_scheduled(irn));
61 return get_irn_sched_info(irn)->time_step;
65 * Checks, if a node is to appear in a schedule. Such nodes either
66 * consume real data (mode datab) or produce such.
67 * @param irn The node to check for.
68 * @return 1, if the node consumes/produces data, false if not.
70 static INLINE int to_appear_in_schedule(const ir_node *irn)
72 switch(get_irn_opcode(irn)) {
78 return is_data_node(irn);
83 * Check, if an ir_node has a scheduling successor.
84 * @param irn The ir node.
85 * @return 1, if the node has a scheduling successor, 0 if not.
87 static INLINE int _sched_has_next(const ir_node *irn)
89 const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
90 const sched_info_t *info = get_irn_sched_info(irn);
91 const sched_info_t *block_info = get_irn_sched_info(block);
92 return info->list.next != &block_info->list;
96 * Check, if an ir_node has a scheduling predecessor.
97 * @param irn The ir node.
98 * @return 1, if the node has a scheduling predecessor, 0 if not.
100 static INLINE int _sched_has_prev(const ir_node *irn)
102 const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
103 const sched_info_t *info = get_irn_sched_info(irn);
104 const sched_info_t *block_info = get_irn_sched_info(block);
105 return info->list.prev != &block_info->list;
109 * Get the scheduling successor 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 next node.
113 static INLINE ir_node *_sched_next(const ir_node *irn)
115 const sched_info_t *info = get_irn_sched_info(irn);
116 return get_sched_info_irn(_sched_entry(info->list.next));
120 * Get the scheduling predecessor of a node.
121 * @param irn The node.
122 * @return The next ir node in the schedule or the block, if the node has no predecessor.
125 static INLINE ir_node *_sched_prev(const ir_node *irn)
127 const sched_info_t *info = get_irn_sched_info(irn);
128 return get_sched_info_irn(_sched_entry(info->list.prev));
132 * Get the first node in a block schedule.
133 * @param block The block of which to get the schedule.
134 * @return The first node in the schedule or the block itself
135 * if there is no node in the schedule.
137 static INLINE ir_node *_sched_first(const ir_node *block)
139 assert(is_Block(block) && "Need a block here");
140 return _sched_next(block);
144 * Get the last node in a schedule.
145 * @param block The block to get the schedule for.
146 * @return The last ir node in a schedule, or the block itself
147 * if there is no node in the schedule.
149 static INLINE ir_node *_sched_last(const ir_node *block)
151 assert(is_Block(block) && "Need a block here");
152 return _sched_prev(block);
156 * Reassign the time steps in the schedule.
157 * @param block The schedule to update.
159 void sched_renumber(const ir_node *block);
161 static INLINE void _sched_set_time_stamp(ir_node *irn)
163 sched_info_t *inf = get_irn_sched_info(irn);
164 sched_timestep_t before_ts = _sched_entry(inf->list.prev)->time_step;
165 sched_timestep_t after_ts = _sched_entry(inf->list.next)->time_step;
168 * If we are the last, we can give us a big time step,
169 * else we have to compute our time step from our
172 if(before_ts >= after_ts)
173 inf->time_step = before_ts + SCHED_INITIAL_GRANULARITY;
175 sched_timestep_t ts = (before_ts + after_ts) / 2;
178 * If the resolution went out, we have to renumber
181 if(ts == before_ts || ts == after_ts)
182 sched_renumber(get_nodes_block(irn));
189 * Add a node to a block schedule.
190 * @param block The block to whose schedule the node shall be added to.
191 * @param irn The node to add.
192 * @return The given node.
194 static INLINE ir_node *_sched_add_before(ir_node *before, ir_node *irn)
196 sched_info_t *info = get_irn_sched_info(irn);
197 list_add_tail(&info->list, &get_irn_sched_info(before)->list);
198 _sched_set_time_stamp(irn);
204 * Add a node to a block schedule.
205 * @param block The block to whose schedule the node shall be added to.
206 * @param irn The node to add.
207 * @return The given node.
209 static INLINE ir_node *_sched_add_after(ir_node *after, ir_node *irn)
211 sched_info_t *info = get_irn_sched_info(irn);
212 list_add(&info->list, &get_irn_sched_info(after)->list);
213 _sched_set_time_stamp(irn);
219 * Remove a node from the scheduled.
220 * @param irn The node.
222 static INLINE void _sched_remove(ir_node *irn)
224 sched_info_t *info = get_irn_sched_info(irn);
225 list_del(&info->list);
226 INIT_LIST_HEAD(&info->list);
231 * Compare two nodes according to their position in the schedule.
232 * @param a The first node.
233 * @param b The second node.
234 * @return A number smaller, equals to or larger than 0, if a is
235 * before, the same, or after b in the schedule.
237 static INLINE int _sched_cmp(const ir_node *a, const ir_node *b)
239 assert(_sched_is_scheduled(a) && _sched_is_scheduled(b));
240 assert(get_nodes_block(a) == get_nodes_block(b));
242 return get_irn_sched_info(a)->time_step - get_irn_sched_info(b)->time_step;
247 * @param block The block whose schedule to verify.
248 * @return 1, if the schedule is proper, 0 if not.
250 extern int sched_verify(const ir_node *block);
253 * Verify the schedules in all blocks of the irg.
254 * @param irg The program graph.
255 * @return 1, if all schedules were right, 0 if not.
257 extern int sched_verify_irg(ir_graph *irg);
260 * Checks, if one node is scheduled before another.
262 * @param n2 Another node.
263 * @return 1, if n1 is in front of n2 in the schedule, 0 else.
264 * @note Both nodes must be in the same block.
266 static INLINE int _sched_comes_after(const ir_node *n1, const ir_node *n2)
268 assert(_sched_is_scheduled(n1));
269 assert(_sched_is_scheduled(n2));
270 assert(get_nodes_block(n1) == get_nodes_block(n2));
271 return _sched_get_time_step(n1) < _sched_get_time_step(n2);
275 * A predicate for a node.
276 * @param irn The node.
277 * @param data The custom data.
278 * @return 1 if irn should be skipped. Else 0.
280 typedef int (sched_predicator_t)(const ir_node *irn, void *data);
283 int sched_skip_cf_predicator(const ir_node *irn, void *data);
284 int sched_skip_phi_predicator(const ir_node *irn, void *data);
287 * Skip nodes in a schedule.
288 * @param from The node to start from.
289 * @param forward The direction (1 for forward, 0 for backward).
290 * @param predicator The one who decides what is skipped.
291 * @param data Food for the predicator.
292 * @return The first node rejected by the predicator or the block
293 * itself if none was rejected.
295 extern ir_node *sched_skip(ir_node *from, int forward,
296 sched_predicator_t *predicator, void *data);
298 #define sched_get_time_step(irn) _sched_get_time_step(irn)
299 #define sched_has_next(irn) _sched_has_next(irn)
300 #define sched_has_prev(irn) _sched_has_prev(irn)
301 #define sched_next(irn) _sched_next(irn)
302 #define sched_prev(irn) _sched_prev(irn)
303 #define sched_first(irn) _sched_first(irn)
304 #define sched_last(irn) _sched_last(irn)
305 #define sched_add_before(before, irn) _sched_add_before(before, irn)
306 #define sched_add_after(after, irn) _sched_add_after(after, irn)
307 #define sched_remove(irn) _sched_remove(irn)
308 #define sched_is_scheduled(irn) _sched_is_scheduled(irn)
309 #define sched_comes_after(n1, n2) _sched_comes_after(n1, n2)
310 #define sched_cmp(a, b) _sched_cmp(a, b)