Improve the AM folding heuristics: Do not fold AM if at least one of the AM operands...

[libfirm] / ir / be / besched_t.h

diff --git a/ir/be/besched_t.h b/ir/be/besched_t.h
index de84b62..70b6534 100644 (file)
--- a/ir/be/besched_t.h
+++ b/ir/be/besched_t.h
@@ -54,11 +54,7 @@ typedef struct _sched_info_t {
 
 #define _sched_entry(list_head) (list_entry(list_head, sched_info_t, list))
 
-#ifndef SCHEDULE_PROJS
 #define get_irn_sched_info(irn) get_irn_data(skip_Proj_const(irn), sched_info_t, sched_irn_data_offset)
-#else
-#define get_irn_sched_info(irn) get_irn_data(irn, sched_info_t, sched_irn_data_offset)
-#endif
 
 #define get_sched_info_irn(sched_info) get_irn_data_base(sched_info, sched_irn_data_offset)
 
@@ -96,10 +92,8 @@ static INLINE int to_appear_in_schedule(const ir_node *irn)
                case iro_Jmp:
                case iro_Break:
                        return 1;
-#ifndef SCHEDULE_PROJS
                case iro_Proj:
                        return 0;
-#endif
                default:
                        return is_data_node(irn);
        }
@@ -222,9 +216,7 @@ static INLINE void _sched_add_before(ir_node *before, ir_node *irn)
        sched_info_t *info = get_irn_sched_info(irn);
        assert(_sched_is_scheduled(before));
        assert(!_sched_is_scheduled(irn));
-#ifndef SCHEDULE_PROJS
        assert(!is_Proj(irn));
-#endif
        list_add_tail(&info->list, &get_irn_sched_info(before)->list);
        _sched_set_time_stamp(irn);
        info->scheduled = 1;
@@ -241,9 +233,7 @@ static INLINE void _sched_add_after(ir_node *after, ir_node *irn)
        sched_info_t *info = get_irn_sched_info(irn);
        assert(_sched_is_scheduled(after));
        assert(!_sched_is_scheduled(irn));
-#ifndef SCHEDULE_PROJS
        assert(!is_Proj(irn));
-#endif
        list_add(&info->list, &get_irn_sched_info(after)->list);
        _sched_set_time_stamp(irn);
        info->scheduled = 1;