Logo Search packages:      
Sourcecode: wireshark version File versions  Download package

radius_dict.c

#line 2 "radius_dict.c"

#line 4 "radius_dict.c"

#define  YY_INT_ALIGNED short int

/* A lexical scanner generated by flex */

#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#define YY_FLEX_SUBMINOR_VERSION 31
#if YY_FLEX_SUBMINOR_VERSION > 0
#define FLEX_BETA
#endif

/* First, we deal with  platform-specific or compiler-specific issues. */

/* begin standard C headers. */
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>

/* end standard C headers. */

/* flex integer type definitions */

#ifndef FLEXINT_H
#define FLEXINT_H

/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */

#if defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L
#include <inttypes.h>
typedef int8_t flex_int8_t;
typedef uint8_t flex_uint8_t;
typedef int16_t flex_int16_t;
typedef uint16_t flex_uint16_t;
typedef int32_t flex_int32_t;
typedef uint32_t flex_uint32_t;
#else
typedef signed char flex_int8_t;
typedef short int flex_int16_t;
typedef int flex_int32_t;
typedef unsigned char flex_uint8_t; 
typedef unsigned short int flex_uint16_t;
typedef unsigned int flex_uint32_t;
#endif /* ! C99 */

/* Limits of integral types. */
#ifndef INT8_MIN
#define INT8_MIN               (-128)
#endif
#ifndef INT16_MIN
#define INT16_MIN              (-32767-1)
#endif
#ifndef INT32_MIN
#define INT32_MIN              (-2147483647-1)
#endif
#ifndef INT8_MAX
#define INT8_MAX               (127)
#endif
#ifndef INT16_MAX
#define INT16_MAX              (32767)
#endif
#ifndef INT32_MAX
#define INT32_MAX              (2147483647)
#endif
#ifndef UINT8_MAX
#define UINT8_MAX              (255U)
#endif
#ifndef UINT16_MAX
#define UINT16_MAX             (65535U)
#endif
#ifndef UINT32_MAX
#define UINT32_MAX             (4294967295U)
#endif

#endif /* ! FLEXINT_H */

#ifdef __cplusplus

/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST

#else /* ! __cplusplus */

#if __STDC__

#define YY_USE_CONST

#endif      /* __STDC__ */
#endif      /* ! __cplusplus */

#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif

/* Returned upon end-of-file. */
#define YY_NULL 0

/* Promotes a possibly negative, possibly signed char to an unsigned
 * integer for use as an array index.  If the signed char is negative,
 * we want to instead treat it as an 8-bit unsigned char, hence the
 * double cast.
 */
#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)

/* Enter a start condition.  This macro really ought to take a parameter,
 * but we do it the disgusting crufty way forced on us by the ()-less
 * definition of BEGIN.
 */
#define BEGIN (yy_start) = 1 + 2 *

/* Translate the current start state into a value that can be later handed
 * to BEGIN to return to the state.  The YYSTATE alias is for lex
 * compatibility.
 */
#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START

/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)

/* Special action meaning "start processing a new file". */
#define YY_NEW_FILE Radiusrestart(Radiusin  )

#define YY_END_OF_BUFFER_CHAR 0

/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#define YY_BUF_SIZE 16384
#endif

#ifndef YY_TYPEDEF_YY_BUFFER_STATE
#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
#endif

extern int Radiusleng;

extern FILE *Radiusin, *Radiusout;

#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2

    #define YY_LESS_LINENO(n)
    
/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
      do \
            { \
            /* Undo effects of setting up Radiustext. */ \
        int yyless_macro_arg = (n); \
        YY_LESS_LINENO(yyless_macro_arg);\
            *yy_cp = (yy_hold_char); \
            YY_RESTORE_YY_MORE_OFFSET \
            (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
            YY_DO_BEFORE_ACTION; /* set up Radiustext again */ \
            } \
      while ( 0 )

#define unput(c) yyunput( c, (yytext_ptr)  )

/* The following is because we cannot portably get our hands on size_t
 * (without autoconf's help, which isn't available because we want
 * flex-generated scanners to compile on their own).
 */

#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef unsigned int yy_size_t;
#endif

#ifndef YY_STRUCT_YY_BUFFER_STATE
#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
      {
      FILE *yy_input_file;

      char *yy_ch_buf;        /* input buffer */
      char *yy_buf_pos;       /* current position in input buffer */

      /* Size of input buffer in bytes, not including room for EOB
       * characters.
       */
      yy_size_t yy_buf_size;

      /* Number of characters read into yy_ch_buf, not including EOB
       * characters.
       */
      int yy_n_chars;

      /* Whether we "own" the buffer - i.e., we know we created it,
       * and can realloc() it to grow it, and should free() it to
       * delete it.
       */
      int yy_is_our_buffer;

      /* Whether this is an "interactive" input source; if so, and
       * if we're using stdio for input, then we want to use getc()
       * instead of fread(), to make sure we stop fetching input after
       * each newline.
       */
      int yy_is_interactive;

      /* Whether we're considered to be at the beginning of a line.
       * If so, '^' rules will be active on the next match, otherwise
       * not.
       */
      int yy_at_bol;

    int yy_bs_lineno; /**< The line count. */
    int yy_bs_column; /**< The column count. */
    
      /* Whether to try to fill the input buffer when we reach the
       * end of it.
       */
      int yy_fill_buffer;

      int yy_buffer_status;

#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
      /* When an EOF's been seen but there's still some text to process
       * then we mark the buffer as YY_EOF_PENDING, to indicate that we
       * shouldn't try reading from the input source any more.  We might
       * still have a bunch of tokens to match, though, because of
       * possible backing-up.
       *
       * When we actually see the EOF, we change the status to "new"
       * (via Radiusrestart()), so that the user can continue scanning by
       * just pointing Radiusin at a new input file.
       */
#define YY_BUFFER_EOF_PENDING 2

      };
#endif /* !YY_STRUCT_YY_BUFFER_STATE */

/* Stack of input buffers. */
static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */

/* We provide macros for accessing buffer states in case in the
 * future we want to put the buffer states in a more general
 * "scanner state".
 *
 * Returns the top of the stack, or NULL.
 */
#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
                          ? (yy_buffer_stack)[(yy_buffer_stack_top)] \
                          : NULL)

/* Same as previous macro, but useful when we know that the buffer stack is not
 * NULL or when we need an lvalue. For internal use only.
 */
#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]

/* yy_hold_char holds the character lost when Radiustext is formed. */
static char yy_hold_char;
static int yy_n_chars;        /* number of characters read into yy_ch_buf */
int Radiusleng;

/* Points to current character in buffer. */
static char *yy_c_buf_p = (char *) 0;
static int yy_init = 1;       /* whether we need to initialize */
static int yy_start = 0;      /* start state number */

/* Flag which is used to allow Radiuswrap()'s to do buffer switches
 * instead of setting up a fresh Radiusin.  A bit of a hack ...
 */
static int yy_did_buffer_switch_on_eof;

void Radiusrestart (FILE *input_file  );
void Radius_switch_to_buffer (YY_BUFFER_STATE new_buffer  );
YY_BUFFER_STATE Radius_create_buffer (FILE *file,int size  );
void Radius_delete_buffer (YY_BUFFER_STATE b  );
void Radius_flush_buffer (YY_BUFFER_STATE b  );
void Radiuspush_buffer_state (YY_BUFFER_STATE new_buffer  );
void Radiuspop_buffer_state (void );

static void Radiusensure_buffer_stack (void );
static void Radius_load_buffer_state (void );
static void Radius_init_buffer (YY_BUFFER_STATE b,FILE *file  );

#define YY_FLUSH_BUFFER Radius_flush_buffer(YY_CURRENT_BUFFER )

YY_BUFFER_STATE Radius_scan_buffer (char *base,yy_size_t size  );
YY_BUFFER_STATE Radius_scan_string (yyconst char *yy_str  );
YY_BUFFER_STATE Radius_scan_bytes (yyconst char *bytes,int len  );

void *Radiusalloc (yy_size_t  );
void *Radiusrealloc (void *,yy_size_t  );
void Radiusfree (void *  );

#define yy_new_buffer Radius_create_buffer

#define yy_set_interactive(is_interactive) \
      { \
      if ( ! YY_CURRENT_BUFFER ){ \
        Radiusensure_buffer_stack (); \
            YY_CURRENT_BUFFER_LVALUE =    \
            Radius_create_buffer(Radiusin,YY_BUF_SIZE ); \
      } \
      YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
      }

#define yy_set_bol(at_bol) \
      { \
      if ( ! YY_CURRENT_BUFFER ){\
        Radiusensure_buffer_stack (); \
            YY_CURRENT_BUFFER_LVALUE =    \
            Radius_create_buffer(Radiusin,YY_BUF_SIZE ); \
      } \
      YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
      }

#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)

/* Begin user sect3 */

#define Radiuswrap() 1
#define YY_SKIP_YYWRAP

typedef unsigned char YY_CHAR;

FILE *Radiusin = (FILE *) 0, *Radiusout = (FILE *) 0;

typedef int yy_state_type;

extern int Radiuslineno;

int Radiuslineno = 1;

extern char *Radiustext;
#define yytext_ptr Radiustext

static yy_state_type yy_get_previous_state (void );
static yy_state_type yy_try_NUL_trans (yy_state_type current_state  );
static int yy_get_next_buffer (void );
static void yy_fatal_error (yyconst char msg[]  );

/* Done after the current pattern has been matched and before the
 * corresponding action - sets up Radiustext.
 */
