[thirdparty/openssl.git] / crypto / objects / obj_dat.c

/* crypto/objects/obj_dat.c */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 *
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 *
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 *
 * 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 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 cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 *
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``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 AUTHOR 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.
 *
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

#include <stdio.h>
#include <ctype.h>
#include <limits.h>
#include "cryptlib.h"
#include <openssl/lhash.h>
#include <openssl/asn1.h>
#include <openssl/objects.h>
#include <openssl/bn.h>

/* obj_dat.h is generated from objects.h by obj_dat.pl */
#ifndef OPENSSL_NO_OBJECT
# include "obj_dat.h"
#else
/* You will have to load all the objects needed manually in the application */
# define NUM_NID 0
# define NUM_SN 0
# define NUM_LN 0
# define NUM_OBJ 0
static const unsigned char lvalues[1];
static const ASN1_OBJECT nid_objs[1];
static const unsigned int sn_objs[1];
static const unsigned int ln_objs[1];
static const unsigned int obj_objs[1];
#endif

DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, sn);
DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, ln);
DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, obj);

#define ADDED_DATA      0
#define ADDED_SNAME     1
#define ADDED_LNAME     2
#define ADDED_NID       3

typedef struct added_obj_st {
    int type;
    ASN1_OBJECT *obj;
} ADDED_OBJ;
DECLARE_LHASH_OF(ADDED_OBJ);

static int new_nid = NUM_NID;
static LHASH_OF(ADDED_OBJ) *added = NULL;

static int sn_cmp(const ASN1_OBJECT *const *a, const unsigned int *b)
{
    return (strcmp((*a)->sn, nid_objs[*b].sn));
}

IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, sn);

static int ln_cmp(const ASN1_OBJECT *const *a, const unsigned int *b)
{
    return (strcmp((*a)->ln, nid_objs[*b].ln));
}

IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, ln);

static unsigned long added_obj_hash(const ADDED_OBJ *ca)
{
    const ASN1_OBJECT *a;
    int i;
    unsigned long ret = 0;
    unsigned char *p;

    a = ca->obj;
    switch (ca->type) {
    case ADDED_DATA:
        ret = a->length << 20L;
        p = (unsigned char *)a->data;
        for (i = 0; i < a->length; i++)
            ret ^= p[i] << ((i * 3) % 24);
        break;
    case ADDED_SNAME:
        ret = lh_strhash(a->sn);
        break;
    case ADDED_LNAME:
        ret = lh_strhash(a->ln);
        break;
    case ADDED_NID:
        ret = a->nid;
        break;
    default:
        /* abort(); */
        return 0;
    }
    ret &= 0x3fffffffL;
    ret |= ((unsigned long)ca->type) << 30L;
    return (ret);
}

static IMPLEMENT_LHASH_HASH_FN(added_obj, ADDED_OBJ)

static int added_obj_cmp(const ADDED_OBJ *ca, const ADDED_OBJ *cb)
{
    ASN1_OBJECT *a, *b;
    int i;

    i = ca->type - cb->type;
    if (i)
        return (i);
    a = ca->obj;
    b = cb->obj;
    switch (ca->type) {
    case ADDED_DATA:
        i = (a->length - b->length);
        if (i)
            return (i);
        return (memcmp(a->data, b->data, (size_t)a->length));
    case ADDED_SNAME:
        if (a->sn == NULL)
            return (-1);
        else if (b->sn == NULL)
            return (1);
        else
            return (strcmp(a->sn, b->sn));
    case ADDED_LNAME:
        if (a->ln == NULL)
            return (-1);
        else if (b->ln == NULL)
            return (1);
        else
            return (strcmp(a->ln, b->ln));
    case ADDED_NID:
        return (a->nid - b->nid);
    default:
        /* abort(); */
        return 0;
    }
}

static IMPLEMENT_LHASH_COMP_FN(added_obj, ADDED_OBJ)

static int init_added(void)
{
    if (added != NULL)
        return (1);
    added = lh_ADDED_OBJ_new();
    return (added != NULL);
}

static void cleanup1_doall(ADDED_OBJ *a)
{
    a->obj->nid = 0;
    a->obj->flags |= ASN1_OBJECT_FLAG_DYNAMIC |
        ASN1_OBJECT_FLAG_DYNAMIC_STRINGS | ASN1_OBJECT_FLAG_DYNAMIC_DATA;
}

static void cleanup2_doall(ADDED_OBJ *a)
{
    a->obj->nid++;
}

static void cleanup3_doall(ADDED_OBJ *a)
{
    if (--a->obj->nid == 0)
        ASN1_OBJECT_free(a->obj);
    OPENSSL_free(a);
}

static IMPLEMENT_LHASH_DOALL_FN(cleanup1, ADDED_OBJ)
static IMPLEMENT_LHASH_DOALL_FN(cleanup2, ADDED_OBJ)
static IMPLEMENT_LHASH_DOALL_FN(cleanup3, ADDED_OBJ)

/*
 * The purpose of obj_cleanup_defer is to avoid EVP_cleanup() attempting to
 * use freed up OIDs. If necessary the actual freeing up of OIDs is delayed.
 */
int obj_cleanup_defer = 0;

void check_defer(int nid)
{
    if (!obj_cleanup_defer && nid >= NUM_NID)
        obj_cleanup_defer = 1;
}

void OBJ_cleanup(void)
{
    if (obj_cleanup_defer) {
        obj_cleanup_defer = 2;
        return;
    }
    if (added == NULL)
        return;
    lh_ADDED_OBJ_down_load(added) = 0;
    lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup1)); /* zero counters */
    lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup2)); /* set counters */
    lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup3)); /* free objects */
    lh_ADDED_OBJ_free(added);
    added = NULL;
}

int OBJ_new_nid(int num)
{
    int i;

    i = new_nid;
    new_nid += num;
    return (i);
}

