WebSVN – tendra.SVN – Diff – /branches/tendra5/src/utilities/sid/alt.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.
 */
 #include "type.h"
 /*--------------------------------------------------------------------------*/
 AltP
-alt_create PROTO_Z ()
+alt_create(void)
+{
-    AltP alt = ALLOCATE (AltT);
+    AltP alt = ALLOCATE(AltT);
-    alt->next      = NIL (AltP);
+    alt->next      = NIL(AltP);
-    types_init (alt_names (alt));
+    types_init(alt_names(alt));
-    bitvec_init (alt_first_set (alt));
+    bitvec_init(alt_first_set(alt));
-    alt->item_head = NIL (ItemP);
+    alt->item_head = NIL(ItemP);
     alt->item_tail = &(alt->item_head);
-    return (alt);
+    return(alt);
+}
 AltP
-alt_create_merge PROTO_N ((initial_item, trailing_item, translator, table))
+alt_create_merge(ItemP initial_item, ItemP trailing_item,
-		 PROTO_T (ItemP      initial_item X
-			  ItemP      trailing_item X
-			  TypeTransP translator X
+		 TypeTransP translator, TableP table)
-			  TableP     table)
+{
-    AltP alt = alt_create ();
+    AltP alt = alt_create();
-    for (; initial_item; initial_item = item_next (initial_item)) {
+    for (; initial_item; initial_item = item_next(initial_item)) {
-	ItemP new_item = item_duplicate_and_translate (initial_item,
+	ItemP new_item = item_duplicate_and_translate(initial_item, translator,
-						       translator,
-						       table);
+						      table);
-	alt_add_item (alt, new_item);
+	alt_add_item(alt, new_item);
+    }
-    for (; trailing_item; trailing_item = item_next (trailing_item)) {
+    for (; trailing_item; trailing_item = item_next(trailing_item)) {
-	ItemP new_item = item_duplicate (trailing_item);
+	ItemP new_item = item_duplicate(trailing_item);
-	alt_add_item (alt, new_item);
+	alt_add_item(alt, new_item);
+    }
-    return (alt);
+    return(alt);
+}
 AltP
-alt_duplicate PROTO_N ((alt))
+alt_duplicate(AltP alt)
-	      PROTO_T (AltP alt)
+{
-    AltP  new_alt = alt_create ();
+    AltP  new_alt = alt_create();
     ItemP item;
-    for (item = alt_item_head (alt); item; item = item_next (item)) {
+    for (item = alt_item_head(alt); item; item = item_next(item)) {
-	ItemP new_item = item_duplicate (item);
+	ItemP new_item = item_duplicate(item);
-	alt_add_item (new_alt, new_item);
+	alt_add_item(new_alt, new_item);
+    }
-    return (new_alt);
+    return(new_alt);
+}
 BoolT
-alt_less_than PROTO_N ((alt1, alt2))
+alt_less_than(AltP alt1, AltP alt2)
-	      PROTO_T (AltP alt1 X
-		       AltP alt2)
+{
-    ItemP      item1 = alt_item_head (alt1);
+    ItemP      item1 = alt_item_head(alt1);
-    ItemP      item2 = alt_item_head (alt2);
+    ItemP      item2 = alt_item_head(alt2);
     KeyP       key1;
     KeyP       key2;
     TypeTupleP type1;
     TypeTupleP type2;
-    if (item_type (item1) < item_type (item2)) {
+    if (item_type(item1) < item_type(item2)) {
-	return (TRUE);
+	return(TRUE);
-    } else if (item_type (item1) > item_type (item2)) {
+    } else if (item_type(item1) > item_type(item2)) {
-	return (FALSE);
+	return(FALSE);
+    }
-    key1 = entry_key (item_entry (item1));
+    key1 = entry_key(item_entry(item1));
-    key2 = entry_key (item_entry (item2));
+    key2 = entry_key(item_entry(item2));
-    switch (key_compare (key1, key2)) EXHAUSTIVE {
+    switch (key_compare(key1, key2)) EXHAUSTIVE {
       case CMP_LT:
-	return (TRUE);
+	return(TRUE);
       case CMP_GT:
-	return (FALSE);
+	return(FALSE);
       case CMP_EQ:
 	break;
+    }
-    type1 = item_param (item1);
+    type1 = item_param(item1);
-    type2 = item_param (item2);
+    type2 = item_param(item2);
-    switch (types_compare (type1, type2)) EXHAUSTIVE {
+    switch (types_compare(type1, type2)) EXHAUSTIVE {
       case CMP_LT:
-	return (TRUE);
+	return(TRUE);
       case CMP_GT:
-	return (FALSE);
+	return(FALSE);
       case CMP_EQ:
 	break;
+    }
-    type1 = item_result (item1);
+    type1 = item_result(item1);
-    type2 = item_result (item2);
+    type2 = item_result(item2);
-    switch (types_compare (type1, type2)) EXHAUSTIVE {
+    switch (types_compare(type1, type2)) EXHAUSTIVE {
       case CMP_LT:
-	return (TRUE);
+	return(TRUE);
       case CMP_GT:
-	return (FALSE);
+	return(FALSE);
       case CMP_EQ:
 	break;
+    }
     UNREACHED;
+}
 BoolT
-alt_equal PROTO_N ((alt1, alt2))
+alt_equal(AltP alt1, AltP alt2)
-	  PROTO_T (AltP alt1 X
-		   AltP alt2)
+{
     ItemP item1;
     ItemP item2;
-    if ((alt1 == NIL (AltP)) && (alt2 == NIL (AltP))) {
+    if ((alt1 == NIL(AltP)) && (alt2 == NIL(AltP))) {
-	return (TRUE);
+	return(TRUE);
-    } else if ((alt1 == NIL (AltP)) || (alt2 == NIL (AltP))) {
+    } else if ((alt1 == NIL(AltP)) || (alt2 == NIL(AltP))) {
-	return (FALSE);
+	return(FALSE);
+    }
-    item1 = alt_item_head (alt1);
+    item1 = alt_item_head(alt1);
-    item2 = alt_item_head (alt2);
+    item2 = alt_item_head(alt2);
     while (item1 && item2) {
-	if ((item_entry (item1) == item_entry (item2)) &&
+	if ((item_entry(item1) == item_entry(item2)) &&
-	    (types_equal_numbers (item_param (item1), item_param (item2))) &&
+	    (types_equal_numbers(item_param(item1), item_param(item2))) &&
-	    (types_equal_numbers (item_result (item1), item_result (item2)))) {
+	    (types_equal_numbers(item_result(item1), item_result(item2)))) {
-	    item1 = item_next (item1);
+	    item1 = item_next(item1);
-	    item2 = item_next (item2);
+	    item2 = item_next(item2);
 	} else {
-	    return (FALSE);
+	    return(FALSE);
+	}
+    }
-    return (item1 == item2);
+    return(item1 == item2);
+}
 #ifdef FS_FAST
 #undef alt_next
 #endif /* defined (FS_FAST) */
 AltP
-alt_next PROTO_N ((alt))
-	 PROTO_T (AltP alt)
+alt_next(AltP alt)
+{
-    return (alt->next);
+    return(alt->next);
+}
 #ifdef FS_FAST
-#define alt_next(a) ((a)->next)
+#define alt_next(a)	((a)->next)
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef alt_next_ref
 #endif /* defined (FS_FAST) */
 AltP *
-alt_next_ref PROTO_N ((alt))
+alt_next_ref(AltP alt)
-	     PROTO_T (AltP alt)
+{
-    return (&(alt->next));
+    return(&(alt->next));
+}
 #ifdef FS_FAST
-#define alt_next_ref(a) (&((a)->next))
+#define alt_next_ref(a)	(&((a)->next))
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef alt_set_next
 #endif /* defined (FS_FAST) */
 void
-alt_set_next PROTO_N ((alt1, alt2))
+alt_set_next(AltP alt1, AltP alt2)
-	     PROTO_T (AltP alt1 X
-		      AltP alt2)
+{
     alt1->next = alt2;
+}
 #ifdef FS_FAST
-#define alt_set_next(a1, a2) ((a1)->next = (a2))
+#define alt_set_next(a1, a2)	((a1)->next = (a2))
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef alt_names
 #endif /* defined (FS_FAST) */
 TypeTupleP
-alt_names PROTO_N ((alt))
+alt_names(AltP alt)
-	  PROTO_T (AltP alt)
+{
-    return (&(alt->names));
+    return(&(alt->names));
+}
 #ifdef FS_FAST
-#define alt_names(a) (&((a)->names))
+#define alt_names(a)	(&((a)->names))
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef alt_first_set
 #endif /* defined (FS_FAST) */
 BitVecP
-alt_first_set PROTO_N ((alt))
+alt_first_set(AltP alt)
-	      PROTO_T (AltP alt)
+{
-    return (&(alt->first_set));
+    return(&(alt->first_set));
+}
 #ifdef FS_FAST
-#define alt_first_set(a) (&((a)->first_set))
+#define alt_first_set(a)	(&((a)->first_set))
 #endif /* defined (FS_FAST) */
 #ifdef FS_FAST
 #undef alt_item_head
 #endif /* defined (FS_FAST) */
 ItemP
-alt_item_head PROTO_N ((alt))
+alt_item_head(AltP alt)
-	      PROTO_T (AltP alt)
+{
-    return (alt->item_head);
+    return(alt->item_head);
+}
 #ifdef FS_FAST
-#define alt_item_head(a) ((a)->item_head)
+#define alt_item_head(a)	((a)->item_head)
 #endif /* defined (FS_FAST) */
 ItemP
-alt_unlink_item_head PROTO_N ((alt))
+alt_unlink_item_head(AltP alt)
-		     PROTO_T (AltP alt)
+{
-    ItemP item = alt_item_head (alt);
+    ItemP item = alt_item_head(alt);
-    alt->item_head = item_next (item);
+    alt->item_head = item_next(item);
-    item_set_next (item, NIL (ItemP));
+    item_set_next(item, NIL(ItemP));
-    if (alt->item_tail == item_next_ref (item)) {
+    if (alt->item_tail == item_next_ref(item)) {
 	alt->item_tail = &(alt->item_head);
+    }
-    return (item);
+    return(item);
+}
 void
-alt_add_item PROTO_N ((alt, item))
+alt_add_item(AltP alt, ItemP item)
-	     PROTO_T (AltP  alt X
-		      ItemP item)
+{
     *(alt->item_tail) = item;
-    alt->item_tail    = item_next_ref (item);
+    alt->item_tail    = item_next_ref(item);
+}
 AltP
-alt_deallocate PROTO_N ((alt))
+alt_deallocate(AltP alt)
-	       PROTO_T (AltP alt)
+{
-    AltP  next = alt_next (alt);
+    AltP  next = alt_next(alt);
     ItemP item;
-    for (item = alt_item_head (alt); item; item = item_deallocate (item)) {
+    for (item = alt_item_head(alt); item; item = item_deallocate(item)) {
 	/*NOTHING*/
+    }
-    types_destroy (alt_names (alt));
+    types_destroy(alt_names(alt));
-    bitvec_destroy (alt_first_set (alt));
+    bitvec_destroy(alt_first_set(alt));
-    DEALLOCATE (alt);
+    DEALLOCATE(alt);
-    return (next);
+    return(next);
+}
 void
-write_alt PROTO_N ((ostream, alt))
+write_alt(OStreamP ostream, AltP alt)
-	  PROTO_T (OStreamP ostream X
-		   AltP     alt)
+{
     ItemP item;
-    for (item = alt_item_head (alt); item; item = item_next (item)) {
+    for (item = alt_item_head(alt); item; item = item_next(item)) {
-	write_tab (ostream);
+	write_tab(ostream);
-	write_item (ostream, item);
+	write_item(ostream, item);
-	write_newline (ostream);
+	write_newline(ostream);
+    }
+}
 void
-write_alt_highlighting PROTO_N ((ostream, alt, highlight))
+write_alt_highlighting(OStreamP ostream, AltP alt, ItemP highlight)
-		       PROTO_T (OStreamP ostream X
-				AltP     alt X
-				ItemP    highlight)
+{
     ItemP item;
-    for (item = alt_item_head (alt); item; item = item_next (item)) {
+    for (item = alt_item_head(alt); item; item = item_next(item)) {
 	if (item == highlight) {
-	    write_cstring (ostream, "==>>");
+	    write_cstring(ostream, "==>>");
+	}
-	write_tab (ostream);
+	write_tab(ostream);
-	write_item (ostream, item);
+	write_item(ostream, item);
-	write_newline (ostream);
+	write_newline(ostream);
+    }
+}
 /*
  * Local variables(smf):

Subversion Repositories tendra.SVN

(root)/branches/tendra5/src/utilities/sid/alt.c – Rev 5 → 6