| 2 |
7u83 |
1 |
/*
|
| 6 |
7u83 |
2 |
* Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
|
|
|
3 |
* All rights reserved.
|
|
|
4 |
*
|
|
|
5 |
* Redistribution and use in source and binary forms, with or without
|
|
|
6 |
* modification, are permitted provided that the following conditions are met:
|
|
|
7 |
*
|
|
|
8 |
* 1. Redistributions of source code must retain the above copyright notice,
|
|
|
9 |
* this list of conditions and the following disclaimer.
|
|
|
10 |
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
11 |
* this list of conditions and the following disclaimer in the documentation
|
|
|
12 |
* and/or other materials provided with the distribution.
|
|
|
13 |
* 3. Neither the name of The TenDRA Project nor the names of its contributors
|
|
|
14 |
* may be used to endorse or promote products derived from this software
|
|
|
15 |
* without specific, prior written permission.
|
|
|
16 |
*
|
|
|
17 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
|
|
|
18 |
* IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
|
|
19 |
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
20 |
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
|
|
|
21 |
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
|
22 |
* EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
23 |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
|
24 |
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
|
25 |
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
|
26 |
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
|
27 |
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
28 |
*
|
|
|
29 |
* $Id$
|
|
|
30 |
*/
|
|
|
31 |
/*
|
| 2 |
7u83 |
32 |
Crown Copyright (c) 1997
|
| 6 |
7u83 |
33 |
|
| 2 |
7u83 |
34 |
This TenDRA(r) Computer Program is subject to Copyright
|
|
|
35 |
owned by the United Kingdom Secretary of State for Defence
|
|
|
36 |
acting through the Defence Evaluation and Research Agency
|
|
|
37 |
(DERA). It is made available to Recipients with a
|
|
|
38 |
royalty-free licence for its use, reproduction, transfer
|
|
|
39 |
to other parties and amendment for any purpose not excluding
|
|
|
40 |
product development provided that any such use et cetera
|
|
|
41 |
shall be deemed to be acceptance of the following conditions:-
|
| 6 |
7u83 |
42 |
|
| 2 |
7u83 |
43 |
(1) Its Recipients shall ensure that this Notice is
|
|
|
44 |
reproduced upon any copies or amended versions of it;
|
| 6 |
7u83 |
45 |
|
| 2 |
7u83 |
46 |
(2) Any amended version of it shall be clearly marked to
|
|
|
47 |
show both the nature of and the organisation responsible
|
|
|
48 |
for the relevant amendment or amendments;
|
| 6 |
7u83 |
49 |
|
| 2 |
7u83 |
50 |
(3) Its onward transfer from a recipient to another
|
|
|
51 |
party shall be deemed to be that party's acceptance of
|
|
|
52 |
these conditions;
|
| 6 |
7u83 |
53 |
|
| 2 |
7u83 |
54 |
(4) DERA gives no warranty or assurance as to its
|
|
|
55 |
quality or suitability for any purpose and DERA accepts
|
|
|
56 |
no liability whatsoever in relation to any use to which
|
|
|
57 |
it may be put.
|
|
|
58 |
*/
|
|
|
59 |
|
|
|
60 |
|
|
|
61 |
#ifndef HASH_INCLUDED
|
|
|
62 |
#define HASH_INCLUDED
|
|
|
63 |
|
| 6 |
7u83 |
64 |
#ifndef OBJECT_INCLUDED
|
|
|
65 |
#include "object.h"
|
|
|
66 |
#endif
|
| 2 |
7u83 |
67 |
|
|
|
68 |
/*
|
|
|
69 |
TYPE REPRESENTING A HASH TABLE ELEMENT
|
|
|
70 |
|
|
|
71 |
A hash table element consists of an object plus a version number.
|
|
|
72 |
*/
|
|
|
73 |
|
|
|
74 |
typedef struct hash_elem_tag {
|
| 6 |
7u83 |
75 |
object *obj;
|
|
|
76 |
int vers;
|
|
|
77 |
struct hash_elem_tag *next;
|
|
|
78 |
} hash_elem;
|
| 2 |
7u83 |
79 |
|
|
|
80 |
|
|
|
81 |
/*
|
|
|
82 |
TYPE REPRESENTING A HASH TABLE
|
|
|
83 |
|
|
|
84 |
A hash table consists of a name, which is used in error reports,
|
|
|
85 |
and an array of hash elements.
|
|
|
86 |
*/
|
|
|
87 |
|
|
|
88 |
#define hash_size 31
|
|
|
89 |
|
|
|
90 |
typedef struct {
|
| 6 |
7u83 |
91 |
char *name;
|
|
|
92 |
hash_elem *array [ hash_size ];
|
|
|
93 |
} hash_table;
|
| 2 |
7u83 |
94 |
|
|
|
95 |
|
|
|
96 |
/*
|
|
|
97 |
SPECIAL VERSION NUMBERS
|
|
|
98 |
|
|
|
99 |
Explicitly stated version numbers are always positive. These are
|
|
|
100 |
special version numbers for when no version number is given, or
|
|
|
101 |
when a match with any version is permissable.
|
|
|
102 |
*/
|
|
|
103 |
|
|
|
104 |
#define no_version -1
|
|
|
105 |
#define any_version -2
|
|
|
106 |
|
|
|
107 |
|
|
|
108 |
/*
|
|
|
109 |
PROCEDURE DECLARATIONS
|
|
|
110 |
|
|
|
111 |
These routines are concerned with adding and looking up objects in
|
|
|
112 |
hash tables.
|
|
|
113 |
*/
|
|
|
114 |
|
| 6 |
7u83 |
115 |
extern hash_table *make_hash_table(char *);
|
|
|
116 |
extern object *add_hash(hash_table *, object *, int);
|
|
|
117 |
extern object *search_hash(hash_table *, char *, int);
|
|
|
118 |
extern hash_elem *sort_hash(hash_table *);
|
|
|
119 |
extern void init_hash(void);
|
| 2 |
7u83 |
120 |
|
|
|
121 |
|
|
|
122 |
/*
|
|
|
123 |
STANDARD HASH TABLES
|
|
|
124 |
|
|
|
125 |
These hash tables represent the basic namespaces.
|
|
|
126 |
*/
|
|
|
127 |
|
| 6 |
7u83 |
128 |
extern hash_table *exps;
|
|
|
129 |
extern hash_table *files;
|
|
|
130 |
extern hash_table *keywords;
|
|
|
131 |
extern hash_table *subsets;
|
|
|
132 |
extern hash_table *tags;
|
|
|
133 |
extern hash_table *tag_fields;
|
|
|
134 |
extern hash_table *tokens;
|
|
|
135 |
extern hash_table *types;
|
|
|
136 |
extern hash_table *type_fields;
|
| 2 |
7u83 |
137 |
|
|
|
138 |
|
|
|
139 |
#endif
|