|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1988 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that the above copyright notice and this paragraph are ! 7: * duplicated in all such forms and that any documentation, ! 8: * advertising materials, and other materials related to such ! 9: * distribution and use acknowledge that the software was developed ! 10: * by the University of California, Berkeley. The name of the ! 11: * University may not be used to endorse or promote products derived ! 12: * from this software without specific prior written permission. ! 13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 16: * ! 17: * @(#)dohits.h 4.1 (Berkeley) 12/4/88 ! 18: */ ! 19: ! 20: #define numberof(x) (sizeof x/sizeof x[0]) ! 21: #define highestof(x) (numberof(x)-1) ! 22: ! 23: #define firstentry(x) (table[dohash(0, (x))%highestof(table)]) ! 24: ! 25: struct Hits { ! 26: struct hits hits; ! 27: char *name[4]; ! 28: }; ! 29: ! 30: struct thing { ! 31: struct thing *next; ! 32: struct Hits *hits; ! 33: unsigned char value; ! 34: char name[100]; ! 35: }; ! 36: ! 37: extern struct Hits Hits[256]; /* one for each of 0x00-0xff */ ! 38: extern struct thing *table[100]; ! 39: ! 40: extern unsigned int dohash();
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.