1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
|
// Copyright 2009 Felix Domke <tmbinc@elitedvb.net>. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification, are
// permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this list of
// conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
// of conditions and the following disclaimer in the documentation and/or other materials
// provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER ``AS IS'' AND ANY EXPRESS OR IMPLIED
// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
// FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// The views and conclusions contained in the software and documentation are those of the
// authors and should not be interpreted as representing official policies, either expressed
// or implied, of the copyright holder.
//
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <dirent.h>
#include <fcntl.h>
#include <unistd.h>
#include <sys/stat.h>
#define BGREP_VERSION "0.2"
int ascii2hex(char c)
{
if (c < '0')
return -1;
else if (c <= '9')
return c - '0';
else if (c < 'A')
return -1;
else if (c <= 'F')
return c - 'A' + 10;
else if (c < 'a')
return -1;
else if (c <= 'f')
return c - 'a' + 10;
else
return -1;
}
void searchfile(const char *filename, int fd, const unsigned char *value, const unsigned char *mask, int len)
{
off_t offset = 0;
unsigned char buf[1024];
len--;
while (1)
{
int r;
memmove(buf, buf + sizeof(buf) - len, len);
r = read(fd, buf + len, sizeof(buf) - len);
if (r < 0)
{
perror("read");
return;
} else if (!r)
return;
int o, i;
for (o = offset ? 0 : len; o < r; ++o)
{
for (i = 0; i <= len; ++i)
if ((buf[o + i] & mask[i]) != value[i])
break;
if (i > len)
{
printf("%s: %08llx\n", filename, (unsigned long long)(offset + o - len));
}
}
offset += r;
}
}
void recurse(const char *path, const unsigned char *value, const unsigned char *mask, int len)
{
struct stat s;
if (stat(path, &s))
{
perror("stat");
return;
}
if (!S_ISDIR(s.st_mode))
{
int fd = open(path, O_RDONLY);
if (fd < 0)
perror(path);
else
{
searchfile(path, fd, value, mask, len);
close(fd);
}
return;
}
DIR *dir = opendir(path);
if (!dir)
{
perror(path);
exit(3);
}
struct dirent *d;
while ((d = readdir(dir)))
{
if (!(strcmp(d->d_name, ".") && strcmp(d->d_name, "..")))
continue;
char newpath[strlen(path) + strlen(d->d_name) + 1];
strcpy(newpath, path);
strcat(newpath, "/");
strcat(newpath, d->d_name);
recurse(newpath, value, mask, len);
}
closedir(dir);
}
int main(int argc, char **argv)
{
unsigned char value[0x100], mask[0x100];
int len = 0;
if (argc < 2)
{
fprintf(stderr, "bgrep version: %s\n", BGREP_VERSION);
fprintf(stderr, "usage: %s <hex> [<path> [...]]\n", *argv);
return 1;
}
char *h = argv[1];
while (*h && h[1] && len < 0x100)
{
if (h[0] == '?' && h[1] == '?')
{
value[len] = mask[len] = 0;
len++;
h += 2;
} else if (h[0] == ' ')
{
h++;
} else
{
int v0 = ascii2hex(*h++);
int v1 = ascii2hex(*h++);
if ((v0 == -1) || (v1 == -1))
{
fprintf(stderr, "invalid hex string!\n");
return 2;
}
value[len] = (v0 << 4) | v1; mask[len++] = 0xFF;
}
}
if (!len || *h)
{
fprintf(stderr, "invalid/empty search string\n");
return 2;
}
if (argc < 3)
searchfile("stdin", 0, value, mask, len);
else
{
int c = 2;
while (c < argc)
recurse(argv[c++], value, mask, len);
}
return 0;
}
|