int OBJ_add_object(const ASN1_OBJECT *obj)
{
    ASN1_OBJECT *o;
    ADDED_OBJ *ao[4] = { NULL, NULL, NULL, NULL }, *aop;
    int i;

    if (added == NULL)
        if (!init_added())
            return (0);
    if ((o = OBJ_dup(obj)) == NULL)
        goto err;
    if (!(ao[ADDED_NID] = (ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ))))
        goto err2;
    if ((o->length != 0) && (obj->data != NULL))
        if (!
            (ao[ADDED_DATA] = (ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ))))
            goto err2;
    if (o->sn != NULL)
        if (!
            (ao[ADDED_SNAME] =
             (ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ))))
            goto err2;
    if (o->ln != NULL)
        if (!
            (ao[ADDED_LNAME] =
             (ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ))))
            goto err2;

    for (i = ADDED_DATA; i <= ADDED_NID; i++) {
        if (ao[i] != NULL) {
            ao[i]->type = i;
            ao[i]->obj = o;
            aop = lh_ADDED_OBJ_insert(added, ao[i]);
            /* memory leak, buit should not normally matter */
            if (aop != NULL)
                OPENSSL_free(aop);
        }
    }
    o->flags &=
        ~(ASN1_OBJECT_FLAG_DYNAMIC | ASN1_OBJECT_FLAG_DYNAMIC_STRINGS |
          ASN1_OBJECT_FLAG_DYNAMIC_DATA);

    return (o->nid);
 err2:
    OBJerr(OBJ_F_OBJ_ADD_OBJECT, ERR_R_MALLOC_FAILURE);
 err:
    for (i = ADDED_DATA; i <= ADDED_NID; i++)
        if (ao[i] != NULL)
            OPENSSL_free(ao[i]);
    if (o != NULL)
        OPENSSL_free(o);
    return (NID_undef);
}

ASN1_OBJECT *OBJ_nid2obj(int n)
{
    ADDED_OBJ ad, *adp;
    ASN1_OBJECT ob;

    if ((n >= 0) && (n < NUM_NID)) {
        if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
            OBJerr(OBJ_F_OBJ_NID2OBJ, OBJ_R_UNKNOWN_NID);
            return (NULL);
        }
        return ((ASN1_OBJECT *)&(nid_objs[n]));
    } else if (added == NULL)
        return (NULL);
    else {
        ad.type = ADDED_NID;
        ad.obj = &ob;
        ob.nid = n;
        adp = lh_ADDED_OBJ_retrieve(added, &ad);
        if (adp != NULL)
            return (adp->obj);
        else {
            OBJerr(OBJ_F_OBJ_NID2OBJ, OBJ_R_UNKNOWN_NID);
            return (NULL);
        }
    }
}

const char *OBJ_nid2sn(int n)
{
    ADDED_OBJ ad, *adp;
    ASN1_OBJECT ob;

    if ((n >= 0) && (n < NUM_NID)) {
        if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
            OBJerr(OBJ_F_OBJ_NID2SN, OBJ_R_UNKNOWN_NID);
            return (NULL);
        }
        return (nid_objs[n].sn);
    } else if (added == NULL)
        return (NULL);
    else {
        ad.type = ADDED_NID;
        ad.obj = &ob;
        ob.nid = n;
        adp = lh_ADDED_OBJ_retrieve(added, &ad);
        if (adp != NULL)
            return (adp->obj->sn);
        else {
            OBJerr(OBJ_F_OBJ_NID2SN, OBJ_R_UNKNOWN_NID);
            return (NULL);
        }
    }
}

const char *OBJ_nid2ln(int n)
{
    ADDED_OBJ ad, *adp;
    ASN1_OBJECT ob;

    if ((n >= 0) && (n < NUM_NID)) {
        if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
            OBJerr(OBJ_F_OBJ_NID2LN, OBJ_R_UNKNOWN_NID);
            return (NULL);
        }
        return (nid_objs[n].ln);
    } else if (added == NULL)
        return (NULL);
    else {
        ad.type = ADDED_NID;
        ad.obj = &ob;
        ob.nid = n;
        adp = lh_ADDED_OBJ_retrieve(added, &ad);
        if (adp != NULL)
            return (adp->obj->ln);
        else {
            OBJerr(OBJ_F_OBJ_NID2LN, OBJ_R_UNKNOWN_NID);
            return (NULL);
        }
    }
}

static int obj_cmp(const ASN1_OBJECT *const *ap, const unsigned int *bp)
{
    int j;
    const ASN1_OBJECT *a = *ap;
    const ASN1_OBJECT *b = &nid_objs[*bp];

    j = (a->length - b->length);
    if (j)
        return (j);
    return (memcmp(a->data, b->data, a->length));
}

IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, obj);

int OBJ_obj2nid(const ASN1_OBJECT *a)
{
    const unsigned int *op;
    ADDED_OBJ ad, *adp;

    if (a == NULL)
        return (NID_undef);
    if (a->nid != 0)
        return (a->nid);

    if (added != NULL) {
        ad.type = ADDED_DATA;
        ad.obj = (ASN1_OBJECT *)a; /* XXX: ugly but harmless */
        adp = lh_ADDED_OBJ_retrieve(added, &ad);
        if (adp != NULL)
            return (adp->obj->nid);
    }
    op = OBJ_bsearch_obj(&a, obj_objs, NUM_OBJ);
    if (op == NULL)
        return (NID_undef);
    return (nid_objs[*op].nid);
}

/*
 * Convert an object name into an ASN1_OBJECT if "noname" is not set then
 * search for short and long names first. This will convert the "dotted" form
 * into an object: unlike OBJ_txt2nid it can be used with any objects, not
 * just registered ones.
 */

ASN1_OBJECT *OBJ_txt2obj(const char *s, int no_name)
{
    int nid = NID_undef;
    ASN1_OBJECT *op = NULL;
    unsigned char *buf;
    unsigned char *p;
    const unsigned char *cp;
    int i, j;

    if (!no_name) {
        if (((nid = OBJ_sn2nid(s)) != NID_undef) ||
            ((nid = OBJ_ln2nid(s)) != NID_undef))
            return OBJ_nid2obj(nid);
    }

    /* Work out size of content octets */
    i = a2d_ASN1_OBJECT(NULL, 0, s, -1);
    if (i <= 0) {
        /* Don't clear the error */
        /*
         * ERR_clear_error();
         */
        return NULL;
    }
    /* Work out total size */
    j = ASN1_object_size(0, i, V_ASN1_OBJECT);

    if ((buf = (unsigned char *)OPENSSL_malloc(j)) == NULL)
        return NULL;

    p = buf;
    /* Write out tag+length */
    ASN1_put_object(&p, 0, i, V_ASN1_OBJECT, V_ASN1_UNIVERSAL);
    /* Write out contents */
    a2d_ASN1_OBJECT(p, i, s, -1);

    cp = buf;
    op = d2i_ASN1_OBJECT(NULL, &cp, j);
    OPENSSL_free(buf);
    return op;
}

