我有一个buffer[]
包含HEX字节,我想搜索此缓冲区以查找特定字节。例如:
我的缓冲区有4096
个字节,如果字节45 34 67 23
(一起)在这个缓冲区内(比如在缓冲区中搜索字符串),我想在此搜索。
你知道我该怎么办?编程语言是C。
答案 0 :(得分:1)
只是“蛮力”它:)
haystacklen = 4096;
needlelen = 4;
foundat = -1;
index = 0; /* start at a different number if searching for 2nd occurrence */
while (index < haystacklen - needlelen + 1) {
if ((buffer[index + 0] == 45)
&& (buffer[index + 1] == 34)
&& (buffer[index + 2] == 67)
&& (buffer[index + 3] == 23))
{
foundat = index;
}
index++;
}
/* foundat has the index of the 1st search bytes or -1 */
答案 1 :(得分:0)
你也可以使用这个更快的版本。但是你必须记住,这只适用于x86 / little endian处理器,因为MAKEDWORD宏。
#define MAKEDWORD(a,b,c,d) ((uint32_t) (((uint32_t)a) & 0xFF) | ((((uint32_t)b) & 0xFF) << 8) | ((((uint32_t)c) & 0xFF) << 16) | ((((uint32_t)d) & 0xFF) << 24))
#define NEEDLE (MAKEDWORD(45,34,67,23))
// get the start and end address of the buffer
uint8_t *ptrEndBuffer = ((uint8_t*)buffer) + (4096 - sizeof(NEEDLE));
uint8_t *ptrStartBuffer = (uint8_t*)buffer - 1; // subtract -1 because we also want to get index 0
// while the result is not 0 we are good
while (ptrEndBuffer - ptrStartBuffer) {
if ((*(uint32_t*)ptrEndBuffer) == NEEDLE) // get an whole integer instead of just one char
break; // leave the loop if we found a match
ptrEndBuffer--;
}
// the index will be -1 if we couldn't find a match else we subtract the start address + the 1 we first removed from the end buffer
int index = ((ptrEndBuffer == ptrStartBuffer) ? (-1) : (ptrEndBuffer - (ptrStartBuffer + 1)));