loaders/map_header.c

#line 2 "src/loaders/map_header.c"

#line 4 "src/loaders/map_header.c"

#define  YY_INT_ALIGNED short int

/* A lexical scanner generated by flex */

#define yy_create_buffer yy_map_header_create_buffer
#define yy_delete_buffer yy_map_header_delete_buffer
#define yy_flex_debug yy_map_header_flex_debug
#define yy_init_buffer yy_map_header_init_buffer
#define yy_flush_buffer yy_map_header_flush_buffer
#define yy_load_buffer_state yy_map_header_load_buffer_state
#define yy_switch_to_buffer yy_map_header_switch_to_buffer
#define yyin yy_map_headerin
#define yyleng yy_map_headerleng
#define yylex yy_map_headerlex
#define yylineno yy_map_headerlineno
#define yyout yy_map_headerout
#define yyrestart yy_map_headerrestart
#define yytext yy_map_headertext
#define yywrap yy_map_headerwrap
#define yyalloc yy_map_headeralloc
#define yyrealloc yy_map_headerrealloc
#define yyfree yy_map_headerfree

#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
#define YY_FLEX_SUBMINOR_VERSION 35
#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

/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
 * if you want the limit (max/min) macros for int types. 
 */
#ifndef __STDC_LIMIT_MACROS
#define __STDC_LIMIT_MACROS 1
#endif

#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;

/* 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 /* ! C99 */

#endif /* ! FLEXINT_H */

#ifdef __cplusplus

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

#else   /* ! __cplusplus */

/* C99 requires __STDC__ to be defined as 1. */
#if defined (__STDC__)

#define YY_USE_CONST

#endif  /* defined (__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 yy_map_headerrestart(yy_map_headerin  )

#define YY_END_OF_BUFFER_CHAR 0

/* Size of default input buffer. */
#ifndef YY_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k.
 * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
 * Ditto for the __ia64__ case accordingly.
 */
#define YY_BUF_SIZE 32768
#else
#define YY_BUF_SIZE 16384
#endif /* __ia64__ */
#endif

/* The state buf must be large enough to hold one state per character in the main buffer.
 */
#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))

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

extern int yy_map_headerleng;

extern FILE *yy_map_headerin, *yy_map_headerout;

#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 yy_map_headertext. */ \
        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 yy_map_headertext again */ \
        } \
    while ( 0 )

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

#ifndef YY_TYPEDEF_YY_SIZE_T
#define YY_TYPEDEF_YY_SIZE_T
typedef size_t 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; 
    int yy_bs_column; 
    /* 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 yy_map_headerrestart()), so that the user can continue scanning by
     * just pointing yy_map_headerin 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; 
static size_t yy_buffer_stack_max = 0; 
static YY_BUFFER_STATE * yy_buffer_stack = 0; 
/* 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 yy_map_headertext is formed. */
static char yy_hold_char;
static int yy_n_chars;      /* number of characters read into yy_ch_buf */
int yy_map_headerleng;

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

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

void yy_map_headerrestart (FILE *input_file  );
void yy_map_header_switch_to_buffer (YY_BUFFER_STATE new_buffer  );
YY_BUFFER_STATE yy_map_header_create_buffer (FILE *file,int size  );
void yy_map_header_delete_buffer (YY_BUFFER_STATE b  );
void yy_map_header_flush_buffer (YY_BUFFER_STATE b  );
void yy_map_headerpush_buffer_state (YY_BUFFER_STATE new_buffer  );
void yy_map_headerpop_buffer_state (void );

static void yy_map_headerensure_buffer_stack (void );
static void yy_map_header_load_buffer_state (void );
static void yy_map_header_init_buffer (YY_BUFFER_STATE b,FILE *file  );

#define YY_FLUSH_BUFFER yy_map_header_flush_buffer(YY_CURRENT_BUFFER )

YY_BUFFER_STATE yy_map_header_scan_buffer (char *base,yy_size_t size  );
YY_BUFFER_STATE yy_map_header_scan_string (yyconst char *yy_str  );
YY_BUFFER_STATE yy_map_header_scan_bytes (yyconst char *bytes,int len  );

void *yy_map_headeralloc (yy_size_t  );
void *yy_map_headerrealloc (void *,yy_size_t  );
void yy_map_headerfree (void *  );

#define yy_new_buffer yy_map_header_create_buffer

#define yy_set_interactive(is_interactive) \
    { \
    if ( ! YY_CURRENT_BUFFER ){ \
        yy_map_headerensure_buffer_stack (); \
        YY_CURRENT_BUFFER_LVALUE =    \
            yy_map_header_create_buffer(yy_map_headerin,YY_BUF_SIZE ); \
    } \
    YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
    }

