WebSVN – tendra.SVN – Diff – /branches/tendra5/src/tools/tspec/hash.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.
 */
     These hash tables represent the various namespaces permitted in C
     plus the TDF token namespace.
 */
-hash_table *exps ;
+hash_table *exps;
-hash_table *files ;
+hash_table *files;
-hash_table *keywords ;
+hash_table *keywords;
-hash_table *subsets ;
+hash_table *subsets;
-hash_table *tags ;
+hash_table *tags;
-hash_table *tag_fields ;
+hash_table *tag_fields;
-hash_table *tokens ;
+hash_table *tokens;
-hash_table *types ;
+hash_table *types;
-hash_table *type_fields ;
+hash_table *type_fields;
 /*
     INITIALISATION ROUTINE
     This routine initialises the standard hash tables and sets a few
     miscellaneous variables.
 */
-void init_hash
+void
-    PROTO_Z ()
+init_hash(void)
+{
-    buffer = alloc_nof ( char, buffsize + 100 ) ;
+    buffer = alloc_nof(char, buffsize + 100);
-    exps = make_hash_table ( "Expression" ) ;
+    exps = make_hash_table("Expression");
-    files = make_hash_table ( "Output file" ) ;
+    files = make_hash_table("Output file");
-    keywords = make_hash_table ( "Keyword" ) ;
+    keywords = make_hash_table("Keyword");
-    subsets = make_hash_table ( "Set" ) ;
+    subsets = make_hash_table("Set");
-    tags = make_hash_table ( "Tag" ) ;
+    tags = make_hash_table("Tag");
-    tag_fields = make_hash_table ( "Field selector struct/union" ) ;
+    tag_fields = make_hash_table("Field selector struct/union");
-    tokens = make_hash_table ( "Token" ) ;
+    tokens = make_hash_table("Token");
-    types = make_hash_table ( "Type" ) ;
+    types = make_hash_table("Type");
-    type_fields = make_hash_table ( "Field selector" ) ;
+    type_fields = make_hash_table("Field selector");
-    return ;
+    return;
+}
 /*
     HASHING ROUTINE
     This routine finds the hash value of the string nm.  This value must
     lie in the range [ 0, hash_size ).
 */
-static int hash
+static int
-    PROTO_N ( ( nm ) )
-    PROTO_T ( char *nm )
+hash(char *nm)
+{
-    char *s ;
+    char *s;
-    int n = 0 ;
+    int n = 0;
-    for ( s = nm ; *s ; s++ ) n += *s ;
+    for (s = nm; *s; s++)n += *s;
-    return ( n % hash_size ) ;
+    return(n % hash_size);
+}
 /*
     CREATE A NEW HASH TABLE
     This routine creates a new hash table called nm.
 */
-hash_table *make_hash_table
+hash_table *
-    PROTO_N ( ( nm ) )
-    PROTO_T ( char *nm )
+make_hash_table(char *nm)
+{
-    int i ;
+    int i;
-    hash_table *t = alloc_nof ( hash_table, 1 ) ;
+    hash_table *t = alloc_nof(hash_table, 1);
-    t->name = nm ;
+    t->name = nm;
-    for ( i = 0 ; i < hash_size ; i++ ) t->array [i] = null ;
+    for (i = 0; i < hash_size; i++)t->array [i] = null;
-    return ( t ) ;
+    return(t);
+}
 /*
     LOOK UP A NAME IN A HASH TABLE
     This routine looks up the object nm (version v) in the hth column
     of hash table t.  It returns the object if it is found, or null
     otherwise.
 */
