* @param b The second node.
* @return 1 if a comes before b in the same block or if a == b, 0 else.
*/
* @param b The second node.
* @return 1 if a comes before b in the same block or if a == b, 0 else.
*/
{
/* TODO: ? : can be removed?! */
sched_timestep_t as = sched_is_scheduled(a) ? sched_get_time_step(a) : 0;
{
/* TODO: ? : can be removed?! */
sched_timestep_t as = sched_is_scheduled(a) ? sched_get_time_step(a) : 0;
* @param b The second node.
* @return 1 if a comes before b in the same block, 0 else.
*/
* @param b The second node.
* @return 1 if a comes before b in the same block, 0 else.
*/
{
/* TODO: ? : can be removed?! */
sched_timestep_t as = sched_is_scheduled(a) ? sched_get_time_step(a) : 0;
{
/* TODO: ? : can be removed?! */
sched_timestep_t as = sched_is_scheduled(a) ? sched_get_time_step(a) : 0;
* @param b The second node.
* @return 1 if a dominates b or if a == b, 0 else.
*/
* @param b The second node.
* @return 1 if a dominates b or if a == b, 0 else.
*/
* @param b The second node.
* @return 1 if a dominates b, 0 else.
*/
* @param b The second node.
* @return 1 if a dominates b, 0 else.
*/
* @param b The second value.
* @return 1, if a and b interfere, 0 if not.
*/
* @param b The second value.
* @return 1, if a and b interfere, 0 if not.
*/
{
int a2b = _value_dominates(a, b);
int b2a = _value_dominates(b, a);
{
int a2b = _value_dominates(a, b);
int b2a = _value_dominates(b, a);
* @param where The location to check for.
* @return 1, if @p irn is live in front of @p where.
*/
* @param where The location to check for.
* @return 1, if @p irn is live in front of @p where.
*/
-static INLINE int _be_lv_chk_before_irn(const be_irg_t *birg, const ir_node *irn, const ir_node *where)
+static inline int _be_lv_chk_before_irn(const be_irg_t *birg, const ir_node *irn, const ir_node *where)
* @param where The location to check for.
* @return 1, if @p irn is live after @p where.
*/
* @param where The location to check for.
* @return 1, if @p irn is live after @p where.
*/
-static INLINE int _be_lv_chk_after_irn(const be_irg_t *birg, const ir_node *irn, const ir_node *where)
+static inline int _be_lv_chk_after_irn(const be_irg_t *birg, const ir_node *irn, const ir_node *where)