path: root/third_party/heimdal/lib/asn1/main.c

/*
 * Copyright (c) 1997-2005 Kungliga Tekniska Högskolan
 * (Royal Institute of Technology, Stockholm, Sweden).
 * All rights reserved.
 *
 * 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 Institute 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 INSTITUTE 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 INSTITUTE 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 "gen_locl.h"
#include <getarg.h>
#include "lex.h"

extern FILE *yyin;

static getarg_strings preserve;
static getarg_strings seq;
static getarg_strings decorate;

static int
strcmp4mergesort_r(const void *ap, const void *bp, void *d)
{
    const char *a = *(const char **)ap;
    const char *b = *(const char **)bp;
    char sep = *(const char *)d;
    int cmp;

    if (sep) {
        const char *sepa = strchr(a, sep);
        const char *sepb = strchr(b, sep);
        size_t alen, blen;

        if (sepa == NULL) sepa = a + strlen(a);
        if (sepb == NULL) sepb = b + strlen(b);
        alen = sepa - a;
        blen = sepb - b;
        cmp = strncmp(a, b, alen > blen ? alen : blen);
        if (cmp == 0)
            cmp = alen - blen;
    } else
        cmp = strcmp(a, b);
    if (cmp == 0)
        return (uintptr_t)ap - (uintptr_t)bp; /* stable sort */
    return cmp;
}

static int
prefix_check(const char *s, const char *p, size_t plen, char sep, int *cmp)
{
    if ((*cmp = strncmp(p, s, plen)) == 0 && s[plen] == sep)
        return 1;
    if (*cmp == 0)
        *cmp = 1;
    return 0;
}

static ssize_t
bsearch_strings(struct getarg_strings *strs, const char *p,
                char sep, ssize_t *more)
{
    ssize_t right = (ssize_t)strs->num_strings - 1;
    ssize_t left = 0;
    ssize_t plen = 0;
    int cmp;

    if (sep)
        plen = strlen(p);

    if (strs->num_strings == 0)
        return -1;

    if (sep && more && *more > -1) {
        /* If *more > -1 we're continuing an iteration */
        if (*more > right)
            return -1;
        if (prefix_check(strs->strings[*more], p, plen, sep, &cmp))
            return (*more)++;
        (*more)++;
        return -1;
    }

    while (left <= right) {
        ssize_t mid = left + (right - left) / 2;

        if (sep) {
            int cmp2;

            while (prefix_check(strs->strings[mid], p, plen, sep, &cmp) &&
                   mid > 0 &&
                   prefix_check(strs->strings[mid - 1], p, plen, sep, &cmp2))
                mid--;
        } else
            cmp = strcmp(p, strs->strings[mid]);
        if (cmp == 0) {
            if (more)
                *more = mid + 1;
            return mid;
        }
        if (cmp < 0)
            right = mid - 1; /* -1 if `p' is smaller than smallest in strs */
        else
            left = mid + 1;
    }
    return -1;
}

int
preserve_type(const char *p)
{
    return bsearch_strings(&preserve, p, '\0', 0) > -1;
}

int
seq_type(const char *p)
{
    return bsearch_strings(&seq, p, '\0', 0) > -1;
}

/*
 * Split `s' on `sep' and fill fs[] with pointers to the substrings.
 *
 * Only the first substring is to be freed -- the rest share the same
 * allocation.
 *
 * The last element may contain `sep' chars if there are more fields in `s'
 * than output locations in `fs[]'.
 */
static void
split_str(const char *s, char sep, char ***fs)
{
    size_t i;

    fs[0][0] = estrdup(s);
    for (i = 1; fs[i]; i++) {
        char *q;

        if ((q = strchr(fs[i-1][0], sep)) == NULL)
            break;
        *(q++) = '\0';
        fs[i][0] = q;
    }
    for (; fs[i]; i++)
        fs[i][0] = NULL;
}

/*
 * If `p' is "decorated" with a not-to-be-encoded-or-decoded field,
 * output the field's typename and fieldname, whether it's optional, whether
 * it's an ASN.1 type or an "external" type, and if external the names of
 * functions to copy and free values of that type.
 */
