usr/src/usr.bin/mklocale/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. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *      This product includes software developed by the University of
 *      California, Berkeley and its contributors.
 * 4. 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.
 */

#ifndef lint
static char sccsid[] = "@(#)yacc.y      8.1 (Berkeley) 6/6/93";
#endif /* not lint */

#include <ctype.h>
#include <rune.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>

#include "ldef.h"

char    *locale_file = "<stdout>";

rune_map        maplower = { 0, };
rune_map        mapupper = { 0, };
rune_map        types = { 0, };

_RuneLocale     new_locale = { 0, };

void set_map __P((rune_map *, rune_list *, u_long));
void set_digitmap __P((rune_map *, rune_list *));
void add_map __P((rune_map *, rune_list *, u_long));
%}

%union  {
    rune_t      rune;
    int         i;
    char        *str;

    rune_list   *list;
}

%token  <rune>  RUNE
%token          LBRK
%token          RBRK
%token          THRU
%token          MAPLOWER
%token          MAPUPPER
%token          DIGITMAP
%token  <i>     LIST
%token  <str>   VARIABLE
%token          ENCODING
%token          INVALID
%token  <str>   STRING

%type   <list>  list
%type   <list>  map


%%

locale  :       /* empty */
        |       table
                { dump_tables(); }
        ;

table   :       entry
        |       table entry
        ;

entry   :       ENCODING STRING
                { strncpy(new_locale.encoding, $2, sizeof(new_locale.encoding)); }
        |       VARIABLE
                { new_locale.variable_len = strlen($1) + 1;
                  new_locale.variable = malloc(new_locale.variable_len);
                  strcpy((char *)new_locale.variable, $1);
                }
        |       INVALID RUNE
                { new_locale.invalid_rune = $2; }
        |       LIST list
                { set_map(&types, $2, $1); }
        |       MAPLOWER map
                { set_map(&maplower, $2, 0); }
        |       MAPUPPER map
                { set_map(&mapupper, $2, 0); }
        |       DIGITMAP map
                { set_digitmap(&types, $2); }
        ;

list    :       RUNE
                {
                    $$ = (rune_list *)malloc(sizeof(rune_list));
                    $$->min = $1;
                    $$->max = $1;
                    $$->next = 0;
                }
        |       RUNE THRU RUNE
                {
                    $$ = (rune_list *)malloc(sizeof(rune_list));
                    $$->min = $1;
                    $$->max = $3;
                    $$->next = 0;
                }
        |       list RUNE
                {
                    $$ = (rune_list *)malloc(sizeof(rune_list));
                    $$->min = $2;
                    $$->max = $2;
                    $$->next = $1;
                }
        |       list RUNE THRU RUNE
                {
                    $$ = (rune_list *)malloc(sizeof(rune_list));
                    $$->min = $2;
                    $$->max = $4;
                    $$->next = $1;
                }
        ;

map     :       LBRK RUNE RUNE RBRK
                {
                    $$ = (rune_list *)malloc(sizeof(rune_list));
                    $$->min = $2;
                    $$->max = $2;
                    $$->map = $3;
                    $$->next = 0;
                }
        |       map LBRK RUNE RUNE RBRK
                {
                    $$ = (rune_list *)malloc(sizeof(rune_list));
                    $$->min = $3;
                    $$->max = $3;
                    $$->map = $4;
                    $$->next = $1;
                }
        |       LBRK RUNE THRU RUNE ':' RUNE RBRK
                {
                    $$ = (rune_list *)malloc(sizeof(rune_list));
                    $$->min = $2;
                    $$->max = $4;
                    $$->map = $6;
                    $$->next = 0;
                }
        |       map LBRK RUNE THRU RUNE ':' RUNE RBRK
                {
                    $$ = (rune_list *)malloc(sizeof(rune_list));
                    $$->min = $3;
                    $$->max = $5;
                    $$->map = $7;
                    $$->next = $1;
                }
        ;
%%

int debug = 0;
FILE *fp = stdout;

main(ac, av)
        int ac;
        char *av[];
{
    int x;

    extern char *optarg;
    extern int optind;

    while ((x = getopt(ac, av, "do:")) != EOF) {
        switch(x) {
        case 'd':
            debug = 1;
            break;
        case 'o':
            locale_file = optarg;
            if ((fp = fopen(locale_file, "w")) == 0) {
                perror(locale_file);
                exit(1);
            }
            break;
        default:
        usage:
            fprintf(stderr, "Usage: mklocale [-d] [-o output] [source]\n");
            exit(1);
        }
    }

    switch (ac - optind) {
    case 0:
        break;
    case 1:
        if (freopen(av[optind], "r", stdin) == 0) {
            perror(av[optind]);
            exit(1);
        }
        break;
    default:
        goto usage;
    }
    for (x = 0; x < _CACHED_RUNES; ++x) {
        mapupper.map[x] = x;
        maplower.map[x] = x;
    }
    new_locale.invalid_rune = _INVALID_RUNE;
    memcpy(new_locale.magic, _RUNE_MAGIC_1, sizeof(new_locale.magic));

    yyparse();
}

