Subversion Repositories tendra.SVN

Rev

Rev 5 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 5 Rev 6
Line -... Line 1...
- 
 
 1 
/*
- 
 
 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 
 */
1 
/*
 31 
/*
2 
    		 Crown Copyright (c) 1997
 32 
    		 Crown Copyright (c) 1997
3
33 
 
4 
    This TenDRA(r) Computer Program is subject to Copyright
 34 
    This TenDRA(r) Computer Program is subject to Copyright
5 
    owned by the United Kingdom Secretary of State for Defence
 35 
    owned by the United Kingdom Secretary of State for Defence
6 
    acting through the Defence Evaluation and Research Agency
 36 
    acting through the Defence Evaluation and Research Agency
7 
    (DERA).  It is made available to Recipients with a
 37 
    (DERA).  It is made available to Recipients with a
8 
    royalty-free licence for its use, reproduction, transfer
 38 
    royalty-free licence for its use, reproduction, transfer
9 
    to other parties and amendment for any purpose not excluding
 39 
    to other parties and amendment for any purpose not excluding
10 
    product development provided that any such use et cetera
 40 
    product development provided that any such use et cetera
11 
    shall be deemed to be acceptance of the following conditions:-
 41 
    shall be deemed to be acceptance of the following conditions:-
12
42 
 
13 
        (1) Its Recipients shall ensure that this Notice is
 43 
        (1) Its Recipients shall ensure that this Notice is
14 
        reproduced upon any copies or amended versions of it;
 44 
        reproduced upon any copies or amended versions of it;
15
45 
 
16 
        (2) Any amended version of it shall be clearly marked to
 46 
        (2) Any amended version of it shall be clearly marked to
17 
        show both the nature of and the organisation responsible
 47 
        show both the nature of and the organisation responsible
18 
        for the relevant amendment or amendments;
 48 
        for the relevant amendment or amendments;
19
49 
 
20 
        (3) Its onward transfer from a recipient to another
 50 
        (3) Its onward transfer from a recipient to another
21 
        party shall be deemed to be that party's acceptance of
 51 
        party shall be deemed to be that party's acceptance of
22 
        these conditions;
 52 
        these conditions;
23
53 
 
24 
        (4) DERA gives no warranty or assurance as to its
 54 
        (4) DERA gives no warranty or assurance as to its
25 
        quality or suitability for any purpose and DERA accepts
 55 
        quality or suitability for any purpose and DERA accepts
26 
        no liability whatsoever in relation to any use to which
 56 
        no liability whatsoever in relation to any use to which
27 
        it may be put.
 57 
        it may be put.
28 
*/
 58 
*/
Line 37... Line 67...
37 
 
 67 
 
38 
    The routines in this module are concerned with the look-up of identifiers
 68 
    The routines in this module are concerned with the look-up of identifiers
39 
    in the hash table.
 69 
    in the hash table.
40 
*/
 70 
*/
41 
 
 71 
 
42 
extern HASHID lookup_name PROTO_S ( ( string, unsigned long, int, int ) ) ;
 72 
extern HASHID lookup_name(string, unsigned long, int, int);
43 
extern HASHID lookup_conv PROTO_S ( ( TYPE ) ) ;
 73 
extern HASHID lookup_conv(TYPE);
44 
extern HASHID lookup_constr PROTO_S ( ( TYPE, IDENTIFIER ) ) ;
 74 
extern HASHID lookup_constr(TYPE, IDENTIFIER);
45 
extern HASHID lookup_destr PROTO_S ( ( TYPE, IDENTIFIER ) ) ;
 75 
extern HASHID lookup_destr(TYPE, IDENTIFIER);
46 
extern HASHID lookup_anon PROTO_S ( ( void ) ) ;
 76 
extern HASHID lookup_anon(void);
47 
extern HASHID expand_name PROTO_S ( ( HASHID, CLASS_TYPE ) ) ;
 77 
extern HASHID expand_name(HASHID, CLASS_TYPE);
48 
extern HASHID next_expand_name PROTO_S ( ( HASHID ) ) ;
 78 
