gopt.c 12.5 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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 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 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114
/*
 *  Copyright (c) 2016 Cable Television Laboratories, Inc. (CableLabs)
 *                     and others.  All rights reserved.
 *
 *  Licensed under the Apache License, Version 2.0 (the License);
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at:
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an AS IS BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
 
 

/*
 *  Copyright (c) 2016 Cable Television Laboratories, Inc. (CableLabs)
 *                     and others.  All rights reserved.
 *
 *  Licensed under the Apache License, Version 2.0 (the License);
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at:
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an AS IS BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
 
 

/*
 *  Copyright (c) 2016 Cable Television Laboratories, Inc. (CableLabs)
 *                     and others.  All rights reserved.
 *
 *  Licensed under the Apache License, Version 2.0 (the License);
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at:
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an AS IS BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
 
 

/*
 *  Copyright (c) 2016 Cable Television Laboratories, Inc. (CableLabs)
 *                     and others.  All rights reserved.
 *
 *  Licensed under the Apache License, Version 2.0 (the License);
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at:
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an AS IS BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
 
 

/*
 *  Copyright (c) 2016 Cable Television Laboratories, Inc. (CableLabs)
 *                     and others.  All rights reserved.
 *
 *  Licensed under the Apache License, Version 2.0 (the License);
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at:
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an AS IS BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
 
 

/*
 *  Copyright (c) 2016 Cable Television Laboratories, Inc. (CableLabs)
 *                     and others.  All rights reserved.
 *
 *  Licensed under the Apache License, Version 2.0 (the License);
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at:
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an AS IS BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */
 
 