int OBJ_obj2txt(char *buf, int buf_len, const ASN1_OBJECT *a, int no_name)
{
    int i, n = 0, len, nid, first, use_bn;
    BIGNUM *bl;
    unsigned long l;
    const unsigned char *p;
    char tbuf[DECIMAL_SIZE(i) + DECIMAL_SIZE(l) + 2];

    /* Ensure that, at every state, |buf| is NUL-terminated. */
    if (buf && buf_len > 0)
        buf[0] = '\0';

    if ((a == NULL) || (a->data == NULL))
        return (0);

    if (!no_name && (nid = OBJ_obj2nid(a)) != NID_undef) {
        const char *s;
        s = OBJ_nid2ln(nid);
        if (s == NULL)
            s = OBJ_nid2sn(nid);
        if (s) {
            if (buf)
                BUF_strlcpy(buf, s, buf_len);
            n = strlen(s);
            return n;
        }
    }

    len = a->length;
    p = a->data;

    first = 1;
    bl = NULL;

    while (len > 0) {
        l = 0;
        use_bn = 0;
        for (;;) {
            unsigned char c = *p++;
            len--;
            if ((len == 0) && (c & 0x80))
                goto err;
            if (use_bn) {
                if (!BN_add_word(bl, c & 0x7f))
                    goto err;
            } else
                l |= c & 0x7f;
            if (!(c & 0x80))
                break;
            if (!use_bn && (l > (ULONG_MAX >> 7L))) {
                if (!bl && !(bl = BN_new()))
                    goto err;
                if (!BN_set_word(bl, l))
                    goto err;
                use_bn = 1;
            }
            if (use_bn) {
                if (!BN_lshift(bl, bl, 7))
                    goto err;
            } else
                l <<= 7L;
        }

        if (first) {
            first = 0;
            if (l >= 80) {
                i = 2;
                if (use_bn) {
                    if (!BN_sub_word(bl, 80))
                        goto err;
                } else
                    l -= 80;
            } else {
                i = (int)(l / 40);
                l -= (long)(i * 40);
            }
            if (buf && (buf_len > 1)) {
                *buf++ = i + '0';
                *buf = '\0';
                buf_len--;
            }
            n++;
        }

        if (use_bn) {
            char *bndec;
            bndec = BN_bn2dec(bl);
            if (!bndec)
                goto err;
            i = strlen(bndec);
            if (buf) {
                if (buf_len > 1) {
                    *buf++ = '.';
                    *buf = '\0';
                    buf_len--;
                }
                BUF_strlcpy(buf, bndec, buf_len);
                if (i > buf_len) {
                    buf += buf_len;
                    buf_len = 0;
                } else {
                    buf += i;
                    buf_len -= i;
                }
            }
            n++;
            n += i;
            OPENSSL_free(bndec);
        } else {
            BIO_snprintf(tbuf, sizeof tbuf, ".%lu", l);
            i = strlen(tbuf);
            if (buf && (buf_len > 0)) {
                BUF_strlcpy(buf, tbuf, buf_len);
                if (i > buf_len) {
                    buf += buf_len;
                    buf_len = 0;
                } else {
                    buf += i;
                    buf_len -= i;
                }
            }
            n += i;
            l = 0;
        }
    }

    if (bl)
        BN_free(bl);
    return n;

 err:
    if (bl)
        BN_free(bl);
    return -1;
}

int OBJ_txt2nid(const char *s)
{
    ASN1_OBJECT *obj;
    int nid;
    obj = OBJ_txt2obj(s, 0);
    nid = OBJ_obj2nid(obj);
    ASN1_OBJECT_free(obj);
    return nid;
}

int OBJ_ln2nid(const char *s)
{
    ASN1_OBJECT o;
    const ASN1_OBJECT *oo = &o;
    ADDED_OBJ ad, *adp;
    const unsigned int *op;

    o.ln = s;
    if (added != NULL) {
        ad.type = ADDED_LNAME;
        ad.obj = &o;
        adp = lh_ADDED_OBJ_retrieve(added, &ad);
        if (adp != NULL)
            return (adp->obj->nid);
    }
    op = OBJ_bsearch_ln(&oo, ln_objs, NUM_LN);
    if (op == NULL)
        return (NID_undef);
    return (nid_objs[*op].nid);
}

int OBJ_sn2nid(const char *s)
{
    ASN1_OBJECT o;
    const ASN1_OBJECT *oo = &o;
    ADDED_OBJ ad, *adp;
    const unsigned int *op;

    o.sn = s;
    if (added != NULL) {
        ad.type = ADDED_SNAME;
        ad.obj = &o;
        adp = lh_ADDED_OBJ_retrieve(added, &ad);
        if (adp != NULL)
            return (adp->obj->nid);
    }
    op = OBJ_bsearch_sn(&oo, sn_objs, NUM_SN);
    if (op == NULL)
        return (NID_undef);
    return (nid_objs[*op].nid);
}

const void *OBJ_bsearch_(const void *key, const void *base, int num, int size,
                         int (*cmp) (const void *, const void *))
{
    return OBJ_bsearch_ex_(key, base, num, size, cmp, 0);
}

const void *OBJ_bsearch_ex_(const void *key, const void *base_, int num,
                            int size,
                            int (*cmp) (const void *, const void *),
                            int flags)
{
    const char *base = base_;
    int l, h, i = 0, c = 0;
    const char *p = NULL;

    if (num == 0)
        return (NULL);
    l = 0;
    h = num;
    while (l < h) {
        i = (l + h) / 2;
        p = &(base[i * size]);
        c = (*cmp) (key, p);
        if (c < 0)
            h = i;
        else if (c > 0)
            l = i + 1;
        else
            break;
    }
#ifdef CHARSET_EBCDIC
    /*
     * THIS IS A KLUDGE - Because the *_obj is sorted in ASCII order, and I
     * don't have perl (yet), we revert to a *LINEAR* search when the object
     * wasn't found in the binary search.
     */
    if (c != 0) {
        for (i = 0; i < num; ++i) {
            p = &(base[i * size]);
            c = (*cmp) (key, p);
            if (c == 0 || (c < 0 && (flags & OBJ_BSEARCH_VALUE_ON_NOMATCH)))
                return p;
        }
    }
#endif
    if (c != 0 && !(flags & OBJ_BSEARCH_VALUE_ON_NOMATCH))
        p = NULL;
    else if (c == 0 && (flags & OBJ_BSEARCH_FIRST_VALUE_ON_MATCH)) {
        while (i > 0 && (*cmp) (key, &(base[(i - 1) * size])) == 0)
            i--;
        p = &(base[i * size]);
    }
    return (p);
}

