#include <stdlib.h>

#include <string.h>

#define YYBYACC 1

#define YYMAJOR 1

#define YYMINOR 9

#define YYLEX yylex()

#define YYEMPTY -1

#define yyclearin (yychar=(YYEMPTY))

#define yyerrok (yyerrflag=0)

#define YYRECOVERING() (yyerrflag!=0)

#define YYPREFIX "yy"

#line 5 "yacc.y"

/*-

 * Copyright (c) 1993

 *	The Regents of the University of California.  All rights reserved.

 *

 * This code is derived from software contributed to Berkeley by

 * Paul Borman at Krystal Technologies.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 * 3. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND

 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE

 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS

 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT

 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY

 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF

 * SUCH DAMAGE.

 */

#include <sys/types.h>

#include <netinet/in.h>	/* Needed by <arpa/inet.h> on NetBSD 1.5. */

#include <arpa/inet.h>	/* Needed for htonl on POSIX systems. */

#include <err.h>

#include "locale/runetype.h"

#include <stddef.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <unistd.h>

#include <ctype.h>

#include "ldef.h"

const char	*locale_file = "<stdout>";

rune_map	maplower = { { 0, }, };

rune_map	mapupper = { { 0, }, };

rune_map	types = { { 0, }, };

_RuneLocale	new_locale = { { 0, }, };

rune_t	charsetbits = (rune_t)0x00000000;

#if 0

rune_t	charsetmask = (rune_t)0x0000007f;

#endif

rune_t	charsetmask = (rune_t)0xffffffff;

void set_map(rune_map *, rune_list *, u_int32_t);

void add_map(rune_map *, rune_list *, u_int32_t);

int		main(int, char *[]);

int		yyerror(const char *s);

void		*xmalloc(size_t sz);

u_int32_t	*xlalloc(size_t sz);

u_int32_t	*xrelalloc(u_int32_t *old, size_t sz);

void		dump_tables(void);

int		yyparse(void);

extern int	yylex(void);

#line 79 "yacc.y"

#ifndef YYSTYPE_DEFINED

#define YYSTYPE_DEFINED

typedef union	{

    rune_t	rune;

    int		i;

    char	*str;

    rune_list	*list;

} YYSTYPE;

#endif /* YYSTYPE_DEFINED */

#line 97 "yacc.c"

#define RUNE 257

#define LBRK 258

#define RBRK 259

#define THRU 260

#define MAPLOWER 261

#define MAPUPPER 262

#define DIGITMAP 263

#define LIST 264

#define VARIABLE 265

#define CHARSET 266

#define ENCODING 267

#define INVALID 268

const short yylhs[] =

	{                                        -1,

    0,    0,    3,    3,    4,    4,    4,    4,    4,    4,

    4,    4,    4,    4,    1,    1,    1,    1,    2,    2,

    2,    2,    5,    5,    5,    5,

};

    7,    8,    4,    5,    7,    8,

};

};

   19,   13,   10,   11,   17,

};

    0,    0,    0,    0, -246, -220, -242, -219, -218, -217,

    0, -227, -216, -241, -215, -212, -240,    0, -210,    0,

  -18, -211, -208,    0,  -16, -209, -206,    0, -205,    0,

   -5, -203,    0,   -3, -201, -198, -199, -196,    0, -197,

    0, -195,    0,    0,};

    0,    0,    0,    0,    0,    0,    0,    0,    0,   63,

    0,    0,   65,   73,    0,    0,    0,    1,   81,   89,

    0,    0,    0,    0,    0,    0,    0,    0,    0,   13,

    0,    0,   35,    0,    0,    0,    0,    0,    0,    0,

   46,    0,    0,   57,};

const short yygindex[] =

	{                                      0,

};

   54,   55,   56,   57,   58,    1,   26,   59,   60,   61,

   62,   63,    2,   64,   12,    0,    0,   24,    0,    0,

    0,    0,   13,    0,    0,    0,    0,    0,    0,    0,

   11,    0,    0,    0,    0,    0,    0,    0,    7,    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,

    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,

    0,    0,    0,    0,    0,    0,    0,   15,    0,    0,

   25,   25,   25,   25,   22,    0,    0,   26,   26,   26,

   12,   12,   12,   13,   13,   13,   13,   13,   13,   13,

};

    0,  261,  262,  263,  264,  265,  266,  267,  268,  258,

    2,    3,  258,    0,  257,  269,  257,  257,  260,  258,

  257,  259,  258,  257,    0,  257,  257,  257,  257,   58,

  257,   58,  260,  259,  257,    0,  257,  259,  257,  259,

   -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,  261,  262,  263,  264,  265,  266,  267,  268,  257,

  268,  258,   -1,   -1,  261,  262,  263,  264,  265,  266,

  268,  261,  262,  263,  264,  265,  266,  267,  268,  261,

};

