void NoximHMNoCTest::testBuildHoneycombMesh() {
/*
sc_signal<bool> enable;
cout << "enable " << enable.read() << endl;
cout << "@" << sc_time_stamp() <<" Asserting reset\n" << endl;
enable.write(1);
enable =1;
sc_start();
cout << "enable " << enable.read() << endl;
*/
NoximHMNoC *n = new NoximHMNoC("NoC");
cout << "Test: NoximHMNoc intialized" << endl;
// -y (dir px) = mz
NoximHMTile* py = NoximHexagon::getTile(0,1,0);
test_(py!=NULL);
NoximHMTile* mz = NoximHexagon::getTile(1,1,0);
test_(mz!=NULL);
/*
cout << "py->req_tx[DIRECTION_PX] = " << py->req_tx[DIRECTION_PX].read() << endl;
cout << "mz->req_rx[DIRECTION_MX] = " << mz->req_rx[DIRECTION_MX].read() << endl;
cout << "n->req_to_px[1][1][0] = " << n->req_to_px[1][1][0] << endl;
n->req_to_px[1][1][0]=1;
sc_start();
cout << "n->req_to_px[1][1][0] = " << n->req_to_px[1][1][0] << endl;
cout << "py->req_tx[DIRECTION_PX] = " << py->req_tx[DIRECTION_PX].read() << endl;
cout << "mz->req_rx[DIRECTION_MX] = " << mz->req_rx[DIRECTION_MX].read() << endl;
*/
// test_((&(py->req_tx[DIRECTION_PX])) == (&(mz->req_rx[DIRECTION_MX])));
}
void test_throw_ex()
{
v8pp::context context;
test_(context, "Error message", v8::Exception::Error);
test_(context, "RangeError message", v8::Exception::RangeError);
test_(context, "ReferenceError message", v8::Exception::ReferenceError);
test_(context, "SyntaxError message", v8::Exception::SyntaxError);
test_(context, "TypeError message", v8::Exception::TypeError);
}
vector<int> NoximDVFSUnitTest::runAndAssertRouting(const int srcId, const int dstId, vector<int> expected){
vector<int> ret = runRouting(srcId, dstId);
printVector(expected);
test_(expected.size() == ret.size());
for (int i = 0; i < ret.size(); i++){
if(expected[i]!=ret[i]){
cout << "expected: " << expected[i] << ", but actual: " << ret[i] << endl;
test_(expected[i]==ret[i]);
}
}
return ret;
}
void NoximDVFSUnitTest::testDirWithMinQValue(){
NoximDVFSUnit* dvfs0 = NoximDVFSUnit::getDVFS(0);
// dst id = 0 ==> local
int dir = dvfs0->getDirWithMinQValue(0);
test_(DIRECTION_LOCAL == dir);
dir = dvfs0->getDirWithMinQValue(3);
test_(DIRECTION_EAST == dir);
dir = dvfs0->getDirWithMinQValue(8);
test_(-1 == dir);
}
void run(void) override final
{
uint32_t i = ITERS;
do
{
std::shared_ptr<eve::thr::spinlock> test_(
std::move(std::make_shared<eve::thr::spinlock>()));
} while (i-- > 0);
}
int ACE_TMAIN (int argc, ACE_TCHAR *argv[])
{
// Start the Test task
TestTask test_ (argc, argv);
if (test_.activate() == -1)
{
ACE_ERROR_RETURN ((LM_ERROR, "Unable to start test task.\n"), -1);
}
// Wait tasks finish.
test_.thr_mgr ()->wait();
return 0;
}
int main(int argc, char **argv)
{
printf("test.c main\n");
putenv("LD_LIBRARY_PATH=/usr/local/pgplot");
test_();
/*(FILE *fp;
printf("ok.%s\n", __TIME__);
fp = fopen("/tmp/test.txt", "w");
fprintf(fp, "blah blah blah: %s\n", __TIME__);
fclose(fp);*/
return(0);
}
bool UnitTest::Run(TestInfo& info)
{
//start mem
//start timer
info.success = false;
try
{
info.success = test_();
}
catch (const std::exception&)
{
//info.bytesLeaked = get allocated bytes
//info.time = get elapsed time
info.reason = Exception;
return info.success;
}
//end timer
//end mem
return info.success;
}
void short_path(AdjMatrix *G)
{
int begin;
int end;
int i;
int j;
int k;
int tmp;
int distance[MAX];
int path[MAX][MAX] = {{0}};
int mindistance;
printf("请输入起始点编号\n");
scanf("%d", &begin);
printf("请输入目的地编号\n");
scanf("%d", &end);
for (i = 1; i <= G->vexnum; i++)
{
distance[i] = G->arcs[begin][i]; //到各点距离
if (G->arcs[begin][i] != INT_MAX)
{
path[i][1] = begin; //若可以到达，计入path
}
}
path[begin][0] = 1;
for (i = 2; i <= G->vexnum; i++)
{
mindistance = INT_MAX;
for (j = 1; j <= G->vexnum; j++)
{
if (!path[j][0] && (distance[j] < mindistance))
{
k = j;
mindistance = distance[j];
}
}
test(distance, G->vexnum);
if (mindistance == INT_MAX)
{
return ;
}
path[k][0] = 1;
for (j = 1; j <= G->vexnum; j++)
{
if (!path[j][0] && G->arcs[k][j] < INT_MAX && (distance[k] + G->arcs[k][j] < distance[j]))
{
distance[j] = distance[k] + G->arcs[k][j];
tmp = 1;
while (path[k][tmp] != 0)
{
path[j][tmp] = path[k][tmp];
tmp++;
}
path[j][tmp] = k;
path[j][tmp + 1] = 0;
test_(path, G->vexnum, G->vexnum);
}
}
}
printf("%c ----> %c最短路线为:", G->vex[begin], G->vex[end]);
// for (i = 1; i <= G->vexnum; i++)
// {
// for (j = G->vexnum; path[j][0] == 0; j--)
// {
// ;
// }
// j--;
for (k = 1; path[end][k] != 0; k++)
// for (k = 1; path[j][k] != 0; k++)
{
// printf("j = %d, k = %d\n", j , k);
// printf("%5d ", path[j][k]);
// printf("%c->", G->vex[path[j][k]]);
printf("%c->", G->vex[path[end][k]]);
}
// if (i == end)
// {
printf("%c, 距离为%d\n", G->vex[end], distance[end]);
// break;
// }
// }
}
void run()
{
IntPair ip;
test_(ip.getX() == 0 && ip.getY() == 0);
IntPair ip2(3,-5);
test_(ip2.getX() == 3 && ip2.getY() == -5);
IntPair ip3 = ip2;
test_(ip3.getX() == 3 && ip3.getY() == -5);
IntPair ip4 = ip3 + ip2;
test_(ip4.getX() == 6 && ip4.getY() == -10);
test_(ip2 == ip4 - ip3);
test_(ip3 < ip4);
IntPair ip5(6,-4);
test_(ip5 > ip4);
test_(ip4 < ip5);
test_((ip4 + ip5) == (ip5 + ip4));
Direction left = Direction(Direction::LEFT);
test_(*(left.getDirPair()) == IntPair(-1,0));
test_(*(left.getDirPair()) < IntPair(0,0));
Direction right = Direction();
test_(*(right.getDirPair()) == IntPair(1,0));
//Direction::initialize();
int n = Direction::getRandom().getNo();
test_(n < 4 && n >=0);
n = Direction::getRandom().getNo();
test_(n < 4 && n >=0);
n = Direction::getRandom().getNo();
test_(n < 4 && n >=0);
n = Direction::getRandom().getNo();
test_(n < 4 && n >=0);
n = Direction::getRandom().getNo();
test_(n < 4 && n >=0);
n = Direction::getRandomNew(Direction(Direction::RIGHT)).getNo();
test_(n < 4 && n >=0 && n != 2);
n = Direction::getRandomNew(Direction::UP).getNo();
test_(n < 4 && n >=0 && n != 3);
n = Direction::getRandomNew(Direction::LEFT).getNo();
test_(n < 4 && n >=0 && n != 0);
n = Direction::getRandomNew(Direction::DOWN).getNo();
test_(n < 4 && n >=0 && n != 1);
ip4.print();
Direction up = Direction(IntPair(0,1));
test_(up.getNo() == Direction::UP);
left = Direction(IntPair(-1,0));
test_(left.getNo() == Direction::LEFT);
Direction child = Direction::getFirstChild(up);
test_(child.getNo() == Direction::RIGHT);
Direction child2 = Direction::getSecondChild(up);
test_(child2.getNo() == Direction::UP);
child2 = Direction::getNextChild(up, child);
test_(child2.getNo() == Direction::UP);
Direction child3 = Direction::getThirdChild(up);
test_(child3.getNo() == Direction::LEFT);
child3 = Direction::getNextChild(up, child2);
test_(child3.getNo() == Direction::LEFT);
Direction down(Direction::DOWN);
child = Direction::getFirstChild(down);
test_(child.getNo() == Direction::LEFT);
child2 = Direction::getSecondChild(down);
test_(child2.getNo() == Direction::DOWN);
child2 = Direction::getNextChild(down, child);
test_(child2.getNo() == Direction::DOWN);
child3 = Direction::getThirdChild(down);
test_(child3.getNo() == Direction::RIGHT);
child = Direction::getFirstChild(left);
test_(child.getNo() == Direction::UP);
child = Direction::getNextChild(left, child);
test_(child.getNo() == Direction::LEFT);
child = Direction::getNextChild(left, child);
test_(child.getNo() == Direction::DOWN);
right = Direction(IntPair(1,0));
child = Direction::getFirstChild(right);
test_(child.getNo() == Direction::DOWN);
child2 = Direction::getSecondChild(right);
test_(child2.getNo() == Direction::RIGHT);
child2 = Direction::getNextChild(right, child);
test_(child2.getNo() == Direction::RIGHT);
child3 = Direction::getThirdChild(right);
test_(child3.getNo() == Direction::UP);
IntPair ip10 = IntPair(-1,+20);
IntPair ip11 = IntPair::parseIntPair("(-1,+20)");
test_(ip10 == ip11);
}
bool operator[](size_type pos) const { return test_(pos); } //[gps]
void NoximDVFSUnitTest::testRoutingQ(){
cout << "--------------------Testing NoximDVFSUnit-----------------------" << endl;
NoximGlobalParams::mesh_dim_x = 2;
NoximGlobalParams::mesh_dim_y = 2;
NoximGlobalParams::verbose_mode = VERBOSE_HIGH;
NoximNoC* noc = new NoximNoC("NoximNoC");
// 0 -> ?
vector<int> ret = runRouting(0,1);
test_(ret.size()==1);
test_(DIRECTION_EAST == ret[0]);
ret = runRouting(0,2);
test_(ret.size()==1);
test_(DIRECTION_SOUTH == ret[0]);
ret = runRouting(0,3);
test_(ret.size()==2);
test_(DIRECTION_EAST==ret[0]);
test_(DIRECTION_SOUTH==ret[1]);
// 1 -> ?
ret = runRouting(1, 0);
test_(ret.size()==1);
test_(DIRECTION_WEST == ret[0]);
ret = runRouting(1, 2);
test_(ret.size()==2);
test_(DIRECTION_SOUTH == ret[0]);
test_(DIRECTION_WEST == ret[1]);
ret = runRouting(1, 3);
test_(ret.size()==1);
test_(DIRECTION_SOUTH == ret[0]);
// 2 -> ?
ret = runRouting(2, 0);
test_(ret.size() == 1);
test_(DIRECTION_NORTH == ret[0]);
ret = runRouting(2, 1);
test_(ret.size() == 2);
test_(DIRECTION_NORTH == ret[0]);
test_(DIRECTION_EAST == ret[1]);
ret = runRouting(2, 3);
test_(ret.size() == 1);
test_(DIRECTION_EAST == ret[0]);
// 3 -> ?
ret = runRouting(3,0);
test_(ret.size()==2);
test_(DIRECTION_NORTH == ret[0]);
test_(DIRECTION_WEST == ret[1]);
ret = runRouting(3, 1);
test_(ret.size() == 1);
test_(ret[0] == DIRECTION_NORTH);
ret = runRouting(3, 2);
test_(ret.size() == 1);
test_(ret[0] == DIRECTION_WEST);
}
void NoximDVFSUnitTest::testGetQValue(){
NoximDVFSUnit* dvfs3 = NoximDVFSUnit::getDVFS(3);
test_(0.0 == dvfs3->getQValue(3,DIRECTION_EAST));
test_(3.0 == dvfs3->getQValue(1,DIRECTION_WEST));
}
void TestTest::testSchemeBuffer()
{
// std::shared_ptr<schememetadata> meta( new schememetadata(QString("META_RENKOUGAIYAO")) );
std::shared_ptr<schememetadata> meta = std::make_shared<schememetadata>(schememetadata::Category::RenKouGaiYao);
std::shared_ptr<schememetadata> meta1( new schememetadata(QString("META_FUFUZINV")));
std::shared_ptr<SchemeBuffer> buffer(new SchemeBuffer);
// config.read("E:/renkou/sourcecode/evaluate_by_owensss/config.txt");
// qDebug() << "error!";
// return -1;
// }
// SchemePtr test(new Scheme(meta, buffer, "上海农业人口概要_回归分释_多龄_农d11p15_非d11p15_z"));
// SchemePtr test1(new Scheme(meta, buffer, "上海农业人口概要_回归分释_多龄_农d11p20_非d11p20_z"));
// SchemePtr test2(new Scheme(meta, buffer, "上海农业人口概要_回归分释_多龄_农d11p25_非d11p25_z"));
// SchemePtr test3(new Scheme(meta, buffer, "上海农业人口概要_回归分释_多龄_农d11p30_非d11p30_z"));
// SchemePtr test4(new Scheme(meta, buffer, "上海农业人口概要_回归分释_多龄_农d11p35_非d11p35_z"));
// SchemePtr test5(new Scheme(meta, buffer, "上海农业人口概要_回归分释_多龄_农d11p40_非d11p40_z"));
// SchemePtr test6(new Scheme(meta, buffer, "上海农业人口概要_回归分释_多龄_农d11p45_非d11p45_z"));
SchemePtr test(new Scheme(meta, buffer, "安徽城镇人口概要_回归分释_多龄_农d11p15_非d11p15_z"));
SchemePtr test8(new Scheme(meta, buffer, "安徽城镇人口概要_回归分释_多龄_农d11p20_非d11p20_z"));
// SchemePtr test_(new Scheme(meta1, buffer, "上海农业夫妇子女_回归分释_多龄_农d11p15_非d11p15_z"));
// SchemePtr test1_(new Scheme(meta1, buffer, "上海农业夫妇子女_回归分释_多龄_农d11p20_非d11p20_z"));
// SchemePtr test2_(new Scheme(meta1, buffer, "上海农业夫妇子女_回归分释_多龄_农d11p25_非d11p25_z"));
// SchemePtr test3_(new Scheme(meta1, buffer, "上海农业夫妇子女_回归分释_多龄_农d11p30_非d11p30_z"));
// SchemePtr test4_(new Scheme(meta1, buffer, "上海农业夫妇子女_回归分释_多龄_农d11p35_非d11p35_z"));
// SchemePtr test5_(new Scheme(meta1, buffer, "上海农业夫妇子女_回归分释_多龄_农d11p40_非d11p40_z"));
// SchemePtr test6_(new Scheme(meta1, buffer, "上海农业夫妇子女_回归分释_多龄_农d11p45_非d11p45_z"));
SchemePtr test_(new Scheme(meta1, buffer, "安徽城镇夫妇子女_回归分释_多龄_农d11p15_非d11p15_z"));
SchemePtr test8_(new Scheme(meta1, buffer, "安徽城镇夫妇子女_回归分释_多龄_农d11p20_非d11p20_z"));
qDebug() << test->getMetadata()->rowCount() << meta->rowSize() << meta->size();
qDebug() << "startYear" << meta->startYear() << "endYear" << meta->endYear();
qDebug() << meta->colCount() << meta->name();
try {
qDebug() << meta->rowSize()<<meta->colSize (1)<<meta->rowCount ();
qDebug() << meta->colCount ()<<meta->colAt (2).getindicator ()
<< meta->colAt (QString("总人口")).getfield_name ()<< meta->colOffset (5)
<< meta->operator[](2).getfield_dec();
// qDebug() << &(*meta) << &(*buffer);
// <<meta->hasCol(999) << meta->hasRow (2550);
// for (int i = 1; i<=meta->colCount(); ++i)
qDebug() << "name" << test->getName();
qDebug() << test->getInstance(2013).getString(2);
dbtest(test, 2014, 115);
// dbtest(test1, 2014, 113);
// dbtest(test2, 2014, 115);
// dbtest(test3, 2014, 115);
// dbtest(test4, 2014, 115);
// dbtest(test5, 2014, 115);
// dbtest(test6, 2014, 115);
// dbtest(test7, 2014, 115);
dbtest(test8, 2014, 115);
// dbtest(test4, 2014, 115);
// dbtest(test5, 2014, 115);
/**/
qDebug() << "name" << test_->getName();
qDebug() << test_->getInstance(2013).getString(2);
qDebug() << test_->getInstance(2014)[3];
// qDebug() << test1_->getInstance(2014)[30];
// qDebug() << test2_->getInstance(2014)[30];
// qDebug() << test3_->getInstance(2014)[30];
// qDebug() << test4_->getInstance(2014)[3];
// qDebug() << test5_->getInstance(2014)[3];
// qDebug() << test6_->getInstance(2014)[3];
// qDebug() << test7_->getInstance(2014)[3];
qDebug() << test8_->getInstance(2014)[3];
// qDebug() << test4_->getInstance(2014)[3];
// qDebug() << test5_->getInstance(2014)[3];
// qDebug() << test7->getInstance(2014)[3];
qDebug() << "name" << test->getName();
qDebug() << test->getInstance(2013).getString(2);
dbtest(test, 2014, 115);
// dbtest(test1, 2014, 113);
// dbtest(test2, 2014, 115);
// dbtest(test3, 2014, 115);
// dbtest(test4, 2014, 115);
// dbtest(test5, 2014, 115);
// dbtest(test6, 2014, 115);
// dbtest(test7, 2014, 115);
dbtest(test8, 2014, 115);
// dbtest(test4, 2014, 115);
// dbtest(test5, 2014, 115);
/**/
qDebug() << "done";
} catch (const ValueNotExist&e) {
qDebug() << e.value();
} catch (const ColNotExist& e) {
qDebug() << e.value() << e.index();
} catch (const RecordNotExist& e) {
qDebug() << "record not exist" << e.name();
}
QVERIFY2(true, "Failure");
}
int main(){
test_();
return 0;
}
void test(double x)
{
printf("%7.2f %10.6f\n", x, test_(x));
}
