[转贴]How to get the largest available continues memory block

原文地址:http://blog.kalmbachnet.de/?postid=9

Some applications require a huge amount of continues memory. And sometimes, windows is not able to satisfy the request.

To find out the reason of why the virtual memory is badly splited and to get the size of the larges continous memory block, you can use the following code to get the info about the virtual address space:


 #include <stdio.h>
 #include <windows.h>
 #include <tchar.h>
 #include <psapi.h>
 #pragma comment(lib, "psapi.lib")

  void PrintMemInfo(MEMORY_BASIC_INFORMATION &mbi)
  {
    if (mbi.State != MEM_FREE)
      return;
    _tprintf(_T("BaseAddress      : 0x%8.8X, 0x%8.8X, 0x%8.8X/n"), 
      mbi.BaseAddress, mbi.AllocationBase, mbi.AllocationProtect);
    _tprintf(_T("RegionSize       : 0x%8.8X/n"), mbi.RegionSize);
    _tprintf(_T("State            : "));
    switch(mbi.State)
    {
    case MEM_COMMIT:
      _tprintf(_T("Commit/n"));
      break;
    case MEM_FREE:
      _tprintf(_T("Free/n"));
      break;
    case MEM_RESERVE:
      _tprintf(_T("Reserve/n"));
      break;
    default:
      _tprintf(_T("Unknown/n"));
      break;
    }
    _tprintf(_T("Type             : "));
    switch(mbi.Type)
    {
    case MEM_IMAGE:
      _tprintf(_T("Image/n"));
      break;
    case MEM_MAPPED:
      _tprintf(_T("Mapped/n"));
      break;
    case MEM_PRIVATE:
      _tprintf(_T("Private/n"));
      break;
    default:
      _tprintf(_T("Unknown (%d)/n"), mbi.Type);
      break;
    }
    _tprintf(_T("/n"));
  }

  void PrintModules( DWORD processID )
  {
    HMODULE hMods[ 1024 ];
    HANDLE hProcess;
    DWORD cbNeeded;
    unsigned int i;
    _tprintf( _T("/nProcess ID: %u/n"), processID );
    hProcess = OpenProcess(PROCESS_QUERY_INFORMATION |PROCESS_VM_READ, FALSE, processID);
    if (NULL  hProcess)
      return;
    if( EnumProcessModules(hProcess, hMods, sizeof(hMods), &cbNeeded))
    {
      for ( i = 0; i < (cbNeeded / sizeof(HMODULE)); i++ )
      {
        TCHAR szModName[MAX_PATH];
        if ( GetModuleFileNameEx( hProcess, hMods[i], szModName, sizeof(szModName)))
        {
          _tprintf(_T("/t%s (0x%08X)/n"), szModName, hMods[i] );
        }
      }
    }
    CloseHandle( hProcess );
  }

  SIZE_T GetLargestFreeMemRegion(LPVOID *lpBaseAddr, bool showMemInfo)
  {
    SYSTEM_INFO systemInfo;
    GetSystemInfo(&systemInfo);
    VOID *p = 0;
    MEMORY_BASIC_INFORMATION mbi;
    SIZE_T largestSize = 0;
    while(p < systemInfo.lpMaximumApplicationAddress)
    {
      SIZE_T dwRet = VirtualQuery(p, &mbi, sizeof(mbi));
      if (dwRet > 0)
      {
        if (showMemInfo)
          PrintMemInfo(mbi);
        if (mbi.State  MEM_FREE)
        {
          if (largestSize < mbi.RegionSize)
          {
            largestSize = mbi.RegionSize;
            if (lpBaseAddr != NULL)
              *lpBaseAddr = mbi.BaseAddress;
          }
        }
        p = (void*) (((char*)p) + mbi.RegionSize);
      }
      else
      {
        if (showMemInfo)
          _tprintf(_T(”### VirtualQuery failed (%p)/n”), p);
        p = (void*) (((char*)p) + systemInfo.dwPageSize);
      }
    }
    return largestSize;
  }

  int _tmain()
  {
    LPVOID baseAddr;
    SIZE_T ls = GetLargestFreeMemRegion(&baseAddr, true);
    PrintModules(GetCurrentProcessId());
    _tprintf(_T(”/nLargest Free Region: 0x%8.8X bytes at 0x%8.8X/n”), ls, baseAddr);
    return 0;
  }
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值