#define yy_set_bol(at_bol) \
    { \
    if ( ! YY_CURRENT_BUFFER ){\
        yy_map_headerensure_buffer_stack (); \
        YY_CURRENT_BUFFER_LVALUE =    \
            yy_map_header_create_buffer(yy_map_headerin,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 yy_map_headerwrap(n) 1
#define YY_SKIP_YYWRAP

typedef unsigned char YY_CHAR;

FILE *yy_map_headerin = (FILE *) 0, *yy_map_headerout = (FILE *) 0;

typedef int yy_state_type;

extern int yy_map_headerlineno;

int yy_map_headerlineno = 1;

extern char *yy_map_headertext;
#define yytext_ptr yy_map_headertext

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 yy_map_headertext.
 */
#define YY_DO_BEFORE_ACTION \
    (yytext_ptr) = yy_bp; \
    yy_map_headerleng = (size_t) (yy_cp - yy_bp); \
    (yy_hold_char) = *yy_cp; \
    *yy_cp = '\0'; \
    (yy_c_buf_p) = yy_cp;

#define YY_NUM_RULES 33
#define YY_END_OF_BUFFER 34
/* 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[280] =
    {   0,
       32,   32,   28,   28,   34,   32,   29,   32,   32,   32,
       32,   32,   32,   32,   32,   32,   32,   32,   32,   32,
       32,   32,   32,   32,   28,   28,   28,   32,   32,   30,
       32,   29,   32,   32,   32,   32,   32,   32,   32,   32,
       32,   32,   32,   32,   32,   32,   32,   32,   32,   32,
       32,   28,   28,   28,   28,   32,   32,   32,   32,   32,
       32,   32,   32,   26,   32,   32,   32,   32,   32,   32,
       32,   32,   32,   32,   32,   32,   28,   32,   32,   32,
       31,   32,   32,   32,   32,   26,   32,   32,   32,   32,
       32,   32,   32,   32,   32,   32,   32,   32,   32,   32,

       32,   28,   32,   32,   32,   32,   32,   32,   32,   32,
       32,   32,   32,   32,   32,   32,   32,   21,   21,   32,
       32,   32,   32,   32,   32,   32,   28,   32,   32,   32,
       32,   32,   32,   32,    1,    1,   32,   32,   32,   32,
       32,   32,   32,   32,   32,   32,   32,   32,   32,   32,
       27,   32,   32,   32,   32,   32,   32,   32,   32,   13,
       13,   32,   32,   32,   32,   32,   32,   32,   32,   32,
       32,   32,   32,   32,    7,    7,   27,   32,   32,   32,
       32,   32,   32,   32,    8,    8,   32,   32,   32,   32,
       32,   32,   32,    4,    4,   32,   32,   32,   23,   23,

       32,   32,   32,   32,    5,    5,    6,    6,   32,   32,
       17,   17,   32,   32,   14,   14,   32,   22,   22,   32,
       32,   32,   32,    3,    3,    2,    2,   12,   12,   32,
       32,   32,   15,   15,   32,   32,   32,   32,   32,   32,
       32,   32,   32,   16,   16,   18,   18,   32,   32,   10,
       10,   32,   11,   11,   32,   32,   32,   32,   32,   19,
       19,   32,   32,   32,   25,   25,   32,   32,   32,   32,
       32,    9,    9,   32,   20,   20,   24,   24,    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,    1,    1,    1,    1,    1,    6,    6,
        6,    6,    6,    6,    6,    6,    1,    1,    1,    1,
        1,    1,    1,    1,    7,    8,    9,   10,   11,   12,
       13,   14,   15,    1,   16,   17,   18,   19,   20,   21,
       22,   23,   24,   25,   26,   27,   28,   29,   30,    1,
        1,    1,    1,   31,   32,    1,   33,   34,   35,   36,

       37,   38,   39,   40,   41,    1,   42,   43,   44,   45,
       46,   47,   48,   49,   50,   51,   52,   53,   54,   55,
       56,    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,    1
    } ;

static yyconst flex_int32_t yy_meta[57] =
    {   0,
        1,    1,    2,    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_int16_t yy_base[310] =
    {   0,
        0,   31,   85,   86,  508,    0,  509,  504,    0,   79,
       86,   75,   80,   85,   83,   75,   93,   76,   87,   92,
       77,   91,   88,   97,    0,    4,   90,    0,  503,  509,
        5,    0,  473,   87,   99,  131,  113,  128,  131,  132,
      128,  472,  122,  141,  128,  137,  144,  135,  138,  147,
      145,    0,    6,    0,  147,  140,  143,  148,  500,  151,
      152,  151,  151,  500,  155,  179,  184,  165,  499,  181,
      187,  178,  190,  180,  179,  180,  188,  181,  189,  194,
      509,  187,  201,  198,  188,  498,  497,  207,  208,  193,
      236,  198,  234,  496,  226,  222,  465,  464,  222,  235,

      236,  227,  228,  242,  245,  463,  462,  230,  491,  490,
      233,  244,  243,  232,  242,  241,  240,    0,  489,  245,
      458,  240,  245,  256,  257,  487,  257,  280,  273,  272,
      270,  284,  486,  485,    0,  484,  284,  288,  293,  294,
      288,  285,  453,  482,  284,  295,  304,  481,  289,  480,
      479,  304,  290,  298,  478,  477,  296,  306,  476,    0,
      475,  474,  309,  295,  473,  300,  472,  303,  471,  332,
      331,  325,  470,  469,    0,  468,  467,  466,  465,  326,
      464,  463,  339,  329,    0,  462,  461,  460,  329,  459,
      336,  458,  336,    0,  457,  339,  347,  345,    0,  456,

      455,  454,  453,  330,    0,  452,    0,  451,  346,  351,
        0,  450,  449,  448,    0,  447,  446,    0,  445,  414,
      352,  443,  412,    0,  441,    0,  440,    0,  439,  438,
      345,  340,    0,  437,  436,  435,  342,  347,  434,  429,
      424,  422,  343,    0,  421,    0,  420,  362,  344,    0,
      419,  418,    0,  417,  416,  356,  345,  349,  415,    0,
      414,  381,  390,  413,    0,  412,  391,  411,  410,  409,
      408,    0,  407,  406,    0,  405,    0,  404,  509,  428,
      430,  404,  432,  403,  402,  216,  114,   90,   89,   29,
       28,   27,   26,   25,   24,   23,   22,   21,   20,   19,

       18,   17,   16,   15,   14,   13,   12,   11,    0
    } ;

static yyconst flex_int16_t yy_def[310] =
    {   0,
      280,  279,  281,  281,  279,  282,  279,  283,  282,  282,
      282,  282,  282,  282,  282,  282,  282,  282,  282,  282,
      282,  282,  282,  282,  284,  284,  284,  282,  283,  279,
      282,  282,  282,  282,  282,  282,  282,  282,  282,  282,
      282,  282,  282,  282,  282,  282,  282,  282,  282,  282,
      282,  284,  284,  284,  284,  282,  282,  282,  282,  282,
      282,  282,  282,  282,  282,  282,  282,  282,  282,  282,
      282,  282,  282,  282,  282,  282,  284,  282,  282,  282,
      279,  282,  282,  282,  282,  282,  282,  282,  282,  282,
      282,  282,  282,  285,  282,  282,  282,  282,  282,  282,

      282,  284,  282,  282,  282,  282,  282,  282,  282,  286,
      282,  282,  282,  282,  282,  282,  282,  285,  285,  282,
      282,  282,  282,  282,  282,  282,  284,  282,  282,  282,
      282,  282,  282,  287,  286,  286,  282,  282,  282,  282,
      282,  282,  282,  282,  282,  282,  282,  282,  282,  288,
      284,  282,  282,  282,  282,  282,  282,  282,  289,  287,
      287,  282,  282,  282,  282,  282,  282,  282,  290,  282,
      282,  282,  291,  282,  288,  288,  284,  282,  282,  282,
      292,  293,  282,  282,  289,  289,  294,  282,  282,  295,
      282,  296,  282,  290,  290,  282,  282,  282,  291,  291,

      297,  298,  299,  282,  292,  292,  293,  293,  282,  282,
      294,  294,  300,  282,  295,  295,  282,  296,  296,  282,
      282,  282,  282,  297,  297,  298,  298,  299,  299,  282,
      282,  282,  300,  300,  301,  302,  282,  282,  303,  282,
      304,  282,  282,  301,  301,  302,  302,  282,  282,  303,
      303,  282,  304,  304,  305,  282,  282,  282,  306,  305,
      305,  282,  282,  282,  306,  306,  282,  282,  307,  282,
      308,  307,  307,  309,  308,  308,  309,  309,    0,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,

      279,  279,  279,  279,  279,  279,  279,  279,  279
    } ;

static yyconst flex_int16_t yy_nxt[566] =
    {   0,
      277,   31,    7,    8,   32,   53,   31,   53,   54,   32,
       54,  275,  272,  265,  260,  253,  250,  246,  244,  233,
      228,  226,  224,  218,  215,  211,  207,  205,  199,  194,
        9,    6,    6,    7,    8,    6,    6,    6,   10,    6,
       11,   12,   13,    6,   14,    6,    6,   15,   16,   17,
       18,   19,    6,   20,   21,   22,   23,    6,   24,    6,
        6,    9,    6,    6,   10,    6,   11,   12,   13,    6,
       14,    6,    6,   15,   16,   17,   18,   19,    6,   20,
       21,   22,   23,    6,   24,    6,    6,    7,    7,  185,
      175,   33,   34,   36,   37,   38,   27,   39,   40,   41,

       35,   43,   46,   44,   47,   48,   49,   50,   55,   57,
       58,   51,   42,   45,  160,   26,   26,   33,   34,   36,
       37,   38,   27,   39,   40,   41,   35,   43,   46,   44,
       47,   48,   49,   50,   55,   57,   58,   51,   42,   45,
       59,   61,   62,   63,   64,   65,   67,   68,   69,   70,
       72,   73,   74,   75,   76,   60,   77,   78,   79,   80,
       71,   82,   83,   84,   85,   87,   59,   61,   62,   63,
       64,   65,   67,   68,   69,   70,   72,   73,   74,   75,
       76,   60,   77,   78,   79,   80,   71,   82,   83,   84,
       85,   87,   88,   92,   93,   95,   89,   96,   97,   90,

       98,   99,   91,  100,  101,  102,  103,  104,  105,  106,
      107,  108,  109,  111,  112,  113,  135,  116,   88,   92,
       93,   95,   89,   96,   97,   90,   98,   99,   91,  100,
      101,  102,  103,  104,  105,  106,  107,  108,  109,  111,
      112,  113,  114,  116,  117,  120,  121,  124,  125,  126,
      127,  128,  129,  130,  133,  137,  138,  139,  140,  141,
      142,  115,  143,  144,  146,  147,  148,  149,  114,  151,
      117,  120,  121,  124,  125,  126,  127,  128,  129,  130,
      133,  137,  138,  139,  140,  141,  142,  115,  143,  144,
      146,  147,  148,  149,  152,  151,  153,  154,  155,  156,

      157,  162,  163,  164,  165,  166,  158,  167,  170,  171,
      172,  174,  178,  179,  180,  183,  184,  188,  189,  191,
      152,  193,  153,  154,  155,  156,  157,  162,  163,  164,
      165,  166,  158,  167,  170,  171,  172,  174,  178,  179,
      180,  183,  184,  188,  189,  191,  196,  193,  197,  198,
      204,  209,  210,  214,  217,  220,  221,  222,  223,  230,
      231,  232,  238,  242,  243,  248,  249,  256,  257,  258,
      262,  263,  196,  264,  197,  198,  204,  209,  210,  214,
      217,  220,  221,  222,  223,  230,  231,  232,  238,  242,
      243,  248,  249,  256,  257,  258,  262,  263,  267,  264,

      268,  270,  118,   52,   28,  278,  276,  278,  273,  276,
      274,  273,  271,  266,  269,  261,  266,  261,  254,  259,
      251,  247,  245,  255,  267,  254,  268,  270,    6,    6,
       25,   25,   29,   29,  252,  251,  247,  245,  234,  241,
      229,  227,  225,  240,  239,  237,  219,  236,  216,  235,
      234,  212,  208,  206,  229,  227,  225,  200,  195,  219,
      216,  213,  212,  186,  208,  206,  203,  202,  177,  176,
      201,  200,  195,  192,  190,  187,  161,  186,  182,  181,
      177,  176,  173,  169,  168,  136,  161,  159,  150,  145,
      119,  136,  134,  132,  131,  123,  122,  119,  110,   86,

       94,   86,   81,   66,   56,   30,   30,  279,    5,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279
    } ;

static yyconst flex_int16_t yy_chk[566] =
    {   0,
      309,    9,    1,    1,    9,   26,   31,   53,   26,   31,
       53,  308,  307,  306,  305,  304,  303,  302,  301,  300,
      299,  298,  297,  296,  295,  294,  293,  292,  291,  290,
        1,    2,    2,    2,    2,    2,    2,    2,    2,    2,
        2,    2,    2,    2,    2,    2,    2,    2,    2,    2,
        2,    2,    2,    2,    2,    2,    2,    2,    2,    2,
        2,    2,    2,    2,    2,    2,    2,    2,    2,    2,
        2,    2,    2,    2,    2,    2,    2,    2,    2,    2,
        2,    2,    2,    2,    2,    2,    2,    3,    4,  289,
      288,   10,   11,   12,   13,   14,    4,   15,   16,   17,

       11,   18,   20,   19,   21,   22,   23,   24,   27,   34,
       35,   24,   17,   19,  287,    3,    4,   10,   11,   12,
       13,   14,    4,   15,   16,   17,   11,   18,   20,   19,
       21,   22,   23,   24,   27,   34,   35,   24,   17,   19,
       36,   37,   38,   39,   40,   41,   43,   44,   45,   46,
       47,   48,   49,   50,   51,   36,   55,   56,   57,   58,
       46,   60,   61,   62,   63,   65,   36,   37,   38,   39,
       40,   41,   43,   44,   45,   46,   47,   48,   49,   50,
       51,   36,   55,   56,   57,   58,   46,   60,   61,   62,
       63,   65,   66,   67,   68,   70,   66,   71,   72,   66,

       73,   74,   66,   75,   76,   77,   78,   79,   80,   82,
       83,   84,   85,   88,   89,   90,  286,   92,   66,   67,
       68,   70,   66,   71,   72,   66,   73,   74,   66,   75,
       76,   77,   78,   79,   80,   82,   83,   84,   85,   88,
       89,   90,   91,   92,   93,   95,   96,   99,  100,  101,
      102,  103,  104,  105,  108,  111,  112,  113,  114,  115,
      116,   91,  117,  120,  122,  123,  124,  125,   91,  127,
       93,   95,   96,   99,  100,  101,  102,  103,  104,  105,
      108,  111,  112,  113,  114,  115,  116,   91,  117,  120,
      122,  123,  124,  125,  128,  127,  129,  130,  131,  131,

      132,  137,  138,  139,  140,  141,  132,  142,  145,  146,
      147,  149,  152,  153,  154,  157,  158,  163,  164,  166,
      128,  168,  129,  130,  131,  131,  132,  137,  138,  139,
      140,  141,  132,  142,  145,  146,  147,  149,  152,  153,
      154,  157,  158,  163,  164,  166,  170,  168,  171,  172,
      180,  183,  184,  189,  191,  193,  196,  197,  198,  204,
      209,  210,  221,  231,  232,  237,  238,  243,  248,  249,
      256,  257,  170,  258,  171,  172,  180,  183,  184,  189,
      191,  193,  196,  197,  198,  204,  209,  210,  221,  231,
      232,  237,  238,  243,  248,  249,  256,  257,  262,  258,

      263,  267,  285,  284,  282,  278,  276,  274,  273,  271,
      270,  269,  268,  266,  264,  261,  259,  255,  254,  252,
      251,  247,  245,  242,  262,  241,  263,  267,  280,  280,
      281,  281,  283,  283,  240,  239,  236,  235,  234,  230,
      229,  227,  225,  223,  222,  220,  219,  217,  216,  214,
      213,  212,  208,  206,  203,  202,  201,  200,  195,  192,
      190,  188,  187,  186,  182,  181,  179,  178,  177,  176,
      174,  173,  169,  167,  165,  162,  161,  159,  156,  155,
      151,  150,  148,  144,  143,  136,  134,  133,  126,  121,
      119,  110,  109,  107,  106,   98,   97,   94,   87,   86,

       69,   64,   59,   42,   33,   29,    8,    5,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279,  279,  279,  279,  279,  279,
      279,  279,  279,  279,  279
    } ;

static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;

extern int yy_map_header_flex_debug;
int yy_map_header_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 *yy_map_headertext;
#line 1 "src/loaders/map_header.l"
#line 2 "src/loaders/map_header.l"
/************************************************************************
*            Atrinik, a Multiplayer Online Role Playing Game            *
*                                                                       *
*    Copyright (C) 2009-2011 Alex Tokar and Atrinik Development Team    *
*                                                                       *
* Fork from Daimonin (Massive Multiplayer Online Role Playing Game)     *
* and Crossfire (Multiplayer game for X-windows).                       *
*                                                                       *
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.             *
*                                                                       *
* The author can be reached at admin@atrinik.org                        *
************************************************************************/

#include <global.h>
#include <loader.h>

#define YY_DECL int map_lex_load(mapstruct *m)

static char *yval();

static char msgbuf[HUGE_BUF];
static int lex_error, msg_flag;

#define IVAL atoi(yval())

#define SET_OR_CLEAR_MAP_FLAG(m, flag, val) \
{ \
    if (val) \
    { \
        m->map_flags |= (flag); \
    } \
    else \
    { \
        m->map_flags &= ~(flag); \
    } \
}

#define YY_NO_INPUT

/* Don't have to link with -lfl with this */
/* Disable unput */
/* Disable tt_top_state */
/* need yy_push_state, yy_pop_state */
#line 759 "src/loaders/map_header.c"

#define INITIAL 0
#define MESSAGE 1

#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

static int yy_init_globals (void );

/* Accessor methods to globals.
   These are made visible to non-reentrant scanners for convenience. */

int yy_map_headerlex_destroy (void );

int yy_map_headerget_debug (void );

void yy_map_headerset_debug (int debug_flag  );

YY_EXTRA_TYPE yy_map_headerget_extra (void );

void yy_map_headerset_extra (YY_EXTRA_TYPE user_defined  );

FILE *yy_map_headerget_in (void );

void yy_map_headerset_in  (FILE * in_str  );

FILE *yy_map_headerget_out (void );

void yy_map_headerset_out  (FILE * out_str  );

int yy_map_headerget_leng (void );

char *yy_map_headerget_text (void );

int yy_map_headerget_lineno (void );

void yy_map_headerset_lineno (int line_number  );

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

#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
extern "C" int yy_map_headerwrap (void );
#else
extern int yy_map_headerwrap (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

        static int yy_start_stack_ptr = 0;
        static int yy_start_stack_depth = 0;
        static int *yy_start_stack = NULL;
    
    static void yy_push_state (int new_state );
    
    static void yy_pop_state (void );
    
/* Amount of stuff to slurp up with each read. */
#ifndef YY_READ_BUF_SIZE
#ifdef __ia64__
/* On IA-64, the buffer size is 16k, not 8k */
#define YY_READ_BUF_SIZE 16384
#else
#define YY_READ_BUF_SIZE 8192
#endif /* __ia64__ */
#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 do { if (fwrite( yy_map_headertext, yy_map_headerleng, 1, yy_map_headerout )) {} } while (0)
#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( yy_map_headerin )) != EOF && c != '\n'; ++n ) \
            buf[n] = (char) c; \
        if ( c == '\n' ) \
            buf[n++] = (char) c; \
        if ( c == EOF && ferror( yy_map_headerin ) ) \
            YY_FATAL_ERROR( "input in flex scanner failed" ); \
        result = n; \
        } \
    else \
        { \
        errno=0; \
        while ( (result = fread(buf, 1, max_size, yy_map_headerin))==0 && ferror(yy_map_headerin)) \
            { \
            if( errno != EINTR) \
                { \
                YY_FATAL_ERROR( "input in flex scanner failed" ); \
                break; \
                } \
            errno=0; \
            clearerr(yy_map_headerin); \
            } \
        }\
\

#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 yy_map_headerlex (void);

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

/* Code executed at the beginning of each rule, after yy_map_headertext and yy_map_headerleng
 * 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 \
    if ( yy_map_headerleng > 0 ) \
        YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \
                (yy_map_headertext[yy_map_headerleng - 1] == '\n'); \
    YY_USER_ACTION

YY_DECL
{
    register yy_state_type yy_current_state;
    register char *yy_cp, *yy_bp;
    register int yy_act;
    
#line 71 "src/loaders/map_header.l"



/* Declare some local variables */
lex_error = 0;


#line 964 "src/loaders/map_header.c"

    if ( !(yy_init) )
        {
        (yy_init) = 1;

#ifdef YY_USER_INIT
        YY_USER_INIT;
#endif

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

        if ( ! yy_map_headerin )
            yy_map_headerin = stdin;

        if ( ! yy_map_headerout )
            yy_map_headerout = stdout;

        if ( ! YY_CURRENT_BUFFER ) {
            yy_map_headerensure_buffer_stack ();
            YY_CURRENT_BUFFER_LVALUE =
                yy_map_header_create_buffer(yy_map_headerin,YY_BUF_SIZE );
        }

        yy_map_header_load_buffer_state( );
        }

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

        /* Support of yy_map_headertext. */
        *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_current_state += YY_AT_BOL();
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 >= 280 )
                    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_base[yy_current_state] != 509 );

yy_find_action:
        yy_act = yy_accept[yy_current_state];
        if ( yy_act == 0 )
            { /* have to back up */
            yy_cp = (yy_last_accepting_cpos);
            yy_current_state = (yy_last_accepting_state);
            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 78 "src/loaders/map_header.l"
m->name = strdup_local(yval());
    YY_BREAK
case 2:
YY_RULE_SETUP
#line 79 "src/loaders/map_header.l"
m->bg_music = strdup_local(yval());
    YY_BREAK
case 3:
YY_RULE_SETUP
#line 80 "src/loaders/map_header.l"
m->weather = strdup_local(yval());
    YY_BREAK
case 4:
YY_RULE_SETUP
#line 81 "src/loaders/map_header.l"
m->region = get_region_by_name(yval());
    YY_BREAK
case 5:
YY_RULE_SETUP
#line 82 "src/loaders/map_header.l"
m->enter_x = IVAL;
    YY_BREAK
case 6:
YY_RULE_SETUP
#line 83 "src/loaders/map_header.l"
m->enter_y = IVAL;
    YY_BREAK
case 7:
YY_RULE_SETUP
#line 84 "src/loaders/map_header.l"
m->width = IVAL;
    YY_BREAK
case 8:
YY_RULE_SETUP
#line 85 "src/loaders/map_header.l"
m->height = IVAL;
    YY_BREAK
case 9:
YY_RULE_SETUP
#line 87 "src/loaders/map_header.l"
m->reset_timeout = IVAL;
    YY_BREAK
case 10:
YY_RULE_SETUP
#line 88 "src/loaders/map_header.l"
m->swap_time = IVAL;
    YY_BREAK
case 11:
YY_RULE_SETUP
#line 89 "src/loaders/map_header.l"
m->difficulty = IVAL;
    YY_BREAK
case 12:
YY_RULE_SETUP
#line 90 "src/loaders/map_header.l"
{
                        int v = IVAL;

                        if (v < -1 || v > MAX_DARKNESS)
                        {
                            LOG(llevBug, "Illegal map darkness %d (must be -1 to %d, defaulting to -1).\n", v, MAX_DARKNESS);
                        }
                        else
                        {
                            set_map_darkness(m, v);
                        }
                     }
    YY_BREAK
case 13:
YY_RULE_SETUP
#line 102 "src/loaders/map_header.l"
m->light_value = IVAL;
    YY_BREAK
case 14:
YY_RULE_SETUP
#line 103 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_NO_SAVE, IVAL);
    YY_BREAK
case 15:
YY_RULE_SETUP
#line 104 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_NOMAGIC, IVAL);
    YY_BREAK
case 16:
YY_RULE_SETUP
#line 105 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_NOPRIEST, IVAL);
    YY_BREAK
case 17:
YY_RULE_SETUP
#line 106 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_NOHARM, IVAL);
    YY_BREAK
case 18:
YY_RULE_SETUP
#line 107 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_NOSUMMON, IVAL);
    YY_BREAK
case 19:
YY_RULE_SETUP
#line 108 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_FIXED_LOGIN, IVAL);
    YY_BREAK
case 20:
YY_RULE_SETUP
#line 109 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_PLAYER_NO_SAVE, IVAL);
    YY_BREAK
case 21:
YY_RULE_SETUP
#line 110 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_PVP, IVAL);
    YY_BREAK
case 22:
YY_RULE_SETUP
#line 111 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_OUTDOOR, IVAL);
    YY_BREAK
case 23:
YY_RULE_SETUP
#line 112 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_UNIQUE, IVAL);
    YY_BREAK
case 24:
YY_RULE_SETUP
#line 113 "src/loaders/map_header.l"
SET_OR_CLEAR_MAP_FLAG(m, MAP_FLAG_FIXED_RTIME, IVAL);
    YY_BREAK
case 25:
YY_RULE_SETUP
#line 114 "src/loaders/map_header.l"
{
                        int tile = atoi(yy_map_headertext + 10);

                        if (tile < 1 || tile > TILED_MAPS)
                        {
                            LOG(llevBug, "load_map_header(): Tile location %d out of bounds (%s)\n", tile, m->path);
                        }
                        else
                        {
                            char *value = yval(), path[HUGE_BUF];

                            if (m->tile_path[tile - 1])
                            {
                                LOG(llevBug, "load_map_header(): Tile location %d duplicated (%s <-> %s)\n", tile, m->path, m->tile_path[tile - 1]);
                                FREE_AND_CLEAR_HASH(m->tile_path[tile - 1]);
                            }

                            /* If path is not absolute, try to normalize it */
                            if (check_path(value, 1) == -1)
                            {
                                normalize_path(m->path, value, path);

                                if (check_path(path, 1) == -1)
                                {
                                    LOG(llevBug, "load_map_header(): Can not normalize tile path %s %s %s\n", m->path, value, msgbuf);
                                    value = NULL;
                                }
                                else
                                {
                                    value = path;
                                }
                            }

                            /* We have a correct path to a neighbor tile */
                            if (value)
                            {
                                mapstruct *neighbor;
                                shstr *path_sh = add_string(value);

                                m->tile_path[tile - 1] = path_sh;

                                /* If the neighboring map tile has been loaded, set up the map pointers */
                                if ((neighbor = has_been_loaded_sh(path_sh)) && (neighbor->in_memory == MAP_IN_MEMORY || neighbor->in_memory == MAP_LOADING))
                                {
                                    int dest_tile = map_tiled_reverse[tile - 1];

                                    m->tile_map[tile - 1] = neighbor;

                                    if (neighbor->tile_path[dest_tile] == NULL || neighbor->tile_path[dest_tile] == m->path)
                                    {
                                        neighbor->tile_map[dest_tile] = m;
                                    }
                                }
                            }
                        }
                     }
    YY_BREAK
case 26:
YY_RULE_SETUP
#line 170 "src/loaders/map_header.l"
{
                        BEGIN(MESSAGE);
                        msgbuf[0] = '\0';
                        msg_flag = 0;
                     }
    YY_BREAK
case 27:
YY_RULE_SETUP
#line 175 "src/loaders/map_header.l"
{
                        BEGIN(INITIAL);

                        m->msg = strdup_local(msgbuf);
                     }
    YY_BREAK
case 28:
YY_RULE_SETUP
#line 180 "src/loaders/map_header.l"
{
                        if (msg_flag)
                        {
                            strcat(msgbuf, "\n");
                        }

                        msg_flag = 1;
                        strcat(msgbuf, yy_map_headertext);
                     }
    YY_BREAK
case 29:
/* rule 29 can match eol */
YY_RULE_SETUP
#line 190 "src/loaders/map_header.l"
{/* ignore empty lines, newlines we don't do above */}
    YY_BREAK
case 30:
/* rule 30 can match eol */
YY_RULE_SETUP
#line 191 "src/loaders/map_header.l"
{}
    YY_BREAK
case 31:
/* rule 31 can match eol */
YY_RULE_SETUP
#line 192 "src/loaders/map_header.l"
return LL_EOF;
    YY_BREAK
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(MESSAGE):
#line 194 "src/loaders/map_header.l"
{
                        return LL_MORE;
                     }
    YY_BREAK
case 32:
YY_RULE_SETUP
#line 198 "src/loaders/map_header.l"
{
                        LOG(llevBug, "Got unknown value in map header: %s\n", yy_map_headertext);
                        return LL_NORMAL;
                     }
    YY_BREAK
case 33:
YY_RULE_SETUP
#line 203 "src/loaders/map_header.l"
ECHO;
    YY_BREAK
#line 1308 "src/loaders/map_header.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 yy_map_headerin at a new source and called
             * yy_map_headerlex().  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 = yy_map_headerin;
            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_c_buf_p);
                goto yy_find_action;
                }
            }

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

                if ( yy_map_headerwrap( ) )
                    {
                    /* Note: because we've taken care in
                     * yy_get_next_buffer() to have set up
                     * yy_map_headertext, 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 yy_map_headerlex */

/* 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. */
                    yy_map_headerrealloc((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), (size_t) 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;
            yy_map_headerrestart(yy_map_headerin  );
            }

        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;

    if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
        /* Extend the array by 50%, plus the number we really need. */
        yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
        YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yy_map_headerrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size  );
        if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
            YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
    }

    (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);
    yy_current_state += YY_AT_BOL();

    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 >= 280 )
                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 >= 280 )
            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 == 279);

    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. */
                    yy_map_headerrestart(yy_map_headerin );

                    /*FALLTHROUGH*/

                case EOB_ACT_END_OF_FILE:
                    {
                    if ( yy_map_headerwrap( ) )
                        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 yy_map_headertext */
    (yy_hold_char) = *++(yy_c_buf_p);

    YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n');

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

    void yy_map_headerrestart  (FILE * input_file )
{
    
    if ( ! YY_CURRENT_BUFFER ){
        yy_map_headerensure_buffer_stack ();
        YY_CURRENT_BUFFER_LVALUE =
            yy_map_header_create_buffer(yy_map_headerin,YY_BUF_SIZE );
    }

    yy_map_header_init_buffer(YY_CURRENT_BUFFER,input_file );
    yy_map_header_load_buffer_state( );
}

    void yy_map_header_switch_to_buffer  (YY_BUFFER_STATE  new_buffer )
{
    
    /* TODO. We should be able to replace this entire function body
     * with
     *      yy_map_headerpop_buffer_state();
     *      yy_map_headerpush_buffer_state(new_buffer);
     */
    yy_map_headerensure_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;
    yy_map_header_load_buffer_state( );

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

static void yy_map_header_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;
    yy_map_headerin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
    (yy_hold_char) = *(yy_c_buf_p);
}

    YY_BUFFER_STATE yy_map_header_create_buffer  (FILE * file, int  size )
{
    YY_BUFFER_STATE b;
    
    b = (YY_BUFFER_STATE) yy_map_headeralloc(sizeof( struct yy_buffer_state )  );
    if ( ! b )
        YY_FATAL_ERROR( "out of dynamic memory in yy_map_header_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 *) yy_map_headeralloc(b->yy_buf_size + 2  );
    if ( ! b->yy_ch_buf )
        YY_FATAL_ERROR( "out of dynamic memory in yy_map_header_create_buffer()" );

    b->yy_is_our_buffer = 1;

    yy_map_header_init_buffer(b,file );

    return b;
}

    void yy_map_header_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 )
        yy_map_headerfree((void *) b->yy_ch_buf  );

    yy_map_headerfree((void *) b  );
}

