WebSVN – tendra.SVN – Diff – /trunk/src/producers/common/parse/pragma.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 "symbols.h"
 #include "tok.h"
 #include "token.h"
 #include "ustring.h"
 #include "variable.h"
 /*
     CHECK THAT PRAGMA SYNTAX AND MAIN SYNTAX ARE IN STEP
     By including both psyntax.h and syntax.h, the compiler will check
     that the lex_* macros defined in each are consistent.  Note that
     because the #pragma syntax is the same for both C and C++, this
     also checks the consistency of the C and C++ syntaxes.  This is only
     done in development mode.
 */
 #ifdef DEBUG
 #include "syntax.h"
 #endif
 /*
     READ A PREPROCESSING TOKEN
     This routine reads the next preprocessing token from the input file.
 */
-static PPTOKEN *get_token
+static PPTOKEN *
-    PROTO_Z ()
+get_token(void)
 {
-    PPTOKEN *p = new_pptok () ;
+	PPTOKEN *p = new_pptok();
-    int t = read_token () ;
+	int t = read_token();
-    update_column () ;
+	update_column();
-    p->tok = t ;
+	p->tok = t;
-    p->pp_space = WHITE_SPACE ;
+	p->pp_space = WHITE_SPACE;
-    p->next = NULL ;
+	p->next = NULL;
-    if ( t <= LAST_COMPLEX_TOKEN ) token_parts ( t, p ) ;
+	if (t <= LAST_COMPLEX_TOKEN) {
+		token_parts(t, p);
+	}
-    return ( p ) ;
+	return(p);
 }
 /*
     FIND A KEYWORD LEXICAL TOKEN NUMBER
     This routine finds the lexical token corresponding to the identifier id.
     If id does not represent an underlying keyword then an error is reported
     and lex_identifier is returned.
 */
