Remove the unused parameter const arch_env_t *env from arch_set_irn_register().
[libfirm] / ir / stat / stat_dmp.c
index 3fb01e6..3940122 100644 (file)
@@ -108,11 +108,11 @@ static const struct {
        { FS_OPT_MUX_ANDNOT_BOOL,"boolean simplification: Muxb(sel, false, x) = And(Not(sel), x)" },
        { FS_OPT_MUX_C,          "algebraic simplification: Mux(C, f, t) = C ? t : f" },
        { FS_OPT_MUX_EQ,         "algebraic simplification: Mux(v, x, x) = x" },
-       { FS_OPT_MUX_TRANSFORM,  "algebraic simplification: Mux(a, b, c) = b OR Mux(a,b, c) = c" },
+       { FS_OPT_MUX_TRANSFORM,  "algebraic simplification: Mux(t ==/!= f, t, f) = f/t, Mux(t ==/!= 0, -t, t) = -t/t" },
        { FS_OPT_MUX_TO_MIN,     "algebraic simplification: Mux(a < b, a, b) = Min(a,b)" },
        { FS_OPT_MUX_TO_MAX,     "algebraic simplification: Mux(a > b, a, b) = Max(a,b)" },
-       { FS_OPT_MUX_TO_ABS,     "algebraic simplification: Mux(a > b, a, b) = Abs(a,b)" },
-       { FS_OPT_MUX_TO_SHR,     "algebraic simplification: Mux(a > b, a, b) = a >> b" },
+       { FS_OPT_MUX_TO_ABS,     "algebraic simplification: Mux(a > 0, a, -a) = Abs(a)" },
+       { FS_OPT_MUX_TO_BITOP,   "algebraic simplification: Mux((a & 2^x) ==/!= 0, 2^x, 0) = (a & 2^x) (xor 2^x)" },
        { FS_OPT_IDEM_UNARY,     "algebraic simplification: Idempotent unary operation" },
        { FS_OPT_MINUS_NOT,      "algebraic simplification: -(~x) = x + 1" },
        { FS_OPT_NOT_MINUS_1,    "algebraic simplification: ~(x - 1) = -x" },
@@ -485,6 +485,7 @@ static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
                        " calls only leaf functions : %s\n"
                        " recursive                 : %s\n"
                        " chain call                : %s\n"
+                       " strict                    : %s\n"
                        " calls                     : %u\n"
                        " indirect calls            : %u\n"
                        " external calls            : %u\n",
@@ -497,6 +498,7 @@ static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
                        entry->is_leaf_call == LCS_NON_LEAF_CALL ? "NO" : (entry->is_leaf_call == LCS_LEAF_CALL ? "Yes" : "Maybe"),
                        entry->is_recursive ? "YES" : "NO",
                        entry->is_chain_call ? "YES" : "NO",
+                       entry->is_strict ? "YES" : "NO",
                        cnt_to_uint(&entry->cnt[gcnt_all_calls]),
                        cnt_to_uint(&entry->cnt[gcnt_indirect_calls]),
                        cnt_to_uint(&entry->cnt[gcnt_external_calls])