X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=Client%20Applications%2Frti2rto%2Frti2rto.cpp;h=ba7f16315e6f4f7531b33082087db2e14b27db0e;hb=86bbf0fd5ba4e07d3279b4179fd8fc808198eaae;hp=bf08be3a58a1909cf49b77c053e55f6f6897057d;hpb=bcfd4a8e2d07b3a0fce0bc8e471d8562b142b7e0;p=freerainbowtables

diff --git a/Client Applications/rti2rto/rti2rto.cpp b/Client Applications/rti2rto/rti2rto.cpp
index bf08be3..ba7f163 100644
--- a/Client Applications/rti2rto/rti2rto.cpp	
+++ b/Client Applications/rti2rto/rti2rto.cpp	
@@ -87,6 +87,7 @@ void ConvertRainbowTable(string sPathName, string sResultFileName, string sType)
 		sFileName = sPathName.substr(nIndex + 1);
 	else
 		sFileName = sPathName;
+
 	// Info
 	printf("%s:\n", sFileName.c_str());
 	FILE *fResult = fopen(sResultFileName.c_str(), "wb");
@@ -107,15 +108,28 @@ void ConvertRainbowTable(string sPathName, string sResultFileName, string sType)
 		printf("Invalid table type '%s'", sType.c_str());
 		return ;
 	}
-	RainbowChainCP* pChain = (RainbowChainCP*)mp.Allocate(reader->GetChainsLeft() * sizeof(RainbowChainCP), nAllocatedSize);
+	int size = reader->GetChainsLeft() * sizeof(RainbowChain);
+#ifdef _MEMORYDEBUG
+	printf("Starting allocation of %i bytes\n", size);
+#endif
+	RainbowChain* pChain = (RainbowChain*)mp.Allocate(size, nAllocatedSize);
+#ifdef _MEMORYDEBUG
+	printf("Finished. Got %i bytes\n", nAllocatedSize);
+#endif
 	if (pChain != NULL)
 	{
-		nAllocatedSize = nAllocatedSize / sizeof(RainbowChainCP) * sizeof(RainbowChainCP);		// Round to boundary
-		unsigned int nChains = nAllocatedSize / sizeof(RainbowChainCP);
+		nAllocatedSize = nAllocatedSize / sizeof(RainbowChain) * sizeof(RainbowChain);		// Round to boundary
+		unsigned int nChains = nAllocatedSize / sizeof(RainbowChain);
 		while(reader->GetChainsLeft() > 0)
 		{
+#ifdef _MEMORYDEBUG
+			printf("Grabbing %i chains from file\n", nChains);
+#endif
 			reader->ReadChains(nChains, pChain);
-			for(int i = 0; i < nChains; i++)
+#ifdef _MEMORYDEBUG
+			printf("Recieved %i chains from file\n", nChains);
+#endif
+			for(uint32 i = 0; i < nChains; i++)
 			{
 				fwrite(&pChain[i], 1, 16, fResult);
 			}
@@ -156,7 +170,7 @@ int main(int argc, char* argv[])
 		printf("no rainbow table found\n");
 		return 0;
 	}
-	for (int i = 0; i < vPathName.size(); i++)
+	for (uint32 i = 0; i < vPathName.size(); i++)
 	{
 		string sResultFile, sType;
 			
@@ -179,4 +193,4 @@ int main(int argc, char* argv[])
 		printf("\n");
 	}
 	return 0;
-}
\ No newline at end of file
+}