#define YYFINAL 9

#ifndef YYDEBUG

#define YYDEBUG 0

#endif

#define YYMAXTOKEN 269

#if YYDEBUG

const char * const yyname[] =

	{

"end-of-file",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,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,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,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,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,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,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,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,0,0,0,0,0,0,0,"RUNE","LBRK","RBRK","THRU",

"MAPLOWER","MAPUPPER","DIGITMAP","LIST","VARIABLE","CHARSET","ENCODING",

"INVALID","STRING",

};

const char * const yyrule[] =

	{"$accept : locale",

"locale :",

"locale : table",

"table : entry",

"table : table entry",

"entry : ENCODING STRING",

"entry : VARIABLE",

"entry : CHARSET RUNE",

"entry : CHARSET RUNE RUNE",

"entry : CHARSET STRING",

"entry : INVALID RUNE",

"entry : LIST list",

"entry : MAPLOWER map",

"entry : MAPUPPER map",

"entry : DIGITMAP mapignore",

"list : RUNE",

"list : RUNE THRU RUNE",

"list : list RUNE",

"list : list RUNE THRU RUNE",

"map : LBRK RUNE RUNE RBRK",

"map : map LBRK RUNE RUNE RBRK",

"map : LBRK RUNE THRU RUNE ':' RUNE RBRK",

"map : map LBRK RUNE THRU RUNE ':' RUNE RBRK",

"mapignore : LBRK RUNE RUNE RBRK",

"mapignore : map LBRK RUNE RUNE RBRK",

"mapignore : LBRK RUNE THRU RUNE ':' RUNE RBRK",

"mapignore : map LBRK RUNE THRU RUNE ':' RUNE RBRK",

};

#endif

#ifdef YYSTACKSIZE

#undef YYMAXDEPTH

#define YYMAXDEPTH YYSTACKSIZE

#else

#ifdef YYMAXDEPTH

#define YYSTACKSIZE YYMAXDEPTH

#else

#define YYSTACKSIZE 10000

#define YYMAXDEPTH 10000

#endif

#endif

#define YYINITSTACKSIZE 200

/* LINTUSED */

int yydebug;

int yynerrs;

int yyerrflag;

int yychar;

short *yyssp;

YYSTYPE *yyvsp;

YYSTYPE yyval;

YYSTYPE yylval;

short *yyss;

short *yysslim;

YYSTYPE *yyvs;

unsigned int yystacksize;

int yyparse(void);

#line 244 "yacc.y"

int debug = 0;

FILE *ofile;

int

main(int ac, char *av[])

{

    int x;

    extern char *optarg;

    extern int optind;

    if (pledge("stdio rpath wpath cpath flock", NULL) == -1) {

	perror("pledge");

	exit(1);

    }

    while ((x = getopt(ac, av, "do:")) != -1) {

	switch(x) {

	case 'd':

	    debug = 1;

	    break;

	case 'o':

	    locale_file = optarg;

	    if ((ofile = fopen(locale_file, "w")) == 0)

		err(1, "unable to open output file %s", locale_file);

	    break;

	default:

	usage:

	    fprintf(stderr,

		"usage: mklocale [-d] [src-file] language/LC_CTYPE\n"

		"       mklocale [-d] -o language/LC_CTYPE src-file\n");

	    exit(1);

	}

    }

    switch (ac - optind) {

    case 0:

	break;

    case 1:

	if (freopen(av[optind], "r", stdin) == 0)

	    err(1, "unable to open input file %s", av[optind]);

	break;

    default:

	goto usage;

    }

    for (x = 0; x < _CACHED_RUNES; ++x) {

	mapupper.map[x] = x;

	maplower.map[x] = x;

    }

    new_locale.rl_invalid_rune = _DEFAULT_INVALID_RUNE;

    memcpy(new_locale.rl_magic, _RUNE_MAGIC_1, sizeof(new_locale.rl_magic));

    yyparse();

    return 0;

}

