WebSVN – tendra.SVN – Diff – /trunk/src/tools/tcc/options.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 <sys/types.h>
+#include <sys/stat.h>
+#include <errno.h>
 #include "config.h"
 #include "filename.h"
 #include "list.h"
 #include "archive.h"
 #include "options.h"
 #include "startup.h"
 #include "suffix.h"
 #include "utility.h"
+		}
-		error ( OPTION, "Unknown compilation stage, '%c'", b ) ;
-		return ( null ) ;
-	    }
-	    goto case_O ;
-	}
-	case 'O' :
-	case_O :{
-	    switch ( b ) {
-		case PRODUCE_ID : return ( &opt_produce ) ;
-		case PREPROC_ID : return ( &opt_preproc ) ;
-		case CPP_PRODUCE_ID : return ( &opt_cpp_produce ) ;
-		case CPP_PREPROC_ID : return ( &opt_cpp_preproc ) ;
-		case TDF_LINK_ID : return ( &opt_tdf_link ) ;
-		case TRANSLATE_ID : return ( &opt_translate ) ;
-		case ASSEMBLE_ID : return ( &opt_assemble ) ;
-		case DYNLINK_ID : return ( &opt_dynlink ) ;
-		case LINK_ID : return ( &opt_link ) ;
-		case PRETTY_ID : return ( &opt_pretty ) ;
-		case NOTATION_ID : return ( &opt_notation ) ;
-		case PL_TDF_ID : return ( &opt_pl_tdf ) ;
-		case ASSEMBLE_MIPS_ID : return ( &opt_assemble_mips ) ;
-		case SPEC_LINK_ID : return ( &opt_spec_link ) ;
-		case CPP_SPEC_LINK_ID : return ( &opt_cpp_spec_link ) ;
-		case INSTALL_ID : return ( &opt_archive ) ;
-		case ARCHIVER_ID : return ( &opt_joiner ) ;
-		case CC_ID : return ( &opt_cc ) ;
-	        case DUMP_ANAL_ID : return ( &opt_dump_anal );
-	        case DUMP_LINK_ID : return ( &opt_dump_link );
-	    }
-	    error ( OPTION, "Unknown compilation stage, '%c'", b ) ;
-	    return ( null ) ;
-	}
-	case 'S' : {
-	    switch ( b ) {
-		case 'I' : return ( &std_prod_incldirs ) ;
-		case 'P' : return ( &std_prod_portfile ) ;
-		case 'd' : return ( &std_prod_startdirs ) ;
-		case 's' : return ( &std_prod_startup ) ;
-		case 'i' : return ( &std_cpp_prod_incldirs ) ;
-		case 'D' : return ( &std_cpp_prod_startdirs ) ;
-		case 'S' : return ( &std_cpp_prod_startup ) ;
-		case 'J' : return ( &std_tdf_link_libdirs ) ;
-		case 'j' : return ( &std_tdf_link_libs ) ;
-		case '0' : return ( &std_link_crt0 ) ;
-		case '1' : return ( &std_link_crt1 ) ;
-		case '2' : return ( &std_link_crtn ) ;
-		case '3' : return ( &std_link_crtp_n ) ;
-		case 'L' : return ( &std_link_libdirs ) ;
-		case 'l' : return ( &std_link_libs ) ;
-		case 'c' : return ( &std_link_c_libs ) ;
-		case 'e' : return ( &std_link_entry ) ;
-	    }
-	    break ;
-	}
-	case 'U' : {
-	    switch ( b ) {
-		case 'I' : return ( &usr_prod_incldirs ) ;
-		case 's' : return ( &usr_prod_startup ) ;
-		case 'e' : return ( &usr_prod_eoptions ) ;
-		case 'f' : return ( &usr_prod_foptions ) ;
-		case 'P' : return ( &usr_pl_tdf_incldirs ) ;
-		case 'J' : return ( &usr_tdf_link_libdirs ) ;
-		case 'j' : return ( &usr_tdf_link_libs ) ;
-		case 'L' : return ( &usr_link_libdirs ) ;
-		case 'l' : return ( &usr_link_libs ) ;
-	    }
-	    break ;
-	}
-	case 'X' : {
-	    switch ( b ) {
-		case 'O' : return ( &opt_unknown ) ;
-		case 'X' : return ( &xx_list ) ;
-	    }
-	    break ;
-	}
-    }
-    error ( OPTION, "Unknown list identifier, '%c%c'", a, b ) ;
-    return ( null ) ;
-}
-/*
-    CONVERT A TWO LETTER CODE INTO A STRING
-    This routine takes a two letter code, s, and returns a pointer to
-    the corresponding string variable.
-*/
-static char **lookup_string
-    PROTO_N ( ( s ) )
+		t = find_type(b, 0);
-    PROTO_T ( char *s )
-{
-    char a = s [0] ;
-    char b = 0 ;
-    if ( a ) b = s [1] ;
+		return (suffixes + t);
-    if ( a == 'N' ) {
-	switch ( b ) {
-	    case INDEP_TDF_KEY : return ( &name_j_file ) ;
-	    case C_SPEC_KEY : return ( &name_k_file ) ;
-	    case CPP_SPEC_KEY : return ( &name_K_file ) ;
-	    case STARTUP_FILE_KEY : return ( &name_h_file ) ;
-	    case PRETTY_TDF_KEY : return ( &name_p_file ) ;
+	}
-	error ( OPTION, "Unknown output file specifier, '%c'", b ) ;
-	return ( null ) ;
-    }
-    if ( a == 'S' ) {
-	int t = find_type ( b, 0 ) ;
-	return ( suffixes + t ) ;
-    }
-    if ( a == 'A' && b == 'I' ) return ( &api_info ) ;
+	if (a == 'A' && b == 'I') return (&api_info);
-    if ( a == 'A' && b == 'O' ) return ( &api_output ) ;
+	if (a == 'A' && b == 'O') return (&api_output);
-    if ( a == 'D' && b == 'O' ) return ( &dump_opts ) ;
+	if (a == 'D' && b == 'O') return (&dump_opts);
-    if ( a == 'E' && b == 'D' ) return ( &environ_dir ) ;
+	if (a == 'E' && b == 'D') return (&environ_dir);
-    if ( a == 'F' && b == 'N' ) return ( &final_name ) ;
+	if (a == 'F' && b == 'N') return (&final_name);
-    if ( a == 'M' && b == 'N' ) return ( &machine_name ) ;
+	if (a == 'M' && b == 'N') return (&machine_name);
-    if ( a == 'P' && b == 'N' ) return ( &progname ) ;
+	if (a == 'P' && b == 'N') return (&progname);
-    if ( a == 'T' && b == 'D' ) return ( &temporary_dir ) ;
+	if (a == 'T' && b == 'D') return (&temporary_dir);
-    if ( a == 'V' && b == 'F' ) return ( &version_flag ) ;
+	if (a == 'V' && b == 'F') return (&version_flag);
-    if ( a == 'W' && b == 'D' ) return ( &workdir ) ;
+	if (a == 'W' && b == 'D') return (&workdir);
-    if ( a == 'X' && b == 'X' ) return ( &xx_string ) ;
+	if (a == 'X' && b == 'X') return (&xx_string);
-    error ( OPTION, "Unknown string identifier, '%c%c'", a, b ) ;
+	error(OPTION, "Unknown string identifier, '%c%c'", a, b);
-    return ( null ) ;
+	return (null);
-}
-/*
-    DUMMY ARGUMENT FOR PROCEDURE
-    This variable is used to hold any argument passed to one of the procedures
-    in lookup_proc.
-*/
-static char *lookup_proc_arg = null ;
-/*
-    DUMMY WRAPPER PROCEDURES
-    These routine(s) are used to call procedures with an argument using
-    lookup_proc.
-*/
-static void add_pragma_aux
-    PROTO_Z ()
-{
-    add_pragma ( lookup_proc_arg ) ;
-    return ;
-}
-static void add_token_aux
-    PROTO_Z ()
-{
-    add_token ( lookup_proc_arg ) ;
-    return ;
-}
-/*
-    CONVERT A TWO LETTER CODE INTO A PROCEDURE
-    This routine takes a two letter code, s, and returns a pointer to
-    the corresponding procedure.
-*/
-typedef void ( *proc ) PROTO_Z () ;
-static proc lookup_proc
-    PROTO_N ( ( s ) )
-    PROTO_T ( char *s )
-{
-    char a = s [0] ;
-    char b = 0 ;
-    if ( a ) b = s [1] ;
-    if ( a == 'A' && b == 'P' ) return ( add_pragma_aux ) ;
-    if ( a == 'A' && b == 'T' ) return ( add_token_aux ) ;
-    if ( a == 'F' && b == 'E' ) return ( find_envpath ) ;
-    if ( a == 'P' && b == 'V' ) return ( print_version ) ;
-    if ( a == 'S' && b == 'E' ) return ( show_envpath ) ;
-    if ( a == 'S' && b == 'M' ) return ( set_machine ) ;
-    if ( a == 'S' && b == 'P' ) return ( special_option ) ;
-    error ( OPTION, "Unknown procedure identifier, '%c%c'", a, b ) ;
-    return ( null ) ;
+}
 /*
-    RETURN VALUES FOR MATCH_OPTION
+ * DUMMY ARGUMENT FOR PROCEDURE
+ *
+ * This variable is used to hold any argument passed to one of the procedures
+ * in lookup_proc.
+ */
+static char *lookup_proc_arg = null;
+/*
+ * DUMMY WRAPPER PROCEDURES
+ *
+ * These routine(s) are used to call procedures with an argument using
+ * lookup_proc.
+ */
+static void
+add_pragma_aux(void)
+{
+	add_pragma(lookup_proc_arg);
+	return;
+}
+static void
+add_token_aux(void)
+{
+	add_token(lookup_proc_arg);
+	return;
+}
+/*
+ * CONVERT A TWO LETTER CODE INTO A PROCEDURE
+ *
+ * This routine takes a two letter code, s, and returns a pointer to the
+ * corresponding procedure.
+ */
+typedef void	(*proc)(void);
+static proc
+lookup_proc(char *s)
+{
+	char a = s[0];
+	char b = 0;
+	if (a) {
+		b = s[1];
+	}
+	if (a == 'A' && b == 'P') return (add_pragma_aux);
+	if (a == 'A' && b == 'T') return (add_token_aux);
+	if (a == 'F' && b == 'E') return (find_envpath);
+	if (a == 'P' && b == 'V') return (print_version);
+	if (a == 'S' && b == 'E') return (show_envpath);
+	if (a == 'S' && b == 'M') return (set_machine);
+	if (a == 'S' && b == 'P') return (special_option);
+	error(OPTION, "Unknown procedure identifier, '%c%c'", a, b);
+	return (null);
+}
+/*
+ * RETURN VALUES FOR MATCH_OPTION
+ *
-    These values are returned by match_option.  MATCH_OK means that the
+ * These values are returned by match_option. MATCH_OK means that the option
-    option matches, MATCH_MORE means that it may match with an additional
+ * matches, MATCH_MORE means that it may match with an additional option,
-    option, MATCH_FAILED means it does not match, and the other values
+ * MATCH_FAILED means it does not match, and the other values indicate errors
-    indicate errors of some kind.
+ * of some kind.
-*/
+ */
 #define MATCH_OK		0
 #define MATCH_MORE		1
 #define MATCH_FAILED		2
 #define MATCH_IN_ERR		3
 #define MATCH_OUT_ERR		4
 #define MATCH_OPT_ERR		5
 /*
-    MATCH AN OPTION
+ * MATCH AN OPTION
-*/
+ */
-static int match_option
+static int
-    PROTO_N ( ( in, out, opt, res ) )
-    PROTO_T ( char *in X char *out X char *opt X args_out *res )
+match_option(char *in, char *out, char *opt, args_out *res)
+{
-    char *p = in ;
+    char *p = in;
-    char *q = opt ;
+    char *q = opt;
-    int i, a, v = 1 ;
+    int i, a, v = 1;
-    int go = 1, loop = 1, loopv = -1 ;
+    int go = 1, loop = 1, loopv = -1;
-    struct { char *txt ; int len ; } var [ max_var ] ;
+    struct { char *txt; int len; } var[max_var];
     /* Process input */
-    while ( *p && go ) {
+    while (*p && go) {
-	if ( *p == '$' ) {
+	if (*p == '$') {
-	    char c = p [1] ;
+	    char c = p[1];
-	    if ( c ) {
+	    if (c) {
-		int wraps = 0 ;
+		int wraps = 0;
-		if ( p [2] == '+' && p [3] == '*' ) {
+		if (p[2] == '+' && p[3] == '*') {
 		    /* List of strings with breaks : $c+* */
-		    wraps = 1 ;
+		    wraps = 1;
-		    p++ ;
+		    p++;
+		}
-		if ( p [2] == '*' ) {
+		if (p[2] == '*') {
 		    /* List of strings : $c* */
-		    loop = 0 ;
+		    loop = 0;
-		    loopv = v ;
+		    loopv = v;
-		    if ( p [3] ) return ( MATCH_IN_ERR ) ;
+		    if (p[3]) return (MATCH_IN_ERR);
-		    while ( *q ) {
+		    while (*q) {
-			int l = 0 ;
+			int l = 0;
-			var [v].txt = q ;
+			var[v].txt = q;
-			while ( *q && *q != c ) {
+			while (*q && *q != c) {
-			    l++ ;
+			    l++;
-			    q++ ;
+			    q++;
+			}
-			var [v].len = l ;
+			var[v].len = l;
-			if ( *q ) {
+			if (*q) {
 			    /* Found c */
-			    q++ ;
+			    q++;
-			    if ( *q == 0 && wraps ) return ( MATCH_MORE ) ;
+			    if (*q == 0 && wraps) return (MATCH_MORE);
+			}
-			if ( ++v >= max_var ) return ( MATCH_OPT_ERR ) ;
+			if (++v >= max_var) return (MATCH_OPT_ERR);
-			loop++ ;
+			loop++;
+		    }
-		    go = 0 ;
+		    go = 0;
 		} else {
 		    /* Terminated string : $c */
-		    int l = 0 ;
+		    int l = 0;
-		    var [v].txt = q ;
+		    var[v].txt = q;
-		    while ( *q != c ) {
+		    while (*q != c) {
-			if ( *q == 0 ) return ( MATCH_FAILED ) ;
+			if (*q == 0) return (MATCH_FAILED);
-			l++ ;
+			l++;
-			q++ ;
+			q++;
+		    }
-		    var [v].len = l ;
+		    var[v].len = l;
-		    if ( ++v >= max_var ) return ( MATCH_OPT_ERR ) ;
+		    if (++v >= max_var) return (MATCH_OPT_ERR);
+		}
 	    } else {
 		/* Simple string : $ */
-		int l = ( int ) strlen ( q ) ;
+		int l = (int)strlen(q);
-		var [v].txt = q ;
+		var[v].txt = q;
-		var [v].len = l ;
+		var[v].len = l;
-		if ( ++v >= max_var ) return ( MATCH_OPT_ERR ) ;
+		if (++v >= max_var) return (MATCH_OPT_ERR);
-		go = 0 ;
+		go = 0;
+	    }
-	} else if ( *p == '?' ) {
+	} else if (*p == '?') {
-	    if ( p [1] == '*' ) {
+	    if (p[1] == '*') {
 		/* List of characters : ?* */
-		if ( p [2] ) return ( MATCH_IN_ERR ) ;
+		if (p[2]) return (MATCH_IN_ERR);
-		loop = 0 ;
+		loop = 0;
-		loopv = v ;
+		loopv = v;
-		while ( *q ) {
+		while (*q) {
-		    var [v].txt = q ;
+		    var[v].txt = q;
-		    var [v].len = 1 ;
+		    var[v].len = 1;
-		    if ( ++v >= max_var ) return ( MATCH_OPT_ERR ) ;
+		    if (++v >= max_var) return (MATCH_OPT_ERR);
-		    q++ ;
+		    q++;
-		    loop++ ;
+		    loop++;
+		}
-		go = 0 ;
+		go = 0;
 	    } else {
 		/* Simple character : ? */
-		if ( *q == 0 ) return ( MATCH_FAILED ) ;
+		if (*q == 0) return (MATCH_FAILED);
-		var [v].txt = q ;
+		var[v].txt = q;
-		var [v].len = 1 ;
+		var[v].len = 1;
-		if ( ++v >= max_var ) return ( MATCH_OPT_ERR ) ;
+		if (++v >= max_var) return (MATCH_OPT_ERR);
-		q++ ;
+		q++;
+	    }
-	} else if ( *p == '+' ) {
+	} else if (*p == '+') {
 	    /* Potential break : + */
-	    if ( *q == 0 ) return ( MATCH_MORE ) ;
+	    if (*q == 0) return (MATCH_MORE);
-	} else if ( *p == '^' ) {
+	} else if (*p == '^') {
 	    /* Negated letter */
-	    p++ ;
+	    p++;
-	    if ( *p == 0 ) return ( MATCH_IN_ERR ) ;
+	    if (*p == 0) return (MATCH_IN_ERR);
-	    if ( *p == *q ) return ( MATCH_FAILED ) ;
+	    if (*p == *q) return (MATCH_FAILED);
-	    q++ ;
+	    q++;
-	} else if ( *p == '\\' ) {
+	} else if (*p == '\\') {
 	    /* Escaped letter : \c */
-	    p++ ;
+	    p++;
-	    if ( *p == 0 ) return ( MATCH_IN_ERR ) ;
+	    if (*p == 0) return (MATCH_IN_ERR);
-	    if ( *p != *q ) return ( MATCH_FAILED ) ;
+	    if (*p != *q) return (MATCH_FAILED);
-	    q++ ;
+	    q++;
 	} else {
 	    /* Letter : c */
-	    if ( *p != *q ) return ( MATCH_FAILED ) ;
+	    if (*p != *q) return (MATCH_FAILED);
-	    q++ ;
+	    q++;
+	}
-	p++ ;
+	p++;
+    }
     /* Check end of option */
-    if ( go && *q ) return ( MATCH_FAILED ) ;
+    if (go && *q) return (MATCH_FAILED);
     /* The first variable is the whole option */
-    var [0].txt = opt ;
+    var[0].txt = opt;
-    var [0].len = ( int ) strlen ( opt ) ;
+    var[0].len = (int)strlen(opt);
     /* Print output */
-    a = 0 ;
+    a = 0;
-    for ( i = 0 ; i < loop ; i++ ) {
+    for (i = 0; i < loop; i++) {
+	int count = 0;
-	char buff [1000] ;
+	char buff[MAX_LINE];
-	q = buff ;
+	q = buff;
-	for ( p = out ; *p ; p++ ) {
+	for (p = out; *p && count < MAX_LINE; p++, count++) {
-	    if ( *p == '$' ) {
+	    if (*p == '$') {
 		/* Variable */
-		int n ;
+		int n;
-		char c = *( ++p ) ;
+		char c = *(++p);
-		if ( c == 's' ) {
+		if (c == 's') {
 		    /* $s expands to a space */
-		    *( q++ ) = ' ' ;
+		    *(q++) = ' ';
-		} else if ( c == 'n' ) {
+		} else if (c == 'n') {
 		    /* $n expands to a newline */
-		    *( q++ ) = '\n' ;
+		    *(q++) = '\n';
-		} else if ( c >= '0' && c <= '9' ) {
+		} else if (c >= '0' && c <= '9') {
-		    n = ( c - '0' ) ;
+		    n = (c - '0');
-		    if ( n == loopv ) n += i ;
+		    if (n == loopv)n += i;
-		    if ( n < v ) {
+		    if (n < v) {
-			int l = var [n].len ;
+			int l = var[n].len;
-			IGNORE strncpy ( q, var [n].txt, ( size_t ) l ) ;
+			IGNORE strncpy(q, var[n].txt,(size_t)l);
-			q += l ;
+			q += l;
+		    }
-		} else if ( c == 'B' ) {
+		} else if (c == 'B') {
-		    boolean *b = lookup_bool ( p + 1 ) ;
+		    boolean *b = lookup_bool(p + 1);
-		    if ( b == null ) return ( MATCH_OUT_ERR ) ;
+		    if (b == null) return (MATCH_OUT_ERR);
-		    IGNORE sprintf ( q, "%d", ( int ) *b ) ;
+		    IGNORE sprintf(q, "%d",(int)*b);
-		    while ( *q ) q++ ;
+		    while (*q)q++;
-		    p += 2 ;
+		    p += 2;
-		} else if ( c == 'L' ) {
+		} else if (c == 'L') {
-		    list *pt ;
+		    list *pt;
-		    list **sp = lookup_list ( p + 1 ) ;
+		    list **sp = lookup_list(p + 1);
-		    if ( sp == null ) return ( MATCH_OUT_ERR ) ;
+		    if (sp == null) return (MATCH_OUT_ERR);
-		    for ( pt = *sp ; pt ; pt = pt->next ) {
+		    for (pt = *sp; pt; pt = pt->next) {
-			int l = ( int ) strlen ( pt->item ) ;
+			int l = (int)strlen(pt->item);
-			IGNORE strncpy ( q, pt->item, ( size_t ) l ) ;
+			IGNORE strncpy(q, pt->item,(size_t)l);
-			q += l ;
+			q += l;
-			*( q++ ) = ' ' ;
+			*(q++) = ' ';
+		    }
-		    p += 2 ;
+		    p += 2;
-		} else if ( c == 'S' ) {
+		} else if (c == 'S') {
-		    int l ;
+		    int l;
-		    char **sp = lookup_string ( p + 1 ) ;
+		    char **sp = lookup_string(p + 1);
-		    if ( sp == null ) return ( MATCH_OUT_ERR ) ;
+		    if (sp == null) return (MATCH_OUT_ERR);
-		    if ( *sp ) {
+		    if (*sp) {
-			l = ( int ) strlen ( *sp ) ;
+			l = (int)strlen(*sp);
-			IGNORE strncpy ( q, *sp, ( size_t ) l ) ;
+			IGNORE strncpy(q, *sp,(size_t)l);
-			q += l ;
+			q += l;
+		    }
-		    p += 2 ;
+		    p += 2;
 		} else {
-		    return ( MATCH_OUT_ERR ) ;
+		    return (MATCH_OUT_ERR);
+		}
-	    } else if ( *p == '|' ) {
+	    } else if (*p == '|') {
 		/* Multiple output */
-		*q = 0 ;
+		*q = 0;
-		res->argv [a] = string_copy ( buff ) ;
+		res->argv[a] = string_copy(buff);
-		if ( ++a >= max_var ) return ( MATCH_OPT_ERR ) ;
+		if (++a >= max_var) return (MATCH_OPT_ERR);
-		q = buff ;
+		q = buff;
-	    } else if ( *p == '\\' ) {
+	    } else if (*p == '\\') {
 		/* Escaped output character */
-		if ( *( ++p ) == 0 ) return ( MATCH_OUT_ERR ) ;
+		if (*(++p) == 0) return (MATCH_OUT_ERR);
-		*( q++ ) = *p ;
+		*(q++) = *p;
 	    } else {
 		/* Simple output character */
-		*( q++ ) = *p ;
+		*(q++) = *p;
+	    }
+	}
-	*q = 0 ;
+	*q = 0;
-	res->argv [a] = string_copy ( buff ) ;
+	res->argv[a] = string_copy(buff);
-	if ( ++a >= max_var ) return ( MATCH_OPT_ERR ) ;
+	if (++a >= max_var) return (MATCH_OPT_ERR);
+    }
-    res->argc = a ;
+    res->argc = a;
-    return ( MATCH_OK ) ;
+    return (MATCH_OK);
+}
 /*
-    INTERPRET AN OPTION COMMAND
+ * INTERPRET AN OPTION COMMAND
-*/
+ */
-static void interpret_cmd
+static void
-    PROTO_N ( ( cmd ) )
-    PROTO_T ( char *cmd )
+interpret_cmd(char *cmd)
+{
-    char c = *cmd ;
+    char c = *cmd;
     /* Debugging */
-    if ( debug_options ) error ( OPTION, "Interpreting '%s'", cmd ) ;
+    if (debug_options) error(OPTION, "Interpreting '%s'", cmd);
     /* Deal with at-hack */
-    if ( c == '@' ) {
+    if (c == '@') {
-	char *p = string_copy ( cmd + 1 ), *q ;
+	char *p = string_copy(cmd + 1), *q;
-	for ( q = p ; *q ; q++ ) {
+	for (q = p; *q; q++) {
-	    if ( *q == '@' ) *q = ' ' ;
+	    if (*q == '@') *q = ' ';
 	}
-	cmd = p ;
+	cmd = p;
-	c = *p ;
+	c = *p;
     }
     /* Deal with empty strings */
-    if ( c == 0 ) return ;
+    if (c == 0) return;
     /* Digits set values */
-    if ( c >= '0' && c <= '9' ) {
+    if (c >= '0' && c <= '9') {
-	boolean *b = lookup_bool ( cmd + 1 ) ;
+	boolean *b = lookup_bool(cmd + 1);
-	if ( b == null ) return ;
+	if (b == null) return;
-	*b = ( boolean ) ( c - '0' ) ;
+	*b = (boolean)(c - '0');
-	return ;
+	return;
+    }
     /* Translations */
-    if ( c == '>' ) c = 'A' ;
+    if (c == '>') c = 'A';
-    if ( c == '<' ) c = 'B' ;
+    if (c == '<') c = 'B';
-    if ( c == '+' ) c = 'L' ;
+    if (c == '+') c = 'L';
     /* Deal with list query */
-    if ( c == '?' ) {
+    if (c == '?') {
-	if ( cmd [1] == ':' ) {
+	if (cmd[1] == ':') {
-	    char **sp = lookup_string ( cmd + 2 ) ;
+	    char **sp = lookup_string(cmd + 2);
-	    if ( sp == null ) return ;
+	    if (sp == null) return;
-	    comment ( 1, "%s=\"%s\"\n", cmd + 4, *sp ) ;
+	    comment(1, "%s=\"%s\"\n", cmd + 4, *sp);
 	} else {
-	    list *p ;
+	    list *p;
-	    list **sp = lookup_list ( cmd + 1 ) ;
+	    list **sp = lookup_list(cmd + 1);
-	    if ( sp == null ) return ;
+	    if (sp == null) return;
-	    comment ( 1, "%s=\"", cmd + 3 ) ;
+	    comment(1, "%s=\"", cmd + 3);
-	    for ( p = *sp ; p != null ; p = p->next ) {
+	    for (p = *sp; p != null; p = p->next) {
-		comment ( 1, "%s", p->item ) ;
+		comment(1, "%s", p->item);
-		if ( p->next ) comment ( 1, " " ) ;
+		if (p->next)comment(1, " ");
 	    }
-	    comment ( 1, "\"\n" ) ;
+	    comment(1, "\"\n");
 	}
-	return ;
+	return;
     }
     /* Deal with equivalences */
-    if ( c == '=' ) {
+    if (c == '=') {
-	list *p = make_list ( cmd + 1 ) ;
+	list *p = make_list(cmd + 1);
-	process_options ( p, main_optmap ) ;
+	process_options(p, main_optmap, 1);
-	free_list ( p ) ;
+	free_list(p);
-	return ;
+	return;
+    }
     /* Deal with primitives */
-    switch ( c ) {
+    switch (c) {
-	case 'A' : {
+	case 'A': {
 	    /* Change list */
-	    list **sp = lookup_list ( cmd + 1 ) ;
+	    list **sp = lookup_list(cmd + 1);
-	    if ( sp == null ) return ;
+	    if (sp == null) {
+		    return;
+	    }
-	    *sp = add_list ( *sp, make_list ( cmd + 3 ) ) ;
+	    *sp = add_list(*sp, make_list(cmd + 3));
-	    return ;
+	    return;
 	}
-	case 'B' : {
+	case 'B': {
 	    /* Change list */
-	    list **sp = lookup_list ( cmd + 1 ) ;
+	    list **sp = lookup_list(cmd + 1);
-	    if ( sp == null ) return ;
+	    if (sp == null) {
+		    return;
+	    }
-	    *sp = add_list ( make_list ( cmd + 3 ), *sp ) ;
+	    *sp = add_list(make_list(cmd + 3), *sp);
-	    return ;
+	    return;
 	}
-	case 'L' : {
+	case 'L': {
 	    /* Change list */
-	    list **sp = lookup_list ( cmd + 1 ) ;
+	    list **sp = lookup_list(cmd + 1);
-	    if ( sp == null ) return ;
+	    if (sp == null) {
+		    return;
+	    }
-	    free_list ( *sp ) ;
+	    free_list(*sp);
-	    *sp = make_list ( cmd + 3 ) ;
+	    *sp = make_list(cmd + 3);
-	    return ;
+	    return;
+	}
-	case 'C' : {
+	case 'C': {
 	    /* Call */
-	    proc p = lookup_proc ( cmd + 1 ) ;
+	    proc p = lookup_proc(cmd + 1);
-	    if ( p == null ) return ;
+	    if (p == null) {
+		    return;
+	    }
-	    if ( cmd [3] == ':' ) {
+	    if (cmd[3] == ':') {
-		lookup_proc_arg = cmd + 4 ;
+		lookup_proc_arg = cmd + 4;
 	    } else {
-		lookup_proc_arg = null ;
+		lookup_proc_arg = null;
+	    }
-	    ( *p ) () ;
+	    (*p)();
-	    return ;
+	    return;
+	}
-	case 'D' : {
+	case 'D':
 	    /* Startup options */
-	    add_to_startup ( cmd + 1 ) ;
+	    add_to_startup(cmd + 1);
-	    return ;
+	    return;
+	case 'E': {
+            /* Environment */
+            if (*(cmd + 1) == '?') {
+		char var[MAX_LINE];
+		char val[MAX_LINE];
+		int  count;
+		char *p, *q, *r;
+		char c1;
+		char **subs;
+		int i;
+#if FS_STAT
+		struct stat sb;
+#endif
+		q = var;
+		r = val;
+		p = cmd + 2;
+		count = 0;
+		while ((c1 = *p++) != '?') {
+		        *q++ = c1;
+		}
+		*q++='\0';
+		while ((c1 = *p++) != NULL) {
+		    *r++ = c1;
+		    /*
+		     * Only the value is user supplied and needs bounds
+		     * checking.
+		     */
+		    if (++count >= MAX_LINE){
+			error(FATAL,
+			       "Exceeded maximum buffer length in -y argument\n");
+		    }
+		}
+		*r++ ='\0';
+		/*
+		 * Additional error checking for those platforms supporting
+		 * stat().
+		 */
+#if FS_STAT
+		if (stat(val, &sb) == -1) {
+		    error(SERIOUS, "interpret_cmd: %s %s",
+			val, strerror(errno));
+		}
+#endif
+		i = 0;
+		subs = PATH_SUBS;
+		while (*subs) {
+		    if (!strcmp(*subs, var)) {
+			env_paths[i] = string_copy(val);
+			break;
+		    }
+		    i++;
+		    subs++;
+		}
+		if (!*subs)
+		    error(WARNING,
+			  "Ignoring non-standard env assignment: %s=%s", var,
+			  val);
+	    } else {
+		read_env(cmd + 1);
+            }
+            return;
+	}
-	case 'E' : {
-	    /* Environment */
-	    read_env ( cmd + 1 ) ;
-	    return ;
-	}
-	case 'F' : {
+	case 'F':
 	    /* Endup options */
-	    add_to_endup ( cmd + 1 ) ;
+	    add_to_endup(cmd + 1);
-	    return ;
+	    return;
-	}
-	case 'H' : {
+	case 'H': {
 	    /* Halt */
-	    char stage = cmd [1] ;
+	    char stage = cmd[1];
-	    set_stage ( find_type ( stage, 0 ), STOP_STAGE ) ;
+	    set_stage(find_type(stage, 0), STOP_STAGE);
-	    return ;
+	    return;
+	}
-	case 'I' : {
+	case 'I': {
 	    /* Input file */
-	    int t ;
+	    int t;
-	    filename *f ;
+	    filename *f;
-	    char stage = cmd [1] ;
+	    char stage = cmd[1];
-	    char *name = cmd + 2 ;
+	    char *name = cmd + 2;
-	    if ( stage == '?' ) {
+	    if (stage == '?') {
-		t = UNKNOWN_TYPE ;
+		t = UNKNOWN_TYPE;
 	    } else {
-		t = find_type ( stage, 0 ) ;
+		t = find_type(stage, 0);
+	    }
-	    f = find_filename ( name, t ) ;
+	    f = find_filename(name, t);
-	    input_files = add_filename ( input_files, f ) ;
+	    input_files = add_filename(input_files, f);
-	    return ;
+	    return;
+	}
-	case 'K' : {
+	case 'K': {
 	    /* Keep */
-	    static int k = KEEP_STAGE ;
+	    static int k = KEEP_STAGE;
-	    char stage = cmd [1] ;
+	    char stage = cmd[1];
-	    if ( stage == '-' ) {
+	    if (stage == '-') {
-		k = DONT_KEEP_STAGE ;
+		k = DONT_KEEP_STAGE;
 	    } else {
-		set_stage ( find_type ( stage, 0 ), k ) ;
+		set_stage(find_type(stage, 0), k);
-		k = KEEP_STAGE ;
+		k = KEEP_STAGE;
 	    }
-	    return ;
+	    return;
+	}
-	case 'Q' : {
+	case 'Q': {
 	    /* Query */
-	    char *s ;
+	    char *s;
-	    optmap *t = main_optmap ;
+	    optmap *t = main_optmap;
-	    error ( INFO, "List of recognised options" ) ;
+	    error(INFO, "List of recognised options");
-	    while ( s = t->in, s != null ) {
+	    while (s = t->in, s != null) {
-		if ( *s == '-' ) {
+		if (*s == '-') {
-		    char d ;
+		    char d;
-		    comment ( 0, " " ) ;
+		    comment(0, " ");
-		    while ( d = *( s++ ), d != 0 ) {
+		    while (d = *(s++), d != 0) {
-			switch ( d ) {
+			switch (d) {
-			    case '$' : {
+			    case '$':
-				IGNORE fputs ( "<string>", stderr ) ;
+				IGNORE fputs("<string>", stderr);
-				break ;
+				break;
-			    }
-			    case '?' : {
+			    case '?':
-				IGNORE fputs ( "<letter>", stderr ) ;
+				IGNORE fputs("<letter>", stderr);
-				break ;
+				break;
-			    }
-			    case '*' : {
+			    case '*':
-				IGNORE fputs ( "...", stderr ) ;
+				IGNORE fputs("...", stderr);
-				break ;
+				break;
-			    }
-			    case '+' : {
+			    case '+':
-				IGNORE fputc ( ' ', stderr ) ;
+				IGNORE fputc(' ', stderr);
-				break ;
+				break;
-			    }
-			    case '\\' : {
+			    case '\\':
-				IGNORE fputc ( *( s++ ), stderr ) ;
+				IGNORE fputc(*(s++), stderr);
-				break ;
+				break;
-			    }
-			    default : {
+			    default:
-				IGNORE fputc ( d, stderr ) ;
+				IGNORE fputc(d, stderr);
-				break ;
+				break;
-			    }
+			}
 		    }
-		    s = t->explain ;
+		    s = t->explain;
+		    if (s == null) {
-		    if ( s == null ) s = "not documented" ;
+			    s = "not documented";
+		    }
-		    comment ( 0, " : " ) ;
+		    comment(0, " : ");
-		    comment ( 0, s, progname ) ;
+		    comment(0, s, progname);
-		    comment ( 0, ".\n" ) ;
+		    comment(0, ".\n");
+		}
+		t++;
+	    }
+	    return;
+	}
+	case 'S': {
+	    /* String */
+	    char **s = lookup_string(cmd + 1);
+	    if (s == null) {
+		    return;
+	    }
+	    *s = cmd + 3;
+	    return;
+	}
+	case 'V':
+	    if (cmd[1] == 'B') {
+		boolean *b = lookup_bool(cmd + 2);
+		if (b == null) {
+			return;
+		}
-		t++ ;
-	    }
-	    return ;
-	}
-	case 'S' : {
-	    /* String */
-	    char **s = lookup_string ( cmd + 1 ) ;
-	    if ( s == null ) return ;
-	    *s = cmd + 3 ;
-	    return ;
-	}
-	case 'V' : {
-	    if ( cmd [1] == 'B' ) {
-		boolean *b = lookup_bool ( cmd + 2 ) ;
-		if ( b == null ) return ;
-		comment ( 1, "%c%c = %d\n", cmd [2], cmd [3], *b ) ;
+		comment(1, "%c%c = %d\n", cmd[2], cmd[3], *b);
-		return ;
+		return;
-	    } else if ( cmd [1] == 'L' ) {
+	    } else if (cmd[1] == 'L') {
-		list **sp = lookup_list ( cmd + 2 ), *pt ;
+		list **sp = lookup_list(cmd + 2), *pt;
-		if ( sp == null ) return ;
+		if (sp == null) {
+			return;
+		}
-		comment ( 1, "%c%c =", cmd [2], cmd [3] ) ;
+		comment(1, "%c%c =", cmd[2], cmd[3]);
-		for ( pt = *sp ; pt != null ; pt = pt->next ) {
+		for (pt = *sp; pt != null; pt = pt->next) {
-		    if ( pt->item ) {
+		    if (pt->item) {
-			comment ( 1, " %s", pt->item ) ;
+			comment(1, " %s", pt->item);
 		    } else {
-			comment ( 1, " (null)" ) ;
+			comment(1, " (null)");
 		    }
 		}
-		comment ( 1, "\n" ) ;
+		comment(1, "\n");
-		return ;
+		return;
-	    } else if ( cmd [1] == 'S' ) {
+	    } else if (cmd[1] == 'S') {
-		char **s = lookup_string ( cmd + 2 ) ;
+		char **s = lookup_string(cmd + 2);
-		if ( s == null ) return ;
+		if (s == null) {
+			return;
+		}
-		if ( *s ) {
+		if (*s) {
-		    comment ( 1, "%c%c = %s\n", cmd [2], cmd [3], *s ) ;
+		    comment(1, "%c%c = %s\n", cmd[2], cmd[3], *s);
 		} else {
-		    comment ( 1, "%c%c = (null)\n", cmd [2], cmd [3] ) ;
+		    comment(1, "%c%c = (null)\n", cmd[2], cmd[3]);
 		}
-		return ;
+		return;
 	    }
-	    break ;
+	    break;
-	}
-	case 'X' : {
+	case 'X':
 	    /* Error */
-	    error ( WARNING, "%s", cmd + 1 ) ;
+	    error(WARNING, "%s", cmd + 1);
-	    return ;
+	    return;
-	}
+    }
-    error ( OPTION, "Syntax error, '%s'", cmd ) ;
+    error(OPTION, "Syntax error, '%s'", cmd);
-    return ;
+    return;
+}
 /*
-    PROCESS A LIST OF OPTIONS
+ * PROCESS A LIST OF OPTIONS
+ *
+ * This routine processes a list of options, opt, using the options from table
+ * tab.
+ */
-    This routine processes a list of options, opt, using the options
-    from table tab.
-*/
+void
-void process_options
-    PROTO_N ( ( opt, tab ) )
-    PROTO_T ( list *opt X optmap *tab )
+process_options(list *opt, optmap *tab, int fast)
+{
-    optmap *t ;
+	optmap *t;
-    list *p = opt ;
+	list *p = opt;
+	list *accum = null;
-    char *arg = null ;
+	char *arg = null;
-    int status = MATCH_OK ;
+	int status = MATCH_OK;
+	int a;
-    /* Scan through the options */
+	/* Scan through the options */
-    while ( p != null ) {
+	while (p != null) {
-	if ( status == MATCH_MORE ) {
+		if (status == MATCH_MORE) {
-	    arg = string_concat ( arg, p->item ) ;
+			arg = string_concat(arg, p->item);
-	} else {
+		} else {
-	    arg = p->item ;
+			arg = p->item;
-	}
+		}
-	status = MATCH_FAILED ;
+		status = MATCH_FAILED;
-	for ( t = tab ; t->in != null ; t++ ) {
+		for (t = tab; t->in != null; t++) {
-	    args_out res ;
+			args_out res;
-	    status = match_option ( t->in, t->out, arg, &res ) ;
+			status = match_option(t->in, t->out, arg, &res);
-	    switch ( status ) {
+			switch (status) {
-		case MATCH_OK : {
+			case MATCH_OK:
-		    /* Complete option - interpret result */
+				/* Complete option - interpret result */
-		    int a ;
+				for (a = 0; a < res.argc; a++) {
-		    for ( a = 0 ; a < res.argc ; a++ ) {
+					if (no_shuffle != 0 || fast == 1) {
-			interpret_cmd ( res.argv [a] ) ;
+						interpret_cmd(res.argv[a]);
-		    }
+					} else {
+						ordered_node *dn =
-		    goto end_search ;
+						    (ordered_node *)
+						    xalloc(sizeof(ordered_node));
+						dn->rank = t->rank;
+						dn->cmd  = res.argv[a];
+						accum = insert_inorder(dn,
+								       accum);
+					}
-		}
+				}
+				goto end_search;
-		case MATCH_MORE : {
+			case MATCH_MORE:
-		    /* Incomplete option - move on to next option */
+				/* Incomplete option - move on to next option */
-		    goto end_search ;
+				goto end_search;
-		}
-		case MATCH_FAILED : {
+			case MATCH_FAILED:
-		    /* Try again */
+				/* Try again */
-		    break ;
+				break;
-		}
-		case MATCH_IN_ERR : {
+			case MATCH_IN_ERR:
-		    /* Error in optmap input */
+				/* Error in optmap input */
-		    error ( OPTION, "Illegal input '%s'", t->in ) ;
+				error(OPTION, "Illegal input '%s'", t->in);
-		    status = MATCH_FAILED ;
+				status = MATCH_FAILED;
-		    break ;
+				break;
-		}
-		case MATCH_OUT_ERR : {
+			case MATCH_OUT_ERR:
-		    /* Error in optmap output */
+				/* Error in optmap output */
-		    error ( OPTION, "Illegal option '%s'", t->out ) ;
+				error(OPTION, "Illegal option '%s'", t->out);
-		    status = MATCH_FAILED ;
+				status = MATCH_FAILED;
-		    break ;
+				break;
-		}
-		case MATCH_OPT_ERR : {
+			case MATCH_OPT_ERR:
-		    /* Ran out of space for result */
+				/* Ran out of space for result */
-		    error ( OPTION, "Too many components, '%s'", arg ) ;
+				error(OPTION, "Too many components, '%s'", arg);
-		    status = MATCH_FAILED ;
+				status = MATCH_FAILED;
-		    break ;
+				break;
+			}
+		}
+		error(OPTION, "Can't interpret '%s'", arg);
+end_search:
+		p = p->next;
+	}
+	/* Check for incomplete options */
+	if (status == MATCH_MORE) {
+		error(WARNING, "Option '%s' is incomplete", arg);
+	}
+	/* if the no_shuffle flag is unset, we have order cmds to run */
+	if (no_shuffle == 0 && fast == 0) {
+		while (accum) {
+			ordered_node* dn;
+			dn = accum->item;
+			interpret_cmd (dn->cmd);
+			accum = accum->next;
+		}
-	    }
+	}
-	error ( OPTION, "Can't interpret '%s'", arg ) ;
-	end_search : p = p->next ;
-    }
-    /* Check for incomplete options */
-    if ( status == MATCH_MORE ) {
-	error ( WARNING, "Option '%s' is incomplete", arg ) ;
-    }
-    return ;
+	return;
+}

Subversion Repositories tendra.SVN

(root)/trunk/src/tools/tcc/options.c – Rev 2 → 7