WebSVN – tendra.SVN – Diff – /trunk/src/utilities/sid/rule-simp.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 "name.h"
 #include "type.h"
 /*--------------------------------------------------------------------------*/
-#define EQUALITY_TABLE_SIZE (127)
+#define EQUALITY_TABLE_SIZE	(127)
 /*--------------------------------------------------------------------------*/
 typedef struct RuleSortListT {
     AltP			head;
     EntryP			to;
 } ReplaceClosureT, *ReplaceClosureP;
 /*--------------------------------------------------------------------------*/
-static RuleP			equality_table [EQUALITY_TABLE_SIZE];
+static RuleP		equality_table[EQUALITY_TABLE_SIZE];
 /*--------------------------------------------------------------------------*/
 static void
-rule_sort_alts PROTO_N ((sort_list))
-	       PROTO_T (RuleSortListP sort_list)
+rule_sort_alts(RuleSortListP sort_list)
+{
     AltP alt      = sort_list->head;
-    AltP scan_alt = alt_next (alt);
+    AltP scan_alt = alt_next(alt);
     if (scan_alt) {
 	RuleSortListT lower;
 	RuleSortListT higher;
 	lower.tail  = &(lower.head);
 	higher.tail = &(higher.head);
-	for (; scan_alt; scan_alt = alt_next (scan_alt)) {
+	for (; scan_alt; scan_alt = alt_next(scan_alt)) {
-	    if (alt_less_than (scan_alt, alt)) {
+	    if (alt_less_than(scan_alt, alt)) {
-		*(lower.tail)  = scan_alt;
+		*(lower.tail) = scan_alt;
-		lower.tail     = alt_next_ref (scan_alt);
+		lower.tail     = alt_next_ref(scan_alt);
 	    } else {
 		*(higher.tail) = scan_alt;
-		higher.tail    = alt_next_ref (scan_alt);
+		higher.tail    = alt_next_ref(scan_alt);
+	    }
+	}
-	*(lower.tail)  = NIL (AltP);
+	*(lower.tail) = NIL(AltP);
-	*(higher.tail) = NIL (AltP);
+	*(higher.tail) = NIL(AltP);
 	if (lower.head) {
-	    rule_sort_alts (&lower);
+	    rule_sort_alts(&lower);
 	    sort_list->head = lower.head;
 	    sort_list->tail = lower.tail;
 	} else {
 	    sort_list->tail = &(sort_list->head);
+	}
 	*(sort_list->tail) = alt;
-	sort_list->tail    = alt_next_ref (alt);
+	sort_list->tail    = alt_next_ref(alt);
 	if (higher.head) {
-	    rule_sort_alts (&higher);
+	    rule_sort_alts(&higher);
 	    *(sort_list->tail) = higher.head;
 	    sort_list->tail    = higher.tail;
+	}
-	*(sort_list->tail) = NIL (AltP);
+	*(sort_list->tail) = NIL(AltP);
+    }
+}
 static void
-rule_reorder PROTO_N ((rule))
+rule_reorder(RuleP rule)
-	     PROTO_T (RuleP rule)
+{
     RuleSortListT sort_list;
-    if ((sort_list.head = rule_alt_head (rule)) != NIL (AltP)) {
+    if ((sort_list.head = rule_alt_head(rule)) != NIL(AltP)) {
 	sort_list.tail = rule->alt_tail;
-	rule_sort_alts (&sort_list);
+	rule_sort_alts(&sort_list);
 	rule->alt_head = sort_list.head;
 	rule->alt_tail = sort_list.tail;
+    }
+}
 static void
-rule_hash_1 PROTO_N ((rule, predicate_id))
+rule_hash_1(RuleP rule, EntryP predicate_id)
-	    PROTO_T (RuleP  rule X
-		     EntryP predicate_id)
+{
-    unsigned hash_value = (unsigned) (rule_has_empty_alt (rule) ? 3 : 0);
+    unsigned hash_value = (unsigned)(rule_has_empty_alt(rule)? 3 : 0);
     AltP     alt;
-    rule_renumber (rule, TRUE, predicate_id);
+    rule_renumber(rule, TRUE, predicate_id);
-    rule_reorder (rule);
+    rule_reorder(rule);
-    for (alt = rule_alt_head (rule); alt; alt = alt_next (alt)) {
+    for (alt = rule_alt_head(rule); alt; alt = alt_next(alt)) {
 	ItemP item;
-	KeyP  key = NIL (KeyP);
+	KeyP  key = NIL(KeyP);
 	hash_value += 5;
-	for (item = alt_item_head (alt); item; item = item_next (item)) {
+	for (item = alt_item_head(alt); item; item = item_next(item)) {
-	    hash_value ++;
+	    hash_value++;
-	    if (!item_is_rule (item)) {
+	    if (!item_is_rule(item)) {
-		key = entry_key (item_entry (item));
+		key = entry_key(item_entry(item));
+	    }
+	}
 	if (key) {
-	    hash_value += key_hash_value (key);
+	    hash_value += key_hash_value(key);
+	}
+    }
     hash_value %= EQUALITY_TABLE_SIZE;
-    rule_set_next_in_table (rule, equality_table [hash_value]);
+    rule_set_next_in_table(rule, equality_table[hash_value]);
-    equality_table [hash_value] = rule;
+    equality_table[hash_value] = rule;
+}
 static void
-rule_hash_for_comparison PROTO_N ((entry, gclosure))
+rule_hash_for_comparison(EntryP entry, GenericP gclosure)
-			 PROTO_T (EntryP   entry X
-				  GenericP gclosure)
+{
-    if (entry_is_rule (entry)) {
+    if (entry_is_rule(entry)) {
-	RuleP  rule         = entry_get_rule (entry);
+	RuleP  rule         = entry_get_rule(entry);
-	EntryP predicate_id = (EntryP) gclosure;
+	EntryP predicate_id = (EntryP)gclosure;
-	rule_hash_1 (rule, predicate_id);
+	rule_hash_1(rule, predicate_id);
+    }
+}
 static BoolT
-rule_equal PROTO_N ((rule1, rule2))
+rule_equal(RuleP rule1, RuleP rule2)
-	   PROTO_T (RuleP rule1 X
-		    RuleP rule2)
+{
     AltP alt1;
     AltP alt2;
-    if ((!types_equal_numbers (rule_param (rule1), rule_param (rule2))) ||
+    if ((!types_equal_numbers(rule_param(rule1), rule_param(rule2))) ||
-	(!types_equal_numbers (rule_result (rule1), rule_result (rule2))) ||
+	(!types_equal_numbers(rule_result(rule1), rule_result(rule2))) ||
-	(rule_has_empty_alt (rule1) != rule_has_empty_alt (rule2)) ||
+	(rule_has_empty_alt(rule1) != rule_has_empty_alt(rule2)) ||
-	(!alt_equal (rule_get_handler (rule1), rule_get_handler (rule2))) ||
+	(!alt_equal(rule_get_handler(rule1), rule_get_handler(rule2))) ||
-	(!non_local_list_is_empty (rule_non_locals (rule1))) ||
+	(!non_local_list_is_empty(rule_non_locals(rule1))) ||
-	(!non_local_list_is_empty (rule_non_locals (rule2)))) {
+	(!non_local_list_is_empty(rule_non_locals(rule2)))) {
-	return (FALSE);
+	return(FALSE);
+    }
-    for (alt1 = rule_alt_head (rule1), alt2 = rule_alt_head (rule2);
+    for (alt1 = rule_alt_head(rule1), alt2 = rule_alt_head(rule2);
-	 alt1 && alt2; alt1 = alt_next (alt1), alt2 = alt_next (alt2)) {
+	 alt1 && alt2; alt1 = alt_next(alt1), alt2 = alt_next(alt2)) {
 	ItemP item1;
 	ItemP item2;
-	for (item1 = alt_item_head (alt1), item2 = alt_item_head (alt2);
+	for (item1 = alt_item_head(alt1), item2 = alt_item_head(alt2);
 	     item1 && item2;
-	     item1 = item_next (item1), item2 = item_next (item2)) {
+	     item1 = item_next(item1), item2 = item_next(item2)) {
-	    if ((item_entry (item1) != item_entry (item2)) ||
+	    if ((item_entry(item1) != item_entry(item2)) ||
-		(!types_equal_numbers (item_param (item1),
+		(!types_equal_numbers(item_param(item1), item_param(item2))) ||
-				       item_param (item2))) ||
-		(!types_equal_numbers (item_result (item1),
+		(!types_equal_numbers(item_result(item1),
-				       item_result (item2)))) {
+				      item_result(item2)))) {
-		return (FALSE);
+		return(FALSE);
+	    }
+	}
 	if (item1 || item2) {
-	    return (FALSE);
+	    return(FALSE);
+	}
+    }
     if (alt1 || alt2) {
-	return (FALSE);
+	return(FALSE);
+    }
-    return (TRUE);
+    return(TRUE);
+}
 static BoolT
-rule_do_replacements_1 PROTO_N ((alt, closure))
+rule_do_replacements_1(AltP alt, ReplaceClosureP closure)
-		       PROTO_T (AltP            alt X
-				ReplaceClosureP closure)
+{
     BoolT changed = FALSE;
     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_entry (item) == closure->from) {
+	if (item_entry(item) == closure->from) {
-	    item_set_entry (item, closure->to);
+	    item_set_entry(item, closure->to);
 	    changed = TRUE;
+	}
+    }
-    return (changed);
+    return(changed);
+}
 static void
-rule_do_replacements PROTO_N ((entry, gclosure))
+rule_do_replacements(EntryP entry, GenericP gclosure)
-		     PROTO_T (EntryP   entry X
-			      GenericP gclosure)
+{
-    ReplaceClosureP closure = (ReplaceClosureP) gclosure;
+    ReplaceClosureP closure = (ReplaceClosureP)gclosure;
-    if (entry_is_rule (entry)) {
+    if (entry_is_rule(entry)) {
-	RuleP rule    = entry_get_rule (entry);
+	RuleP rule    = entry_get_rule(entry);
 	BoolT changed = FALSE;
 	AltP  alt;
-	if ((alt = rule_get_handler (rule)) != NIL (AltP)) {
+	if ((alt = rule_get_handler(rule)) != NIL(AltP)) {
-	    if (rule_do_replacements_1 (alt, closure)) {
+	    if (rule_do_replacements_1(alt, closure)) {
 		changed = TRUE;
+	    }
+	}
-	for (alt = rule_alt_head (rule); alt; alt = alt_next (alt)) {
+	for (alt = rule_alt_head(rule); alt; alt = alt_next(alt)) {
-	    if (rule_do_replacements_1 (alt, closure)) {
+	    if (rule_do_replacements_1(alt, closure)) {
 		changed = TRUE;
+	    }
+	}
 	if (changed) {
-	    rule_reorder (rule);
+	    rule_reorder(rule);
+	}
+    }
+}
 static BoolT
-rule_remove_duplicates_1 PROTO_N ((rule_ref, table))
+rule_remove_duplicates_1(RuleP *rule_ref, TableP table)
-			 PROTO_T (RuleP *rule_ref X
-				  TableP table)
+{
     BoolT did_remove = FALSE;
     RuleP rule;
-    while ((rule = *rule_ref) != NIL (RuleP)) {
+    while ((rule = *rule_ref) != NIL(RuleP)) {
-	RuleP *inner_rule_ref = rule_get_next_in_table_ref (rule);
+	RuleP *inner_rule_ref = rule_get_next_in_table_ref(rule);
 	RuleP  inner_rule;
-	while ((inner_rule = *inner_rule_ref) != NIL (RuleP)) {
+	while ((inner_rule = *inner_rule_ref) != NIL(RuleP)) {
-	    if (rule_equal (rule, inner_rule)) {
+	    if (rule_equal(rule, inner_rule)) {
 		ReplaceClosureT closure;
-		if (rule_is_required (inner_rule)) {
+		if (rule_is_required(inner_rule)) {
-		    closure.from = rule_entry (rule);
+		    closure.from = rule_entry(rule);
-		    closure.to   = rule_entry (inner_rule);
+		    closure.to   = rule_entry(inner_rule);
-		    *rule_ref    = rule_get_next_in_table (rule);
+		    *rule_ref    = rule_get_next_in_table(rule);
 		} else {
-		    closure.from    = rule_entry (inner_rule);
+		    closure.from    = rule_entry(inner_rule);
-		    closure.to      = rule_entry (rule);
+		    closure.to      = rule_entry(rule);
-		    *inner_rule_ref = rule_get_next_in_table (inner_rule);
+		    *inner_rule_ref = rule_get_next_in_table(inner_rule);
+		}
-		table_iter (table, rule_do_replacements, (GenericP) &closure);
+		table_iter(table, rule_do_replacements, (GenericP)&closure);
 		did_remove = TRUE;
 		if (rule != *rule_ref) {
 		    goto removed_rule;
+		}
 	    } else {
-		inner_rule_ref = rule_get_next_in_table_ref (inner_rule);
+		inner_rule_ref = rule_get_next_in_table_ref(inner_rule);
+	    }
+	}
-	rule_ref = rule_get_next_in_table_ref (rule);
+	rule_ref = rule_get_next_in_table_ref(rule);
       removed_rule:;
+    }
-    return (did_remove);
+    return(did_remove);
+}
 /*--------------------------------------------------------------------------*/
 void
-rule_remove_duplicates PROTO_N ((table, predicate_id))
+rule_remove_duplicates(TableP table, EntryP predicate_id)
-		       PROTO_T (TableP table X
-				EntryP predicate_id)
+{
     BoolT    did_remove;
     unsigned i;
-    for (i = 0; i < EQUALITY_TABLE_SIZE; i ++) {
+    for (i = 0; i < EQUALITY_TABLE_SIZE; i++) {
-	equality_table [i] = NIL (RuleP);
+	equality_table[i] = NIL(RuleP);
+    }
-    table_iter (table, rule_hash_for_comparison, (GenericP) predicate_id);
+    table_iter(table, rule_hash_for_comparison, (GenericP)predicate_id);
     do {
 	did_remove = FALSE;
-	for (i = 0; i < EQUALITY_TABLE_SIZE; i ++) {
+	for (i = 0; i < EQUALITY_TABLE_SIZE; i++) {
-	    if (rule_remove_duplicates_1 (&(equality_table [i]), table)) {
+	    if (rule_remove_duplicates_1(&(equality_table[i]), table)) {
 		did_remove = TRUE;
+	    }
+	}
     } while (did_remove);
+}

Subversion Repositories tendra.SVN

(root)/trunk/src/utilities/sid/rule-simp.c – Rev 2 → 7