Polaris: DDGtester.cc Source File

DDGtester.cc Go to the documentation of this file. #include <stream.h> #include "../DDgraph.h" #include "../Program.h" #include "../p-setjmp.h" #include "../utilities/switches_util.h" #include "../StringElem.h" #include "../String.h" struct DDI_list { int id; DDiterator* iter; DDI_list* next; }; class DDgraphTester { int _cur_ddi_num; DDgraph& _ddgraph; StmtList& _stmts; DDI_list* _ddi_list; public: inline DDgraphTester(ProgramUnit& PU) : _ddgraph(PU.ddgraph()), _stmts(PU.stmts()) { _ddi_list = 0; _cur_ddi_num = 0; } inline ~DDgraphTester() { while (_ddi_list) { DDI_list* temp = _ddi_list; _ddi_list = _ddi_list->next; delete temp->iter; delete temp; } } void add(int num_of_dvfs); void show_active_arcs(); void merge_DVF(int dditer_num); void show_arcs(); void add_dditerator(int num_of_dditer); void del_dditerator(int dditer_num); void show_dditerator(); void del_current(int dditer_num); void prev_current(int dditer_num); void next_current(int dditer_num); void grab_current(int dditer_num); void show_program(); void reset(int dditer_num); void set_to_last(int dditer_num); }; void DDgraphTester::merge_DVF(int dditer_num) { DDI_list* trip = _ddi_list; if (!trip) { cout << "no DDiterator alive\n"; return; } while (trip->id != dditer_num) { trip = trip->next; if (!trip) { cout << "Wrong number\n"; return; } } merge_DVs(trip->iter->_active_arc->_working_dv_fields); } void DDgraphTester::reset(int dditer_num) { DDI_list* trip = _ddi_list; if (!trip) { cout << "no DDiterator alive\n"; return; } while (trip->id != dditer_num) { trip = trip->next; if (!trip) { cout << "Wrong number\n"; return; } } trip->iter->reset(); } void DDgraphTester::set_to_last(int dditer_num) { DDI_list* trip = _ddi_list; if (!trip) { cout << "no DDiterator alive\n"; return; } while (trip->id != dditer_num) { trip = trip->next; if (!trip) { cout << "Wrong number\n"; return; } } trip->iter->set_to_last(); } #define OCTA 8 #define EndOfDV ';' void DDgraphTester:: add(int num_of_dvfs) { List<DVfield> dvf_list; Iterator<Statement> iter = _stmts.iterator(); char from_stmt_tag[OCTA], to_stmt_tag[OCTA]; int from_expr_num, to_expr_num; char dep_decided[OCTA], dep_type[OCTA], dv[OCTA][3]; for (int i = 1; i <= num_of_dvfs; i++) { cout << i << ": " ; cin >> from_stmt_tag >> from_expr_num >> to_stmt_tag >> to_expr_num; cin >> dep_decided >> dep_type; for (int dv_len = 0; dv_len < OCTA; dv_len++) { cin >> dv[dv_len]; if (dv[dv_len][0] == EndOfDV) break; } dv_len--; Statement *from_stmt = 0, *to_stmt = 0; Expression *from_expr, *to_expr; DEP_DECISION ddeci; DEP_TYPE dtype; for (iter.reset(); iter.valid(); iter++) if (!strcmp(iter.current().tag(), from_stmt_tag)) { from_stmt = &iter.current(); break; } if (!from_stmt) continue; for (iter.reset(); iter.valid(); iter++) if (!strcmp(iter.current().tag(), to_stmt_tag)) { to_stmt = &iter.current(); break; } if (!to_stmt) continue; if (from_expr_num > from_stmt->in_refs().entries() + from_stmt->out_refs().entries()) continue; else if (from_expr_num > from_stmt->in_refs().entries()) from_expr = &from_stmt->out_refs()._element (from_expr_num - from_stmt->in_refs().entries() - 1); else from_expr = &from_stmt->in_refs()._element(from_expr_num - 1); if (to_expr_num > to_stmt->in_refs().entries() + to_stmt->out_refs().entries()) continue; else if (to_expr_num > to_stmt->in_refs().entries()) to_expr = &to_stmt->out_refs()._element (to_expr_num - to_stmt->in_refs().entries() - 1); else to_expr = &to_stmt->in_refs()._element(to_expr_num - 1); switch (dep_decided[0]) { case 'a': ddeci = _ASSUMED; break; case 'p': ddeci = _PROVED; break; default : continue; } switch (dep_type[0]) { case 'f': dtype = _FLOW; break; case 'a': dtype = _ANTI; break; case 'i': dtype = _INPUT; break; case 'o': dtype = _OUTPUT; break; default : continue; } DVfield * new_dvf = new DVfield(ddeci, dtype, *from_stmt, *from_expr, *to_stmt, *to_expr); List<ElementDV> & dvs = new_dvf->_dv; for (; dv_len >= 0; dv_len--) if (!strcmp(dv[dv_len], "*")) dvs.ins_first(new ElementDV(_STAR)); else if (!strcmp(dv[dv_len], "=")) dvs.ins_first(new ElementDV(_EQ)); else if (!strcmp(dv[dv_len], "<>")) dvs.ins_first(new ElementDV(_NEQ)); else if (!strcmp(dv[dv_len], "<")) dvs.ins_first(new ElementDV(_LT)); else if (!strcmp(dv[dv_len], ">")) dvs.ins_first(new ElementDV(_GT)); else if (!strcmp(dv[dv_len], "<=")) dvs.ins_first(new ElementDV(_LE)); else if (!strcmp(dv[dv_len], ">=")) dvs.ins_first(new ElementDV(_GE)); dvf_list.ins_last(new_dvf); } /// ... End of for _ddgraph.add(dvf_list); } /// ... End of add() void DDgraphTester::show_active_arcs() { Iterator<ActiveArc> iter = _ddgraph._active_arcs; for (int num = 1; iter.valid(); iter++, num++) { /// ... COMMON DATA cout << " [" << num << "] refs(" << iter.current()._references << ")this(" << iter.current()._this_arc << ")prev(" << iter.current()._prev_arc << ")next(" << iter.current()._next_arc << ") src(" << iter.current()._source_stmt.tag(); /// ... Source Expression Iterator<Expression> seiter = iter.current()._source_stmt.in_refs(); for (int i = 0; seiter.valid(); seiter++, i++) if (&iter.current()._source_expr == &seiter.current()) break; if (seiter.valid()) cout << "," << i + 1; else { Iterator<Expression> seiter = iter.current()._source_stmt.out_refs(); for (; seiter.valid(); seiter++, i++) if (&iter.current()._source_expr == &seiter.current()) break; if (seiter.valid()) cout << "," << i + 1; else cout << ",WHAT?"; } /// ... Target Statement & Expression cout << ") tgt(" << iter.current()._target_stmt.tag(); Iterator<Expression> teiter = iter.current()._target_stmt.in_refs(); for (i = 0; teiter.valid(); teiter++, i++) if (&iter.current()._target_expr == &teiter.current()) break; if (teiter.valid()) cout << "," << i + 1; else { Iterator<Expression> teiter = iter.current()._target_stmt.out_refs(); for (; teiter.valid(); teiter++, i++) if (&iter.current()._target_expr == &teiter.current()) break; if (teiter.valid()) cout << "," << i + 1; else cout << ",WHAT?"; } /// ... DVfield LIST Iterator<DVfield> dviter = iter.current()._working_dv_fields; cout << ") **DVS**>> {"; for (; dviter.valid(); dviter++) { cout << dviter.current()._references << " ref,"; if (dviter.current()._valid) cout << "v,"; else cout << "iv,"; if (dviter.current()._dep_decided == _PROVED) cout << "pr,"; else cout << "as,"; if (&dviter.current()._from_expr == &iter.current()._source_expr && &dviter.current()._to_expr == &iter.current()._target_expr) cout << "nm,"; else if (&dviter.current()._from_expr == &iter.current()._target_expr && &dviter.current()._to_expr == &iter.current()._source_expr) cout << "rv,"; else cout << dviter.current()._from_stmt.tag() << ":" << dviter.current()._to_stmt.tag() << ","; switch (dviter.current()._dep_type) { case _FLOW: cout << "f,"; break; case _ANTI: cout << "a,"; break; case _INPUT: cout << "i,"; break; case _OUTPUT: cout << "o,"; break; case _UNKNOWN: cout << "u,"; } /// ... EACH DV Iterator<ElementDV> edviter = dviter.current()._dv; for (; edviter.valid(); edviter++) switch (edviter.current().direction()) { case _STAR: cout << "*,"; break; case _EQ: cout << "=,"; break; case _NEQ: cout << "<>,"; break; case _GT: cout << ">,"; break; case _LT: cout << "<,"; break; case _GE: cout << ">=,"; break; case _LE: cout << "<=,"; break; default: cout << "NOWAY!,"; } cout << "} {" ; } cout << "}\n"; } /// ... End of for } /// ... End of show_active_arcs() void DDgraphTester::show_arcs() { Iterator<Statement> iter = _stmts.iterator(); for (; iter.valid(); iter++) { /// ... FOR IN_REFS() Iterator<Expression> iriter = iter.current().in_refs(); for (int i = 1; iriter.valid(); iriter++, i++) if (Arc_type* arc = _ddgraph.arcs_ptr(iriter.current())) { // iriter has only ID or Array refrence expressions.. // SOURCE statment & expression cout << " " << iter.current().tag() << ',' << i << "->"; do { /// ... Iterate over all DVfields in this arc Statement* tgt_stmt = _ddgraph.target_stmt(arc); Expression* tgt_expr = _ddgraph.target_expr(arc); Iterator<Expression> eiter = tgt_stmt->in_refs(); /// ... TARGET statment & expression, and ACTIVE BIT cout << tgt_stmt->tag() << ','; for (int j = 1; eiter.valid(); eiter++, j++) if (tgt_expr == &eiter.current()) break; if (eiter.valid()) cout << j; else { Iterator<Expression> eiter = tgt_stmt->out_refs(); for (; eiter.valid(); eiter++, j++) if (tgt_expr == &eiter.current()) break; if (eiter.valid()) cout << j; else cout << "What?"; } if (_ddgraph.is_active(arc)) cout << ": Ac "; else cout << ": iA "; /// ... EACH FIELD in DVfield head Arc_type* arc_data = _ddgraph.data_field(arc); int pos = 1; while (_ddgraph.is_new_dvfield(arc_data, pos)) { switch (_ddgraph.dep_decision(arc_data, pos)) { case _ASSUMED: cout << "| as,"; break; case _PROVED : cout << "| pr,"; break; default : cout << "| Hey!,"; } switch (_ddgraph.dep_direction(arc_data, pos)) { case _NORMAL: cout << "nm,"; break; case _REVERSE: cout << "rv,"; break; default : cout << "Hey!,"; } switch (_ddgraph.dep_type(arc_data, pos)) { case _FLOW: cout << "f,"; break; case _ANTI: cout << "a,"; break; case _INPUT: cout << "i,"; break; case _OUTPUT: cout << "o,"; break; case _UNKNOWN: cout << "u,"; break; default : cout << "Hey!,"; } /// ... DIRECTIONS in DV DIREC_TYPE dir; while ((dir = _ddgraph.direction(arc_data, pos)) != _DELIM) switch (dir) { case _GT: cout << "> "; break; case _LT: cout << "< "; break; case _LE: cout << "<= "; break; case _GE: cout << ">= "; break; case _EQ: cout << "= "; break; case _NEQ: cout << "<> "; break; case _STAR: cout << "* "; break; default: cout << "Hey! "; } } if (arc = _ddgraph.next_arc(arc)) cout << "\n "; else { cout << endl; break; } } while (1); } /// ... End of if /// ... FOR OUR_REFS() Iterator<Expression> oriter = iter.current().out_refs(); for (; oriter.valid(); oriter++, i++) if (Arc_type* arc = _ddgraph.arcs_ptr(oriter.current())) { // oriter has only ID or Array refrence expressions.. // SOURCE statment & expression cout << " " << iter.current().tag() << ',' << i << "->"; do { /// ... Iterate over all DVfields in this arc Statement* tgt_stmt = _ddgraph.target_stmt(arc); Expression* tgt_expr = _ddgraph.target_expr(arc); Iterator<Expression> eiter = tgt_stmt->in_refs(); /// ... TARGET statment & expression, and ACTIVE BIT cout << tgt_stmt->tag() << ','; for (int j = 1; eiter.valid(); eiter++, j++) if (tgt_expr == &eiter.current()) break; if (eiter.valid()) cout << j; else { Iterator<Expression> eiter = tgt_stmt->out_refs(); for (; eiter.valid(); eiter++, j++) if (tgt_expr == &eiter.current()) break; if (eiter.valid()) cout << j; else cout << "What?"; } if (_ddgraph.is_active(arc)) cout << ": Ac "; else cout << ": iA "; /// ... EACH FIELD in DVfield head Arc_type* arc_data = _ddgraph.data_field(arc); int pos = 1; while (_ddgraph.is_new_dvfield(arc_data, pos)) { switch (_ddgraph.dep_decision(arc_data, pos)) { case _ASSUMED: cout << "| as,"; break; case _PROVED : cout << "| pr,"; break; default : cout << " Hey!,"; } switch (_ddgraph.dep_direction(arc_data, pos)) { case _NORMAL: cout << "nm,"; break; case _REVERSE: cout << "rv,"; break; default : cout << "Hey!,"; } switch (_ddgraph.dep_type(arc_data, pos)) { case _FLOW: cout << "f,"; break; case _ANTI: cout << "a,"; break; case _INPUT: cout << "i,"; break; case _OUTPUT: cout << "o,"; break; case _UNKNOWN: cout << "u,"; break; default : cout << "Hey!,"; } /// ... DIRECTIONS in DV DIREC_TYPE dir; while ((dir = _ddgraph.direction(arc_data, pos)) != _DELIM) switch (dir) { case _GT: cout << "> "; break; case _LT: cout << "< "; break; case _LE: cout << "<= "; break; case _GE: cout << ">= "; break; case _EQ: cout << "= "; break; case _NEQ: cout << "<> "; break; case _STAR: cout << "* "; break; default: cout << "Hey! "; } } if (arc = _ddgraph.next_arc(arc)) cout << "\n "; else { cout << endl; break; } } while (1); } /// ... End of if } } /// ... End of show_arcs() void DDgraphTester::add_dditerator(int num_of_dditer) { char buf[OCTA]; Iterator<Statement> iter = _stmts.iterator(); for (int i = 1; i <= num_of_dditer; i++) { cout << "Init. type for DDI From-part " << i << ": "; cin >> buf; if (buf[0] == 'l') { /// ... a Statement List - From RefList<Statement> * fstmts = new RefList<Statement>; cout << "Enumerate distinct Statement tags and" << " Type ';' as an end mark\n"; while (1) { cin >> buf; if (buf[0] == ';') break; for (iter.reset(); iter.valid(); iter++) if (!strcmp(iter.current().tag(), buf)) { fstmts->ins_last(iter.current()); break; } } if (fstmts->entries() == 0) { delete fstmts; fstmts = 0; continue; } cout << "Init. type for DDI To-part " << i << ": "; cin >> buf; if (buf[0] == 'l') { /// ... a Statement List - To RefList<Statement> * tstmts = new RefList<Statement>; cout << "Enumerate distinct Statement tags and" << " Type ';' as an end mark\n"; while (1) { cin >> buf; if (buf[0] == ';') break; for (iter.reset(); iter.valid(); iter++) if (!strcmp(iter.current().tag(), buf)) { tstmts->ins_last(iter.current()); break; } } if (tstmts->entries()) { /// ... CASE1: From = stmt list, To = stmt list DDI_list* new_ddi = new DDI_list; new_ddi->id = ++_cur_ddi_num; new_ddi->iter = new DDiterator(fstmts, tstmts, _ddgraph); new_ddi->next = 0; if (_ddi_list) { DDI_list* temp = _ddi_list; while (temp->next) temp = temp->next; temp->next = new_ddi; } else _ddi_list = new_ddi; } else { delete fstmts; fstmts = 0; delete tstmts; tstmts = 0; } } else if (buf[0] == 'p') { /// ... a Pair of a Stmt & an Expr int num; Expression * expr = 0; cout << "Statement tag & Expression number? "; cin >> buf >> num; for (iter.reset(); iter.valid(); iter++) if (!strcmp(iter.current().tag(), buf)) { if (num <= iter.current().in_refs().entries()) { Iterator<Expression> eiter = iter.current().in_refs(); while (--num > 0) eiter++; expr = &eiter.current(); } else if (num <= iter.current().out_refs().entries() + iter.current().in_refs().entries()) { Iterator<Expression> eiter = iter.current().out_refs(); num -= iter.current().out_refs().entries(); while (--num > 0) eiter++; expr = &eiter.current(); } break; } if (expr) { /// ... Stmt tag & Expr num are found legal // CASE2: From = stmt list, To = stmt/expr pair DDI_list* new_ddi = new DDI_list; new_ddi->id = ++_cur_ddi_num; new_ddi->next = 0; new_ddi->iter = new DDiterator(fstmts, iter.current(), *expr, _ddgraph); if (_ddi_list) { DDI_list* temp = _ddi_list; while (temp->next) temp = temp->next; temp->next = new_ddi; } else _ddi_list = new_ddi; } else delete fstmts; fstmts = 0; } else delete fstmts; fstmts = 0; } else if (buf[0] = 'p') { /// ... From-part == Pair int num; Expression * expr = 0; cout << "Statement tag & Expression number? "; cin >> buf >> num; for (iter.reset(); iter.valid(); iter++) if (!strcmp(iter.current().tag(), buf)) { if (num <= iter.current().in_refs().entries()) { Iterator<Expression> eiter = iter.current().in_refs(); while (--num > 0) eiter++; expr = &eiter.current(); } else if (num <= iter.current().out_refs().entries() + iter.current().in_refs().entries()) { Iterator<Expression> eiter = iter.current().out_refs(); num -= iter.current().in_refs().entries(); while (--num > 0) eiter++; expr = &eiter.current(); } break; } if (!expr) /// ... Stmt tag or Expr num is found illegal continue; Statement * stmt = &iter.current(); cout << "Init. type for DDI To-part " << i << ": "; cin >> buf; if (buf[0] == 'l') { /// ... a Statement List - To RefList<Statement> * tstmts = new RefList<Statement>; cout << "Enumerate distinct Statement tags and" << " Type ';' as an end mark\n"; while (1) { cin >> buf; if (buf[0] == ';') break; for (iter.reset(); iter.valid(); iter++) if (!strcmp(iter.current().tag(), buf)) { tstmts->ins_last(iter.current()); break; } } // CASE3: From = stmt/expr pair, To = stmt list if (tstmts->entries()) { DDI_list* new_ddi = new DDI_list; new_ddi->id = ++_cur_ddi_num; new_ddi->next = 0; new_ddi->iter = new DDiterator(*stmt, *expr, tstmts, _ddgraph); if (_ddi_list) { DDI_list* temp = _ddi_list; while (temp->next) temp = temp->next; temp->next = new_ddi; } else _ddi_list = new_ddi; } else delete tstmts; tstmts = 0; } else if (buf[0] == 'p') { /// ... a Pair of a Stmt & an Expr Expression * expr2 = 0; cout << "Statement tag & Expression number? "; cin >> buf >> num; for (iter.reset(); iter.valid(); iter++) if (!strcmp(iter.current().tag(), buf)) { if (num <= iter.current().in_refs().entries()) { Iterator<Expression> eiter = iter.current().in_refs(); while (--num > 0) eiter++; expr2 = &eiter.current(); } else if (num <= iter.current().out_refs().entries() + iter.current().in_refs().entries()) { Iterator<Expression> eiter = iter.current().out_refs(); num -= iter.current().in_refs().entries(); while (--num > 0) eiter++; expr2 = &eiter.current(); } break; } if (expr2) { /// ... Stmt tag & Expr num are found legal // CASE4: From = stmt/expr pair, To = stmt/expr pair DDI_list* new_ddi = new DDI_list; new_ddi->id = ++_cur_ddi_num; new_ddi->next = 0; new_ddi->iter = new DDiterator(*stmt, *expr, iter.current(), *expr2, _ddgraph); if (_ddi_list) { DDI_list* temp = _ddi_list; while (temp->next) temp = temp->next; temp->next = new_ddi; } else _ddi_list = new_ddi; } } } } } /// ... End of add_dditerator() void DDgraphTester::del_dditerator(int dditer_num) { DDI_list* pred = 0; DDI_list* trip = _ddi_list; while (trip && trip->id != dditer_num) { pred = trip; trip = trip->next; } if (trip) { if (pred) pred->next = trip->next; else _ddi_list = trip->next; delete trip->iter; delete trip; trip->iter = 0; trip = 0; } else cout << "Wrong number!\n"; } void DDgraphTester::show_dditerator() { for (DDI_list* trip = _ddi_list; trip; trip = trip->next) { cout << " " << trip->id << ": "; if (trip->iter->_init_from == _STMTS) cout << "init(sts,"; else if (trip->iter->_init_from == _EXPR) cout << "init(exp,"; else cout << "init(NonSense,"; if (trip->iter->_init_to == _STMTS) cout << "sts) "; else if (trip->iter->_init_to == _EXPR) cout << "exp) "; else cout << "NonSense) "; Iterator<ActiveArc> iter = _ddgraph._active_arcs; for (int n = 1; iter.valid(); n++, iter++) if (&iter.current() == trip->iter->_active_arc) break; if (iter.end()) cout << "Dangling\n"; else { cout << "aarc(" << n << ") "; Iterator<DVfield> dviter = iter.current()._working_dv_fields; for (n = 1; dviter.valid(); n++, dviter++) if (&dviter.current() == trip->iter->_current_dvf) break; if (dviter.valid()) cout << "curDV(" << n << ")\n"; else cout << "Dangling\n"; } } } /// ... End of show_ddviterator() void DDgraphTester::del_current(int dditer_num) { DDI_list* trip = _ddi_list; if (!trip) { cout << "no DDiterator alive\n"; return; } while (trip->id != dditer_num) { trip = trip->next; if (!trip) { cout << "Wrong number\n"; return; } } trip->iter->del(); cout << "current dvfield deleted\n"; } /// ... End of del_current() void DDgraphTester::prev_current(int dditer_num) { DDI_list* trip = _ddi_list; if (!trip) { cout << "no DDiterator alive\n"; return; } while (trip->id != dditer_num) { trip = trip->next; if (!trip) { cout << "Wrong number\n"; return; } } --*trip->iter; cout << "current dvfield moved to the previous one\n"; } /// ... End of prev() void DDgraphTester::next_current(int dditer_num) { DDI_list* trip = _ddi_list; if (!trip) { cout << "no DDiterator alive\n"; return; } while (trip->id != dditer_num) { trip = trip->next; if (!trip) { cout << "Wrong number\n"; return; } } ++*trip->iter; cout << "current dvfield moved to the next one\n"; } /// ... End of next_current() void DDgraphTester::grab_current(int dditer_num) { DDI_list* trip = _ddi_list; if (!trip) { cout << "no DDiterator alive\n"; return; } while (trip->id != dditer_num) { trip = trip->next; if (!trip) { cout << "Wrong number\n"; return; } } DVfield* temp = trip->iter->grab(); cout << "current dvfield grabbed & deleted\n"; } /// ... End of grab() void DDgraphTester::show_program() { Iterator<Statement> iter = _stmts; int indent = 0; if (!(iter.valid())) return; if (iter.current().stmt_class() == FLOW_ENTRY_STMT) { ++iter; if (!(iter.valid())) return; if (iter.current().stmt_class() == ENTRY_STMT) { /// ... Avoid this ENTRY_STMT ++iter; } } for (; iter.valid(); ++iter) { for (Iterator<StringElem> pre_iter = iter.current().pre_directives(); pre_iter.valid(); ++pre_iter) cout << (String) pre_iter.current() << endl; cout << iter.current().tag() << '\t'; iter.current().write(cout, indent); for (Iterator<StringElem> post_iter = iter.current().post_directives(); post_iter.valid(); ++post_iter) cout << (String) post_iter.current() << endl; } } /*******************************************************************/ main(int argc, char *argv[]) { cout << "Now, Start!\n"; P_ASSERT_HANDLER(0); int next_arg = parse_switches(argc, argv); p_assert(next_arg < argc, "Fortran input file not specified"); Program p; p.read(argv[next_arg]); KeyIterator<String,ProgramUnit> iter_prog = p; /// /// For each subprogram, Do it! /// /*++++++++++++++++++++++++++++++*/ for (; iter_prog.valid(); ++iter_prog) { /*++++++++++++++++++++++++++++++*/ DDgraphTester ddg_tester(iter_prog.current_data()); while (1) { int num; char buf[OCTA]; DDtests_Seq ddt_seq = _None; cout << "(s)how, (d)elete, (a)dd, (g)rab, (p)rev, (n)ext,\n" << "(f)irst, (l)ast, (m)erge, dd(t)ests (q)uit? "; cin >> buf; switch (buf[0]) { case 't': cout << "Select all the ddtests you want include where the options" << " are\n(g)cd-const -> (b)anerjee -> (o)mega[this sequence" << " is fixed], and at the end type ';'\n"; do { cin >> buf; switch (buf[0]) { case 'g': if (_None == ddt_seq) ddt_seq = _GCD_Only; else if (_Banerjee_Only == ddt_seq) ddt_seq = _GCD_Banerjee; else if (_Omega_Only == ddt_seq) ddt_seq = _GCD_Omega; else if (_Banerjee_Omega == ddt_seq) ddt_seq = _All; break; case 'b': if (_None == ddt_seq) ddt_seq = _Banerjee_Only; else if (_GCD_Only == ddt_seq) ddt_seq = _GCD_Banerjee; else if (_Omega_Only == ddt_seq) ddt_seq = _Banerjee_Omega; else if (_GCD_Omega == ddt_seq) ddt_seq = _All; break; case 'o': if (_None == ddt_seq) ddt_seq = _Omega_Only; else if (_Banerjee_Only == ddt_seq) ddt_seq = _Banerjee_Omega; else if (_GCD_Only == ddt_seq) ddt_seq = _GCD_Omega; else if (_GCD_Banerjee == ddt_seq) ddt_seq = _All; } } while (buf[0] != ';'); cout << "Want to include input dependence(Y/n)? "; cin >> buf; if (buf[0] == 'y' || buf[0] == 'Y') ddtests_main(p, ddt_seq, 1); else ddtests_main(p, ddt_seq, 0); break; case 's': cout << "(p)rogram, a(c)tive_arcs, a(r)cs, (d)diterators? "; cin >> buf; if (buf[0] == 'c') ddg_tester.show_active_arcs(); else if (buf[0] == 'r') ddg_tester.show_arcs(); else if (buf[0] == 'p') ddg_tester.show_program(); else if (buf[0] == 'd') ddg_tester.show_dditerator(); break; case 'a': cout << "d(v)fields, d(d)iterators? "; cin >> buf; if (buf[0] == 'v') { cout << "How many DVfields? "; cin >> num; cout << "Enter from_stmt tag, from_expr number, to_stmt tag, " << "to_expr number, dep_decision, dep_type and DVs\n"; ddg_tester.add(num); } else if (buf[0] == 'd') { cout << "How many DDiterators? "; cin >> num; cout << "Initialization Type -> (l): stmt list," << " (p): pair of a stmt & an expr\n"; ddg_tester.add_dditerator(num); } break; case 'm': cout << "DDiterator number? "; cin >> num; ddg_tester.merge_DVF(num); break; case 'f': cout << "DDiterator number? "; cin >> num; ddg_tester.reset(num); break; case 'l': cout << "DDiterator number? "; cin >> num; ddg_tester.set_to_last(num); break; case 'd': cout << "What DDiterator number? "; cin >> num; cout << "(i)tself, its (c)urrent DVfield? "; cin >> buf; if (buf[0] == 'i') ddg_tester.del_dditerator(num); else if (buf[0] == 'c') ddg_tester.del_current(num); break; case 'g': cout << "What DDiterator number? "; cin >> num; ddg_tester.grab_current(num); break; case 'p': cout << "What DDiterator number? "; cin >> num; ddg_tester.prev_current(num); break; case 'n': cout << "What DDiterator number? "; cin >> num; ddg_tester.next_current(num); break; case 'q': exit(0); } } /*++++++++++++++++++++++++++++*/ } /*++++++++++++++++++++++++++++*/ } /// ... End of main()

© 1995-2005 University of Illinois, Urbana-Champaign. All rights reserved.  Fri Mar 25 23:05:44 2005