#define YY_DO_BEFORE_ACTION \
      (yytext_ptr) = yy_bp; \
      Radiusleng = (size_t) (yy_cp - yy_bp); \
      (yy_hold_char) = *yy_cp; \
      *yy_cp = '\0'; \
      (yy_c_buf_p) = yy_cp;

#define YY_NUM_RULES 39
#define YY_END_OF_BUFFER 40
/* This struct is not used in this scanner,
   but its presence is necessary. */
struct yy_trans_info
      {
      flex_int32_t yy_verify;
      flex_int32_t yy_nxt;
      };
static yyconst flex_int16_t yy_accept[211] =
    {   0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
       11,   11,   40,   39,   38,    2,    1,   39,    1,    1,
       39,   39,   12,    1,   13,   13,   15,    1,   16,   16,
       26,    1,   26,   26,   26,   26,   31,   30,    1,   30,
       30,   32,   33,    1,   34,   34,    2,    1,   35,   35,
       37,    2,    1,   39,    2,    1,   39,   10,    1,   11,
        2,    1,    2,    0,    0,    0,    0,    0,    0,   12,
       13,    0,   15,   16,    0,   26,   26,   26,   26,   26,

       26,   26,   30,   29,   30,   30,   33,   34,    2,   35,
        0,   37,    2,    0,    0,    2,    2,    3,   10,   11,
        2,    0,    0,    0,    0,    0,    0,   14,   17,   26,
       26,   26,   26,   26,   26,   26,   26,   29,   30,   30,
       36,    2,    0,    0,    0,    0,    0,    0,   24,   25,
       26,   26,   26,   26,   26,   26,   30,   30,    0,    0,
        0,    0,    6,    0,   26,   26,   26,   26,   26,   26,
       30,   30,    0,    0,    0,    0,    4,   26,   21,   26,
       23,   20,   19,   30,   30,    0,    0,    0,    0,   18,
       26,   30,   27,    7,    0,    0,    0,   22,   29,   27,

        5,    0,    0,   28,    0,    9,   28,    0,    8,    0
    } ;

static yyconst flex_int32_t yy_ec[256] =
    {   0,
        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    2,    1,    1,    4,    5,    1,    1,    1,    1,
        1,    1,    1,    6,    7,    1,    8,    9,   10,   11,
       11,   11,   11,   12,   11,   11,   11,   13,    1,    1,
       14,    1,    1,    1,   16,   17,   18,   19,   20,   21,
       22,   23,   24,   25,   26,   27,   25,   28,   29,   30,
       31,   32,   33,   34,   35,   36,   25,   37,   38,   25,
        1,    1,    1,    1,   15,    1,   16,   17,   18,   19,

       20,   21,   22,   23,   24,   25,   26,   27,   25,   28,
       29,   30,   31,   32,   33,   34,   35,   36,   25,   37,
       38,   25,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,

        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
        1,    1,    1,    1,    1
    } ;

static yyconst flex_int32_t yy_meta[39] =
    {   0,
        1,    2,    3,    1,    1,    1,    4,    5,    6,    6,
        6,    6,    1,    7,    4,    6,    6,    6,    6,    6,
        6,    4,    4,    4,    4,    4,    4,    4,    4,    4,
        4,    4,    4,    4,    4,    4,    4,    4
    } ;

static yyconst flex_int16_t yy_base[239] =
    {   0,
        0,   26,    2,    4,   54,   82,   22,   35,  110,  138,
       39,   54,  166,    0,  204,    0,  423,  422,  242,  270,
      297,  324,   63,   67,  351,  378,  404,  433,  464,  492,
      518,  544,  424,  725,  725,    0,  725,  399,  388,  399,
      390,   21,    0,    0,   82,   91,    0,    0,   95,  119,
        0,    0,  400,  128,  397,  380,  725,  399,  398,  106,
        9,  725,    0,    0,    0,    0,    3,    0,  240,  136,
        0,  409,    0,  379,  378,  372,   90,    0,    0,    0,
        0,    0,    0,  374,  367,  378,  380,  371,  369,    0,
      150,    0,    0,  251,    0,    0,  362,  369,  358,  266,

      356,  357,  374,    0,  139,  252,    0,    0,    8,  269,
        0,    0,  385,  355,   94,  354,  226,  353,    0,    0,
        0,  365,  344,  351,  367,  338,  353,    0,    0,  351,
      351,  349,  347,  353,  335,  342,  337,    0,  103,    0,
        0,  329,  332,  334,  329,  320,  329,  319,    0,    0,
      325,  327,  329,  324,  309,  314,  250,   55,  304,  321,
      329,  315,  725,  302,  313,  300,  312,  296,  296,  300,
      275,  251,  302,  285,  283,  290,  725,  285,    0,  297,
        0,    0,    0,  277,  290,  289,  274,  286,  276,    0,
      262,  279,  301,  725,  272,  262,  224,    0,  153,  725,

      725,  131,  101,   91,   32,  725,    0,    4,  725,  725,
      572,  579,  586,  593,  600,  607,  614,  621,  628,  635,
      639,  642,  645,  648,  652,  658,  665,  672,  679,  686,
      693,  697,  703,  710,   29,    6,  717,    2
    } ;

static yyconst flex_int16_t yy_def[239] =
    {   0,
      211,  211,    2,    2,  212,  212,    2,    2,  213,  213,
        2,    2,  210,   13,  210,   15,    2,    2,  214,  214,
      215,  215,    2,    2,  216,  216,  217,  217,  218,  218,
      219,  219,  210,  210,  210,  220,  210,  210,  210,  210,
      210,  210,  221,  221,  210,  210,  222,  222,  210,  210,
      223,  223,  223,  223,  223,  223,  210,  224,  224,  224,
      224,  210,  225,  225,  226,  226,  227,  226,  210,  210,
      228,  229,  228,  230,  231,  230,  230,  232,  232,  233,
      234,  233,  220,  210,  210,  210,  210,  210,  210,  221,
      210,  235,  222,  210,  236,  223,  223,  223,  223,  223,

      223,  223,  224,  237,  224,  224,  225,  226,  227,  210,
      238,  228,  229,  230,  230,  231,  231,  230,  232,  233,
      234,  210,  210,  210,  210,  210,  210,  235,  236,  223,
      223,  223,  223,  223,  223,  223,  223,  237,  224,  224,
      238,  231,  210,  210,  210,  210,  210,  210,  223,  223,
      223,  223,  223,  223,  223,  223,  224,  224,  210,  210,
      210,  210,  210,  210,  223,  223,  223,  223,  223,  223,
      224,  224,  210,  210,  210,  210,  210,  223,  223,  223,
      223,  223,  223,  224,  224,  210,  210,  210,  210,  223,
      223,  224,  224,  210,  210,  210,  210,  223,  237,  210,

      210,  210,  210,  237,  210,  210,  237,  210,  210,    0,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210
    } ;

static yyconst flex_int16_t yy_nxt[764] =
    {   0,
      210,  210,   35,   36,   83,  108,   38,  141,   38,   83,
      108,  129,   37,  104,  158,   37,   37,   39,   40,   39,
       40,   41,  104,   41,  106,   37,   37,   37,   35,   36,
       45,   46,   46,   46,  128,  209,   88,   42,   37,   42,
       89,   37,   37,   45,   46,   46,   46,   49,   50,   50,
       50,   37,   37,   37,   34,   34,   35,   36,   34,   34,
      208,   34,   49,   50,   50,   50,   37,   34,  104,   44,
       44,   69,   70,   70,   70,   69,   70,   70,   70,   44,
       44,   44,   34,   34,   35,   36,   34,   34,  172,   34,
       91,   91,   91,   91,   37,   34,  207,   44,   44,   91,

       91,   91,   91,   94,   94,   94,   94,   44,   44,   44,
       34,   34,   35,   36,   34,   34,  104,  118,   92,  104,
      115,  118,   37,   34,  115,   48,   48,   94,   94,   94,
       94,   95,  206,  105,  157,   48,   48,   48,   34,   34,
       35,   36,   34,   34,  110,  110,  110,  110,   98,  205,
       37,   34,  104,   48,   48,   99,  139,  100,   91,   91,
       91,   91,  204,   48,   48,   48,   34,   34,   35,   36,
       34,   34,   51,   34,   51,   51,   51,   51,   37,   34,
       51,   52,   52,   51,   53,   51,   51,   51,   51,   54,
       51,   52,   52,   52,   55,   51,   51,   51,   56,   51,

       51,   51,   51,   51,   34,   34,   57,   36,   34,   34,
       58,   34,   58,   58,   58,   58,   37,   34,   58,   59,
       59,   58,   58,   60,   58,   58,   61,   58,   58,   59,
       59,   59,   58,   58,   58,   58,   58,   58,   58,   58,
       58,   58,   34,   34,   35,   36,   34,   34,  110,  110,
      110,  110,  203,  142,   37,   34,  117,   64,   64,   94,
       94,   94,   94,  104,  104,  104,  185,   64,   64,   64,
       34,   34,   35,   36,   34,   34,  111,  110,  110,  110,
      110,  133,   37,   34,  140,   64,   64,  171,  104,  202,
      104,  201,  199,  198,  197,   64,   64,   64,   34,   66,

       67,  134,  135,  104,  184,  196,  200,  195,  194,   68,
      192,  193,   68,   68,  104,  191,  190,  189,  188,  187,
      186,  183,   68,   68,   68,   34,   66,   67,  182,  181,
      180,  179,  178,  177,  176,  175,   68,  174,  173,   68,
       68,  170,  169,  168,  167,  166,  165,  164,  163,   68,
       68,   68,   34,   35,   72,  162,  161,  160,  159,  117,
      156,  155,  154,   73,  153,  152,   73,   73,  151,  150,
      149,  148,  147,  146,  145,  144,   73,   73,   73,   34,
       35,   72,  143,  115,  117,  115,   83,  104,  137,  136,
       73,  132,  131,   73,   73,  130,  127,  126,  125,  124,

      123,  122,  115,   73,   73,   73,   35,   75,  117,  115,
       83,  104,  104,  102,  101,   97,   76,   87,   86,   76,
       76,   85,   84,  210,   62,   62,  210,  210,  210,   76,
       76,   76,  210,  210,   77,   35,   75,  210,  210,  210,
      210,  210,  210,  210,  210,   76,  210,  210,   76,   76,
      210,  210,  210,  210,  210,  210,  210,  210,   76,   76,
       76,  210,  210,   77,   34,   34,   35,   36,   34,   34,
      210,   34,  210,  210,  210,  210,   37,   34,  210,   79,
       79,  210,  210,  210,  210,  210,  210,  210,  210,   79,
       79,   79,   34,   34,   35,   36,   34,   34,  210,   34,

      210,  210,  210,  210,   37,   34,  210,   79,   79,  210,
      210,  210,  210,  210,  210,  210,  210,   79,   79,   79,
       35,   81,  210,  210,  210,  210,  210,  210,  210,  210,
       82,  210,  210,   82,   82,  210,  210,  210,  210,  210,
      210,  210,  210,   82,   82,   82,   35,   81,  210,  210,
      210,  210,  210,  210,  210,  210,   82,  210,  210,   82,
       82,  210,  210,  210,  210,  210,  210,  210,  210,   82,
       82,   82,   34,   34,   34,   34,   34,   34,   34,   43,
       43,   43,   43,   43,   43,   43,   47,   47,   47,   47,
       47,   47,   47,   63,   63,   63,   63,   63,   63,   63,

       65,   65,   65,   65,   65,   65,   65,   71,   71,   71,
       71,   71,   71,   71,   74,   74,   74,   74,   74,   74,
       74,   78,   78,   78,   78,   78,   78,   78,   80,   80,
       80,   80,   80,   80,   80,   83,   83,  210,   83,   83,
       83,   83,   90,  210,   90,   93,   93,   93,   96,  210,
       96,  103,  210,  103,  103,  107,  107,  107,  108,  210,
      108,  108,  108,  108,  108,  109,  109,  109,  109,  109,
      109,  109,  112,  210,  210,  112,  112,  112,  112,  113,
      113,  210,  113,  113,  113,  113,  114,  114,  210,  114,
      114,  114,  114,  116,  116,  210,  116,  116,  116,  116,

      119,  210,  119,  120,  120,  210,  120,  120,  120,  120,
      121,  121,  210,  121,  121,  121,  121,  138,  138,  210,
      138,  138,  138,  138,   33,  210,  210,  210,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  210,  210
    } ;

