opts.c 5.36 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
/* Command line option handling.
   Copyright (C) 2002, 2003 Free Software Foundation, Inc.
   Contributed by Neil Booth.

This file is part of GCC.

GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2, or (at your option) any later
version.

GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING.  If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA.  */

#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
#include "langhooks.h"
#include "opts.h"

30
static size_t find_opt (const char *, int);
31 32 33 34 35 36 37 38 39 40 41 42

/* Perform a binary search to find which option the command-line INPUT
   matches.  Returns its index in the option array, and N_OPTS on
   failure.

   Complications arise since some options can be suffixed with an
   argument, and multiple complete matches can occur, e.g. -pedantic
   and -pedantic-errors.  Also, some options are only accepted by some
   languages.  If a switch matches for a different language and
   doesn't match any alternatives for the true front end, the index of
   the matched switch is returned anyway.  The caller should check for
   this case.  */
43
static size_t
44 45 46 47
find_opt (const char *input, int lang_mask)
{
  size_t md, mn, mx;
  size_t opt_len;
48
  size_t result = cl_options_count;
49 50 51
  int comp;

  mn = 0;
52
  mx = cl_options_count;
53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85

  while (mx > mn)
    {
      md = (mn + mx) / 2;

      opt_len = cl_options[md].opt_len;
      comp = strncmp (input, cl_options[md].opt_text, opt_len);

      if (comp < 0)
	mx = md;
      else if (comp > 0)
	mn = md + 1;
      else
	{
	  /* The switch matches.  It it an exact match?  */
	  if (input[opt_len] == '\0')
	    return md;
	  else
	    {
	      mn = md + 1;

	      /* If the switch takes no arguments this is not a proper
		 match, so we continue the search (e.g. input="stdc++"
		 match was "stdc").  */
	      if (!(cl_options[md].flags & CL_JOINED))
		continue;

	      /* Is this switch valid for this front end?  */
	      if (!(cl_options[md].flags & lang_mask))
		{
		  /* If subsequently we don't find a better match,
		     return this and let the caller report it as a bad
		     match.  */
86
		  result = md;
87 88 89 90 91 92 93 94 95 96 97 98
		  continue;
		}

	      /* Two scenarios remain: we have the switch's argument,
		 or we match a longer option.  This can happen with
		 -iwithprefix and -withprefixbefore.  The longest
		 possible option match succeeds.

		 Scan forwards, and return an exact match.  Otherwise
		 return the longest valid option-accepting match (mx).
		 This loops at most twice with current options.  */
	      mx = md;
99
	      for (md = md + 1; md < cl_options_count; md++)
100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120
		{
		  opt_len = cl_options[md].opt_len;
		  if (strncmp (input, cl_options[md].opt_text, opt_len))
		    break;
		  if (input[opt_len] == '\0')
		    return md;
		  if (cl_options[md].flags & lang_mask
		      && cl_options[md].flags & CL_JOINED)
		    mx = md;
		}

	      return mx;
	    }
	}
    }

  return result;
}

/* Handle the switch beginning at ARGV, with ARGC remaining.  */
int
121
handle_option (int argc ATTRIBUTE_UNUSED, char **argv, int lang_mask)
122 123 124 125 126 127 128 129 130 131 132 133 134
{
  size_t opt_index;
  const char *opt, *arg = 0;
  char *dup = 0;
  bool on = true;
  int result = 0, temp;
  const struct cl_option *option;

  opt = argv[0];

  /* Interpret "-" or a non-switch as a file name.  */
  if (opt[0] != '-' || opt[1] == '\0')
    {
135
      opt_index = cl_options_count;
136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156
      arg = opt;
      result = 1;
    }
  else
    {
      /* Drop the "no-" from negative switches.  */
      if ((opt[1] == 'W' || opt[1] == 'f')
	  && opt[2] == 'n' && opt[3] == 'o' && opt[4] == '-')
	{
	  size_t len = strlen (opt) - 3;

	  dup = xmalloc (len + 1);
	  dup[0] = '-';
	  dup[1] = opt[1];
	  memcpy (dup + 2, opt + 5, len - 2 + 1);
	  opt = dup;
	  on = false;
	}

      /* Skip over '-'.  */
      opt_index = find_opt (opt + 1, lang_mask);
157
      if (opt_index == cl_options_count)
158 159 160 161 162 163 164 165
	goto done;

      option = &cl_options[opt_index];

      /* Reject negative form of switches that don't take negatives.  */
      if (!on && (option->flags & CL_REJECT_NEGATIVE))
	goto done;

166
      /* We've recognized this switch.  */
167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204
      result = 1;

      /* Sort out any argument the switch takes.  */
      if (option->flags & (CL_JOINED | CL_SEPARATE))
	{
	  if (option->flags & CL_JOINED)
	    {
	      /* Have arg point to the original switch.  This is because
		 some code, such as disable_builtin_function, expects its
		 argument to be persistent until the program exits.  */
	      arg = argv[0] + cl_options[opt_index].opt_len + 1;
	      if (!on)
		arg += strlen ("no-");
	    }

	  /* If we don't have an argument, and CL_SEPARATE, try the next
	     argument in the vector.  */
	  if (!arg || (*arg == '\0' && option->flags & CL_SEPARATE))
	    {
	      arg = argv[1];
	      result = 2;
	    }

	  /* Canonicalize missing arguments as NULL for the handler.  */
	  if (*arg == '\0')
	    arg = NULL;
	}
    }

  temp = (*lang_hooks.handle_option) (opt_index, arg, on);
  if (temp <= 0)
    result = temp;

 done:
  if (dup)
    free (dup);
  return result;
}