#ifndef __cplusplus
extern int isatty (int );
#endif /* __cplusplus */
    
/* Initializes or reinitializes a buffer.
 * This function is sometimes called more than once on the same buffer,
 * such as during a yy_map_headerrestart() or at EOF.
 */
    static void yy_map_header_init_buffer  (YY_BUFFER_STATE  b, FILE * file )

{
    int oerrno = errno;
    
    yy_map_header_flush_buffer(b );

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

    /* If b is the current buffer, then yy_map_header_init_buffer was _probably_
     * called from yy_map_headerrestart() 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 = file ? (isatty( fileno(file) ) > 0) : 0;
    
    errno = oerrno;
}

    void yy_map_header_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 )
        yy_map_header_load_buffer_state( );
}

void yy_map_headerpush_buffer_state (YY_BUFFER_STATE new_buffer )
{
        if (new_buffer == NULL)
        return;

    yy_map_headerensure_buffer_stack();

    /* This block is copied from yy_map_header_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 yy_map_header_switch_to_buffer. */
    yy_map_header_load_buffer_state( );
    (yy_did_buffer_switch_on_eof) = 1;
}

void yy_map_headerpop_buffer_state (void)
{
        if (!YY_CURRENT_BUFFER)
        return;

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

    if (YY_CURRENT_BUFFER) {
        yy_map_header_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 yy_map_headerensure_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**)yy_map_headeralloc
                                (num_to_alloc * sizeof(struct yy_buffer_state*)
                                );
        if ( ! (yy_buffer_stack) )
            YY_FATAL_ERROR( "out of dynamic memory in yy_map_headerensure_buffer_stack()" );
                                  
        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**)yy_map_headerrealloc
                                ((yy_buffer_stack),
                                num_to_alloc * sizeof(struct yy_buffer_state*)
                                );
        if ( ! (yy_buffer_stack) )
            YY_FATAL_ERROR( "out of dynamic memory in yy_map_headerensure_buffer_stack()" );

        /* 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;
    }
}

YY_BUFFER_STATE yy_map_header_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) yy_map_headeralloc(sizeof( struct yy_buffer_state )  );
    if ( ! b )
        YY_FATAL_ERROR( "out of dynamic memory in yy_map_header_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;

    yy_map_header_switch_to_buffer(b  );

    return b;
}

YY_BUFFER_STATE yy_map_header_scan_string (yyconst char * yystr )
{
    
    return yy_map_header_scan_bytes(yystr,strlen(yystr) );
}

YY_BUFFER_STATE yy_map_header_scan_bytes  (yyconst char * yybytes, int  _yybytes_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 = _yybytes_len + 2;
    buf = (char *) yy_map_headeralloc(n  );
    if ( ! buf )
        YY_FATAL_ERROR( "out of dynamic memory in yy_map_header_scan_bytes()" );

    for ( i = 0; i < _yybytes_len; ++i )
        buf[i] = yybytes[i];

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

    b = yy_map_header_scan_buffer(buf,n );
    if ( ! b )
        YY_FATAL_ERROR( "bad buffer in yy_map_header_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;
}

    static void yy_push_state (int  new_state )
{
        if ( (yy_start_stack_ptr) >= (yy_start_stack_depth) )
        {
        yy_size_t new_size;

        (yy_start_stack_depth) += YY_START_STACK_INCR;
        new_size = (yy_start_stack_depth) * sizeof( int );

        if ( ! (yy_start_stack) )
            (yy_start_stack) = (int *) yy_map_headeralloc(new_size  );

        else
            (yy_start_stack) = (int *) yy_map_headerrealloc((void *) (yy_start_stack),new_size  );

        if ( ! (yy_start_stack) )
            YY_FATAL_ERROR( "out of memory expanding start-condition stack" );
        }

    (yy_start_stack)[(yy_start_stack_ptr)++] = YY_START;

    BEGIN(new_state);
}

    static void yy_pop_state  (void)
{
        if ( --(yy_start_stack_ptr) < 0 )
        YY_FATAL_ERROR( "start-condition stack underflow" );

    BEGIN((yy_start_stack)[(yy_start_stack_ptr)]);
}

#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 yy_map_headertext. */ \
        int yyless_macro_arg = (n); \
        YY_LESS_LINENO(yyless_macro_arg);\
        yy_map_headertext[yy_map_headerleng] = (yy_hold_char); \
        (yy_c_buf_p) = yy_map_headertext + yyless_macro_arg; \
        (yy_hold_char) = *(yy_c_buf_p); \
        *(yy_c_buf_p) = '\0'; \
        yy_map_headerleng = yyless_macro_arg; \
        } \
    while ( 0 )

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

