Subversion Repositories tendra.SVN

Rev

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

Rev Author Line No. Line
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 
/*** rstack.c --- Renaming stack ADT.
62 
 *
63 
 ** Author: Steve Folkes <smf@hermes.mod.uk>
64 
 *
65 
 *** Commentary:
66 
 *
67 
 * This file implements the renaming stack routines.  They are mainly used by
68 
 * the output routines to do scoping of inlined rules.
69 
 *
70 
 *** Change Log:
71 
 * $Log: rstack.c,v $
72 
 * Revision 1.1.1.1  1998/01/17  15:57:46  release
73 
 * First version to be checked into rolling release.
74 
 *
75 
 * Revision 1.2  1994/12/15  09:58:31  smf
76 
 * Brought into line with OSSG C Coding Standards Document, as per
77 
 * "CR94_178.sid+tld-update".
78 
 *
79 
 * Revision 1.1.1.1  1994/07/25  16:04:37  smf
80 
 * Initial import of SID 1.8 non shared files.
81 
 *
82 
**/
83 
 
84 
/****************************************************************************/
85 
 
86 
#include "rstack.h"
87 
#include "action.h"
88 
#include "basic.h"
89 
#include "name.h"
90 
#include "rule.h"
91 
#include "type.h"
92 
 
93 
/*--------------------------------------------------------------------------*/
94 
 
95 
void
6 7u83 96 
rstack_init(RStackP rstack)
2 7u83 97 
{
6 7u83 98 
    rstack->head = NIL(TransStackEntryP);
2 7u83 99 
}
100 
 
101 
void
6 7u83 102 
rstack_push_frame(RStackP rstack)
2 7u83 103 
{
6 7u83 104 
    TransStackEntryP frame = ALLOCATE(TransStackEntryT);
2 7u83 105 
 
106 
    frame->next = rstack->head;
6 7u83 107 
    rtrans_init(&(frame->translator));
2 7u83 108 
    rstack->head = frame;
109 
}
110 
 
111 
void
6 7u83 112 
rstack_compute_formal_renaming(RStackP rstack, TypeTupleP names)
2 7u83 113 
{
6 7u83 114 
    ASSERT(rstack->head);
115 
    types_compute_formal_renaming(names, &(rstack->head->translator));
2 7u83 116 
}
117 
 
118 
void
6 7u83 119 
rstack_compute_formal_inlining(RStackP rstack, TypeTupleP names,
120 
			       TypeTupleP renames)
2 7u83 121 
{
122 
    SaveRStackT state;
123 
 
6 7u83 124 
    ASSERT(rstack->head);
2 7u83 125 
    state.head = rstack->head->next;
6 7u83 126 
    types_compute_formal_inlining(names, renames, &(rstack->head->translator),
127 
				  &state);
2 7u83 128 
}
129 
 
130 
void
6 7u83 131 
rstack_compute_local_renaming(RStackP rstack, TypeTupleP names,
132 
			      TypeTupleP exclude, TableP table)
2 7u83 133 
{
134 
    SaveRStackT state;
135 
 
6 7u83 136 
    ASSERT(rstack->head);
2 7u83 137 
    state.head = rstack->head->next;
6 7u83 138 
    types_compute_local_renaming(names, exclude, &(rstack->head->translator),
139 
				 &state, table);
2 7u83 140 
}
141 
 
142 
void
6 7u83 143 
rstack_add_translation(RStackP rstack, EntryP from, EntryP to, EntryP type,
144 
		       BoolT reference)
2 7u83 145 
{
6 7u83 146 
    ASSERT(rstack->head);
147 
    rtrans_add_translation(&(rstack->head->translator), from, to, type,
148 
			   reference);
2 7u83 149 
}
150 
 
151 
void
6 7u83 152 
rstack_save_state(RStackP rstack, SaveRStackP state)
2 7u83 153 
{
154 
    state->head = rstack->head;
155 
}
156 
 
157 
EntryP
6 7u83 158 
rstack_get_translation(SaveRStackP state, EntryP entry, EntryP *type_ref,
159 
		       BoolT *reference_ref)
2 7u83 160 
{
161 
    TransStackEntryP frame = state->head;
162 
 
163 
    while (frame) {
164 
	EntryP translation;
165 
 
6 7u83 166 
	translation = rtrans_get_translation(&(frame->translator), entry,
167 
					     type_ref, reference_ref);
2 7u83 168 
	if (translation) {
6 7u83 169 
	    return(translation);
2 7u83 170 
	}
171 
	frame = frame->next;
172 
    }
6 7u83 173 
    return(NIL(EntryP));
2 7u83 174 
}
175 
 
176 
void
6 7u83 177 
rstack_apply_for_non_locals(RStackP non_local_stack, SaveRStackP state,
178 
			    void (*proc)(EntryP, EntryP, GenericP),
179 
			    GenericP closure)
2 7u83 180 
{
181 
    TransStackEntryP frame = non_local_stack->head;
182 
 
6 7u83 183 
    if ((frame != NIL(TransStackEntryP)) && (state->head)) {
2 7u83 184 
	TransStackEntryP limit = state->head->next;
185 
 
186 
	for (; frame != limit; frame = frame->next) {
6 7u83 187 
	    rtrans_apply_for_non_locals(&(frame->translator), proc, closure);
2 7u83 188 
	}
189 
    }
190 
}
191 
 
192 
void
6 7u83 193 
rstack_pop_frame(RStackP rstack)
2 7u83 194 
{
195 
    TransStackEntryP frame = rstack->head;
196 
 
197 
    rstack->head = frame->next;
6 7u83 198 
    rtrans_destroy(&(frame->translator));
199 
    DEALLOCATE(frame);
2 7u83 200 
}
201 
 
202 
void
6 7u83 203 
rstack_destroy(RStackP rstack)
2 7u83 204 
{
205 
    while (rstack->head) {
6 7u83 206 
	rstack_pop_frame(rstack);
2 7u83 207 
    }
208 
}
209 
 
210 
/*
211 
 * Local variables(smf):
212 
 * eval: (include::add-path-entry "../os-interface" "../library")
213 
 * eval: (include::add-path-entry "../generated")
214 
 * end:
215 
**/