int
decorate_type(const char *p, struct decoration *deco, ssize_t *more)
{
    ssize_t i;
    char **s[7];
    char *junk = NULL;
    char *cp;

    deco->first = *more == -1;
    deco->decorated = 0;
    deco->field_type = NULL;
    if ((i = bsearch_strings(&decorate, p, ':', more)) == -1)
        return 0;

    deco->decorated = 1;
    deco->opt = deco->ext = deco->ptr = 0;
    deco->void_star = deco->struct_star = 0;
    deco->field_name = deco->copy_function_name = deco->free_function_name =
        deco->header_name = NULL;

    s[0] = &deco->field_type;
    s[1] = &deco->field_name;
    s[2] = &deco->copy_function_name;
    s[3] = &deco->free_function_name;
    s[4] = &deco->header_name;
    s[5] = &junk;
    s[6] = NULL;
    split_str(decorate.strings[i] + strlen(p) + 1, ':', s);

    if (junk || deco->field_type[0] == '\0' || !deco->field_name ||
        deco->field_name[0] == '\0' || deco->field_name[0] == '?') {
        errx(1, "Invalidate type decoration specification: --decorate=\"%s\"",
              decorate.strings[i]);
    }
    if ((cp = strchr(deco->field_name, '?'))) {
        deco->opt = 1;
        *cp = '\0';
    }
    if (strcmp(deco->field_type, "void*") == 0 ||
        strcmp(deco->field_type, "void *") == 0) {
        deco->ext = deco->ptr = deco->void_star = 1;
        deco->opt = 1;
        deco->header_name = NULL;
    } else if (strncmp(deco->field_type, "struct ", sizeof("struct ") - 1) == 0 &&
             deco->field_type[strlen(deco->field_type) - 1] == '*')
        deco->ptr = deco->struct_star = 1;
    if (deco->ptr || deco->copy_function_name)
        deco->ext = 1;
    if (deco->ext && deco->copy_function_name && !deco->copy_function_name[0])
        deco->copy_function_name = NULL;
    if (deco->ext && deco->free_function_name && !deco->free_function_name[0])
        deco->free_function_name = NULL;
    if (deco->header_name && !deco->header_name[0])
        deco->header_name = NULL;
    if (deco->ptr)
        deco->opt = 0;
    return 1;
}

static const char *
my_basename(const char *fn)
{
    const char *base, *p;

    for (p = base = fn; *p; p++) {
#ifdef WIN32
        if (*p == '/' || *p == '\\')
            base = p + 1;
#else
        if (*p == '/')
            base = p + 1;
#endif
    }
    return base;
}

const char *fuzzer_string = "";
const char *enum_prefix;
const char *name;
int prefix_enum;
int fuzzer_flag;
int support_ber;
int template_flag;
int rfc1510_bitstring;
int one_code_file;
char *option_file;
int parse_units_flag = 1;
char *type_file_string = "krb5-types.h";
int original_order;
int version_flag;
int help_flag;
struct getargs args[] = {
    { "fuzzer", 0, arg_flag, &fuzzer_flag, NULL, NULL },
    { "template", 0, arg_flag, &template_flag, NULL, NULL },
    { "prefix-enum", 0, arg_flag, &prefix_enum,
        "prefix C enum labels for ENUMERATED types and INTEGER types with the "
            "type's name", NULL },
    { "enum-prefix", 0, arg_string, &enum_prefix,
        "prefix for C enum labels for ENUMERATED types and INTEGER types with "
            "enumerated values", "PREFIX" },
    { "encode-rfc1510-bit-string", 0, arg_flag, &rfc1510_bitstring,
        "Use RFC1510 incorrect BIT STRING handling for all BIT STRING types "
            "in the module", NULL },
    { "decode-dce-ber", 0, arg_flag, &support_ber,
        "Allow DCE-style BER on decode", NULL },
    { "support-ber", 0, arg_flag, &support_ber, "Allow BER on decode", NULL },
    { "preserve-binary", 0, arg_strings, &preserve,
        "Names of types for which to generate _save fields, saving original "
            "encoding, in containing structures (useful for signature "
            "verification)", "TYPE" },
    { "sequence", 0, arg_strings, &seq,
        "Generate add/remove functions for SEQUENCE OF types", "TYPE" },
    { "decorate", 0, arg_strings, &decorate,
        "Generate private field for SEQUENCE/SET type", "DECORATION" },
    { "one-code-file", 0, arg_flag, &one_code_file, NULL, NULL },
    { "gen-name", 0, arg_string, &name,
        "Name of generated module", "NAME" },
    { "option-file", 0, arg_string, &option_file,
        "File with additional compiler CLI options", "FILE" },
    { "original-order", 0, arg_flag, &original_order,
        "Define C types and functions in the order in which they appear in "
            "the ASN.1 module instead of topologically sorting types.  This "
            "is useful for comparing output to earlier compiler versions.",
        NULL },
    { "parse-units", 0, arg_negative_flag, &parse_units_flag,
        "Do not generate roken-style units", NULL },
    { "type-file", 0, arg_string, &type_file_string,
        "Name of a C header file to generate includes of for base types",
        "FILE" },
    { "version", 0, arg_flag, &version_flag, NULL, NULL },
    { "help", 0, arg_flag, &help_flag, NULL, NULL }
};
int num_args = sizeof(args) / sizeof(args[0]);

