|
|
1.1 root 1: /*
2: ** Number of hash buckets, best performance if 2*number entries.
3: */
4: #define BB_MAX_HASH (2 * BB_MAX_IMP)
5: #define BB_HASH_TABLE_FULL (-1)
6: #define BB_HASH_ID_NOT_FOUND (-2)
7:
8: /*
9: ** Defines for the names of the data files.
10: */
11: #define BB_CODATA_FILE "bb_data.company"
12: #define BB_PASSWD_FILE "bb_data.passwd"
13: #define BB_PHASE_FILE "bb_data.phases"
14: #define BB_BOARD_FILE "bb_data.board"
15:
16: /*
17: ** Defines for the company data file.
18: */
19: #define BB_COMMENT_DESIGNATOR '#'
20: #define BB_IP_DESIGNATOR 'P'
21: #define BB_CO_DESIGNATOR 'C'
22: #define BB_IMP_DESIGNATOR 'I'
23: #define BB_ID_DESIGNATOR 'D'
24: #define BB_BOOTH_DESIGNATOR 'B'
25: #define BB_FLAGS_DESIGNATOR 'F'
26: #define BB_END_DESIGNATOR 'E'
27: #define BB_DES_CHAR 1 /* Unique of all DESIGN.*/
28: #define BB_DES_START 3 /* Start of data in line*/
29:
30: #define BB_IP_SEPARATOR " "
31: #define BB_IP_ADDR_LEN 16
32: #define BB_MAX_IP (2*BB_MAX_IMP)
33:
34: #define BB_BOARD_UNSET 0
35: #define BB_BOARD_SET 1
36:
37: #define BB_SUN_SERVER "SUN"
38: #define BB_SUN_PHASE 1
39:
40: /*
41: ** This is a bucket of the hash table used to hash the implementation
42: ** name to an index.
43: */
44: typedef struct
45: {
46: char *id_ptr; /* ptr to co_data.identifier */
47: short index; /* The index assigned this implementation*/
48: } BB_bucket;
49:
50: /*
51: ** The hash table structure is an array of buckets. We are not worried
52: ** about the space limitations for this project.
53: */
54: typedef BB_bucket BB_hash[ BB_MAX_HASH];
55:
56: typedef struct
57: {
58: char company[BB_COMPANY_NAME_LEN];
59: char imp[BB_IMP_NAME_LEN];
60: BB_id id; /* Assigned reference name. */
61: int booth;
62: short flags; /* BB_SERVER, BB_CLIENT, BB_NONE*/
63: short ip_cnt; /* # of internet addresses */
64: short ip_idx; /* index to ip table. */
65: } BB_co_data;
66:
67: typedef char BB_ip[BB_IP_ADDR_LEN];
68: typedef uchar BB_phase; /* BB_PHASE1, BB_PHASE2 */
69:
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.