From 384beffc39a00c97ff23a8149e62af5b1cffc0ae Mon Sep 17 00:00:00 2001 From: Nils Gladitz Date: Mon, 21 Oct 2013 19:55:14 +0200 Subject: CTest: added comments that describe the basic test sorting approach --- Source/CTest/cmCTestMultiProcessHandler.cxx | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/Source/CTest/cmCTestMultiProcessHandler.cxx b/Source/CTest/cmCTestMultiProcessHandler.cxx index 510d3c5..3dd446b 100644 --- a/Source/CTest/cmCTestMultiProcessHandler.cxx +++ b/Source/CTest/cmCTestMultiProcessHandler.cxx @@ -445,6 +445,8 @@ void cmCTestMultiProcessHandler::CreateTestCostList() priorityStack.push_back(TestSet()); TestSet &topLevel = priorityStack.back(); + // Add previously failed tests to the front of the cost list + // and queue other tests for further sorting for(TestMap::const_iterator i = this->Tests.begin(); i != this->Tests.end(); ++i) { @@ -460,6 +462,8 @@ void cmCTestMultiProcessHandler::CreateTestCostList() } } + // Repeatedly move dependencies of the tests on the current dependency level + // to the next level until no further dependencies exist. while(priorityStack.back().size()) { TestSet &previousSet = priorityStack.back(); @@ -480,8 +484,11 @@ void cmCTestMultiProcessHandler::CreateTestCostList() } } + // Remove the empty dependency level priorityStack.pop_back(); + // Reverse iterate over the different dependency levels (deepest first). + // Sort tests within each level by COST and append them to the cost list. for(std::list::reverse_iterator i = priorityStack.rbegin(); i != priorityStack.rend(); ++i) { -- cgit v0.12