Subversion Repositories tendra.SVN

Rev

Rev 2 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 7u83 1
/*
7 7u83 2
 * Copyright (c) 2002-2006 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
7 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:-
7 7u83 42
 
2 7u83 43
        (1) Its Recipients shall ensure that this Notice is
44
        reproduced upon any copies or amended versions of it;
7 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;
7 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;
7 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 NAMESPACE_INCLUDED
62
#define NAMESPACE_INCLUDED
63
 
64
 
65
/*
66
    NAMESPACE DECLARATIONS
67
 
68
    The routines in this module are concerned with the construction and
69
    manipulation of namespaces.
70
*/
71
 
7 7u83 72
extern void begin_declarator(IDENTIFIER, QUALIFIER, NAMESPACE, int);
73
extern void end_declarator(IDENTIFIER, int);
74
extern void begin_namespace(IDENTIFIER, int);
75
extern void end_namespace(int);
76
extern void alias_namespace(IDENTIFIER, NAMESPACE);
77
extern void using_namespace(NAMESPACE);
78
extern int use_namespace(NAMESPACE, NAMESPACE, NAMESPACE);
79
extern void target_decl(int, EXP);
80
extern void begin_decl_block(IDENTIFIER);
81
extern int end_decl_block(IDENTIFIER, int);
82
extern void clear_decl_blocks(void);
83
extern NAMESPACE find_namespace(IDENTIFIER);
84
extern NAMESPACE find_nspace_id(IDENTIFIER);
85
extern int has_linkage(IDENTIFIER);
2 7u83 86
 
7 7u83 87
extern NAMESPACE make_namespace(IDENTIFIER, unsigned, int);
88
extern NAMESPACE make_global_nspace(CONST char *, int);
89
extern void uncache_namespace(NAMESPACE, int);
90
extern void add_namespace(NAMESPACE);
91
extern void remove_namespace(void);
92
extern void push_namespace(NAMESPACE);
93
extern void store_namespace(NAMESPACE);
94
extern NAMESPACE pop_namespace(void);
95
extern NAMESPACE restore_namespace(void);
96
extern int add_nested_nspace(NAMESPACE);
97
extern int remove_nested_nspace(NAMESPACE);
98
extern int is_subnspace(NAMESPACE, NAMESPACE);
99
extern void update_namespace(void);
100
extern void check_hiding(IDENTIFIER);
101
extern void init_namespace(void);
2 7u83 102
 
7 7u83 103
extern MEMBER search_member(NAMESPACE, HASHID, int);
104
extern IDENTIFIER search_id(NAMESPACE, HASHID, int, int);
105
extern IDENTIFIER find_id(HASHID);
106
extern IDENTIFIER find_type_id(HASHID, int);
107
extern IDENTIFIER find_qual_id(NAMESPACE, HASHID, int, int);
108
extern IDENTIFIER find_extern_id(HASHID, NAMESPACE, int);
109
extern IDENTIFIER check_id(NAMESPACE, IDENTIFIER, int);
110
extern IDENTIFIER type_member(MEMBER, int);
111
extern MEMBER update_member(NAMESPACE, MEMBER);
112
extern void set_type_member(MEMBER, IDENTIFIER);
113
extern void set_member(MEMBER, IDENTIFIER);
114
extern void clear_member(NAMESPACE, HASHID);
115
extern IDENTIFIER find_op_id(HASHID);
116
extern void remove_id(IDENTIFIER);
2 7u83 117
 
7 7u83 118
extern STACK(NAMESPACE) local_nspace_stack;
119
extern STACK(NAMESPACE) crt_nspace_stack;
120
extern STACK(NAMESPACE) namespace_stack;
121
extern NAMESPACE nonblock_namespace;
122
extern NAMESPACE nonclass_namespace;
123
extern NAMESPACE global_namespace;
124
extern NAMESPACE token_namespace;
125
extern NAMESPACE last_namespace;
126
extern NAMESPACE qual_namespace;
127
extern NAMESPACE crt_namespace;
128
extern NAMESPACE c_namespace;
129
extern int old_cache_lookup;
130
extern int cache_lookup;
2 7u83 131
 
132
 
133
#endif