int yy_map_headerget_lineno  (void)
{
        
    return yy_map_headerlineno;
}

FILE *yy_map_headerget_in  (void)
{
        return yy_map_headerin;
}

FILE *yy_map_headerget_out  (void)
{
        return yy_map_headerout;
}

int yy_map_headerget_leng  (void)
{
        return yy_map_headerleng;
}

char *yy_map_headerget_text  (void)
{
        return yy_map_headertext;
}

void yy_map_headerset_lineno (int  line_number )
{
    
    yy_map_headerlineno = line_number;
}

void yy_map_headerset_in (FILE *  in_str )
{
        yy_map_headerin = in_str ;
}

void yy_map_headerset_out (FILE *  out_str )
{
        yy_map_headerout = out_str ;
}

int yy_map_headerget_debug  (void)
{
        return yy_map_header_flex_debug;
}

void yy_map_headerset_debug (int  bdebug )
{
        yy_map_header_flex_debug = bdebug ;
}

static int yy_init_globals (void)
{
        /* Initialization is the same as for the non-reentrant scanner.
     * This function is called from yy_map_headerlex_destroy(), so don't allocate here.
     */

    (yy_buffer_stack) = 0;
    (yy_buffer_stack_top) = 0;
    (yy_buffer_stack_max) = 0;
    (yy_c_buf_p) = (char *) 0;
    (yy_init) = 0;
    (yy_start) = 0;

    (yy_start_stack_ptr) = 0;
    (yy_start_stack_depth) = 0;
    (yy_start_stack) =  NULL;

/* Defined in main.c */
#ifdef YY_STDINIT
    yy_map_headerin = stdin;
    yy_map_headerout = stdout;
#else
    yy_map_headerin = (FILE *) 0;
    yy_map_headerout = (FILE *) 0;
#endif

    /* For future reference: Set errno on error, since we are called by
     * yy_map_headerlex_init()
     */
    return 0;
}

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

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

    /* Destroy the start condition stack. */
        yy_map_headerfree((yy_start_stack)  );
        (yy_start_stack) = NULL;

    /* Reset the globals. This is important in a non-reentrant scanner so the next time
     * yy_map_headerlex() is called, initialization will occur. */
    yy_init_globals( );

    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 *yy_map_headeralloc (yy_size_t  size )
{
    return (void *) malloc( size );
}

