WebSVN – tendra.SVN – Diff – /branches/tendra5/src/tools/disp/templ/tdf.c

+/*
+ * 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.
 */
 @if sort.basic
 /* DECODE A %ST */
-long de_%SN
+long
-    PROTO_Z ()
+de_%SN(void)
+{
 @if sort.extends
-    long n = fetch_extn ( %SB%1u ) ;
+    long n = fetch_extn(%SB%1u);
 @else
-    long n = fetch ( %SB%0u ) ;
+    long n = fetch(%SB%0u);
 @endif
 @if sort.special
-    if ( n < %u || n > %SM ) {
+    if (n < %u || n > %SM) {
-	out ( "<error>" ) ;
+	out("<error>");
-	input_error ( "Illegal %ST value, %%ld", n ) ;
+	input_error("Illegal %ST value, %%ld", n);
-	n = -1 ;
+	n = -1;
+    }
 @else
-    switch ( n ) {
+    switch (n) {
 @loop sort.cons
-	case %CE : {
+	case %CE: {
 @if cons.simple
 @if cons.params
-	    format ( VERT_BRACKETS, "%CN", "%CX" ) ;
+	    format(VERT_BRACKETS, "%CN", "%CX");
 @else
-	    out ( "%CN" ) ;
+	    out("%CN");
 @endif
 @else
 @if cons.cond
-	    format ( VERT_BRACKETS, "%CN", "%CX" ) ;
+	    format(VERT_BRACKETS, "%CN", "%CX");
 @else
 @if cons.token
 @if sort.name.foreign
-	    sortname sn = find_sortname ( '%SX' ) ;
+	    sortname sn = find_sortname('%SX');
-	    IGNORE de_token_aux ( sn, "%SN" ) ;
+	    IGNORE de_token_aux(sn, "%SN");
 @else
-	    IGNORE de_token_aux ( sort_%20SN, "%SN" ) ;
+	    IGNORE de_token_aux(sort_%20SN, "%SN");
 @endif
 @else
 @if cons.edge
-	    long t = tdf_int () ;
+	    long t = tdf_int();
 @if sort.link
-	    out_object ( t, ( object * ) null, var_%SN ) ;
+	    out_object(t,(object *)null, var_%SN);
 @else
-	    de_%CN ( t ) ;
+	    de_%CN(t);
 @endif
 @else
 	    /* Decode string "%CX" */
-	    de_%CN ( "%CN" ) ;
+	    de_%CN("%CN");
 @endif
 @endif
 @endif
 @endif
-	    break ;
+	    break;
+	}
 @end
 	default : {
-	    out ( "<error>" ) ;
+	    out("<error>");
-	    input_error ( "Illegal %ST value, %%ld", n ) ;
+	    input_error("Illegal %ST value, %%ld", n);
-	    n = -1 ;
+	    n = -1;
-	    break ;
+	    break;
+	}
+    }
 @endif
-    return ( n ) ;
+    return(n);
+}
 @endif
 @end
     On input, s, points to the character '['.  The routine returns a
     pointer to the character following the corresponding ']'.
 */
-static char *skip_sub
+static char *
-    PROTO_N ( ( s ) )
-    PROTO_T ( char *s )
+skip_sub(char *s)
+{
-    char c = *( s++ ) ;
+    char c = *(s++);
-    if ( c == '[' ) {
+    if (c == '[') {
-	int n = 0 ;
+	int n = 0;
-	while ( c = *( s++ ), c != 0 ) {
+	while (c = *(s++), c != 0) {
-	    if ( c == '[' ) n++ ;
+	    if (c == '[')n++;
-	    if ( c == ']' ) {
+	    if (c == ']') {
-		if ( n == 0 ) return ( s ) ;
+		if (n == 0) return(s);
-		n-- ;
+		n--;
+	    }
+	}
+    }
-    input_error ( "Illegal decoding string" ) ;
+    input_error("Illegal decoding string");
-    return ( "" ) ;
+    return("");
+}
 /*
     DECODE A STRING OF DECODE CHARACTERS
     decoding routine (the character is vaguely mnemonic).  For example,
     decode ( "Sn*[x]" ) means, decode a SHAPE and a NAT, then read a
     TDF integer and decode that number of EXPs.
 */
-void decode
+void
-    PROTO_N ( ( str ) )
-    PROTO_T ( char *str )
+decode(char *str)
+{
-    char c ;
+    char c;
-    while ( c = *( str++ ), c != 0 ) {
+    while (c = *(str++), c != 0) {
-	switch ( c ) {
+	switch (c) {
-	    case '[' :
+	    case '[':
-	    case '{' :
+	    case '{':
-	    case '}' :
+	    case '}':
-	    case '&' : {
+	    case '&': {
 		/* Ignore these cases */
-		break ;
+		break;
+	    }
-	    case ']' : {
+	    case ']': {
 		/* Marks the end of a group */
-		return ;
+		return;
+	    }
-	    case 'i' : {
+	    case 'i': {
 		/* Decode an integer */
-		long n = tdf_int () ;
+		long n = tdf_int();
-		out_int ( n ) ;
+		out_int(n);
-		break ;
+		break;
+	    }
-	    case '$' : {
+	    case '$': {
 		/* Decode a string */
-		de_tdfstring_format () ;
+		de_tdfstring_format();
-		break ;
+		break;
+	    }
-	    case 'T' : {
+	    case 'T': {
 		/* Decode a token */
-		IGNORE de_token_aux ( sort_unknown, "token" ) ;
+		IGNORE de_token_aux(sort_unknown, "token");
-		break ;
+		break;
+	    }
-	    case 'F' : {
+	    case 'F': {
 		/* Decode an unknown foreign sort */
-		input_error ( "Unknown foreign sort" ) ;
+		input_error("Unknown foreign sort");
-		break ;
+		break;
+	    }
-	    case '*' : {
+	    case '*': {
 		/* The following text is repeated n times */
-		long i, n ;
+		long i, n;
-		check_list () ;
+		check_list();
-		n = tdf_int () ;
+		n = tdf_int();
-		if ( n == 0 ) {
+		if (n == 0) {
-		    out ( "empty" ) ;
+		    out("empty");
 		} else {
-		    for ( i = 0 ; i < n ; i++ ) decode ( str + 1 ) ;
+		    for (i = 0; i < n; i++)decode(str + 1);
+		}
-		str = skip_sub ( str ) ;
+		str = skip_sub(str);
-		break ;
+		break;
+	    }
-	    case '+' : {
+	    case '+': {
 		/* The following text is repeated n + 1 times */
-		long i, n ;
+		long i, n;
-		check_list () ;
+		check_list();
-		n = tdf_int () ;
+		n = tdf_int();
-		for ( i = 0 ; i <= n ; i++ ) decode ( str + 1 ) ;
+		for (i = 0; i <= n; i++)decode(str + 1);
-		str = skip_sub ( str ) ;
+		str = skip_sub(str);
-		break ;
+		break;
+	    }
-	    case '?' : {
+	    case '?': {
 		/* The following text is optional */
-		if ( tdf_bool () ) {
+		if (tdf_bool()) {
-		    decode ( str + 1 ) ;
+		    decode(str + 1);
 		} else {
-		    out ( "-" ) ;
+		    out("-");
+		}
-		str = skip_sub ( str ) ;
+		str = skip_sub(str);
-		break ;
+		break;
+	    }
-	    case '@' : {
+	    case '@': {
 		/* The following text is a bitstream */
-		long p = tdf_int () ;
+		long p = tdf_int();
-		p += posn ( here ) ;
+		p += posn(here);
-		decode ( str + 1 ) ;
+		decode(str + 1);
-		if ( p != posn ( here ) ) {
+		if (p != posn(here)) {
-		    input_error ( "Bitstream length wrong" ) ;
+		    input_error("Bitstream length wrong");
+		}
-		str = skip_sub ( str ) ;
+		str = skip_sub(str);
-		break ;
+		break;
+	    }
-	    case '|' : {
+	    case '|': {
 		/* Align input stream */
-		byte_align () ;
+		byte_align();
-		break ;
+		break;
+	    }
 @loop sort
 @if sort.basic
 @if !sort.special
-	    case '%SX' : IGNORE de_%SN () ; break ;
+	    case '%SX': IGNORE de_%SN(); break;
 @endif
 @endif
 @end
 	    default : {
-		input_error ( "Illegal decode letter, %%c", c ) ;
+		input_error("Illegal decode letter, %%c", c);
-		break ;
+		break;
+	    }
+	}
+    }
-    return ;
+    return;
+}
 /*
     FIND THE NAME AND DECODE LETTER ASSOCIATED WITH A SORT
     This routine returns a sortid structure corresponding to the sort
     number n.
 */
-sortid find_sort
+sortid
-    PROTO_N ( ( n ) )
-    PROTO_T ( sortname n )
+find_sort(sortname n)
+{
-    sortid s ;
+    sortid s;
-    switch ( n ) {
+    switch (n) {
 @loop sort
 @if sort.name.simple
 @if !sort.special
-	case sort_%20SN : {
+	case sort_%20SN: {
-	    s.name = "%ST" ;
+	    s.name = "%ST";
-	    s.decode = '%SX' ;
+	    s.decode = '%SX';
-	    break ;
+	    break;
+	}
 @endif
 @endif
 @end
-	case sort_token : {
+	case sort_token: {
-	    s.name = "TOKEN" ;
+	    s.name = "TOKEN";
-	    s.decode = 'T' ;
+	    s.decode = 'T';
-	    break ;
+	    break;
+	}
-	case sort_foreign : {
+	case sort_foreign: {
-	    s.name = "FOREIGN" ;
+	    s.name = "FOREIGN";
-	    s.decode = 'F' ;
+	    s.decode = 'F';
-	    break ;
+	    break;
+	}
 	default: {
-	    int m = n - extra_sorts ;
+	    int m = n - extra_sorts;
-	    if ( m >= 0 && m < no_foreign_sorts ) {
+	    if (m >= 0 && m < no_foreign_sorts) {
-		s.name = foreign_sorts [m].name ;
+		s.name = foreign_sorts[m].name;
-		s.decode = foreign_sorts [m].decode ;
+		s.decode = foreign_sorts[m].decode;
 	    } else {
-		input_error ( "Illegal sort value, %%d", n ) ;
+		input_error("Illegal sort value, %%d", n);
-		s.name = "<error in SORT>" ;
+		s.name = "<error in SORT>";
-		s.decode = 'F' ;
+		s.decode = 'F';
+	    }
-	    break ;
+	    break;
+	}
+    }
-    s.res = n ;
+    s.res = n;
-    s.args = null ;
+    s.args = null;
-    return ( s ) ;
+    return(s);
+}
 /*
     This routine given a decode letter c returns the corresponding sort
     number.
 */
-sortname find_sortname
+sortname
-    PROTO_N ( ( c ) )
-    PROTO_T ( int c )
+find_sortname(int c)
+{
-    long i ;
+    long i;
-    switch ( c ) {
+    switch (c) {
 @loop sort
 @if sort.name.simple
 @if !sort.special
-	case '%SX' : return ( sort_%20SN ) ;
+	case '%SX': return(sort_%20SN);
 @endif
 @endif
 @end
-	case 'T' : return ( sort_token ) ;
+	case 'T': return(sort_token);
-	case 'F' : return ( sort_foreign ) ;
+	case 'F': return(sort_foreign);
+    }
-    for ( i = 0 ; i < no_foreign_sorts ; i++ ) {
+    for (i = 0; i < no_foreign_sorts; i++) {
-	if ( c == foreign_sorts [i].decode ) {
+	if (c == foreign_sorts[i].decode) {
-	    return ( ( sortname ) ( extra_sorts + i ) ) ;
+	    return((sortname)(extra_sorts + i));
+	}
+    }
-    return ( sort_unknown ) ;
+    return(sort_unknown);
+}
 /*
     INITIALISE FOREIGN SORT NAMES
     This routine initialises the array of foreign sort names.
 */
+void
-void init_foreign_sorts
+init_foreign_sorts(void)
-    PROTO_Z ()
+{
 @loop sort
 @if sort.name.foreign
-    add_foreign_sort ( "%ST", "%SCN", '%SX' ) ;
+    add_foreign_sort("%ST", "%SCN", '%SX');
 @endif
 @end
-    return ;
+    return;
+}
 /*
     LINKAGE VARIABLE NUMBERS
     variables indicate where (negative values mean not at all).
 */
 %1u
 @loop sort
 @if sort.link
-long var_%SN = -%u ;
+long var_%SN = -%u;
 @endif
 @end
 /*
     This routine sets the nth element of the var_types array to the
     linkage variable indicated by the variable name s.
 */
-char find_variable
+char
-    PROTO_N ( ( s, n ) )
-    PROTO_T ( string s X long n )
+find_variable(string s, long n)
+{
 @loop sort
 @if sort.link
-    if ( streq ( s, "%SL" ) ) {
+    if (streq(s, "%SL")) {
-	var_%SN = n ;
+	var_%SN = n;
-	return ( '%SX' ) ;
+	return('%SX');
+    }
 @endif
 @end
-    return ( 'F' ) ;
+    return('F');
+}
 /*
     FIND A EQUATION DECODING FUNCTION
     This routine returns the unit decoding function used to deal with
     units with equation name s.  It also assigns a unit description to
     pt and a usage flag to po.
 */
-equation_func find_equation
+equation_func
-    PROTO_N ( ( s, pt, po ) )
-    PROTO_T ( string s X string *pt X int *po )
+find_equation(string s, string *pt, int *po)
+{
 @loop sort
 @if sort.unit
-    if ( streq ( s, "%SU" ) ) {
+    if (streq(s, "%SU")) {
-	*pt = MSG_%SN ;
+	*pt = MSG_%SN;
-	*po = OPT_%SN ;
+	*po = OPT_%SN;
-	return ( de_%SN ) ;
+	return(de_%SN);
+    }
 @endif
 @end
-    if ( streq ( s, "tld" ) ) {
+    if (streq(s, "tld")) {
-	*pt = MSG_tld_unit ;
+	*pt = MSG_tld_unit;
-	*po = OPT_tld_unit ;
+	*po = OPT_tld_unit;
-	return ( de_tld_unit ) ;
+	return(de_tld_unit);
+    }
-    if ( streq ( s, "tld2" ) ) {
+    if (streq(s, "tld2")) {
-	*pt = MSG_tld2_unit ;
+	*pt = MSG_tld2_unit;
-	*po = OPT_tld2_unit ;
+	*po = OPT_tld2_unit;
-	return ( de_tld2_unit ) ;
+	return(de_tld2_unit);
+    }
-    return ( NULL ) ;
+    return(NULL);
+}

Subversion Repositories tendra.SVN

(root)/branches/tendra5/src/tools/disp/templ/tdf.c – Rev 5 → 6