static yyconst flex_int16_t yy_chk[764] =
    {   0,
        0,    0,    1,    1,   67,   67,    3,  238,    4,  109,
      109,  236,    1,  140,  140,    1,    1,    3,    3,    4,
        4,    3,   61,    4,   61,    1,    1,    1,    2,    2,
        7,    7,    7,    7,  235,  208,   42,    3,    2,    4,
       42,    2,    2,    8,    8,    8,    8,   11,   11,   11,
       11,    2,    2,    2,    5,    5,    5,    5,    5,    5,
      205,    5,   12,   12,   12,   12,    5,    5,  158,    5,
        5,   23,   23,   23,   23,   24,   24,   24,   24,    5,
        5,    5,    6,    6,    6,    6,    6,    6,  158,    6,
       45,   45,   45,   45,    6,    6,  204,    6,    6,   46,

       46,   46,   46,   49,   49,   49,   49,    6,    6,    6,
        9,    9,    9,    9,    9,    9,  139,   77,   45,   60,
       77,  115,    9,    9,  115,    9,    9,   50,   50,   50,
       50,   49,  203,   60,  139,    9,    9,    9,   10,   10,
       10,   10,   10,   10,   70,   70,   70,   70,   54,  202,
       10,   10,  105,   10,   10,   54,  105,   54,   91,   91,
       91,   91,  199,   10,   10,   10,   13,   13,   13,   13,
       13,   13,   13,   13,   13,   13,   13,   13,   13,   13,
       13,   13,   13,   13,   13,   13,   13,   13,   13,   13,
       13,   13,   13,   13,   13,   13,   13,   13,   13,   13,

       13,   13,   13,   13,   15,   15,   15,   15,   15,   15,
       15,   15,   15,   15,   15,   15,   15,   15,   15,   15,
       15,   15,   15,   15,   15,   15,   15,   15,   15,   15,
       15,   15,   15,   15,   15,   15,   15,   15,   15,   15,
       15,   15,   19,   19,   19,   19,   19,   19,   69,   69,
       69,   69,  197,  117,   19,   19,  117,   19,   19,   94,
       94,   94,   94,  157,  172,  106,  172,   19,   19,   19,
       20,   20,   20,   20,   20,   20,   69,  110,  110,  110,
      110,  100,   20,   20,  106,   20,   20,  157,  171,  196,
      184,  195,  192,  191,  189,   20,   20,   20,   21,   21,

       21,  100,  100,  185,  171,  188,  193,  187,  186,   21,
      184,  185,   21,   21,  193,  180,  178,  176,  175,  174,
      173,  170,   21,   21,   21,   22,   22,   22,  169,  168,
      167,  166,  165,  164,  162,  161,   22,  160,  159,   22,
       22,  156,  155,  154,  153,  152,  151,  148,  147,   22,
       22,   22,   25,   25,   25,  146,  145,  144,  143,  142,
      137,  136,  135,   25,  134,  133,   25,   25,  132,  131,
      130,  127,  126,  125,  124,  123,   25,   25,   25,   26,
       26,   26,  122,  118,  116,  114,  113,  103,  102,  101,
       26,   99,   98,   26,   26,   97,   89,   88,   87,   86,

       85,   84,   76,   26,   26,   26,   27,   27,   75,   74,
       72,   59,   58,   56,   55,   53,   27,   41,   40,   27,
       27,   39,   38,   33,   18,   17,    0,    0,    0,   27,
       27,   27,    0,    0,   27,   28,   28,    0,    0,    0,
        0,    0,    0,    0,    0,   28,    0,    0,   28,   28,
        0,    0,    0,    0,    0,    0,    0,    0,   28,   28,
       28,    0,    0,   28,   29,   29,   29,   29,   29,   29,
        0,   29,    0,    0,    0,    0,   29,   29,    0,   29,
       29,    0,    0,    0,    0,    0,    0,    0,    0,   29,
       29,   29,   30,   30,   30,   30,   30,   30,    0,   30,

        0,    0,    0,    0,   30,   30,    0,   30,   30,    0,
        0,    0,    0,    0,    0,    0,    0,   30,   30,   30,
       31,   31,    0,    0,    0,    0,    0,    0,    0,    0,
       31,    0,    0,   31,   31,    0,    0,    0,    0,    0,
        0,    0,    0,   31,   31,   31,   32,   32,    0,    0,
        0,    0,    0,    0,    0,    0,   32,    0,    0,   32,
       32,    0,    0,    0,    0,    0,    0,    0,    0,   32,
       32,   32,  211,  211,  211,  211,  211,  211,  211,  212,
      212,  212,  212,  212,  212,  212,  213,  213,  213,  213,
      213,  213,  213,  214,  214,  214,  214,  214,  214,  214,

      215,  215,  215,  215,  215,  215,  215,  216,  216,  216,
      216,  216,  216,  216,  217,  217,  217,  217,  217,  217,
      217,  218,  218,  218,  218,  218,  218,  218,  219,  219,
      219,  219,  219,  219,  219,  220,  220,    0,  220,  220,
      220,  220,  221,    0,  221,  222,  222,  222,  223,    0,
      223,  224,    0,  224,  224,  225,  225,  225,  226,    0,
      226,  226,  226,  226,  226,  227,  227,  227,  227,  227,
      227,  227,  228,    0,    0,  228,  228,  228,  228,  229,
      229,    0,  229,  229,  229,  229,  230,  230,    0,  230,
      230,  230,  230,  231,  231,    0,  231,  231,  231,  231,

      232,    0,  232,  233,  233,    0,  233,  233,  233,  233,
      234,  234,    0,  234,  234,  234,  234,  237,  237,    0,
      237,  237,  237,  237,  210,  210,  210,  210,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  210,  210,  210,  210,  210,  210,  210,  210,  210,
      210,  210,  210
    } ;

static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;

extern int Radius_flex_debug;
int Radius_flex_debug = 0;

/* The intent behind this definition is that it'll catch
 * any uses of REJECT which flex missed.
 */
#define REJECT reject_used_but_not_detected
#define yymore() yymore_used_but_not_detected
#define YY_MORE_ADJ 0
#define YY_RESTORE_YY_MORE_OFFSET
char *Radiustext;
#line 1 "radius_dict.l"
#line 11 "radius_dict.l"
      /* radius_dict.l
      *
      * RADIUS dictionary parser
      *
      * $Id: radius_dict.l 18197 2006-05-21 05:12:17Z sahlberg $
      *
      * Wireshark - Network traffic analyzer
      * By Gerald Combs <gerald@wireshark.org>
      * Copyright 1998 Gerald Combs
      *
      * This program 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
      * of the License, or (at your option) any later version.
      *
      * This program 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 this program; if not, write to the Free Software
      * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
      *
      */
      
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
      
