EnumProcessModules failed with error: 299

最新推荐文章于 2024-06-15 18:06:06 发布

Yehger

最新推荐文章于 2024-06-15 18:06:06 发布

阅读量259

点赞数 1

分类专栏： c++ 文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/meis27461/article/details/139129490

版权

c++ 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

32位的程序无法读取64位的模块

读模块之前先枚举一下
下附代码

#include <windows.h>
#include <iostream>
#include <string>
#include <Psapi.h>

using namespace std;

// 获取指定进程的名称
wstring GetProcessName(DWORD processID) {
    wstring processName;
    HANDLE hProcess = OpenProcess(PROCESS_QUERY_INFORMATION | PROCESS_VM_READ, FALSE, processID);
    if (hProcess != NULL) {
        HMODULE hModules[1024];
        DWORD cbNeeded;
        if (EnumProcessModules(hProcess, hModules, sizeof(hModules), &cbNeeded)) {
            TCHAR szProcessName[MAX_PATH];
            if (GetModuleBaseName(hProcess, hModules[0], szProcessName, sizeof(szProcessName))) {
                processName = szProcessName;
            }
            else {
                DWORD error = GetLastError();
                cerr << "GetModuleBaseName failed with error: " << error << endl;
            }
        }
        else {
            DWORD error = GetLastError();
            cerr << "EnumProcessModules failed with error: " << error << endl;
        }
        CloseHandle(hProcess);
    }
    else {
        DWORD error = GetLastError();
        cerr << "OpenProcess failed with error: " << error << endl;
    }
    return processName;
}

int main() {
    DWORD aProcesses[1024], cbNeeded, cProcesses;
    if (!EnumProcesses(aProcesses, sizeof(aProcesses), &cbNeeded)) {
        cerr << "EnumProcesses failed." << endl;
        return 0;
    }

    // 计算获取到的进程数
    cProcesses = cbNeeded / sizeof(DWORD);

    // 枚举进程数组并输出名称
    for (DWORD i = 0; i < cProcesses; ++i) {
        if (aProcesses[i] != 0) {
            wstring processName = GetProcessName(aProcesses[i]);
            if (!processName.empty()) {
                printf("PID: %-10d Module Name: %ls\n", aProcesses[i], processName.c_str());
            }
        }
    }

    return 0;
}