X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fstat%2Fstat_dmp.c;h=394012218db67d277b5aedb4f30cdfc70f007397;hb=2e291eab8268af551488b1f4fb4d9ca61b625e33;hp=ae209e1df3c389df13567d2c0df01057fcc3809b;hpb=86b557b6be3fd996c4043152e79d21bf911c561d;p=libfirm diff --git a/ir/stat/stat_dmp.c b/ir/stat/stat_dmp.c index ae209e1df..394012218 100644 --- a/ir/stat/stat_dmp.c +++ b/ir/stat/stat_dmp.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -77,8 +77,10 @@ static const struct { { 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" }, @@ -86,10 +88,11 @@ static const struct { { 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" }, @@ -97,13 +100,19 @@ static const struct { { 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_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" }, @@ -122,6 +131,36 @@ static const struct { { 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" }, + { FS_OPT_RTS_CBRT, "RTS optimization: call to cbrt() replaced" }, + { FS_OPT_RTS_POW, "RTS optimization: call to pow() replaced" }, + { FS_OPT_RTS_EXP, "RTS optimization: call to exp() replaced" }, + { FS_OPT_RTS_LOG, "RTS optimization: call to log() replaced" }, + { FS_OPT_RTS_SIN, "RTS optimization: call to sin() replaced" }, + { FS_OPT_RTS_COS, "RTS optimization: call to cos() replaced" }, + { FS_OPT_RTS_TAN, "RTS optimization: call to tan() replaced" }, + { FS_OPT_RTS_ASIN, "RTS optimization: call to asin() replaced" }, + { FS_OPT_RTS_ACOS, "RTS optimization: call to atan() replaced" }, + { FS_OPT_RTS_ATAN, "RTS optimization: call to acos() replaced" }, + { FS_OPT_RTS_SINH, "RTS optimization: call to sinh() replaced" }, + { FS_OPT_RTS_COSH, "RTS optimization: call to cosh() replaced" }, + { FS_OPT_RTS_TANH, "RTS optimization: call to tanh() replaced" }, + { FS_OPT_RTS_SYMMETRIC, "RTS optimization: call to symmetric function f(-x) replaced by f(x)" }, + { FS_OPT_RTS_STRCMP, "RTS optimization: call to strcmp() replaced" }, + { FS_OPT_RTS_STRNCMP, "RTS optimization: call to strncmp() replaced" }, + { FS_OPT_RTS_MEMCPY, "RTS optimization: call to memcpy() replaced" }, + { FS_OPT_RTS_MEMSET, "RTS optimization: call to memset() replaced" }, + { FS_OPT_RTS_STRLEN, "RTS optimization: call to strlen() replaced" }, { FS_BE_IA32_LEA, "ia32 Backend transformation: Lea was created" }, { FS_BE_IA32_LOAD_LEA, "ia32 Backend transformation: Load merged with a Lea" }, { FS_BE_IA32_STORE_LEA, "ia32 Backend transformation: Store merged with a Lea" }, @@ -277,7 +316,7 @@ static void simple_dump_be_block_sched_ready(dumper_t *dmp, graph_entry_t *entry static void add_distrib_entry(const distrib_entry_t *entry, void *env) { distrib_tbl_t *sum_tbl = env; - stat_add_int_distrib_tbl(sum_tbl, (int)(entry->object), &entry->cnt); + stat_add_int_distrib_tbl(sum_tbl, PTR_TO_INT(entry->object), &entry->cnt); } /* add_distrib_entry */ /** @@ -446,8 +485,10 @@ 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", + " 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]), @@ -457,8 +498,10 @@ 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_indirect_calls]), + cnt_to_uint(&entry->cnt[gcnt_external_calls]) ); for (i = 0; i < IF_RESULT_LAST; ++i) { @@ -509,14 +552,15 @@ static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry) /* dump block info */ fprintf(dmp->f, "\n%12s %12s %12s %12s %12s %12s %12s\n", "Block Nr", "Nodes", "intern E", "incoming E", "outgoing E", "Phi", "quot"); foreach_pset(entry->block_hash, b_entry) { - fprintf(dmp->f, "BLK %6ld %12u %12u %12u %12u %12u %4.8f\n", + fprintf(dmp->f, "BLK %6ld %12u %12u %12u %12u %12u %4.8f %s\n", b_entry->block_nr, cnt_to_uint(&b_entry->cnt[bcnt_nodes]), cnt_to_uint(&b_entry->cnt[bcnt_edges]), cnt_to_uint(&b_entry->cnt[bcnt_in_edges]), cnt_to_uint(&b_entry->cnt[bcnt_out_edges]), cnt_to_uint(&b_entry->cnt[bcnt_phi_data]), - cnt_to_dbl(&b_entry->cnt[bcnt_edges]) / cnt_to_dbl(&b_entry->cnt[bcnt_nodes]) + cnt_to_dbl(&b_entry->cnt[bcnt_edges]) / cnt_to_dbl(&b_entry->cnt[bcnt_nodes]), + b_entry->is_start ? "START" : (b_entry->is_end ? "END" : "") ); } /* foreach_pset */ @@ -567,7 +611,7 @@ static void simple_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl) fprintf(dmp->f, "-------------------------------\n"); for (i = 0; i < ARR_SIZE(tbl->int_bits_count); ++i) { - fprintf(dmp->f, "%5d %12u\n", i + 1, cnt_to_uint(&tbl->int_bits_count[i])); + fprintf(dmp->f, "%5u %12u\n", (unsigned) (i + 1), cnt_to_uint(&tbl->int_bits_count[i])); cnt_add(&sum, &tbl->int_bits_count[i]); } /* for */ fprintf(dmp->f, "-------------------------------\n"); @@ -607,6 +651,8 @@ static void simple_dump_param_tbl(dumper_t *dmp, const distrib_tbl_t *tbl, graph 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]));