void *yy_map_headerrealloc  (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 yy_map_headerfree (void * ptr )
{
    free( (char *) ptr );   /* see yy_map_headerrealloc() for (char *) cast */
}

#define YYTABLES_NAME "yytables"

#line 203 "src/loaders/map_header.l"



static char *yval()
{
    static char *em = "";
    char *cp, *end;

    /* First skip over start of line, like animation or name */
    for (cp = yy_map_headertext; *cp != ' '; cp++)
    {
        if (*cp == '\0')
        {
            return em;
        }
    }

    /* Skip over whitespace */
    for (; *cp == ' '; cp++)
    {
        if (*cp == '\0')
        {
            return em;
        }
    }

    /* Get last character before null and strip
     * off trailing whitespace. */
    for (end = cp + strlen(cp) - 1; *end == ' ' || *end == 0x0A || *end == 0x0D; end--)
    {
        if (end == cp)
        {
            return em;
        }

        *end = '\0';
    }

    return cp;
}

int map_set_variable(mapstruct *m, char *buf)
{
    YY_BUFFER_STATE yybufstate, yycurbuf = YY_CURRENT_BUFFER;
    int retval;

    yy_push_state(INITIAL);
    yybufstate = yy_map_header_scan_string(buf);

    retval = map_lex_load(m);

    if (yycurbuf)
    {
        yy_map_header_switch_to_buffer(yycurbuf);
    }

    yy_map_header_delete_buffer(yybufstate);
    yy_pop_state();

    return retval;
}

int load_map_header(mapstruct *m, FILE *fp)
{
    char inbuf[HUGE_BUF];
    YY_BUFFER_STATE yybufstate;
    int retval;

    if (!fgets(inbuf, sizeof(inbuf) - 1, fp) || strcmp(inbuf, "arch map\n"))
    {
        LOG(llevBug, "load_map_header(): First line should always be 'arch map', but it is not (%s)\n", m->path);
        return 0;
    }

    while (fgets(inbuf, sizeof(inbuf) - 1, fp))
    {
        yybufstate = yy_map_header_scan_string(inbuf);
        retval = map_lex_load(m);
        yy_map_header_delete_buffer(yybufstate);

        if (retval == LL_ERROR)
        {
            return 0;
        }
        else if (retval == LL_EOF)
        {
            return 1;
        }
    }

    return 1;
}

void save_map_header(mapstruct *m, FILE *fp, int flag)
{
    int i;

    fprintf(fp, "arch map\n");

    if (m->name)
    {
        fprintf(fp, "name %s\n", m->name);
    }

    if (m->bg_music)
    {
        fprintf(fp, "bg_music %s\n", m->bg_music);
    }

    if (m->weather)
    {
        fprintf(fp, "weather %s\n", m->weather);
    }

    if (m->region)
    {
        fprintf(fp, "region %s\n", m->region->name);
    }

    if (!flag)
    {
        fprintf(fp, "swap_time %d\n", m->swap_time);
    }

    if (m->reset_timeout)
    {
        fprintf(fp, "reset_timeout %d\n", m->reset_timeout);
    }

    if (MAP_FIXED_RESETTIME(m))
    {
        fprintf(fp, "fixed_resettime 1\n");
    }

    if (m->difficulty)
    {
        fprintf(fp, "difficulty %d\n", m->difficulty);
    }

    fprintf(fp, "darkness %d\n", m->darkness);
    fprintf(fp, "light %d\n", m->light_value);

    if (m->width)
    {
        fprintf(fp, "width %d\n", m->width);
    }

    if (m->height)
    {
        fprintf(fp, "height %d\n", m->height);
    }

    if (m->enter_x)
    {
        fprintf(fp, "enter_x %d\n", m->enter_x);
    }

    if (m->enter_y)
    {
        fprintf(fp, "enter_y %d\n", m->enter_y);
    }

    if (m->msg)
    {
        fprintf(fp, "msg\n%s\nendmsg\n", m->msg);
    }

    if (MAP_UNIQUE(m))
    {
        fprintf(fp, "unique 1\n");
    }

    if (MAP_OUTDOORS(m))
    {
        fprintf(fp, "outdoor 1\n");
    }

    if (MAP_NOSAVE(m))
    {
        fprintf(fp, "no_save 1\n");
    }

    if (MAP_NOMAGIC(m))
    {
        fprintf(fp, "no_magic 1\n");
    }

    if (MAP_NOPRIEST(m))
    {
        fprintf(fp, "no_priest 1\n");
    }

    if (MAP_NOHARM(m))
    {
        fprintf(fp, "no_harm 1\n");
    }

    if (MAP_NOSUMMON(m))
    {
        fprintf(fp, "no_summon 1\n");
    }

    if (MAP_FIXEDLOGIN(m))
    {
        fprintf(fp, "fixed_login 1\n");
    }

    if (MAP_PVP(m))
    {
        fprintf(fp, "pvp 1\n");
    }

    /* Save any tiling information */
    for (i = 0; i < TILED_MAPS; i++)
    {
        if (m->tile_path[i])
        {
            fprintf(fp, "tile_path_%d %s\n", i + 1, m->tile_path[i]);
        }
    }

    fprintf(fp, "end\n");
}