1 /***************************************************************************
3 * (C) 2002 Randy Dunlap <rdunlap@xenotime.net>
5 # This program is free software; you can redistribute it and/or modify
6 # it under the terms of the GNU General Public License as published by
7 # the Free Software Foundation; either version 2 of the License, or
8 # (at your option) any later version.
10 # This program is distributed in the hope that it will be useful,
11 # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 # GNU General Public License for more details.
15 # You should have received a copy of the GNU General Public License
16 # along with this program; if not, write to the Free Software
17 # Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 # - searches a (binary) file for a specified (binary) pattern
21 # - returns the offset of the located pattern or ~0 if not found
22 # - exits with exit status 0 normally or non-0 if pattern is not found
23 # or any other error occurs.
25 ****************************************************************/
33 #include <sys/types.h>
38 #define BUF_SIZE (16 * 1024)
44 unsigned int bix; /* buf index */
45 unsigned char patterns [PAT_SIZE] = {0}; /* byte-sized pattern array */
46 int pat_len; /* actual number of pattern bytes */
47 unsigned char *madr; /* mmap address */
54 fprintf (stderr, "%s ver. %s\n", progname, VERSION);
55 fprintf (stderr, "usage: %s filename pattern_bytes\n",
57 fprintf (stderr, " [prints location of pattern_bytes in file]\n");
61 void get_pattern (int pat_count, char *pats [])
66 fprintf (stderr,"get_pattern: count = %d\n", pat_count);
67 for (ix = 0; ix < pat_count; ix++)
68 fprintf (stderr, " pat # %d: [%s]\n", ix, pats[ix]);
71 for (ix = 0; ix < pat_count; ix++) {
73 err = sscanf (pats[ix], "%5i", &tmp);
74 if (err != 1 || tmp > 0xff) {
75 fprintf (stderr, "pattern or value error in pattern # %d [%s]\n",
84 void search_pattern (void)
86 for (bix = 0; bix < filesize; bix++) {
87 if (madr[bix] == patterns[0]) {
88 if (memcmp (&madr[bix], patterns, pat_len) == 0) {
98 size_t get_filesize (int fd)
100 off_t end_off = lseek (fd, 0, SEEK_END);
101 lseek (fd, 0, SEEK_SET);
102 return (size_t) end_off;
106 size_t get_filesize (int fd)
111 err = fstat (fd, &stat);
112 fprintf (stderr, "filesize: %ld\n", err < 0 ? (long)err : stat.st_size);
115 return (size_t) stat.st_size;
118 int main (int argc, char *argv [])
125 get_pattern (argc - 2, argv + 2);
129 inputfd = open (inputname, O_RDONLY);
131 fprintf (stderr, "%s: cannot open '%s'\n",
132 progname, inputname);
136 filesize = get_filesize (inputfd);
138 madr = mmap (0, filesize, PROT_READ, MAP_PRIVATE, inputfd, 0);
139 if (madr == MAP_FAILED) {
140 fprintf (stderr, "mmap error = %d\n", errno);
147 if (munmap (madr, filesize))
148 fprintf (stderr, "munmap error = %d\n", errno);
151 fprintf (stderr, "%s: error %d closing '%s'\n",
152 progname, errno, inputname);
154 fprintf (stderr, "number of pattern matches = %d\n", num_matches);
155 if (num_matches == 0)
157 printf ("%ld\n", firstloc);
158 fprintf (stderr, "%ld\n", firstloc);
160 exit (num_matches ? 0 : 2);
163 /* end binoffset.c */