2015-01-22 11:40:55 +08:00
|
|
|
/*
|
2017-07-06 09:39:03 +08:00
|
|
|
* Copyright 2000-2017 The OpenSSL Project Authors. All Rights Reserved.
|
1999-12-22 09:39:23 +08:00
|
|
|
*
|
2018-12-06 20:17:34 +08:00
|
|
|
* Licensed under the Apache License 2.0 (the "License"). You may not use
|
2016-05-18 02:51:34 +08:00
|
|
|
* this file except in compliance with the License. You can obtain a copy
|
|
|
|
* in the file LICENSE in the source distribution or at
|
|
|
|
* https://www.openssl.org/source/license.html
|
1999-12-22 09:39:23 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
2015-05-14 22:56:48 +08:00
|
|
|
#include "internal/cryptlib.h"
|
2000-12-09 03:09:35 +08:00
|
|
|
#include <openssl/asn1t.h>
|
1999-12-22 09:39:23 +08:00
|
|
|
|
2019-11-06 00:28:50 +08:00
|
|
|
#ifdef OPENSSL_NO_DEPRECATED_3_0
|
2017-04-05 18:09:21 +08:00
|
|
|
NON_EMPTY_TRANSLATION_UNIT
|
|
|
|
#else
|
2017-07-06 09:39:03 +08:00
|
|
|
|
|
|
|
#define COPY_SIZE(a, b) (sizeof(a) < sizeof(b) ? sizeof(a) : sizeof(b))
|
|
|
|
|
2015-01-22 11:40:55 +08:00
|
|
|
/*
|
|
|
|
* Custom primitive type for long handling. This converts between an
|
|
|
|
* ASN1_INTEGER and a long directly.
|
1999-12-22 09:39:23 +08:00
|
|
|
*/
|
|
|
|
|
2000-12-09 03:09:35 +08:00
|
|
|
static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
|
|
|
|
static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
|
1999-12-22 09:39:23 +08:00
|
|
|
|
2019-01-16 04:51:25 +08:00
|
|
|
static int long_i2c(const ASN1_VALUE **pval, unsigned char *cont, int *putype,
|
2015-01-22 11:40:55 +08:00
|
|
|
const ASN1_ITEM *it);
|
|
|
|
static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
|
|
|
|
int utype, char *free_cont, const ASN1_ITEM *it);
|
2019-01-16 04:51:25 +08:00
|
|
|
static int long_print(BIO *out, const ASN1_VALUE **pval, const ASN1_ITEM *it,
|
2015-01-22 11:40:55 +08:00
|
|
|
int indent, const ASN1_PCTX *pctx);
|
1999-12-22 09:39:23 +08:00
|
|
|
|
2000-12-09 03:09:35 +08:00
|
|
|
static ASN1_PRIMITIVE_FUNCS long_pf = {
|
2015-01-22 11:40:55 +08:00
|
|
|
NULL, 0,
|
|
|
|
long_new,
|
|
|
|
long_free,
|
|
|
|
long_free, /* Clear should set to initial value */
|
|
|
|
long_c2i,
|
|
|
|
long_i2c,
|
|
|
|
long_print
|
2000-12-09 03:09:35 +08:00
|
|
|
};
|
1999-12-22 09:39:23 +08:00
|
|
|
|
2001-02-23 11:16:09 +08:00
|
|
|
ASN1_ITEM_start(LONG)
|
2015-01-22 11:40:55 +08:00
|
|
|
ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &long_pf, ASN1_LONG_UNDEF, "LONG"
|
2001-02-23 20:47:06 +08:00
|
|
|
ASN1_ITEM_end(LONG)
|
2001-02-23 11:16:09 +08:00
|
|
|
|
|
|
|
ASN1_ITEM_start(ZLONG)
|
2015-01-22 11:40:55 +08:00
|
|
|
ASN1_ITYPE_PRIMITIVE, V_ASN1_INTEGER, NULL, 0, &long_pf, 0, "ZLONG"
|
2001-02-23 20:47:06 +08:00
|
|
|
ASN1_ITEM_end(ZLONG)
|
1999-12-22 09:39:23 +08:00
|
|
|
|
2000-12-09 03:09:35 +08:00
|
|
|
static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it)
|
1999-12-22 09:39:23 +08:00
|
|
|
{
|
2017-07-06 09:39:03 +08:00
|
|
|
memcpy(pval, &it->size, COPY_SIZE(*pval, it->size));
|
2015-03-02 21:26:29 +08:00
|
|
|
return 1;
|
1999-12-22 09:39:23 +08:00
|
|
|
}
|
|
|
|
|
2000-12-09 03:09:35 +08:00
|
|
|
static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
|
1999-12-22 09:39:23 +08:00
|
|
|
{
|
2017-07-06 09:39:03 +08:00
|
|
|
memcpy(pval, &it->size, COPY_SIZE(*pval, it->size));
|
2000-12-09 03:09:35 +08:00
|
|
|
}
|
|
|
|
|
2017-04-09 00:01:36 +08:00
|
|
|
/*
|
|
|
|
* Originally BN_num_bits_word was called to perform this operation, but
|
|
|
|
* trouble is that there is no guarantee that sizeof(long) equals to
|
|
|
|
* sizeof(BN_ULONG). BN_ULONG is a configurable type that can be as wide
|
|
|
|
* as long, but also double or half...
|
|
|
|
*/
|
|
|
|
static int num_bits_ulong(unsigned long value)
|
|
|
|
{
|
|
|
|
size_t i;
|
|
|
|
unsigned long ret = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* It is argued that *on average* constant counter loop performs
|
|
|
|
* not worse [if not better] than one with conditional break or
|
|
|
|
* mask-n-table-lookup-style, because of branch misprediction
|
|
|
|
* penalties.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < sizeof(value) * 8; i++) {
|
|
|
|
ret += (value != 0);
|
|
|
|
value >>= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (int)ret;
|
|
|
|
}
|
|
|
|
|
2019-01-16 04:51:25 +08:00
|
|
|
static int long_i2c(const ASN1_VALUE **pval, unsigned char *cont, int *putype,
|
2015-03-02 21:26:29 +08:00
|
|
|
const ASN1_ITEM *it)
|
2000-12-09 03:09:35 +08:00
|
|
|
{
|
2015-03-02 21:26:29 +08:00
|
|
|
long ltmp;
|
2017-04-09 00:01:36 +08:00
|
|
|
unsigned long utmp, sign;
|
2015-03-02 21:26:29 +08:00
|
|
|
int clen, pad, i;
|
|
|
|
|
2017-07-06 09:39:03 +08:00
|
|
|
memcpy(<mp, pval, COPY_SIZE(*pval, ltmp));
|
2015-03-02 21:26:29 +08:00
|
|
|
if (ltmp == it->size)
|
|
|
|
return -1;
|
|
|
|
/*
|
|
|
|
* Convert the long to positive: we subtract one if negative so we can
|
|
|
|
* cleanly handle the padding if only the MSB of the leading octet is
|
|
|
|
* set.
|
|
|
|
*/
|
2017-04-09 00:01:36 +08:00
|
|
|
if (ltmp < 0) {
|
|
|
|
sign = 0xff;
|
2017-01-15 19:33:45 +08:00
|
|
|
utmp = 0 - (unsigned long)ltmp - 1;
|
2017-04-09 00:01:36 +08:00
|
|
|
} else {
|
|
|
|
sign = 0;
|
2015-03-02 21:26:29 +08:00
|
|
|
utmp = ltmp;
|
2017-04-09 00:01:36 +08:00
|
|
|
}
|
|
|
|
clen = num_bits_ulong(utmp);
|
2015-03-02 21:26:29 +08:00
|
|
|
/* If MSB of leading octet set we need to pad */
|
|
|
|
if (!(clen & 0x7))
|
|
|
|
pad = 1;
|
|
|
|
else
|
|
|
|
pad = 0;
|
|
|
|
|
|
|
|
/* Convert number of bits to number of octets */
|
|
|
|
clen = (clen + 7) >> 3;
|
|
|
|
|
2017-04-09 00:01:36 +08:00
|
|
|
if (cont != NULL) {
|
2015-03-02 21:26:29 +08:00
|
|
|
if (pad)
|
2017-04-09 00:01:36 +08:00
|
|
|
*cont++ = (unsigned char)sign;
|
2015-03-02 21:26:29 +08:00
|
|
|
for (i = clen - 1; i >= 0; i--) {
|
2017-04-09 00:01:36 +08:00
|
|
|
cont[i] = (unsigned char)(utmp ^ sign);
|
2015-03-02 21:26:29 +08:00
|
|
|
utmp >>= 8;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
2015-03-02 21:26:29 +08:00
|
|
|
}
|
|
|
|
return clen + pad;
|
2000-12-09 03:09:35 +08:00
|
|
|
}
|
|
|
|
|
2004-03-16 07:15:26 +08:00
|
|
|
static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
|
2015-01-22 11:40:55 +08:00
|
|
|
int utype, char *free_cont, const ASN1_ITEM *it)
|
2000-12-09 03:09:35 +08:00
|
|
|
{
|
2017-04-09 00:01:36 +08:00
|
|
|
int i;
|
2015-03-02 21:26:29 +08:00
|
|
|
long ltmp;
|
2017-04-09 00:01:36 +08:00
|
|
|
unsigned long utmp = 0, sign = 0x100;
|
2017-03-21 04:31:02 +08:00
|
|
|
|
2017-04-01 03:31:43 +08:00
|
|
|
if (len > 1) {
|
2017-03-21 04:31:02 +08:00
|
|
|
/*
|
|
|
|
* Check possible pad byte. Worst case, we're skipping past actual
|
|
|
|
* content, but since that's only with 0x00 and 0xff and we set neg
|
|
|
|
* accordingly, the result will be correct in the end anyway.
|
|
|
|
*/
|
|
|
|
switch (cont[0]) {
|
|
|
|
case 0xff:
|
|
|
|
cont++;
|
|
|
|
len--;
|
2017-04-09 00:01:36 +08:00
|
|
|
sign = 0xff;
|
2017-03-21 04:31:02 +08:00
|
|
|
break;
|
|
|
|
case 0:
|
|
|
|
cont++;
|
|
|
|
len--;
|
2017-04-09 00:01:36 +08:00
|
|
|
sign = 0;
|
2017-03-21 04:31:02 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2015-03-02 21:26:29 +08:00
|
|
|
if (len > (int)sizeof(long)) {
|
|
|
|
ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG);
|
|
|
|
return 0;
|
|
|
|
}
|
2017-04-09 00:01:36 +08:00
|
|
|
|
|
|
|
if (sign == 0x100) {
|
2017-03-21 04:31:02 +08:00
|
|
|
/* Is it negative? */
|
|
|
|
if (len && (cont[0] & 0x80))
|
2017-04-09 00:01:36 +08:00
|
|
|
sign = 0xff;
|
2017-03-21 04:31:02 +08:00
|
|
|
else
|
2017-04-09 00:01:36 +08:00
|
|
|
sign = 0;
|
|
|
|
} else if (((sign ^ cont[0]) & 0x80) == 0) { /* same sign bit? */
|
2017-04-01 03:31:43 +08:00
|
|
|
ASN1err(ASN1_F_LONG_C2I, ASN1_R_ILLEGAL_PADDING);
|
|
|
|
return 0;
|
2017-03-21 04:31:02 +08:00
|
|
|
}
|
2015-03-02 21:26:29 +08:00
|
|
|
utmp = 0;
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
utmp <<= 8;
|
2017-04-09 00:01:36 +08:00
|
|
|
utmp |= cont[i] ^ sign;
|
2015-03-02 21:26:29 +08:00
|
|
|
}
|
|
|
|
ltmp = (long)utmp;
|
2017-03-27 23:11:11 +08:00
|
|
|
if (ltmp < 0) {
|
|
|
|
ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG);
|
|
|
|
return 0;
|
|
|
|
}
|
2017-04-09 00:01:36 +08:00
|
|
|
if (sign)
|
|
|
|
ltmp = -ltmp - 1;
|
2015-03-02 21:26:29 +08:00
|
|
|
if (ltmp == it->size) {
|
|
|
|
ASN1err(ASN1_F_LONG_C2I, ASN1_R_INTEGER_TOO_LARGE_FOR_LONG);
|
|
|
|
return 0;
|
|
|
|
}
|
2017-07-06 09:39:03 +08:00
|
|
|
memcpy(pval, <mp, COPY_SIZE(*pval, ltmp));
|
2015-03-02 21:26:29 +08:00
|
|
|
return 1;
|
1999-12-22 09:39:23 +08:00
|
|
|
}
|
2008-02-08 21:07:04 +08:00
|
|
|
|
2019-01-16 04:51:25 +08:00
|
|
|
static int long_print(BIO *out, const ASN1_VALUE **pval, const ASN1_ITEM *it,
|
2015-03-02 21:26:29 +08:00
|
|
|
int indent, const ASN1_PCTX *pctx)
|
|
|
|
{
|
2017-07-06 09:39:03 +08:00
|
|
|
long l;
|
|
|
|
|
|
|
|
memcpy(&l, pval, COPY_SIZE(*pval, l));
|
|
|
|
return BIO_printf(out, "%ld\n", l);
|
2015-03-02 21:26:29 +08:00
|
|
|
}
|
2017-04-05 18:09:21 +08:00
|
|
|
#endif
|