WebSVN – tendra.SVN – Diff – /branches/tendra5/src/producers/common/construct/destroy.c

+/*
+ * Copyright (c) 2002-2006 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 "config.h"
 #include "c_types.h"
 #include "exp_ops.h"
 #include "id_ops.h"
 #include "member_ops.h"
 #include "type_ops.h"
 #include "error.h"
 #include "destroy.h"
 #include "exception.h"
 #include "macro.h"
 /*
     FREE A LOCAL IDENTIFIER
     This routine frees the local identifier id.
 */
-static void free_id
+static void
-    PROTO_N ( ( id, force ) )
-    PROTO_T ( IDENTIFIER id X int force )
+free_id(IDENTIFIER id, int force)
 {
-    if ( IS_NULL_id ( id ) ) return ;
+	if (IS_NULL_id(id)) {
+		return;
+	}
-    switch ( TAG_id ( id ) ) {
+	switch (TAG_id(id)) {
-	case id_variable_tag : {
+	case id_variable_tag: {
-	    DECL_SPEC ds = DEREF_dspec ( id_storage ( id ) ) ;
+		DECL_SPEC ds = DEREF_dspec(id_storage(id));
-	    if ( ds & dspec_auto ) {
+		if (ds & dspec_auto) {
-		EXP e = DEREF_exp ( id_variable_init ( id ) ) ;
+			EXP e = DEREF_exp(id_variable_init(id));
-		EXP d = DEREF_exp ( id_variable_term ( id ) ) ;
+			EXP d = DEREF_exp(id_variable_term(id));
-		if ( !IS_NULL_exp ( e ) ) free_exp ( e, force ) ;
+			if (!IS_NULL_exp(e)) {
+				free_exp(e, force);
+			}
-		if ( !IS_NULL_exp ( d ) ) free_exp ( d, force ) ;
+			if (!IS_NULL_exp(d)) {
+				free_exp(d, force);
+			}
-		COPY_exp ( id_variable_init ( id ), NULL_exp ) ;
+			COPY_exp(id_variable_init(id), NULL_exp);
-		COPY_exp ( id_variable_term ( id ), NULL_exp ) ;
+			COPY_exp(id_variable_term(id), NULL_exp);
-	    }
+		}
-	    break ;
+		break;
 	}
-	case id_label_tag : {
+	case id_label_tag: {
-	    LIST ( VARIABLE ) v = DEREF_list ( id_label_vars ( id ) ) ;
+		LIST(VARIABLE)v = DEREF_list(id_label_vars(id));
-	    DESTROY_list ( v, SIZE_var ) ;
+		DESTROY_list(v, SIZE_var);
-	    COPY_list ( id_label_vars ( id ), NULL_list ( VARIABLE ) ) ;
+		COPY_list(id_label_vars(id), NULL_list(VARIABLE));
-	    COPY_exp ( id_label_stmt ( id ), NULL_exp ) ;
+		COPY_exp(id_label_stmt(id), NULL_exp);
-	    COPY_exp ( id_label_gotos ( id ), NULL_exp ) ;
+		COPY_exp(id_label_gotos(id), NULL_exp);
-	    break ;
+		break;
 	}
-    }
+	}
-    return ;
+	return;
 }
 /*
     FREE A NAMESPACE
     This routine frees the block namespace ns.
 */
-void free_nspace
+void
-    PROTO_N ( ( ns ) )
-    PROTO_T ( NAMESPACE ns )
+free_nspace(NAMESPACE ns)
+{
-    if ( !IS_NULL_nspace ( ns ) ) {
+	if (!IS_NULL_nspace(ns)) {
-	MEMBER mem = DEREF_member ( nspace_last ( ns ) ) ;
+		MEMBER mem = DEREF_member(nspace_last(ns));
-	while ( !IS_NULL_member ( mem ) ) {
+		while (!IS_NULL_member(mem)) {
-	    IDENTIFIER id ;
+			IDENTIFIER id;
-	    IDENTIFIER alt ;
+			IDENTIFIER alt;
-	    DESTROY_member_small ( destroy, id, alt, mem, mem ) ;
+			DESTROY_member_small(destroy, id, alt, mem, mem);
-	    UNUSED ( id ) ;
+			UNUSED(id);
-	    UNUSED ( alt ) ;
+			UNUSED(alt);
+		}
+		COPY_member(nspace_last(ns), NULL_member);
+		COPY_member(nspace_prev(ns), NULL_member);
+	}
-	COPY_member ( nspace_last ( ns ), NULL_member ) ;
-	COPY_member ( nspace_prev ( ns ), NULL_member ) ;
-    }
-    return ;
+	return;
+}
 /*
     FREE AN OFFSET
     This routine frees the offset off.  Note that member and base offsets
     are linked directly to the classes they represent and so are not
     destroyed here.
 */
-void free_offset
+void
-    PROTO_N ( ( off, force ) )
-    PROTO_T ( OFFSET off X int force )
+free_offset(OFFSET off, int force)
 {
-    if ( IS_NULL_off ( off ) ) return ;
+	if (IS_NULL_off(off)) {
+		return;
+	}
-    ASSERT ( ORDER_off == 13 ) ;
+	ASSERT(ORDER_off == 13);
-    switch ( TAG_off ( off ) ) {
+	switch (TAG_off(off)) {
-	case off_zero_tag : {
+	case off_zero_tag: {
-	    TYPE t ;
+		TYPE t;
-	    DESTROY_off_zero ( destroy, t, off ) ;
+		DESTROY_off_zero(destroy, t, off);
-	    UNUSED ( t ) ;
+		UNUSED(t);
-	    break ;
+		break;
 	}
-	case off_type_tag : {
+	case off_type_tag: {
-	    TYPE t ;
+		TYPE t;
-	    DESTROY_off_type ( destroy, t, off ) ;
+		DESTROY_off_type(destroy, t, off);
-	    UNUSED ( t ) ;
+		UNUSED(t);
-	    break ;
+		break;
 	}
-	case off_extra_tag : {
+	case off_extra_tag: {
-	    int n ;
+		int n;
-	    TYPE t ;
+		TYPE t;
-	    DESTROY_off_extra ( destroy, t, n, off ) ;
+		DESTROY_off_extra(destroy, t, n, off);
-	    UNUSED ( n ) ;
+		UNUSED(n);
-	    UNUSED ( t ) ;
+		UNUSED(t);
-	    break ;
+		break;
 	}
-	case off_array_tag : {
+	case off_array_tag: {
-	    TYPE t ;
+		TYPE t;
-	    unsigned n ;
+		unsigned n;
-	    DESTROY_off_array ( destroy, t, n, off ) ;
+		DESTROY_off_array(destroy, t, n, off);
-	    UNUSED ( n ) ;
+		UNUSED(n);
-	    UNUSED ( t ) ;
+		UNUSED(t);
-	    break ;
+		break;
 	}
-	case off_ptr_mem_tag : {
+	case off_ptr_mem_tag: {
-	    EXP a ;
+		EXP a;
-	    DESTROY_off_ptr_mem ( destroy, a, off ) ;
+		DESTROY_off_ptr_mem(destroy, a, off);
-	    free_exp ( a, force ) ;
+		free_exp(a, force);
-	    break ;
-	}
-	case off_negate_tag : {
-	    OFFSET a ;
-	    DESTROY_off_negate ( destroy, a, off ) ;
-	    free_offset ( a, force ) ;
-	    break ;
+		break;
+	}
-	case off_mult_tag : {
+	case off_negate_tag: {
-	    EXP b ;
-	    OFFSET a ;
+		OFFSET a;
-	    DESTROY_off_mult ( destroy, a, b, off ) ;
+		DESTROY_off_negate(destroy, a, off);
-	    free_offset ( a, force ) ;
+		free_offset(a, force);
-	    free_exp ( b, force ) ;
-	    break ;
+		break;
+	}
-	case off_ptr_diff_tag : {
+	case off_mult_tag: {
-	    EXP a, b ;
+		EXP b;
+		OFFSET a;
-	    DESTROY_off_ptr_diff ( destroy, a, b, off ) ;
+		DESTROY_off_mult(destroy, a, b, off);
-	    free_exp ( a, force ) ;
+		free_offset(a, force);
-	    free_exp ( b, force ) ;
+		free_exp(b, force);
-	    break ;
+		break;
+	}
-	case off_base_tag :
+	case off_ptr_diff_tag: {
-	case off_deriv_tag :
+		EXP a, b;
-	case off_member_tag :
+		DESTROY_off_ptr_diff(destroy, a, b, off);
-	case off_plus_tag :
+		free_exp(a, force);
-	case off_token_tag : {
+		free_exp(b, force);
-	    /* Don't free these cases */
-	    break ;
+		break;
+	}
+	case off_base_tag:
+	case off_deriv_tag:
+	case off_member_tag:
+	case off_plus_tag:
+	case off_token_tag: {
+		/* Don't free these cases */
+		break;
+	}
-    }
+	}
-    return ;
+	return;
 }
 /*
     DESTROY A LIST OF EXPRESSIONS
     This routine frees the list of expressions p.
 */
-void free_exp_list
+void
-    PROTO_N ( ( p, force ) )
-    PROTO_T ( LIST ( EXP ) p X int force )
+free_exp_list(LIST(EXP)p, int force)
 {
-    while ( !IS_NULL_list ( p ) ) {
+	while (!IS_NULL_list(p)) {
-	EXP e ;
+		EXP e;
-	DESTROY_CONS_exp ( destroy, e, p, p ) ;
+		DESTROY_CONS_exp(destroy, e, p, p);
-	free_exp ( e, force ) ;
+		free_exp(e, force);
-    }
+	}
-    return ;
+	return;
 }
 /*
     FREE AN EXPRESSION
     This routine frees the expression e.  It is possible for the same
     sub-expression to be reused twice in an expression, so freed expressions
     are marked by having their type set to the rule type.  This exploits
     some knowledge about about how destroy_c_class works.
+	}
-	case exp_token_tag : {
+	case exp_dummy_tag: {
+		int v;
+		ulong n;
-	    IDENTIFIER id ;
+		int cnt;
-	    LIST ( TOKEN ) p ;
+		OFFSET off;
-	    DESTROY_exp_token ( destroy, t, a, id, p, e ) ;
+		DESTROY_exp_dummy(destroy, t, a, n, off, v, cnt, e);
+		free_exp(a, force1);
+		free_offset(off, force1);
-	    UNUSED ( id ) ;
+		UNUSED(cnt);
-	    UNUSED ( p ) ;
+		UNUSED(n);
-	    UNUSED ( a ) ;
+		UNUSED(v);
-	    break ;
+		break;
+	}
-	case exp_dummy_tag : {
-	    int v ;
-	    ulong n ;
-	    int cnt ;
-	    OFFSET off ;
-	    DESTROY_exp_dummy ( destroy, t, a, n, off, v, cnt, e ) ;
-	    free_exp ( a, force1 ) ;
-	    free_offset ( off, force1 ) ;
-	    UNUSED ( cnt ) ;
-	    UNUSED ( n ) ;
-	    UNUSED ( v ) ;
-	    break ;
+	}
-    }
-    UNUSED ( t ) ;
+	UNUSED(t);
-    return ;
+	return;
+}
 /*
     FREE A FUNCTION DEFINITION
     This routine frees the definition of the function id, replacing it
     by a dummy definition.
 */
-void free_function
+void
-    PROTO_N ( ( id ) )
-    PROTO_T ( IDENTIFIER id )
+free_function(IDENTIFIER id)
+{
-    EXP e = DEREF_exp ( id_function_etc_defn ( id ) ) ;
+	EXP e = DEREF_exp(id_function_etc_defn(id));
-    if ( !IS_NULL_exp ( e ) ) {
+	if (!IS_NULL_exp(e)) {
-	TYPE t = DEREF_type ( id_function_etc_type ( id ) ) ;
+		TYPE t = DEREF_type(id_function_etc_type(id));
-	free_exp ( e, 0 ) ;
+		free_exp(e, 0);
-	MAKE_exp_value ( t, e ) ;
+		MAKE_exp_value(t, e);
-	COPY_exp ( id_function_etc_defn ( id ), e ) ;
+		COPY_exp(id_function_etc_defn(id), e);
-    }
+	}
-    return ;
+	return;
+}

Subversion Repositories tendra.SVN

(root)/branches/tendra5/src/producers/common/construct/destroy.c – Rev 5 → 6