Subversion Repositories tendra.SVN

Rev

Go to most recent revision | Details | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 7u83 1
/*
2
    		 Crown Copyright (c) 1997, 1998
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 c_class (VERSION 1.1)
32
    BY calculus (VERSION 1.2)
33
*/
34
 
35
#ifndef MEMBER_OPS_H_INCLUDED
36
#define MEMBER_OPS_H_INCLUDED
37
 
38
/* Operations for union MEMBER */
39
 
40
#define TAG_member( P )			( CHECK_NULL ( P )->ag_tag )
41
 
42
 
43
/* Operations for component id of union MEMBER */
44
 
45
#define member_id( P )			( CHECK_NULL ( P ) + 1 )
46
 
47
 
48
/* Operations for component alt of union MEMBER */
49
 
50
#define member_alt( P )			( CHECK_NULL ( P ) + 2 )
51
 
52
 
53
/* Operations for component next of union MEMBER */
54
 
55
#define member_next( P )		( CHECK_NULL ( P ) + 3 )
56
 
57
 
58
/* Operations for field small of union MEMBER */
59
 
60
#define member_small_tag		( ( unsigned ) 0 )
61
#define IS_member_small( P )		( CHECK_NULL ( P )->ag_tag == 0 )
62
 
63
 
64
#define MAKE_member_small( next_, c_class_member )\
65
    {\
66
	c_class *x424_ = GEN_c_class ( 4, TYPEID_member ) ;\
67
	x424_->ag_tag = 0 ;\
68
	COPY_id ( x424_ + 1, NULL_id ) ;\
69
	COPY_id ( x424_ + 2, NULL_id ) ;\
70
	COPY_member ( x424_ + 3, ( next_ ) ) ;\
71
	( c_class_member ) = x424_ ;\
72
    }
73
 
74
#define DECONS_member_small( id_, alt_, next_, c_class_member )\
75
    {\
76
	c_class *x425_ = CHECK_TAG ( ( c_class_member ), 0 ) ;\
77
	( id_ ) = DEREF_id ( x425_ + 1 ) ;\
78
	( alt_ ) = DEREF_id ( x425_ + 2 ) ;\
79
	( next_ ) = DEREF_member ( x425_ + 3 ) ;\
80
    }
81
 
82
#define DESTROY_member_small( destroyer_, id_, alt_, next_, c_class_member )\
83
    {\
84
	c_class *x426_ = CHECK_TAG ( ( c_class_member ), 0 ) ;\
85
	( id_ ) = DEREF_id ( x426_ + 1 ) ;\
86
	( alt_ ) = DEREF_id ( x426_ + 2 ) ;\
87
	( next_ ) = DEREF_member ( x426_ + 3 ) ;\
88
	( destroyer_ ) ( x426_, ( unsigned ) 4 ) ;\
89
    }
90
 
91
 
92
/* Operations for field large of union MEMBER */
93
 
94
#define member_large_tag		( ( unsigned ) 1 )
95
#define IS_member_large( P )		( CHECK_NULL ( P )->ag_tag == 1 )
96
 
97
#define member_large_tnext( P )		( CHECK_TAG ( ( P ), 1 ) + 4 )
98
 
99
#define MAKE_member_large( next_, tnext_, c_class_member )\
100
    {\
101
	c_class *x427_ = GEN_c_class ( 5, TYPEID_member ) ;\
102
	x427_->ag_tag = 1 ;\
103
	COPY_id ( x427_ + 1, NULL_id ) ;\
104
	COPY_id ( x427_ + 2, NULL_id ) ;\
105
	COPY_member ( x427_ + 3, ( next_ ) ) ;\
106
	COPY_member ( x427_ + 4, ( tnext_ ) ) ;\
107
	( c_class_member ) = x427_ ;\
108
    }
109
 
110
#define DECONS_member_large( id_, alt_, next_, tnext_, c_class_member )\
111
    {\
112
	c_class *x428_ = CHECK_TAG ( ( c_class_member ), 1 ) ;\
113
	( id_ ) = DEREF_id ( x428_ + 1 ) ;\
114
	( alt_ ) = DEREF_id ( x428_ + 2 ) ;\
115
	( next_ ) = DEREF_member ( x428_ + 3 ) ;\
116
	( tnext_ ) = DEREF_member ( x428_ + 4 ) ;\
117
    }
118
 
119
#define DESTROY_member_large( destroyer_, id_, alt_, next_, tnext_, c_class_member )\
120
    {\
121
	c_class *x429_ = CHECK_TAG ( ( c_class_member ), 1 ) ;\
122
	( id_ ) = DEREF_id ( x429_ + 1 ) ;\
123
	( alt_ ) = DEREF_id ( x429_ + 2 ) ;\
124
	( next_ ) = DEREF_member ( x429_ + 3 ) ;\
125
	( tnext_ ) = DEREF_member ( x429_ + 4 ) ;\
126
	( destroyer_ ) ( x429_, ( unsigned ) 5 ) ;\
127
    }
128
 
129
 
130
#endif