/*
 Derived from source code of TrueCrypt 7.1a, which is
 Copyright (c) 2008-2012 TrueCrypt Developers Association and which is governed
 by the TrueCrypt License 3.0.

 Modifications and additions to the original source code (contained in this file)
 and all other portions of this file are Copyright (c) 2013-2017 IDRIX
 and are governed by the Apache License 2.0 the full text of which is
 contained in the file License.txt included in VeraCrypt binary and source
 code distribution packages.
*/

#include "System.h"
#include "Volume/EncryptionModeXTS.h"
#include "Main/GraphicUserInterface.h"
#include "BenchmarkDialog.h"

namespace VeraCrypt
{
	BenchmarkDialog::BenchmarkDialog (wxWindow *parent)
		: BenchmarkDialogBase (parent)
	{
		BenchmarkNoteStaticText->SetLabel (LangString["IDT_BOX_BENCHMARK_INFO"]);
		BenchmarkNoteStaticText->Wrap (RightSizer->GetSize().GetWidth());

		list <size_t> bufferSizes;
		bufferSizes.push_back (1 * BYTES_PER_MB);
		bufferSizes.push_back (5 * BYTES_PER_MB);
		bufferSizes.push_back (10 * BYTES_PER_MB);
		bufferSizes.push_back (50 * BYTES_PER_MB);
		bufferSizes.push_back (100 * BYTES_PER_MB);
		bufferSizes.push_back (200 * BYTES_PER_MB);
		bufferSizes.push_back (500 * BYTES_PER_MB);
		bufferSizes.push_back (1 * BYTES_PER_GB);

		foreach (size_t size, bufferSizes)
		{
			BufferSizeChoice->Append (Gui->SizeToString (size), (void *) size);
		}

		BenchmarkChoice->Select (0);
		BufferSizeChoice->Select (1);
		
		UpdateBenchmarkList ();
		
		wxTextValidator validator (wxFILTER_INCLUDE_CHAR_LIST);  // wxFILTER_NUMERIC does not exclude - . , etc.
		const wxChar *valArr[] = { L"0", L"1", L"2", L"3", L"4", L"5", L"6", L"7", L"8", L"9" };
		validator.SetIncludes (wxArrayString (array_capacity (valArr), (const wxChar **) &valArr));
		VolumePimText->SetValidator (validator);

		Layout();
		Fit();
		Center();
	}
	
