1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332
|
/* ****************************************************************************
* eID Middleware Project.
* Copyright (C) 2008-2009 FedICT.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License version
* 3.0 as published by the Free Software Foundation.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this software; if not, see
* http://www.gnu.org/licenses/.
**************************************************************************** */
#include <time.h>
#include <vector>
#include <string>
#include "user.h"
#include "report.h"
#include "diagengine.h"
#include "AnalyseSystemInfo.h"
#include "AnalyseDeviceInfo.h"
#include "AnalyseSoftwareInfo.h"
#include "AnalyseServiceInfo.h"
#include "AnalyseProcessInfo.h"
#include "AnalyseReaderDetectInfo.h"
#include "AnalyseCardDetectInfo.h"
#include "AnalyseMWFileInfo.h"
#include "AnalyseMWDetectInfo.h"
#include "AnalyseMWAccessInfo.h"
#include "AnalyseMWReaderlistInfo.h"
#include "AnalyseMWCardlistInfo.h"
#include "AnalysePCSCTimingInfo.h"
#include "AnalysePCSCDetectInfo.h"
#include "AnalyseSignPKCS11Info.h"
#ifdef WIN32
#include "AnalyseSignCSPInfo.h"
#endif
#include "AnalysePCSCReaderlistInfo.h"
#include "AnalysePCSCCardlistInfo.h"
#include "AnalysePCSCCardInfo.h"
#ifdef __APPLE__
#include "AnalyseSignTokendInfo.h"
#endif
////////////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////// PRIVATE FUNCTIONS DECLARATION ////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////// PUBLIC FUNCTIONS /////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////
DiagEngine::DiagEngine()
{
reportInit();
m_reportFinalizeOk = false;
//---------------------------------
// setup a list with all tests. The sequence of the list dictates the sequence of
// the tests in case all tests are requested at the same time.
//---------------------------------
Analysis* test = NULL;
test = new AnalyseSystemInfo;
m_availableTests.insert(m_availableTests.end(), test );
test = new AnalyseDeviceInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseSoftwareInfo;
m_availableTests.insert(m_availableTests.end(),test );
#ifdef WIN32
test = new AnalyseServiceInfo;
m_availableTests.insert(m_availableTests.end(),test );
#endif
test = new AnalyseProcessInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseReaderDetectInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalysePCSCTimingInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseCardDetectInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseMWCardlistInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseMWFileInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseMWDetectInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseMWReaderlistInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseMWAccessInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalysePCSCDetectInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalysePCSCReaderlistInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalysePCSCCardlistInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalysePCSCCardInfo;
m_availableTests.insert(m_availableTests.end(),test );
test = new AnalyseSignPKCS11Info;
m_availableTests.insert(m_availableTests.end(),test );
#ifdef WIN32
test = new AnalyseSignCSPInfo;
m_availableTests.insert(m_availableTests.end(),test );
#endif
#ifdef __APPLE__
test = new AnalyseSignTokendInfo;
m_availableTests.insert(m_availableTests.end(),test );
#endif
for (size_t idx=0;idx<m_availableTests.size();idx++)
{
m_availableTestNames.insert(m_availableTestNames.end(),m_availableTests.at(idx)->getTestName());
m_availableTestFriendlyNames.insert(m_availableTestFriendlyNames.end(),m_availableTests.at(idx)->getTestFriendlyName());
}
}
DiagEngine::~DiagEngine(void)
{
finalizeReport(); //Should be done to avoid to let temporary files behind
//---------------------------------
// remove all the test objects available
// do NOT remove the objects in the 'm_executeTests' because these
// are the same ptrs as we will be deleting
//---------------------------------
while (m_availableTests.size()>0)
{
Analysis* test=m_availableTests.at(m_availableTests.size()-1);
delete test;
m_availableTests.erase(m_availableTests.end()-1);
}
m_availableTests.clear();
m_availableTestNames.clear();
m_availableTestFriendlyNames.clear();
}
int DiagEngine::init(void)
{
int retVal = ENG_OK;
m_executeTests.clear();
//---------------------------------
// we must be Admin to be able to run this tool
//---------------------------------
bool bAdmin = false;
User_ID userID = CURRENT_USER_ID;
if ( DIAGLIB_OK != (retVal = userIsAdministrator(userID,&bAdmin)) )
{
return retVal;
}
if (!bAdmin)
{
return ENG_NO_ADMIN;
}
return retVal;
}
//------------------------------------------
// return the names of all available tests
//------------------------------------------
DiagEngine::tTestNames const& DiagEngine::getAvailableTestNames()
{
return m_availableTestNames;
}
DiagEngine::tTestNames const& DiagEngine::getTestFriendlyNames()
{
return m_availableTestFriendlyNames;
}
//------------------------------------------
// return the number of available tests
//------------------------------------------
size_t DiagEngine::getNrAvailableTests()
{
return m_availableTestNames.size();
}
//------------------------------------------
// return the number of requested tests
//------------------------------------------
size_t DiagEngine::getNrRequestedTests()
{
return m_executeTests.size();
}
size_t DiagEngine::checkTestRequested(std::string testName, tTestNames const& requestedTests)
{
bool bFound = false;
size_t idx = -1;
for (tTestNames::const_iterator it = requestedTests.begin()
;it != requestedTests.end()
;it++,idx++
)
{
if (*it==testName)
{
idx++;
bFound = true;
break;
}
}
if (bFound)
{
return idx;
}
return -1;
}
int DiagEngine::run(tTestNames const& requestedTests,tTestCallbackList const& callbackList)
{
m_executeTests.clear();
//--------------------------------------------------
// loop over the available tests and check if the test is requested.
// if the test is requested, then add at the end of the list of tests
// to execute
// In this way, we keep the test sequence as it is preset in the available tests
//--------------------------------------------------
for (size_t testIdx=0; testIdx<m_availableTestNames.size(); testIdx++)
{
size_t testNr = checkTestRequested(m_availableTestNames.at(testIdx),requestedTests);
if (-1!=testNr)
{
m_executeTests.insert(m_executeTests.end(),m_availableTests.at(testIdx));
m_executeCallbackList.insert(m_executeCallbackList.end(),NULL);
}
}
int result = DIAGLIB_OK;
//--------------------------------------------------
// loop over the requested tests and execute them
//--------------------------------------------------
size_t idx=0;
for (tTestList::const_iterator it = m_executeTests.begin()
;it!=m_executeTests.end()
;it++
)
{
(*it)->setCallback(callbackList.at(idx));
m_progressPercent = 0;
result = (*it)->run();
idx++;
}
return result;
}
int DiagEngine::getExecutionTime(std::string const& testName)
{
for (size_t idx=0;idx<m_executeTests.size();idx++)
{
if ( testName == m_executeTests.at(idx)->getTestName())
{
return m_executeTests.at(idx)->getExecutionTime();
}
}
return 0;
}
int DiagEngine::getExecutionTime(size_t testNr)
{
return m_availableTests.at(testNr)->getExecutionTime();
}
bool DiagEngine::testPassed(std::string const& testName)
{
for (size_t idx=0;idx<m_executeTests.size();idx++)
{
if ( testName == m_executeTests.at(idx)->getTestName())
{
return m_executeTests.at(idx)->testPassed();
}
}
return false;
}
int DiagEngine::finalizeReport(void)
{
int retVal=DIAGLIB_OK;
if(!m_reportFinalizeOk)
retVal= reportFinalize(NULL,NULL);
m_reportFinalizeOk = true; //Finalize only once but at least once
return retVal;
}
int DiagEngine::getReportFilename( std::wstring& reportFile,bool bAbstractOnly)
{
finalizeReport();
const wchar_t* file=NULL;
int retVal = reportGetFileName(&file,bAbstractOnly);
if (DIAGLIB_OK!=retVal)
{
return retVal;
}
reportFile.assign(file);
return retVal;
}
int DiagEngine::m_progressPercent = 0;
time_t DiagEngine::m_timeStamp = time(NULL);
////////////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////// PRIVATE FUNCTIONS ////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////
|