2011-08-31 11:05:16 +00:00
|
|
|
/* mpicoder.c - Coder for the external representation of MPIs
|
|
|
|
* Copyright (C) 1998, 1999 Free Software Foundation, Inc.
|
|
|
|
*
|
|
|
|
* This file is part of GnuPG.
|
|
|
|
*
|
|
|
|
* GnuPG is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* GnuPG is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
|
|
|
|
*/
|
|
|
|
|
2012-09-24 16:11:27 +00:00
|
|
|
#include <linux/bitops.h>
|
2015-08-28 07:27:15 +00:00
|
|
|
#include <linux/count_zeros.h>
|
2016-03-22 12:12:39 +00:00
|
|
|
#include <linux/byteorder/generic.h>
|
2016-06-29 11:32:22 +00:00
|
|
|
#include <linux/scatterlist.h>
|
2016-03-22 12:12:41 +00:00
|
|
|
#include <linux/string.h>
|
2011-08-31 11:05:16 +00:00
|
|
|
#include "mpi-internal.h"
|
|
|
|
|
2020-09-20 16:20:55 +00:00
|
|
|
#define MAX_EXTERN_SCAN_BYTES (16*1024*1024)
|
2011-08-31 11:05:16 +00:00
|
|
|
#define MAX_EXTERN_MPI_BITS 16384
|
|
|
|
|
2012-09-24 16:11:27 +00:00
|
|
|
/**
|
|
|
|
* mpi_read_raw_data - Read a raw byte stream as a positive integer
|
|
|
|
* @xbuffer: The data to read
|
|
|
|
* @nbytes: The amount of data to read
|
|
|
|
*/
|
|
|
|
MPI mpi_read_raw_data(const void *xbuffer, size_t nbytes)
|
|
|
|
{
|
|
|
|
const uint8_t *buffer = xbuffer;
|
|
|
|
int i, j;
|
|
|
|
unsigned nbits, nlimbs;
|
|
|
|
mpi_limb_t a;
|
|
|
|
MPI val = NULL;
|
|
|
|
|
2013-06-12 21:04:40 +00:00
|
|
|
while (nbytes > 0 && buffer[0] == 0) {
|
2012-09-24 16:11:27 +00:00
|
|
|
buffer++;
|
|
|
|
nbytes--;
|
|
|
|
}
|
|
|
|
|
|
|
|
nbits = nbytes * 8;
|
|
|
|
if (nbits > MAX_EXTERN_MPI_BITS) {
|
|
|
|
pr_info("MPI: mpi too large (%u bits)\n", nbits);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (nbytes > 0)
|
2016-05-26 11:05:32 +00:00
|
|
|
nbits -= count_leading_zeros(buffer[0]) - (BITS_PER_LONG - 8);
|
2012-09-24 16:11:27 +00:00
|
|
|
|
2013-01-30 09:30:06 +00:00
|
|
|
nlimbs = DIV_ROUND_UP(nbytes, BYTES_PER_MPI_LIMB);
|
2012-09-24 16:11:27 +00:00
|
|
|
val = mpi_alloc(nlimbs);
|
|
|
|
if (!val)
|
|
|
|
return NULL;
|
|
|
|
val->nbits = nbits;
|
|
|
|
val->sign = 0;
|
|
|
|
val->nlimbs = nlimbs;
|
|
|
|
|
|
|
|
if (nbytes > 0) {
|
|
|
|
i = BYTES_PER_MPI_LIMB - nbytes % BYTES_PER_MPI_LIMB;
|
|
|
|
i %= BYTES_PER_MPI_LIMB;
|
|
|
|
for (j = nlimbs; j > 0; j--) {
|
|
|
|
a = 0;
|
|
|
|
for (; i < BYTES_PER_MPI_LIMB; i++) {
|
|
|
|
a <<= 8;
|
|
|
|
a |= *buffer++;
|
|
|
|
}
|
|
|
|
i = 0;
|
|
|
|
val->d[j - 1] = a;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_read_raw_data);
|
|
|
|
|
2011-08-31 11:05:16 +00:00
|
|
|
MPI mpi_read_from_buffer(const void *xbuffer, unsigned *ret_nread)
|
|
|
|
{
|
|
|
|
const uint8_t *buffer = xbuffer;
|
2016-05-26 21:19:55 +00:00
|
|
|
unsigned int nbits, nbytes;
|
|
|
|
MPI val;
|
2011-08-31 11:05:16 +00:00
|
|
|
|
|
|
|
if (*ret_nread < 2)
|
lib/mpi: mpi_read_from_buffer(): return error code
mpi_read_from_buffer() reads a MPI from a buffer into a newly allocated
MPI instance. It expects the buffer's leading two bytes to contain the
number of bits, followed by the actual payload.
On failure, it returns NULL and updates the in/out argument ret_nread
somewhat inconsistently:
- If the given buffer is too short to contain the leading two bytes
encoding the number of bits or their value is unsupported, then
ret_nread will be cleared.
- If the allocation of the resulting MPI instance fails, ret_nread is left
as is.
The only user of mpi_read_from_buffer(), digsig_verify_rsa(), simply checks
for a return value of NULL and returns -ENOMEM if that happens.
While this is all of cosmetic nature only, there is another error condition
which currently isn't detectable by the caller of mpi_read_from_buffer():
if the given buffer is too small to hold the number of bits as encoded in
its first two bytes, the return value will be non-NULL and *ret_nread > 0.
In preparation of communicating this condition to the caller, let
mpi_read_from_buffer() return error values by means of the ERR_PTR()
mechanism.
Make the sole caller of mpi_read_from_buffer(), digsig_verify_rsa(),
check the return value for IS_ERR() rather than == NULL. If IS_ERR() is
true, return the associated error value rather than the fixed -ENOMEM.
Signed-off-by: Nicolai Stange <nicstange@gmail.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
2016-05-26 21:19:51 +00:00
|
|
|
return ERR_PTR(-EINVAL);
|
2011-08-31 11:05:16 +00:00
|
|
|
nbits = buffer[0] << 8 | buffer[1];
|
|
|
|
|
|
|
|
if (nbits > MAX_EXTERN_MPI_BITS) {
|
|
|
|
pr_info("MPI: mpi too large (%u bits)\n", nbits);
|
lib/mpi: mpi_read_from_buffer(): return error code
mpi_read_from_buffer() reads a MPI from a buffer into a newly allocated
MPI instance. It expects the buffer's leading two bytes to contain the
number of bits, followed by the actual payload.
On failure, it returns NULL and updates the in/out argument ret_nread
somewhat inconsistently:
- If the given buffer is too short to contain the leading two bytes
encoding the number of bits or their value is unsupported, then
ret_nread will be cleared.
- If the allocation of the resulting MPI instance fails, ret_nread is left
as is.
The only user of mpi_read_from_buffer(), digsig_verify_rsa(), simply checks
for a return value of NULL and returns -ENOMEM if that happens.
While this is all of cosmetic nature only, there is another error condition
which currently isn't detectable by the caller of mpi_read_from_buffer():
if the given buffer is too small to hold the number of bits as encoded in
its first two bytes, the return value will be non-NULL and *ret_nread > 0.
In preparation of communicating this condition to the caller, let
mpi_read_from_buffer() return error values by means of the ERR_PTR()
mechanism.
Make the sole caller of mpi_read_from_buffer(), digsig_verify_rsa(),
check the return value for IS_ERR() rather than == NULL. If IS_ERR() is
true, return the associated error value rather than the fixed -ENOMEM.
Signed-off-by: Nicolai Stange <nicstange@gmail.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
2016-05-26 21:19:51 +00:00
|
|
|
return ERR_PTR(-EINVAL);
|
2011-08-31 11:05:16 +00:00
|
|
|
}
|
|
|
|
|
2013-01-30 09:30:06 +00:00
|
|
|
nbytes = DIV_ROUND_UP(nbits, 8);
|
2016-05-26 21:19:53 +00:00
|
|
|
if (nbytes + 2 > *ret_nread) {
|
2016-05-26 21:19:54 +00:00
|
|
|
pr_info("MPI: mpi larger than buffer nbytes=%u ret_nread=%u\n",
|
|
|
|
nbytes, *ret_nread);
|
2016-05-26 21:19:53 +00:00
|
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
}
|
|
|
|
|
2016-05-26 21:19:55 +00:00
|
|
|
val = mpi_read_raw_data(buffer + 2, nbytes);
|
2011-08-31 11:05:16 +00:00
|
|
|
if (!val)
|
lib/mpi: mpi_read_from_buffer(): return error code
mpi_read_from_buffer() reads a MPI from a buffer into a newly allocated
MPI instance. It expects the buffer's leading two bytes to contain the
number of bits, followed by the actual payload.
On failure, it returns NULL and updates the in/out argument ret_nread
somewhat inconsistently:
- If the given buffer is too short to contain the leading two bytes
encoding the number of bits or their value is unsupported, then
ret_nread will be cleared.
- If the allocation of the resulting MPI instance fails, ret_nread is left
as is.
The only user of mpi_read_from_buffer(), digsig_verify_rsa(), simply checks
for a return value of NULL and returns -ENOMEM if that happens.
While this is all of cosmetic nature only, there is another error condition
which currently isn't detectable by the caller of mpi_read_from_buffer():
if the given buffer is too small to hold the number of bits as encoded in
its first two bytes, the return value will be non-NULL and *ret_nread > 0.
In preparation of communicating this condition to the caller, let
mpi_read_from_buffer() return error values by means of the ERR_PTR()
mechanism.
Make the sole caller of mpi_read_from_buffer(), digsig_verify_rsa(),
check the return value for IS_ERR() rather than == NULL. If IS_ERR() is
true, return the associated error value rather than the fixed -ENOMEM.
Signed-off-by: Nicolai Stange <nicstange@gmail.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
2016-05-26 21:19:51 +00:00
|
|
|
return ERR_PTR(-ENOMEM);
|
2011-08-31 11:05:16 +00:00
|
|
|
|
2016-05-26 21:19:53 +00:00
|
|
|
*ret_nread = nbytes + 2;
|
2011-08-31 11:05:16 +00:00
|
|
|
return val;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_read_from_buffer);
|
|
|
|
|
2020-09-20 16:20:55 +00:00
|
|
|
/****************
|
|
|
|
* Fill the mpi VAL from the hex string in STR.
|
|
|
|
*/
|
|
|
|
int mpi_fromstr(MPI val, const char *str)
|
|
|
|
{
|
|
|
|
int sign = 0;
|
|
|
|
int prepend_zero = 0;
|
|
|
|
int i, j, c, c1, c2;
|
|
|
|
unsigned int nbits, nbytes, nlimbs;
|
|
|
|
mpi_limb_t a;
|
|
|
|
|
|
|
|
if (*str == '-') {
|
|
|
|
sign = 1;
|
|
|
|
str++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Skip optional hex prefix. */
|
|
|
|
if (*str == '0' && str[1] == 'x')
|
|
|
|
str += 2;
|
|
|
|
|
|
|
|
nbits = strlen(str);
|
|
|
|
if (nbits > MAX_EXTERN_SCAN_BYTES) {
|
|
|
|
mpi_clear(val);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
nbits *= 4;
|
|
|
|
if ((nbits % 8))
|
|
|
|
prepend_zero = 1;
|
|
|
|
|
|
|
|
nbytes = (nbits+7) / 8;
|
|
|
|
nlimbs = (nbytes+BYTES_PER_MPI_LIMB-1) / BYTES_PER_MPI_LIMB;
|
|
|
|
|
|
|
|
if (val->alloced < nlimbs)
|
|
|
|
mpi_resize(val, nlimbs);
|
|
|
|
|
|
|
|
i = BYTES_PER_MPI_LIMB - (nbytes % BYTES_PER_MPI_LIMB);
|
|
|
|
i %= BYTES_PER_MPI_LIMB;
|
|
|
|
j = val->nlimbs = nlimbs;
|
|
|
|
val->sign = sign;
|
|
|
|
for (; j > 0; j--) {
|
|
|
|
a = 0;
|
|
|
|
for (; i < BYTES_PER_MPI_LIMB; i++) {
|
|
|
|
if (prepend_zero) {
|
|
|
|
c1 = '0';
|
|
|
|
prepend_zero = 0;
|
|
|
|
} else
|
|
|
|
c1 = *str++;
|
|
|
|
|
|
|
|
if (!c1) {
|
|
|
|
mpi_clear(val);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
c2 = *str++;
|
|
|
|
if (!c2) {
|
|
|
|
mpi_clear(val);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
if (c1 >= '0' && c1 <= '9')
|
|
|
|
c = c1 - '0';
|
|
|
|
else if (c1 >= 'a' && c1 <= 'f')
|
|
|
|
c = c1 - 'a' + 10;
|
|
|
|
else if (c1 >= 'A' && c1 <= 'F')
|
|
|
|
c = c1 - 'A' + 10;
|
|
|
|
else {
|
|
|
|
mpi_clear(val);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
c <<= 4;
|
|
|
|
if (c2 >= '0' && c2 <= '9')
|
|
|
|
c |= c2 - '0';
|
|
|
|
else if (c2 >= 'a' && c2 <= 'f')
|
|
|
|
c |= c2 - 'a' + 10;
|
|
|
|
else if (c2 >= 'A' && c2 <= 'F')
|
|
|
|
c |= c2 - 'A' + 10;
|
|
|
|
else {
|
|
|
|
mpi_clear(val);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
a <<= 8;
|
|
|
|
a |= c;
|
|
|
|
}
|
|
|
|
i = 0;
|
|
|
|
val->d[j-1] = a;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_fromstr);
|
|
|
|
|
|
|
|
MPI mpi_scanval(const char *string)
|
|
|
|
{
|
|
|
|
MPI a;
|
|
|
|
|
|
|
|
a = mpi_alloc(0);
|
|
|
|
if (!a)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (mpi_fromstr(a, string)) {
|
|
|
|
mpi_free(a);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
mpi_normalize(a);
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_scanval);
|
|
|
|
|
2016-02-17 13:46:59 +00:00
|
|
|
static int count_lzeros(MPI a)
|
|
|
|
{
|
|
|
|
mpi_limb_t alimb;
|
|
|
|
int i, lzeros = 0;
|
|
|
|
|
|
|
|
for (i = a->nlimbs - 1; i >= 0; i--) {
|
|
|
|
alimb = a->d[i];
|
|
|
|
if (alimb == 0) {
|
|
|
|
lzeros += sizeof(mpi_limb_t);
|
|
|
|
} else {
|
|
|
|
lzeros += count_leading_zeros(alimb) / 8;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return lzeros;
|
|
|
|
}
|
|
|
|
|
2015-06-15 20:18:36 +00:00
|
|
|
/**
|
2021-07-01 01:55:58 +00:00
|
|
|
* mpi_read_buffer() - read MPI to a buffer provided by user (msb first)
|
2015-06-15 20:18:36 +00:00
|
|
|
*
|
|
|
|
* @a: a multi precision integer
|
2021-07-01 01:55:58 +00:00
|
|
|
* @buf: buffer to which the output will be written to. Needs to be at
|
|
|
|
* least mpi_get_size(a) long.
|
2015-06-15 20:18:36 +00:00
|
|
|
* @buf_len: size of the buf.
|
2015-11-13 11:01:32 +00:00
|
|
|
* @nbytes: receives the actual length of the data written on success and
|
|
|
|
* the data to-be-written on -EOVERFLOW in case buf_len was too
|
|
|
|
* small.
|
2015-06-15 20:18:36 +00:00
|
|
|
* @sign: if not NULL, it will be set to the sign of a.
|
|
|
|
*
|
|
|
|
* Return: 0 on success or error code in case of error
|
2011-08-31 11:05:16 +00:00
|
|
|
*/
|
2015-06-15 20:18:36 +00:00
|
|
|
int mpi_read_buffer(MPI a, uint8_t *buf, unsigned buf_len, unsigned *nbytes,
|
|
|
|
int *sign)
|
2011-08-31 11:05:16 +00:00
|
|
|
{
|
2015-06-15 20:18:36 +00:00
|
|
|
uint8_t *p;
|
2016-03-22 12:12:41 +00:00
|
|
|
#if BYTES_PER_MPI_LIMB == 4
|
|
|
|
__be32 alimb;
|
|
|
|
#elif BYTES_PER_MPI_LIMB == 8
|
|
|
|
__be64 alimb;
|
|
|
|
#else
|
|
|
|
#error please implement for this limb size.
|
|
|
|
#endif
|
2015-06-15 20:18:36 +00:00
|
|
|
unsigned int n = mpi_get_size(a);
|
2016-02-17 13:46:59 +00:00
|
|
|
int i, lzeros;
|
2015-06-15 20:18:36 +00:00
|
|
|
|
2015-11-13 11:01:32 +00:00
|
|
|
if (!buf || !nbytes)
|
2015-06-15 20:18:36 +00:00
|
|
|
return -EINVAL;
|
2011-08-31 11:05:16 +00:00
|
|
|
|
|
|
|
if (sign)
|
|
|
|
*sign = a->sign;
|
2015-06-15 20:18:36 +00:00
|
|
|
|
2016-02-17 13:46:59 +00:00
|
|
|
lzeros = count_lzeros(a);
|
2015-06-15 20:18:36 +00:00
|
|
|
|
2015-11-13 11:01:32 +00:00
|
|
|
if (buf_len < n - lzeros) {
|
|
|
|
*nbytes = n - lzeros;
|
|
|
|
return -EOVERFLOW;
|
|
|
|
}
|
|
|
|
|
2015-06-15 20:18:36 +00:00
|
|
|
p = buf;
|
2015-08-24 14:52:14 +00:00
|
|
|
*nbytes = n - lzeros;
|
2011-08-31 11:05:16 +00:00
|
|
|
|
2016-03-22 12:12:40 +00:00
|
|
|
for (i = a->nlimbs - 1 - lzeros / BYTES_PER_MPI_LIMB,
|
|
|
|
lzeros %= BYTES_PER_MPI_LIMB;
|
|
|
|
i >= 0; i--) {
|
2011-08-31 11:05:16 +00:00
|
|
|
#if BYTES_PER_MPI_LIMB == 4
|
2016-03-22 12:12:41 +00:00
|
|
|
alimb = cpu_to_be32(a->d[i]);
|
2011-08-31 11:05:16 +00:00
|
|
|
#elif BYTES_PER_MPI_LIMB == 8
|
2016-03-22 12:12:41 +00:00
|
|
|
alimb = cpu_to_be64(a->d[i]);
|
2011-08-31 11:05:16 +00:00
|
|
|
#else
|
|
|
|
#error please implement for this limb size.
|
|
|
|
#endif
|
2016-03-22 12:12:42 +00:00
|
|
|
memcpy(p, (u8 *)&alimb + lzeros, BYTES_PER_MPI_LIMB - lzeros);
|
|
|
|
p += BYTES_PER_MPI_LIMB - lzeros;
|
|
|
|
lzeros = 0;
|
2011-08-31 11:05:16 +00:00
|
|
|
}
|
2015-06-15 20:18:36 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_read_buffer);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* mpi_get_buffer() - Returns an allocated buffer with the MPI (msb first).
|
|
|
|
* Caller must free the return string.
|
|
|
|
* This function does return a 0 byte buffer with nbytes set to zero if the
|
|
|
|
* value of A is zero.
|
|
|
|
*
|
|
|
|
* @a: a multi precision integer.
|
|
|
|
* @nbytes: receives the length of this buffer.
|
|
|
|
* @sign: if not NULL, it will be set to the sign of the a.
|
|
|
|
*
|
|
|
|
* Return: Pointer to MPI buffer or NULL on error
|
|
|
|
*/
|
|
|
|
void *mpi_get_buffer(MPI a, unsigned *nbytes, int *sign)
|
|
|
|
{
|
2015-08-24 14:52:14 +00:00
|
|
|
uint8_t *buf;
|
2015-06-15 20:18:36 +00:00
|
|
|
unsigned int n;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (!nbytes)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
n = mpi_get_size(a);
|
|
|
|
|
|
|
|
if (!n)
|
|
|
|
n++;
|
|
|
|
|
|
|
|
buf = kmalloc(n, GFP_KERNEL);
|
|
|
|
|
|
|
|
if (!buf)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
ret = mpi_read_buffer(a, buf, n, nbytes, sign);
|
|
|
|
|
|
|
|
if (ret) {
|
|
|
|
kfree(buf);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return buf;
|
2011-08-31 11:05:16 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_get_buffer);
|
|
|
|
|
2015-10-08 16:26:50 +00:00
|
|
|
/**
|
|
|
|
* mpi_write_to_sgl() - Funnction exports MPI to an sgl (msb first)
|
|
|
|
*
|
|
|
|
* This function works in the same way as the mpi_read_buffer, but it
|
|
|
|
* takes an sgl instead of u8 * buf.
|
|
|
|
*
|
|
|
|
* @a: a multi precision integer
|
|
|
|
* @sgl: scatterlist to write to. Needs to be at least
|
|
|
|
* mpi_get_size(a) long.
|
2016-06-29 11:32:21 +00:00
|
|
|
* @nbytes: the number of bytes to write. Leading bytes will be
|
|
|
|
* filled with zero.
|
2015-10-08 16:26:50 +00:00
|
|
|
* @sign: if not NULL, it will be set to the sign of a.
|
|
|
|
*
|
|
|
|
* Return: 0 on success or error code in case of error
|
|
|
|
*/
|
2016-06-29 11:32:21 +00:00
|
|
|
int mpi_write_to_sgl(MPI a, struct scatterlist *sgl, unsigned nbytes,
|
2015-10-08 16:26:50 +00:00
|
|
|
int *sign)
|
|
|
|
{
|
|
|
|
u8 *p, *p2;
|
2016-03-22 12:12:39 +00:00
|
|
|
#if BYTES_PER_MPI_LIMB == 4
|
|
|
|
__be32 alimb;
|
|
|
|
#elif BYTES_PER_MPI_LIMB == 8
|
|
|
|
__be64 alimb;
|
|
|
|
#else
|
|
|
|
#error please implement for this limb size.
|
|
|
|
#endif
|
2015-10-08 16:26:50 +00:00
|
|
|
unsigned int n = mpi_get_size(a);
|
2016-06-29 11:32:22 +00:00
|
|
|
struct sg_mapping_iter miter;
|
2016-06-29 11:32:21 +00:00
|
|
|
int i, x, buf_len;
|
2016-06-29 11:32:22 +00:00
|
|
|
int nents;
|
2015-10-08 16:26:50 +00:00
|
|
|
|
|
|
|
if (sign)
|
|
|
|
*sign = a->sign;
|
|
|
|
|
2016-06-29 11:32:21 +00:00
|
|
|
if (nbytes < n)
|
2015-11-13 11:01:32 +00:00
|
|
|
return -EOVERFLOW;
|
|
|
|
|
2016-06-29 11:32:22 +00:00
|
|
|
nents = sg_nents_for_len(sgl, nbytes);
|
|
|
|
if (nents < 0)
|
|
|
|
return -EINVAL;
|
2015-10-08 16:26:50 +00:00
|
|
|
|
2016-06-29 11:32:22 +00:00
|
|
|
sg_miter_start(&miter, sgl, nents, SG_MITER_ATOMIC | SG_MITER_TO_SG);
|
|
|
|
sg_miter_next(&miter);
|
|
|
|
buf_len = miter.length;
|
|
|
|
p2 = miter.addr;
|
2016-06-29 11:32:21 +00:00
|
|
|
|
2016-06-29 11:32:22 +00:00
|
|
|
while (nbytes > n) {
|
2016-06-29 11:32:21 +00:00
|
|
|
i = min_t(unsigned, nbytes - n, buf_len);
|
|
|
|
memset(p2, 0, i);
|
|
|
|
p2 += i;
|
|
|
|
nbytes -= i;
|
2016-06-29 11:32:22 +00:00
|
|
|
|
|
|
|
buf_len -= i;
|
|
|
|
if (!buf_len) {
|
|
|
|
sg_miter_next(&miter);
|
|
|
|
buf_len = miter.length;
|
|
|
|
p2 = miter.addr;
|
|
|
|
}
|
2016-06-29 11:32:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
for (i = a->nlimbs - 1; i >= 0; i--) {
|
2015-10-08 16:26:50 +00:00
|
|
|
#if BYTES_PER_MPI_LIMB == 4
|
2016-06-29 11:32:21 +00:00
|
|
|
alimb = a->d[i] ? cpu_to_be32(a->d[i]) : 0;
|
2015-10-08 16:26:50 +00:00
|
|
|
#elif BYTES_PER_MPI_LIMB == 8
|
2016-06-29 11:32:21 +00:00
|
|
|
alimb = a->d[i] ? cpu_to_be64(a->d[i]) : 0;
|
2015-10-08 16:26:50 +00:00
|
|
|
#else
|
|
|
|
#error please implement for this limb size.
|
|
|
|
#endif
|
2016-06-29 11:32:21 +00:00
|
|
|
p = (u8 *)&alimb;
|
2015-10-08 16:26:50 +00:00
|
|
|
|
2016-06-29 11:32:21 +00:00
|
|
|
for (x = 0; x < sizeof(alimb); x++) {
|
2015-10-08 16:26:50 +00:00
|
|
|
*p2++ = *p++;
|
2016-06-29 11:32:22 +00:00
|
|
|
if (!--buf_len) {
|
|
|
|
sg_miter_next(&miter);
|
|
|
|
buf_len = miter.length;
|
|
|
|
p2 = miter.addr;
|
|
|
|
}
|
2015-10-08 16:26:50 +00:00
|
|
|
}
|
|
|
|
}
|
2016-06-29 11:32:22 +00:00
|
|
|
|
|
|
|
sg_miter_stop(&miter);
|
2015-10-08 16:26:50 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_write_to_sgl);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* mpi_read_raw_from_sgl() - Function allocates an MPI and populates it with
|
|
|
|
* data from the sgl
|
|
|
|
*
|
|
|
|
* This function works in the same way as the mpi_read_raw_data, but it
|
|
|
|
* takes an sgl instead of void * buffer. i.e. it allocates
|
|
|
|
* a new MPI and reads the content of the sgl to the MPI.
|
|
|
|
*
|
|
|
|
* @sgl: scatterlist to read from
|
2016-03-22 12:12:43 +00:00
|
|
|
* @nbytes: number of bytes to read
|
2015-10-08 16:26:50 +00:00
|
|
|
*
|
|
|
|
* Return: Pointer to a new MPI or NULL on error
|
|
|
|
*/
|
2016-03-22 12:12:43 +00:00
|
|
|
MPI mpi_read_raw_from_sgl(struct scatterlist *sgl, unsigned int nbytes)
|
2015-10-08 16:26:50 +00:00
|
|
|
{
|
2016-06-29 11:32:22 +00:00
|
|
|
struct sg_mapping_iter miter;
|
2016-03-22 12:12:43 +00:00
|
|
|
unsigned int nbits, nlimbs;
|
2016-06-29 11:32:22 +00:00
|
|
|
int x, j, z, lzeros, ents;
|
|
|
|
unsigned int len;
|
|
|
|
const u8 *buff;
|
2015-10-08 16:26:50 +00:00
|
|
|
mpi_limb_t a;
|
|
|
|
MPI val = NULL;
|
|
|
|
|
2016-06-29 11:32:22 +00:00
|
|
|
ents = sg_nents_for_len(sgl, nbytes);
|
|
|
|
if (ents < 0)
|
|
|
|
return NULL;
|
2015-10-08 16:26:50 +00:00
|
|
|
|
2016-06-29 11:32:22 +00:00
|
|
|
sg_miter_start(&miter, sgl, ents, SG_MITER_ATOMIC | SG_MITER_FROM_SG);
|
2015-10-08 16:26:50 +00:00
|
|
|
|
2016-06-29 11:32:22 +00:00
|
|
|
lzeros = 0;
|
|
|
|
len = 0;
|
|
|
|
while (nbytes > 0) {
|
2015-10-18 10:45:18 +00:00
|
|
|
while (len && !*buff) {
|
2015-10-08 16:26:50 +00:00
|
|
|
lzeros++;
|
2015-10-18 10:45:18 +00:00
|
|
|
len--;
|
|
|
|
buff++;
|
|
|
|
}
|
2015-10-08 16:26:50 +00:00
|
|
|
|
|
|
|
if (len && *buff)
|
|
|
|
break;
|
|
|
|
|
2016-06-29 11:32:22 +00:00
|
|
|
sg_miter_next(&miter);
|
|
|
|
buff = miter.addr;
|
|
|
|
len = miter.length;
|
|
|
|
|
lib/mpi: mpi_read_raw_from_sgl(): don't include leading zero SGEs in nbytes
At the very beginning of mpi_read_raw_from_sgl(), the leading zeros of
the input scatterlist are counted:
lzeros = 0;
for_each_sg(sgl, sg, ents, i) {
...
if (/* sg contains nonzero bytes */)
break;
/* sg contains nothing but zeros here */
ents--;
lzeros = 0;
}
Later on, the total number of trailing nonzero bytes is calculated by
subtracting the number of leading zero bytes from the total number of input
bytes:
nbytes -= lzeros;
However, since lzeros gets reset to zero for each completely zero leading
sg in the loop above, it doesn't include those.
Besides wasting resources by allocating a too large output buffer,
this mistake propagates into the calculation of x, the number of
leading zeros within the most significant output limb:
x = BYTES_PER_MPI_LIMB - nbytes % BYTES_PER_MPI_LIMB;
What's more, the low order bytes of the output, equal in number to the
extra bytes in nbytes, are left uninitialized.
Fix this by adjusting nbytes for each completely zero leading scatterlist
entry.
Fixes: 2d4d1eea540b ("lib/mpi: Add mpi sgl helpers")
Signed-off-by: Nicolai Stange <nicstange@gmail.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
2016-03-22 12:12:44 +00:00
|
|
|
nbytes -= lzeros;
|
2015-10-08 16:26:50 +00:00
|
|
|
lzeros = 0;
|
|
|
|
}
|
|
|
|
|
2016-07-28 05:29:17 +00:00
|
|
|
miter.consumed = lzeros;
|
|
|
|
|
lib/mpi: mpi_read_raw_from_sgl(): don't include leading zero SGEs in nbytes
At the very beginning of mpi_read_raw_from_sgl(), the leading zeros of
the input scatterlist are counted:
lzeros = 0;
for_each_sg(sgl, sg, ents, i) {
...
if (/* sg contains nonzero bytes */)
break;
/* sg contains nothing but zeros here */
ents--;
lzeros = 0;
}
Later on, the total number of trailing nonzero bytes is calculated by
subtracting the number of leading zero bytes from the total number of input
bytes:
nbytes -= lzeros;
However, since lzeros gets reset to zero for each completely zero leading
sg in the loop above, it doesn't include those.
Besides wasting resources by allocating a too large output buffer,
this mistake propagates into the calculation of x, the number of
leading zeros within the most significant output limb:
x = BYTES_PER_MPI_LIMB - nbytes % BYTES_PER_MPI_LIMB;
What's more, the low order bytes of the output, equal in number to the
extra bytes in nbytes, are left uninitialized.
Fix this by adjusting nbytes for each completely zero leading scatterlist
entry.
Fixes: 2d4d1eea540b ("lib/mpi: Add mpi sgl helpers")
Signed-off-by: Nicolai Stange <nicstange@gmail.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
2016-03-22 12:12:44 +00:00
|
|
|
nbytes -= lzeros;
|
2015-10-08 16:26:50 +00:00
|
|
|
nbits = nbytes * 8;
|
|
|
|
if (nbits > MAX_EXTERN_MPI_BITS) {
|
2017-08-10 06:06:18 +00:00
|
|
|
sg_miter_stop(&miter);
|
2015-10-08 16:26:50 +00:00
|
|
|
pr_info("MPI: mpi too large (%u bits)\n", nbits);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nbytes > 0)
|
2016-06-29 11:32:22 +00:00
|
|
|
nbits -= count_leading_zeros(*buff) - (BITS_PER_LONG - 8);
|
2015-10-08 16:26:50 +00:00
|
|
|
|
2017-08-10 06:06:18 +00:00
|
|
|
sg_miter_stop(&miter);
|
|
|
|
|
2015-10-08 16:26:50 +00:00
|
|
|
nlimbs = DIV_ROUND_UP(nbytes, BYTES_PER_MPI_LIMB);
|
|
|
|
val = mpi_alloc(nlimbs);
|
|
|
|
if (!val)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
val->nbits = nbits;
|
|
|
|
val->sign = 0;
|
|
|
|
val->nlimbs = nlimbs;
|
|
|
|
|
|
|
|
if (nbytes == 0)
|
|
|
|
return val;
|
|
|
|
|
|
|
|
j = nlimbs - 1;
|
|
|
|
a = 0;
|
lib/mpi: mpi_read_raw_from_sgl(): sanitize meaning of indices
Within the byte reading loop in mpi_read_raw_sgl(), there are two
housekeeping indices used, z and x.
At all times, the index z represents the number of output bytes covered
by the input SGEs for which processing has completed so far. This includes
any leading zero bytes within the most significant limb.
The index x changes its meaning after the first outer loop's iteration
though: while processing the first input SGE, it represents
"number of leading zero bytes in most significant output limb" +
"current position within current SGE"
For the remaining SGEs OTOH, x corresponds just to
"current position within current SGE"
After all, it is only the sum of z and x that has any meaning for the
output buffer and thus, the
"number of leading zero bytes in most significant output limb"
part can be moved away from x into z from the beginning, opening up the
opportunity for cleaner code.
Before the outer loop iterating over the SGEs, don't initialize z with
zero, but with the number of leading zero bytes in the most significant
output limb. For the inner loop iterating over a single SGE's bytes,
get rid of the buf_shift offset to x' bounds and let x run from zero to
sg->length - 1.
Signed-off-by: Nicolai Stange <nicstange@gmail.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
2016-03-22 12:18:07 +00:00
|
|
|
z = BYTES_PER_MPI_LIMB - nbytes % BYTES_PER_MPI_LIMB;
|
|
|
|
z %= BYTES_PER_MPI_LIMB;
|
2015-10-08 16:26:50 +00:00
|
|
|
|
2016-07-28 05:29:17 +00:00
|
|
|
while (sg_miter_next(&miter)) {
|
|
|
|
buff = miter.addr;
|
|
|
|
len = miter.length;
|
|
|
|
|
lib/mpi: mpi_read_raw_from_sgl(): sanitize meaning of indices
Within the byte reading loop in mpi_read_raw_sgl(), there are two
housekeeping indices used, z and x.
At all times, the index z represents the number of output bytes covered
by the input SGEs for which processing has completed so far. This includes
any leading zero bytes within the most significant limb.
The index x changes its meaning after the first outer loop's iteration
though: while processing the first input SGE, it represents
"number of leading zero bytes in most significant output limb" +
"current position within current SGE"
For the remaining SGEs OTOH, x corresponds just to
"current position within current SGE"
After all, it is only the sum of z and x that has any meaning for the
output buffer and thus, the
"number of leading zero bytes in most significant output limb"
part can be moved away from x into z from the beginning, opening up the
opportunity for cleaner code.
Before the outer loop iterating over the SGEs, don't initialize z with
zero, but with the number of leading zero bytes in the most significant
output limb. For the inner loop iterating over a single SGE's bytes,
get rid of the buf_shift offset to x' bounds and let x run from zero to
sg->length - 1.
Signed-off-by: Nicolai Stange <nicstange@gmail.com>
Signed-off-by: Herbert Xu <herbert@gondor.apana.org.au>
2016-03-22 12:18:07 +00:00
|
|
|
for (x = 0; x < len; x++) {
|
2015-10-08 16:26:50 +00:00
|
|
|
a <<= 8;
|
2016-06-29 11:32:22 +00:00
|
|
|
a |= *buff++;
|
2015-10-08 16:26:50 +00:00
|
|
|
if (((z + x + 1) % BYTES_PER_MPI_LIMB) == 0) {
|
|
|
|
val->d[j--] = a;
|
|
|
|
a = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
z += x;
|
|
|
|
}
|
2016-06-29 11:32:22 +00:00
|
|
|
|
2015-10-08 16:26:50 +00:00
|
|
|
return val;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_read_raw_from_sgl);
|
2020-09-20 16:20:55 +00:00
|
|
|
|
|
|
|
/* Perform a two's complement operation on buffer P of size N bytes. */
|
|
|
|
static void twocompl(unsigned char *p, unsigned int n)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = n-1; i >= 0 && !p[i]; i--)
|
|
|
|
;
|
|
|
|
if (i >= 0) {
|
|
|
|
if ((p[i] & 0x01))
|
|
|
|
p[i] = (((p[i] ^ 0xfe) | 0x01) & 0xff);
|
|
|
|
else if ((p[i] & 0x02))
|
|
|
|
p[i] = (((p[i] ^ 0xfc) | 0x02) & 0xfe);
|
|
|
|
else if ((p[i] & 0x04))
|
|
|
|
p[i] = (((p[i] ^ 0xf8) | 0x04) & 0xfc);
|
|
|
|
else if ((p[i] & 0x08))
|
|
|
|
p[i] = (((p[i] ^ 0xf0) | 0x08) & 0xf8);
|
|
|
|
else if ((p[i] & 0x10))
|
|
|
|
p[i] = (((p[i] ^ 0xe0) | 0x10) & 0xf0);
|
|
|
|
else if ((p[i] & 0x20))
|
|
|
|
p[i] = (((p[i] ^ 0xc0) | 0x20) & 0xe0);
|
|
|
|
else if ((p[i] & 0x40))
|
|
|
|
p[i] = (((p[i] ^ 0x80) | 0x40) & 0xc0);
|
|
|
|
else
|
|
|
|
p[i] = 0x80;
|
|
|
|
|
|
|
|
for (i--; i >= 0; i--)
|
|
|
|
p[i] ^= 0xff;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int mpi_print(enum gcry_mpi_format format, unsigned char *buffer,
|
|
|
|
size_t buflen, size_t *nwritten, MPI a)
|
|
|
|
{
|
|
|
|
unsigned int nbits = mpi_get_nbits(a);
|
|
|
|
size_t len;
|
|
|
|
size_t dummy_nwritten;
|
|
|
|
int negative;
|
|
|
|
|
|
|
|
if (!nwritten)
|
|
|
|
nwritten = &dummy_nwritten;
|
|
|
|
|
|
|
|
/* Libgcrypt does no always care to set clear the sign if the value
|
|
|
|
* is 0. For printing this is a bit of a surprise, in particular
|
|
|
|
* because if some of the formats don't support negative numbers but
|
|
|
|
* should be able to print a zero. Thus we need this extra test
|
|
|
|
* for a negative number.
|
|
|
|
*/
|
|
|
|
if (a->sign && mpi_cmp_ui(a, 0))
|
|
|
|
negative = 1;
|
|
|
|
else
|
|
|
|
negative = 0;
|
|
|
|
|
|
|
|
len = buflen;
|
|
|
|
*nwritten = 0;
|
|
|
|
if (format == GCRYMPI_FMT_STD) {
|
|
|
|
unsigned char *tmp;
|
|
|
|
int extra = 0;
|
|
|
|
unsigned int n;
|
|
|
|
|
|
|
|
tmp = mpi_get_buffer(a, &n, NULL);
|
|
|
|
if (!tmp)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (negative) {
|
|
|
|
twocompl(tmp, n);
|
|
|
|
if (!(*tmp & 0x80)) {
|
|
|
|
/* Need to extend the sign. */
|
|
|
|
n++;
|
|
|
|
extra = 2;
|
|
|
|
}
|
|
|
|
} else if (n && (*tmp & 0x80)) {
|
|
|
|
/* Positive but the high bit of the returned buffer is set.
|
|
|
|
* Thus we need to print an extra leading 0x00 so that the
|
|
|
|
* output is interpreted as a positive number.
|
|
|
|
*/
|
|
|
|
n++;
|
|
|
|
extra = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (buffer && n > len) {
|
|
|
|
/* The provided buffer is too short. */
|
|
|
|
kfree(tmp);
|
|
|
|
return -E2BIG;
|
|
|
|
}
|
|
|
|
if (buffer) {
|
|
|
|
unsigned char *s = buffer;
|
|
|
|
|
|
|
|
if (extra == 1)
|
|
|
|
*s++ = 0;
|
|
|
|
else if (extra)
|
|
|
|
*s++ = 0xff;
|
|
|
|
memcpy(s, tmp, n-!!extra);
|
|
|
|
}
|
|
|
|
kfree(tmp);
|
|
|
|
*nwritten = n;
|
|
|
|
return 0;
|
|
|
|
} else if (format == GCRYMPI_FMT_USG) {
|
|
|
|
unsigned int n = (nbits + 7)/8;
|
|
|
|
|
|
|
|
/* Note: We ignore the sign for this format. */
|
|
|
|
/* FIXME: for performance reasons we should put this into
|
|
|
|
* mpi_aprint because we can then use the buffer directly.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (buffer && n > len)
|
|
|
|
return -E2BIG;
|
|
|
|
if (buffer) {
|
|
|
|
unsigned char *tmp;
|
|
|
|
|
|
|
|
tmp = mpi_get_buffer(a, &n, NULL);
|
|
|
|
if (!tmp)
|
|
|
|
return -EINVAL;
|
|
|
|
memcpy(buffer, tmp, n);
|
|
|
|
kfree(tmp);
|
|
|
|
}
|
|
|
|
*nwritten = n;
|
|
|
|
return 0;
|
|
|
|
} else if (format == GCRYMPI_FMT_PGP) {
|
|
|
|
unsigned int n = (nbits + 7)/8;
|
|
|
|
|
|
|
|
/* The PGP format can only handle unsigned integers. */
|
|
|
|
if (negative)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (buffer && n+2 > len)
|
|
|
|
return -E2BIG;
|
|
|
|
|
|
|
|
if (buffer) {
|
|
|
|
unsigned char *tmp;
|
|
|
|
unsigned char *s = buffer;
|
|
|
|
|
|
|
|
s[0] = nbits >> 8;
|
|
|
|
s[1] = nbits;
|
|
|
|
|
|
|
|
tmp = mpi_get_buffer(a, &n, NULL);
|
|
|
|
if (!tmp)
|
|
|
|
return -EINVAL;
|
|
|
|
memcpy(s+2, tmp, n);
|
|
|
|
kfree(tmp);
|
|
|
|
}
|
|
|
|
*nwritten = n+2;
|
|
|
|
return 0;
|
|
|
|
} else if (format == GCRYMPI_FMT_SSH) {
|
|
|
|
unsigned char *tmp;
|
|
|
|
int extra = 0;
|
|
|
|
unsigned int n;
|
|
|
|
|
|
|
|
tmp = mpi_get_buffer(a, &n, NULL);
|
|
|
|
if (!tmp)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (negative) {
|
|
|
|
twocompl(tmp, n);
|
|
|
|
if (!(*tmp & 0x80)) {
|
|
|
|
/* Need to extend the sign. */
|
|
|
|
n++;
|
|
|
|
extra = 2;
|
|
|
|
}
|
|
|
|
} else if (n && (*tmp & 0x80)) {
|
|
|
|
n++;
|
|
|
|
extra = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (buffer && n+4 > len) {
|
|
|
|
kfree(tmp);
|
|
|
|
return -E2BIG;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (buffer) {
|
|
|
|
unsigned char *s = buffer;
|
|
|
|
|
|
|
|
*s++ = n >> 24;
|
|
|
|
*s++ = n >> 16;
|
|
|
|
*s++ = n >> 8;
|
|
|
|
*s++ = n;
|
|
|
|
if (extra == 1)
|
|
|
|
*s++ = 0;
|
|
|
|
else if (extra)
|
|
|
|
*s++ = 0xff;
|
|
|
|
memcpy(s, tmp, n-!!extra);
|
|
|
|
}
|
|
|
|
kfree(tmp);
|
|
|
|
*nwritten = 4+n;
|
|
|
|
return 0;
|
|
|
|
} else if (format == GCRYMPI_FMT_HEX) {
|
|
|
|
unsigned char *tmp;
|
|
|
|
int i;
|
|
|
|
int extra = 0;
|
|
|
|
unsigned int n = 0;
|
|
|
|
|
|
|
|
tmp = mpi_get_buffer(a, &n, NULL);
|
|
|
|
if (!tmp)
|
|
|
|
return -EINVAL;
|
|
|
|
if (!n || (*tmp & 0x80))
|
|
|
|
extra = 2;
|
|
|
|
|
|
|
|
if (buffer && 2*n + extra + negative + 1 > len) {
|
|
|
|
kfree(tmp);
|
|
|
|
return -E2BIG;
|
|
|
|
}
|
|
|
|
if (buffer) {
|
|
|
|
unsigned char *s = buffer;
|
|
|
|
|
|
|
|
if (negative)
|
|
|
|
*s++ = '-';
|
|
|
|
if (extra) {
|
|
|
|
*s++ = '0';
|
|
|
|
*s++ = '0';
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < n; i++) {
|
|
|
|
unsigned int c = tmp[i];
|
|
|
|
|
|
|
|
*s++ = (c >> 4) < 10 ? '0'+(c>>4) : 'A'+(c>>4)-10;
|
|
|
|
c &= 15;
|
|
|
|
*s++ = c < 10 ? '0'+c : 'A'+c-10;
|
|
|
|
}
|
|
|
|
*s++ = 0;
|
|
|
|
*nwritten = s - buffer;
|
|
|
|
} else {
|
|
|
|
*nwritten = 2*n + extra + negative + 1;
|
|
|
|
}
|
|
|
|
kfree(tmp);
|
|
|
|
return 0;
|
|
|
|
} else
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_print);
|