WebSVN – tendra.SVN – Diff – /trunk/src/utilities/calculus/obj_c/calculus.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.
 */
 #define calculus_IO_ROUTINES
 #include "config.h"
 #include "calculus.h"
 #include "error.h"
 #include "extra.h"
 #include "xalloc.h"
 /*
-    CHECK FOR CORRECT HEADERS
+ * CHECK FOR CORRECT HEADERS
+ *
-    The functions defined in this file give the implementations of various
+ * The functions defined in this file give the implementations of various
-    support functions used by the calculus implementation.  They should
+ * support functions used by the calculus implementation.  They should
-    therefore be compiled with the calculus implementation rather than the
+ * therefore be compiled with the calculus implementation rather than the
-    specification.
+ * specification.
-*/
+ */
 #if calculus_SPECIFICATION
 !!!error Implementation specific functions compiled with token specifications
 #endif
 /*
-    FREE OBJECTS
+ * FREE OBJECTS
+ *
-    These variables indicate the free calculi.  There is an array containing
+ * These variables indicate the free calculi.  There is an array containing
-    lists of small blocks, plus a single larger block.
+ * lists of small blocks, plus a single larger block.
-*/
+ */
-static calculus *free_calculi = NULL ;
+static calculus *free_calculi = NULL;
-static unsigned free_calculi_left = 0 ;
+static unsigned free_calculi_left = 0;
-static calculus *free_calculus_array [] = {
+static calculus *free_calculus_array[] = {
     NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
     NULL, NULL, NULL
-} ;
+};
 /*
-    GENERATE A NEW OBJECT BLOCK
+ * GENERATE A NEW OBJECT BLOCK
+ *
+ * This routine generates a new blcok of calculi of size sz.  Small blocks
+ * are allocated from the calculus array, others from the main calculus list.
+ */
-    This routine generates a new blcok of calculi of size sz.  Small blocks
-    are allocated from the calculus array, others from the main calculus list.
-*/
-calculus *gen_calculus
+calculus *
-    PROTO_N ( ( sz ) )
-    PROTO_T ( unsigned sz )
+gen_calculus(unsigned sz)
+{
-    calculus *p ;
+    calculus *p;
-    unsigned n = sz ;
+    unsigned n = sz;
-    ASSERT ( array_size ( free_calculus_array ) == calculus_GEN_MAX ) ;
+    ASSERT(array_size(free_calculus_array) == calculus_GEN_MAX);
-    ASSERT ( n != 0 ) ;
+    ASSERT(n != 0);
-    if ( n < calculus_GEN_MAX ) {
+    if (n < calculus_GEN_MAX) {
 	/* Allocate from small block array */
-	p = free_calculus_array [n] ;
+	p = free_calculus_array[n];
-	if ( p ) {
+	if (p) {
-	    free_calculus_array [n] = TAIL_list ( p ) ;
+	    free_calculus_array[n] = TAIL_list(p);
-	    return ( p ) ;
+	    return(p);
+	}
+    }
-calculus *find_calculus_alias
+calculus *
-    PROTO_N ( ( n ) )
-    PROTO_T ( unsigned n )
+end_calculus_list(calculus *p)
+{
-    calculus *p = crt_alias_list ;
+    calculus *r = p;
-    while ( p != NULL ) {
+    if (r == NULL) {
-	calculus *q = HEAD_list ( p )->ag_ptr ;
-	if ( q->ag_tag == n ) return ( q ) ;
-	p = TAIL_list ( p ) ;
+	    return(NULL);
+    }
-    error ( ERROR_FATAL, "Can't find alias %u", n ) ;
+    while (TAIL_list(r)) {
+	    r = TAIL_list(r);
+    }
-    return ( NULL ) ;
+    return(r);
+}
 /*
-    CLEAR ALL ALIASES
+ * EMPTY VECTOR
+ *
+ * This calculus represents the generic empty vector.  It is only defined
+ * if vector operations have been enabled.  Note that the element field
+ * of a vector is not be NULL, even if the vector is empty.
+ */
+#ifdef VEC
-    This routine clears all aliases.  Each alias in the list is reset to
+static calculus dummy_elem;
-    zero, and the list itself is freed.
+calculus_VEC empty_calculus_vec = {0, {&dummy_elem, &dummy_elem}};
+#endif
-*/
+/*
-void clear_calculus_alias
+ * ALIASING VARIABLES
+ *
+ * These variables give respectively the current alias number and the
-    PROTO_Z ()
+ * list of all aliases.
+ */
-{
-    calculus *p = crt_alias_list ;
+unsigned crt_calculus_alias = 0;
-    calculus *q = NULL ;
+static calculus *crt_alias_list = NULL;
+/*
-    while ( p != NULL ) {
+ * SET AN ALIAS
+ *
-	HEAD_list ( p )->ag_ptr->ag_tag = 0 ;
+ * This routine sets up an alias of p to n.
-	q = p ;
+ */
+void
-	p = TAIL_list ( p ) ;
+set_calculus_alias(calculus *p, unsigned n)
-    }
+{
-    if ( q ) {
+    calculus *q;
+    ASSERT(p != NULL);
-	TAIL_list ( q ) = free_calculus_array [2] ;
+    q = gen_calculus((unsigned)2);
-	free_calculus_array [2] = crt_alias_list ;
+    TAIL_list(q) = crt_alias_list;
-    }
+    HEAD_list(q)->ag_ptr = p;
-    crt_calculus_alias = 0 ;
+    p->ag_tag = n;
-    crt_alias_list = NULL ;
+    crt_alias_list = q;
-    return ;
+    return;
+}
 /*
-    ADD TWO LISTS
+ * FIND AN ALIAS
+ *
+ * This routine searches for alias number n.
+ */
-    This routine copies the list of blocks of calculi p and adds the list
-    q to the end.  sz gives the size of the blocks in the list.  This is
-    used for the user defined tokens in extra.h.
-*/
-calculus *add_calculus_list
+calculus *
-    PROTO_N ( ( p, q, sz ) )
-    PROTO_T ( calculus *p X calculus *q X int sz )
+find_calculus_alias(unsigned n)
+{
-    int i ;
-    calculus *r ;
+    calculus *p = crt_alias_list;
-    if ( p == NULL ) return ( q ) ;
+    while (p != NULL) {
-    r = gen_calculus ( ( unsigned ) ( sz + 1 ) ) ;
+	calculus *q = HEAD_list(p)->ag_ptr;
-    for ( i = 1 ; i <= sz ; i++ ) r [i] = p [i] ;
+	if (q->ag_tag == n) {
+		return(q);
+	}
+	p = TAIL_list(p);
+    }
-    TAIL_list ( r ) = add_calculus_list ( TAIL_list ( p ), q, sz ) ;
+    error(ERROR_FATAL, "Can't find alias %u", n);
-    return ( r ) ;
+    return(NULL);
+}
 /*
-    ASSERTION ROUTINES
+ * CLEAR ALL ALIASES
+ *
+ * This routine clears all aliases.  Each alias in the list is reset to
+ * zero, and the list itself is freed.
+ */
+void
+clear_calculus_alias(void)
+{
+    calculus *p = crt_alias_list;
+    calculus *q = NULL;
+    while (p != NULL) {
+	HEAD_list(p) ->ag_ptr->ag_tag = 0;
+	q = p;
+	p = TAIL_list(p);
+    }
+    if (q) {
+	TAIL_list(q) = free_calculus_array[2];
+	free_calculus_array[2] = crt_alias_list;
+    }
+    crt_calculus_alias = 0;
+    crt_alias_list = NULL;
+    return;
+}
+/*
+ * ADD TWO LISTS
+ *
+ * This routine copies the list of blocks of calculi p and adds the list
+ * q to the end.  sz gives the size of the blocks in the list.  This is
+ * used for the user defined tokens in extra.h.
+ */
+calculus *
+add_calculus_list(calculus *p, calculus *q, int sz)
+{
+    int i;
+    calculus *r;
+    if (p == NULL) {
+	    return(q);
+    }
+    r = gen_calculus((unsigned)(sz + 1));
+    for (i = 1; i <= sz; i++) {
+	    r[i] = p[i];
+    }
+    TAIL_list(r) = add_calculus_list(TAIL_list(p), q, sz);
+    return(r);
+}
+/*
+ * ASSERTION ROUTINES
+ *
-    These routine implement the assertion checks.
+ * These routine implement the assertion checks.
-*/
+ */
 #ifdef ASSERTS
 #define assert_calculus assertion
 #include "assert_def.h"
 #endif

Subversion Repositories tendra.SVN

(root)/trunk/src/utilities/calculus/obj_c/calculus.c – Rev 2 → 7