123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287 |
- /* Quick program to see if a pattern is in a sig file. Pattern is supplied
- in a small .bin or .com style file */
- #include <stdio.h>
- #include <stdlib.h>
- #include <memory.h>
- #include "perfhlib.h"
- /* statics */
- byte buf[100];
- int numKeys; /* Number of hash table entries (keys) */
- int numVert; /* Number of vertices in the graph (also size of g[]) */
- int PatLen; /* Size of the keys (pattern length) */
- int SymLen; /* Max size of the symbols, including null */
- FILE *f; /* Sig file being read */
- FILE *fpat; /* Pattern file being read */
- static word *T1base, *T2base; /* Pointers to start of T1, T2 */
- static word *g; /* g[] */
- #define SYMLEN 16
- #define PATLEN 23
- typedef struct HT_tag
- {
- /* Hash table structure */
- char htSym[SYMLEN];
- byte htPat[PATLEN];
- } HT;
- HT *ht; /* Declare a pointer to a hash table */
- /* prototypes */
- void grab(int n);
- word readFileShort(void);
- void cleanup(void);
- void fixWildCards(char *buf); /* In fixwild.c */
- void pattSearch(void);
- void
- main(int argc, char *argv[])
- {
- word w, len;
- int h, i;
- int patlen;
- if (argc <= 2)
- {
- printf("Usage: srchsig <SigFilename> <PattFilename>\n");
- printf("Searches the signature file for the given pattern\n");
- printf("e.g. %s dccm8s.sig mypatt.bin\n", argv[0]);
- exit(1);
- }
- if ((f = fopen(argv[1], "rb")) == NULL)
- {
- printf("Cannot open signature file %s\n", argv[1]);
- exit(2);
- }
- if ((fpat = fopen(argv[2], "rb")) == NULL)
- {
- printf("Cannot open pattern file %s\n", argv[2]);
- exit(2);
- }
- /* Read the parameters */
- grab(4);
- if (memcmp("dccs", buf, 4) != 0)
- {
- printf("Not a dccs file!\n");
- exit(3);
- }
- numKeys = readFileShort();
- numVert = readFileShort();
- PatLen = readFileShort();
- SymLen = readFileShort();
- /* Initialise the perfhlib stuff. Also allocates T1, T2, g, etc */
- hashParams( /* Set the parameters for the hash table */
- numKeys, /* The number of symbols */
- PatLen, /* The length of the pattern to be hashed */
- 256, /* The character set of the pattern (0-FF) */
- 0, /* Minimum pattern character value */
- numVert); /* Specifies C, the sparseness of the graph.
- See Czech, Havas and Majewski for details
- */
- T1base = readT1();
- T2base = readT2();
- g = readG();
- /* Read T1 and T2 tables */
- grab(2);
- if (memcmp("T1", buf, 2) != 0)
- {
- printf("Expected 'T1'\n");
- exit(3);
- }
- len = PatLen * 256 * sizeof(word);
- w = readFileShort();
- if (w != len)
- {
- printf("Problem with size of T1: file %d, calc %d\n", w, len);
- exit(4);
- }
- if (fread(T1base, 1, len, f) != len)
- {
- printf("Could not read T1\n");
- exit(5);
- }
- grab(2);
- if (memcmp("T2", buf, 2) != 0)
- {
- printf("Expected 'T2'\n");
- exit(3);
- }
- w = readFileShort();
- if (w != len)
- {
- printf("Problem with size of T2: file %d, calc %d\n", w, len);
- exit(4);
- }
- if (fread(T2base, 1, len, f) != len)
- {
- printf("Could not read T2\n");
- exit(5);
- }
- /* Now read the function g[] */
- grab(2);
- if (memcmp("gg", buf, 2) != 0)
- {
- printf("Expected 'gg'\n");
- exit(3);
- }
- len = numVert * sizeof(word);
- w = readFileShort();
- if (w != len)
- {
- printf("Problem with size of g[]: file %d, calc %d\n", w, len);
- exit(4);
- }
- if (fread(g, 1, len, f) != len)
- {
- printf("Could not read T2\n");
- exit(5);
- }
- /* This is now the hash table */
- /* First allocate space for the table */
- if ((ht = (HT *)malloc(numKeys * sizeof(HT))) == 0)
- {
- printf("Could not allocate hash table\n");
- exit(1);
- }
- grab(2);
- if (memcmp("ht", buf, 2) != 0)
- {
- printf("Expected 'ht'\n");
- exit(3);
- }
- w = readFileShort();
- if (w != numKeys * (SymLen + PatLen + sizeof(word)))
- {
- printf("Problem with size of hash table: file %d, calc %d\n", w, len);
- exit(6);
- }
- for (i=0; i < numKeys; i++)
- {
- if ((int)fread(&ht[i], 1, SymLen + PatLen, f) != SymLen + PatLen)
- {
- printf("Could not read\n");
- exit(11);
- }
- }
- /* Read the pattern to buf */
- if ((patlen = fread(buf, 1, 100, fpat)) == 0)
- {
- printf("Could not read pattern\n");
- exit(11);
- }
- if (patlen != PATLEN)
- {
- printf("Error: pattern length is %d, should be %d\n", patlen, PATLEN);
- exit(12);
- }
- /* Fix the wildcards */
- fixWildCards(buf);
- printf("Pattern:\n");
- for (i=0; i < PATLEN; i++)
- printf("%02X ", buf[i]);
- printf("\n");
- h = hash(buf);
- printf("Pattern hashed to %d (0x%X), symbol %s\n", h, h, ht[h].htSym);
- if (memcmp(ht[h].htPat, buf, PATLEN) == 0)
- {
- printf("Pattern matched");
- }
- else
- {
- printf("Pattern mismatch: found following pattern\n");
- for (i=0; i < PATLEN; i++)
- printf("%02X ", ht[h].htPat[i]);
- printf("\n");
- pattSearch(); /* Look for it the hard way */
- }
- cleanup();
- free(ht);
- fclose(f);
- fclose(fpat);
- }
- void pattSearch(void)
- {
- int i;
- for (i=0; i < numKeys; i++)
- {
- if ((i % 100) == 0) printf("\r%d ", i);
- if (memcmp(ht[i].htPat, buf, PATLEN) == 0)
- {
- printf("\nPattern matched offset %d (0x%X)\n", i, i);
- }
- }
- printf("\n");
- }
- void
- cleanup(void)
- {
- /* Free the storage for variable sized tables etc */
- if (T1base) free(T1base);
- if (T2base) free(T2base);
- if (g) free(g);
- }
- void grab(int n)
- {
- if (fread(buf, 1, n, f) != (size_t)n)
- {
- printf("Could not read\n");
- exit(11);
- }
- }
- word
- readFileShort(void)
- {
- byte b1, b2;
- if (fread(&b1, 1, 1, f) != 1)
- {
- printf("Could not read\n");
- exit(11);
- }
- if (fread(&b2, 1, 1, f) != 1)
- {
- printf("Could not read\n");
- exit(11);
- }
- return (b2 << 8) + b1;
- }
- /* Following two functions not needed unless creating tables */
- void getKey(int i, byte **keys)
- {
- }
- /* Display key i */
- void
- dispKey(int i)
- {
- }
|