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-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
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 
/*** rule-mutate.c --- Compute mutation effects.
62 
 *
63 
 ** Author: Steve Folkes <smf@hermes.mod.uk>
64 
 *
65 
 *** Commentary:
66 
 *
67 
 * This file implements the functions that compute the propogation of mutation
68 
 * effects from actions that mutate their parameters.
69 
 *
70 
 *** Change Log:
71 
 * $Log: rule-mutate.c,v $
72 
 * Revision 1.1.1.1  1998/01/17  15:57:47  release
73 
 * First version to be checked into rolling release.
74 
 *
75 
 * Revision 1.2  1994/12/15  09:58:48  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:40  smf
80 
 * Initial import of SID 1.8 non shared files.
81 
 *
82 
**/
83 
 
84 
/****************************************************************************/
85 
 
86 
#include "rule.h"
87 
#include "action.h"
88 
#include "types.h"
89 
 
90 
/*--------------------------------------------------------------------------*/
91 
 
7 7u83 92 
static void			rule_compute_mutations_3(EntryP, GenericP);
2 7u83 93 
 
94 
static void
7 7u83 95 
rule_compute_mutations_4(RuleP rule, AltP alt, RuleP from_rule)
2 7u83 96 
{
97 
    BoolT  propogate = FALSE;
98 
    ItemP  item;
99 
 
7 7u83 100 
    for (item = alt_item_head(alt); item; item = item_next(item)) {
101 
	switch (item_type(item))EXHAUSTIVE {
2 7u83 102 
	  case ET_RULE:
7 7u83 103 
	    if (entry_get_rule(item_entry(item)) == from_rule) {
104 
		if (types_compute_mutations(rule_param(rule),
105 
					    item_param(item),
106 
					    rule_param(from_rule))) {
2 7u83 107 
		    propogate = TRUE;
108 
		}
109 
	    }
110 
	    break;
111 
	  case ET_ACTION:
112 
	  case ET_PREDICATE:
113 
	  case ET_RENAME:
114 
	  case ET_BASIC:
115 
	    break;
116 
	  case ET_NON_LOCAL:
117 
	  case ET_TYPE:
118 
	  case ET_NAME:
119 
	    UNREACHED;
120 
	}
121 
    }
122 
    if (propogate) {
7 7u83 123 
	entry_list_iter(rule_reverse_list(rule), rule_compute_mutations_3,
124 
			(GenericP)rule);
2 7u83 125 
    }
126 
}
127 
 
128 
static void
7 7u83 129 
rule_compute_mutations_3(EntryP entry, GenericP gclosure)
2 7u83 130 
{
7 7u83 131 
    RuleP rule      = entry_get_rule(entry);
132 
    RuleP from_rule = (RuleP)gclosure;
2 7u83 133 
    AltP  alt;
134 
 
7 7u83 135 
    if ((alt = rule_get_handler(rule)) != NIL(AltP)) {
136 
	rule_compute_mutations_4(rule, alt, from_rule);
2 7u83 137 
    }
7 7u83 138 
    for (alt = rule_alt_head(rule); alt; alt = alt_next(alt)) {
139 
	rule_compute_mutations_4(rule, alt, from_rule);
2 7u83 140 
    }
141 
}
142 
 
143 
static void
7 7u83 144 
rule_compute_mutations_2(RuleP rule, AltP alt)
2 7u83 145 
{
146 
    BoolT   propogate = FALSE;
147 
    ItemP   item;
148 
    ActionP action;
149 
 
7 7u83 150 
    for (item = alt_item_head(alt); item; item = item_next(item)) {
151 
	switch (item_type(item))EXHAUSTIVE {
2 7u83 152 
	  case ET_ACTION:
153 
	  case ET_PREDICATE:
7 7u83 154 
	    action = entry_get_action(item_entry(item));
155 
	    if (types_compute_mutations(rule_param(rule), item_param(item),
156 
					action_param(action))) {
2 7u83 157 
		propogate = TRUE;
158 
	    }
159 
	    break;
160 
	  case ET_RENAME:
161 
	  case ET_BASIC:
162 
	  case ET_RULE:
163 
	    break;
164 
	  case ET_NON_LOCAL:
165 
	  case ET_TYPE:
166 
	  case ET_NAME:
167 
	    UNREACHED;
168 
	}
7 7u83 169 
	if (types_compute_assign_mutations(rule_param(rule),
170 
					   item_param(item))) {
2 7u83 171 
	    propogate = TRUE;
172 
	}
173 
    }
174 
    if (propogate) {
7 7u83 175 
	entry_list_iter(rule_reverse_list(rule), rule_compute_mutations_3,
176 
			(GenericP)rule);
2 7u83 177 
    }
178 
}
179 
 
180 
static void
7 7u83 181 
rule_compute_mutations_1(RuleP rule)
2 7u83 182 
{
183 
    AltP alt;
184 
 
7 7u83 185 
    if ((alt = rule_get_handler(rule)) != NIL(AltP)) {
186 
	rule_compute_mutations_2(rule, alt);
2 7u83 187 
    }
7 7u83 188 
    for (alt = rule_alt_head(rule); alt; alt = alt_next(alt)) {
189 
	rule_compute_mutations_2(rule, alt);
2 7u83 190 
    }
191 
}
192 
 
193 
/*--------------------------------------------------------------------------*/
194 
 
195 
void
7 7u83 196 
rule_compute_mutations(EntryP entry, GenericP gclosure)
2 7u83 197 
{
7 7u83 198 
    UNUSED(gclosure);
199 
    if (entry_is_rule(entry)) {
200 
	RuleP rule = entry_get_rule(entry);
2 7u83 201 
 
7 7u83 202 
	rule_compute_mutations_1(rule);
2 7u83 203 
    }
204 
}
205 
 
206 
/*
207 
 * Local variables(smf):
208 
 * eval: (include::add-path-entry "../os-interface" "../library")
209 
 * eval: (include::add-path-entry "../generated")
210 
 * end:
211 
**/