extern HASHID next_expand_name(HASHID);
49 
extern void prime_name PROTO_S ( ( IDENTIFIER ) ) ;
 79 
extern void prime_name(IDENTIFIER);
50 
 
 80 
 
51 
extern int find_hashid PROTO_S ( ( HASHID ) ) ;
 81 
extern int find_hashid(HASHID);
52 
extern void init_hash PROTO_S ( ( void ) ) ;
 82 
extern void init_hash(void);
53 
extern IDENTIFIER underlying_id PROTO_S ( ( IDENTIFIER ) ) ;
 83 
extern IDENTIFIER underlying_id(IDENTIFIER);
54 
extern void set_hashid_loc PROTO_S ( ( IDENTIFIER, IDENTIFIER ) ) ;
 84 
extern void set_hashid_loc(IDENTIFIER, IDENTIFIER);
55 
extern unsigned long hash PROTO_S ( ( string ) ) ;
 85 
extern unsigned long hash(string);
56 
extern IDENTIFIER underlying_op ;
 86 
extern IDENTIFIER underlying_op;
57 
extern HASHID *hash_ops_table ;
 87 
extern HASHID *hash_ops_table;
58 
extern HASHID hash_keyword [] ;
 88 
extern HASHID hash_keyword[];
59 
extern HASHID *hash_table ;
 89 
extern HASHID *hash_table;
60 
 
 90 
 
61 
 
 91 
 
62 
/*
 92 
/*
63 
    LOOK UP AN OVERLOADED OPERATOR FUNCTION NAME
 93 
    LOOK UP AN OVERLOADED OPERATOR FUNCTION NAME
64 
 
 94 
 
Line 66... Line 96...
66 
    function name corresponding to the lexical token number T.  Note that
 96 
    function name corresponding to the lexical token number T.  Note that
67 
    the ISO keywords and digraphs have already been mapped onto their
 97 
    the ISO keywords and digraphs have already been mapped onto their
68 
    primary representations.
 98 
    primary representations.
69 
*/
 99 
*/
70 
 
 100 
 
71 
#define lookup_op( T )		( hash_ops_table [ ( T ) ] )
 101 
#define lookup_op(T)		(hash_ops_table[(T)])
72 
 
 102 
 
73 
 
 103 
 
74 
/*
 104 
/*
75 
    HASH TABLE SIZES
 105 
    HASH TABLE SIZES
76 
 
 106 
 
77 
    These macros give the sizes of various hash tables.
 107 
    These macros give the sizes of various hash tables.
78 
*/
 108 
*/
79 
 
 109 
 
80 
#define HASH_SIZE		( ( unsigned long ) 4096 )
 110 
#define HASH_SIZE		((unsigned long)4096)
81 
#define HASH_POWER		( ( unsigned long ) 37 )
 111 
#define HASH_POWER		((unsigned long)37)
82 
#define HASH_TYPE_SIZE		( ( unsigned long ) 256 )
 112 
#define HASH_TYPE_SIZE		((unsigned long)256)
83 
 
 113 
 
84 
 
 114 
 
85 
/*
 115 
/*
86 
    KEYWORD HASH TABLE ENTRIES
 116 
    KEYWORD HASH TABLE ENTRIES
87 
 
 117 
 
88 
    The macro KEYWORD gives a convenient method of accessing the table
 118 
    The macro KEYWORD gives a convenient method of accessing the table
89 
    hash_keyword.
 119 
    hash_keyword.
90 
*/
 120 
*/
91 
 
 121 
 
92 
#define KEYWORD( T )		( hash_keyword [ ( T ) - lex_auto ] )
 122 
#define KEYWORD(T)		(hash_keyword[(T) - lex_auto])
93 
#define EQ_KEYWORD( N, T )	EQ_hashid ( ( N ), KEYWORD ( T ) )
 123 
#define EQ_KEYWORD(N, T)	EQ_hashid((N), KEYWORD(T))
94 
 
 124 
 
95 
 
 125 
 
96 
#endif
 126 
#endif