Rev 5 | Blame | Compare with Previous | Last modification | View Log | RSS feed
/*
* Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of The TenDRA Project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific, prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
* IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* $Id$
*/
/*
Crown Copyright (c) 1997
This TenDRA(r) Computer Program is subject to Copyright
owned by the United Kingdom Secretary of State for Defence
acting through the Defence Evaluation and Research Agency
(DERA). It is made available to Recipients with a
royalty-free licence for its use, reproduction, transfer
to other parties and amendment for any purpose not excluding
product development provided that any such use et cetera
shall be deemed to be acceptance of the following conditions:-
(1) Its Recipients shall ensure that this Notice is
reproduced upon any copies or amended versions of it;
(2) Any amended version of it shall be clearly marked to
show both the nature of and the organisation responsible
for the relevant amendment or amendments;
(3) Its onward transfer from a recipient to another
party shall be deemed to be that party's acceptance of
these conditions;
(4) DERA gives no warranty or assurance as to its
quality or suitability for any purpose and DERA accepts
no liability whatsoever in relation to any use to which
it may be put.
*/
@special external
@special token
@special tokdec
@special tokdef
@special tagdec
@special tagdef
@special al_tagdef
@special version
@special token_defn
/* AUTOMATICALLY GENERATED BY %ZX VERSION %ZV FROM TDF %VA.%VB */
#include "config.h"
#include "types.h"
#include "de_types.h"
#include "enc_types.h"
#include "check.h"
#include "decode.h"
#include "de_capsule.h"
#include "de_unit.h"
#include "encode.h"
#include "node.h"
#include "read.h"
#include "shape.h"
#include "table.h"
#include "tdf.h"
#include "utility.h"
/* INITIALISE CONSTRUCTS */
void
init_constructs(void)
{
sortname s;
@loop sort
@if sort.basic
@if !sort.special
s = SORT_%SN;
@if sort.eq.sortname
new_sort(s, %3SM);
@else
sort_letters[s] = '%SX';
sort_encoding[s] = %SB;
sort_extension[s] = %SE;
sort_decode[s] = de_%SN;
sort_read[s] = read_%SN;
new_sort(s, %1SM);
@endif
@loop sort.cons
@if cons.params
@if cons.token
new_cons("%CN", s, %CE, "!");
sort_tokens[s] = %CE;
@else
@if cons.eq.identify
new_cons("%CN", s, %CE, "?[u]t^x{x}");
@else
new_cons("%CN", s, %CE, "%CX");
@if cons.cond
sort_conds[s] = %CE;
@endif
@endif
@endif
@else
@if cons.eq.alignment_sort
new_cons("alignment", s, %CE,(char *)null);
@else
new_cons("%CN", s, %CE,(char *)null);
@endif
@endif
@end
@if sort.eq.sortname
new_cons("callees", s, %1SM,(char *)null);
new_cons("error_code", s, %2SM,(char *)null);
@endif
@endif
@endif
@end
return;
}
@special sortname
/* FIND A SORT NAME */
sortname
find_sort(char c)
{
sortname s;
switch (c) {
@loop sort
@if sort.basic
@if !sort.special
case '%SX': s = SORT_%SN; break;
@endif
@endif
@end
default : {
input_error("Illegal decode letter, %%c", c);
s = SORT_unknown;
break;
}
}
return(s);
}
@loop sort
@if sort.basic
/* DECODE A %ST */
@if sort.special
long
de_%SN_bits(void)
@else
node *
de_%SN(void)
@endif
{
@if sort.extends
long n = fetch_extn(%SB%1u);
@else
long n = fetch(%SB%0u);
@endif
@if sort.special
if (n < %u || n > %SM) {
input_error("Illegal %SN value, %%ld", n);
}
return(n);
@else
char *args;
node *p = new_node();
construct *cons = cons_no(SORT_%SN, n);
p->cons = cons;
if (n < %u || n > %SM || cons->name == null) {
input_error("Illegal %SN value, %%ld", n);
}
@if sort.eq.callees
args = get_char_info(cons);
if (args) {
p->son = de_node(args);
}
@else
@if sort.eq.error_code
args = get_char_info(cons);
if (args) {
p->son = de_node(args);
}
@else
switch (n) {
@loop sort.cons
@if cons.token
case %CE: {
IGNORE de_token(p, SORT_%SN);
break;
}
@else
@if cons.cond
case %CE: {
args = get_char_info(cons);
p->son = de_node(args);
if (do_check) {
checking = "%CN";
IGNORE check1(ENC_integer, p->son);
}
break;
}
@else
@if cons.edge
case %CE: {
@if sort.link
p->son = de_var_sort(%SN_var);
@else
long m = tdf_int();
p->son = new_node();
p->son->cons = find_%SN(m);
@endif
break;
}
@endif
@endif
@endif
@end
default : {
args = get_char_info(cons);
if (args) {
p->son = de_node(args);
}
break;
}
}
@endif
@endif
#ifdef check_%SN
check_%SN(p);
#endif
return(p);
@endif
}
@endif
@end
@loop sort
@if sort.basic
@if sort.special
/* ENCODE A %ST */
void
enc_%SN_bits(bitstream *p, int n)
{
@if sort.extends
enc_bits_extn(p, %SB,(long)n);
@else
enc_bits(p, %SB,(long)n);
@endif
return;
}
@else
@if sort.edge
/* ENCODE A %ST */
void
enc_%SN_bits(bitstream *p, int n)
{
@if sort.extends
enc_bits_extn(p, %SB,(long)n);
@else
enc_bits(p, %SB,(long)n);
@endif
return;
}
@endif
@endif
@endif
@end
@special exp sequence
@special signed_nat make_signed_nat
@loop sort
@if sort.basic
@if !sort.special
/* READ A %ST */
node *
read_%SN(long n)
{
char *args;
node *p = new_node();
construct *cons = cons_no(SORT_%SN, n);
p->cons = cons;
if (n < 0 || n > %SM || cons->name == null) {
input_error("Illegal %SN value, %%ld", n);
}
@if sort.eq.callees
args = get_char_info(cons);
if (args) {
p->son = read_node(args);
}
@else
@if sort.eq.error_code
args = get_char_info(cons);
if (args) {
p->son = read_node(args);
}
@else
switch (n) {
@loop sort.cons
@if cons.token
case %CE: {
read_token(p, SORT_%SN);
break;
}
@else
@if cons.cond
case %CE: {
args = get_char_info(cons);
p->son = read_node(args);
if (do_check) {
checking = "%CN";
IGNORE check1(ENC_integer, p->son);
}
break;
}
@else
@if cons.edge
case %CE: {
p->son = read_var_sort(SORT_%SN);
break;
}
@else
@if cons.special
case %CE: {
read_%CN(p, get_char_info(cons));
break;
}
@endif
@endif
@endif
@endif
@end
default : {
args = get_char_info(cons);
if (args) {
p->son = read_node(args);
}
break;
}
}
@endif
@endif
#ifdef check_%SN
check_%SN(p);
#endif
return(p);
}
@endif
@endif
@end