int

yyerror(const char *s)

{

    fprintf(stderr, "%s\n", s);

    return 0;

}

void *

xmalloc(size_t sz)

{

    void *r = malloc(sz);

    if (!r) {

	perror("xmalloc");

	abort();

    }

    return(r);

}

u_int32_t *

xlalloc(size_t sz)

{

    u_int32_t *r = reallocarray(NULL, sz, sizeof(u_int32_t));

    if (!r) {

	perror("xlalloc");

	abort();

    }

    return(r);

}

u_int32_t *

xrelalloc(u_int32_t *old, size_t sz)

{

    u_int32_t *r = reallocarray(old, sz, sizeof(u_int32_t));

    if (!r) {

	perror("xrelalloc");

	abort();

    }

    return(r);

}

void

set_map(rune_map *map, rune_list *list, u_int32_t flag)

{

    list->map &= charsetmask;

    list->map |= charsetbits;

    while (list) {

	rune_list *nlist = list->next;

	add_map(map, list, flag);

	list = nlist;

    }

}

void

add_map(rune_map *map, rune_list *list, u_int32_t flag)

{

    rune_t i;

    rune_list *lr = 0;

    rune_list *r;

    rune_t run;

    while (list->min < _CACHED_RUNES && list->min <= list->max) {

	if (flag)

	    map->map[list->min++] |= flag;

	else

	    map->map[list->min++] = list->map++;

    }

    if (list->min > list->max) {

	free(list);

	return;

    }

    run = list->max - list->min + 1;

    if (!(r = map->root) || (list->max < r->min - 1)

			 || (!flag && list->max == r->min - 1)) {

	if (flag) {

	    list->types = xlalloc(run);

	    for (i = 0; i < run; ++i)

		list->types[i] = flag;

	}

	list->next = map->root;

	map->root = list;

	return;

    }

    for (r = map->root; r && r->max + 1 < list->min; r = r->next)

	lr = r;

    if (!r) {

	/*

	 * We are off the end.

	 */

	if (flag) {

	    list->types = xlalloc(run);

	    for (i = 0; i < run; ++i)

		list->types[i] = flag;

	}

	list->next = 0;

	lr->next = list;

	return;

    }

    if (list->max < r->min - 1) {

	/*

	 * We come before this range and we do not intersect it.

	 * We are not before the root node, it was checked before the loop

	 */

	if (flag) {

	    list->types = xlalloc(run);

	    for (i = 0; i < run; ++i)

		list->types[i] = flag;

	}

	list->next = lr->next;

	lr->next = list;

	return;

    }

    /*

     * At this point we have found that we at least intersect with

     * the range pointed to by `r', we might intersect with one or

     * more ranges beyond `r' as well.

     */

    if (!flag && list->map - list->min != r->map - r->min) {

	/*

	 * There are only two cases when we are doing case maps and

	 * our maps needn't have the same offset.  When we are adjoining

	 * but not intersecting.

	 */

	if (list->max + 1 == r->min) {

	    lr->next = list;

	    list->next = r;

	    return;

	}

	if (list->min - 1 == r->max) {

	    list->next = r->next;

	    r->next = list;

	    return;

	}

	fprintf(stderr, "Error: conflicting map entries\n");

	exit(1);

    }

    if (list->min >= r->min && list->max <= r->max) {

	/*

	 * Subset case.

	 */

	if (flag) {

	    for (i = list->min; i <= list->max; ++i)

		r->types[i - r->min] |= flag;

	}

	free(list);

	return;

    }

    if (list->min <= r->min && list->max >= r->max) {

	/*

	 * Superset case.  Make him big enough to hold us.

	 * We might need to merge with the guy after him.

	 */

	if (flag) {

	    list->types = xlalloc(list->max - list->min + 1);

	    for (i = list->min; i <= list->max; ++i)

		list->types[i - list->min] = flag;

	    for (i = r->min; i <= r->max; ++i)

		list->types[i - list->min] |= r->types[i - r->min];

	    free(r->types);

	    r->types = list->types;

	} else {

	    r->map = list->map;

	}

	r->min = list->min;

	r->max = list->max;

	free(list);

    } else if (list->min < r->min) {

	/*

	 * Our tail intersects his head.

	 */

	if (flag) {

	    list->types = xlalloc(r->max - list->min + 1);

	    for (i = r->min; i <= r->max; ++i)

		list->types[i - list->min] = r->types[i - r->min];

	    for (i = list->min; i < r->min; ++i)

		list->types[i - list->min] = flag;

	    for (i = r->min; i <= list->max; ++i)

		list->types[i - list->min] |= flag;

	    free(r->types);

	    r->types = list->types;

	} else {

	    r->map = list->map;

	}

	r->min = list->min;

	free(list);

	return;

    } else {

	/*

	 * Our head intersects his tail.

	 * We might need to merge with the guy after him.

	 */

	if (flag) {

	    r->types = xrelalloc(r->types, list->max - r->min + 1);

	    for (i = list->min; i <= r->max; ++i)

		r->types[i - r->min] |= flag;

	    for (i = r->max+1; i <= list->max; ++i)

		r->types[i - r->min] = flag;

	}

	r->max = list->max;

	free(list);

    }

    /*

     * Okay, check to see if we grew into the next guy(s)

     */

    while ((lr = r->next) && r->max >= lr->min) {

	if (flag) {

	    if (r->max >= lr->max) {

		/*

		 * Good, we consumed all of him.

		 */

		for (i = lr->min; i <= lr->max; ++i)

		    r->types[i - r->min] |= lr->types[i - lr->min];

	    } else {

		/*

		 * "append" him on to the end of us.

		 */

		r->types = xrelalloc(r->types, lr->max - r->min + 1);

		for (i = lr->min; i <= r->max; ++i)

		    r->types[i - r->min] |= lr->types[i - lr->min];

		for (i = r->max+1; i <= lr->max; ++i)

		    r->types[i - r->min] = lr->types[i - lr->min];

		r->max = lr->max;

	    }

	} else {

	    if (lr->max > r->max)

		r->max = lr->max;

	}

	r->next = lr->next;

	if (flag)

	    free(lr->types);

	free(lr);

    }

}