int OBJ_create_objects(BIO *in)
{
    MS_STATIC char buf[512];
    int i, num = 0;
    char *o, *s, *l = NULL;

    for (;;) {
        s = o = NULL;
        i = BIO_gets(in, buf, 512);
        if (i <= 0)
            return (num);
        buf[i - 1] = '\0';
        if (!isalnum((unsigned char)buf[0]))
            return (num);
        o = s = buf;
        while (isdigit((unsigned char)*s) || (*s == '.'))
            s++;
        if (*s != '\0') {
            *(s++) = '\0';
            while (isspace((unsigned char)*s))
                s++;
            if (*s == '\0')
                s = NULL;
            else {
                l = s;
                while ((*l != '\0') && !isspace((unsigned char)*l))
                    l++;
                if (*l != '\0') {
                    *(l++) = '\0';
                    while (isspace((unsigned char)*l))
                        l++;
                    if (*l == '\0')
                        l = NULL;
                } else
                    l = NULL;
            }
        } else
            s = NULL;
        if ((o == NULL) || (*o == '\0'))
            return (num);
        if (!OBJ_create(o, s, l))
            return (num);
        num++;
    }
    /* return(num); */
}

int OBJ_create(const char *oid, const char *sn, const char *ln)
{
    int ok = 0;
    ASN1_OBJECT *op = NULL;
    unsigned char *buf;
    int i;

    i = a2d_ASN1_OBJECT(NULL, 0, oid, -1);
    if (i <= 0)
        return (0);

    if ((buf = (unsigned char *)OPENSSL_malloc(i)) == NULL) {
        OBJerr(OBJ_F_OBJ_CREATE, ERR_R_MALLOC_FAILURE);
        return (0);
    }
    i = a2d_ASN1_OBJECT(buf, i, oid, -1);
    if (i == 0)
        goto err;
    op = (ASN1_OBJECT *)ASN1_OBJECT_create(OBJ_new_nid(1), buf, i, sn, ln);
    if (op == NULL)
        goto err;
    ok = OBJ_add_object(op);
 err:
    ASN1_OBJECT_free(op);
    OPENSSL_free(buf);
    return (ok);
}
Commit	Line	Data
d02b48c6	1	/* crypto/objects/obj_dat.c */
58964a49	2	/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
d02b48c6 RE	3	* All rights reserved.
	4	*
	5	* This package is an SSL implementation written
	6	* by Eric Young (eay@cryptsoft.com).
	7	* The implementation was written so as to conform with Netscapes SSL.
0f113f3e	8	*
d02b48c6 RE	9	* This library is free for commercial and non-commercial use as long as
	10	* the following conditions are aheared to. The following conditions
	11	* apply to all code found in this distribution, be it the RC4, RSA,
	12	* lhash, DES, etc., code; not just the SSL code. The SSL documentation
	13	* included with this distribution is covered by the same copyright terms
	14	* except that the holder is Tim Hudson (tjh@cryptsoft.com).
0f113f3e	15	*
d02b48c6 RE	16	* Copyright remains Eric Young's, and as such any Copyright notices in
	17	* the code are not to be removed.
	18	* If this package is used in a product, Eric Young should be given attribution
	19	* as the author of the parts of the library used.
	20	* This can be in the form of a textual message at program startup or
	21	* in documentation (online or textual) provided with the package.
0f113f3e	22	*
d02b48c6 RE	23	* Redistribution and use in source and binary forms, with or without
	24	* modification, are permitted provided that the following conditions
	25	* are met:
	26	* 1. Redistributions of source code must retain the copyright
	27	* notice, this list of conditions and the following disclaimer.
	28	* 2. Redistributions in binary form must reproduce the above copyright
	29	* notice, this list of conditions and the following disclaimer in the
	30	* documentation and/or other materials provided with the distribution.
	31	* 3. All advertising materials mentioning features or use of this software
	32	* must display the following acknowledgement:
	33	* "This product includes cryptographic software written by
	34	* Eric Young (eay@cryptsoft.com)"
	35	* The word 'cryptographic' can be left out if the rouines from the library
	36	* being used are not cryptographic related :-).
0f113f3e	37	* 4. If you include any Windows specific code (or a derivative thereof) from
d02b48c6 RE	38	* the apps directory (application code) you must include an acknowledgement:
d02b48c6 RE	39	* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
0f113f3e	40	*
d02b48c6 RE	41	* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
	42	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	43	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	44	* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
	45	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	46	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	47	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	48	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	49	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	50	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	51	* SUCH DAMAGE.
0f113f3e	52	*
d02b48c6 RE	53	* The licence and distribution terms for any publically available version or
	54	* derivative of this code cannot be changed. i.e. this code cannot simply be
	55	* copied and put under another distribution licence
	56	* [including the GNU Public Licence.]
	57	*/
	58
	59	#include <stdio.h>
58964a49	60	#include <ctype.h>
452ae49d	61	#include <limits.h>
d02b48c6	62	#include "cryptlib.h"
ec577822 BM	63	#include <openssl/lhash.h>
	64	#include <openssl/asn1.h>
	65	#include <openssl/objects.h>
1e26a8ba	66	#include <openssl/bn.h>
d02b48c6 RE	67
d02b48c6 RE	68	/* obj_dat.h is generated from objects.h by obj_dat.pl */
cf1b7d96	69	#ifndef OPENSSL_NO_OBJECT
0f113f3e	70	# include "obj_dat.h"
dfeab068 RE	71	#else
dfeab068 RE	72	/* You will have to load all the objects needed manually in the application */
0f113f3e MC	73	# define NUM_NID 0
	74	# define NUM_SN 0
	75	# define NUM_LN 0
	76	# define NUM_OBJ 0
26f0cf69 AP	77	static const unsigned char lvalues[1];
	78	static const ASN1_OBJECT nid_objs[1];
	79	static const unsigned int sn_objs[1];
	80	static const unsigned int ln_objs[1];
	81	static const unsigned int obj_objs[1];
dfeab068	82	#endif
d02b48c6	83
e19106f5 DSH	84	DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, sn);
	85	DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, ln);
	86	DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, obj);
babb3798	87
0f113f3e MC	88	#define ADDED_DATA 0
	89	#define ADDED_SNAME 1
	90	#define ADDED_LNAME 2
	91	#define ADDED_NID 3
