Subversion Repositories tendra.SVN

Rev

Details | Last modification | View Log | RSS feed

Rev Author Line No. Line
6 7u83 1
/*
2
 * Copyright (c) 2002-2006 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
/*
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
#include "config.h"
62
#include "enc_nos.h"
63
#include "errors.h"
64
#include "readstreams.h"
65
#include "decodings.h"
66
@use all
67
@loop sort
68
@if sort.basic
69
 
70
 
71
/* DECODE %ST */
72
 
73
unsigned int
74
d_%SN(int n)
75
{
76
	unsigned int enc = get_basic_int(%SB, %SE);
77
	switch (enc) {
78
@loop sort.cons
79
	case e_%CN:
80
		consname("%CN", n);
81
@loop cons.param
82
@if param.sort.eq.bitstream
83
		    IGNORE d_bitstream("%CN", n + 1);
84
@else
85
		    IGNORE d_%PSN(n + 1);
86
@endif
87
@end
88
		    break;
89
@end
90
	default:
91
		fail("Bad %SN value, %u", enc);
92
		break;
93
	}
94
	return(enc);
95
}
96
@else
97
@if sort.dummy
98
 
99
 
100
/* DECODE %ST */
101
 
102
unsigned int
103
d_%SN(int n)
104
{
105
@loop sort.cons
106
	    consname("%CN", n);
107
@loop cons.param
108
@if param.sort.eq.bitstream
109
	    IGNORE d_bitstream("%CN", n + 1);
110
@else
111
	    IGNORE d_%PSN(n + 1);
112
@endif
113
@end
114
	    return(%CE);
115
@end
116
}
117
@else
118
@if sort.option
119
 
120
 
121
/* DECODE OPTIONAL %SST */
122
 
123
unsigned int
124
d_%SN(int n)
125
{
126
	unsigned int nl = get_basic_int(1, 0);
127
	if (nl) {
128
		IGNORE d_%SSN(n);
129
	}
130
	return(nl);
131
}
132
@else
133
@if sort.slist
134
 
135
 
136
/* DECODE SIMPLE %SST LIST */
137
 
138
unsigned int
139
d_%SN(int n)
140
{
141
	unsigned int nl = get_tdfint();
142
	for (; nl != 0; nl--) {
143
		IGNORE d_%SSN(n + 1);
144
	}
145
	return(nl);
146
}
147
@else
148
@if sort.list
149
 
150
 
151
/* DECODE %SST LIST */
152
 
153
unsigned int
154
d_%SN(int n)
155
{
156
	unsigned int nl;
157
	IGNORE get_basic_int(1, 0);
158
	nl = get_tdfint();
159
	for (; nl != 0; nl--) {
160
		IGNORE d_%SSN(n + 1);
161
	}
162
	return(nl);
163
}
164
@endif
165
@endif
166
@endif
167
@endif
168
@endif
169
@end