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
@special exp
62
@special tag
63
@special nat
64
@special bool
65
@special string
66
@special shape
67
@special variety
68
@special floating_variety
69
@special bitfield_variety
70
@special alignment
71
@special exp_list
72
@special exp_option
73
/* AUTOMATICALLY GENERATED BY %ZX VERSION %ZV FROM TDF %VA.%VB */
74
 
7 7u83 75
#define sub0(X)	((X)->son)
76
#define sub1(X)	((X)->son->bro)
77
#define sub2(X)	((X)->son->bro->bro)
78
#define sub3(X)	((X)->son->bro->bro->bro)
79
#define sub4(X)	((X)->son->bro->bro->bro->bro)
80
#define sub5(X)	((X)->son->bro->bro->bro->bro->bro)
81
#define sub6(X)	((X)->son->bro->bro->bro->bro->bro->bro)
82
#define sub7(X)	((X)->son->bro->bro->bro->bro->bro->bro->bro)
2 7u83 83
 
84
 
85
/*
86
    SET THE SHAPE OF AN EXPRESSION
87
 
88
    The shape of the expression exp is calculated and assigned.  Most of
89
    the work is done by the check routines above, as selected by an
90
    automatically generated switch statement.
91
*/
92
 
7 7u83 93
void
94
check_exp_fn(node *exp)
2 7u83 95
{
7 7u83 96
    long m;
97
    if (exp == null) {
98
	return;
99
    }
100
    m = exp->cons->encoding;
101
    if (m == ENC_labelled) {
102
	node *placelabs_intro = sub0(exp);
103
	node *places = sub2(exp);
104
	if (placelabs_intro->cons->encoding != places->cons->encoding) {
105
	    input_error("Labels don't match exps in labelled");
2 7u83 106
	}
107
    }
7 7u83 108
    if (do_check) {
109
	if (exp->shape) {
110
	    return;
111
	}
112
	checking = exp->cons->name;
113
	switch (m) {
2 7u83 114
@loop sort
115
@if sort.eq.exp
116
@loop sort.cons
7 7u83 117
	    case ENC_%27CN: {
2 7u83 118
@loop cons.param
119
@if param.sort.special
7 7u83 120
		node *%PN = sub%PE(exp);
2 7u83 121
@else
122
@if param.sort.dummy
123
		%PSN parameter, %PN, messes things up!
124
@endif
125
@endif
126
@end
127
		CHECK_%25CN
7 7u83 128
		break;
2 7u83 129
	    }
130
@end
131
@endif
132
@end
133
	}
7 7u83 134
	exp->shape = expand_fully(exp->shape);
2 7u83 135
    }
7 7u83 136
    return;
2 7u83 137
}