d02b48c6	92
0f113f3e MC	93	typedef struct added_obj_st {
	94	int type;
	95	ASN1_OBJECT *obj;
	96	} ADDED_OBJ;
3c1d6bbc	97	DECLARE_LHASH_OF(ADDED_OBJ);
d02b48c6	98
0f113f3e MC	99	static int new_nid = NUM_NID;
0f113f3e MC	100	static LHASH_OF(ADDED_OBJ) *added = NULL;
d02b48c6	101
0f113f3e MC	102	static int sn_cmp(const ASN1_OBJECT const a, const unsigned int *b)
	103	{
	104	return (strcmp((a)->sn, nid_objs[b].sn));
	105	}
d02b48c6	106
e19106f5	107	IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, sn);
babb3798	108
0f113f3e MC	109	static int ln_cmp(const ASN1_OBJECT const a, const unsigned int *b)
	110	{
	111	return (strcmp((a)->ln, nid_objs[b].ln));
	112	}
babb3798	113
e19106f5	114	IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, ln);
d02b48c6	115
3c1d6bbc	116	static unsigned long added_obj_hash(const ADDED_OBJ *ca)
0f113f3e MC	117	{
	118	const ASN1_OBJECT *a;
	119	int i;
	120	unsigned long ret = 0;
	121	unsigned char *p;
	122
	123	a = ca->obj;
	124	switch (ca->type) {
	125	case ADDED_DATA:
	126	ret = a->length << 20L;
	127	p = (unsigned char *)a->data;
	128	for (i = 0; i < a->length; i++)
	129	ret ^= p[i] << ((i * 3) % 24);
	130	break;
	131	case ADDED_SNAME:
	132	ret = lh_strhash(a->sn);
	133	break;
	134	case ADDED_LNAME:
	135	ret = lh_strhash(a->ln);
	136	break;
	137	case ADDED_NID:
	138	ret = a->nid;
	139	break;
	140	default:
	141	/* abort(); */
	142	return 0;
	143	}
	144	ret &= 0x3fffffffL;
	145	ret \|= ((unsigned long)ca->type) << 30L;
	146	return (ret);
	147	}
	148
3c1d6bbc	149	static IMPLEMENT_LHASH_HASH_FN(added_obj, ADDED_OBJ)
d02b48c6	150
3c1d6bbc	151	static int added_obj_cmp(const ADDED_OBJ ca, const ADDED_OBJ cb)
0f113f3e MC	152	{
	153	ASN1_OBJECT a, b;
	154	int i;
	155
	156	i = ca->type - cb->type;
	157	if (i)
	158	return (i);
	159	a = ca->obj;
	160	b = cb->obj;
	161	switch (ca->type) {
	162	case ADDED_DATA:
	163	i = (a->length - b->length);
	164	if (i)
	165	return (i);
	166	return (memcmp(a->data, b->data, (size_t)a->length));
	167	case ADDED_SNAME:
	168	if (a->sn == NULL)
	169	return (-1);
	170	else if (b->sn == NULL)
	171	return (1);
	172	else
	173	return (strcmp(a->sn, b->sn));
	174	case ADDED_LNAME:
	175	if (a->ln == NULL)
	176	return (-1);
	177	else if (b->ln == NULL)
	178	return (1);
	179	else
	180	return (strcmp(a->ln, b->ln));
	181	case ADDED_NID:
	182	return (a->nid - b->nid);
	183	default:
	184	/* abort(); */
	185	return 0;
	186	}
	187	}
	188
3c1d6bbc	189	static IMPLEMENT_LHASH_COMP_FN(added_obj, ADDED_OBJ)
d02b48c6	190
6b691a5c	191	static int init_added(void)
0f113f3e MC	192	{
	193	if (added != NULL)
	194	return (1);
	195	added = lh_ADDED_OBJ_new();
	196	return (added != NULL);
	197	}
d02b48c6	198
3c1d6bbc	199	static void cleanup1_doall(ADDED_OBJ *a)
0f113f3e MC	200	{
	201	a->obj->nid = 0;
	202	a->obj->flags \|= ASN1_OBJECT_FLAG_DYNAMIC \|
	203	ASN1_OBJECT_FLAG_DYNAMIC_STRINGS \| ASN1_OBJECT_FLAG_DYNAMIC_DATA;
	204	}
d02b48c6	205
3c1d6bbc	206	static void cleanup2_doall(ADDED_OBJ *a)
0f113f3e MC	207	{
	208	a->obj->nid++;
	209	}
d02b48c6	210
3c1d6bbc	211	static void cleanup3_doall(ADDED_OBJ *a)
0f113f3e MC	212	{
	213	if (--a->obj->nid == 0)
	214	ASN1_OBJECT_free(a->obj);
	215	OPENSSL_free(a);
	216	}
d02b48c6	217
3c1d6bbc BL	218	static IMPLEMENT_LHASH_DOALL_FN(cleanup1, ADDED_OBJ)
	219	static IMPLEMENT_LHASH_DOALL_FN(cleanup2, ADDED_OBJ)
	220	static IMPLEMENT_LHASH_DOALL_FN(cleanup3, ADDED_OBJ)
3c914840	221
0f113f3e MC	222	/*
	223	* The purpose of obj_cleanup_defer is to avoid EVP_cleanup() attempting to
	224	* use freed up OIDs. If necessary the actual freeing up of OIDs is delayed.
246e0931	225	*/
246e0931 DSH	226	int obj_cleanup_defer = 0;
	227
	228	void check_defer(int nid)
0f113f3e MC	229	{
	230	if (!obj_cleanup_defer && nid >= NUM_NID)
	231	obj_cleanup_defer = 1;
	232	}
246e0931	233
6b691a5c	234	void OBJ_cleanup(void)
0f113f3e MC	235	{
	236	if (obj_cleanup_defer) {
	237	obj_cleanup_defer = 2;
	238	return;
	239	}
	240	if (added == NULL)
	241	return;
	242	lh_ADDED_OBJ_down_load(added) = 0;
	243	lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup1)); /* zero counters */
	244	lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup2)); /* set counters */
	245	lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup3)); /* free objects */
	246	lh_ADDED_OBJ_free(added);
	247	added = NULL;
	248	}
d02b48c6	249
6b691a5c	250	int OBJ_new_nid(int num)
0f113f3e MC	251	{
0f113f3e MC	252	int i;
d02b48c6	253
0f113f3e MC	254	i = new_nid;
	255	new_nid += num;
	256	return (i);
	257	}
