Initial Commit
This commit is contained in:
266
database/FileZillaFTP/source/misc/ProcessorInfo.h
Normal file
266
database/FileZillaFTP/source/misc/ProcessorInfo.h
Normal file
@@ -0,0 +1,266 @@
|
||||
#ifndef PROCESSORINFO_H
|
||||
#define PROCESSORINFO_H
|
||||
|
||||
class CProcessorInfo
|
||||
{
|
||||
protected:
|
||||
|
||||
SYSTEM_INFO m_sysInfo;
|
||||
|
||||
public:
|
||||
CProcessorInfo(void)
|
||||
{
|
||||
::GetSystemInfo(&m_sysInfo);
|
||||
}
|
||||
|
||||
virtual ~CProcessorInfo(void)
|
||||
{
|
||||
}
|
||||
|
||||
CStdString GetProcessorName(void)
|
||||
{
|
||||
CStdString sRC;
|
||||
|
||||
CStdString sSpeed;
|
||||
CStdString sVendor;
|
||||
|
||||
// Get the processor speed info.
|
||||
HKEY hKey;
|
||||
LONG result = ::RegOpenKeyEx (HKEY_LOCAL_MACHINE, _T("Hardware\\Description\\System\\CentralProcessor\\0"), 0, KEY_QUERY_VALUE, &hKey);
|
||||
|
||||
// Check if the function has succeeded.
|
||||
if (result == ERROR_SUCCESS)
|
||||
{
|
||||
DWORD data;
|
||||
DWORD dataSize = sizeof(data);
|
||||
result = ::RegQueryValueEx (hKey, _T("~MHz"), NULL, NULL, (LPBYTE)&data, &dataSize);
|
||||
|
||||
if (result == ERROR_SUCCESS)
|
||||
{
|
||||
sSpeed.Format ( _T("Speed: %dMHz "), data);
|
||||
}
|
||||
else
|
||||
{
|
||||
sSpeed = _T("Speed: Unknown ");
|
||||
}
|
||||
|
||||
TCHAR vendorData [64];
|
||||
dataSize = sizeof (vendorData);
|
||||
|
||||
result = ::RegQueryValueEx (hKey, _T("VendorIdentifier"), NULL, NULL, (LPBYTE)vendorData, &dataSize);
|
||||
|
||||
if (result == ERROR_SUCCESS)
|
||||
{
|
||||
sVendor.Format ( _T("Vendor: %s "), vendorData);
|
||||
}
|
||||
else
|
||||
{
|
||||
sVendor = _T("Vendor: Unknown ");
|
||||
}
|
||||
}
|
||||
|
||||
// Make sure to close the reg key
|
||||
RegCloseKey (hKey);
|
||||
|
||||
CStdString sType;
|
||||
switch (m_sysInfo.dwProcessorType)
|
||||
{
|
||||
case PROCESSOR_INTEL_386:
|
||||
sType = _T("Type: Intel 386 ");
|
||||
break;
|
||||
case PROCESSOR_INTEL_486:
|
||||
sType = _T("Type: Intel 486 ");
|
||||
break;
|
||||
case PROCESSOR_INTEL_PENTIUM:
|
||||
sType = _T("Type: Intel Pentium compatible");
|
||||
break;
|
||||
case PROCESSOR_MIPS_R4000:
|
||||
sType = _T("Type: MIPS ");
|
||||
break;
|
||||
case PROCESSOR_ALPHA_21064:
|
||||
sType = _T("Type: Alpha ");
|
||||
break;
|
||||
default:
|
||||
sType = _T("Type: Unknown ");
|
||||
break;
|
||||
}
|
||||
|
||||
CStdString sProcessors;
|
||||
sProcessors.Format( _T("Number Of Processors: %lu "), m_sysInfo.dwNumberOfProcessors);
|
||||
|
||||
CStdString sArchitecture;
|
||||
CStdString sProcessorLevel;
|
||||
CStdString sStepping;
|
||||
|
||||
switch(m_sysInfo.wProcessorArchitecture)
|
||||
{
|
||||
case PROCESSOR_ARCHITECTURE_INTEL:
|
||||
sArchitecture = _T("Architecture: Intel ");
|
||||
switch (m_sysInfo.wProcessorLevel)
|
||||
{
|
||||
case 3:
|
||||
sProcessorLevel = _T("Level: 80386");
|
||||
{
|
||||
int iSteppingLevel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %c%u "), iSteppingLevel, iStepping);
|
||||
}
|
||||
break;
|
||||
case 4:
|
||||
sProcessorLevel = _T("Level: 80486");
|
||||
{
|
||||
int iSteppingLevel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %c%u "), iSteppingLevel, iStepping);
|
||||
}
|
||||
break;
|
||||
case 5:
|
||||
sProcessorLevel = _T("Level: Pentium");
|
||||
{
|
||||
typedef BOOL (*PIPFP)(DWORD);
|
||||
PIPFP lpfn = (PIPFP)::GetProcAddress(GetModuleHandle( _T("kernel32.dll") ), "IsProcessorFeaturePresentA");
|
||||
if (lpfn)
|
||||
{
|
||||
if ((lpfn)(PF_MMX_INSTRUCTIONS_AVAILABLE))
|
||||
{
|
||||
sProcessorLevel += _T (" MMX");
|
||||
}
|
||||
}
|
||||
|
||||
int iModel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %u-%u "), iModel, iStepping);
|
||||
}
|
||||
break;
|
||||
case 6:
|
||||
sProcessorLevel = _T("Level: Pentium II/Pro");
|
||||
{
|
||||
int iModel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %u-%u "), iModel, iStepping);
|
||||
}
|
||||
break;
|
||||
default:
|
||||
sProcessorLevel.Format( _T("Level: Unknown %u "), m_sysInfo.wProcessorLevel);
|
||||
{
|
||||
int iModel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %u-%u "), iModel, iStepping);
|
||||
}
|
||||
break;
|
||||
}
|
||||
break;
|
||||
case PROCESSOR_ARCHITECTURE_MIPS:
|
||||
sArchitecture = "Architecture: MIPS ";
|
||||
switch(m_sysInfo.wProcessorLevel)
|
||||
{
|
||||
case 0004:
|
||||
sProcessorLevel = "Level: R4000 ";
|
||||
break;
|
||||
default:
|
||||
sProcessorLevel.Format( _T("Level: Unknown %u "), m_sysInfo.wProcessorLevel);
|
||||
break;
|
||||
}
|
||||
sStepping.Format( _T("Stepping: 00%u"), m_sysInfo.wProcessorRevision);
|
||||
break;
|
||||
case PROCESSOR_ARCHITECTURE_ALPHA:
|
||||
sArchitecture = "Architecture: Alpha ";
|
||||
sProcessorLevel.Format( _T("Level: %u "), m_sysInfo.wProcessorLevel);
|
||||
{
|
||||
int iModel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %c%u "), iModel, iStepping);
|
||||
}
|
||||
break;
|
||||
case PROCESSOR_ARCHITECTURE_PPC:
|
||||
sArchitecture = _T("Architecture: PowerPC ");
|
||||
switch(m_sysInfo.wProcessorLevel)
|
||||
{
|
||||
case 1:
|
||||
sProcessorLevel = _T("Level: 601 ");
|
||||
break;
|
||||
case 3:
|
||||
sProcessorLevel = _T("Level: 603 ");
|
||||
break;
|
||||
case 4:
|
||||
sProcessorLevel = _T("Level: 604 ");
|
||||
break;
|
||||
case 6:
|
||||
sProcessorLevel = _T("Level: 603+ ");
|
||||
break;
|
||||
case 9:
|
||||
sProcessorLevel = _T("Level: 604+ ");
|
||||
break;
|
||||
case 20:
|
||||
sProcessorLevel = _T("Level: 620 ");
|
||||
break;
|
||||
default:
|
||||
sProcessorLevel.Format( _T("Level: Unknown %u "), m_sysInfo.wProcessorLevel);
|
||||
break;
|
||||
}
|
||||
{
|
||||
int iModel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %u.%u "), iModel, iStepping);
|
||||
}
|
||||
break;
|
||||
case PROCESSOR_ARCHITECTURE_UNKNOWN:
|
||||
sArchitecture = "Architecture: Unknown ";
|
||||
sProcessorLevel.Format( _T("Level: Unknown %u "), m_sysInfo.wProcessorLevel);
|
||||
{
|
||||
int iModel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %u-%u "), iModel, iStepping);
|
||||
}
|
||||
break;
|
||||
default:
|
||||
sArchitecture.Format( _T("Architecture: Unknown %u "), m_sysInfo.wProcessorArchitecture);
|
||||
sProcessorLevel.Format( _T("Level: Unknown %u "), m_sysInfo.wProcessorLevel);
|
||||
{
|
||||
int iModel = m_sysInfo.wProcessorRevision / 100;
|
||||
int iStepping = m_sysInfo.wProcessorRevision % 100;
|
||||
sStepping.Format( _T("Stepping: %u-%u "), iModel, iStepping);
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
sRC = sVendor + "," + sSpeed + "," + sType + "," + sProcessors + "," + sArchitecture + "," + sProcessorLevel + "," + sStepping;
|
||||
|
||||
return sRC;
|
||||
}
|
||||
};
|
||||
|
||||
class CMemoryInfo
|
||||
{
|
||||
protected:
|
||||
|
||||
public:
|
||||
|
||||
CMemoryInfo(void)
|
||||
{
|
||||
}
|
||||
|
||||
CStdString GetMemoryInfo(void)
|
||||
{
|
||||
CStdString sRC;
|
||||
|
||||
MEMORYSTATUS memoryStatus;
|
||||
|
||||
memset (&memoryStatus, 0, sizeof(MEMORYSTATUS));
|
||||
memoryStatus.dwLength = sizeof (MEMORYSTATUS);
|
||||
GlobalMemoryStatus (&memoryStatus);
|
||||
|
||||
DWORD dwMinWSSize;
|
||||
DWORD dwMaxWSSize;
|
||||
|
||||
::GetProcessWorkingSetSize(GetCurrentProcess(), &dwMinWSSize, &dwMaxWSSize);
|
||||
|
||||
sRC.Format( _T("Memory Used %lu%%, Total Physical Memory %luKB, Physical Memory Available %luKB, Total Virtual Memory %luKB, Available Virtual Memory %luKB, Working Set Min : %luKB Max : %luKB .\r\n"), memoryStatus.dwMemoryLoad, memoryStatus.dwTotalPhys / 1024, memoryStatus.dwAvailPhys / 1024, memoryStatus.dwTotalVirtual / 1024, memoryStatus.dwAvailVirtual / 1024, dwMinWSSize/1024, dwMaxWSSize/1024);
|
||||
|
||||
return sRC;
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
4157
database/FileZillaFTP/source/misc/StdString.h
Normal file
4157
database/FileZillaFTP/source/misc/StdString.h
Normal file
File diff suppressed because it is too large
Load Diff
135
database/FileZillaFTP/source/misc/WindowsVersion.h
Normal file
135
database/FileZillaFTP/source/misc/WindowsVersion.h
Normal file
@@ -0,0 +1,135 @@
|
||||
|
||||
BOOL DisplaySystemVersion(LPTSTR buffer)
|
||||
{
|
||||
OSVERSIONINFOEX osvi;
|
||||
BOOL bOsVersionInfoEx;
|
||||
|
||||
LPTSTR tmp=buffer;
|
||||
|
||||
// Try calling GetVersionEx using the OSVERSIONINFOEX structure.
|
||||
// If that fails, try using the OSVERSIONINFO structure.
|
||||
|
||||
ZeroMemory(&osvi, sizeof(OSVERSIONINFOEX));
|
||||
osvi.dwOSVersionInfoSize = sizeof(OSVERSIONINFOEX);
|
||||
|
||||
bOsVersionInfoEx = GetVersionEx ((OSVERSIONINFO *) &osvi);
|
||||
if( !bOsVersionInfoEx )
|
||||
{
|
||||
// If OSVERSIONINFOEX doesn't work, try OSVERSIONINFO.
|
||||
osvi.dwOSVersionInfoSize = sizeof (OSVERSIONINFO);
|
||||
if (! GetVersionEx ( (OSVERSIONINFO *) &osvi) )
|
||||
return FALSE;
|
||||
}
|
||||
|
||||
switch (osvi.dwPlatformId)
|
||||
{
|
||||
// Tests for Windows NT product family.
|
||||
case VER_PLATFORM_WIN32_NT:
|
||||
|
||||
// Test for the product.
|
||||
|
||||
if ( osvi.dwMajorVersion <= 4 )
|
||||
tmp+=_stprintf( tmp, _T("Microsoft Windows NT ") );
|
||||
|
||||
if ( osvi.dwMajorVersion == 5 && osvi.dwMinorVersion == 0 )
|
||||
tmp+=_stprintf( tmp, _T("Microsoft Windows 2000 ") );
|
||||
|
||||
|
||||
if( bOsVersionInfoEx ) // Use information from GetVersionEx.
|
||||
{
|
||||
// Test for the workstation type.
|
||||
if ( osvi.wProductType == VER_NT_WORKSTATION )
|
||||
{
|
||||
if ( osvi.dwMajorVersion == 5 && osvi.dwMinorVersion == 1 )
|
||||
tmp+=_stprintf ( tmp, _T("Microsoft Windows XP ") );
|
||||
|
||||
if( osvi.wSuiteMask & VER_SUITE_PERSONAL )
|
||||
tmp+=_stprintf ( tmp, _T("Home Edition ") );
|
||||
else
|
||||
tmp+=_stprintf ( tmp, _T("Professional ") );
|
||||
}
|
||||
|
||||
// Test for the server type.
|
||||
else if ( osvi.wProductType == VER_NT_SERVER )
|
||||
{
|
||||
if ( osvi.dwMajorVersion == 5 && osvi.dwMinorVersion == 1 )
|
||||
tmp+=_stprintf ( tmp, _T("Microsoft Windows .NET ") );
|
||||
|
||||
if( osvi.wSuiteMask & VER_SUITE_DATACENTER )
|
||||
tmp+=_stprintf ( tmp, _T("DataCenter Server ") );
|
||||
else if( osvi.wSuiteMask & VER_SUITE_ENTERPRISE )
|
||||
if( osvi.dwMajorVersion == 4 )
|
||||
tmp+=_stprintf ( tmp, _T("Advanced Server ") );
|
||||
else
|
||||
tmp+=_stprintf ( tmp, _T("Enterprise Server ") );
|
||||
else if ( osvi.wSuiteMask == VER_SUITE_BLADE )
|
||||
tmp+=_stprintf ( tmp, _T("Web Server ") );
|
||||
else
|
||||
tmp+=_stprintf ( tmp, _T("Server ") );
|
||||
}
|
||||
}
|
||||
else // Use the registry on early versions of Windows NT.
|
||||
{
|
||||
HKEY hKey;
|
||||
TCHAR szProductType[80];
|
||||
DWORD dwBufLen=80*sizeof(TCHAR);
|
||||
|
||||
RegOpenKeyEx( HKEY_LOCAL_MACHINE,
|
||||
_T("SYSTEM\\CurrentControlSet\\Control\\ProductOptions"),
|
||||
0, KEY_QUERY_VALUE, &hKey );
|
||||
RegQueryValueEx( hKey, _T("ProductType"), NULL, NULL,
|
||||
(LPBYTE) szProductType, &dwBufLen);
|
||||
RegCloseKey( hKey );
|
||||
if ( lstrcmpi( _T("WINNT"), szProductType) == 0 )
|
||||
tmp+=_stprintf( tmp, _T("Professional ") );
|
||||
if ( lstrcmpi( _T("LANMANNT"), szProductType) == 0 )
|
||||
tmp+=_stprintf( tmp, _T("Server ") );
|
||||
if ( lstrcmpi( _T("SERVERNT"), szProductType) == 0 )
|
||||
tmp+=_stprintf( tmp, _T("Advanced Server ") );
|
||||
}
|
||||
|
||||
// Display version, service pack (if any), and build number.
|
||||
|
||||
if ( osvi.dwMajorVersion <= 4 )
|
||||
{
|
||||
tmp+=_stprintf ( tmp, _T("version %d.%d %s (Build %d)"),
|
||||
osvi.dwMajorVersion,
|
||||
osvi.dwMinorVersion,
|
||||
osvi.szCSDVersion,
|
||||
osvi.dwBuildNumber & 0xFFFF);
|
||||
}
|
||||
else
|
||||
{
|
||||
tmp+=_stprintf ( tmp, _T("%s (Build %d)"),
|
||||
osvi.szCSDVersion,
|
||||
osvi.dwBuildNumber & 0xFFFF);
|
||||
}
|
||||
break;
|
||||
|
||||
// Test for the Windows 95 product family.
|
||||
case VER_PLATFORM_WIN32_WINDOWS:
|
||||
|
||||
if (osvi.dwMajorVersion == 4 && osvi.dwMinorVersion == 0)
|
||||
{
|
||||
tmp+=_stprintf ( tmp, _T("Microsoft Windows 95 ") );
|
||||
if ( osvi.szCSDVersion[1] == 'C' || osvi.szCSDVersion[1] == 'B' )
|
||||
tmp+=_stprintf( tmp, _T("OSR2 ") );
|
||||
}
|
||||
|
||||
if (osvi.dwMajorVersion == 4 && osvi.dwMinorVersion == 10)
|
||||
{
|
||||
tmp+=_stprintf ( tmp, _T("Microsoft Windows 98 ") );
|
||||
if ( osvi.szCSDVersion[1] == 'A' )
|
||||
tmp+=_stprintf( tmp, _T("SE ") );
|
||||
}
|
||||
|
||||
if (osvi.dwMajorVersion == 4 && osvi.dwMinorVersion == 90)
|
||||
{
|
||||
tmp+=_stprintf ( tmp, _T("Microsoft Windows Millennium Edition ") );
|
||||
}
|
||||
break;
|
||||
}
|
||||
if (tmp==buffer)
|
||||
tmp+=_stprintf( tmp, _T("%d.%d build %d"), osvi.dwMajorVersion, osvi.dwMinorVersion, osvi.dwBuildNumber);
|
||||
return TRUE;
|
||||
}
|
||||
544
database/FileZillaFTP/source/misc/md5.cpp
Normal file
544
database/FileZillaFTP/source/misc/md5.cpp
Normal file
@@ -0,0 +1,544 @@
|
||||
// MD5.CC - source code for the C++/object oriented translation and
|
||||
// modification of MD5.
|
||||
|
||||
// Translation and modification (c) 1995 by Mordechai T. Abzug
|
||||
|
||||
// This translation/ modification is provided "as is," without express or
|
||||
// implied warranty of any kind.
|
||||
|
||||
// The translator/ modifier does not claim (1) that MD5 will do what you think
|
||||
// it does; (2) that this translation/ modification is accurate; or (3) that
|
||||
// this software is "merchantible." (Language for this disclaimer partially
|
||||
// copied from the disclaimer below).
|
||||
|
||||
/* based on:
|
||||
|
||||
MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
|
||||
MDDRIVER.C - test driver for MD2, MD4 and MD5
|
||||
|
||||
|
||||
Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
|
||||
rights reserved.
|
||||
|
||||
License to copy and use this software is granted provided that it
|
||||
is identified as the "RSA Data Security, Inc. MD5 Message-Digest
|
||||
Algorithm" in all material mentioning or referencing this software
|
||||
or this function.
|
||||
|
||||
License is also granted to make and use derivative works provided
|
||||
that such works are identified as "derived from the RSA Data
|
||||
Security, Inc. MD5 Message-Digest Algorithm" in all material
|
||||
mentioning or referencing the derived work.
|
||||
|
||||
RSA Data Security, Inc. makes no representations concerning either
|
||||
the merchantability of this software or the suitability of this
|
||||
software for any particular purpose. It is provided "as is"
|
||||
without express or implied warranty of any kind.
|
||||
|
||||
These notices must be retained in any copies of any part of this
|
||||
documentation and/or software.
|
||||
|
||||
*/
|
||||
|
||||
|
||||
|
||||
#include "stdafx.h"
|
||||
#include "md5.h"
|
||||
|
||||
#include <assert.h>
|
||||
#include <iostream>
|
||||
// MD5 simple initialization method
|
||||
|
||||
MD5::MD5(){
|
||||
|
||||
init();
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
// MD5 block update operation. Continues an MD5 message-digest
|
||||
// operation, processing another message block, and updating the
|
||||
// context.
|
||||
|
||||
void MD5::update (const uint1 *input, uint4 input_length) {
|
||||
unsigned char *input2 = new uint1[input_length];
|
||||
memcpy(input2, input, input_length);
|
||||
|
||||
uint4 input_index, buffer_index;
|
||||
uint4 buffer_space; // how much space is left in buffer
|
||||
|
||||
if (finalized){ // so we can't update!
|
||||
delete [] input2;
|
||||
cerr << "MD5::update: Can't update a finalized digest!" << endl;
|
||||
return;
|
||||
}
|
||||
|
||||
// Compute number of bytes mod 64
|
||||
buffer_index = (unsigned int)((count[0] >> 3) & 0x3F);
|
||||
|
||||
// Update number of bits
|
||||
if ( (count[0] += ((uint4) input_length << 3))<((uint4) input_length << 3) )
|
||||
count[1]++;
|
||||
|
||||
count[1] += ((uint4)input_length >> 29);
|
||||
|
||||
|
||||
buffer_space = 64 - buffer_index; // how much space is left in buffer
|
||||
|
||||
// Transform as many times as possible.
|
||||
if (input_length >= buffer_space) { // ie. we have enough to fill the buffer
|
||||
// fill the rest of the buffer and transform
|
||||
memcpy (buffer + buffer_index, input2, buffer_space);
|
||||
transform (buffer);
|
||||
|
||||
// now, transform each 64-byte piece of the input2, bypassing the buffer
|
||||
for (input_index = buffer_space; input_index + 63 < input_length;
|
||||
input_index += 64)
|
||||
transform (input2+input_index);
|
||||
|
||||
buffer_index = 0; // so we can buffer remaining
|
||||
}
|
||||
else
|
||||
input_index=0; // so we can buffer the whole input2
|
||||
|
||||
|
||||
// and here we do the buffering:
|
||||
memcpy(buffer+buffer_index, input+input_index, input_length-input_index);
|
||||
delete [] input2;
|
||||
}
|
||||
|
||||
|
||||
|
||||
// MD5 update for files.
|
||||
// Like above, except that it works on files (and uses above as a primitive.)
|
||||
|
||||
void MD5::update(FILE *file){
|
||||
|
||||
unsigned char buffer[1024];
|
||||
int len;
|
||||
|
||||
while (len=fread(buffer, 1, 1024, file))
|
||||
update(buffer, len);
|
||||
|
||||
fclose (file);
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
// MD5 update for istreams.
|
||||
// Like update for files; see above.
|
||||
|
||||
void MD5::update(istream& stream){
|
||||
|
||||
unsigned char buffer[1024];
|
||||
int len;
|
||||
|
||||
while (stream.good()){
|
||||
stream.read((char *)buffer, 1024); // note that return value of read is unusable.
|
||||
len=stream.gcount();
|
||||
update(buffer, len);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
// MD5 update for ifstreams.
|
||||
// Like update for files; see above.
|
||||
|
||||
void MD5::update(ifstream& stream){
|
||||
|
||||
unsigned char buffer[1024];
|
||||
int len;
|
||||
|
||||
while (stream.good()){
|
||||
stream.read((char *)buffer, 1024); // note that return value of read is unusable.
|
||||
len=stream.gcount();
|
||||
update(buffer, len);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
// MD5 finalization. Ends an MD5 message-digest operation, writing the
|
||||
// the message digest and zeroizing the context.
|
||||
|
||||
|
||||
void MD5::finalize (){
|
||||
|
||||
unsigned char bits[8];
|
||||
unsigned int index, padLen;
|
||||
static uint1 PADDING[64]={
|
||||
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
|
||||
};
|
||||
|
||||
if (finalized){
|
||||
cerr << "MD5::finalize: Already finalized this digest!" << endl;
|
||||
return;
|
||||
}
|
||||
|
||||
// Save number of bits
|
||||
encode (bits, count, 8);
|
||||
|
||||
// Pad out to 56 mod 64.
|
||||
index = (uint4) ((count[0] >> 3) & 0x3f);
|
||||
padLen = (index < 56) ? (56 - index) : (120 - index);
|
||||
update (PADDING, padLen);
|
||||
|
||||
// Append length (before padding)
|
||||
update (bits, 8);
|
||||
|
||||
// Store state in digest
|
||||
encode (digest, state, 16);
|
||||
|
||||
// Zeroize sensitive information
|
||||
memset (buffer, 0, sizeof(*buffer));
|
||||
|
||||
finalized=1;
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
MD5::MD5(FILE *file){
|
||||
|
||||
init(); // must be called be all constructors
|
||||
update(file);
|
||||
finalize ();
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
MD5::MD5(istream& stream){
|
||||
|
||||
init(); // must called by all constructors
|
||||
update (stream);
|
||||
finalize();
|
||||
}
|
||||
|
||||
|
||||
|
||||
MD5::MD5(ifstream& stream){
|
||||
|
||||
init(); // must called by all constructors
|
||||
update (stream);
|
||||
finalize();
|
||||
}
|
||||
|
||||
|
||||
|
||||
unsigned char *MD5::raw_digest(){
|
||||
|
||||
if (!finalized){
|
||||
cerr << "MD5::raw_digest: Can't get digest if you haven't "<<
|
||||
"finalized the digest!" <<endl;
|
||||
return 0;
|
||||
}
|
||||
|
||||
uint1 *s = new uint1[16];
|
||||
|
||||
memcpy(s, digest, 16);
|
||||
return s;
|
||||
}
|
||||
|
||||
|
||||
|
||||
char *MD5::hex_digest(){
|
||||
|
||||
int i;
|
||||
if (!finalized){
|
||||
cerr << "MD5::hex_digest: Can't get digest if you haven't "<<
|
||||
"finalized the digest!" <<endl;
|
||||
return 0;
|
||||
}
|
||||
|
||||
char *s= new char[33];
|
||||
|
||||
for (i=0; i<16; i++)
|
||||
sprintf(s+i*2, "%02x", digest[i]);
|
||||
|
||||
s[32]='\0';
|
||||
|
||||
return s;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
ostream& operator<<(ostream &stream, MD5 context){
|
||||
|
||||
char* hex = context.hex_digest();
|
||||
if( hex ) {
|
||||
stream << hex;
|
||||
delete [] hex;
|
||||
}
|
||||
return stream;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
// PRIVATE METHODS:
|
||||
|
||||
|
||||
|
||||
void MD5::init(){
|
||||
finalized=0; // we just started!
|
||||
|
||||
// Nothing counted, so count=0
|
||||
count[0] = 0;
|
||||
count[1] = 0;
|
||||
|
||||
// Load magic initialization constants.
|
||||
state[0] = 0x67452301;
|
||||
state[1] = 0xefcdab89;
|
||||
state[2] = 0x98badcfe;
|
||||
state[3] = 0x10325476;
|
||||
}
|
||||
|
||||
|
||||
|
||||
// Constants for MD5Transform routine.
|
||||
// Although we could use C++ style constants, defines are actually better,
|
||||
// since they let us easily evade scope clashes.
|
||||
|
||||
#define S11 7
|
||||
#define S12 12
|
||||
#define S13 17
|
||||
#define S14 22
|
||||
#define S21 5
|
||||
#define S22 9
|
||||
#define S23 14
|
||||
#define S24 20
|
||||
#define S31 4
|
||||
#define S32 11
|
||||
#define S33 16
|
||||
#define S34 23
|
||||
#define S41 6
|
||||
#define S42 10
|
||||
#define S43 15
|
||||
#define S44 21
|
||||
|
||||
|
||||
|
||||
// MD5 basic transformation. Transforms state based on block.
|
||||
void MD5::transform (uint1 block[64]){
|
||||
|
||||
uint4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
|
||||
|
||||
decode (x, block, 64);
|
||||
|
||||
assert(!finalized); // not just a user error, since the method is private
|
||||
|
||||
/* Round 1 */
|
||||
FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
|
||||
FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
|
||||
FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
|
||||
FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
|
||||
FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
|
||||
FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
|
||||
FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
|
||||
FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
|
||||
FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
|
||||
FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
|
||||
FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
|
||||
FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
|
||||
FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
|
||||
FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
|
||||
FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
|
||||
FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
|
||||
|
||||
/* Round 2 */
|
||||
GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
|
||||
GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
|
||||
GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
|
||||
GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
|
||||
GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
|
||||
GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
|
||||
GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
|
||||
GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
|
||||
GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
|
||||
GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
|
||||
GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
|
||||
GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
|
||||
GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
|
||||
GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
|
||||
GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
|
||||
GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
|
||||
|
||||
/* Round 3 */
|
||||
HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
|
||||
HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
|
||||
HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
|
||||
HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
|
||||
HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
|
||||
HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
|
||||
HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
|
||||
HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
|
||||
HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
|
||||
HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
|
||||
HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
|
||||
HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
|
||||
HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
|
||||
HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
|
||||
HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
|
||||
HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
|
||||
|
||||
/* Round 4 */
|
||||
II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
|
||||
II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
|
||||
II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
|
||||
II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
|
||||
II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
|
||||
II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
|
||||
II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
|
||||
II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
|
||||
II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
|
||||
II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
|
||||
II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
|
||||
II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
|
||||
II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
|
||||
II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
|
||||
II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
|
||||
II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
|
||||
|
||||
state[0] += a;
|
||||
state[1] += b;
|
||||
state[2] += c;
|
||||
state[3] += d;
|
||||
|
||||
// Zeroize sensitive information.
|
||||
memset ( (uint1 *) x, 0, sizeof(x));
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
// Encodes input (UINT4) into output (unsigned char). Assumes len is
|
||||
// a multiple of 4.
|
||||
void MD5::encode (uint1 *output, uint4 *input, uint4 len) {
|
||||
|
||||
unsigned int i, j;
|
||||
|
||||
for (i = 0, j = 0; j < len; i++, j += 4) {
|
||||
output[j] = (uint1) (input[i] & 0xff);
|
||||
output[j+1] = (uint1) ((input[i] >> 8) & 0xff);
|
||||
output[j+2] = (uint1) ((input[i] >> 16) & 0xff);
|
||||
output[j+3] = (uint1) ((input[i] >> 24) & 0xff);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
// Decodes input (unsigned char) into output (UINT4). Assumes len is
|
||||
// a multiple of 4.
|
||||
void MD5::decode (uint4 *output, uint1 *input, uint4 len){
|
||||
|
||||
unsigned int i, j;
|
||||
|
||||
for (i = 0, j = 0; j < len; i++, j += 4)
|
||||
output[i] = ((uint4)input[j]) | (((uint4)input[j+1]) << 8) |
|
||||
(((uint4)input[j+2]) << 16) | (((uint4)input[j+3]) << 24);
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
// Note: Replace "for loop" with standard memcpy if possible.
|
||||
/*void MD5::memcpy (uint1 *output, uint1 *input, uint4 len){
|
||||
|
||||
unsigned int i;
|
||||
|
||||
for (i = 0; i < len; i++)
|
||||
output[i] = input[i];
|
||||
}*/
|
||||
|
||||
|
||||
|
||||
// Note: Replace "for loop" with standard memset if possible.
|
||||
/*void MD5::memset (uint1 *output, uint1 value, uint4 len){
|
||||
|
||||
unsigned int i;
|
||||
|
||||
for (i = 0; i < len; i++)
|
||||
output[i] = value;
|
||||
}*/
|
||||
|
||||
|
||||
|
||||
// ROTATE_LEFT rotates x left n bits.
|
||||
|
||||
inline unsigned int MD5::rotate_left (uint4 x, uint4 n){
|
||||
return (x << n) | (x >> (32-n)) ;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
// F, G, H and I are basic MD5 functions.
|
||||
|
||||
inline unsigned int MD5::F (uint4 x, uint4 y, uint4 z){
|
||||
return (x & y) | (~x & z);
|
||||
}
|
||||
|
||||
inline unsigned int MD5::G (uint4 x, uint4 y, uint4 z){
|
||||
return (x & z) | (y & ~z);
|
||||
}
|
||||
|
||||
inline unsigned int MD5::H (uint4 x, uint4 y, uint4 z){
|
||||
return x ^ y ^ z;
|
||||
}
|
||||
|
||||
inline unsigned int MD5::I (uint4 x, uint4 y, uint4 z){
|
||||
return y ^ (x | ~z);
|
||||
}
|
||||
|
||||
|
||||
|
||||
// FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
|
||||
// Rotation is separate from addition to prevent recomputation.
|
||||
|
||||
|
||||
inline void MD5::FF(uint4& a, uint4 b, uint4 c, uint4 d, uint4 x,
|
||||
uint4 s, uint4 ac){
|
||||
a += F(b, c, d) + x + ac;
|
||||
a = rotate_left (a, s) +b;
|
||||
}
|
||||
|
||||
inline void MD5::GG(uint4& a, uint4 b, uint4 c, uint4 d, uint4 x,
|
||||
uint4 s, uint4 ac){
|
||||
a += G(b, c, d) + x + ac;
|
||||
a = rotate_left (a, s) +b;
|
||||
}
|
||||
|
||||
inline void MD5::HH(uint4& a, uint4 b, uint4 c, uint4 d, uint4 x,
|
||||
uint4 s, uint4 ac){
|
||||
a += H(b, c, d) + x + ac;
|
||||
a = rotate_left (a, s) +b;
|
||||
}
|
||||
|
||||
inline void MD5::II(uint4& a, uint4 b, uint4 c, uint4 d, uint4 x,
|
||||
uint4 s, uint4 ac){
|
||||
a += I(b, c, d) + x + ac;
|
||||
a = rotate_left (a, s) +b;
|
||||
}
|
||||
111
database/FileZillaFTP/source/misc/md5.h
Normal file
111
database/FileZillaFTP/source/misc/md5.h
Normal file
@@ -0,0 +1,111 @@
|
||||
// MD5.CC - source code for the C++/object oriented translation and
|
||||
// modification of MD5.
|
||||
|
||||
// Translation and modification (c) 1995 by Mordechai T. Abzug
|
||||
|
||||
// This translation/ modification is provided "as is," without express or
|
||||
// implied warranty of any kind.
|
||||
|
||||
// The translator/ modifier does not claim (1) that MD5 will do what you think
|
||||
// it does; (2) that this translation/ modification is accurate; or (3) that
|
||||
// this software is "merchantible." (Language for this disclaimer partially
|
||||
// copied from the disclaimer below).
|
||||
|
||||
/* based on:
|
||||
|
||||
MD5.H - header file for MD5C.C
|
||||
MDDRIVER.C - test driver for MD2, MD4 and MD5
|
||||
|
||||
Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
|
||||
rights reserved.
|
||||
|
||||
License to copy and use this software is granted provided that it
|
||||
is identified as the "RSA Data Security, Inc. MD5 Message-Digest
|
||||
Algorithm" in all material mentioning or referencing this software
|
||||
or this function.
|
||||
|
||||
License is also granted to make and use derivative works provided
|
||||
that such works are identified as "derived from the RSA Data
|
||||
Security, Inc. MD5 Message-Digest Algorithm" in all material
|
||||
mentioning or referencing the derived work.
|
||||
|
||||
RSA Data Security, Inc. makes no representations concerning either
|
||||
the merchantability of this software or the suitability of this
|
||||
software for any particular purpose. It is provided "as is"
|
||||
without express or implied warranty of any kind.
|
||||
|
||||
These notices must be retained in any copies of any part of this
|
||||
documentation and/or software.
|
||||
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <fstream>
|
||||
#include <iostream>
|
||||
|
||||
using namespace std;
|
||||
|
||||
class MD5 {
|
||||
|
||||
public:
|
||||
// methods for controlled operation:
|
||||
MD5 (); // simple initializer
|
||||
void update (const unsigned char *input, unsigned int input_length);
|
||||
void update (istream& stream);
|
||||
void update (FILE *file);
|
||||
void update (ifstream& stream);
|
||||
void finalize ();
|
||||
|
||||
// constructors for special circumstances. All these constructors finalize
|
||||
// the MD5 context.
|
||||
MD5 (unsigned char *string); // digest string, finalize
|
||||
MD5 (istream& stream); // digest stream, finalize
|
||||
MD5 (FILE *file); // digest file, close, finalize
|
||||
MD5 (ifstream& stream); // digest stream, close, finalize
|
||||
|
||||
// methods to acquire finalized result
|
||||
unsigned char *raw_digest (); // digest as a 16-byte binary array
|
||||
char * hex_digest (); // digest as a 33-byte ascii-hex string
|
||||
friend ostream& operator<< (ostream&, MD5 context);
|
||||
|
||||
|
||||
|
||||
private:
|
||||
|
||||
// first, some types:
|
||||
typedef unsigned int uint4; // assumes integer is 4 words long
|
||||
typedef unsigned short int uint2; // assumes short integer is 2 words long
|
||||
typedef unsigned char uint1; // assumes char is 1 word long
|
||||
|
||||
// next, the private data:
|
||||
uint4 state[4];
|
||||
uint4 count[2]; // number of *bits*, mod 2^64
|
||||
uint1 buffer[64]; // input buffer
|
||||
uint1 digest[16];
|
||||
uint1 finalized;
|
||||
|
||||
// last, the private methods, mostly static:
|
||||
void init (); // called by all constructors
|
||||
void transform (uint1 *buffer); // does the real update work. Note
|
||||
// that length is implied to be 64.
|
||||
|
||||
static void encode (uint1 *dest, uint4 *src, uint4 length);
|
||||
static void decode (uint4 *dest, uint1 *src, uint4 length);
|
||||
//static void memcpy (uint1 *dest, uint1 *src, uint4 length);
|
||||
//static void memset (uint1 *start, uint1 val, uint4 length);
|
||||
|
||||
static inline uint4 rotate_left (uint4 x, uint4 n);
|
||||
static inline uint4 F (uint4 x, uint4 y, uint4 z);
|
||||
static inline uint4 G (uint4 x, uint4 y, uint4 z);
|
||||
static inline uint4 H (uint4 x, uint4 y, uint4 z);
|
||||
static inline uint4 I (uint4 x, uint4 y, uint4 z);
|
||||
static inline void FF (uint4& a, uint4 b, uint4 c, uint4 d, uint4 x,
|
||||
uint4 s, uint4 ac);
|
||||
static inline void GG (uint4& a, uint4 b, uint4 c, uint4 d, uint4 x,
|
||||
uint4 s, uint4 ac);
|
||||
static inline void HH (uint4& a, uint4 b, uint4 c, uint4 d, uint4 x,
|
||||
uint4 s, uint4 ac);
|
||||
static inline void II (uint4& a, uint4 b, uint4 c, uint4 d, uint4 x,
|
||||
uint4 s, uint4 ac);
|
||||
|
||||
};
|
||||
1887
database/FileZillaFTP/source/misc/mmgr.cpp
Normal file
1887
database/FileZillaFTP/source/misc/mmgr.cpp
Normal file
File diff suppressed because it is too large
Load Diff
165
database/FileZillaFTP/source/misc/mmgr.h
Normal file
165
database/FileZillaFTP/source/misc/mmgr.h
Normal file
@@ -0,0 +1,165 @@
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// _
|
||||
// | |
|
||||
// _ __ ___ _ __ ___ __ _ _ __ | |__
|
||||
// | '_ ` _ \| '_ ` _ \ / _` | '__| | '_ \
|
||||
// | | | | | | | | | | | (_| | | _ | | | |
|
||||
// |_| |_| |_|_| |_| |_|\__, |_| (_)|_| |_|
|
||||
// __/ |
|
||||
// |___/
|
||||
//
|
||||
// Memory manager & tracking software
|
||||
//
|
||||
// Best viewed with 8-character tabs and (at least) 132 columns
|
||||
//
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
//
|
||||
// Restrictions & freedoms pertaining to usage and redistribution of this software:
|
||||
//
|
||||
// * This software is 100% free
|
||||
// * If you use this software (in part or in whole) you must credit the author.
|
||||
// * This software may not be re-distributed (in part or in whole) in a modified
|
||||
// form without clear documentation on how to obtain a copy of the original work.
|
||||
// * You may not use this software to directly or indirectly cause harm to others.
|
||||
// * This software is provided as-is and without warrantee. Use at your own risk.
|
||||
//
|
||||
// For more information, visit HTTP://www.FluidStudios.com
|
||||
//
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Originally created on 12/22/2000 by Paul Nettle
|
||||
//
|
||||
// Copyright 2000, Fluid Studios, Inc., all rights reserved.
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
#ifndef _H_MMGR
|
||||
#define _H_MMGR
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// For systems that don't have the __FUNCTION__ variable, we can just define it here
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
#define __FUNCTION__ "??"
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Types
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
typedef struct tag_au
|
||||
{
|
||||
size_t actualSize;
|
||||
size_t reportedSize;
|
||||
void *actualAddress;
|
||||
void *reportedAddress;
|
||||
char sourceFile[40];
|
||||
char sourceFunc[40];
|
||||
unsigned int sourceLine;
|
||||
unsigned int allocationType;
|
||||
bool breakOnDealloc;
|
||||
bool breakOnRealloc;
|
||||
unsigned int allocationNumber;
|
||||
struct tag_au *next;
|
||||
struct tag_au *prev;
|
||||
} sAllocUnit;
|
||||
|
||||
typedef struct
|
||||
{
|
||||
unsigned int totalReportedMemory;
|
||||
unsigned int totalActualMemory;
|
||||
unsigned int peakReportedMemory;
|
||||
unsigned int peakActualMemory;
|
||||
unsigned int accumulatedReportedMemory;
|
||||
unsigned int accumulatedActualMemory;
|
||||
unsigned int accumulatedAllocUnitCount;
|
||||
unsigned int totalAllocUnitCount;
|
||||
unsigned int peakAllocUnitCount;
|
||||
} sMStats;
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// External constants
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
extern const unsigned int m_alloc_unknown;
|
||||
extern const unsigned int m_alloc_new;
|
||||
extern const unsigned int m_alloc_new_array;
|
||||
extern const unsigned int m_alloc_malloc;
|
||||
extern const unsigned int m_alloc_calloc;
|
||||
extern const unsigned int m_alloc_realloc;
|
||||
extern const unsigned int m_alloc_delete;
|
||||
extern const unsigned int m_alloc_delete_array;
|
||||
extern const unsigned int m_alloc_free;
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Used by the macros
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
void m_setOwner(const char *file, const unsigned int line, const char *func);
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Allocation breakpoints
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
bool &m_breakOnRealloc(void *reportedAddress);
|
||||
bool &m_breakOnDealloc(void *reportedAddress);
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// The meat of the memory tracking software
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
void *m_allocator(const char *sourceFile, const unsigned int sourceLine, const char *sourceFunc,
|
||||
const unsigned int allocationType, const size_t reportedSize);
|
||||
void *m_reallocator(const char *sourceFile, const unsigned int sourceLine, const char *sourceFunc,
|
||||
const unsigned int reallocationType, const size_t reportedSize, void *reportedAddress);
|
||||
void m_deallocator(const char *sourceFile, const unsigned int sourceLine, const char *sourceFunc,
|
||||
const unsigned int deallocationType, const void *reportedAddress);
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Utilitarian functions
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
bool m_validateAddress(const void *reportedAddress);
|
||||
bool m_validateAllocUnit(const sAllocUnit *allocUnit);
|
||||
bool m_validateAllAllocUnits();
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Unused RAM calculations
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
unsigned int m_calcUnused(const sAllocUnit *allocUnit);
|
||||
unsigned int m_calcAllUnused();
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Logging and reporting
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
void m_dumpAllocUnit(const sAllocUnit *allocUnit, const char *prefix = "");
|
||||
void m_dumpMemoryReport(const char *filename = "memreport.log", const bool overwrite = true);
|
||||
sMStats m_getMemoryStatistics();
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Variations of global operators new & delete
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
void *operator new(size_t reportedSize);
|
||||
void *operator new[](size_t reportedSize);
|
||||
void *operator new(size_t reportedSize, const char *sourceFile, int sourceLine);
|
||||
void *operator new[](size_t reportedSize, const char *sourceFile, int sourceLine);
|
||||
void operator delete(void *reportedAddress);
|
||||
void operator delete[](void *reportedAddress);
|
||||
|
||||
#endif // _H_MMGR
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Macros -- "Kids, please don't try this at home. We're trained professionals here." :)
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
#include "nommgr.h"
|
||||
#define new (m_setOwner (__FILE__,__LINE__,__FUNCTION__),false) ? NULL : new
|
||||
#define delete (m_setOwner (__FILE__,__LINE__,__FUNCTION__),false) ? m_setOwner("",0,"") : delete
|
||||
#define malloc(sz) m_allocator (__FILE__,__LINE__,__FUNCTION__,m_alloc_malloc,sz)
|
||||
#define calloc(sz) m_allocator (__FILE__,__LINE__,__FUNCTION__,m_alloc_calloc,sz)
|
||||
#define realloc(ptr,sz) m_reallocator(__FILE__,__LINE__,__FUNCTION__,m_alloc_realloc,sz,ptr)
|
||||
#define free(ptr) m_deallocator(__FILE__,__LINE__,__FUNCTION__,m_alloc_free,ptr)
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// mmgr.h - End of file
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
60
database/FileZillaFTP/source/misc/nommgr.h
Normal file
60
database/FileZillaFTP/source/misc/nommgr.h
Normal file
@@ -0,0 +1,60 @@
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// _
|
||||
// | |
|
||||
// _ __ ___ _ __ ___ _ __ ___ __ _ _ __ | |__
|
||||
// | '_ \ / _ \| '_ ` _ \| '_ ` _ \ / _` | '__| | '_ \
|
||||
// | | | | (_) | | | | | | | | | | | (_| | | _ | | | |
|
||||
// |_| |_|\___/|_| |_| |_|_| |_| |_|\__, |_| (_)|_| |_|
|
||||
// __/ |
|
||||
// |___/
|
||||
//
|
||||
// Memory manager & tracking software
|
||||
//
|
||||
// Best viewed with 8-character tabs and (at least) 132 columns
|
||||
//
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
//
|
||||
// Restrictions & freedoms pertaining to usage and redistribution of this software:
|
||||
//
|
||||
// * This software is 100% free
|
||||
// * If you use this software (in part or in whole) you must credit the author.
|
||||
// * This software may not be re-distributed (in part or in whole) in a modified
|
||||
// form without clear documentation on how to obtain a copy of the original work.
|
||||
// * You may not use this software to directly or indirectly cause harm to others.
|
||||
// * This software is provided as-is and without warrantee. Use at your own risk.
|
||||
//
|
||||
// For more information, visit HTTP://www.FluidStudios.com
|
||||
//
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// Originally created on 12/22/2000 by Paul Nettle
|
||||
//
|
||||
// Copyright 2000, Fluid Studios, Inc., all rights reserved.
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
|
||||
#ifdef new
|
||||
#undef new
|
||||
#endif
|
||||
|
||||
#ifdef delete
|
||||
#undef delete
|
||||
#endif
|
||||
|
||||
#ifdef malloc
|
||||
#undef malloc
|
||||
#endif
|
||||
|
||||
#ifdef calloc
|
||||
#undef calloc
|
||||
#endif
|
||||
|
||||
#ifdef realloc
|
||||
#undef realloc
|
||||
#endif
|
||||
|
||||
#ifdef free
|
||||
#undef free
|
||||
#endif
|
||||
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
// nommgr.h - End of file
|
||||
// ---------------------------------------------------------------------------------------------------------------------------------
|
||||
Reference in New Issue
Block a user