Mufaddal Makati's avatar
Mufaddal Makati committed
115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 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 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379
/* gopt.c version 8.1: tom.viza@gmail.com PUBLIC DOMAIN 2003-8 */
/*
I, Tom Vajzovic, am the author of this software and its documentation and
permanently abandon all copyright and other intellectual property rights in
them, including the right to be identified as the author.

I am fairly certain that this software does what the documentation says it
does, but I cannot guarantee that it does, or that it does what you think it
should, and I cannot guarantee that it will not have undesirable side effects.

You are free to use, modify and distribute this software as you please, but
you do so at your own risk.  If you remove or hide this warning then you are
responsible for any problems encountered by people that you make the software
available to.

Before modifying or distributing this software I ask that you would please
read http://www.purposeful.co.uk/tfl/
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "gopt.h"

#ifdef USE_SYSEXITS
#include <sysexits.h>
#else
#define EX_OSERR EXIT_FAILURE
#define EX_USAGE EXIT_FAILURE
#endif

struct opt_spec_s {
  int key;
  int flags;
  const char *shorts;
  const char* const *longs;
};
typedef struct opt_spec_s opt_spec_t;

struct opt_s {
  int key;
  const char *arg;
};
typedef struct opt_s opt_t;

void *gopt_sort( int *argc, const char **argv, const void *opt_specs ){
  void *opts;
  {{{
    const char* const *arg_p= argv + 1;
    size_t opt_count= 1;
    for( ; *arg_p; ++arg_p )
      if( '-' == (*arg_p)[0] && (*arg_p)[1] )
        if( '-' == (*arg_p)[1] )
          if( (*arg_p)[2] )
            ++opt_count;
          else
            break;
        else {
          const opt_spec_t *opt_spec_p= opt_specs;
          for( ; opt_spec_p-> key; ++opt_spec_p )
            if( strchr( opt_spec_p-> shorts, (*arg_p)[1] )){
              opt_count+= opt_spec_p-> flags & GOPT_ARG ? 1 : strlen( (*arg_p) + 1 );
              break;
            }
        }
    opts= malloc( opt_count * sizeof(opt_t) );
  }}}
  {
    const char **arg_p= argv + 1;
    const char **next_operand= arg_p;
    opt_t *next_option= opts;

    if( ! opts ){
      perror( argv[0] );
      exit( EX_OSERR );
    }  
    for( ; *arg_p; ++arg_p )
      if( '-' == (*arg_p)[0] && (*arg_p)[1] )
        if( '-' == (*arg_p)[1] )
          if( (*arg_p)[2] )
          {{{
            const opt_spec_t *opt_spec_p= opt_specs;
            const char* const *longs= opt_spec_p-> longs;
            next_option-> key= 0;
            while( *longs ){
              const char *option_cp= (*arg_p) + 2;
              const char *name_cp= *longs;
              while( *option_cp && *option_cp == *name_cp ){
                ++option_cp;
                ++name_cp;
              }
              if( '=' == *option_cp || !*option_cp ){
                if( *name_cp ){
                  if( next_option-> key ){
                    fprintf( stderr, "%s: --%.*s: abbreviated option is ambiguous\n", argv[0], (int)( option_cp -( (*arg_p) + 2 )), (*arg_p) + 2 );
                    free( opts );
                    exit( EX_USAGE );
                  }
                  next_option-> key= opt_spec_p-> key;
                }
                else {
                  next_option-> key= opt_spec_p-> key;
                  goto found_long;
                }
              }
              if( !*++longs ){
                ++opt_spec_p;
                if( opt_spec_p-> key )
                  longs= opt_spec_p-> longs;
              }
            }
            if( ! next_option-> key ){
              fprintf( stderr, "%s: --%.*s: unknown option\n", argv[0], (int)strcspn( (*arg_p) + 2, "=" ), (*arg_p) + 2 );
              free( opts );
              exit( EX_USAGE );              
            }
            for( opt_spec_p= opt_specs; opt_spec_p-> key != next_option-> key; ++opt_spec_p );
            found_long:
            
            if( !( opt_spec_p-> flags & GOPT_REPEAT )){
              const opt_t *opt_p= opts;
              for( ; opt_p != next_option; ++opt_p )
                if( opt_p-> key == opt_spec_p-> key ){
                  fprintf( stderr, "%s: --%.*s: option may not be repeated (in any long or short form)\n", argv[0], (int)strcspn( (*arg_p) + 2, "=" ), (*arg_p) + 2 );
                  free( opts );
                  exit( EX_USAGE );
                }
            }
            if( opt_spec_p-> flags & GOPT_ARG ){
              next_option-> arg= strchr( (*arg_p) + 2, '=' ) + 1;
              if( (char*)0 + 1 == next_option-> arg ){
                ++arg_p;
                if( !*arg_p || '-' == (*arg_p)[0] && (*arg_p)[1] ){
                  fprintf( stderr, "%s: --%s: option requires an option argument\n", argv[0], (*(arg_p-1)) + 2 );
                  free( opts );
                  exit( EX_USAGE );
                }
                next_option-> arg= *arg_p;
              }
            }
            else {
              if( strchr( (*arg_p) + 2, '=' )){
                fprintf( stderr, "%s: --%.*s: option may not take an option argument\n", argv[0], (int)strcspn( (*arg_p) + 2, "=" ), (*arg_p) + 2 );
                free( opts );
                exit( EX_USAGE );
              }
              next_option-> arg= NULL;
            }
            ++next_option;
          }}}
          else {
            for( ++arg_p; *arg_p; ++arg_p )
              *next_operand++= *arg_p;
            break;
          }
        else
        {{{
          const char *short_opt= (*arg_p) + 1;
          for( ;*short_opt; ++short_opt ){
            const opt_spec_t *opt_spec_p= opt_specs;
            
            for( ; opt_spec_p-> key; ++opt_spec_p )
              if( strchr( opt_spec_p-> shorts, *short_opt )){
                if( !( opt_spec_p-> flags & GOPT_REPEAT )){
                  const opt_t *opt_p= opts;
                  for( ; opt_p != next_option; ++opt_p )
                    if( opt_p-> key == opt_spec_p-> key ){
                      fprintf( stderr, "%s: -%c: option may not be repeated (in any long or short form)\n", argv[0], *short_opt );
                      free( opts );
                      exit( EX_USAGE );
                    }
                }
                next_option-> key= opt_spec_p-> key;

                if( opt_spec_p-> flags & GOPT_ARG ){
                  if( short_opt[1] )
                    next_option-> arg= short_opt + 1;
                  
                  else {
                    ++arg_p;
                    if( !*arg_p || '-' == (*arg_p)[0] && (*arg_p)[1] ){
                      fprintf( stderr, "%s: -%c: option requires an option argument\n", argv[0], *short_opt );
                      free( opts );
                      exit( EX_USAGE );
                    }
                    next_option-> arg= *arg_p;
                  }
                  ++next_option;
                  goto break_2;
                }
                next_option-> arg= NULL;
                ++next_option;
                goto continue_2;
              }
            fprintf( stderr, "%s: -%c: unknown option\n", argv[0], *short_opt );
            free( opts );
            exit( EX_USAGE );
            continue_2: 0;
          }
          break_2: 0;
        }}}
      else
        *next_operand++= *arg_p;

    next_option-> key= 0;
    *next_operand= NULL;
    *argc= next_operand - argv;
  }
  return opts;
}

size_t gopt( const void *vptr_opts, int key ){
  const opt_t *opts= vptr_opts;
  size_t count= 0;
  for( ; opts-> key; ++opts )
    count+= opts-> key == key;

  return count;
}

size_t gopt_arg( const void *vptr_opts, int key, const char **arg ){
  const opt_t *opts= vptr_opts;
  size_t count= 0;
 
  for( ; opts-> key; ++opts )
    if( opts-> key == key ){
      if( ! count )
        *arg= opts-> arg;
      ++count;
    }
  return count;
}

const char *gopt_arg_i( const void *vptr_opts, int key, size_t i ){
  const opt_t *opts= vptr_opts;
  
  for( ; opts-> key; ++opts )
    if( opts-> key == key ){
      if( ! i )
        return opts-> arg;      
      --i;
    }
  return NULL;
}

size_t gopt_args( const void *vptr_opts, int key, const char **args, size_t args_len ){
  const char **args_stop= args + args_len;
  const char **args_ptr= args;
  const opt_t *opts= vptr_opts;

  for( ; opts-> key; ++opts )
    if( opts-> key == key ){
      if( args_stop == args_ptr )
        return args_len + gopt( opts, key );
      
      *args_ptr++= opts-> arg;
    }
  if( args_stop != args_ptr )
    *args_ptr= NULL;
  return args_ptr - args;
}

void gopt_free( void *vptr_opts ){
  free( vptr_opts );
}