void

dump_tables()

{

    int x, n;

    rune_list *list;

    _FileRuneLocale file_new_locale;

    FILE *fp = (ofile ? ofile : stdout);

    memset(&file_new_locale, 0, sizeof(file_new_locale));

    /*

     * See if we can compress some of the istype arrays

     */

    for(list = types.root; list; list = list->next) {

	list->map = list->types[0];

	for (x = 1; x < list->max - list->min + 1; ++x) {

	    if (list->types[x] != list->map) {

		list->map = 0;

		break;

	    }

	}

    }

    memcpy(&file_new_locale.frl_magic, new_locale.rl_magic,

	sizeof(file_new_locale.frl_magic));

    memcpy(&file_new_locale.frl_encoding, new_locale.rl_encoding,

	sizeof(file_new_locale.frl_encoding));

    file_new_locale.frl_invalid_rune = htonl(new_locale.rl_invalid_rune);

    /*

     * Fill in our tables.  Do this in network order so that

     * diverse machines have a chance of sharing data.

     * (Machines like Crays cannot share with little machines due to

     *  word size.  Sigh.  We tried.)

     */

    for (x = 0; x < _CACHED_RUNES; ++x) {

	file_new_locale.frl_runetype[x] = htonl(types.map[x]);

	file_new_locale.frl_maplower[x] = htonl(maplower.map[x]);

	file_new_locale.frl_mapupper[x] = htonl(mapupper.map[x]);

    }

    /*

     * Count up how many ranges we will need for each of the extents.

     */

    list = types.root;

    while (list) {

	new_locale.rl_runetype_ext.rr_nranges++;

	list = list->next;

    }

    file_new_locale.frl_runetype_ext.frr_nranges =

	htonl(new_locale.rl_runetype_ext.rr_nranges);

    list = maplower.root;

    while (list) {

	new_locale.rl_maplower_ext.rr_nranges++;

	list = list->next;

    }

    file_new_locale.frl_maplower_ext.frr_nranges =

	htonl(new_locale.rl_maplower_ext.rr_nranges);

    list = mapupper.root;

    while (list) {

	new_locale.rl_mapupper_ext.rr_nranges++;

	list = list->next;

    }

    file_new_locale.frl_mapupper_ext.frr_nranges =

	htonl(new_locale.rl_mapupper_ext.rr_nranges);

    file_new_locale.frl_variable_len = htonl(new_locale.rl_variable_len);

    /*

     * Okay, we are now ready to write the new locale file.

     */

    /*

     * PART 1: The _RuneLocale structure

     */

    if (fwrite((char *)&file_new_locale, sizeof(file_new_locale), 1, fp) != 1)

	err(1, "writing _RuneLocale to %s", locale_file);

    /*

     * PART 2: The runetype_ext structures (not the actual tables)

     */

    for (list = types.root, n = 0; list != NULL; list = list->next, n++) {

	_FileRuneEntry re;

	memset(&re, 0, sizeof(re));

	re.fre_min = htonl(list->min);

	re.fre_max = htonl(list->max);

	re.fre_map = htonl(list->map);

	if (fwrite((char *)&re, sizeof(re), 1, fp) != 1)

	    err(1, "writing runetype_ext #%d to %s", n, locale_file);

    }

    /*

     * PART 3: The maplower_ext structures

     */

    for (list = maplower.root, n = 0; list != NULL; list = list->next, n++) {

	_FileRuneEntry re;

	memset(&re, 0, sizeof(re));

	re.fre_min = htonl(list->min);

	re.fre_max = htonl(list->max);

	re.fre_map = htonl(list->map);

	if (fwrite((char *)&re, sizeof(re), 1, fp) != 1)

	    err(1, "writing maplower_ext #%d to %s", n, locale_file);

    }

    /*

     * PART 4: The mapupper_ext structures

     */

    for (list = mapupper.root, n = 0; list != NULL; list = list->next, n++) {

	_FileRuneEntry re;

	memset(&re, 0, sizeof(re));

	re.fre_min = htonl(list->min);

	re.fre_max = htonl(list->max);

	re.fre_map = htonl(list->map);

	if (fwrite((char *)&re, sizeof(re), 1, fp) != 1)

	    err(1, "writing mapupper_ext #%d to %s", n, locale_file);

    }

    /*

     * PART 5: The runetype_ext tables

     */

    for (list = types.root, n = 0; list != NULL; list = list->next, n++) {

	for (x = 0; x < list->max - list->min + 1; ++x)

	    list->types[x] = htonl(list->types[x]);

	if (!list->map) {

	    if (fwrite((char *)list->types,

		       (list->max - list->min + 1) * sizeof(u_int32_t),

		       1, fp) != 1)

		err(1, "writing runetype_ext table #%d to %s", n, locale_file);

	}

    }

    /*

     * PART 5: And finally the variable data

     */

    if (new_locale.rl_variable_len != 0 &&

	fwrite((char *)new_locale.rl_variable,

	       new_locale.rl_variable_len, 1, fp) != 1)

	err(1, "writing variable data to %s", locale_file);

    fclose(fp);

    if (!debug)

	return;

    if (new_locale.rl_encoding[0])

	fprintf(stderr, "ENCODING	%s\n", new_locale.rl_encoding);

    if (new_locale.rl_variable)

	fprintf(stderr, "VARIABLE	%s\n",

		(char *)new_locale.rl_variable);

    fprintf(stderr, "\nMAPLOWER:\n\n");

    for (x = 0; x < _CACHED_RUNES; ++x) {

	if (isprint(maplower.map[x]))

	    fprintf(stderr, " '%c'", (int)maplower.map[x]);

	else if (maplower.map[x])

	    fprintf(stderr, "%04x", maplower.map[x]);

	else

	    fprintf(stderr, "%4x", 0);

	if ((x & 0xf) == 0xf)

	    fprintf(stderr, "\n");

	else

	    fprintf(stderr, " ");

    }

    fprintf(stderr, "\n");

    for (list = maplower.root; list; list = list->next)

	fprintf(stderr, "\t%04x - %04x : %04x\n", list->min, list->max, list->map);

    fprintf(stderr, "\nMAPUPPER:\n\n");

    for (x = 0; x < _CACHED_RUNES; ++x) {

	if (isprint(mapupper.map[x]))

	    fprintf(stderr, " '%c'", (int)mapupper.map[x]);

	else if (mapupper.map[x])

	    fprintf(stderr, "%04x", mapupper.map[x]);

	else

	    fprintf(stderr, "%4x", 0);

	if ((x & 0xf) == 0xf)

	    fprintf(stderr, "\n");

	else

	    fprintf(stderr, " ");

    }

    fprintf(stderr, "\n");

    for (list = mapupper.root; list; list = list->next)

	fprintf(stderr, "\t%04x - %04x : %04x\n", list->min, list->max, list->map);

    fprintf(stderr, "\nTYPES:\n\n");

    for (x = 0; x < _CACHED_RUNES; ++x) {

	u_int32_t r = types.map[x];

	if (r) {

	    if (isprint(x))

		fprintf(stderr, " '%c':%2d", x, (int)(r & 0xff));

	    else

		fprintf(stderr, "%04x:%2d", x, (int)(r & 0xff));

	    fprintf(stderr, " %4s", (r & _RUNETYPE_A) ? "alph" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_C) ? "ctrl" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_D) ? "dig" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_G) ? "graf" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_L) ? "low" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_P) ? "punc" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_S) ? "spac" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_U) ? "upp" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_X) ? "xdig" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_B) ? "blnk" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_R) ? "prnt" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_I) ? "ideo" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_T) ? "spec" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_Q) ? "phon" : "");

	    fprintf(stderr, "\n");

	}

    }

    for (list = types.root; list; list = list->next) {

	if (list->map && list->min + 3 < list->max) {

	    u_int32_t r = list->map;

	    fprintf(stderr, "%04x:%2d", list->min, r & 0xff);

	    fprintf(stderr, " %4s", (r & _RUNETYPE_A) ? "alph" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_C) ? "ctrl" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_D) ? "dig" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_G) ? "graf" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_L) ? "low" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_P) ? "punc" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_S) ? "spac" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_U) ? "upp" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_X) ? "xdig" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_B) ? "blnk" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_R) ? "prnt" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_I) ? "ideo" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_T) ? "spec" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_Q) ? "phon" : "");

	    fprintf(stderr, "\n...\n");

	    fprintf(stderr, "%04x:%2d", list->max, r & 0xff);

	    fprintf(stderr, " %4s", (r & _RUNETYPE_A) ? "alph" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_C) ? "ctrl" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_D) ? "dig" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_G) ? "graf" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_L) ? "low" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_P) ? "punc" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_S) ? "spac" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_U) ? "upp" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_X) ? "xdig" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_B) ? "blnk" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_R) ? "prnt" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_I) ? "ideo" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_T) ? "spec" : "");

	    fprintf(stderr, " %4s", (r & _RUNETYPE_Q) ? "phon" : "");

            fprintf(stderr, " %1u", (unsigned)((r & _RUNETYPE_SWM)>>_RUNETYPE_SWS));

	    fprintf(stderr, "\n");

	} else

	for (x = list->min; x <= list->max; ++x) {

	    u_int32_t r = ntohl(list->types[x - list->min]);

	    if (r) {

		fprintf(stderr, "%04x:%2d", x, (int)(r & 0xff));

		fprintf(stderr, " %4s", (r & _RUNETYPE_A) ? "alph" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_C) ? "ctrl" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_D) ? "dig" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_G) ? "graf" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_L) ? "low" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_P) ? "punc" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_S) ? "spac" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_U) ? "upp" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_X) ? "xdig" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_B) ? "blnk" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_R) ? "prnt" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_I) ? "ideo" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_T) ? "spec" : "");

		fprintf(stderr, " %4s", (r & _RUNETYPE_Q) ? "phon" : "");

                fprintf(stderr, " %1u", (unsigned)((r & _RUNETYPE_SWM)>>_RUNETYPE_SWS));

		fprintf(stderr, "\n");

	    }

	}

    }

}

#line 915 "yacc.c"

{

    short *newss;

    if ((newsize = yystacksize) == 0)

        newsize = YYINITSTACKSIZE;

    else if (newsize >= YYMAXDEPTH)

        return -1;

        newsize = YYMAXDEPTH;

#else

        goto bail;

        goto bail;

      (YYSTYPE *)malloc(newsize * sizeof *newvs); /* overflow check above */

            free(yyss);

    if (yyvs)

            free(yyvs);

    yyss = yyssp = NULL;

    yyvs = yyvsp = NULL;

    yystacksize = 0;

    return -1;

}

#define YYABORT goto yyabort

#define YYREJECT goto yyabort

#define YYACCEPT goto yyaccept

#define YYERROR goto yyerrlab

int

yyparse(void)

{

    int yym, yyn, yystate;

#if YYDEBUG

    const char *yys;

    {

        if (yyn >= '0' && yyn <= '9')

    }

    yynerrs = 0;

    yyerrflag = 0;