#include <glib.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <epan/packet.h>
#include <epan/dissectors/packet-radius.h>
#define DIR_SEPARATOR '/'
#define ECHO
#define MAX_INCLUDE_DEPTH 10

      void add_vendor(const gchar* name, guint32 vendor_id);
      void add_value(const gchar* attrib_name,const  gchar* value_repr, long value);
      void add_attribute(const gchar*,const  gchar*, radius_attr_dissector_t,const  gchar*, gboolean, gboolean);
      
      static YY_BUFFER_STATE include_stack[10];
      static int include_stack_ptr = 0;
      
      static radius_dictionary_t* dict = NULL;
      static GHashTable* value_strings = NULL; /* GArray(value_string) by attribute name */
      
      static gchar* attr_name = NULL;
      static gchar* attr_id = NULL;
      static radius_attr_dissector_t* attr_type = NULL;
      static gchar* attr_vendor = NULL;
      static gchar* vendor_name = NULL;
      static gchar* value_repr = NULL;
      static gboolean encrypted = FALSE;
      static gboolean has_tag = FALSE;
      static gchar* current_vendor = NULL;
      
      static GString* error = NULL;
      static gchar* directory = NULL;
      static int linenums[] = {1,1,1,1,1,1,1,1,1,1};
      static gchar* fullpaths[] = {NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL};
      

#line 754 "radius_dict.c"

#define INITIAL 0
#define OUT 1
#define VENDOR 2
#define VENDOR_W_NAME 3
#define ATTR 4
#define ATTR_W_NAME 5
#define ATTR_W_ID 6
#define ATTR_W_TYPE 7
#define ATTR_W_VENDOR 8
#define VALUE 9
#define VALUE_W_ATTR 10
#define VALUE_W_NAME 11
#define INCLUDE 12
#define JUNK 13
#define BEGIN_VENDOR 14
#define END_VENDOR 15

#ifndef YY_NO_UNISTD_H
/* Special case for "unistd.h", since it is non-ANSI. We include it way
 * down here because we want the user's section 1 to have been scanned first.
 * The user has a chance to override it with an option.
 */
#include <unistd.h>
#endif

#ifndef YY_EXTRA_TYPE
#define YY_EXTRA_TYPE void *
#endif

/* Macros after this point can all be overridden by user definitions in
 * section 1.
 */

#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int Radiuswrap (void );
#else
extern int Radiuswrap (void );
#endif
#endif

#ifndef yytext_ptr
static void yy_flex_strncpy (char *,yyconst char *,int );
#endif

#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * );
#endif

#ifndef YY_NO_INPUT

#ifdef __cplusplus
static int yyinput (void );
#else
static int input (void );
#endif

#endif

/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#define YY_READ_BUF_SIZE 8192
#endif

/* Copy whatever the last rule matched to the standard output. */
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
 * we now use fwrite().
 */
#define ECHO (void) fwrite( Radiustext, Radiusleng, 1, Radiusout )
#endif

/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
 * is returned in "result".
 */
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
      if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
            { \
            int c = '*'; \
            size_t n; \
            for ( n = 0; n < max_size && \
                       (c = getc( Radiusin )) != EOF && c != '\n'; ++n ) \
                  buf[n] = (char) c; \
            if ( c == '\n' ) \
                  buf[n++] = (char) c; \
            if ( c == EOF && ferror( Radiusin ) ) \
                  YY_FATAL_ERROR( "input in flex scanner failed" ); \
            result = n; \
            } \
      else \
            { \
            errno=0; \
            while ( (result = fread(buf, 1, max_size, Radiusin))==0 && ferror(Radiusin)) \
                  { \
                  if( errno != EINTR) \
                        { \
                        YY_FATAL_ERROR( "input in flex scanner failed" ); \
                        break; \
                        } \
                  errno=0; \
                  clearerr(Radiusin); \
                  } \
            }\
\

#endif

/* No semi-colon after return; correct usage is to write "yyterminate();" -
 * we don't want an extra ';' after the "return" because that will cause
 * some compilers to complain about unreachable statements.
 */
#ifndef yyterminate
#define yyterminate() return YY_NULL
#endif

/* Number of entries by which start-condition stack grows. */
#ifndef YY_START_STACK_INCR
#define YY_START_STACK_INCR 25
#endif

/* Report a fatal error. */
#ifndef YY_FATAL_ERROR
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif

/* end tables serialization structures and prototypes */

/* Default declaration of generated scanner - a define so the user can
 * easily add parameters.
 */
#ifndef YY_DECL
#define YY_DECL_IS_OURS 1

extern int Radiuslex (void);

#define YY_DECL int Radiuslex (void)
#endif /* !YY_DECL */

/* Code executed at the beginning of each rule, after Radiustext and Radiusleng
 * have been set up.
 */
#ifndef YY_USER_ACTION
#define YY_USER_ACTION
#endif

/* Code executed at the end of each rule. */
#ifndef YY_BREAK
#define YY_BREAK break;
#endif

#define YY_RULE_SETUP \
      YY_USER_ACTION

/** The main scanner function which does all the work.
 */