d02b48c6	258
8d28d5f8	259	int OBJ_add_object(const ASN1_OBJECT *obj)
0f113f3e MC	260	{
	261	ASN1_OBJECT *o;
	262	ADDED_OBJ ao[4] = { NULL, NULL, NULL, NULL }, aop;
	263	int i;
	264
	265	if (added == NULL)
	266	if (!init_added())
	267	return (0);
	268	if ((o = OBJ_dup(obj)) == NULL)
	269	goto err;
	270	if (!(ao[ADDED_NID] = (ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ))))
	271	goto err2;
	272	if ((o->length != 0) && (obj->data != NULL))
	273	if (!
	274	(ao[ADDED_DATA] = (ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ))))
	275	goto err2;
	276	if (o->sn != NULL)
	277	if (!
	278	(ao[ADDED_SNAME] =
	279	(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ))))
	280	goto err2;
	281	if (o->ln != NULL)
	282	if (!
	283	(ao[ADDED_LNAME] =
	284	(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ))))
	285	goto err2;
	286
	287	for (i = ADDED_DATA; i <= ADDED_NID; i++) {
	288	if (ao[i] != NULL) {
	289	ao[i]->type = i;
	290	ao[i]->obj = o;
	291	aop = lh_ADDED_OBJ_insert(added, ao[i]);
	292	/* memory leak, buit should not normally matter */
	293	if (aop != NULL)
	294	OPENSSL_free(aop);
	295	}
	296	}
	297	o->flags &=
	298	~(ASN1_OBJECT_FLAG_DYNAMIC \| ASN1_OBJECT_FLAG_DYNAMIC_STRINGS \|
	299	ASN1_OBJECT_FLAG_DYNAMIC_DATA);
	300
	301	return (o->nid);
	302	err2:
	303	OBJerr(OBJ_F_OBJ_ADD_OBJECT, ERR_R_MALLOC_FAILURE);
	304	err:
	305	for (i = ADDED_DATA; i <= ADDED_NID; i++)
	306	if (ao[i] != NULL)
	307	OPENSSL_free(ao[i]);
	308	if (o != NULL)
	309	OPENSSL_free(o);
	310	return (NID_undef);
	311	}
d02b48c6	312
6b691a5c	313	ASN1_OBJECT *OBJ_nid2obj(int n)
0f113f3e MC	314	{
	315	ADDED_OBJ ad, *adp;
	316	ASN1_OBJECT ob;
	317
	318	if ((n >= 0) && (n < NUM_NID)) {
	319	if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
	320	OBJerr(OBJ_F_OBJ_NID2OBJ, OBJ_R_UNKNOWN_NID);
	321	return (NULL);
	322	}
	323	return ((ASN1_OBJECT *)&(nid_objs[n]));
	324	} else if (added == NULL)
	325	return (NULL);
	326	else {
	327	ad.type = ADDED_NID;
	328	ad.obj = &ob;
	329	ob.nid = n;
	330	adp = lh_ADDED_OBJ_retrieve(added, &ad);
	331	if (adp != NULL)
	332	return (adp->obj);
	333	else {
	334	OBJerr(OBJ_F_OBJ_NID2OBJ, OBJ_R_UNKNOWN_NID);
	335	return (NULL);
	336	}
	337	}
	338	}
d02b48c6	339
6b691a5c	340	const char *OBJ_nid2sn(int n)
0f113f3e MC	341	{
	342	ADDED_OBJ ad, *adp;
	343	ASN1_OBJECT ob;
	344
	345	if ((n >= 0) && (n < NUM_NID)) {
	346	if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
	347	OBJerr(OBJ_F_OBJ_NID2SN, OBJ_R_UNKNOWN_NID);
	348	return (NULL);
	349	}
	350	return (nid_objs[n].sn);
	351	} else if (added == NULL)
	352	return (NULL);
	353	else {
	354	ad.type = ADDED_NID;
	355	ad.obj = &ob;
	356	ob.nid = n;
	357	adp = lh_ADDED_OBJ_retrieve(added, &ad);
	358	if (adp != NULL)
	359	return (adp->obj->sn);
	360	else {
	361	OBJerr(OBJ_F_OBJ_NID2SN, OBJ_R_UNKNOWN_NID);
	362	return (NULL);
	363	}
	364	}
	365	}
d02b48c6	366
6b691a5c	367	const char *OBJ_nid2ln(int n)
0f113f3e MC	368	{
	369	ADDED_OBJ ad, *adp;
	370	ASN1_OBJECT ob;
	371
	372	if ((n >= 0) && (n < NUM_NID)) {
	373	if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
	374	OBJerr(OBJ_F_OBJ_NID2LN, OBJ_R_UNKNOWN_NID);
	375	return (NULL);
	376	}
	377	return (nid_objs[n].ln);
	378	} else if (added == NULL)
	379	return (NULL);
	380	else {
	381	ad.type = ADDED_NID;
	382	ad.obj = &ob;
	383	ob.nid = n;
	384	adp = lh_ADDED_OBJ_retrieve(added, &ad);
	385	if (adp != NULL)
	386	return (adp->obj->ln);
	387	else {
	388	OBJerr(OBJ_F_OBJ_NID2LN, OBJ_R_UNKNOWN_NID);
	389	return (NULL);
	390	}
	391	}
	392	}
	393
	394	static int obj_cmp(const ASN1_OBJECT const ap, const unsigned int *bp)
	395	{
	396	int j;
	397	const ASN1_OBJECT a = ap;
	398	const ASN1_OBJECT b = &nid_objs[bp];
	399
	400	j = (a->length - b->length);
	401	if (j)
	402	return (j);
	403	return (memcmp(a->data, b->data, a->length));
	404	}
