/*
 * Copyright (c) 2003, The Tendra Project <http://www.ten15.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 unmodified, 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.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
 *
 *
 *  		 Crown Copyright (c) 1997, 1998
 *
 *  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.
 *
 * $TenDRA: tendra/src/producers/common/c_class.alg,v 1.18 2005/11/07 18:42:37 stefanf Exp $
 */

/*
 *    AUTOMATICALLY GENERATED FROM ALGEBRA c_class (VERSION 1.1)
 *    BY calculus (VERSION 1.3)
 */

#ifndef GRAPH_OPS_H_INCLUDED
#define	GRAPH_OPS_H_INCLUDED

/* Operations for union GRAPH */

#define	TAG_graph(P)				0u


/* Operations for component head of union GRAPH */

#define	graph_head(P)				(CHECK_NULL (P) + 0)


/* Operations for component access of union GRAPH */

#define	graph_access(P)				(CHECK_NULL (P) + 1)


/* Operations for component tails of union GRAPH */

#define	graph_tails(P)				(CHECK_NULL (P) + 2)


/* Operations for component top of union GRAPH */

#define	graph_top(P)				(CHECK_NULL (P) + 3)


/* Operations for component equal of union GRAPH */

#define	graph_equal(P)				(CHECK_NULL (P) + 4)


/* Operations for component up of union GRAPH */

#define	graph_up(P)				(CHECK_NULL (P) + 5)


/* Operations for component no of union GRAPH */

#define	graph_no(P)				(CHECK_NULL (P) + 6)


/* Operations for component off of union GRAPH */

#define	graph_off(P)				(CHECK_NULL (P) + 7)


/* Operations for component member of union GRAPH */

#define	graph_member(P)				(CHECK_NULL (P) + 8)


/* Operations for component tok1 of union GRAPH */

#define	graph_tok1(P)				(CHECK_NULL (P) + 9)


/* Operations for component tok2 of union GRAPH */

#define	graph_tok2(P)				(CHECK_NULL (P) + 10)


/* Operations for field basic of union GRAPH */

#define	graph_basic_tag				0u
#define	IS_graph_basic(P)				1


#define MAKE_graph_basic(head_, access_, c_class_graph)\
	{\
		c_class *x202_ = GEN_c_class ( 11, TYPEID_graph );\
		COPY_ctype (x202_ + 0, (head_));\
		COPY_dspec (x202_ + 1, (access_));\
		COPY_list (x202_ + 2, NULL_list ( GRAPH ));\
		COPY_graph (x202_ + 3, NULL_graph);\
		COPY_graph (x202_ + 4, NULL_graph);\
		COPY_graph (x202_ + 5, NULL_graph);\
		COPY_unsigned (x202_ + 6, 0);\
		COPY_off (x202_ + 7, NULL_off);\
		COPY_list (x202_ + 8, NULL_list ( IDENTIFIER ));\
		COPY_ulong (x202_ + 9, LINK_NONE);\
		COPY_ulong (x202_ + 10, LINK_NONE);\
		(c_class_graph) = x202_;\
	}

#define	DECONS_graph_basic(head_, access_, tails_, top_, equal_, up_, no_, off_, member_, tok1_, tok2_, c_class_graph)\
	{\
		c_class *x203_ = (c_class_graph);\
		(head_) = DEREF_ctype (x203_ + 0);\
		(access_) = DEREF_dspec (x203_ + 1);\
		(tails_) = DEREF_list (x203_ + 2);\
		(top_) = DEREF_graph (x203_ + 3);\
		(equal_) = DEREF_graph (x203_ + 4);\
		(up_) = DEREF_graph (x203_ + 5);\
		(no_) = DEREF_unsigned (x203_ + 6);\
		(off_) = DEREF_off (x203_ + 7);\
		(member_) = DEREF_list (x203_ + 8);\
		(tok1_) = DEREF_ulong (x203_ + 9);\
		(tok2_) = DEREF_ulong (x203_ + 10);\
	}

#define	DESTROY_graph_basic(destroyer_, head_, access_, tails_, top_, equal_, up_, no_, off_, member_, tok1_, tok2_, c_class_graph)\
	{\
		c_class *x204_ = (c_class_graph);\
		(head_) = DEREF_ctype (x204_ + 0);\
		(access_) = DEREF_dspec (x204_ + 1);\
		(tails_) = DEREF_list (x204_ + 2);\
		(top_) = DEREF_graph (x204_ + 3);\
		(equal_) = DEREF_graph (x204_ + 4);\
		(up_) = DEREF_graph (x204_ + 5);\
		(no_) = DEREF_unsigned (x204_ + 6);\
		(off_) = DEREF_off (x204_ + 7);\
		(member_) = DEREF_list (x204_ + 8);\
		(tok1_) = DEREF_ulong (x204_ + 9);\
		(tok2_) = DEREF_ulong (x204_ + 10);\
		(destroyer_) (x204_, 11u);\
	}


#endif