yyerror(s)
        char *s;
{
    fprintf(stderr, "%s\n", s);
}

void *
xmalloc(sz)
        unsigned int sz;
{
    void *r = malloc(sz);
    if (!r) {
        perror("xmalloc");
        abort();
    }
    return(r);
}

u_long *
xlalloc(sz)
        unsigned int sz;
{
    u_long *r = (u_long *)malloc(sz * sizeof(u_long));
    if (!r) {
        perror("xlalloc");
        abort();
    }
    return(r);
}

u_long *
xrelalloc(old, sz)
        u_long *old;
        unsigned int sz;
{
    u_long *r = (u_long *)realloc((char *)old, sz * sizeof(u_long));
    if (!r) {
        perror("xrelalloc");
        abort();
    }
    return(r);
}

void
set_map(map, list, flag)
        rune_map *map;
        rune_list *list;
        u_long flag;
{
    while (list) {
        rune_list *nlist = list->next;
        add_map(map, list, flag);
        list = nlist;
    }
}

void
set_digitmap(map, list)
        rune_map *map;
        rune_list *list;
{
    rune_t i;

    while (list) {
        rune_list *nlist = list->next;
        for (i = list->min; i <= list->max; ++i) {
            if (list->map + (i - list->min)) {
                rune_list *tmp = (rune_list *)xmalloc(sizeof(rune_list));
                tmp->min = i;
                tmp->max = i;
                add_map(map, tmp, list->map + (i - list->min));
            }
        }
        free(list);
        list = nlist;
    }
}