babb3798	405
e19106f5	406	IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, obj);
babb3798	407
8d28d5f8	408	int OBJ_obj2nid(const ASN1_OBJECT *a)
0f113f3e MC	409	{
	410	const unsigned int *op;
	411	ADDED_OBJ ad, *adp;
	412
	413	if (a == NULL)
	414	return (NID_undef);
	415	if (a->nid != 0)
	416	return (a->nid);
	417
	418	if (added != NULL) {
	419	ad.type = ADDED_DATA;
	420	ad.obj = (ASN1_OBJECT )a; / XXX: ugly but harmless */
	421	adp = lh_ADDED_OBJ_retrieve(added, &ad);
	422	if (adp != NULL)
	423	return (adp->obj->nid);
	424	}
	425	op = OBJ_bsearch_obj(&a, obj_objs, NUM_OBJ);
	426	if (op == NULL)
	427	return (NID_undef);
	428	return (nid_objs[*op].nid);
	429	}
	430
	431	/*
	432	* Convert an object name into an ASN1_OBJECT if "noname" is not set then
	433	* search for short and long names first. This will convert the "dotted" form
	434	* into an object: unlike OBJ_txt2nid it can be used with any objects, not
	435	* just registered ones.
2d723902 DSH	436	*/
2d723902 DSH	437
6b691a5c	438	ASN1_OBJECT OBJ_txt2obj(const char s, int no_name)
0f113f3e MC	439	{
	440	int nid = NID_undef;
	441	ASN1_OBJECT *op = NULL;
	442	unsigned char *buf;
	443	unsigned char *p;
	444	const unsigned char *cp;
	445	int i, j;
	446
	447	if (!no_name) {
	448	if (((nid = OBJ_sn2nid(s)) != NID_undef) \|\|
	449	((nid = OBJ_ln2nid(s)) != NID_undef))
	450	return OBJ_nid2obj(nid);
	451	}
	452
	453	/* Work out size of content octets */
	454	i = a2d_ASN1_OBJECT(NULL, 0, s, -1);
	455	if (i <= 0) {
	456	/* Don't clear the error */
	457	/*
	458	* ERR_clear_error();
	459	*/
	460	return NULL;
	461	}
	462	/* Work out total size */
	463	j = ASN1_object_size(0, i, V_ASN1_OBJECT);
	464
	465	if ((buf = (unsigned char *)OPENSSL_malloc(j)) == NULL)
	466	return NULL;
	467
	468	p = buf;
	469	/* Write out tag+length */
	470	ASN1_put_object(&p, 0, i, V_ASN1_OBJECT, V_ASN1_UNIVERSAL);
	471	/* Write out contents */
	472	a2d_ASN1_OBJECT(p, i, s, -1);
	473
	474	cp = buf;
	475	op = d2i_ASN1_OBJECT(NULL, &cp, j);
	476	OPENSSL_free(buf);
	477	return op;
	478	}
d02b48c6	479
6343829a	480	int OBJ_obj2txt(char buf, int buf_len, const ASN1_OBJECT a, int no_name)
3e3d2ea2	481	{
0f113f3e MC	482	int i, n = 0, len, nid, first, use_bn;
	483	BIGNUM *bl;
	484	unsigned long l;
	485	const unsigned char *p;
	486	char tbuf[DECIMAL_SIZE(i) + DECIMAL_SIZE(l) + 2];
	487
	488	/* Ensure that, at every state, \|buf\| is NUL-terminated. */
	489	if (buf && buf_len > 0)
	490	buf[0] = '\0';
	491
	492	if ((a == NULL) \|\| (a->data == NULL))
	493	return (0);
	494
	495	if (!no_name && (nid = OBJ_obj2nid(a)) != NID_undef) {
	496	const char *s;
	497	s = OBJ_nid2ln(nid);
	498	if (s == NULL)
	499	s = OBJ_nid2sn(nid);
	500	if (s) {
	501	if (buf)
	502	BUF_strlcpy(buf, s, buf_len);
	503	n = strlen(s);
	504	return n;
	505	}
	506	}
	507
	508	len = a->length;
	509	p = a->data;
	510
	511	first = 1;
	512	bl = NULL;
	513
	514	while (len > 0) {
	515	l = 0;
	516	use_bn = 0;
	517	for (;;) {
	518	unsigned char c = *p++;
	519	len--;
	520	if ((len == 0) && (c & 0x80))
	521	goto err;
	522	if (use_bn) {
	523	if (!BN_add_word(bl, c & 0x7f))
	524	goto err;
	525	} else
	526	l \|= c & 0x7f;
	527	if (!(c & 0x80))
	528	break;
	529	if (!use_bn && (l > (ULONG_MAX >> 7L))) {
	530	if (!bl && !(bl = BN_new()))
	531	goto err;
	532	if (!BN_set_word(bl, l))
	533	goto err;
	534	use_bn = 1;
	535	}
	536	if (use_bn) {
	537	if (!BN_lshift(bl, bl, 7))
	538	goto err;
	539	} else
	540	l <<= 7L;
	541	}
	542
	543	if (first) {
	544	first = 0;
	545	if (l >= 80) {
546	i = 2;
547	if (use_bn) {
548	if (!BN_sub_word(bl, 80))
549	goto err;
550	} else
551	l -= 80;
552	} else {
553	i = (int)(l / 40);
554	l -= (long)(i * 40);
555	}
556	if (buf && (buf_len > 1)) {
557	*buf++ = i + '0';
558	*buf = '\0';
559	buf_len--;
560	}
561	n++;
562	}
563
564	if (use_bn) {
565	char *bndec;
566	bndec = BN_bn2dec(bl);
567	if (!bndec)
568	goto err;
569	i = strlen(bndec);
570	if (buf) {
571	if (buf_len > 1) {
572	*buf++ = '.';
573	*buf = '\0';
574	buf_len--;
575	}
576	BUF_strlcpy(buf, bndec, buf_len);
577	if (i > buf_len) {
578	buf += buf_len;
579	buf_len = 0;
580	} else {
581	buf += i;
582	buf_len -= i;
583	}
584	}
585	n++;
586	n += i;
587	OPENSSL_free(bndec);
588	} else {
589	BIO_snprintf(tbuf, sizeof tbuf, ".%lu", l);
590	i = strlen(tbuf);
591	if (buf && (buf_len > 0)) {
592	BUF_strlcpy(buf, tbuf, buf_len);
593	if (i > buf_len) {
594	buf += buf_len;
595	buf_len = 0;
596	} else {
597	buf += i;
598	buf_len -= i;
599	}
600	}
601	n += i;
602	l = 0;
603	}
604	}
605
606	if (bl)
607	BN_free(bl);
608	return n;
609
610	err:
611	if (bl)
612	BN_free(bl);
613	return -1;
3e3d2ea2 DSH	614	}
3e3d2ea2 DSH	615
8d28d5f8	616	int OBJ_txt2nid(const char *s)
2d723902	617	{
0f113f3e MC	618	ASN1_OBJECT *obj;
	619	int nid;
	620	obj = OBJ_txt2obj(s, 0);
	621	nid = OBJ_obj2nid(obj);
	622	ASN1_OBJECT_free(obj);
	623	return nid;
2d723902 DSH	624	}
2d723902 DSH	625
6b691a5c	626	int OBJ_ln2nid(const char *s)
0f113f3e MC	627	{
	628	ASN1_OBJECT o;
	629	const ASN1_OBJECT *oo = &o;
	630	ADDED_OBJ ad, *adp;
	631	const unsigned int *op;
	632
	633	o.ln = s;
	634	if (added != NULL) {
	635	ad.type = ADDED_LNAME;
	636	ad.obj = &o;
	637	adp = lh_ADDED_OBJ_retrieve(added, &ad);
	638	if (adp != NULL)
	639	return (adp->obj->nid);
	640	}
	641	op = OBJ_bsearch_ln(&oo, ln_objs, NUM_LN);
	642	if (op == NULL)
	643	return (NID_undef);
	644	return (nid_objs[*op].nid);
	645	}