YY_DECL
{
      register yy_state_type yy_current_state;
      register char *yy_cp, *yy_bp;
      register int yy_act;
    
#line 80 "radius_dict.l"

#line 920 "radius_dict.c"

      if ( (yy_init) )
            {
            (yy_init) = 0;

#ifdef YY_USER_INIT
            YY_USER_INIT;
#endif

            if ( ! (yy_start) )
                  (yy_start) = 1;   /* first start state */

            if ( ! Radiusin )
                  Radiusin = stdin;

            if ( ! Radiusout )
                  Radiusout = stdout;

            if ( ! YY_CURRENT_BUFFER ) {
                  Radiusensure_buffer_stack ();
                  YY_CURRENT_BUFFER_LVALUE =
                        Radius_create_buffer(Radiusin,YY_BUF_SIZE );
            }

            Radius_load_buffer_state( );
            }

      while ( 1 )       /* loops until end-of-file is reached */
            {
            yy_cp = (yy_c_buf_p);

            /* Support of Radiustext. */
            *yy_cp = (yy_hold_char);

            /* yy_bp points to the position in yy_ch_buf of the start of
             * the current run.
             */
            yy_bp = yy_cp;

            yy_current_state = (yy_start);
yy_match:
            do
                  {
                  register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
                  if ( yy_accept[yy_current_state] )
                        {
                        (yy_last_accepting_state) = yy_current_state;
                        (yy_last_accepting_cpos) = yy_cp;
                        }
                  while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
                        {
                        yy_current_state = (int) yy_def[yy_current_state];
                        if ( yy_current_state >= 211 )
                              yy_c = yy_meta[(unsigned int) yy_c];
                        }
                  yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
                  ++yy_cp;
                  }
            while ( yy_current_state != 210 );
            yy_cp = (yy_last_accepting_cpos);
            yy_current_state = (yy_last_accepting_state);

yy_find_action:
            yy_act = yy_accept[yy_current_state];

            YY_DO_BEFORE_ACTION;

do_action:  /* This label is used only to access EOF actions. */

            switch ( yy_act )
      { /* beginning of action switch */
                  case 0: /* must back up */
                  /* undo the effects of YY_DO_BEFORE_ACTION */
                  *yy_cp = (yy_hold_char);
                  yy_cp = (yy_last_accepting_cpos);
                  yy_current_state = (yy_last_accepting_state);
                  goto yy_find_action;

case 1:
YY_RULE_SETUP
#line 81 "radius_dict.l"
;
      YY_BREAK
case 2:
YY_RULE_SETUP
#line 82 "radius_dict.l"
;
      YY_BREAK
case 3:
YY_RULE_SETUP
#line 84 "radius_dict.l"
;
      YY_BREAK
case 4:
YY_RULE_SETUP
#line 86 "radius_dict.l"
{ BEGIN VENDOR; }
      YY_BREAK
case 5:
YY_RULE_SETUP
#line 87 "radius_dict.l"
{ BEGIN ATTR; }
      YY_BREAK
case 6:
YY_RULE_SETUP
#line 88 "radius_dict.l"
{ BEGIN VALUE; }
      YY_BREAK
case 7:
YY_RULE_SETUP
#line 89 "radius_dict.l"
{ BEGIN INCLUDE; }
      YY_BREAK
case 8:
YY_RULE_SETUP
#line 90 "radius_dict.l"
{ BEGIN BEGIN_VENDOR; }
      YY_BREAK
case 9:
YY_RULE_SETUP
#line 91 "radius_dict.l"
{ BEGIN END_VENDOR; }
      YY_BREAK
case 10:
YY_RULE_SETUP
#line 93 "radius_dict.l"
{
    if (current_vendor) {
        g_free(current_vendor);
    }
    current_vendor = g_strdup(Radiustext);
    BEGIN OUT;
}
      YY_BREAK
case 11:
YY_RULE_SETUP
#line 100 "radius_dict.l"
{
    if (current_vendor) {
        g_free(current_vendor);
        current_vendor = NULL;
    }
    BEGIN OUT;
}
      YY_BREAK
case 12:
YY_RULE_SETUP
#line 108 "radius_dict.l"
{ vendor_name = g_strdup(Radiustext); BEGIN VENDOR_W_NAME; }
      YY_BREAK
case 13:
YY_RULE_SETUP
#line 109 "radius_dict.l"
{
    add_vendor(vendor_name,strtol(Radiustext,NULL,10));
    g_free(vendor_name);
    BEGIN OUT;
}
      YY_BREAK
case 14:
YY_RULE_SETUP
#line 114 "radius_dict.l"
{
    add_vendor(vendor_name,strtol(Radiustext,NULL,16));
    g_free(vendor_name);
    BEGIN OUT;
}
      YY_BREAK
case 15:
YY_RULE_SETUP
#line 120 "radius_dict.l"
{ attr_name = g_strdup(Radiustext); encrypted = FALSE; has_tag = FALSE; BEGIN ATTR_W_NAME; }
      YY_BREAK
case 16:
YY_RULE_SETUP
#line 121 "radius_dict.l"
{ attr_id = g_strdup(Radiustext);  BEGIN ATTR_W_ID;}
      YY_BREAK
case 17:
YY_RULE_SETUP
#line 122 "radius_dict.l"
{ attr_id = g_strdup_printf("%u",(int)strtoul(Radiustext,NULL,16)); BEGIN ATTR_W_ID;}
      YY_BREAK
case 18:
YY_RULE_SETUP
#line 123 "radius_dict.l"
{ attr_type = radius_integer;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 19:
YY_RULE_SETUP
#line 124 "radius_dict.l"
{ attr_type = radius_string;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 20:
YY_RULE_SETUP
#line 125 "radius_dict.l"
{ attr_type = radius_octets;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 21:
YY_RULE_SETUP
#line 126 "radius_dict.l"
{ attr_type = radius_ipaddr;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 22:
YY_RULE_SETUP
#line 127 "radius_dict.l"
{ attr_type = radius_ipv6addr;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 23:
YY_RULE_SETUP
#line 128 "radius_dict.l"
{ attr_type = radius_ipxnet;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 24:
YY_RULE_SETUP
#line 129 "radius_dict.l"
{ attr_type = radius_date;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 25:
YY_RULE_SETUP
#line 130 "radius_dict.l"
{ attr_type = radius_ifid;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 26:
YY_RULE_SETUP
#line 131 "radius_dict.l"
{ attr_type = radius_octets;  BEGIN ATTR_W_TYPE; }
      YY_BREAK
case 27:
YY_RULE_SETUP
#line 132 "radius_dict.l"
{ has_tag = TRUE; }
      YY_BREAK
case 28:
YY_RULE_SETUP
#line 133 "radius_dict.l"
{ encrypted=TRUE; }
      YY_BREAK
case 29:
YY_RULE_SETUP
#line 134 "radius_dict.l"
;
      YY_BREAK
case 30:
YY_RULE_SETUP
#line 135 "radius_dict.l"
{
    attr_vendor = g_strdup(Radiustext);
    add_attribute(attr_name,attr_id,attr_type,attr_vendor,encrypted,has_tag);
    g_free(attr_id);
    g_free(attr_vendor);
    g_free(attr_name);
    attr_id = NULL;
    attr_vendor = NULL;
    attr_name = NULL;
    BEGIN OUT;
}
      YY_BREAK
case 31:
/* rule 31 can match eol */
YY_RULE_SETUP
#line 146 "radius_dict.l"
{
    add_attribute(attr_name,attr_id,attr_type,current_vendor,encrypted,has_tag);
    g_free(attr_id);
    g_free(attr_name);
    linenums[include_stack_ptr]++;
    has_tag = FALSE;
    encrypted=FALSE;
    BEGIN OUT;
}
      YY_BREAK
case 32:
/* rule 32 can match eol */
YY_RULE_SETUP
#line 155 "radius_dict.l"
{
    add_attribute(attr_name,attr_id,attr_type,attr_vendor,encrypted,has_tag);
    g_free(attr_id);
    g_free(attr_vendor);
    g_free(attr_name);
    linenums[include_stack_ptr]++; 
    BEGIN OUT;
};
      YY_BREAK
case 33:
YY_RULE_SETUP
#line 164 "radius_dict.l"
{ attr_name = g_strdup(Radiustext); BEGIN VALUE_W_ATTR; }
      YY_BREAK
case 34:
/* rule 34 can match eol */
YY_RULE_SETUP
#line 165 "radius_dict.l"
{ value_repr = g_strdup(Radiustext); BEGIN VALUE_W_NAME; }
      YY_BREAK
case 35:
YY_RULE_SETUP
#line 166 "radius_dict.l"
{ add_value(attr_name,value_repr,strtol(Radiustext,NULL,10));  g_free(attr_name); g_free(value_repr); BEGIN OUT;}
      YY_BREAK
case 36:
YY_RULE_SETUP
#line 167 "radius_dict.l"
{ add_value(attr_name,value_repr,strtol(Radiustext,NULL,16));  g_free(attr_name); g_free(value_repr); BEGIN OUT;}
      YY_BREAK
case 37:
YY_RULE_SETUP
#line 169 "radius_dict.l"
{
      if ( include_stack_ptr >= MAX_INCLUDE_DEPTH ) {
            g_string_sprintfa(error, "$INCLUDE files nested to deeply\n");
            yyterminate();
      }
      
      include_stack[include_stack_ptr++] = YY_CURRENT_BUFFER;
      
      fullpaths[include_stack_ptr] = g_strdup_printf("%s%c%s",directory,DIR_SEPARATOR,Radiustext);

      Radiusin = fopen( fullpaths[include_stack_ptr], "r" );
      
      if (!Radiusin) {
            if (errno) {
                  g_string_sprintfa(error, "Could not open file: '%s', error: %s\n", fullpaths[include_stack_ptr], strerror(errno) );
                  yyterminate();
            }
      } else {
            linenums[include_stack_ptr] = 1;
            Radius_switch_to_buffer(Radius_create_buffer(Radiusin,YY_BUF_SIZE ) );
      }
      

      BEGIN OUT;
}
      YY_BREAK
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(OUT):
case YY_STATE_EOF(VENDOR):
case YY_STATE_EOF(VENDOR_W_NAME):
case YY_STATE_EOF(ATTR):
case YY_STATE_EOF(ATTR_W_NAME):
case YY_STATE_EOF(ATTR_W_ID):
case YY_STATE_EOF(ATTR_W_TYPE):
case YY_STATE_EOF(ATTR_W_VENDOR):
case YY_STATE_EOF(VALUE):
case YY_STATE_EOF(VALUE_W_ATTR):
case YY_STATE_EOF(VALUE_W_NAME):
case YY_STATE_EOF(INCLUDE):
case YY_STATE_EOF(JUNK):
case YY_STATE_EOF(BEGIN_VENDOR):
case YY_STATE_EOF(END_VENDOR):
#line 195 "radius_dict.l"
{
      
      fclose(Radiusin);
      Radiusin = NULL;
    
      if ( --include_stack_ptr < 0 ) {
            yyterminate();
      } else {
            g_free(fullpaths[include_stack_ptr+1]);
            fullpaths[include_stack_ptr+1] = NULL;
            
            Radius_delete_buffer(YY_CURRENT_BUFFER );
            Radius_switch_to_buffer(include_stack[include_stack_ptr]);
      }

      BEGIN OUT;
}
      YY_BREAK
case 38:
/* rule 38 can match eol */
YY_RULE_SETUP
#line 213 "radius_dict.l"
{ linenums[include_stack_ptr]++; BEGIN OUT; }
      YY_BREAK
case 39:
YY_RULE_SETUP
#line 216 "radius_dict.l"
ECHO;
      YY_BREAK
#line 1302 "radius_dict.c"

      case YY_END_OF_BUFFER:
            {
            /* Amount of text matched not including the EOB char. */
            int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;

            /* Undo the effects of YY_DO_BEFORE_ACTION. */
            *yy_cp = (yy_hold_char);
            YY_RESTORE_YY_MORE_OFFSET

            if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
                  {
                  /* We're scanning a new file or input source.  It's
                   * possible that this happened because the user
                   * just pointed Radiusin at a new source and called
                   * Radiuslex().  If so, then we have to assure
                   * consistency between YY_CURRENT_BUFFER and our
                   * globals.  Here is the right place to do so, because
                   * this is the first action (other than possibly a
                   * back-up) that will match for the new input source.
                   */
                  (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
                  YY_CURRENT_BUFFER_LVALUE->yy_input_file = Radiusin;
                  YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
                  }

            /* Note that here we test for yy_c_buf_p "<=" to the position
             * of the first EOB in the buffer, since yy_c_buf_p will
             * already have been incremented past the NUL character
             * (since all states make transitions on EOB to the
             * end-of-buffer state).  Contrast this with the test
             * in input().
             */
            if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
                  { /* This was really a NUL. */
                  yy_state_type yy_next_state;

                  (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;

                  yy_current_state = yy_get_previous_state(  );

                  /* Okay, we're now positioned to make the NUL
                   * transition.  We couldn't have
                   * yy_get_previous_state() go ahead and do it
                   * for us because it doesn't know how to deal
                   * with the possibility of jamming (and we don't
                   * want to build jamming into it because then it
                   * will run more slowly).
                   */

                  yy_next_state = yy_try_NUL_trans( yy_current_state );

                  yy_bp = (yytext_ptr) + YY_MORE_ADJ;

                  if ( yy_next_state )
                        {
                        /* Consume the NUL. */
                        yy_cp = ++(yy_c_buf_p);
                        yy_current_state = yy_next_state;
                        goto yy_match;
                        }

                  else
                        {
                        yy_cp = (yy_last_accepting_cpos);
                        yy_current_state = (yy_last_accepting_state);
                        goto yy_find_action;
                        }
                  }

            else switch ( yy_get_next_buffer(  ) )
                  {
                  case EOB_ACT_END_OF_FILE:
                        {
                        (yy_did_buffer_switch_on_eof) = 0;

                        if ( Radiuswrap( ) )
                              {
                              /* Note: because we've taken care in
                               * yy_get_next_buffer() to have set up
                               * Radiustext, we can now set up
                               * yy_c_buf_p so that if some total
                               * hoser (like flex itself) wants to
                               * call the scanner after we return the
                               * YY_NULL, it'll still work - another
                               * YY_NULL will get returned.
                               */
                              (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;

                              yy_act = YY_STATE_EOF(YY_START);
                              goto do_action;
                              }

                        else
                              {
                              if ( ! (yy_did_buffer_switch_on_eof) )
                                    YY_NEW_FILE;
                              }
                        break;
                        }

                  case EOB_ACT_CONTINUE_SCAN:
                        (yy_c_buf_p) =
                              (yytext_ptr) + yy_amount_of_matched_text;

                        yy_current_state = yy_get_previous_state(  );

                        yy_cp = (yy_c_buf_p);
                        yy_bp = (yytext_ptr) + YY_MORE_ADJ;
                        goto yy_match;

                  case EOB_ACT_LAST_MATCH:
                        (yy_c_buf_p) =
                        &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];

                        yy_current_state = yy_get_previous_state(  );

                        yy_cp = (yy_c_buf_p);
                        yy_bp = (yytext_ptr) + YY_MORE_ADJ;
                        goto yy_find_action;
                  }
            break;
            }

      default:
            YY_FATAL_ERROR(
                  "fatal flex scanner internal error--no action found" );
      } /* end of action switch */
            } /* end of scanning one token */
} /* end of Radiuslex */

/* yy_get_next_buffer - try to read in a new buffer
 *
 * Returns a code representing an action:
 *    EOB_ACT_LAST_MATCH -
 *    EOB_ACT_CONTINUE_SCAN - continue scanning from current position
 *    EOB_ACT_END_OF_FILE - end of file
 */
static int yy_get_next_buffer (void)
{
      register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
      register char *source = (yytext_ptr);
      register int number_to_move, i;
      int ret_val;

      if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
            YY_FATAL_ERROR(
            "fatal flex scanner internal error--end of buffer missed" );

      if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
            { /* Don't try to fill the buffer, so this is an EOF. */
            if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
                  {
                  /* We matched a single character, the EOB, so
                   * treat this as a final EOF.
                   */
                  return EOB_ACT_END_OF_FILE;
                  }

            else
                  {
                  /* We matched some text prior to the EOB, first
                   * process it.
                   */
                  return EOB_ACT_LAST_MATCH;
                  }
            }

      /* Try to read more data. */

      /* First move last chars to start of buffer. */
      number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;

      for ( i = 0; i < number_to_move; ++i )
            *(dest++) = *(source++);

      if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
            /* don't do the read, it's not guaranteed to return an EOF,
             * just force an EOF
             */
            YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;

      else
            {
                  int num_to_read =
                  YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;

            while ( num_to_read <= 0 )
                  { /* Not enough room in the buffer - grow it. */

                  /* just a shorter name for the current buffer */
                  YY_BUFFER_STATE b = YY_CURRENT_BUFFER;

                  int yy_c_buf_p_offset =
                        (int) ((yy_c_buf_p) - b->yy_ch_buf);

                  if ( b->yy_is_our_buffer )
                        {
                        int new_size = b->yy_buf_size * 2;

                        if ( new_size <= 0 )
                              b->yy_buf_size += b->yy_buf_size / 8;
                        else
                              b->yy_buf_size *= 2;

                        b->yy_ch_buf = (char *)
                              /* Include room in for 2 EOB chars. */
                              Radiusrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2  );
                        }
                  else
                        /* Can't grow it, we don't own it. */
                        b->yy_ch_buf = 0;

                  if ( ! b->yy_ch_buf )
                        YY_FATAL_ERROR(
                        "fatal error - scanner input buffer overflow" );

                  (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];

                  num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
                                    number_to_move - 1;

                  }

            if ( num_to_read > YY_READ_BUF_SIZE )
                  num_to_read = YY_READ_BUF_SIZE;

            /* Read in more data. */
            YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
                  (yy_n_chars), num_to_read );

            YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
            }

      if ( (yy_n_chars) == 0 )
            {
            if ( number_to_move == YY_MORE_ADJ )
                  {
                  ret_val = EOB_ACT_END_OF_FILE;
                  Radiusrestart(Radiusin  );
                  }

            else
                  {
                  ret_val = EOB_ACT_LAST_MATCH;
                  YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
                        YY_BUFFER_EOF_PENDING;
                  }
            }

      else
            ret_val = EOB_ACT_CONTINUE_SCAN;

      (yy_n_chars) += number_to_move;
      YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
      YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;

      (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];

      return ret_val;
}

/* yy_get_previous_state - get the state just before the EOB char was reached */

    static yy_state_type yy_get_previous_state (void)
{
      register yy_state_type yy_current_state;
      register char *yy_cp;
    
      yy_current_state = (yy_start);

      for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
            {
            register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
            if ( yy_accept[yy_current_state] )
                  {
                  (yy_last_accepting_state) = yy_current_state;
                  (yy_last_accepting_cpos) = yy_cp;
                  }
            while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
                  {
                  yy_current_state = (int) yy_def[yy_current_state];
                  if ( yy_current_state >= 211 )
                        yy_c = yy_meta[(unsigned int) yy_c];
                  }
            yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
            }

      return yy_current_state;
}

/* yy_try_NUL_trans - try to make a transition on the NUL character
 *
 * synopsis
 *    next_state = yy_try_NUL_trans( current_state );
 */
    static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state )
{
      register int yy_is_jam;
      register char *yy_cp = (yy_c_buf_p);

      register YY_CHAR yy_c = 1;
      if ( yy_accept[yy_current_state] )
            {
            (yy_last_accepting_state) = yy_current_state;
            (yy_last_accepting_cpos) = yy_cp;
            }
      while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
            {
            yy_current_state = (int) yy_def[yy_current_state];
            if ( yy_current_state >= 211 )
                  yy_c = yy_meta[(unsigned int) yy_c];
            }
      yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
      yy_is_jam = (yy_current_state == 210);

      return yy_is_jam ? 0 : yy_current_state;
}

#ifndef YY_NO_INPUT
#ifdef __cplusplus
    static int yyinput (void)
#else
    static int input  (void)
#endif

{
      int c;
    
      *(yy_c_buf_p) = (yy_hold_char);

      if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
            {
            /* yy_c_buf_p now points to the character we want to return.
             * If this occurs *before* the EOB characters, then it's a
             * valid NUL; if not, then we've hit the end of the buffer.
             */
            if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
                  /* This was really a NUL. */
                  *(yy_c_buf_p) = '\0';

            else
                  { /* need more input */
                  int offset = (yy_c_buf_p) - (yytext_ptr);
                  ++(yy_c_buf_p);

                  switch ( yy_get_next_buffer(  ) )
                        {
                        case EOB_ACT_LAST_MATCH:
                              /* This happens because yy_g_n_b()
                               * sees that we've accumulated a
                               * token and flags that we need to
                               * try matching the token before
                               * proceeding.  But for input(),
                               * there's no matching to consider.
                               * So convert the EOB_ACT_LAST_MATCH
                               * to EOB_ACT_END_OF_FILE.
                               */

                              /* Reset buffer status. */
                              Radiusrestart(Radiusin );

                              /*FALLTHROUGH*/

                        case EOB_ACT_END_OF_FILE:
                              {
                              if ( Radiuswrap( ) )
                                    return EOF;

                              if ( ! (yy_did_buffer_switch_on_eof) )
                                    YY_NEW_FILE;
#ifdef __cplusplus
                              return yyinput();
#else
                              return input();
#endif
                              }

                        case EOB_ACT_CONTINUE_SCAN:
                              (yy_c_buf_p) = (yytext_ptr) + offset;
                              break;
                        }
                  }
            }

      c = *(unsigned char *) (yy_c_buf_p);      /* cast for 8-bit char's */
      *(yy_c_buf_p) = '\0';   /* preserve Radiustext */
      (yy_hold_char) = *++(yy_c_buf_p);

      return c;
}
#endif      /* ifndef YY_NO_INPUT */

/** Immediately switch to a different input stream.
 * @param input_file A readable stream.
 * 
 * @note This function does not reset the start condition to @c INITIAL .
 */
    void Radiusrestart  (FILE * input_file )
{
    
      if ( ! YY_CURRENT_BUFFER ){
        Radiusensure_buffer_stack ();
            YY_CURRENT_BUFFER_LVALUE =
            Radius_create_buffer(Radiusin,YY_BUF_SIZE );
      }

      Radius_init_buffer(YY_CURRENT_BUFFER,input_file );
      Radius_load_buffer_state( );
}

/** Switch to a different input buffer.
 * @param new_buffer The new input buffer.
 * 
 */
    void Radius_switch_to_buffer  (YY_BUFFER_STATE  new_buffer )
{
    
      /* TODO. We should be able to replace this entire function body
       * with
       *          Radiuspop_buffer_state();
       *          Radiuspush_buffer_state(new_buffer);
     */
      Radiusensure_buffer_stack ();
      if ( YY_CURRENT_BUFFER == new_buffer )
            return;

      if ( YY_CURRENT_BUFFER )
            {
            /* Flush out information for old buffer. */
            *(yy_c_buf_p) = (yy_hold_char);
            YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
            YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
            }

      YY_CURRENT_BUFFER_LVALUE = new_buffer;
      Radius_load_buffer_state( );

      /* We don't actually know whether we did this switch during
       * EOF (Radiuswrap()) processing, but the only time this flag
       * is looked at is after Radiuswrap() is called, so it's safe
       * to go ahead and always set it.
       */
      (yy_did_buffer_switch_on_eof) = 1;
}

static void Radius_load_buffer_state  (void)
{
      (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
      (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
      Radiusin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
      (yy_hold_char) = *(yy_c_buf_p);
}

/** Allocate and initialize an input buffer state.
 * @param file A readable stream.
 * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
 * 
 * @return the allocated buffer state.
 */
    YY_BUFFER_STATE Radius_create_buffer  (FILE * file, int  size )
{
      YY_BUFFER_STATE b;
    
      b = (YY_BUFFER_STATE) Radiusalloc(sizeof( struct yy_buffer_state )  );
      if ( ! b )
            YY_FATAL_ERROR( "out of dynamic memory in Radius_create_buffer()" );

      b->yy_buf_size = size;

      /* yy_ch_buf has to be 2 characters longer than the size given because
       * we need to put in 2 end-of-buffer characters.
       */
      b->yy_ch_buf = (char *) Radiusalloc(b->yy_buf_size + 2  );
      if ( ! b->yy_ch_buf )
            YY_FATAL_ERROR( "out of dynamic memory in Radius_create_buffer()" );

      b->yy_is_our_buffer = 1;

      Radius_init_buffer(b,file );

      return b;
}

/** Destroy the buffer.
 * @param b a buffer created with Radius_create_buffer()
 * 
 */
    void Radius_delete_buffer (YY_BUFFER_STATE  b )
{
    
      if ( ! b )
            return;

      if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
            YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;

      if ( b->yy_is_our_buffer )
            Radiusfree((void *) b->yy_ch_buf  );

      Radiusfree((void *) b  );
}

/* Initializes or reinitializes a buffer.
 * This function is sometimes called more than once on the same buffer,
 * such as during a Radiusrestart() or at EOF.
 */
    static void Radius_init_buffer  (YY_BUFFER_STATE  b, FILE * file )

{
      int oerrno = errno;
    
      Radius_flush_buffer(b );

      b->yy_input_file = file;
      b->yy_fill_buffer = 1;

    /* If b is the current buffer, then Radius_init_buffer was _probably_
     * called from Radiusrestart() or through yy_get_next_buffer.
     * In that case, we don't want to reset the lineno or column.
     */
    if (b != YY_CURRENT_BUFFER){
        b->yy_bs_lineno = 1;
        b->yy_bs_column = 0;
    }

        b->yy_is_interactive = 0;
    
      errno = oerrno;
}

/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
 * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
 * 
 */
    void Radius_flush_buffer (YY_BUFFER_STATE  b )
{
      if ( ! b )
            return;

      b->yy_n_chars = 0;

      /* We always need two end-of-buffer characters.  The first causes
       * a transition to the end-of-buffer state.  The second causes
       * a jam in that state.
       */
      b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
      b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;

      b->yy_buf_pos = &b->yy_ch_buf[0];

      b->yy_at_bol = 1;
      b->yy_buffer_status = YY_BUFFER_NEW;

      if ( b == YY_CURRENT_BUFFER )
            Radius_load_buffer_state( );
}

/** Pushes the new state onto the stack. The new state becomes
 *  the current state. This function will allocate the stack
 *  if necessary.
 *  @param new_buffer The new state.
 *  
 */
void Radiuspush_buffer_state (YY_BUFFER_STATE new_buffer )
{
      if (new_buffer == NULL)
            return;

      Radiusensure_buffer_stack();

      /* This block is copied from Radius_switch_to_buffer. */
      if ( YY_CURRENT_BUFFER )
            {
            /* Flush out information for old buffer. */
            *(yy_c_buf_p) = (yy_hold_char);
            YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
            YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
            }

      /* Only push if top exists. Otherwise, replace top. */
      if (YY_CURRENT_BUFFER)
            (yy_buffer_stack_top)++;
      YY_CURRENT_BUFFER_LVALUE = new_buffer;

      /* copied from Radius_switch_to_buffer. */
      Radius_load_buffer_state( );
      (yy_did_buffer_switch_on_eof) = 1;
}

/** Removes and deletes the top of the stack, if present.
 *  The next element becomes the new top.
 *  
 */
void Radiuspop_buffer_state (void)
{
      if (!YY_CURRENT_BUFFER)
            return;

      Radius_delete_buffer(YY_CURRENT_BUFFER );
      YY_CURRENT_BUFFER_LVALUE = NULL;
      if ((yy_buffer_stack_top) > 0)
            --(yy_buffer_stack_top);

      if (YY_CURRENT_BUFFER) {
            Radius_load_buffer_state( );
            (yy_did_buffer_switch_on_eof) = 1;
      }
}

/* Allocates the stack if it does not exist.
 *  Guarantees space for at least one push.
 */
static void Radiusensure_buffer_stack (void)
{
      int num_to_alloc;
    
      if (!(yy_buffer_stack)) {

            /* First allocation is just for 2 elements, since we don't know if this
             * scanner will even need a stack. We use 2 instead of 1 to avoid an
             * immediate realloc on the next call.
         */
            num_to_alloc = 1;
            (yy_buffer_stack) = (struct yy_buffer_state**)Radiusalloc
                                                (num_to_alloc * sizeof(struct yy_buffer_state*)
                                                );
            
            memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
                        
            (yy_buffer_stack_max) = num_to_alloc;
            (yy_buffer_stack_top) = 0;
            return;
      }

      if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){

            /* Increase the buffer to prepare for a possible push. */
            int grow_size = 8 /* arbitrary grow size */;

            num_to_alloc = (yy_buffer_stack_max) + grow_size;
            (yy_buffer_stack) = (struct yy_buffer_state**)Radiusrealloc
                                                ((yy_buffer_stack),
                                                num_to_alloc * sizeof(struct yy_buffer_state*)
                                                );

            /* zero only the new slots.*/
            memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
            (yy_buffer_stack_max) = num_to_alloc;
      }
}

/** Setup the input buffer state to scan directly from a user-specified character buffer.
 * @param base the character buffer
 * @param size the size in bytes of the character buffer
 * 
 * @return the newly allocated buffer state object. 
 */
YY_BUFFER_STATE Radius_scan_buffer  (char * base, yy_size_t  size )
{
      YY_BUFFER_STATE b;
    
      if ( size < 2 ||
           base[size-2] != YY_END_OF_BUFFER_CHAR ||
           base[size-1] != YY_END_OF_BUFFER_CHAR )
            /* They forgot to leave room for the EOB's. */
            return 0;

      b = (YY_BUFFER_STATE) Radiusalloc(sizeof( struct yy_buffer_state )  );
      if ( ! b )
            YY_FATAL_ERROR( "out of dynamic memory in Radius_scan_buffer()" );

      b->yy_buf_size = size - 2;    /* "- 2" to take care of EOB's */
      b->yy_buf_pos = b->yy_ch_buf = base;
      b->yy_is_our_buffer = 0;
      b->yy_input_file = 0;
      b->yy_n_chars = b->yy_buf_size;
      b->yy_is_interactive = 0;
      b->yy_at_bol = 1;
      b->yy_fill_buffer = 0;
      b->yy_buffer_status = YY_BUFFER_NEW;

      Radius_switch_to_buffer(b  );

      return b;
}

/** Setup the input buffer state to scan a string. The next call to Radiuslex() will
 * scan from a @e copy of @a str.
 * @param str a NUL-terminated string to scan
 * 
 * @return the newly allocated buffer state object.
 * @note If you want to scan bytes that may contain NUL values, then use
 *       Radius_scan_bytes() instead.
 */
YY_BUFFER_STATE Radius_scan_string (yyconst char * yy_str )
{
    
      return Radius_scan_bytes(yy_str,strlen(yy_str) );
}

/** Setup the input buffer state to scan the given bytes. The next call to Radiuslex() will
 * scan from a @e copy of @a bytes.
 * @param bytes the byte buffer to scan
 * @param len the number of bytes in the buffer pointed to by @a bytes.
 * 
 * @return the newly allocated buffer state object.
 */
YY_BUFFER_STATE Radius_scan_bytes  (yyconst char * bytes, int  len )
{
      YY_BUFFER_STATE b;
      char *buf;
      yy_size_t n;
      int i;
    
      /* Get memory for full buffer, including space for trailing EOB's. */
      n = len + 2;
      buf = (char *) Radiusalloc(n  );
      if ( ! buf )
            YY_FATAL_ERROR( "out of dynamic memory in Radius_scan_bytes()" );

      for ( i = 0; i < len; ++i )
            buf[i] = bytes[i];

      buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;

      b = Radius_scan_buffer(buf,n );
      if ( ! b )
            YY_FATAL_ERROR( "bad buffer in Radius_scan_bytes()" );

      /* It's okay to grow etc. this buffer, and we should throw it
       * away when we're done.
       */
      b->yy_is_our_buffer = 1;

      return b;
}

#ifndef YY_EXIT_FAILURE
#define YY_EXIT_FAILURE 2
#endif

static void yy_fatal_error (yyconst char* msg )
{
      (void) fprintf( stderr, "%s\n", msg );
      exit( YY_EXIT_FAILURE );
}

/* Redefine yyless() so it works in section 3 code. */

#undef yyless
#define yyless(n) \
      do \
            { \
            /* Undo effects of setting up Radiustext. */ \
        int yyless_macro_arg = (n); \
        YY_LESS_LINENO(yyless_macro_arg);\
            Radiustext[Radiusleng] = (yy_hold_char); \
            (yy_c_buf_p) = Radiustext + yyless_macro_arg; \
            (yy_hold_char) = *(yy_c_buf_p); \
            *(yy_c_buf_p) = '\0'; \
            Radiusleng = yyless_macro_arg; \
            } \
      while ( 0 )

/* Accessor  methods (get/set functions) to struct members. */

/** Get the current line number.
 * 
 */
int Radiusget_lineno  (void)
{
        
    return Radiuslineno;
}

/** Get the input stream.
 * 
 */
FILE *Radiusget_in  (void)
{
        return Radiusin;
}

/** Get the output stream.
 * 
 */
FILE *Radiusget_out  (void)
{
        return Radiusout;
}

/** Get the length of the current token.
 * 
 */
int Radiusget_leng  (void)
{
        return Radiusleng;
}

/** Get the current token.
 * 
 */

char *Radiusget_text  (void)
{
        return Radiustext;
}

/** Set the current line number.
 * @param line_number
 * 
 */
void Radiusset_lineno (int  line_number )
{
    
    Radiuslineno = line_number;
}

/** Set the input stream. This does not discard the current
 * input buffer.
 * @param in_str A readable stream.
 * 
 * @see Radius_switch_to_buffer
 */
void Radiusset_in (FILE *  in_str )
{
        Radiusin = in_str ;
}

void Radiusset_out (FILE *  out_str )
{
        Radiusout = out_str ;
}

int Radiusget_debug  (void)
{
        return Radius_flex_debug;
}

void Radiusset_debug (int  bdebug )
{
        Radius_flex_debug = bdebug ;
}

/* Radiuslex_destroy is for both reentrant and non-reentrant scanners. */
int Radiuslex_destroy  (void)
{
    
    /* Pop the buffer stack, destroying each element. */
      while(YY_CURRENT_BUFFER){
            Radius_delete_buffer(YY_CURRENT_BUFFER  );
            YY_CURRENT_BUFFER_LVALUE = NULL;
            Radiuspop_buffer_state();
      }

      /* Destroy the stack itself. */
      Radiusfree((yy_buffer_stack) );
      (yy_buffer_stack) = NULL;

    return 0;
}

/*
 * Internal utility routines.
 */

#ifndef yytext_ptr
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
{
      register int i;
      for ( i = 0; i < n; ++i )
            s1[i] = s2[i];
}
#endif

#ifdef YY_NEED_STRLEN
static int yy_flex_strlen (yyconst char * s )
{
      register int n;
      for ( n = 0; s[n]; ++n )
            ;

      return n;
}
#endif

void *Radiusalloc (yy_size_t  size )
{
      return (void *) malloc( size );
}

void *Radiusrealloc  (void * ptr, yy_size_t  size )
{
      /* The cast to (char *) in the following accommodates both
       * implementations that use char* generic pointers, and those
       * that use void* generic pointers.  It works with the latter
       * because both ANSI C and C++ allow castless assignment from
       * any pointer type to void*, and deal with argument conversions
       * as though doing an assignment.
       */
      return (void *) realloc( (char *) ptr, size );
}

void Radiusfree (void * ptr )
{
      free( (char *) ptr );   /* see Radiusrealloc() for (char *) cast */
}

#define YYTABLES_NAME "yytables"

#undef YY_NEW_FILE
#undef YY_FLUSH_BUFFER
#undef yy_set_bol
#undef yy_new_buffer
#undef yy_set_interactive
#undef yytext_ptr
#undef YY_DO_BEFORE_ACTION

#ifdef YY_DECL_IS_OURS
#undef YY_DECL_IS_OURS
#undef YY_DECL
#endif
#line 216 "radius_dict.l"



void add_vendor(const gchar* name, guint32 vendor_id) {
      radius_vendor_info_t* v = g_malloc(sizeof(radius_vendor_info_t));
      
      v->name = g_strdup(name);
      v->code = vendor_id;
      v->attrs_by_id = g_hash_table_new(g_direct_hash,g_direct_equal);
      v->ett = -1;
    
      g_hash_table_insert(dict->vendors_by_id,GUINT_TO_POINTER(v->code),v);
      g_hash_table_insert(dict->vendors_by_name,v->name,v);
}

void add_attribute(const gchar* name, const  gchar* code, radius_attr_dissector_t type, const  gchar* vendor_name, gboolean crypt, gboolean tagged) {
      radius_attr_info_t* a = g_malloc(sizeof(radius_attr_info_t));
      GHashTable* by_id;
      
      if (vendor_name) {
            radius_vendor_info_t* v;
            v = g_hash_table_lookup(dict->vendors_by_name,vendor_name);
            
            if (! v) {
                  g_string_sprintfa(error, "Vendor: '%s', does not exist in %s:%i \n", vendor_name, fullpaths[include_stack_ptr], linenums[include_stack_ptr] );
                  BEGIN JUNK;
                  return;
            } else {
                  by_id = v->attrs_by_id;
            }
      } else {
            by_id = dict->attrs_by_id;
      }
      
      a->name = g_strdup(name);
      a->code = strtol(code,NULL,10);
      a->encrypt = crypt;
      a->tagged =  tagged;
      a->type = type;
      a->dissector = NULL;
      a->vs = NULL;
      a->hf = -1;
      a->hf64 = -1;
      a->hf_tag = -1;
      a->hf_len = -1;
      a->ett = -1;
      
      g_hash_table_insert(by_id,GUINT_TO_POINTER(a->code),a);
      g_hash_table_insert(dict->attrs_by_name,(gpointer) (a->name),a);
}

void add_value(const gchar* attrib_name, const gchar* value_repr, long value) {
      value_string v;
      GArray* a = g_hash_table_lookup(value_strings,attrib_name);
      
      if (! a) {
            a = g_array_new(TRUE,TRUE,sizeof(value_string));
            g_hash_table_insert(value_strings,g_strdup(attrib_name),a);
      }
      
      v.value = value;
      v.strptr = g_strdup(value_repr);
      
      g_array_append_val(a,v);
}


static void setup_attrs(gpointer k _U_, gpointer v, gpointer p _U_) {
      radius_attr_info_t* a = v;
      gpointer key;
      
      union {
            GArray* a;
            gpointer p;
      } vs;
      
      if (g_hash_table_lookup_extended(value_strings,a->name,&key,&vs.p) ) {
            a->vs = (value_string*) vs.a->data;
            g_array_free(vs.a,FALSE);
            g_hash_table_remove(value_strings,key);
            g_free(key);
      }
}

static void setup_vendors(gpointer k _U_, gpointer v, gpointer p) {
      radius_vendor_info_t* vnd = v;
      
      g_hash_table_foreach(vnd->attrs_by_id,setup_attrs,p); 
}

static gboolean destroy_value_strings(gpointer k, gpointer v, gpointer p _U_) {
    value_string* vs = (value_string*)(((GArray*)v)->data);
    
      g_free(k);
    
    for (;vs->strptr;vs++) {
        g_free((void*)vs->strptr);
    }
    
      g_array_free(v,TRUE);
      return TRUE;
}

static gboolean destroy_attrs(gpointer k _U_, gpointer v, gpointer p _U_) {
      radius_attr_info_t* a = v;
      int i;
      
      g_free((gpointer) (a->name));
      if (a->vs) {
            for(i=0; a->vs[i].strptr; i++) {
                  g_free((void *)a->vs[i].strptr);
            }
            g_free((void *)a->vs);
      }
      g_free(a);
      return TRUE;
}

static gboolean destroy_vendors(gpointer k _U_, gpointer v, gpointer p) {
      radius_vendor_info_t* vnd = v;
      g_free(vnd->name);
      g_hash_table_foreach_remove(vnd->attrs_by_id,destroy_attrs,p);
      g_hash_table_destroy(vnd->attrs_by_id);
      g_free(vnd);
      return TRUE;
}

static void destroy_dict(radius_dictionary_t* d) {
      g_hash_table_foreach_remove(d->attrs_by_id,destroy_attrs,NULL);
      g_hash_table_foreach_remove(d->vendors_by_id,destroy_vendors,NULL);     
      g_hash_table_destroy(d->vendors_by_id);
      g_hash_table_destroy(d->attrs_by_id);
      g_hash_table_destroy(d->vendors_by_name);
      g_hash_table_destroy(d->attrs_by_name);
      g_free(d);
}

radius_dictionary_t* radius_load_dictionary (gchar* dir, const gchar* filename, gchar** err_str) {
      int i;
      
      directory = dir;
      
      fullpaths[include_stack_ptr] = g_strdup_printf("%s%c%s",directory,DIR_SEPARATOR,filename);
      
      error = g_string_new("");

      Radiusin = fopen(fullpaths[include_stack_ptr],"r");
      
      if (!Radiusin) {
            g_string_sprintfa(error, "Could not open file: '%s', error: %s\n", fullpaths[include_stack_ptr], strerror(errno) );
            g_free(fullpaths[include_stack_ptr]);
            *err_str = error->str;
            g_string_free(error,FALSE);
            return NULL;
      }

      dict = g_malloc(sizeof(radius_dictionary_t));
      dict->attrs_by_id = g_hash_table_new(g_direct_hash,g_direct_equal);
      dict->attrs_by_name = g_hash_table_new(g_str_hash,g_str_equal);
      dict->vendors_by_id = g_hash_table_new(g_direct_hash,g_direct_equal);
      dict->vendors_by_name = g_hash_table_new(g_str_hash,g_str_equal);
      
      value_strings = g_hash_table_new(g_str_hash,g_str_equal);
      
      BEGIN OUT;

      Radiuslex();

      if (Radiusin != NULL) fclose(Radiusin);
      Radiusin = NULL;
    
      for (i=0; i < 10; i++) {
            if (fullpaths[i]) g_free(fullpaths[i]);
      }
            
      g_hash_table_foreach(dict->attrs_by_id,setup_attrs,NULL);
      g_hash_table_foreach(dict->vendors_by_id,setup_vendors,NULL);     
      g_hash_table_foreach_remove(value_strings,destroy_value_strings,NULL);
      
      if (error->len > 0) {
             *err_str = error->str;
            g_string_free(error,FALSE);
            destroy_dict(dict);
            return NULL;
      } else {
            *err_str = NULL;
            g_string_free(error,TRUE);
            return dict;
      }
}


Generated by  Doxygen 1.6.0   Back to index