89 lines
2.2 KiB
C
89 lines
2.2 KiB
C
/* LibTomCrypt, modular cryptographic library -- Tom St Denis */
|
|
/* SPDX-License-Identifier: Unlicense */
|
|
|
|
#include "tomcrypt_private.h"
|
|
|
|
#pragma clang diagnostic push
|
|
#pragma clang diagnostic ignored "-Wconversion"
|
|
#pragma clang diagnostic ignored "-Wshorten-64-to-32"
|
|
|
|
int pk_oid_str_to_num(const char *OID, unsigned long *oid, unsigned long *oidlen)
|
|
{
|
|
unsigned long i, j, limit, oid_j;
|
|
size_t OID_len;
|
|
|
|
LTC_ARGCHK(oidlen != NULL);
|
|
|
|
limit = *oidlen;
|
|
*oidlen = 0; /* make sure that we return zero oidlen on error */
|
|
for (i = 0; i < limit; i++) oid[i] = 0;
|
|
|
|
if (OID == NULL) return CRYPT_OK;
|
|
|
|
OID_len = XSTRLEN(OID);
|
|
if (OID_len == 0) return CRYPT_OK;
|
|
|
|
for (i = 0, j = 0; i < OID_len; i++) {
|
|
if (OID[i] == '.') {
|
|
if (++j >= limit) continue;
|
|
}
|
|
else if ((OID[i] >= '0') && (OID[i] <= '9')) {
|
|
if ((j >= limit) || (oid == NULL)) continue;
|
|
oid_j = oid[j];
|
|
oid[j] = oid[j] * 10 + (OID[i] - '0');
|
|
if (oid[j] < oid_j) return CRYPT_OVERFLOW;
|
|
}
|
|
else {
|
|
return CRYPT_ERROR;
|
|
}
|
|
}
|
|
if (j == 0) return CRYPT_ERROR;
|
|
if (j >= limit) {
|
|
*oidlen = j;
|
|
return CRYPT_BUFFER_OVERFLOW;
|
|
}
|
|
*oidlen = j + 1;
|
|
return CRYPT_OK;
|
|
}
|
|
|
|
int pk_oid_num_to_str(const unsigned long *oid, unsigned long oidlen, char *OID, unsigned long *outlen)
|
|
{
|
|
int i;
|
|
unsigned long j, k;
|
|
char tmp[LTC_OID_MAX_STRLEN] = { 0 };
|
|
|
|
LTC_ARGCHK(oid != NULL);
|
|
LTC_ARGCHK(oidlen < INT_MAX);
|
|
LTC_ARGCHK(outlen != NULL);
|
|
|
|
for (i = oidlen - 1, k = 0; i >= 0; i--) {
|
|
j = oid[i];
|
|
if (j == 0) {
|
|
tmp[k] = '0';
|
|
if (++k >= sizeof(tmp)) return CRYPT_ERROR;
|
|
}
|
|
else {
|
|
while (j > 0) {
|
|
tmp[k] = '0' + (j % 10);
|
|
if (++k >= sizeof(tmp)) return CRYPT_ERROR;
|
|
j /= 10;
|
|
}
|
|
}
|
|
if (i > 0) {
|
|
tmp[k] = '.';
|
|
if (++k >= sizeof(tmp)) return CRYPT_ERROR;
|
|
}
|
|
}
|
|
if (*outlen < k + 1) {
|
|
*outlen = k + 1;
|
|
return CRYPT_BUFFER_OVERFLOW;
|
|
}
|
|
LTC_ARGCHK(OID != NULL);
|
|
for (j = 0; j < k; j++) OID[j] = tmp[k - j - 1];
|
|
OID[k] = '\0';
|
|
*outlen = k; /* the length without terminating NUL byte */
|
|
return CRYPT_OK;
|
|
}
|
|
|
|
#pragma clang diagnostic pop
|