各位老师，网上找到一篇C++源码，编译出现如下错误，是啥原因呢？

jtwc

各位老师，网上找到一篇C++源码，编译出现如下错误，是啥原因呢？如何修改呢？谢谢了

[C++] 纯文本查看 复制代码

#include<Windows.h>
#include<iostream>
#include<vector>
#include<time.h>
  
using namespace std;
  
#define BLOCKMAXSIZE 409600//每次读取内存的最大大小
BYTE* MemoryData;//每次将读取的内存读入这里
short Next[260];
  
//特征码转字节集
WORD GetTzmArray(char* Tzm, WORD* TzmArray)
{
    int len = 0;
    WORD TzmLength = strlen(Tzm) / 3 + 1;
  
    for (int i = 0; i < strlen(Tzm); )//将十六进制特征码转为十进制
    {
        char num[2];
        num[0] = Tzm[i++];
        num[1] = Tzm[i++];
        i++;
        if (num[0] != '?' && num[1] != '?')
        {
            int sum = 0;
            WORD a[2];
            for (int i = 0; i < 2; i++)
            {
                if (num[i] >= '0' && num[i] <= '9')
                {
                    a[i] = num[i] - '0';
                }
                else if (num[i] >= 'a' && num[i] <= 'z')
                {
                    a[i] = num[i] - 87;
                }
                else if (num[i] >= 'A' && num[i] <= 'Z')
                {
                    a[i] = num[i] - 55;
                }
  
            }
            sum = a[0] * 16 + a[1];
            TzmArray[len++] = sum;
        }
        else
        {
            TzmArray[len++] = 256;
        }
    }
    return TzmLength;
}
  
//获取Next数组
void GetNext(short* next, WORD* Tzm, WORD TzmLength)
{
    //特征码（字节集）的每个字节的范围在0-255（0-FF）之间，256用来表示问号，到260是为了防止越界
    for (int i = 0; i < 260; i++)
        next[i] = -1;
    for (int i = 0; i < TzmLength; i++)
        next[Tzm[i]] = i;
}
  
//搜索一块内存
void SearchMemoryBlock(HANDLE hProcess, WORD* Tzm, WORD TzmLength, unsigned __int64 StartAddress, unsigned long size, vector<unsigned __int64>& ResultArray)
{
    if (!ReadProcessMemory(hProcess, (LPCVOID)StartAddress, MemoryData, size, NULL))
    {
        return;
    }
  
    for (int i = 0, j, k; i < size;)
    {
        j = i; k = 0;
  
        for (; k < TzmLength && j < size && (Tzm[k] == MemoryData[j] || Tzm[k] == 256); k++, j++);
  
        if (k == TzmLength)
        {
            ResultArray.push_back(StartAddress + i);
        }
  
        if ((i + TzmLength) >= size)
        {
            return;
        }
  
        int num = Next[MemoryData[i + TzmLength]];
        if (num == -1)
            i += (TzmLength - Next[256]);//如果特征码有问号，就从问号处开始匹配，如果没有就i+=-1
        else
            i += (TzmLength - num);
    }
}
  
//搜索整个程序
int SearchMemory(HANDLE hProcess, char* Tzm, unsigned __int64 StartAddress, unsigned __int64 EndAddress, int InitSize, vector<unsigned __int64>& ResultArray)
{
    int i = 0;
    unsigned long BlockSize;
    MEMORY_BASIC_INFORMATION mbi;
  
    WORD TzmLength = strlen(Tzm) / 3 + 1;
    WORD* TzmArray = new WORD[TzmLength];
  
    GetTzmArray(Tzm, TzmArray);
    GetNext(Next, TzmArray, TzmLength);
  
    //初始化结果数组
    ResultArray.clear();
    ResultArray.reserve(InitSize);
  
    while (VirtualQueryEx(hProcess, (LPCVOID)StartAddress, &mbi, sizeof(mbi)) != 0)
    {
        //获取可读可写和可读可写可执行的内存块
        if (mbi.Protect == PAGE_READWRITE || mbi.Protect == PAGE_EXECUTE_READWRITE)
        {
            i = 0;
            BlockSize = mbi.RegionSize;
            //搜索这块内存
            while (BlockSize >= BLOCKMAXSIZE)
            {
                SearchMemoryBlock(hProcess, TzmArray, TzmLength, StartAddress + (BLOCKMAXSIZE * i), BLOCKMAXSIZE, ResultArray);
                BlockSize -= BLOCKMAXSIZE; i++;
            }
            SearchMemoryBlock(hProcess, TzmArray, TzmLength, StartAddress + (BLOCKMAXSIZE * i), BlockSize, ResultArray);
  
        }
        StartAddress += mbi.RegionSize;
  
        if (EndAddress != 0 && StartAddress > EndAddress)
        {
            return ResultArray.size();
        }
    }
    free(TzmArray);
    return ResultArray.size();
}
  
int main()
{
    //初始化MemoryData大小
    MemoryData = new BYTE[BLOCKMAXSIZE];
  
    DWORD pid=0;
    vector<unsigned __int64> ResultArray;
     
    cout << "请输入进程ID：" << endl;
    cin >> pid;
  
    //通过进程ID获取进程句柄
    HANDLE hProcess = OpenProcess(PROCESS_ALL_ACCESS, false, pid);
  
    int start = clock();
    SearchMemory(hProcess, (char*)"FF 3F FF ?? FF F2", 0x410000, 0xFFFFFFFF, 30, ResultArray);
    int end = clock();
  
    cout << "用时：" << end-start << "毫秒"<<endl;
    cout << "搜索到" << ResultArray.size() << "个结果" << endl;
  
    for (vector<unsigned __int64>::iterator it = ResultArray.begin(); it != ResultArray.end(); it++)
    {
        printf("%x\n", *it);
    }
  
    return 0;
}

HULANG-BTB

兄弟，写入错误无非就是数组越界。调试检查一下你Tzm数组里面的值是不是都小于next数组的大小就得了

JuncoJet

Tzm 数据有问题       导致Tzm或者next越界

mac52pojie

num[0] = Tzm[i++];
        num[1] = Tzm[i++];

这两句就应该报错了吧，这里已经数组越界了。

你截图的地方应该也是数组越界，你调试的时候可以看到下标应该大于260了。

jtwc

mac52pojie 发表于 2022-4-22 09:33
num[0] = Tzm;
        num[1] = Tzm;

老师，经过调试这个地方还真没有问题？

jtwc

JuncoJet 发表于 2022-4-22 09:23
Tzm 数据有问题       导致Tzm或者next越界

老师，如何修改呢？

★〓★〓★

VS2022 windows sdk 10.0.20348 直接编译运行成功，没有错误。

jtwc

★〓★〓★ 发表于 2022-4-22 09:45
VS2022 windows sdk 10.0.20348 直接编译运行成功，没有错误。

老师，多试几次，

★〓★〓★

jtwc 发表于 2022-4-22 09:48
老师，多试几次，

试了很多次了，没有崩溃，只不过搜不到数据而已，结果都是0

HULANG-BTB

WORD TzmLength = strlen(Tzm) / 3 + 1;  --->  WORD TzmLength = (strlen(Tzm) + 1) / 3;