Subversion Repositories tendra.SVN

Rev

Rev 2 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 7u83 1 
/*
7 7u83 2 
 * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
3 
 * All rights reserved.
4 
 *
5 
 * Redistribution and use in source and binary forms, with or without
6 
 * modification, are permitted provided that the following conditions are met:
7 
 *
8 
 * 1. Redistributions of source code must retain the above copyright notice,
9 
 *    this list of conditions and the following disclaimer.
10 
 * 2. Redistributions in binary form must reproduce the above copyright notice,
11 
 *    this list of conditions and the following disclaimer in the documentation
12 
 *    and/or other materials provided with the distribution.
13 
 * 3. Neither the name of The TenDRA Project nor the names of its contributors
14 
 *    may be used to endorse or promote products derived from this software
15 
 *    without specific, prior written permission.
16 
 *
17 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
18 
 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
19 
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20 
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
21 
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
22 
 * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
23 
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
24 
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25 
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
26 
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
27 
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 
 *
29 
 * $Id$
30 
 */
31 
/*
2 7u83 32 
    		 Crown Copyright (c) 1997
7 7u83 33 
 
2 7u83 34 
    This TenDRA(r) Computer Program is subject to Copyright
35 
    owned by the United Kingdom Secretary of State for Defence
36 
    acting through the Defence Evaluation and Research Agency
37 
    (DERA).  It is made available to Recipients with a
38 
    royalty-free licence for its use, reproduction, transfer
39 
    to other parties and amendment for any purpose not excluding
40 
    product development provided that any such use et cetera
41 
    shall be deemed to be acceptance of the following conditions:-
7 7u83 42 
 
2 7u83 43 
        (1) Its Recipients shall ensure that this Notice is
44 
        reproduced upon any copies or amended versions of it;
7 7u83 45 
 
2 7u83 46 
        (2) Any amended version of it shall be clearly marked to
47 
        show both the nature of and the organisation responsible
48 
        for the relevant amendment or amendments;
7 7u83 49 
 
2 7u83 50 
        (3) Its onward transfer from a recipient to another
51 
        party shall be deemed to be that party's acceptance of
52 
        these conditions;
7 7u83 53 
 
2 7u83 54 
        (4) DERA gives no warranty or assurance as to its
55 
        quality or suitability for any purpose and DERA accepts
56 
        no liability whatsoever in relation to any use to which
57 
        it may be put.
58 
*/
59 
 
60 
 
61 
#include "config.h"
62 
#include "char.h"
63 
#include "error.h"
64 
#include "lex.h"
65 
#include "output.h"
66 
#include "syntax.h"
67 
 
68 
 
69 
/*
70 
    MAIN ROUTINE
71 
 
72 
    This is the main routine.  It processes the command-line options,
73 
    reads the input file, and writes the output files.
74 
*/
75 
 
7 7u83 76 
int
77 
main(int argc, char **argv)
2 7u83 78 
{
7 7u83 79 
    int a;
80 
    int key = 0;
81 
    int too_many = 0;
82 
    char *input = NULL;
83 
    char *output = NULL;
2 7u83 84 
 
85 
    /* Process arguments */
7 7u83 86 
    set_progname(argv [0], "1.2");
87 
    for (a = 1; a < argc; a++) {
88 
	char *arg = argv [a];
89 
	if (arg [0] == '-' && arg [1]) {
90 
	    int known = 0;
91 
	    switch (arg [1]) {
92 
		case 'k': {
93 
		    if (arg [2])break;
94 
		    key = 1;
95 
		    known = 1;
96 
		    break;
2 7u83 97 
		}
7 7u83 98 
		case 'l': {
99 
		    sid_prefix = arg + 2;
100 
		    known = 1;
101 
		    break;
2 7u83 102 
		}
7 7u83 103 
		case 'v': {
104 
		    if (arg [2])break;
105 
		    report_version();
106 
		    known = 1;
107 
		    break;
2 7u83 108 
		}
109 
	    }
7 7u83 110 
	    if (!known) {
111 
		error(ERROR_WARNING, "Unknown option, '%s'", arg);
2 7u83 112 
	    }
113 
	} else {
7 7u83 114 
	    if (input == NULL) {
115 
		input = arg;
116 
	    } else if (output == NULL) {
117 
		output = arg;
2 7u83 118 
	    } else {
7 7u83 119 
		too_many = 1;
2 7u83 120 
	    }
121 
	}
122 
    }
123 
 
124 
    /* Check arguments */
7 7u83 125 
    if (input == NULL)error(ERROR_FATAL, "Not enough arguments");
126 
    if (too_many)error(ERROR_WARNING, "Too many arguments");
2 7u83 127 
 
128 
    /* Process input file */
7 7u83 129 
    process_file(input);
2 7u83 130 
 
131 
    /* Generate output */
7 7u83 132 
    if (exit_status == EXIT_SUCCESS) {
133 
	if (white_space == NULL)white_space = make_string(" \t\n");
134 
	if (output == NULL || streq(output, "-")) {
135 
	    lex_output = stdout;
136 
	    output = NULL;
2 7u83 137 
	} else {
7 7u83 138 
	    lex_output = fopen(output, "w");
139 
	    if (lex_output == NULL) {
140 
		error(ERROR_FATAL, "Can't open output file, %s", output);
2 7u83 141 
	    }
142 
	}
7 7u83 143 
	if (key) {
144 
	    output_keyword();
2 7u83 145 
	} else {
7 7u83 146 
	    output_all();
2 7u83 147 
	}
7 7u83 148 
	if (output)fclose_v(lex_output);
2 7u83 149 
    } else {
7 7u83 150 
	error(ERROR_FATAL, "Terminating due to previous errors");
2 7u83 151 
    }
7 7u83 152 
    return(exit_status);
2 7u83 153 
}