void
add_map(map, list, flag)
        rune_map *map;
        rune_list *list;
        u_long 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 = r->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;
    rune_list *list;

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

    new_locale.invalid_rune = htonl(new_locale.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) {
        new_locale.runetype[x] = htonl(types.map[x]);
        new_locale.maplower[x] = htonl(maplower.map[x]);
        new_locale.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.runetype_ext.nranges++;
        list = list->next;
    }
    new_locale.runetype_ext.nranges = htonl(new_locale.runetype_ext.nranges);

    list = maplower.root;

    while (list) {
        new_locale.maplower_ext.nranges++;
        list = list->next;
    }
    new_locale.maplower_ext.nranges = htonl(new_locale.maplower_ext.nranges);

    list = mapupper.root;

    while (list) {
        new_locale.mapupper_ext.nranges++;
        list = list->next;
    }
    new_locale.mapupper_ext.nranges = htonl(new_locale.mapupper_ext.nranges);

    new_locale.variable_len = htonl(new_locale.variable_len);

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

    /*
     * PART 1: The _RuneLocale structure
     */
    if (fwrite((char *)&new_locale, sizeof(new_locale), 1, fp) != 1) {
        perror(locale_file);
        exit(1);
    }
    /*
     * PART 2: The runetype_ext structures (not the actual tables)
     */
    list = types.root;

    while (list) {
        _RuneEntry re;

        re.min = htonl(list->min);
        re.max = htonl(list->max);
        re.map = htonl(list->map);

        if (fwrite((char *)&re, sizeof(re), 1, fp) != 1) {
            perror(locale_file);
            exit(1);
        }

        list = list->next;
    }
    /*
     * PART 3: The maplower_ext structures
     */
    list = maplower.root;

    while (list) {
        _RuneEntry re;

        re.min = htonl(list->min);
        re.max = htonl(list->max);
        re.map = htonl(list->map);

        if (fwrite((char *)&re, sizeof(re), 1, fp) != 1) {
            perror(locale_file);
            exit(1);
        }

        list = list->next;
    }
    /*
     * PART 4: The mapupper_ext structures
     */
    list = mapupper.root;

    while (list) {
        _RuneEntry re;

        re.min = htonl(list->min);
        re.max = htonl(list->max);
        re.map = htonl(list->map);

        if (fwrite((char *)&re, sizeof(re), 1, fp) != 1) {
            perror(locale_file);
            exit(1);
        }

        list = list->next;
    }
    /*
     * PART 5: The runetype_ext tables
     */
    list = types.root;

    while (list) {
        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_long), 1, fp) != 1) {
                perror(locale_file);
                exit(1);
            }
        }
        list = list->next;
    }
    /*
     * PART 5: And finally the variable data
     */
    if (fwrite((char *)new_locale.variable,
               ntohl(new_locale.variable_len), 1, fp) != 1) {
        perror(locale_file);
        exit(1);
    }
    fclose(fp);

    if (!debug)
        return;

    if (new_locale.encoding[0])
        fprintf(stderr, "ENCODING       %s\n", new_locale.encoding);
    if (new_locale.variable)
        fprintf(stderr, "VARIABLE       %s\n", new_locale.variable);

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

    for (x = 0; x < _CACHED_RUNES; ++x) {
        if (isprint(maplower.map[x]))
            fprintf(stderr, " '%c'", 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'", 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_long r = types.map[x];

        if (r) {
            if (isprint(x))
                fprintf(stderr, " '%c': %2d", x, r & 0xff);
            else
                fprintf(stderr, "%04x: %2d", x, r & 0xff);

            fprintf(stderr, " %4s", (r & _A) ? "alph" : "");
            fprintf(stderr, " %4s", (r & _C) ? "ctrl" : "");
            fprintf(stderr, " %4s", (r & _D) ? "dig" : "");
            fprintf(stderr, " %4s", (r & _G) ? "graf" : "");
            fprintf(stderr, " %4s", (r & _L) ? "low" : "");
            fprintf(stderr, " %4s", (r & _P) ? "punc" : "");
            fprintf(stderr, " %4s", (r & _S) ? "spac" : "");
            fprintf(stderr, " %4s", (r & _U) ? "upp" : "");
            fprintf(stderr, " %4s", (r & _X) ? "xdig" : "");
            fprintf(stderr, " %4s", (r & _B) ? "blnk" : "");
            fprintf(stderr, " %4s", (r & _R) ? "prnt" : "");
            fprintf(stderr, " %4s", (r & _I) ? "ideo" : "");
            fprintf(stderr, " %4s", (r & _T) ? "spec" : "");
            fprintf(stderr, " %4s", (r & _Q) ? "phon" : "");
            fprintf(stderr, "\n");
        }
    }

    for (list = types.root; list; list = list->next) {
        if (list->map && list->min + 3 < list->max) {
            u_long r = list->map;

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

            fprintf(stderr, " %4s", (r & _A) ? "alph" : "");
            fprintf(stderr, " %4s", (r & _C) ? "ctrl" : "");
            fprintf(stderr, " %4s", (r & _D) ? "dig" : "");
            fprintf(stderr, " %4s", (r & _G) ? "graf" : "");
            fprintf(stderr, " %4s", (r & _L) ? "low" : "");
            fprintf(stderr, " %4s", (r & _P) ? "punc" : "");
            fprintf(stderr, " %4s", (r & _S) ? "spac" : "");
            fprintf(stderr, " %4s", (r & _U) ? "upp" : "");
            fprintf(stderr, " %4s", (r & _X) ? "xdig" : "");
            fprintf(stderr, " %4s", (r & _B) ? "blnk" : "");
            fprintf(stderr, " %4s", (r & _R) ? "prnt" : "");
            fprintf(stderr, " %4s", (r & _I) ? "ideo" : "");
            fprintf(stderr, " %4s", (r & _T) ? "spec" : "");
            fprintf(stderr, " %4s", (r & _Q) ? "phon" : "");
            fprintf(stderr, "\n...\n");

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

            fprintf(stderr, " %4s", (r & _A) ? "alph" : "");
            fprintf(stderr, " %4s", (r & _C) ? "ctrl" : "");
            fprintf(stderr, " %4s", (r & _D) ? "dig" : "");
            fprintf(stderr, " %4s", (r & _G) ? "graf" : "");
            fprintf(stderr, " %4s", (r & _L) ? "low" : "");
            fprintf(stderr, " %4s", (r & _P) ? "punc" : "");
            fprintf(stderr, " %4s", (r & _S) ? "spac" : "");
            fprintf(stderr, " %4s", (r & _U) ? "upp" : "");
            fprintf(stderr, " %4s", (r & _X) ? "xdig" : "");
            fprintf(stderr, " %4s", (r & _B) ? "blnk" : "");
            fprintf(stderr, " %4s", (r & _R) ? "prnt" : "");
            fprintf(stderr, " %4s", (r & _I) ? "ideo" : "");
            fprintf(stderr, " %4s", (r & _T) ? "spec" : "");
            fprintf(stderr, " %4s", (r & _Q) ? "phon" : "");
            fprintf(stderr, "\n");
        } else
        for (x = list->min; x <= list->max; ++x) {
            u_long r = ntohl(list->types[x - list->min]);

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

                fprintf(stderr, " %4s", (r & _A) ? "alph" : "");
                fprintf(stderr, " %4s", (r & _C) ? "ctrl" : "");
                fprintf(stderr, " %4s", (r & _D) ? "dig" : "");
                fprintf(stderr, " %4s", (r & _G) ? "graf" : "");
                fprintf(stderr, " %4s", (r & _L) ? "low" : "");
                fprintf(stderr, " %4s", (r & _P) ? "punc" : "");
                fprintf(stderr, " %4s", (r & _S) ? "spac" : "");
                fprintf(stderr, " %4s", (r & _U) ? "upp" : "");
                fprintf(stderr, " %4s", (r & _X) ? "xdig" : "");
                fprintf(stderr, " %4s", (r & _B) ? "blnk" : "");
                fprintf(stderr, " %4s", (r & _R) ? "prnt" : "");
                fprintf(stderr, " %4s", (r & _I) ? "ideo" : "");
                fprintf(stderr, " %4s", (r & _T) ? "spec" : "");
                fprintf(stderr, " %4s", (r & _Q) ? "phon" : "");
                fprintf(stderr, "\n");
            }
        }
    }
}