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 typedef struct _sched_info_t {
22 struct list_head list; /**< The list head to list the nodes in a schedule. */
23 sched_timestep_t time_step; /**< If a is after b in a schedule, its time step is
26 int scheduled : 1; /**< 1, if the node is in the schedule of the block, 0 else. */
29 #define _sched_entry(list_head) (list_entry(list_head, sched_info_t, list))
31 #define get_irn_sched_info(irn) get_irn_data(irn, sched_info_t, sched_irn_data_offset)
32 #define get_sched_info_irn(sched_info) get_irn_data_base(sched_info, sched_irn_data_offset)
35 * Init the scheduling stuff.
36 * To be called from the central backend initialization routine.
38 void be_sched_init(void);
41 * Get the time step of an irn in a schedule.
42 * @param irn The node.
43 * @return The time step in the schedule.
45 static INLINE int _sched_get_time_step(const ir_node *irn)
47 return get_irn_sched_info(irn)->time_step;
51 * Checks, if a node is to appear in a schedule. Such nodes either
52 * consume real data (mode datab) or produce such.
53 * @param irn The node to check for.
54 * @return 1, if the node consumes/produces data, false if not.
56 static INLINE int to_appear_in_schedule(ir_node *irn)
58 if(get_irn_opcode(irn) == iro_Start)
61 return is_data_node(irn);
65 * Check, if an ir_node has a scheduling successor.
66 * @param irn The ir node.
67 * @return 1, if the node has a scheduling successor, 0 if not.
69 static INLINE int _sched_has_next(const ir_node *irn)
71 const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
72 const sched_info_t *info = get_irn_sched_info(irn);
73 const sched_info_t *block_info = get_irn_sched_info(block);
74 return info->list.next != &block_info->list;
78 * Check, if an ir_node has a scheduling predecessor.
79 * @param irn The ir node.
80 * @return 1, if the node has a scheduling predecessor, 0 if not.
82 static INLINE int _sched_has_prev(const ir_node *irn)
84 const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
85 const sched_info_t *info = get_irn_sched_info(irn);
86 const sched_info_t *block_info = get_irn_sched_info(block);
87 return info->list.prev != &block_info->list;
91 * Get the scheduling successor of a node.
92 * @param irn The node.
93 * @return The next ir node in the schedule or the block, if the node has no next node.
95 static INLINE ir_node *_sched_next(const ir_node *irn)
97 const sched_info_t *info = get_irn_sched_info(irn);
98 return get_sched_info_irn(_sched_entry(info->list.next));
102 * Get the scheduling predecessor of a node.
103 * @param irn The node.
104 * @return The next ir node in the schedule or the block, if the node has no predecessor.
107 static INLINE ir_node *_sched_prev(const ir_node *irn)
109 const sched_info_t *info = get_irn_sched_info(irn);
110 return get_sched_info_irn(_sched_entry(info->list.prev));
114 * Get the first node in a block schedule.
115 * @param block The block of which to get the schedule.
116 * @return The first node in the schedule or the block itself
117 * if there is no node in the schedule.
119 static INLINE ir_node *_sched_first(const ir_node *block)
121 assert(is_Block(block) && "Need a block here");
122 return _sched_next(block);
126 * Get the last node in a schedule.
127 * @param block The block to get the schedule for.
128 * @return The last ir node in a schedule, or the block itself
129 * if there is no node in the schedule.
131 static INLINE ir_node *_sched_last(const ir_node *block)
133 assert(is_Block(block) && "Need a block here");
134 return _sched_prev(block);
138 * Reassign the time steps in the schedule.
139 * @param block The schedule to update.
141 void sched_renumber(const ir_node *block);
143 static INLINE void _sched_set_time_stamp(ir_node *irn)
145 sched_info_t *inf = get_irn_sched_info(irn);
146 sched_timestep_t before_ts = _sched_entry(inf->list.prev)->time_step;
147 sched_timestep_t after_ts = _sched_entry(inf->list.next)->time_step;
150 * If we are the last, we can give us a big time step,
151 * else we have to compute our time step from our
154 if(before_ts >= after_ts)
155 inf->time_step = before_ts + SCHED_INITIAL_GRANULARITY;
157 sched_timestep_t ts = (before_ts + after_ts) / 2;
160 * If the resolution went out, we have to renumber
163 if(ts == before_ts || ts == after_ts)
164 sched_renumber(get_nodes_block(irn));
171 * Add a node to a block schedule.
172 * @param block The block to whose schedule the node shall be added to.
173 * @param irn The node to add.
174 * @return The given node.
176 static INLINE ir_node *_sched_add_before(ir_node *before, ir_node *irn)
178 sched_info_t *info = get_irn_sched_info(irn);
179 list_add_tail(&info->list, &get_irn_sched_info(before)->list);
180 _sched_set_time_stamp(irn);
186 * Add a node to a block schedule.
187 * @param block The block to whose schedule the node shall be added to.
188 * @param irn The node to add.
189 * @return The given node.
191 static INLINE ir_node *_sched_add_after(ir_node *after, ir_node *irn)
193 sched_info_t *info = get_irn_sched_info(irn);
194 list_add(&info->list, &get_irn_sched_info(after)->list);
195 _sched_set_time_stamp(irn);
201 * Remove a node from the scheduled.
202 * @param irn The node.
204 static INLINE void _sched_remove(ir_node *irn)
206 sched_info_t *info = get_irn_sched_info(irn);
207 list_del(&info->list);
212 * Check, if thenode is scheduled.
213 * @param irn The node.
214 * @return 1, if the node is scheduled, 0 if not.
216 static INLINE int _sched_is_scheduled(const ir_node *irn)
218 return get_irn_sched_info(irn)->scheduled;
222 * Compare two nodes according to their position in the schedule.
223 * @param a The first node.
224 * @param b The second node.
225 * @return A number smaller, equals to or larger than 0, if a is
226 * before, the same, or after b in the schedule.
228 static INLINE int _sched_cmp(const ir_node *a, const ir_node *b)
230 assert(_sched_is_scheduled(a) && _sched_is_scheduled(b));
231 assert(get_nodes_block(a) == get_nodes_block(b));
233 return get_irn_sched_info(a)->time_step - get_irn_sched_info(b)->time_step;
238 * @param block The block whose schedule to verify.
239 * @return 1, if the schedule is proper, 0 if not.
241 extern int sched_verify(const ir_node *block);
244 * Verify the schedules in all blocks of the irg.
245 * @param irg The program graph.
246 * @return 1, if all schedules were right, 0 if not.
248 extern int sched_verify_irg(ir_graph *irg);
251 * A predicate for a node.
252 * @param irn The node.
253 * @param data The custom data.
254 * @return 1 if irn should be skipped. Else 0.
256 typedef int (sched_predicator_t)(const ir_node *irn, void *data);
259 int sched_skip_cf_predicator(const ir_node *irn, void *data);
260 int sched_skip_phi_predicator(const ir_node *irn, void *data);
263 * Skip nodes in a schedule.
264 * @param from The node to start from.
265 * @param forward The direction (1 for forward, 0 for backward).
266 * @param predicator The one who decides what is skipped.
267 * @param data Food for the predicator.
268 * @return The first node rejected by the predicator or the block
269 * itself if none was rejected.
271 extern ir_node *sched_skip(ir_node *from, int forward,
272 sched_predicator_t *predicator, void *data);
274 #define sched_get_time_step(irn) _sched_get_time_step(irn)
275 #define sched_has_succ(irn) _sched_has_succ(irn)
276 #define sched_has_prev(irn) _sched_has_prev(irn)
277 #define sched_succ(irn) _sched_succ(irn)
278 #define sched_prev(irn) _sched_prev(irn)
279 #define sched_first(irn) _sched_first(irn)
280 #define sched_last(irn) _sched_last(irn)
281 #define sched_add_before(before, irn) _sched_add_before(before, irn)
282 #define sched_add_after(after, irn) _sched_add_after(after, irn)
283 #define sched_remove(irn) _sched_remove(irn)
284 #define sched_is_scheduled(irn) _sched_is_scheduled(irn)
285 #define sched_cmp(a, b) _sched_cmp(a, b)