00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040
00041
00042
00043
00044
00045
00046
00047
00048
00049
00050
00051
00052
00053
00054 #ifdef USE_PCH
00055 #include "opt_pch.h"
00056 #endif // USE_PCH
00057 #pragma hdrstop
00058
00059
00060 #include "opt_transform.h"
00061
00062
00063 struct BOOL_SIMP : public NULL_TRANSFORM {
00064 const char *Name() const { return "Boolean simp"; }
00065 CODEREP *Apply_cr(CODEREP *cr, bool is_mu, STMTREP *stmt, BB_NODE *bb, CODEMAP *htable) const
00066 {
00067 if (is_mu) return NULL;
00068 if (cr->Kind() != CK_OP) return NULL;
00069
00070 if (OPCODE_is_compare(cr->Op()) ||
00071 OPCODE_operator(cr->Op()) == OPR_MAX) {
00072
00073 BB_LOOP *loop = bb->Innermost();
00074 for (loop = bb->Innermost(); loop != NULL; loop = loop->Parent()) {
00075 CODEREP *entry_test = loop->Entry_test();
00076 if (entry_test == NULL) continue;
00077
00078
00079 if (OPCODE_is_compare(cr->Op()) &&
00080 bb->Innermost()->Entry_test() == cr) {
00081 return htable->Add_const(MTYPE_I4, 1);
00082
00083 } else if (OPCODE_operator(cr->Op()) == OPR_MAX) {
00084 switch (OPCODE_operator(entry_test->Op())) {
00085 case OPR_GT:
00086 case OPR_GE:
00087 if ((entry_test->Opnd(0) == cr->Opnd(0) &&
00088 entry_test->Opnd(1) == cr->Opnd(1)) ||
00089 (entry_test->Opnd(0) == cr->Opnd(1) &&
00090 entry_test->Opnd(1) == cr->Opnd(0)))
00091 return entry_test->Opnd(0);
00092 break;
00093 case OPR_LE:
00094 case OPR_LT:
00095 if ((entry_test->Opnd(0) == cr->Opnd(0) &&
00096 entry_test->Opnd(1) == cr->Opnd(1)) ||
00097 (entry_test->Opnd(0) == cr->Opnd(1) &&
00098 entry_test->Opnd(1) == cr->Opnd(0)))
00099 return entry_test->Opnd(1);
00100 break;
00101 }
00102 }
00103 }
00104 }
00105 return NULL;
00106 }
00107
00108
00109 void Setup(PER_BB_CACHE *, DONT_TRACK_CUR_VERSION *) {}
00110 };
00111
00112
00113 struct GVN : public NULL_TRANSFORM {
00114 typedef UPDATE<SUBSTITUE, PER_SR_CACHE, DONT_TRACK_CUR_VERSION> UPDATE_GVN_SUB;
00115
00116 MEM_POOL _mem_pool;
00117 STMTREP **_stmt;
00118 CODEMAP *_htable;
00119 OPT_STAB *_sym;
00120 COMP_UNIT *_cu;
00121 SUBSTITUE gvn_sub;
00122 mutable UPDATE_GVN_SUB update_gvn_sub;
00123 const char *Name() const { return "GVN"; }
00124
00125 CODEREP *Apply_cr(CODEREP *cr, bool is_mu, STMTREP *stmt, BB_NODE *bb, CODEMAP *htable) const
00126 {
00127 if (cr->Kind() != CK_OP) return NULL;
00128 if (is_mu) return NULL;
00129 INT32 id = cr->Coderep_id();
00130 if (_stmt[id] && _stmt[id]->Bb()->Dominates(bb)) {
00131 MTYPE dtype = cr->Dtyp();
00132 IDTYPE aux_id = _sym->Create_preg(dtype, "crxxx", NULL);
00133 CODEREP *newcr = _htable->Add_def
00134 (aux_id, 1, NULL, dtype, dtype, _sym->St_ofst(aux_id),
00135 ST_type(MTYPE_To_PREG(dtype)), 0, TRUE);
00136
00137
00138 STMTREP *savestmt;
00139 savestmt = CXX_NEW(STMTREP, _htable->Mem_pool());
00140 savestmt->Init( newcr, cr,
00141 OPCODE_make_op(OPR_STID, MTYPE_V, newcr->Dsctyp()));
00142 savestmt->Set_chi_list(NULL);
00143 newcr->Set_defstmt(savestmt);
00144 savestmt->Set_bb( _stmt[id]->Bb() );
00145 savestmt->Set_linenum( _stmt[id]->Linenum() );
00146 savestmt->Set_live_stmt();
00147 bb->Stmtlist()->Insert_Before(savestmt, _stmt[id]);
00148
00149 update_gvn_sub._trans->Init(cr, newcr);
00150 update_gvn_sub.Process_SR(_stmt[id], _stmt[id]->Bb());
00151
00152 return newcr;
00153 } else {
00154 _stmt[id] = stmt;
00155 return NULL;
00156 }
00157 }
00158
00159 void Setup(PER_PU_CACHE *, DONT_TRACK_CUR_VERSION *) {}
00160
00161 GVN(COMP_UNIT *cu, BOOL trace):
00162 _cu(cu),
00163 _htable(cu->Htable()),
00164 _sym(cu->Opt_stab()),
00165 gvn_sub(),
00166 update_gvn_sub(cu, &gvn_sub, trace)
00167 {
00168 OPT_POOL_Initialize(&_mem_pool, "Current version pool", FALSE, 0);
00169 OPT_POOL_Push(&_mem_pool, IVR_DUMP_FLAG);
00170 _stmt = (STMTREP **)
00171 CXX_NEW_ARRAY(STMTREP *, cu->Htable()->Coderep_id_cnt(), &_mem_pool);
00172 for (INT32 i = 0; i < cu->Htable()->Coderep_id_cnt(); i++)
00173 _stmt[i] = NULL;
00174 }
00175 ~GVN() {
00176 OPT_POOL_Pop(&_mem_pool, 0);
00177 OPT_POOL_Delete(&_mem_pool, 0);
00178 }
00179 };
00180
00181
00182 struct AGGR_COPY : public NULL_TRANSFORM {
00183 TRACK_CUR_VERSION *cur_ver;
00184 const char *Name() const { return "AGGR_COPY"; }
00185
00186 CODEREP *Apply_cr(CODEREP *cr, bool is_mu, STMTREP *stmt, BB_NODE *, CODEMAP *htable) const
00187 {
00188 if (is_mu) return NULL;
00189 if (cr->Kind() == CK_VAR &&
00190 !cr->Is_flag_set((CR_FLAG)(CF_DEF_BY_PHI|CF_DEF_BY_CHI)) &&
00191 cr->Defstmt() != NULL &&
00192 is_current_version(cur_ver, cr->Defstmt()->Rhs()))
00193 return cr->Defstmt()->Rhs();
00194 return NULL;
00195 }
00196
00197 void Setup(PER_PU_CACHE *, TRACK_CUR_VERSION *ver) {
00198 cur_ver = ver;
00199 }
00200 };
00201
00202
00203
00204
00205 void
00206 Simplify_bool_expr(COMP_UNIT *cu)
00207 {
00208 #if 0
00209
00210 {
00211 AGGR_COPY aggr_copy;
00212 UPDATE<AGGR_COPY, PER_PU_CACHE, TRACK_CUR_VERSION> UPDATE_copy(cu, &aggr_copy, TRUE);
00213 UPDATE_copy.Process_PU();
00214 }
00215 #endif
00216
00217 {
00218 BOOL_SIMP bool_simp;
00219 UPDATE<BOOL_SIMP, PER_BB_CACHE>
00220 UPDATE_bool_simp(cu, &bool_simp, Get_Trace(TP_WOPT2, BOOL_SIMP_FLAG) );
00221 UPDATE_bool_simp.Process_PU();
00222
00223 if (Get_Trace (TP_WOPT2, BOOL_SIMP_FLAG)) {
00224 fprintf (TFile, "%sDump after Boolean Simplification\n%s", DBar, DBar );
00225 cu->Cfg()->Print (TFile);
00226 }
00227 }
00228
00229 #if 0
00230 {
00231 GVN gvn(cu, TRUE);
00232 UPDATE<GVN> UPDATE_gvn(cu, &gvn, TRUE);
00233 UPDATE_gvn.Process_PU();
00234 }
00235 #endif
00236 }
00237
00238
