WebSVN – tendra.SVN – Diff – /branches/tendra5/src/tools/disp/binding.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.
 */
     CREATE A NEW OBJECT
     This routine allocates a new object of type v.
 */
-object *new_object
+object *
-    PROTO_N ( ( v ) )
-    PROTO_T ( long v )
+new_object(long v)
+{
-    static object *free_objs = null ;
+    static object *free_objs = null;
-    static int objs_left = 0 ;
+    static int objs_left = 0;
-    object *p ;
+    object *p;
-    if ( objs_left == 0 ) {
+    if (objs_left == 0) {
-	objs_left = 200 ;
+	objs_left = 200;
-	free_objs = alloc_nof ( object, objs_left ) ;
+	free_objs = alloc_nof(object, objs_left);
+    }
-    objs_left-- ;
+    objs_left--;
-    p = free_objs + objs_left ;
+    p = free_objs + objs_left;
-    p->named = 0 ;
+    p->named = 0;
-    p->id = ( var_count [v] )++ ;
+    p->id = (var_count[v]) ++;
-    p->order = -1 ;
+    p->order = -1;
-    p->aux = null ;
+    p->aux = null;
-    if ( v == var_tag ) {
+    if (v == var_tag) {
-	var ( p ) = 3 ;
+	var(p) = 3;
-    } else if ( v == var_token ) {
+    } else if (v == var_token) {
-	is_foreign ( p ) = 0 ;
+	is_foreign(p) = 0;
-	res_sort ( p ) = sort_unknown ;
+	res_sort(p) = sort_unknown;
-	implicit_sort ( p ) = sort_unknown ;
+	implicit_sort(p) = sort_unknown;
-	arg_sorts ( p ) = null ;
+	arg_sorts(p) = null;
+    }
-    return ( p ) ;
+    return(p);
+}
 /*
     SPARE BINDING TABLE
     In fact only two binding tables are ever needed.  The one not in use
     is stored in spare_bt.
 */
-static binding *spare_bt = null ;
+static binding *spare_bt = null;
 /*
     CREATE A NEW BINDING TABLE
     This routine allocates a new binding table and initializes its entries.
 */
-binding *new_binding_table
+binding *
-    PROTO_Z ()
+new_binding_table(void)
+{
-    binding *bt ;
+    binding *bt;
-    long i, n = no_variables ;
+    long i, n = no_variables;
-    if ( n == 0 ) return ( null ) ;
+    if (n == 0) return(null);
-    if ( spare_bt ) {
+    if (spare_bt) {
-	bt = spare_bt ;
+	bt = spare_bt;
-	spare_bt = null ;
+	spare_bt = null;
-	for ( i = 0 ; i < n ; i++ ) {
+	for (i = 0; i < n; i++) {
-	    bt [i].max_no = 0 ;
+	    bt[i].max_no = 0;
+	}
     } else {
-	bt = alloc_nof ( binding, n ) ;
+	bt = alloc_nof(binding, n);
-	for ( i = 0 ; i < n ; i++ ) {
+	for (i = 0; i < n; i++) {
-	    bt [i].max_no = 0 ;
+	    bt[i].max_no = 0;
-	    bt [i].sz = 0 ;
+	    bt[i].sz = 0;
-	    bt [i].table = null ;
+	    bt[i].table = null;
+	}
+    }
-    return ( bt ) ;
+    return(bt);
+}
 /*
     FREE A BINDING
     The binding bt is returned to free.
 */
-void free_binding_table
+void
-    PROTO_N ( ( bt ) )
-    PROTO_T ( binding *bt )
+free_binding_table(binding *bt)
+{
-    spare_bt = bt ;
+    spare_bt = bt;
-    return ;
+    return;
+}
 /*
     SET THE SIZE OF A BINDING
     The vth entry of bt is set to size n.
 */
-void set_binding_size
+void
-    PROTO_N ( ( bt, v, n ) )
-    PROTO_T ( binding *bt X long v X long n )
+set_binding_size(binding *bt, long v, long n)
+{
-    object **p ;
+    object **p;
-    binding *b ;
+    binding *b;
-    long i, m = n + 10 ;
+    long i, m = n + 10;
-    if ( v < 0 || v >= no_variables ) {
+    if (v < 0 || v >= no_variables) {
-	input_error ( "Illegal binding sort" ) ;
+	input_error("Illegal binding sort");
-	return ;
+	return;
+    }
-    b = bt + v ;
+    b = bt + v;
-    b->max_no = n ;
+    b->max_no = n;
-    if ( b->sz < m ) {
+    if (b->sz < m) {
-	p = realloc_nof ( b->table, object *, m ) ;
+	p = realloc_nof(b->table, object *, m);
-	b->sz = m ;
+	b->sz = m;
-	b->table = p ;
+	b->table = p;
     } else {
-	p = b->table ;
+	p = b->table;
+    }
-    for ( i = 0 ; i < b->sz ; i++ ) p [i] = null ;
+    for (i = 0; i < b->sz; i++)p[i] = null;
-    return ;
+    return;
+}
 /*
     SET AN ENTRY IN A BINDING
     The nth entry of the vth entry of the binding bt is set to p.
 */
-void set_binding
+void
-    PROTO_N ( ( bt, v, n, p ) )
-    PROTO_T ( binding *bt X long v X long n X object *p )
+set_binding(binding *bt, long v, long n, object *p)
+{
-    binding *b ;
+    binding *b;
-    if ( v < 0 || v >= no_variables ) {
+    if (v < 0 || v >= no_variables) {
-	input_error ( "Illegal binding sort" ) ;
+	input_error("Illegal binding sort");
-	return ;
+	return;
+    }
-    b = bt + v ;
+    b = bt + v;
-    if ( n >= b->max_no || n < 0 ) {
+    if (n >= b->max_no || n < 0) {
-	out ( "<error>" ) ;
+	out("<error>");
-	input_error ( "Object number %ld (%s) too big", n, var_types [v] ) ;
+	input_error("Object number %ld (%s) too big", n, var_types[v]);
-	while ( n >= b->sz ) {
+	while (n >= b->sz) {
 	    /* Table is extended (errors only) */
-	    long i, m = b->sz + 100 ;
+	    long i, m = b->sz + 100;
-	    b->sz = m ;
+	    b->sz = m;
-	    b->table = realloc_nof ( b->table, object *, m ) ;
+	    b->table = realloc_nof(b->table, object *, m);
-	    for ( i = 1 ; i <= 100 ; i++ ) b->table [ m - i ] = null ;
+	    for (i = 1; i <= 100; i++)b->table[m - i] = null;
+	}
+    }
-    if ( b->table [n] ) {
+    if (b->table[n]) {
-	input_error ( "Object %s (%s) already bound", object_name ( v, n ),
+	input_error("Object %s (%s) already bound", object_name(v, n),
-		      var_types [v] ) ;
+		      var_types[v]);
+    }
-    b->table [n] = p ;
+    b->table[n] = p;
-    return ;
+    return;
+}
 /*
     FILL IN BLANK ENTRIES IN A BINDING
     Objects are allocated for all the entries in the binding bt which
     are not associated with an existing object.
 */
-void complete_binding
+void
-    PROTO_N ( ( bt ) )
-    PROTO_T ( binding *bt )
+complete_binding(binding *bt)
+{
-    long v ;
+    long v;
-    for ( v = 0 ; v < no_variables ; v++ ) {
+    for (v = 0; v < no_variables; v++) {
-	long i ;
+	long i;
-	binding *b = bt + v ;
+	binding *b = bt + v;
-	for ( i = 0 ; i < b->max_no ; i++ ) {
+	for (i = 0; i < b->max_no; i++) {
-	    if ( b->table [i] == null ) {
+	    if (b->table[i] == null) {
-		b->table [i] = new_object ( v ) ;
+		b->table[i] = new_object(v);
+	    }
+	}
+    }
-    return ;
+    return;
+}
 /*
     FIND AN ENTRY IN A BINDING
     The nth entry of the vth entry of binding bt is returned.
 */
-object *find_binding
+object *
-    PROTO_N ( ( bt, v, n ) )
-    PROTO_T ( binding *bt X long v X long n )
+find_binding(binding *bt, long v, long n)
+{
-    binding *b ;
+    binding *b;
-    if ( v < 0 || v >= no_variables ) {
+    if (v < 0 || v >= no_variables) {
-	input_error ( "Illegal binding sort" ) ;
+	input_error("Illegal binding sort");
-	return ( null ) ;
+	return(null);
+    }
-    b = bt + v ;
+    b = bt + v;
-    if ( n >= b->max_no || n < 0 ) {
+    if (n >= b->max_no || n < 0) {
-	out ( "<error>" ) ;
+	out("<error>");
-	input_error ( "Object number %ld (%s) too big", n, var_types [v] ) ;
+	input_error("Object number %ld (%s) too big", n, var_types[v]);
+    }
-    if ( n >= b->sz ) return ( null ) ;
+    if (n >= b->sz) return(null);
-    return ( b->table [n] ) ;
+    return(b->table[n]);
+}
 /*
     OUTPUT AN OBJECT
     The object p of type v and number n is output.
 */
-void out_object
+void
-    PROTO_N ( ( n, p, v ) )
-    PROTO_T ( long n X object *p X long v )
+out_object(long n, object *p, long v)
+{
-    if ( v < 0 || v >= no_variables ) {
+    if (v < 0 || v >= no_variables) {
-	out ( "<error>" ) ;
+	out("<error>");
-	input_error ( "Illegal binding sort" ) ;
+	input_error("Illegal binding sort");
-	return ;
+	return;
+    }
-    if ( dumb_mode ) {
+    if (dumb_mode) {
-	word *w ;
+	word *w;
-	out_string ( var_types [v] ) ;
+	out_string(var_types[v]);
-	w = new_word ( HORIZ_BRACKETS ) ;
+	w = new_word(HORIZ_BRACKETS);
-	out_int ( n ) ;
+	out_int(n);
-	end_word ( w ) ;
+	end_word(w);
-	return ;
+	return;
+    }
-    if ( p == null ) {
+    if (p == null) {
-	p = find_binding ( crt_binding, v, n ) ;
+	p = find_binding(crt_binding, v, n);
-	if ( p == null ) {
+	if (p == null) {
-	    p = new_object ( v ) ;
+	    p = new_object(v);
-	    set_binding ( crt_binding, v, n, p ) ;
+	    set_binding(crt_binding, v, n, p);
+	}
+    }
-    if ( p->named ) {
+    if (p->named) {
-	if ( p->name.simple ) {
+	if (p->name.simple) {
-	    out ( p->name.val.str ) ;
+	    out(p->name.val.str);
 	} else {
-	    out_unique ( p->name.val.uniq ) ;
+	    out_unique(p->name.val.uniq);
+	}
-	return ;
+	return;
+    }
-    out_char ( '~' ) ;
+    out_char('~');
-    out_string ( var_types [v] ) ;
+    out_string(var_types[v]);
-    out_char ( '_' ) ;
+    out_char('_');
-    out_int ( p->id ) ;
+    out_int(p->id);
-    return ;
+    return;
+}
 /*
     RETURN AN OBJECT NAME (FOR ERROR REPORTING)
     The name of object type v and number n is returned.
 */
-char *object_name
+char *
-    PROTO_N ( ( v, n ) )
-    PROTO_T ( long v X long n )
+object_name(long v, long n)
+{
-    object *p ;
+    object *p;
-    char *buff = alloc_nof ( char, 1000 ) ;
+    char *buff = alloc_nof(char, 1000);
-    if ( dumb_mode ) {
+    if (dumb_mode) {
-	IGNORE sprintf ( buff, "%ld", n ) ;
+	IGNORE sprintf(buff, "%ld", n);
-	return ( buff ) ;
+	return(buff);
+    }
-    p = find_binding ( crt_binding, v, n ) ;
+    p = find_binding(crt_binding, v, n);
-    if ( p->named ) {
+    if (p->named) {
-	if ( p->name.simple ) {
+	if (p->name.simple) {
-	    IGNORE sprintf ( buff, "%s", p->name.val.str ) ;
+	    IGNORE sprintf(buff, "%s", p->name.val.str);
 	} else {
-	    IGNORE sprintf ( buff, "unique(%ld)", p->id ) ;
+	    IGNORE sprintf(buff, "unique(%ld)", p->id);
+	}
     } else {
-	IGNORE sprintf ( buff, "%ld", p->id ) ;
+	IGNORE sprintf(buff, "%ld", p->id);
+    }
-    return ( buff ) ;
+    return(buff);
+}

Subversion Repositories tendra.SVN

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