-int find_keyword
-    PROTO_N ( ( id ) )
-    PROTO_T ( IDENTIFIER id )
-{
-    HASHID nm = DEREF_hashid ( id_name ( id ) ) ;
-    int t = find_hashid ( nm ) ;
-    if ( t == lex_identifier ) {
-	report ( preproc_loc, ERR_pragma_keyword_bad ( nm ) ) ;
-    }
-    return ( t ) ;
-}
-/*
-    DEFINE A KEYWORD
-    This routine defines id to be a keyword with lexical token number t.
-    Certain language extensions are implemented by tokens disguised as
-    keywords.
-*/
+int
-void define_keyword
-    PROTO_N ( ( id, t ) )
-    PROTO_T ( IDENTIFIER id X int t )
+find_keyword(IDENTIFIER id)
+{
+	HASHID nm = DEREF_hashid(id_name(id));
-    switch ( t ) {
+	int t = find_hashid(nm);
-	case lex_identifier : {
+	if (t == lex_identifier) {
-	    break ;
+		report(preproc_loc, ERR_pragma_keyword_bad(nm));
+	}
-	case lex_representation : {
-	    TOKEN tok = make_sort ( "ZZZ", 1 ) ;
-	    id = make_token_decl ( tok, 0, id, id ) ;
-	    token_interface ( id, lex_no_Hdef ) ;
-	    COPY_int ( tok_proc_key ( tok ), t ) ;
-	    break ;
-	}
-	case lex_typeof : {
-	    TOKEN tok = make_sort ( "SE", 1 ) ;
-	    id = make_token_decl ( tok, 0, id, id ) ;
-	    token_interface ( id, lex_no_Hdef ) ;
-	    COPY_int ( tok_proc_key ( tok ), t ) ;
-	    break ;
-	}
-	default : {
-	    HASHID nm = DEREF_hashid ( id_name ( id ) ) ;
-	    IGNORE make_keyword ( nm, t, NULL_id ) ;
-	    break ;
-	}
-    }
-    return ;
+	return(t);
+}
+/*
+    DEFINE A KEYWORD
+    This routine defines id to be a keyword with lexical token number t.
+    Certain language extensions are implemented by tokens disguised as
+    keywords.
+*/
+void
+define_keyword(IDENTIFIER id, int t)
+{
+	switch (t) {
+	case lex_identifier: {
+		break;
+	}
+	case lex_representation: {
+		TOKEN tok = make_sort("ZZZ", 1);
+		id = make_token_decl(tok, 0, id, id);
+		token_interface(id, lex_no_Hdef);
+		COPY_int(tok_proc_key(tok), t);
+		break;
+	}
+	case lex_typeof: {
+		TOKEN tok = make_sort("SE", 1);
+		id = make_token_decl(tok, 0, id, id);
+		token_interface(id, lex_no_Hdef);
+		COPY_int(tok_proc_key(tok), t);
+		break;
+	}
+	default: {
+		HASHID nm = DEREF_hashid(id_name(id));
+		IGNORE make_keyword(nm, t, NULL_id);
+		break;
+	}
+	}
+	return;
+}
 /*
     UNDEFINE A KEYWORD
     This routine undefines the keyword id.
 */
-void undef_keyword
+void
-    PROTO_N ( ( id ) )
-    PROTO_T ( IDENTIFIER id )
+undef_keyword(IDENTIFIER id)
+{
-    unsigned tag ;
+	unsigned tag;
-    HASHID nm = DEREF_hashid ( id_name ( id ) ) ;
+	HASHID nm = DEREF_hashid(id_name(id));
-    PTR ( IDENTIFIER ) ptr = hashid_id ( nm ) ;
+	PTR(IDENTIFIER)ptr = hashid_id(nm);
-    do {
+	do {
-	IDENTIFIER pid = DEREF_id ( ptr ) ;
+		IDENTIFIER pid = DEREF_id(ptr);
-	tag = TAG_id ( pid ) ;
+		tag = TAG_id(pid);
-	switch ( tag ) {
+		switch (tag) {
-	    case id_keyword_tag :
+		case id_keyword_tag:
-	    case id_iso_keyword_tag :
+		case id_iso_keyword_tag:
-	    case id_reserved_tag : {
+		case id_reserved_tag:
-		/* Undefine a keyword */
+			/* Undefine a keyword */
+			if (do_keyword) {
-		if ( do_keyword ) dump_undefine ( pid, &preproc_loc, 1 ) ;
+				dump_undefine(pid, &preproc_loc, 1);
+			}
-		pid = DEREF_id ( id_alias ( pid ) ) ;
+			pid = DEREF_id(id_alias(pid));
-		COPY_id ( ptr, pid ) ;
+			COPY_id(ptr, pid);
-		COPY_id ( hashid_cache ( nm ), NULL_id ) ;
+			COPY_id(hashid_cache(nm), NULL_id);
-		return ;
+			return;
-	    }
-	}
+		}
-	ptr = id_alias ( pid ) ;
+		ptr = id_alias(pid);
-    } while ( tag != id_dummy_tag ) ;
+	} while (tag != id_dummy_tag);
-    return ;
+	return;
+}
 /*
     RESCAN A PRAGMA STATEMENT
     The routine read_tendra replaces all identifier tokens within a '#pragma'
     command by their corresponding underlying keywords.  This routine restores
     these keywords, except that given by s, to identifiers.
 */
-void rescan_pragma
+void
-    PROTO_N ( ( s ) )
-    PROTO_T ( int s )
+rescan_pragma(int s)
+{
-    PPTOKEN *p ;
+	PPTOKEN *p;
-    for ( p = crt_token ; p != NULL ; p = p->next ) {
+	for (p = crt_token; p != NULL; p = p->next) {
-	int t = p->tok ;
+		int t = p->tok;
-	if ( t >= FIRST_KEYWORD && t <= LAST_KEYWORD && t != s ) {
+		if (t >= FIRST_KEYWORD && t <= LAST_KEYWORD && t != s) {
-	    p->tok = lex_identifier ;
+			p->tok = lex_identifier;
+		}
+	}
-    }
-    return ;
+	return;
+}
 /*
     SET A TOKEN TO A KEYWORD
     This routine sets the preprocessing token p to the keyword corresponding
     to the lexical token number t.
 */
-static void set_token
+static void
-    PROTO_N ( ( p, t ) )
-    PROTO_T ( PPTOKEN *p X int t )
+set_token(PPTOKEN *p, int t)
+{
-    HASHID nm = KEYWORD ( t ) ;
+	HASHID nm = KEYWORD(t);
-    p->tok = t ;
+	p->tok = t;
-    p->pp_data.id.hash = nm ;
+	p->pp_data.id.hash = nm;
-    p->pp_data.id.use = DEREF_id ( hashid_id ( nm ) ) ;
+	p->pp_data.id.use = DEREF_id(hashid_id(nm));
-    return ;
+	return;
+}
 /*
     PATCH A PRAGMA STATEMENT
     This routine is used by the preprocessor to preserve a '#pragma'
     statement.  The arguments are as in parse_pragma.
 */
-static void patch_pragma
+static void
-    PROTO_N ( ( p, tendra ) )
-    PROTO_T ( PPTOKEN *p X int tendra )
+patch_pragma(PPTOKEN *p, int tendra)
 {
-    p = clean_tok_list ( p ) ;
+	p = clean_tok_list(p);
-    switch ( p->tok ) {
+	switch (p->tok) {
-	case lex_interface : {
+	case lex_interface: {
-	    int t = crt_interface ;
+		int t = crt_interface;
-	    if ( t == lex_ignore && tendra ) t = lex_reject ;
+		if (t == lex_ignore && tendra) {
+			t = lex_reject;
+		}
-	    set_token ( p, t ) ;
+		set_token(p, t);
-	    break ;
+		break;
 	}
-	case lex_member : {
+	case lex_member:
-	    if ( !tendra ) {
+		if (!tendra) {
-		if ( p->next->tok == lex_definition ) {
+			if (p->next->tok == lex_definition) {
-		    set_token ( p, lex_define_Hcap ) ;
+				set_token(p, lex_define_Hcap);
-		    set_token ( p->next, lex_member_Hcap ) ;
+				set_token(p->next, lex_member_Hcap);
-		}
+			}
-	    }
+		}
-	    break ;
+		break;
-	}
-	case lex_promoted : {
+	case lex_promoted:
-	    if ( !tendra ) set_token ( p, lex_promote ) ;
+		if (!tendra) {
-	    break ;
+			set_token(p, lex_promote);
-	}
+		}
+		break;
-	case lex_reject : {
+	case lex_reject:
+		if (!tendra) {
-	    if ( !tendra ) set_token ( p, lex_ignore ) ;
+			set_token(p, lex_ignore);
+		}
-	    break ;
+		break;
 	}
-    }
-    patch_preproc_dir ( p ) ;
+	patch_preproc_dir(p);
-    if ( tendra ) {
+	if (tendra) {
-	p = patch_tokens ( tendra ) ;
+		p = patch_tokens(tendra);
-	set_token ( p, lex_tendra ) ;
+		set_token(p, lex_tendra);
-	if ( tendra == 2 ) p->next->tok = lex_plus_Hplus ;
+		if (tendra == 2)p->next->tok = lex_plus_Hplus;
-    }
+	}
-    return ;
+	return;
 }
 /*
     PARSE A PRAGMA STATEMENT
     This routine parses the '#pragma' statement given by the preprocessing
     tokens p.  tendra is 1 for '#pragma TenDRA' statements, 2 for '#pragma
     TenDRA++' statements, and 0 otherwise.
 */
-static int parse_pragma
+static int
-    PROTO_N ( ( p, tendra ) )
-    PROTO_T ( PPTOKEN *p X int tendra )
+parse_pragma(PPTOKEN *p, int tendra)
 {
-    int nt ;
+	int nt;
-    PPTOKEN *pt ;
+	PPTOKEN *pt;
-    PARSE_STATE s ;
+	PARSE_STATE s;
-    int pp = preproc_only ;
+	int pp = preproc_only;
-    int tok = lex_ignore_token ;
+	int tok = lex_ignore_token;
-    /* Parsing action */
+	/* Parsing action */
-    new_linkage = crt_linkage ;
+	new_linkage = crt_linkage;
-    save_state ( &s, 0 ) ;
+	save_state(&s, 0);
-    init_parser ( p ) ;
+	init_parser(p);
-    crt_loc = preproc_loc ;
+	crt_loc = preproc_loc;
-    crt_line_changed = 1 ;
+	crt_line_changed = 1;
-    ADVANCE_LEXER ;
+	ADVANCE_LEXER;
-    if ( pp ) {
+	if (pp) {
-	parse_preproc ( &tok ) ;
+		parse_preproc(&tok);
-	if ( tok != lex_ignore_token ) {
+		if (tok != lex_ignore_token) {
-	    tok = lex_ignore_token ;
+			tok = lex_ignore_token;
-	    have_syntax_error = 1 ;
+			have_syntax_error = 1;
-	}
+		}
-    } else {
+	} else {
-	parse_tendra ( &tok ) ;
+		parse_tendra(&tok);
-    }
+	}
-    nt = crt_lex_token ;
+	nt = crt_lex_token;
-    pt = crt_token ;
+	pt = crt_token;
-    p = restore_parser () ;
+	p = restore_parser();
-    /* Check for end of input */
+	/* Check for end of input */
-    switch ( tok ) {
+	switch (tok) {
-	case lex_set :
+	case lex_set:
-	case lex_unused : {
+	case lex_unused: {
-	    /* Patch inset pragma statements */
+		/* Patch inset pragma statements */
-	    PPTOKEN *q = clean_tok_list ( p ) ;
+		PPTOKEN *q = clean_tok_list(p);
-	    PPTOKEN *r = new_pptok () ;
+		PPTOKEN *r = new_pptok();
-	    p = q ;
+		p = q;
-	    p->tok = tok ;
+		p->tok = tok;
-	    while ( q->tok != lex_newline ) q = q->next ;
+		while (q->tok != lex_newline) {
+			q = q->next;
+		}
-	    q->tok = lex_inset_Hend ;
+		q->tok = lex_inset_Hend;
-	    r->tok = lex_newline ;
+		r->tok = lex_newline;
-	    r->next = q->next ;
+		r->next = q->next;
-	    q->next = r ;
+		q->next = r;
-	    patch_preproc_dir ( p ) ;
+		patch_preproc_dir(p);
-	    tok = lex_inset_Hstart ;
+		tok = lex_inset_Hstart;
-	    p = NULL ;
+		p = NULL;
-	    break ;
+		break;
 	}
-	default : {
+	default:
-	    /* Should have reached the end of the line */
+		/* Should have reached the end of the line */
-	    if ( nt != lex_newline && !have_syntax_error ) {
+		if (nt != lex_newline && !have_syntax_error) {
-		ERROR err = ERR_lex_parse ( pt ) ;
+			ERROR err = ERR_lex_parse(pt);
-		err = concat_error ( err, ERR_cpp_end ( lex_pragma ) ) ;
+			err = concat_error(err, ERR_cpp_end(lex_pragma));
-		report ( preproc_loc, err ) ;
+			report(preproc_loc, err);
-	    }
+		}
-	    break ;
+		break;
 	}
-    }
-    /* Preprocessing action */
+	/* Preprocessing action */
-    if ( pp ) {
+	if (pp) {
-	patch_pragma ( p, tendra ) ;
+		patch_pragma(p, tendra);
-	tok = lex_hash_Hpragma ;
+		tok = lex_hash_Hpragma;
-    } else {
+	} else {
-	free_tok_list ( p ) ;
+		free_tok_list(p);
-    }
+	}
-    restore_state ( &s ) ;
+	restore_state(&s);
-    crt_linkage = new_linkage ;
+	crt_linkage = new_linkage;
-    return ( tok ) ;
+	return(tok);
+}
 /*
     SKIP TO NEXT COLON
     This routine scans along the list of preprocessing tokens p until it
     finds the first colon.  It then returns the following token.  The null
     token is returned if there is no colon in p.
 */
-static PPTOKEN *skip_to_colon
+static PPTOKEN *
-    PROTO_N ( ( p ) )
-    PROTO_T ( PPTOKEN *p )
+skip_to_colon(PPTOKEN *p)
+{
-    while ( p ) {
+	while (p) {
-	PPTOKEN *q = p->next ;
+		PPTOKEN *q = p->next;
-	if ( p->tok == lex_colon ) return ( q ) ;
+		if (p->tok == lex_colon) {
+			return(q);
+		}
-	p = q ;
+		p = q;
-    }
+	}
-    return ( NULL ) ;
+	return(NULL);
+}
 /*
     MARK A TOKEN PARAMETER
     tokens p.  This consists of an optional 'TAG' followed by an identifier,
     which is optional if n is false.  Macro expansion of this identifier
     is inhibited.  Macro is true if the identifier is declared in the
     token namespace.
 */
-static PPTOKEN *mark_tdf_param
+static PPTOKEN *
-    PROTO_N ( ( p, n, macro ) )
-    PROTO_T ( PPTOKEN *p X int n X int macro )
+mark_tdf_param(PPTOKEN *p, int n, int macro)
-{
-    if ( p && p->tok == lex_identifier ) {
-	int t = find_hashid ( p->pp_data.id.hash ) ;
-	if ( t == lex_tag_Hcap ) {
-	    if ( p->next && p->next->tok == lex_identifier ) {
-		/* Have 'TAG id' */
-		p->tok = t ;
-		p = p->next ;
-		p->pp_data.id.use = NULL_id ;
-	    } else {
-		/* Have 'TAG' */
-		if ( n == 0 ) {
-		    /* Interpret as 'TAG' */
-		    p->tok = t ;
-		} else {
-		    /* Interpret as 'id' where id = TAG */
-		    p->pp_data.id.use = NULL_id ;
-		}
-	    }
-	} else {
-	    /* Have 'id' */
-	    if ( macro && preproc_only ) {
-		/* Mark macro names when preprocessing */
-		HASHID nm = p->pp_data.id.hash ;
-		unsigned c = check_macro ( nm, 0 ) ;
-		IDENTIFIER id = underlying_id ( p->pp_data.id.use ) ;
-		DECL_SPEC ds = DEREF_dspec ( id_storage ( id ) ) ;
-		ds |= dspec_token ;
-		COPY_dspec ( id_storage ( id ), ds ) ;
-		if ( c == PP_TRUE ) {
-		    /* Token previously defined as macro */
-		    PPTOKEN *q ;
-		    token_macro = DEREF_id ( hashid_id ( nm ) ) ;
-		    IGNORE patch_cond ( lex_hash_Hop, lex_define ) ;
-		    q = patch_tokens ( 2 ) ;
-		    q->tok = lex_builtin_Hfile ;
-		    q->next->tok = lex_hash_Hop ;
-		}
-	    }
-	    p->pp_data.id.use = NULL_id ;
-	}
-	return ( p->next ) ;
-    }
-    if ( n ) return ( NULL ) ;
-    return ( p ) ;
-}
-/*
-    MARK A TOKEN PROGRAM PARAMETER
-    This routine marks the TDF token program parameter given by the
-    preprocessing tokens p.
-*/
-static PPTOKEN *mark_prog_param
-    PROTO_N ( ( p ) )
-    PROTO_T ( PPTOKEN *p )
+{
-    if ( p && p->tok == lex_identifier ) {
+	if (p && p->tok == lex_identifier) {
-	int t = find_hashid ( p->pp_data.id.hash ) ;
+		int t = find_hashid(p->pp_data.id.hash);
-	switch ( t ) {
-	    case lex_exp_Hcap :
-	    case lex_nat_Hcap :
+		if (t == lex_tag_Hcap) {
-	    case lex_int_Hcap :
+			if (p->next && p->next->tok == lex_identifier) {
-	    case lex_stmt_Hcap :
-	    case lex_proc_Hcap : {
-		/* Have the form 'EXP id' etc */
+				/* Have 'TAG id' */
-		p->tok = t ;
+				p->tok = t;
-		p = p->next ;
+				p = p->next;
-		if ( p ) p = p->next ;
+				p->pp_data.id.use = NULL_id;
-		return ( p ) ;
-	    }
+			} else {
-	    case lex_type_Hcap : {
-		/* Have the form 'TYPE t' */
+				/* Have 'TAG' */
-		int depth = 0 ;
-		p->tok = t ;
-		while ( p ) {
+				if (n == 0) {
-		    /* Step over type */
+					/* Interpret as 'TAG' */
-		    switch ( p->tok ) {
+					p->tok = t;
-			case lex_open_Hround :
+				} else {
-			case lex_open_Hsquare_H1 :
+					/* Interpret as 'id' where id = TAG */
-			case lex_open_Hsquare_H2 : {
+					p->pp_data.id.use = NULL_id;
-			    depth++ ;
-			    break ;
-			}
+				}
-			case lex_close_Hround :
-			case lex_close_Hsquare_H1 :
-			case lex_close_Hsquare_H2 : {
-			    if ( depth > 0 ) depth-- ;
-			    break ;
+			}
+		} else {
-			case lex_comma : {
+			/* Have 'id' */
-			    if ( depth == 0 ) return ( p ) ;
+			if (macro && preproc_only) {
+				/* Mark macro names when preprocessing */
+				HASHID nm = p->pp_data.id.hash;
+				unsigned c = check_macro(nm, 0);
+				IDENTIFIER id =
+				    underlying_id(p->pp_data.id.use);
+				DECL_SPEC ds = DEREF_dspec(id_storage(id));
+				ds |= dspec_token;
+				COPY_dspec(id_storage(id), ds);
+				if (c == PP_TRUE) {
+					/* Token previously defined as macro */
-			    break ;
+					PPTOKEN *q;
+					token_macro = DEREF_id(hashid_id(nm));
+					IGNORE patch_cond(lex_hash_Hop,
+							  lex_define);
+					q = patch_tokens(2);
+					q->tok = lex_builtin_Hfile;
+					q->next->tok = lex_hash_Hop;
+				}
+			}
+			p->pp_data.id.use = NULL_id;
+		}
+		return(p->next);
+	}
+	if (n) {
+		return(NULL);
+	}
+	return(p);
+}
+/*
+    MARK A TOKEN PROGRAM PARAMETER
+    This routine marks the TDF token program parameter given by the
+    preprocessing tokens p.
+*/
+static PPTOKEN *
+mark_prog_param(PPTOKEN *p)
+{
+	if (p && p->tok == lex_identifier) {
+		int t = find_hashid(p->pp_data.id.hash);
+		switch (t) {
+		case lex_exp_Hcap:
+		case lex_nat_Hcap:
+		case lex_int_Hcap:
+		case lex_stmt_Hcap:
+		case lex_proc_Hcap:
+			/* Have the form 'EXP id' etc */
+			p->tok = t;
+			p = p->next;
+			if (p) {
+				p = p->next;
+			}
+			return(p);
+		case lex_type_Hcap: {
+			/* Have the form 'TYPE t' */
+			int depth = 0;
+			p->tok = t;
+			while (p) {
+				/* Step over type */
+				switch (p->tok) {
+				case lex_open_Hround:
+				case lex_open_Hsquare_H1:
+				case lex_open_Hsquare_H2:
+					depth++;
+					break;
+				case lex_close_Hround:
-			case lex_close_Hbrace_H1 :
+				case lex_close_Hsquare_H1:
-			case lex_close_Hbrace_H2 : {
+				case lex_close_Hsquare_H2:
+					if (depth > 0) {
+						depth--;
+					}
+					break;
+				case lex_comma:
+					if (depth == 0) {
-			    return ( p ) ;
+						return(p);
-			}
+					}
+					break;
+				case lex_close_Hbrace_H1:
+				case lex_close_Hbrace_H2:
+					return(p);
-		    }
+				}
-		    p = p->next ;
+				p = p->next;
-		}
+			}
-		break ;
+			break;
-	    }
+		}
-	    case lex_member_Hcap : {
+		case lex_member_Hcap:
-		/* Have the form 'MEMBER t : id' */
+			/* Have the form 'MEMBER t : id' */
-		p->tok = t ;
+			p->tok = t;
-		p = skip_to_colon ( p->next ) ;
+			p = skip_to_colon(p->next);
+			if (p) {
-		if ( p ) p = p->next ;
+				p = p->next;
+			}
-		return ( p ) ;
+			return(p);
-	    }
+		}
 	}
-    }
-    return ( NULL ) ;
+	return(NULL);
 }
 /*
     MARK A PRAGMA TOKEN STATEMENT
     The macro expansion of '#pragma token' statements is rather complex.
     The token syntax skeleton is not subject to macro expansion, while
     the skeleton keywords in the list of preprocessing tokens p, returning
     the token immediately following the token specification.  It also sets
     macro to true if the declared token lies in the macro namespace.
 */
-static PPTOKEN *mark_tdf_token
+static PPTOKEN *
-    PROTO_N ( ( p, macro ) )
-    PROTO_T ( PPTOKEN *p X int *macro )
+mark_tdf_token(PPTOKEN *p, int *macro)
+{
+			}
-			p = mark_tdf_token ( p, macro ) ;
+			p = mark_tdf_token(p, macro);
-			p = mark_tdf_param ( p, 0, 0 ) ;
-			if ( p == NULL ) break ;
-			if ( p->tok == lex_comma ) p = p->next ;
-		    }
-		}
-		p = mark_tdf_token ( p, macro ) ;
-		return ( p ) ;
+			return(p);
-	    }
-	    case lex_variety_Hcap : {
+		case lex_variety_Hcap:
-		/* Integral type token specifiers */
+			/* Integral type token specifiers */
-		p->tok = t ;
+			p->tok = t;
-		p = p->next ;
+			p = p->next;
-		if ( p->tok == lex_identifier ) {
+			if (p->tok == lex_identifier) {
-		    /* Check for signed or unsigned qualifier */
+				/* Check for signed or unsigned qualifier */
-		    t = find_hashid ( p->pp_data.id.hash ) ;
+				t = find_hashid(p->pp_data.id.hash);
-		    if ( t == lex_signed || t == lex_unsigned ) {
+				if (t == lex_signed || t == lex_unsigned) {
-			p->tok = t ;
+					p->tok = t;
-			p = p->next ;
+					p = p->next;
-		    }
+				}
+			}
+			return(p);
+		case lex_nat_Hcap:
+		case lex_int_Hcap:
+		case lex_stmt_Hcap:
+			/* Simple token specifiers */
+			*macro = 1;
+			p->tok = t;
+			return(p->next);
+		case lex_arith_Hcap:
+		case lex_class_Hcap:
+		case lex_float_Hcap:
+		case lex_scalar_Hcap:
+		case lex_struct_Hcap:
+		case lex_type_Hcap:
+		case lex_union_Hcap:
+			/* Type token specifiers */
+			p->tok = t;
+			return(p->next);
+		}
-		return ( p ) ;
-	    }
-	    case lex_nat_Hcap :
-	    case lex_int_Hcap :
-	    case lex_stmt_Hcap : {
-		/* Simple token specifiers */
-		*macro = 1 ;
-		p->tok = t ;
-		return ( p->next ) ;
-	    }
-	    case lex_arith_Hcap :
-	    case lex_class_Hcap :
-	    case lex_float_Hcap :
-	    case lex_scalar_Hcap :
-	    case lex_struct_Hcap :
-	    case lex_type_Hcap :
-	    case lex_union_Hcap : {
-		/* Type token specifiers */
-		p->tok = t ;
-		return ( p->next ) ;
-	    }
+	}
-    }
-    return ( p->next ) ;
+	return(p->next);
+}
 /*
     READ AN EXTERNAL TOKEN NAME
     This routine processes an external token name.  This consists of a
     hash symbol, pointed to by p, followed a list of preprocessing
     tokens.  Note that the result is an extended identifier, unless it
     is a simple identifier.
 */
-static PPTOKEN *quote_token_name
+static PPTOKEN *
-    PROTO_N ( ( p ) )
-    PROTO_T ( PPTOKEN *p )
+quote_token_name(PPTOKEN *p)
 {
-    PPTOKEN *q = p->next ;
+	PPTOKEN *q = p->next;
-    if ( q != NULL ) {
+	if (q != NULL) {
-	/* All following tokens are quoted */
+		/* All following tokens are quoted */
-	string s ;
+		string s;
-	unsigned long sp = q->pp_space ;
+		unsigned long sp = q->pp_space;
-	IGNORE quote_tok_list ( q, 0, char_quote ) ;
+		IGNORE quote_tok_list(q, 0, char_quote);
-	free_tok_list ( q ) ;
+		free_tok_list(q);
-	q = new_pptok () ;
+		q = new_pptok();
-	q->pp_space = sp ;
+		q->pp_space = sp;
-	q->next = NULL ;
+		q->next = NULL;
-	s = token_buff.start ;
+		s = token_buff.start;
-	if ( ustrseq ( s, "-" ) ) {
+		if (ustrseq(s, "-")) {
-	    /* Special form '-' */
+			/* Special form '-' */
-	    q->tok = lex_minus ;
+			q->tok = lex_minus;
-	} else {
+		} else {
-	    /* Create an identifier */
+			/* Create an identifier */
-	    unsigned long h = hash ( s ) ;
+			unsigned long h = hash(s);
-	    token_hashid = lookup_name ( s, h, 1, lex_unknown ) ;
+			token_hashid = lookup_name(s, h, 1, lex_unknown);
-	    q->tok = lex_identifier ;
+			q->tok = lex_identifier;
-	    token_parts ( lex_identifier, q ) ;
+			token_parts(lex_identifier, q);
-	}
+		}
-	p->next = q ;
+		p->next = q;
-	p = q ;
+		p = q;
-    }
+	}
-    return ( p ) ;
+	return(p);
 }
 /*
     READ A PRAGMA TOKEN STATEMENT
     This routine processes a '#pragma token' statement.  p gives the first
     preprocessing token (i.e. 'token').  tendra is as in parse_pragma.
 */
-static int read_tdf_token
+static int
-    PROTO_N ( ( p, tendra ) )
-    PROTO_T ( PPTOKEN *p X int tendra )
+read_tdf_token(PPTOKEN *p, int tendra)
 {
-    /* Read and macro expand the rest of the line */
+	/* Read and macro expand the rest of the line */
-    int t ;
+	int t;
-    PPTOKEN *q = p ;
+	PPTOKEN *q = p;
-    while ( q->next ) q = q->next ;
+	while (q->next)q = q->next;
-    if ( q->tok != lex_newline ) {
+	if (q->tok != lex_newline) {
-	int macro = 0 ;
+		int macro = 0;
-	PPTOKEN *r = read_line ( lex_ignore_token, lex_ignore_token ) ;
+		PPTOKEN *r = read_line(lex_ignore_token, lex_ignore_token);
+		if (r) {
-	if ( r ) r->pp_space = WHITE_SPACE ;
+			r->pp_space = WHITE_SPACE;
+		}
-	q->next = r ;
+		q->next = r;
-	r = mark_tdf_token ( r, &macro ) ;
+		r = mark_tdf_token(r, &macro);
-	r = mark_tdf_param ( r, 1, macro ) ;
+		r = mark_tdf_param(r, 1, macro);
-	while ( r ) {
+		while (r) {
-	    /* Find token name */
+			/* Find token name */
-	    t = r->tok ;
+			t = r->tok;
-	    if ( t == lex_hash_H1 || t == lex_hash_H2 ) {
+			if (t == lex_hash_H1 || t == lex_hash_H2) {
-		q = quote_token_name ( r ) ;
+				q = quote_token_name(r);
-		break ;
+				break;
-	    }
+			}
-	    q = r ;
+			q = r;
-	    r = r->next ;
+			r = r->next;
-	}
+		}
-	/* Add newline token */
+		/* Add newline token */
-	while ( q->next ) q = q->next ;
+		while (q->next) {
+			q = q->next;
+		}
-	q->next = new_pptok () ;
+		q->next = new_pptok();
-	q->next->tok = lex_newline ;
+		q->next->tok = lex_newline;
-	q->next->next = NULL ;
+		q->next->next = NULL;
-    }
+	}
-    q = expand_tok_list ( p ) ;
+	q = expand_tok_list(p);
-    free_tok_list ( p ) ;
+	free_tok_list(p);
-    /* Parse the line */
+	/* Parse the line */
-    in_token_decl = 1 ;
+	in_token_decl = 1;
-    decl_loc = preproc_loc ;
+	decl_loc = preproc_loc;
-    t = parse_pragma ( q, tendra ) ;
+	t = parse_pragma(q, tendra);
-    in_token_decl = 0 ;
+	in_token_decl = 0;
-    return ( t ) ;
+	return(t);
 }
 /*
     READ A PRAGMA TENDRA STATEMENT
     This routine processes a '#pragma TenDRA' statement, returning the
     corresponding lexical token.  One or two tokens from the line will
     have already been read into p.  tendra is as in parse_pragma.
 */
-static int read_tendra
+static int
-    PROTO_N ( ( p, tendra ) )
-    PROTO_T ( PPTOKEN *p X int tendra )
-{
-    /* Read and macro expand the rest of the line */
-    PPTOKEN *q = p ;
-    while ( q->next ) q = q->next ;
-    if ( q->tok != lex_newline ) {
-	PPTOKEN *r = read_line ( lex_ignore_token, lex_newline ) ;
-	if ( r ) r->pp_space = WHITE_SPACE ;
-	q->next = r ;
-    }
-    q = expand_tok_list ( p ) ;
-    free_tok_list ( p ) ;
-    p = q ;
-    /* Replace any identifiers by keywords */
-    for ( q = p ; q != NULL ; q = q->next ) {
-	int t = q->tok ;
-	if ( t == lex_identifier ) {
-	    t = find_hashid ( q->pp_data.id.hash ) ;
-	    q->tok = t ;
-	}
-    }
-    /* Parse the line */
-    return ( parse_pragma ( p, tendra ) ) ;
-}
-/*
-    READ A PRAGMA INTERFACE STATEMENT
-    This routine processes a '#pragma interface' statement, returning the
-    corresponding lexical token.  One or two tokens from the line will
-    have already been read into p.  tendra is as in parse_pragma.
-*/
-static int read_interface
-    PROTO_N ( ( p, tendra ) )
-    PROTO_T ( PPTOKEN *p X int tendra )
+read_tendra(PPTOKEN *p, int tendra)
+{
-    /* Read and macro expand the rest of the line */
+	/* Read and macro expand the rest of the line */
-    int tok ;
-    int nl = 0 ;
-    PPTOKEN *q = p ;
+	PPTOKEN *q = p;
-    PPTOKEN *r = p ;
-    while ( q->next ) q = q->next ;
-    if ( q->tok != lex_newline ) {
-	PPTOKEN *s = read_line ( lex_ignore_token, lex_ignore_token ) ;
-	if ( s ) s->pp_space = WHITE_SPACE ;
-	q->next = s ;
+	while (q->next) {
-	nl = 1 ;
-    }
-    for ( q = p ; q != NULL ; q = q->next ) {
-	/* Suppress expansion of 'TAG' */
-	int t = q->tok ;
+		q = q->next;
-	if ( t == lex_identifier ) {
-	    t = find_hashid ( q->pp_data.id.hash ) ;
-	    if ( t == lex_tag_Hcap ) q->tok = t ;
-	} else if ( t == lex_hash_H1 || t == lex_hash_H2 ) {
-	    r = quote_token_name ( q ) ;
-	    break ;
+	}
+	if (q->tok != lex_newline) {
+		PPTOKEN *r = read_line(lex_ignore_token, lex_newline);
-	r = q ;
+		if (r) {
+			r->pp_space = WHITE_SPACE;
+		}
+		q->next = r;
+	}
+	q = expand_tok_list(p);
+	free_tok_list(p);
-    }
+	p = q;
-    /* Add newline token */
+	/* Replace any identifiers by keywords */
-    if ( nl ) {
+	for (q = p; q != NULL; q = q->next) {
-	while ( r->next ) r = r->next ;
+		int t = q->tok;
-	r->next = new_pptok () ;
+		if (t == lex_identifier) {
-	r->next->tok = lex_newline ;
+			t = find_hashid(q->pp_data.id.hash);
-	r->next->next = NULL ;
+			q->tok = t;
-    }
+		}
+	}
-    /* Parse the line */
+	/* Parse the line */
-    tok = parse_pragma ( p, tendra ) ;
+	return(parse_pragma(p, tendra));
-    return ( tok ) ;
+}
+/*
+    READ A PRAGMA INTERFACE STATEMENT
+    This routine processes a '#pragma interface' statement, returning the
+    corresponding lexical token.  One or two tokens from the line will
+    have already been read into p.  tendra is as in parse_pragma.
+*/
+static int
+read_interface(PPTOKEN *p, int tendra)
+{
+	/* Read and macro expand the rest of the line */
+	int tok;
+	int nl = 0;
+	PPTOKEN *q = p;
+	PPTOKEN *r = p;
+	while (q->next)q = q->next;
+	if (q->tok != lex_newline) {
+		PPTOKEN *s = read_line(lex_ignore_token, lex_ignore_token);
+		if (s) {
+			s->pp_space = WHITE_SPACE;
+		}
+		q->next = s;
+		nl = 1;
+	}
+	for (q = p; q != NULL; q = q->next) {
+		/* Suppress expansion of 'TAG' */
+		int t = q->tok;
+		if (t == lex_identifier) {
+			t = find_hashid(q->pp_data.id.hash);
+			if (t == lex_tag_Hcap) {
+				q->tok = t;
+			}
+		} else if (t == lex_hash_H1 || t == lex_hash_H2) {
+			r = quote_token_name(q);
+			break;
+		}
+		r = q;
+	}
+	/* Add newline token */
+	if (nl) {
+		while (r->next)r = r->next;
+		r->next = new_pptok();
+		r->next->tok = lex_newline;
+		r->next->next = NULL;
+	}
+	/* Parse the line */
+	tok = parse_pragma(p, tendra);
+	return(tok);
+}
 /*
     PROCESS A NON-TENDRA PRAGMA STATEMENT
     This routine processes a '#pragma' statement in which there is no
 	promote				TenDRA promoted
 	compute promote			TenDRA compute promote (?)
 	integer literal			TenDRA integer literal
 	external volatile		TenDRA external volatile
 	DEFINE MEMBER			TenDRA member definition
 /*
     PROCESS A PRAGMA STATEMENT
     This routine analyses a '#pragma' statement, returning the corresponding
     lexical token.  It is called from read_preproc_dir (q.v.) immediately
     after the '#pragma' directive has been identified.  It is not called for
     skipped '#pragma' directives.  The calling routine will skip to the end
     of the preprocessing directive if necessary.
 */
-int read_pragma
+int
-    PROTO_Z ()
+read_pragma(void)
 {
-    int t ;
+	int t;
-    PPTOKEN *p = get_token () ;
+	PPTOKEN *p = get_token();
-    if ( p->tok == lex_identifier ) {
+	if (p->tok == lex_identifier) {
-	t = find_hashid ( p->pp_data.id.hash ) ;
+		t = find_hashid(p->pp_data.id.hash);
-	switch ( t ) {
+		switch (t) {
-	    case lex_tendra : {
+		case lex_tendra: {
-		/* Deal with '#pragma TenDRA' */
+			/* Deal with '#pragma TenDRA' */
-		int tendra = 1 ;
+			int tendra = 1;
-		p->next = free_tokens ;
+			p->next = free_tokens;
-		free_tokens = p ;
+			free_tokens = p;
-		p = get_token () ;
+			p = get_token();
-		if ( p->tok == lex_plus_Hplus ) {
+			if (p->tok == lex_plus_Hplus) {
-		    /* Allow for TenDRA++ */
+				/* Allow for TenDRA++ */
 #if LANGUAGE_CPP
-		    p->next = free_tokens ;
+				p->next = free_tokens;
-		    free_tokens = p ;
+				free_tokens = p;
-		    p = get_token () ;
+				p = get_token();
-		    tendra = 2 ;
+				tendra = 2;
 #else
-		    return ( lex_ignore_token ) ;
+				return(lex_ignore_token);
 #endif
-		}
+			}
-		/* Allow for optional TenDRA pragmas */
+			/* Allow for optional TenDRA pragmas */
-		t = read_non_tendra ( p, tendra ) ;
+			t = read_non_tendra(p, tendra);
-		if ( t != lex_unknown ) return ( t ) ;
+			if (t != lex_unknown) {
+				return(t);
+			}
-		/* Deal with TenDRA pragmas */
+			/* Deal with TenDRA pragmas */
-		t = read_tendra ( p, tendra ) ;
+			t = read_tendra(p, tendra);
-		return ( t ) ;
+			return(t);
-	    }
+		}
-	    case lex_ident : {
+		case lex_ident:
-		/* Deal with '#pragma ident' */
+			/* Deal with '#pragma ident' */
-		if ( !option ( OPT_ppdir_ident_ignore ) ) {
+			if (!option(OPT_ppdir_ident_ignore)) {
-		    read_ident ( lex_pragma ) ;
+				read_ident(lex_pragma);
-		}
+			}
-		return ( lex_ignore_token ) ;
+			return(lex_ignore_token);
-	    }
-	    case lex_weak : {
+		case lex_weak:
-		/* Deal with '#pragma weak' */
+			/* Deal with '#pragma weak' */
-		if ( !option ( OPT_ppdir_weak_ignore ) ) {
+			if (!option(OPT_ppdir_weak_ignore)) {
-		    read_weak ( lex_pragma ) ;
+				read_weak(lex_pragma);
-		}
+			}
-		return ( lex_ignore_token ) ;
+			return(lex_ignore_token);
-	    }
+		}
 	}
-    }
-    /* Deal with non-TenDRA pragmas */
+	/* Deal with non-TenDRA pragmas */
-    t = read_non_tendra ( p, 0 ) ;
+	t = read_non_tendra(p, 0);
-    if ( t != lex_unknown ) return ( t ) ;
+	if (t != lex_unknown) {
+		return(t);
+	}
-    /* Report unknown pragmas */
+	/* Report unknown pragmas */
-    free_tok_list ( p ) ;
+	free_tok_list(p);
-    report ( preproc_loc, ERR_cpp_pragma_unknown ( lex_pragma ) ) ;
+	report(preproc_loc, ERR_cpp_pragma_unknown(lex_pragma));
-    return ( lex_ignore_token ) ;
+	return(lex_ignore_token);
+}
 /*
     ANALYSE A LINT COMMENT
     approach should be used.  Other fairly standard lint comments include
     VARARGS, LINTLIBRARY, CONSTANTCONDITION (CONSTCOND), EMPTY, LINTED,
     PROTOLIB, PRINTFLIKE and SCANFLIKE.
 */
-int lint_comment
+int
-    PROTO_Z ()
+lint_comment(void)
+{
-    string t ;
+	string t;
-    size_t sz ;
+	size_t sz;
-    character c ;
+	character c;
-    string s = token_buff.start ;
+	string s = token_buff.start;
-    while ( c = *s, is_white_char ( ( unsigned long ) c ) ) {
+	while (c = *s, is_white_char((unsigned long)c)) {
-	/* Step over initial white space */
+		/* Step over initial white space */
-	s++ ;
-    }
-    t = s ;
-    while ( c = *s, is_alpha_char ( ( unsigned long ) c ) ) {
-	/* Scan to end of identifier */
-	s++ ;
+		s++;
-    }
-    /* Check identifier */
-    sz = ( size_t ) ( s - t ) ;
-    switch ( sz ) {
-	case 8 : {
-	    if ( strncmp ( strlit ( t ), "ARGSUSED", sz ) == 0 ) {
-		/* Indicate unused variables */
-		suppress_variable = 1 ;
-	    } else if ( strncmp ( strlit ( t ), "FALLTHRU", sz ) == 0 ) {
-		/* Suppress fall through errors */
-		suppress_fall = 1 ;
-	    }
-	    break ;
-	}
-	case 10 : {
-	    if ( strncmp ( strlit ( t ), "NOTREACHED", sz ) == 0 ) {
-		/* Suppress unreached code errors */
-		unreached_last = 1 ;
-	    }
-	    break ;
+	}
+	t = s;
+	while (c = *s, is_alpha_char((unsigned long)c)) {
+		/* Scan to end of identifier */
+		s++;
+	}
+	/* Check identifier */
+	sz = (size_t)(s - t);
+	switch (sz) {
+	case 8:
+		if (strncmp(strlit(t), "ARGSUSED", sz) == 0) {
+			/* Indicate unused variables */
+			suppress_variable = 1;
+		} else if (strncmp(strlit(t), "FALLTHRU", sz) == 0) {
+			/* Suppress fall through errors */
+			suppress_fall = 1;
+		}
+		break;
+	case 10:
+		if (strncmp(strlit(t), "NOTREACHED", sz) == 0) {
+			/* Suppress unreached code errors */
+			unreached_last = 1;
+		}
+		break;
-	case 11 : {
+	case 11:
-	    if ( strncmp ( strlit ( t ), "FALLTHROUGH", sz ) == 0 ) {
+		if (strncmp(strlit(t), "FALLTHROUGH", sz) == 0) {
-		/* Suppress fall through errors */
+			/* Suppress fall through errors */
-		suppress_fall = 1 ;
+			suppress_fall = 1;
-	    }
+		}
-	    break ;
+		break;
+	}
-    }
-    /* Rest of comment is ignored */
+	/* Rest of comment is ignored */
-    return ( lex_ignore_token ) ;
+	return(lex_ignore_token);
+}

Subversion Repositories tendra.SVN

(root)/trunk/src/producers/common/parse/pragma.c – Rev 2 → 7