d02b48c6	646
6b691a5c	647	int OBJ_sn2nid(const char *s)
0f113f3e MC	648	{
	649	ASN1_OBJECT o;
	650	const ASN1_OBJECT *oo = &o;
	651	ADDED_OBJ ad, *adp;
	652	const unsigned int *op;
	653
	654	o.sn = s;
	655	if (added != NULL) {
	656	ad.type = ADDED_SNAME;
	657	ad.obj = &o;
	658	adp = lh_ADDED_OBJ_retrieve(added, &ad);
	659	if (adp != NULL)
	660	return (adp->obj->nid);
	661	}
	662	op = OBJ_bsearch_sn(&oo, sn_objs, NUM_SN);
	663	if (op == NULL)
	664	return (NID_undef);
	665	return (nid_objs[*op].nid);
	666	}
d02b48c6	667
babb3798	668	const void OBJ_bsearch_(const void key, const void *base, int num, int size,
0f113f3e MC	669	int (cmp) (const void , const void *))
	670	{
	671	return OBJ_bsearch_ex_(key, base, num, size, cmp, 0);
	672	}
ea5240a5	673
1ea6472e	674	const void OBJ_bsearch_ex_(const void key, const void *base_, int num,
0f113f3e MC	675	int size,
	676	int (cmp) (const void , const void *),
	677	int flags)
	678	{
	679	const char *base = base_;
	680	int l, h, i = 0, c = 0;
	681	const char *p = NULL;
	682
	683	if (num == 0)
	684	return (NULL);
	685	l = 0;
	686	h = num;
	687	while (l < h) {
	688	i = (l + h) / 2;
	689	p = &(base[i * size]);
	690	c = (*cmp) (key, p);
	691	if (c < 0)
	692	h = i;
	693	else if (c > 0)
	694	l = i + 1;
	695	else
	696	break;
	697	}
a53955d8	698	#ifdef CHARSET_EBCDIC
0f113f3e MC	699	/*
	700	* THIS IS A KLUDGE - Because the *_obj is sorted in ASCII order, and I
	701	* don't have perl (yet), we revert to a LINEAR search when the object
	702	* wasn't found in the binary search.
	703	*/
	704	if (c != 0) {
	705	for (i = 0; i < num; ++i) {
	706	p = &(base[i * size]);
	707	c = (*cmp) (key, p);
	708	if (c == 0 \|\| (c < 0 && (flags & OBJ_BSEARCH_VALUE_ON_NOMATCH)))
	709	return p;
	710	}
	711	}
a53955d8	712	#endif
0f113f3e MC	713	if (c != 0 && !(flags & OBJ_BSEARCH_VALUE_ON_NOMATCH))
	714	p = NULL;
	715	else if (c == 0 && (flags & OBJ_BSEARCH_FIRST_VALUE_ON_MATCH)) {
	716	while (i > 0 && (cmp) (key, &(base[(i - 1) size])) == 0)
	717	i--;
	718	p = &(base[i * size]);
	719	}
	720	return (p);
	721	}
d02b48c6	722
6b691a5c	723	int OBJ_create_objects(BIO *in)
0f113f3e MC	724	{
	725	MS_STATIC char buf[512];
	726	int i, num = 0;
	727	char o, s, *l = NULL;
	728
	729	for (;;) {
	730	s = o = NULL;
	731	i = BIO_gets(in, buf, 512);
	732	if (i <= 0)
	733	return (num);
	734	buf[i - 1] = '\0';
	735	if (!isalnum((unsigned char)buf[0]))
	736	return (num);
	737	o = s = buf;
	738	while (isdigit((unsigned char)s) \|\| (s == '.'))
	739	s++;
	740	if (*s != '\0') {
	741	*(s++) = '\0';
	742	while (isspace((unsigned char)*s))
	743	s++;
	744	if (*s == '\0')
	745	s = NULL;
	746	else {
	747	l = s;
	748	while ((l != '\0') && !isspace((unsigned char)l))
	749	l++;
	750	if (*l != '\0') {
	751	*(l++) = '\0';
	752	while (isspace((unsigned char)*l))
	753	l++;
	754	if (*l == '\0')
	755	l = NULL;
	756	} else
	757	l = NULL;
	758	}
	759	} else
	760	s = NULL;
	761	if ((o == NULL) \|\| (*o == '\0'))
	762	return (num);
	763	if (!OBJ_create(o, s, l))
	764	return (num);
	765	num++;
	766	}
	767	/* return(num); */
	768	}
58964a49	769
8d28d5f8	770	int OBJ_create(const char oid, const char sn, const char *ln)
0f113f3e MC	771	{
	772	int ok = 0;
	773	ASN1_OBJECT *op = NULL;
	774	unsigned char *buf;
	775	int i;
	776
	777	i = a2d_ASN1_OBJECT(NULL, 0, oid, -1);
	778	if (i <= 0)
	779	return (0);
	780
	781	if ((buf = (unsigned char *)OPENSSL_malloc(i)) == NULL) {
	782	OBJerr(OBJ_F_OBJ_CREATE, ERR_R_MALLOC_FAILURE);
	783	return (0);
	784	}
	785	i = a2d_ASN1_OBJECT(buf, i, oid, -1);
	786	if (i == 0)
	787	goto err;
	788	op = (ASN1_OBJECT *)ASN1_OBJECT_create(OBJ_new_nid(1), buf, i, sn, ln);
	789	if (op == NULL)
	790	goto err;
	791	ok = OBJ_add_object(op);
	792	err:
	793	ASN1_OBJECT_free(op);
	794	OPENSSL_free(buf);
	795	return (ok);
	796	}