static void
usage(int code)
{
    if (code)
        dup2(STDERR_FILENO, STDOUT_FILENO);
    else
        dup2(STDOUT_FILENO, STDERR_FILENO);
    arg_printusage(args, num_args, NULL, "[asn1-file [name]]");
    fprintf(stderr,
            "\nA DECORATION is one of:\n\n"
            "\tTYPE:FTYPE:fname[?]\n"
            "\tTYPE:FTYPE:fname[?]:[copy_function]:[free_function]:header\n"
            "\tTYPE:void:fname:::\n"
            "\nSee the manual page.\n");
    exit(code);
}

int error_flag;

int
main(int argc, char **argv)
{
    int ret;
    const char *file;
    FILE *opt = NULL;
    int optidx = 0;
    char **arg = NULL;
    size_t len = 0;
    size_t sz = 0;
    int i;

    setprogname(argv[0]);
    if (getarg(args, num_args, argc, argv, &optidx))
	usage(1);
    if (help_flag)
	usage(0);
    if (version_flag) {
	print_version(NULL);
	exit(0);
    }
    if (argc == optidx) {
        /* Compile the module on stdin */
	file = "stdin";
	name = "stdin";
	yyin = stdin;
    } else {
        /* Compile a named module */
	file = argv[optidx];

        /*
         * If the .asn1 stem is not given, then assume it, and also assume
         * --option-file was given if the .opt file exists
         */
        if (strchr(file, '.') == NULL) {
            char *s = NULL;

            if (asprintf(&s, "%s.opt", file) == -1 || s == NULL)
                err(1, "Out of memory");
            if ((opt = fopen(s, "r")))
                option_file = s;
            else
                free(s);
            if (asprintf(&s, "%s.asn1", file) == -1 || s == NULL)
                err(1, "Out of memory");
            file = s;
        }
	yyin = fopen (file, "r");
	if (yyin == NULL)
	    err (1, "open %s", file);
	if (argc == optidx + 1) {
	    char *p;

            /* C module name substring not given; derive from file name */
            name = my_basename(estrdup(file));
	    p = strrchr(name, '.');
	    if (p)
		*p = '\0';
	} else
	    name = argv[optidx + 1];
    }

    /*
     * Parse extra options file
     */
    if (option_file) {
	char buf[1024];

        if (opt == NULL &&
            (opt = fopen(option_file, "r")) == NULL)
	    err(1, "Could not open given option file %s", option_file);

	arg = calloc(2, sizeof(arg[0]));
	if (arg == NULL) {
	    perror("calloc");
	    exit(1);
	}
	arg[0] = option_file;
	arg[1] = NULL;
	len = 1;
        sz = 2;

	while (fgets(buf, sizeof(buf), opt) != NULL) {
            size_t buflen, ws;

	    buf[strcspn(buf, "\n\r")] = '\0';

            buflen = strlen(buf);
            if ((ws = strspn(buf, " \t")))
                memmove(buf, buf + ws, buflen - ws);
            if (buf[0] == '\0' || buf[0] == '#')
                continue;

            if (len + 1 >= sz) {
                arg = realloc(arg, (sz + (sz>>1) + 2) * sizeof(arg[0]));
                if (arg == NULL) {
                    perror("malloc");
                    exit(1);
                }
                sz += (sz>>1) + 2;
            }
	    arg[len] = strdup(buf);
	    if (arg[len] == NULL) {
		perror("strdup");
		exit(1);
	    }
	    arg[len + 1] = NULL;
	    len++;
	}
	fclose(opt);

	optidx = 0;
	if(getarg(args, num_args, len, arg, &optidx))
	    usage(1);

	if (len != optidx) {
	    fprintf(stderr, "extra args");
	    exit(1);
	}
    }

    if (fuzzer_flag) {
	if (!template_flag) {
	    printf("can't do fuzzer w/o --template");
	    exit(1);
	}
#ifdef ASN1_FUZZER
	fuzzer_string = "_fuzzer";
#endif
    }

    if (preserve.num_strings)
        mergesort_r(preserve.strings, preserve.num_strings,
                    sizeof(preserve.strings[0]), strcmp4mergesort_r, "");
    if (seq.num_strings)
        mergesort_r(seq.strings, seq.num_strings, sizeof(seq.strings[0]),
                    strcmp4mergesort_r, "");
    if (decorate.num_strings)
        mergesort_r(decorate.strings, decorate.num_strings,
                    sizeof(decorate.strings[0]), strcmp4mergesort_r, ":");

    init_generate(file, name);

    if (one_code_file)
	generate_header_of_codefile(name);

    initsym ();
    ret = yyparse ();
    if(ret != 0 || error_flag != 0)
	exit(1);
    if (!original_order)
        generate_types();
    if (argc != optidx)
	fclose(yyin);

    if (one_code_file)
	close_codefile();
    close_generate();

    if (arg) {
	for (i = 1; i < len; i++)
	    free(arg[i]);
	free(arg);
    }

    return 0;
}