	void BenchmarkDialog::UpdateBenchmarkList ()
	{
		int index = BenchmarkChoice->GetSelection ();
		if (index == 1)
		{
			// PRF case
			m_volumePimLabel->Show ();
			VolumePimText->Show ();
			
			BufferSizeChoice->Hide ();
			m_bufferSizeLabel->Hide ();
		}
		else
		{
			m_volumePimLabel->Hide ();
			VolumePimText->Hide ();
			
			BufferSizeChoice->Show ();
			m_bufferSizeLabel->Show ();
		}
		
		BenchmarkListCtrl->DeleteAllItems();
		BenchmarkListCtrl->DeleteAllColumns();
		
		if (index == 0)
		{
			// encryption case
			list <int> colPermilles;
			BenchmarkListCtrl->InsertColumn (ColumnAlgorithm, LangString["ALGORITHM"], wxLIST_FORMAT_LEFT, 1);
			colPermilles.push_back (322);

			BenchmarkListCtrl->InsertColumn (ColumnEncryption, LangString["ENCRYPTION"], wxLIST_FORMAT_RIGHT, 1);
			colPermilles.push_back (226);

			BenchmarkListCtrl->InsertColumn (ColumnDecryption, LangString["DECRYPTION"], wxLIST_FORMAT_RIGHT, 1);
			colPermilles.push_back (226);

			BenchmarkListCtrl->InsertColumn (ColumnMean, LangString["MEAN"], wxLIST_FORMAT_RIGHT, 1);
			colPermilles.push_back (226);
			
			Gui->SetListCtrlWidth (BenchmarkListCtrl, 62, false);
			Gui->SetListCtrlHeight (BenchmarkListCtrl, 14);
			Gui->SetListCtrlColumnWidths (BenchmarkListCtrl, colPermilles);
		}
		else if (index == 1)
		{
			// PRF case
			list <int> colPermilles;
			BenchmarkListCtrl->InsertColumn (ColumnAlgorithm, LangString["ALGORITHM"], wxLIST_FORMAT_LEFT, 1);
			colPermilles.push_back (322);

			BenchmarkListCtrl->InsertColumn (ColumnTime, LangString["TIME"], wxLIST_FORMAT_RIGHT, 1);
			colPermilles.push_back (226);

			BenchmarkListCtrl->InsertColumn (ColumnIterations, LangString["ITERATIONS"], wxLIST_FORMAT_RIGHT, 1);
			colPermilles.push_back (226);
			
			Gui->SetListCtrlWidth (BenchmarkListCtrl, 62, false);
			Gui->SetListCtrlHeight (BenchmarkListCtrl, 14);
			Gui->SetListCtrlColumnWidths (BenchmarkListCtrl, colPermilles);
		}
		else
		{
			// Hash case
			list <int> colPermilles;
			BenchmarkListCtrl->InsertColumn (ColumnAlgorithm, LangString["ALGORITHM"], wxLIST_FORMAT_LEFT, 1);
			colPermilles.push_back (322);

			BenchmarkListCtrl->InsertColumn (ColumnEncryption, LangString["MEAN"], wxLIST_FORMAT_RIGHT, 1);
			colPermilles.push_back (226);
			
			Gui->SetListCtrlWidth (BenchmarkListCtrl, 62, false);
			Gui->SetListCtrlHeight (BenchmarkListCtrl, 14);
			Gui->SetListCtrlColumnWidths (BenchmarkListCtrl, colPermilles);
		}
	}
	
	void BenchmarkDialog::OnBenchmarkChoiceSelected (wxCommandEvent& event)
	{
		UpdateBenchmarkList ();
		
		Layout();
		Fit();
	}

	void BenchmarkDialog::OnBenchmarkButtonClick (wxCommandEvent& event)
	{
		list <BenchmarkResult> results;

		wxBusyCursor busy;
		int opIndex = BenchmarkChoice->GetSelection ();
		Buffer buffer ((opIndex == 1)? sizeof (unsigned long) : (size_t) Gui->GetSelectedData <size_t> (BufferSizeChoice));
		
		if (opIndex == 1)
		{
			unsigned long pim = 0;
			if (!VolumePimText->GetValue().ToULong (&pim))
				pim = 0;
				
			memcpy (buffer.Ptr (), &pim, sizeof (unsigned long));
		}
		

		BenchmarkThreadRoutine routine(this, results, buffer, opIndex);
		Gui->ExecuteWaitThreadRoutine (this, &routine);

		BenchmarkListCtrl->DeleteAllItems();

		foreach (const BenchmarkResult &result, results)
		{
			vector <wstring> fields (BenchmarkListCtrl->GetColumnCount());

			fields[ColumnAlgorithm] = result.AlgorithmName;
			if (opIndex == 0)
			{
				fields[ColumnEncryption] = Gui->SpeedToString (result.EncryptionSpeed);
				fields[ColumnDecryption] = Gui->SpeedToString (result.DecryptionSpeed);
				fields[ColumnMean] = Gui->SpeedToString (result.MeanSpeed);
			}
			else if (opIndex == 1)
			{
				fields[ColumnTime] = wxString::Format (wxT("%llu ms"), (unsigned long long) result.Time);
				fields[ColumnIterations] = wxString::Format (wxT("%llu"), (unsigned long long) result.Iterations);
			}
			else
			{
				fields[ColumnHashMean] = Gui->SpeedToString (result.MeanSpeed);
			}

			Gui->AppendToListCtrl (BenchmarkListCtrl, fields);
		}

		BenchmarkListCtrl->SetColumnWidth(0, wxLIST_AUTOSIZE);
		wxSize minSize = BenchmarkListCtrl->GetBestSize ();
		minSize.IncBy (10, 20);
		BenchmarkListCtrl->SetMinSize(minSize);
		Layout ();
		Fit();
	}

