| 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
|
|
|
33 |
|
|
|
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:-
|
|
|
42 |
|
|
|
43 |
(1) Its Recipients shall ensure that this Notice is
|
|
|
44 |
reproduced upon any copies or amended versions of it;
|
|
|
45 |
|
|
|
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;
|
|
|
49 |
|
|
|
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;
|
|
|
53 |
|
|
|
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 |
/**********************************************************************
|
|
|
62 |
$Author: release $
|
|
|
63 |
$Date: 1998/01/17 15:55:46 $
|
|
|
64 |
$Revision: 1.1.1.1 $
|
|
|
65 |
$Log: aldefs.c,v $
|
|
|
66 |
* Revision 1.1.1.1 1998/01/17 15:55:46 release
|
|
|
67 |
* First version to be checked into rolling release.
|
|
|
68 |
*
|
|
|
69 |
* Revision 1.1 1995/04/06 10:44:05 currie
|
|
|
70 |
* Initial revision
|
|
|
71 |
*
|
|
|
72 |
***********************************************************************/
|
|
|
73 |
|
|
|
74 |
|
|
|
75 |
|
|
|
76 |
#include "config.h"
|
|
|
77 |
#include "common_types.h"
|
|
|
78 |
#include "installglob.h"
|
|
|
79 |
#include "basicread.h"
|
|
|
80 |
#include "messages_c.h"
|
|
|
81 |
|
|
|
82 |
#include "aldefs.h"
|
|
|
83 |
|
| 7 |
7u83 |
84 |
#define max(x, y) ((x) > (y)) ? (x) : (y)
|
| 2 |
7u83 |
85 |
|
|
|
86 |
|
|
|
87 |
/* The alignment definitions form a set of simultaneous equations
|
|
|
88 |
of the form
|
|
|
89 |
|
|
|
90 |
a1 = f1(a1,a2 .. an)
|
|
|
91 |
a2 = f2(a1,a2 ... an)
|
|
|
92 |
...
|
|
|
93 |
|
|
|
94 |
The functions f1 f2 etc. are formed entirely from f_alignment,
|
|
|
95 |
which takes a shape and delivers an alignment, and unite_sets.
|
|
|
96 |
f_alignment provides constants. Since the representation of
|
|
|
97 |
alignments must be a homomorphism of sets under unite_sets, and
|
|
|
98 |
since any program contains a finite number of basic alignments,
|
|
|
99 |
these equations can be solved by iterating unite_sets until
|
|
|
100 |
no further change occurs. Unite_sets is represented here by max.
|
|
|
101 |
*/
|
|
|
102 |
|
|
|
103 |
/* PROCEDURES */
|
|
|
104 |
|
| 7 |
7u83 |
105 |
void
|
|
|
106 |
process_aldefs(void)
|
| 2 |
7u83 |
107 |
{
|
| 7 |
7u83 |
108 |
aldef *my_aldef;
|
|
|
109 |
int changed; /* records whether a change has been made */
|
|
|
110 |
int complete;
|
| 2 |
7u83 |
111 |
|
| 7 |
7u83 |
112 |
/* iterate max until no change */
|
|
|
113 |
do {
|
|
|
114 |
my_aldef = top_aldef;
|
|
|
115 |
changed = 0;
|
|
|
116 |
complete = 1;
|
|
|
117 |
while (my_aldef != (aldef *)0) {
|
|
|
118 |
switch (my_aldef->al.al_n) {
|
|
|
119 |
case 1: break;
|
|
|
120 |
case 2: {
|
|
|
121 |
alignment a1;
|
|
|
122 |
alignment a2;
|
|
|
123 |
a2 = my_aldef->al.al_val.al_join.b;
|
|
|
124 |
a1 = my_aldef->al.al_val.al_join.a;
|
|
|
125 |
if (a1->al.al_n == 1 && a2->al.al_n == 1) {
|
|
|
126 |
my_aldef->al.al_n = 1;
|
|
|
127 |
my_aldef->al.al_val.al =
|
|
|
128 |
max(a1->al.al_val.al, a2->al.al_val.al);
|
|
|
129 |
changed = 1;
|
|
|
130 |
} else {
|
|
|
131 |
complete = 0;
|
|
|
132 |
}
|
|
|
133 |
break;
|
|
|
134 |
}
|
|
|
135 |
case 3: {
|
|
|
136 |
alignment a1;
|
|
|
137 |
a1 = my_aldef->al.al_val.al_join.a;
|
|
|
138 |
if (a1->al.al_n == 1) {
|
|
|
139 |
my_aldef->al.al_n = 1;
|
|
|
140 |
my_aldef->al.al_val.al = a1->al.al_val.al;
|
|
|
141 |
changed = 1;
|
|
|
142 |
} else {
|
|
|
143 |
complete = 0;
|
|
|
144 |
}
|
|
|
145 |
break;
|
|
|
146 |
}
|
|
|
147 |
default:
|
|
|
148 |
failer(ILLEGAL_ALIGNMENT);
|
|
|
149 |
}
|
|
|
150 |
my_aldef = my_aldef->next_aldef;
|
|
|
151 |
}
|
|
|
152 |
} while (changed);
|
| 2 |
7u83 |
153 |
|
| 7 |
7u83 |
154 |
if (!complete) {
|
|
|
155 |
failer(INCOMPLETE_ALIGNMENT_EQS);
|
|
|
156 |
}
|
|
|
157 |
return;
|
| 2 |
7u83 |
158 |
}
|