| 2 |
7u83 |
1 |
/*
|
|
|
2 |
Crown Copyright (c) 1997
|
|
|
3 |
|
|
|
4 |
This TenDRA(r) Computer Program is subject to Copyright
|
|
|
5 |
owned by the United Kingdom Secretary of State for Defence
|
|
|
6 |
acting through the Defence Evaluation and Research Agency
|
|
|
7 |
(DERA). It is made available to Recipients with a
|
|
|
8 |
royalty-free licence for its use, reproduction, transfer
|
|
|
9 |
to other parties and amendment for any purpose not excluding
|
|
|
10 |
product development provided that any such use et cetera
|
|
|
11 |
shall be deemed to be acceptance of the following conditions:-
|
|
|
12 |
|
|
|
13 |
(1) Its Recipients shall ensure that this Notice is
|
|
|
14 |
reproduced upon any copies or amended versions of it;
|
|
|
15 |
|
|
|
16 |
(2) Any amended version of it shall be clearly marked to
|
|
|
17 |
show both the nature of and the organisation responsible
|
|
|
18 |
for the relevant amendment or amendments;
|
|
|
19 |
|
|
|
20 |
(3) Its onward transfer from a recipient to another
|
|
|
21 |
party shall be deemed to be that party's acceptance of
|
|
|
22 |
these conditions;
|
|
|
23 |
|
|
|
24 |
(4) DERA gives no warranty or assurance as to its
|
|
|
25 |
quality or suitability for any purpose and DERA accepts
|
|
|
26 |
no liability whatsoever in relation to any use to which
|
|
|
27 |
it may be put.
|
|
|
28 |
*/
|
|
|
29 |
|
|
|
30 |
/*
|
|
|
31 |
AUTOMATICALLY GENERATED FROM ALGEBRA tdf (VERSION 1.0)
|
|
|
32 |
BY calculus (VERSION 1.2)
|
|
|
33 |
*/
|
|
|
34 |
|
|
|
35 |
#ifndef SORT_OPS_H_INCLUDED
|
|
|
36 |
#define SORT_OPS_H_INCLUDED
|
|
|
37 |
|
|
|
38 |
/* Operations for union SORT */
|
|
|
39 |
|
| 6 |
7u83 |
40 |
#define TAG_sort(P) ((unsigned) 0)
|
| 2 |
7u83 |
41 |
|
|
|
42 |
|
|
|
43 |
/* Operations for component name of union SORT */
|
|
|
44 |
|
| 6 |
7u83 |
45 |
#define sort_name(P) (CHECK_NULL(P) + 0)
|
| 2 |
7u83 |
46 |
|
|
|
47 |
|
|
|
48 |
/* Operations for component caps of union SORT */
|
|
|
49 |
|
| 6 |
7u83 |
50 |
#define sort_caps(P) (CHECK_NULL(P) + 1)
|
| 2 |
7u83 |
51 |
|
|
|
52 |
|
|
|
53 |
/* Operations for component link of union SORT */
|
|
|
54 |
|
| 6 |
7u83 |
55 |
#define sort_link(P) (CHECK_NULL(P) + 2)
|
| 2 |
7u83 |
56 |
|
|
|
57 |
|
|
|
58 |
/* Operations for component unit of union SORT */
|
|
|
59 |
|
| 6 |
7u83 |
60 |
#define sort_unit(P) (CHECK_NULL(P) + 3)
|
| 2 |
7u83 |
61 |
|
|
|
62 |
|
|
|
63 |
/* Operations for component code of union SORT */
|
|
|
64 |
|
| 6 |
7u83 |
65 |
#define sort_code(P) (CHECK_NULL(P) + 4)
|
| 2 |
7u83 |
66 |
|
|
|
67 |
|
|
|
68 |
/* Operations for component mark of union SORT */
|
|
|
69 |
|
| 6 |
7u83 |
70 |
#define sort_mark(P) (CHECK_NULL(P) + 5)
|
| 2 |
7u83 |
71 |
|
|
|
72 |
|
|
|
73 |
/* Operations for component special of union SORT */
|
|
|
74 |
|
| 6 |
7u83 |
75 |
#define sort_special(P) (CHECK_NULL(P) + 6)
|
| 2 |
7u83 |
76 |
|
|
|
77 |
|
|
|
78 |
/* Operations for component edge of union SORT */
|
|
|
79 |
|
| 6 |
7u83 |
80 |
#define sort_edge(P) (CHECK_NULL(P) + 7)
|
| 2 |
7u83 |
81 |
|
|
|
82 |
|
|
|
83 |
/* Operations for component info of union SORT */
|
|
|
84 |
|
| 6 |
7u83 |
85 |
#define sort_info(P) (CHECK_NULL(P) + 8)
|
| 2 |
7u83 |
86 |
|
|
|
87 |
|
|
|
88 |
/* Operations for field basic of union SORT */
|
|
|
89 |
|
| 6 |
7u83 |
90 |
#define sort_basic_tag ((unsigned)0)
|
|
|
91 |
#define IS_sort_basic(P) 1
|
| 2 |
7u83 |
92 |
|
|
|
93 |
|
| 6 |
7u83 |
94 |
#define MAKE_sort_basic(name_, caps_, link_, unit_, code_, mark_, special_, edge_, info_, tdf_sort)\
|
| 2 |
7u83 |
95 |
{\
|
| 6 |
7u83 |
96 |
tdf *x93_ = GEN_tdf(9, TYPEID_sort);\
|
|
|
97 |
COPY_string(x93_ + 0, (name_));\
|
|
|
98 |
COPY_string(x93_ + 1, (caps_));\
|
|
|
99 |
COPY_string(x93_ + 2, (link_));\
|
|
|
100 |
COPY_string(x93_ + 3, (unit_));\
|
|
|
101 |
COPY_int(x93_ + 4, (code_));\
|
|
|
102 |
COPY_int(x93_ + 5, (mark_));\
|
|
|
103 |
COPY_int(x93_ + 6, (special_));\
|
|
|
104 |
COPY_int(x93_ + 7, (edge_));\
|
|
|
105 |
COPY_info(x93_ + 8, (info_));\
|
|
|
106 |
(tdf_sort) = x93_;\
|
| 2 |
7u83 |
107 |
}
|
|
|
108 |
|
| 6 |
7u83 |
109 |
#define DECONS_sort_basic(name_, caps_, link_, unit_, code_, mark_, special_, edge_, info_, tdf_sort)\
|
| 2 |
7u83 |
110 |
{\
|
| 6 |
7u83 |
111 |
tdf *x94_ = (tdf_sort);\
|
|
|
112 |
(name_) = DEREF_string(x94_ + 0);\
|
|
|
113 |
(caps_) = DEREF_string(x94_ + 1);\
|
|
|
114 |
(link_) = DEREF_string(x94_ + 2);\
|
|
|
115 |
(unit_) = DEREF_string(x94_ + 3);\
|
|
|
116 |
(code_) = DEREF_int(x94_ + 4);\
|
|
|
117 |
(mark_) = DEREF_int(x94_ + 5);\
|
|
|
118 |
(special_) = DEREF_int(x94_ + 6);\
|
|
|
119 |
(edge_) = DEREF_int(x94_ + 7);\
|
|
|
120 |
(info_) = DEREF_info(x94_ + 8);\
|
| 2 |
7u83 |
121 |
}
|
|
|
122 |
|
| 6 |
7u83 |
123 |
#define DESTROY_sort_basic(destroyer_, name_, caps_, link_, unit_, code_, mark_, special_, edge_, info_, tdf_sort)\
|
| 2 |
7u83 |
124 |
{\
|
| 6 |
7u83 |
125 |
tdf *x95_ = (tdf_sort);\
|
|
|
126 |
(name_) = DEREF_string(x95_ + 0);\
|
|
|
127 |
(caps_) = DEREF_string(x95_ + 1);\
|
|
|
128 |
(link_) = DEREF_string(x95_ + 2);\
|
|
|
129 |
(unit_) = DEREF_string(x95_ + 3);\
|
|
|
130 |
(code_) = DEREF_int(x95_ + 4);\
|
|
|
131 |
(mark_) = DEREF_int(x95_ + 5);\
|
|
|
132 |
(special_) = DEREF_int(x95_ + 6);\
|
|
|
133 |
(edge_) = DEREF_int(x95_ + 7);\
|
|
|
134 |
(info_) = DEREF_info(x95_ + 8);\
|
|
|
135 |
(destroyer_)(x95_, (unsigned)9);\
|
| 2 |
7u83 |
136 |
}
|
|
|
137 |
|
|
|
138 |
|
|
|
139 |
#endif
|