| 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 61... |
Line 91... |
| 61 |
#include "types.h"
|
91 |
#include "types.h"
|
| 62 |
|
92 |
|
| 63 |
/*--------------------------------------------------------------------------*/
|
93 |
/*--------------------------------------------------------------------------*/
|
| 64 |
|
94 |
|
| 65 |
static void
|
95 |
static void
|
| 66 |
rule_recompute_alt_names_2 PROTO_N ((alt, predicate_id))
|
96 |
rule_recompute_alt_names_2(AltP alt, EntryP predicate_id)
|
| 67 |
PROTO_T (AltP alt X
|
- |
|
| 68 |
EntryP predicate_id)
|
- |
|
| 69 |
{
|
97 |
{
|
| 70 |
TypeTupleP names = alt_names (alt);
|
98 |
TypeTupleP names = alt_names(alt);
|
| 71 |
ItemP item;
|
99 |
ItemP item;
|
| 72 |
|
100 |
|
| 73 |
types_destroy (names);
|
101 |
types_destroy(names);
|
| 74 |
types_init (names);
|
102 |
types_init(names);
|
| 75 |
for (item = alt_item_head (alt); item; item = item_next (item)) {
|
103 |
for (item = alt_item_head(alt); item; item = item_next(item)) {
|
| 76 |
types_add_new_names (names, item_result (item), predicate_id);
|
104 |
types_add_new_names(names, item_result(item), predicate_id);
|
| 77 |
}
|
105 |
}
|
| 78 |
}
|
106 |
}
|
| 79 |
|
107 |
|
| 80 |
static void
|
108 |
static void
|
| 81 |
rule_recompute_alt_names_1 PROTO_N ((rule, predicate_id))
|
109 |
rule_recompute_alt_names_1(RuleP rule, EntryP predicate_id)
|
| 82 |
PROTO_T (RuleP rule X
|
- |
|
| 83 |
EntryP predicate_id)
|
- |
|
| 84 |
{
|
110 |
{
|
| 85 |
AltP alt;
|
111 |
AltP alt;
|
| 86 |
|
112 |
|
| 87 |
if ((alt = rule_get_handler (rule)) != NIL (AltP)) {
|
113 |
if ((alt = rule_get_handler(rule)) != NIL(AltP)) {
|
| 88 |
rule_recompute_alt_names_2 (alt, predicate_id);
|
114 |
rule_recompute_alt_names_2(alt, predicate_id);
|
| 89 |
}
|
115 |
}
|
| 90 |
for (alt = rule_alt_head (rule); alt; alt = alt_next (alt)) {
|
116 |
for (alt = rule_alt_head(rule); alt; alt = alt_next(alt)) {
|
| 91 |
rule_recompute_alt_names_2 (alt, predicate_id);
|
117 |
rule_recompute_alt_names_2(alt, predicate_id);
|
| 92 |
}
|
118 |
}
|
| 93 |
}
|
119 |
}
|
| 94 |
|
120 |
|
| 95 |
/*--------------------------------------------------------------------------*/
|
121 |
/*--------------------------------------------------------------------------*/
|
| 96 |
|
122 |
|
| 97 |
void
|
123 |
void
|
| 98 |
rule_recompute_alt_names PROTO_N ((entry, gclosure))
|
124 |
rule_recompute_alt_names(EntryP entry, GenericP gclosure)
|
| 99 |
PROTO_T (EntryP entry X
|
- |
|
| 100 |
GenericP gclosure)
|
- |
|
| 101 |
{
|
125 |
{
|
| 102 |
if (entry_is_rule (entry)) {
|
126 |
if (entry_is_rule(entry)) {
|
| 103 |
RuleP rule = entry_get_rule (entry);
|
127 |
RuleP rule = entry_get_rule(entry);
|
| 104 |
EntryP predicate_id = (EntryP) gclosure;
|
128 |
EntryP predicate_id = (EntryP)gclosure;
|
| 105 |
|
129 |
|
| 106 |
rule_recompute_alt_names_1 (rule, predicate_id);
|
130 |
rule_recompute_alt_names_1(rule, predicate_id);
|
| 107 |
}
|
131 |
}
|
| 108 |
}
|
132 |
}
|
| 109 |
|
133 |
|
| 110 |
/*
|
134 |
/*
|
| 111 |
* Local variables(smf):
|
135 |
* Local variables(smf):
|