WebSVN – tendra.SVN – Diff – /branches/tendra5/src/producers/common/construct/overload.h

+/*
+ * 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.
 */
 #ifndef CONVERT_INCLUDED
 #include "convert.h"
 #endif
 typedef struct {
-    IDENTIFIER func ;
+	IDENTIFIER func;
-    IDENTIFIER base ;
+	IDENTIFIER base;
-    int kind ;
+	int kind;
-    unsigned rank ;
+	unsigned rank;
-    CONVERSION *convs ;
+	CONVERSION *convs;
-    EXP cond ;
+	EXP cond;
-} CANDIDATE ;
+} CANDIDATE;
 typedef struct {
-    CANDIDATE *elem ;
+	CANDIDATE *elem;
-    unsigned size ;
+	unsigned size;
-    unsigned max_size ;
+	unsigned max_size;
-    CONVERSION *convs ;
+	CONVERSION *convs;
-    unsigned nconvs ;
+	unsigned nconvs;
-} CANDIDATE_LIST ;
+} CANDIDATE_LIST;
 /*
     FUNCTION OVERLOADING DECLARATIONS
     The routines in this module are concerned with function overloading.
 */
-extern void swap_ptypes PROTO_S ( ( IDENTIFIER ) ) ;
+extern void swap_ptypes(IDENTIFIER);
-extern IDENTIFIER resolve_call PROTO_S ( ( IDENTIFIER, LIST ( EXP ), QUALIFIER, int ) ) ;
+extern IDENTIFIER resolve_call(IDENTIFIER, LIST(EXP), QUALIFIER, int);
-extern EXP resolve_cast PROTO_S ( ( TYPE, EXP, ERROR *, int, int, LIST ( IDENTIFIER ) ) ) ;
+extern EXP resolve_cast(TYPE, EXP, ERROR *, int, int, LIST(IDENTIFIER));
-extern void add_candidates PROTO_S ( ( CANDIDATE_LIST *, IDENTIFIER, int, int ) ) ;
+extern void add_candidates(CANDIDATE_LIST *, IDENTIFIER, int, int);
-extern IDENTIFIER koenig_candidates PROTO_S ( ( CANDIDATE_LIST *, IDENTIFIER, TYPE, int ) ) ;
+extern IDENTIFIER koenig_candidates(CANDIDATE_LIST *, IDENTIFIER, TYPE, int);
-extern void swap_candidates PROTO_S ( ( CANDIDATE_LIST *, unsigned ) ) ;
+extern void swap_candidates(CANDIDATE_LIST *, unsigned);
-extern ERROR list_candidates PROTO_S ( ( ERROR, CANDIDATE_LIST *, unsigned ) ) ;
+extern ERROR list_candidates(ERROR, CANDIDATE_LIST *, unsigned);
-extern CANDIDATE *resolve_overload PROTO_S ( ( CANDIDATE_LIST *, LIST ( EXP ), TYPE, int ) ) ;
+extern CANDIDATE *resolve_overload(CANDIDATE_LIST *, LIST(EXP), TYPE, int);
-extern CANDIDATE *resolve_ambiguous PROTO_S ( ( CANDIDATE_LIST *, LIST ( EXP ), TYPE, int ) ) ;
+extern CANDIDATE *resolve_ambiguous(CANDIDATE_LIST *, LIST(EXP), TYPE, int);
-extern IDENTIFIER make_ambig_func PROTO_S ( ( CANDIDATE_LIST *, IDENTIFIER, LIST ( EXP ), QUALIFIER, ERROR * ) ) ;
+extern IDENTIFIER make_ambig_func(CANDIDATE_LIST *, IDENTIFIER, LIST(EXP),
+				  QUALIFIER, ERROR *);
-extern IDENTIFIER resolve_func PROTO_S ( ( IDENTIFIER, TYPE, int, int, LIST ( IDENTIFIER ), int * ) ) ;
+extern IDENTIFIER resolve_func(IDENTIFIER, TYPE, int, int, LIST(IDENTIFIER),
+			       int *);
-extern void free_candidates PROTO_S ( ( CANDIDATE_LIST * ) ) ;
+extern void free_candidates(CANDIDATE_LIST *);
-extern CANDIDATE_LIST candidates ;
+extern CANDIDATE_LIST candidates;
-extern unsigned match_no_viable ;
+extern unsigned match_no_viable;
-extern unsigned match_no_args ;
+extern unsigned match_no_args;
-extern int resolved_kind ;
+extern int resolved_kind;
-extern int match_this ;
+extern int match_this;
 /*
     RANKING OF CANDIDATES
     with the right number of parameters (the plausible candidates), the
     viable candidates, and the best viable candidate.  They are is ascending
     order.
 */
-#define RANK_IGNORE		( ( unsigned ) 0 )
+#define RANK_IGNORE		((unsigned)0)
-#define RANK_NONE		( ( unsigned ) 1 )
+#define RANK_NONE		((unsigned)1)
-#define RANK_ARGS		( ( unsigned ) 2 )
+#define RANK_ARGS		((unsigned)2)
-#define RANK_VIABLE		( ( unsigned ) 3 )
+#define RANK_VIABLE		((unsigned)3)
-#define RANK_TARGET		( ( unsigned ) 4 )
+#define RANK_TARGET		((unsigned)4)
-#define RANK_BEST		( ( unsigned ) 5 )
+#define RANK_BEST		((unsigned)5)
 /*
     CANDIDATE KINDS

Subversion Repositories tendra.SVN

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