	void BenchmarkDialog::DoBenchmark (list<BenchmarkResult>& results, Buffer& buffer, int opIndex)
	{
		try
		{
			if (opIndex == 0)
			{
				EncryptionAlgorithmList encryptionAlgorithms = EncryptionAlgorithm::GetAvailableAlgorithms();
				foreach (shared_ptr <EncryptionAlgorithm> ea, encryptionAlgorithms)
				{
					if (!ea->IsDeprecated())
					{
						BenchmarkResult result;
						result.AlgorithmName = ea->GetName(true);

						Buffer key (ea->GetKeySize());
						ea->SetKey (key);

						shared_ptr <EncryptionMode> xts (new EncryptionModeXTS);
						xts->SetKey (key);
						ea->SetMode (xts);

						wxLongLong startTime = wxGetLocalTimeMillis();

						// CPU "warm up" (an attempt to prevent skewed results on systems where CPU frequency gradually changes depending on CPU load).
						do
						{
							ea->EncryptSectors (buffer, 0, buffer.Size() / ENCRYPTION_DATA_UNIT_SIZE, ENCRYPTION_DATA_UNIT_SIZE);
						}
						while (wxGetLocalTimeMillis().GetValue() - startTime.GetValue() < 20);

						uint64 size = 0;
						uint64 time;
						startTime = wxGetLocalTimeMillis();

						do
						{
							ea->EncryptSectors (buffer, 0, buffer.Size() / ENCRYPTION_DATA_UNIT_SIZE, ENCRYPTION_DATA_UNIT_SIZE);
							size += buffer.Size();
							time = (uint64) (wxGetLocalTimeMillis().GetValue() - startTime.GetValue());
						}
						while (time < 100);

						result.EncryptionSpeed = size * 1000 / time;

						startTime = wxGetLocalTimeMillis();
						size = 0;

						do
						{
							ea->DecryptSectors (buffer, 0, buffer.Size() / ENCRYPTION_DATA_UNIT_SIZE, ENCRYPTION_DATA_UNIT_SIZE);
							size += buffer.Size();
							time = (uint64) (wxGetLocalTimeMillis().GetValue() - startTime.GetValue());
						}
						while (time < 100);

						result.DecryptionSpeed = size * 1000 / time;
						result.MeanSpeed = (result.EncryptionSpeed + result.DecryptionSpeed) / 2;

						bool inserted = false;
						for (list <BenchmarkResult>::iterator i = results.begin(); i != results.end(); ++i)
						{
							if (i->MeanSpeed < result.MeanSpeed)
							{
								results.insert (i, result);
								inserted = true;
								break;
							}
						}

						if (!inserted)
							results.push_back (result);
					}
				}
			}
			else if (opIndex == 1)
			{
				Buffer dk(MASTER_KEYDATA_SIZE);
				Buffer salt(64);
				const char *tmp_salt = {"\x00\x11\x22\x33\x44\x55\x66\x77\x88\x99\xAA\xBB\xCC\xDD\xEE\xFF\x01\x23\x45\x67\x89\xAB\xCD\xEF\x00\x11\x22\x33\x44\x55\x66\x77\x88\x99\xAA\xBB\xCC\xDD\xEE\xFF\x01\x23\x45\x67\x89\xAB\xCD\xEF\x00\x11\x22\x33\x44\x55\x66\x77\x88\x99\xAA\xBB\xCC\xDD\xEE\xFF"};
				unsigned long pim;
				Pkcs5KdfList prfList = Pkcs5Kdf::GetAvailableAlgorithms (false);
				VolumePassword password ((const byte*) "passphrase-1234567890", 21);

				memcpy (&pim, buffer.Ptr (), sizeof (unsigned long));
				memcpy (salt.Ptr(), tmp_salt, 64);
				
				foreach (shared_ptr <Pkcs5Kdf> prf, prfList)
				{
					if (!prf->IsDeprecated())
					{
						BenchmarkResult result;
						result.AlgorithmName = prf->GetName ();
						result.Iterations = (uint64) prf->GetIterationCount (pim);

						uint64 time;
						wxLongLong startTime = wxGetLocalTimeMillis();
						
						for (int i = 1; i <= 2; i++) 
						{
							prf->DeriveKey (dk, password, pim, salt);
						}
						
						time = (uint64) (wxGetLocalTimeMillis().GetValue() - startTime.GetValue());

						result.Time = time / 2;
				
						bool inserted = false;
						for (list <BenchmarkResult>::iterator i = results.begin(); i != results.end(); ++i)
						{
							if (i->Time > result.Time)
							{
								results.insert (i, result);
								inserted = true;
								break;
							}
						}

						if (!inserted)
							results.push_back (result);							
					}
				}
				
			}
			else
			{
				Buffer digest (1024);
				HashList hashAlgorithms = Hash::GetAvailableAlgorithms ();
				foreach (shared_ptr <Hash> hash, hashAlgorithms)
				{
					if (!hash->IsDeprecated())
					{
						BenchmarkResult result;
						result.AlgorithmName = hash->GetName ();
						
						uint64 size = 0;
						uint64 time;
						wxLongLong startTime = wxGetLocalTimeMillis();
						
						// CPU "warm up" (an attempt to prevent skewed results on systems where CPU frequency gradually changes depending on CPU load).
						do
						{
							hash->Init ();
							hash->ProcessData (digest);
							hash->GetDigest (digest);
						}
						while (wxGetLocalTimeMillis().GetValue() - startTime.GetValue() < 100);


						startTime = wxGetLocalTimeMillis();
						do
						{
							hash->Init ();
							hash->ProcessData (buffer);
							hash->GetDigest (digest);
							time = (uint64) (wxGetLocalTimeMillis().GetValue() - startTime.GetValue());
							size += buffer.Size ();
						}
						while (time < 2000);

						result.MeanSpeed = size * 1000 / time;

						bool inserted = false;
						for (list <BenchmarkResult>::iterator i = results.begin(); i != results.end(); ++i)
						{
							if (i->MeanSpeed < result.MeanSpeed)
							{
								results.insert (i, result);
								inserted = true;
								break;
							}
						}

						if (!inserted)
							results.push_back (result);
						
					}
				}
			}
		}
		catch (exception &e)
		{
			Gui->ShowError (e);
		}
	}
}
 href='#n238'>238</a>
