{ FS_OPT_SUB_MUL_A_X_A, "algebraic simplification: a * x - a = a * (x - 1)" },
{ FS_OPT_SUB_SUB_X_Y_Z, "algebraic simplification: (x - y) - z = x - (y + z)" },
{ FS_OPT_SUB_C_NOT_X, "algebraic simplification: c - ~a = a + (c+1)" },
- { FS_OPT_SUB_TO_ADD, "algebraic simplification: (-a) - b = -(a + b), a - (b - c) = a + (c - b), a - (b * C) -> a + (b * -C)" },
- { FS_OPT_MUL_MINUS, "algebraic simplification: (-a) * (b - c) -> a * (c - b)" },
+ { FS_OPT_SUB_TO_ADD, "algebraic simplification: (-a) - b = -(a + b), a - (b - c) = a + (c - b), a - (b * C) = a + (b * -C)" },
+ { FS_OPT_SUB_TO_NOT, "algebraic simplification: -1 - x -> ~x" },
+ { FS_OPT_SUB_TO_CONV, "algebraic simplification: a - NULL = (int)a" },
+ { FS_OPT_MUL_MINUS, "algebraic simplification: (-a) * (b - c) = a * (c - b)" },
{ FS_OPT_MUL_MINUS_1, "algebraic simplification: a * -1 = -a" },
{ FS_OPT_MINUS_MUL_C, "algebraic simplification: (-a) * C = a * (-C)" },
{ FS_OPT_MUL_MINUS_MINUS,"algebraic simplification: (-a) * (-b) = a * b" },
{ FS_OPT_AND, "algebraic simplification: a & 0b1...1 = 0b1...1 & a = a & a = (a|X) & a = a" },
{ FS_OPT_TO_EOR, "algebraic simplification: (a|b) & ~(a&b) = a^b" },
{ FS_OPT_EOR_A_A, "algebraic simplification: a ^ a = 0" },
- { FS_OPT_EOR_TO_NOT_BOOL,"algebraic simplification: bool ^ 1 = !bool" },
- { FS_OPT_EOR_TO_NOT, "algebraic simplification: x ^ 0b1..1 = ~x, (a ^ b) & b -> ~a & b" },
+ { FS_OPT_EOR_A_B_A, "algebraic simplification: (a ^ b) ^ a = b" },
+ { FS_OPT_EOR_TO_NOT_BOOL,"boolean simplification: bool ^ 1 = !bool" },
+ { FS_OPT_EOR_TO_NOT, "algebraic simplification: x ^ 0b1..1 = ~x, (a ^ b) & b = ~a & b" },
{ FS_OPT_NOT_CMP, "algebraic simplification: !(a cmp b) = a !cmp b" },
- { FS_OPT_OR_SHFT_TO_ROT, "algebraic simplification: (x << c) | (x >> (bits - c)) == Rot(x, c)" },
+ { FS_OPT_OR_SHFT_TO_ROTL,"algebraic simplification: (x << c) | (x >> (bits - c)) == Rotl(x, c)" },
{ FS_OPT_REASSOC_SHIFT, "algebraic simplification: (x SHF c1) SHF c2 = x SHF (c1+c2)" },
{ FS_OPT_SHIFT_AND, "algebraic simplification: (a SHF c) AND (b SHF c) = (a AND b) SHF c" },
{ FS_OPT_SHIFT_OR, "algebraic simplification: (a SHF c) OR (b SHF c) = (a OR b) SHF c" },
{ FS_OPT_CONV, "algebraic simplification: Conv could be removed" },
{ FS_OPT_CAST, "algebraic simplification: a Cast could be removed" },
{ FS_OPT_MIN_MAX_EQ, "algebraic simplification: Min(a,a) = Max(a,a) = a" },
+ { FS_OPT_MUX_BOOL, "boolean simplification: Muxb(sel, true, false) = sel" },
+ { FS_OPT_MUX_NOT_BOOL, "boolean simplification: Muxb(sel, false, true) = Not(sel)" },
+ { FS_OPT_MUX_OR_BOOL, "boolean simplification: Muxb(sel, true, x) = Or(sel, x)" },
+ { FS_OPT_MUX_ORNOT_BOOL, "boolean simplification: Muxb(sel, x, true) = Or(Not(sel), x)" },
+ { FS_OPT_MUX_AND_BOOL, "boolean simplification: Muxb(sel, x, false) = And(sel, x)" },
+ { 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_CMP_CNST_MAGN, "CMP optimization: reduced magnitude of a const" },
{ FS_OPT_CMP_SHF_TO_AND, "CMP optimization: transformed shift into And" },
{ FS_OPT_CMP_MOD_TO_AND, "CMP optimization: transformed Mod into And" },
+ { FS_OPT_NOP, "the operation is a NOP" },
+ { FS_OPT_GVN_FOLLOWER, "GVN-PRE: replaced a follower" },
+ { FS_OPT_GVN_FULLY, "GVN-PRE: replaced by fully redundant value" },
+ { FS_OPT_GVN_PARTLY, "GVN-PRE: replaced by partly redundant value" },
+ { FS_OPT_COMBO_CONST, "Combo: evaluated into Constant" },
+ { FS_OPT_COMBO_CF, "Combo: removed conditional control flow" },
+ { FS_OPT_COMBO_FOLLOWER, "Combo: removed a follower" },
+ { FS_OPT_COMBO_CONGRUENT,"Combo: replaced by congruent" },
{ FS_OPT_RTS_ABS, "RTS optimization: call to abs() replaced" },
{ FS_OPT_RTS_ALLOCA, "RTS optimization: call to alloca() replaced" },
{ FS_OPT_RTS_SQRT, "RTS optimization: call to sqrt() replaced" },
" recursive : %s\n"
" chain call : %s\n"
" calls : %u\n"
- " indirect calls : %u\n",
+ " indirect calls : %u\n"
+ " external calls : %u\n",
entry->is_deleted ? "DELETED " : "",
cnt_to_uint(&entry->cnt[gcnt_acc_walked]), cnt_to_uint(&entry->cnt[gcnt_acc_walked_blocks]),
cnt_to_uint(&entry->cnt[gcnt_acc_was_inlined]),
entry->is_recursive ? "YES" : "NO",
entry->is_chain_call ? "YES" : "NO",
cnt_to_uint(&entry->cnt[gcnt_all_calls]),
- cnt_to_uint(&entry->cnt[gcnt_indirect_calls])
+ cnt_to_uint(&entry->cnt[gcnt_indirect_calls]),
+ cnt_to_uint(&entry->cnt[gcnt_external_calls])
);
for (i = 0; i < IF_RESULT_LAST; ++i) {
fprintf(dmp->f, "-------------------------------\n");
fprintf(dmp->f, "Number of Calls %12u\n", cnt_to_uint(&global->cnt[gcnt_all_calls]));
+ fprintf(dmp->f, "indirect calls %12u\n", cnt_to_uint(&global->cnt[gcnt_indirect_calls]));
+ fprintf(dmp->f, "external calls %12u\n", cnt_to_uint(&global->cnt[gcnt_external_calls]));
fprintf(dmp->f, "with const params %12u\n", cnt_to_uint(&global->cnt[gcnt_call_with_cnst_arg]));
fprintf(dmp->f, "with all const params %12u\n", cnt_to_uint(&global->cnt[gcnt_call_with_all_cnst_arg]));
fprintf(dmp->f, "with local var adr params %12u\n", cnt_to_uint(&global->cnt[gcnt_call_with_local_adr]));
projects / libfirm / blobdiff