/**
* Merge the debug info due to dead code elimination
*/
-#define DBG_OPT_DEAD \
- do { \
+#define DBG_OPT_DEAD(oldn, n) \
+ do { \
ir_node *ons[2]; \
ons[0] = oldn; \
ons[1] = get_Block_cfgpred(oldn, 0); \
/**
* Merge the debug info due to a straightening optimization
*/
-#define DBG_OPT_STG \
- do { \
+#define DBG_OPT_STG(oldn, n) \
+ do { \
ir_node *ons[2]; \
ons[0] = oldn; \
ons[1] = get_Block_cfgpred(oldn, 0); \
/**
* Merge the debug info due to an if simplification
*/
-#define DBG_OPT_IFSIM \
- do { \
+#define DBG_OPT_IFSIM(oldn, a, b, n) \
+ do { \
ir_node *ons[4]; \
- ons[0] = oldn; \
+ ons[0] = oldn; \
ons[1] = a; \
ons[2] = b; \
ons[3] = get_Proj_pred(a); \
- stat_merge_nodes(&n, 1, ons, SIZ(ons), STAT_OPT_IFSIM); \
+ stat_merge_nodes(&n, 1, ons, SIZ(ons), STAT_OPT_IFSIM); \
__dbg_info_merge_sets(&n, 1, ons, SIZ(ons), dbg_if_simplification); \
} while(0)
/**
* Merge the debug info due to an algebraic_simplification
*/
-#define DBG_OPT_ALGSIM0 \
+#define DBG_OPT_ALGSIM0(oldn, n) \
do { \
stat_merge_nodes(&n, 1, &oldn, 1, STAT_OPT_CONST_EVAL); \
__dbg_info_merge_pair(n, oldn, dbg_const_eval); \
} while(0)
-#define DBG_OPT_ALGSIM1 \
- do { \
+#define DBG_OPT_ALGSIM1(oldn, a, b, n) \
+ do { \
ir_node *ons[3]; \
ons[0] = oldn; \
ons[1] = a; \
__dbg_info_merge_sets(&n, 1, ons, SIZ(ons), dbg_algebraic_simplification); \
} while(0)
-#define DBG_OPT_ALGSIM2 \
+#define DBG_OPT_ALGSIM2(oldn, pred, n) \
do { \
ir_node *ons[3]; \
ons[0] = oldn; \
- ons[1] = get_unop_op(oldn); \
+ ons[1] = pred; \
ons[2] = n; \
stat_merge_nodes(&n, 1, ons, SIZ(ons), STAT_OPT_ALGSIM); \
__dbg_info_merge_sets(&n, 1, ons, SIZ(ons), dbg_algebraic_simplification); \
} while(0)
-#define DBG_OPT_ALGSIM3 \
- do { \
+#define DBG_OPT_ALGSIM3(oldn, a, n) \
+ do { \
ir_node *ons[2]; \
ons[0] = oldn; \
ons[1] = a; \
__dbg_info_merge_sets(&n, 1, ons, SIZ(ons), dbg_algebraic_simplification); \
} while(0)
-#define DBG_OPT_PHI \
- do { \
+#define DBG_OPT_PHI(oldn, first_val, n) \
+ do { \
ir_node *ons[2]; \
ons[0] = oldn; \
ons[1] = first_val; \
} while(0)
-#define DBG_OPT_WAW \
- do { \
+#define DBG_OPT_WAW(st1, st2) \
+ do { \
ir_node *ons[2]; \
- ons[0] = oldn; \
- ons[1] = n; \
- stat_merge_nodes(&n, 1, ons, SIZ(ons), STAT_OPT_WAW); \
- __dbg_info_merge_sets(&n, 1, ons, SIZ(ons), dbg_write_after_write);\
+ ons[0] = st1; \
+ ons[1] = st2; \
+ stat_merge_nodes(&st2, 1, ons, SIZ(ons), STAT_OPT_WAW); \
+ __dbg_info_merge_sets(&st2, 1, ons, SIZ(ons), dbg_write_after_write); \
+ } while(0)
+
+#define DBG_OPT_WAR(load, store) \
+ do { \
+ ir_node *ons[2]; \
+ ons[0] = load; \
+ ons[1] = store; \
+ stat_merge_nodes(&load, 1, ons, SIZ(ons), STAT_OPT_WAR); \
+ __dbg_info_merge_sets(&load, 1, ons, SIZ(ons), dbg_write_after_read); \
} while(0)
-#define DBG_OPT_WAR \
- do { \
+#define DBG_OPT_RAW(store, load) \
+ do { \
ir_node *ons[2]; \
- ons[0] = oldn; \
- ons[1] = c; \
- stat_merge_nodes(&n, 1, ons, SIZ(ons), STAT_OPT_WAR); \
- __dbg_info_merge_sets(&c, 1, ons, SIZ(ons), dbg_write_after_read); \
+ ons[0] = store; \
+ ons[1] = load; \
+ stat_merge_nodes(&store, 1, ons, SIZ(ons), STAT_OPT_RAW); \
+ __dbg_info_merge_sets(&store, 1, ons, SIZ(ons), dbg_read_after_write); \
} while(0)
-#define DBG_OPT_RAW \
- do { \
+#define DBG_OPT_RAR(ld1, ld2) \
+ do { \
ir_node *ons[2]; \
- ons[0] = oldn; \
- ons[1] = c; \
- stat_merge_nodes(&n, 1, ons, SIZ(ons), STAT_OPT_RAW); \
- __dbg_info_merge_sets(&c, 1, ons, SIZ(ons), dbg_read_after_write); \
+ ons[0] = ld1; \
+ ons[1] = ld2; \
+ stat_merge_nodes(&ld1, 1, ons, SIZ(ons), STAT_OPT_RAR); \
+ __dbg_info_merge_sets(&ld1, 1, ons, SIZ(ons), dbg_read_after_read); \
} while(0)
-#define DBG_OPT_TUPLE \
- do { \
+#define DBG_OPT_TUPLE(oldn, a, n) \
+ do { \
ir_node *ons[3]; \
ons[0] = oldn; \
ons[1] = a; \
__dbg_info_merge_sets(&n, 1, ons, SIZ(ons), dbg_opt_auxnode); \
} while(0)
-#define DBG_OPT_ID \
- do { \
+#define DBG_OPT_ID(oldn, n) \
+ do { \
ir_node *ons[2]; \
ons[0] = oldn; \
ons[1] = n; \