<a id='n239' href='#n239'>239</a>
<a id='n240' href='#n240'>240</a>
<a id='n241' href='#n241'>241</a>
<a id='n242' href='#n242'>242</a>
<a id='n243' href='#n243'>243</a>
<a id='n244' href='#n244'>244</a>
<a id='n245' href='#n245'>245</a>
<a id='n246' href='#n246'>246</a>
<a id='n247' href='#n247'>247</a>
<a id='n248' href='#n248'>248</a>
<a id='n249' href='#n249'>249</a>
<a id='n250' href='#n250'>250</a>
<a id='n251' href='#n251'>251</a>
<a id='n252' href='#n252'>252</a>
<a id='n253' href='#n253'>253</a>
<a id='n254' href='#n254'>254</a>
<a id='n255' href='#n255'>255</a>
<a id='n256' href='#n256'>256</a>
<a id='n257' href='#n257'>257</a>
<a id='n258' href='#n258'>258</a>
<a id='n259' href='#n259'>259</a>
<a id='n260' href='#n260'>260</a>
<a id='n261' href='#n261'>261</a>
<a id='n262' href='#n262'>262</a>
<a id='n263' href='#n263'>263</a>
<a id='n264' href='#n264'>264</a>
<a id='n265' href='#n265'>265</a>
<a id='n266' href='#n266'>266</a>
<a id='n267' href='#n267'>267</a>
<a id='n268' href='#n268'>268</a>
<a id='n269' href='#n269'>269</a>
<a id='n270' href='#n270'>270</a>
<a id='n271' href='#n271'>271</a>
<a id='n272' href='#n272'>272</a>
<a id='n273' href='#n273'>273</a>
<a id='n274' href='#n274'>274</a>
<a id='n275' href='#n275'>275</a>
<a id='n276' href='#n276'>276</a>
<a id='n277' href='#n277'>277</a>
<a id='n278' href='#n278'>278</a>
<a id='n279' href='#n279'>279</a>
<a id='n280' href='#n280'>280</a>
<a id='n281' href='#n281'>281</a>
<a id='n282' href='#n282'>282</a>
<a id='n283' href='#n283'>283</a>
<a id='n284' href='#n284'>284</a>
<a id='n285' href='#n285'>285</a>
<a id='n286' href='#n286'>286</a>
<a id='n287' href='#n287'>287</a>
<a id='n288' href='#n288'>288</a>
<a id='n289' href='#n289'>289</a>
<a id='n290' href='#n290'>290</a>
<a id='n291' href='#n291'>291</a>
<a id='n292' href='#n292'>292</a>
<a id='n293' href='#n293'>293</a>
<a id='n294' href='#n294'>294</a>
<a id='n295' href='#n295'>295</a>
<a id='n296' href='#n296'>296</a>
<a id='n297' href='#n297'>297</a>
<a id='n298' href='#n298'>298</a>
<a id='n299' href='#n299'>299</a>
<a id='n300' href='#n300'>300</a>
<a id='n301' href='#n301'>301</a>
<a id='n302' href='#n302'>302</a>
<a id='n303' href='#n303'>303</a>
<a id='n304' href='#n304'>304</a>
<a id='n305' href='#n305'>305</a>
<a id='n306' href='#n306'>306</a>
<a id='n307' href='#n307'>307</a>
<a id='n308' href='#n308'>308</a>
<a id='n309' href='#n309'>309</a>
<a id='n310' href='#n310'>310</a>
<a id='n311' href='#n311'>311</a>
<a id='n312' href='#n312'>312</a>
<a id='n313' href='#n313'>313</a>
<a id='n314' href='#n314'>314</a>
<a id='n315' href='#n315'>315</a>
<a id='n316' href='#n316'>316</a>
<a id='n317' href='#n317'>317</a>
<a id='n318' href='#n318'>318</a>
<a id='n319' href='#n319'>319</a>
<a id='n320' href='#n320'>320</a>
<a id='n321' href='#n321'>321</a>
<a id='n322' href='#n322'>322</a>
<a id='n323' href='#n323'>323</a>
<a id='n324' href='#n324'>324</a>
<a id='n325' href='#n325'>325</a>
<a id='n326' href='#n326'>326</a>
<a id='n327' href='#n327'>327</a>
<a id='n328' href='#n328'>328</a>
<a id='n329' href='#n329'>329</a>
<a id='n330' href='#n330'>330</a>
<a id='n331' href='#n331'>331</a>
<a id='n332' href='#n332'>332</a>
<a id='n333' href='#n333'>333</a>
<a id='n334' href='#n334'>334</a>
<a id='n335' href='#n335'>335</a>
<a id='n336' href='#n336'>336</a>
<a id='n337' href='#n337'>337</a>
<a id='n338' href='#n338'>338</a>
<a id='n339' href='#n339'>339</a>
<a id='n340' href='#n340'>340</a>
<a id='n341' href='#n341'>341</a>
<a id='n342' href='#n342'>342</a>
<a id='n343' href='#n343'>343</a>
<a id='n344' href='#n344'>344</a>
<a id='n345' href='#n345'>345</a>
<a id='n346' href='#n346'>346</a>
<a id='n347' href='#n347'>347</a>
<a id='n348' href='#n348'>348</a>
<a id='n349' href='#n349'>349</a>
<a id='n350' href='#n350'>350</a>
<a id='n351' href='#n351'>351</a>
<a id='n352' href='#n352'>352</a>
<a id='n353' href='#n353'>353</a>
<a id='n354' href='#n354'>354</a>
<a id='n355' href='#n355'>355</a>
<a id='n356' href='#n356'>356</a>
<a id='n357' href='#n357'>357</a>
<a id='n358' href='#n358'>358</a>
<a id='n359' href='#n359'>359</a>
<a id='n360' href='#n360'>360</a>
</pre></td>
<td class='lines'><pre><code>