-static object *lookup_hash
+static object *
-    PROTO_N ( ( t, nm, v, h ) )
-    PROTO_T ( hash_table *t X char *nm X int v X int h )
+lookup_hash(hash_table *t, char *nm, int v, int h)
+{
-    hash_elem *e = t->array [h] ;
+    hash_elem *e = t->array [h];
-    while ( e ) {
+    while (e) {
-	if ( streq ( nm, e->obj->name ) ) {
+	if (streq(nm, e->obj->name)) {
-	    if ( v == e->vers || v == any_version ) return ( e->obj ) ;
+	    if (v == e->vers || v == any_version) return(e->obj);
+	}
-	e = e->next ;
+	e = e->next;
+    }
-    return ( null ) ;
+    return(null);
+}
 /*
     ADD AN OBJECT TO A HASH TABLE
     This routine adds the object p (version v) to the hash table t,
     reporting an error and returning the old value if it is already
     defined.  Otherwise it returns p.
 */
-object *add_hash
+object *
-    PROTO_N ( ( t, p, v ) )
-    PROTO_T ( hash_table *t X object *p X int v )
+add_hash(hash_table *t, object *p, int v)
+{
-    hash_elem *e ;
+    hash_elem *e;
-    char *nm = p->name ;
+    char *nm = p->name;
-    int h = hash ( nm ) ;
+    int h = hash(nm);
-    object *q = lookup_hash ( t, nm, v, h ) ;
+    object *q = lookup_hash(t, nm, v, h);
-    if ( q != null ) {
+    if (q != null) {
-	char *fn = q->filename ;
+	char *fn = q->filename;
-	if ( fn ) {
+	if (fn) {
-	    char *err = "%s '%s' already defined (%s, line %d)" ;
+	    char *err = "%s '%s' already defined (%s, line %d)";
-	    error ( ERR_SERIOUS, err, t->name, nm, fn, q->line_no ) ;
+	    error(ERR_SERIOUS, err, t->name, nm, fn, q->line_no);
 	} else {
-	    error ( ERR_SERIOUS, "%s '%s' already defined", t->name, nm ) ;
+	    error(ERR_SERIOUS, "%s '%s' already defined", t->name, nm);
+	}
-	return ( q ) ;
+	return(q);
+    }
-    alloc_variable ( e, hash_elem, 1000 ) ;
+    alloc_variable(e, hash_elem, 1000);
-    e->obj = p ;
+    e->obj = p;
-    e->vers = v ;
+    e->vers = v;
-    e->next = t->array [h] ;
+    e->next = t->array [h];
-    t->array [h] = e ;
+    t->array [h] = e;
-    return ( p ) ;
+    return(p);
+}
 /*
     SEARCH A HASH TABLE FOR AN OBJECT
     This routine searches the hash table t for the object named nm
     (version v), returning it if it is found.  If it is not found then
     null is returned.
 */
-object *search_hash
+object *
-    PROTO_N ( ( t, nm, v ) )
-    PROTO_T ( hash_table *t X char *nm X int v )
+search_hash(hash_table *t, char *nm, int v)
+{
-    int h = hash ( nm ) ;
+    int h = hash(nm);
-    return ( lookup_hash ( t, nm, v, h ) ) ;
+    return(lookup_hash(t, nm, v, h));
+}
 /*
     SORT THE ELEMENTS OF A HASH LIST
     This routine sorts the elements of the hash table t into a single
     alphabetical list.  The table cannot be used subsequently.
 */
-hash_elem *sort_hash
+hash_elem *
-    PROTO_N ( ( t ) )
-    PROTO_T ( hash_table *t )
+sort_hash(hash_table *t)
+{
-    int i ;
+    int i;
-    hash_elem *r = null ;
+    hash_elem *r = null;
-    for ( i = 0 ; i < hash_size ; i++ ) {
+    for (i = 0; i < hash_size; i++) {
-	hash_elem *p = t->array [i]  ;
+	hash_elem *p = t->array [i] ;
-	while ( p ) {
+	while (p) {
-	    hash_elem *pn = p->next ;
+	    hash_elem *pn = p->next;
-	    hash_elem *q = r, *s = null ;
+	    hash_elem *q = r, *s = null;
-	    while ( q ) {
+	    while (q) {
-		if ( strcmp ( p->obj->name, q->obj->name ) <= 0 ) break ;
+		if (strcmp(p->obj->name, q->obj->name) <= 0)break;
-		s = q ;
+		s = q;
-		q = q->next ;
+		q = q->next;
+	    }
-	    if ( s == null ) {
+	    if (s == null) {
-		p->next = r ;
+		p->next = r;
-		r = p ;
+		r = p;
 	    } else {
-		p->next = s->next ;
+		p->next = s->next;
-		s->next = p ;
+		s->next = p;
+	    }
-	    p = pn ;
+	    p = pn;
+	}
+    }
-    return ( r ) ;
+    return(r);
+}

Subversion Repositories tendra.SVN

(root)/branches/tendra5/src/tools/tspec/hash.c – Rev 5 → 6