Commit 6361ccb5 authored by Ballabriga Clément's avatar Ballabriga Clément
Browse files

rename tests

parent b8654475
......@@ -1087,10 +1087,6 @@ PPLDomain PPLDomain::onMerge(const PPLDomain &r, bool widen) const {
* 2. Merge phase: this is the actual convex hull or widening, performed on the unified states.
*/
ASSERT(!trash.countOnes());
ASSERT(!r.trash.countOnes());
ASSERT(compare_reg.getType() == Ident::ID_INVALID);
ASSERT(r.compare_reg.getType() == Ident::ID_INVALID);
if (r.isBottom()) {
#ifdef POLY_DEBUG
......@@ -1104,6 +1100,10 @@ PPLDomain PPLDomain::onMerge(const PPLDomain &r, bool widen) const {
#endif
return r;
}
ASSERT(!trash.countOnes());
ASSERT(!r.trash.countOnes());
ASSERT(compare_reg.getType() == Ident::ID_INVALID);
ASSERT(r.compare_reg.getType() == Ident::ID_INVALID);
#ifdef POLY_DEBUG
cout << "Non-trivial merge, type=" << (widen ? "widening" : "convex-hull") << endl;
......
......@@ -499,7 +499,7 @@ void PolyAnalysis::processWorkSpace(WorkSpace *ws) {
processCFG(*entry, dummy, bounds, true /* is entry */, false /* summarize */);
cout << "PARAMETRIC LOOP BOUNDS: " << endl;
for (MyHTable<int, PPLDomain>::PairIterator it(bounds); it; it++) {
cout << "MAX_ITERATION(" << (*it).fst << "): " << (*it).snd << endl;
cout << "linear bound expr for (" << (*it).fst << "): " << (*it).snd << endl;
PPL::Coefficient binf_n, binf_d, bsup_n, bsup_d;
Ident id((*it).fst, Ident::ID_LOOP);
if (!(*it).snd.hasIdent(id)) {
......@@ -521,7 +521,7 @@ void PolyAnalysis::processWorkSpace(WorkSpace *ws) {
if (LOOP_HEADER(bb)) {
MAX_ITERATION(bb) = static_bounds[bb->id()];
cout << "[" << (*iter2)->name() << "]"
<< "MAX_ITERATION(" << bb->id() << "): " << MAX_ITERATION(bb) << endl;
<< "MAX_ITERATION(" << bb->id() << ") = " << MAX_ITERATION(bb) << endl;
/*
cout << "[" << (*iter2)->name() << "]"
<< "TOTAL_ITERATION(" << bb->id() << ") = " << TOTAL_ITERATION(bb) << endl;
......
[main]MAX_ITERATION(2) = 5
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 10
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 15
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 5
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 6
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 10
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(5) = 10
[main]TOTAL_ITERATION(5) = -1
[main]MAX_ITERATION(2) = 10
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(5) = 40
[main]TOTAL_ITERATION(5) = -1
[main]MAX_ITERATION(2) = 10
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(6) = 10
[main]TOTAL_ITERATION(6) = -1
[main]MAX_ITERATION(2) = 10
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 21
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 21
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 42
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(3) = 26
[main]TOTAL_ITERATION(3) = -1
[main]MAX_ITERATION(2) = 10
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(4) = 10
[main]TOTAL_ITERATION(4) = -1
[bar]MAX_ITERATION(12) = 42
[bar]TOTAL_ITERATION(12) = -1
[main]MAX_ITERATION(2) = 15
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(2) = 10
[main]TOTAL_ITERATION(2) = -1
[main]MAX_ITERATION(3) = 10
[main]TOTAL_ITERATION(3) = -1
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment