2011-08-31 15:05:16 +04:00
|
|
|
/* mpiutil.ac - Utility functions for MPI
|
|
|
|
* 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
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "mpi-internal.h"
|
|
|
|
|
2020-09-20 19:20:55 +03:00
|
|
|
/* Constants allocated right away at startup. */
|
|
|
|
static MPI constants[MPI_NUMBER_OF_CONSTANTS];
|
|
|
|
|
|
|
|
/* Initialize the MPI subsystem. This is called early and allows to
|
|
|
|
* do some initialization without taking care of threading issues.
|
|
|
|
*/
|
|
|
|
static int __init mpi_init(void)
|
|
|
|
{
|
|
|
|
int idx;
|
|
|
|
unsigned long value;
|
|
|
|
|
|
|
|
for (idx = 0; idx < MPI_NUMBER_OF_CONSTANTS; idx++) {
|
|
|
|
switch (idx) {
|
|
|
|
case MPI_C_ZERO:
|
|
|
|
value = 0;
|
|
|
|
break;
|
|
|
|
case MPI_C_ONE:
|
|
|
|
value = 1;
|
|
|
|
break;
|
|
|
|
case MPI_C_TWO:
|
|
|
|
value = 2;
|
|
|
|
break;
|
|
|
|
case MPI_C_THREE:
|
|
|
|
value = 3;
|
|
|
|
break;
|
|
|
|
case MPI_C_FOUR:
|
|
|
|
value = 4;
|
|
|
|
break;
|
|
|
|
case MPI_C_EIGHT:
|
|
|
|
value = 8;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
pr_err("MPI: invalid mpi_const selector %d\n", idx);
|
|
|
|
return -EFAULT;
|
|
|
|
}
|
|
|
|
constants[idx] = mpi_alloc_set_ui(value);
|
|
|
|
constants[idx]->flags = (16|32);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
postcore_initcall(mpi_init);
|
|
|
|
|
|
|
|
/* Return a constant MPI descripbed by NO which is one of the
|
|
|
|
* MPI_C_xxx macros. There is no need to copy this returned value; it
|
|
|
|
* may be used directly.
|
|
|
|
*/
|
|
|
|
MPI mpi_const(enum gcry_mpi_constants no)
|
|
|
|
{
|
|
|
|
if ((int)no < 0 || no > MPI_NUMBER_OF_CONSTANTS)
|
|
|
|
pr_err("MPI: invalid mpi_const selector %d\n", no);
|
|
|
|
if (!constants[no])
|
|
|
|
pr_err("MPI: MPI subsystem not initialized\n");
|
|
|
|
return constants[no];
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_const);
|
|
|
|
|
2011-08-31 15:05:16 +04:00
|
|
|
/****************
|
|
|
|
* Note: It was a bad idea to use the number of limbs to allocate
|
|
|
|
* because on a alpha the limbs are large but we normally need
|
|
|
|
* integers of n bits - So we should chnage this to bits (or bytes).
|
|
|
|
*
|
|
|
|
* But mpi_alloc is used in a lot of places :-)
|
|
|
|
*/
|
|
|
|
MPI mpi_alloc(unsigned nlimbs)
|
|
|
|
{
|
|
|
|
MPI a;
|
|
|
|
|
|
|
|
a = kmalloc(sizeof *a, GFP_KERNEL);
|
|
|
|
if (!a)
|
|
|
|
return a;
|
|
|
|
|
|
|
|
if (nlimbs) {
|
|
|
|
a->d = mpi_alloc_limb_space(nlimbs);
|
|
|
|
if (!a->d) {
|
|
|
|
kfree(a);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
a->d = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
a->alloced = nlimbs;
|
|
|
|
a->nlimbs = 0;
|
|
|
|
a->sign = 0;
|
|
|
|
a->flags = 0;
|
|
|
|
a->nbits = 0;
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_alloc);
|
|
|
|
|
|
|
|
mpi_ptr_t mpi_alloc_limb_space(unsigned nlimbs)
|
|
|
|
{
|
|
|
|
size_t len = nlimbs * sizeof(mpi_limb_t);
|
|
|
|
|
2012-01-26 21:13:19 +04:00
|
|
|
if (!len)
|
|
|
|
return NULL;
|
|
|
|
|
2011-08-31 15:05:16 +04:00
|
|
|
return kmalloc(len, GFP_KERNEL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mpi_free_limb_space(mpi_ptr_t a)
|
|
|
|
{
|
|
|
|
if (!a)
|
|
|
|
return;
|
|
|
|
|
2020-08-07 09:18:13 +03:00
|
|
|
kfree_sensitive(a);
|
2011-08-31 15:05:16 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
void mpi_assign_limb_space(MPI a, mpi_ptr_t ap, unsigned nlimbs)
|
|
|
|
{
|
|
|
|
mpi_free_limb_space(a->d);
|
|
|
|
a->d = ap;
|
|
|
|
a->alloced = nlimbs;
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************
|
|
|
|
* Resize the array of A to NLIMBS. the additional space is cleared
|
|
|
|
* (set to 0) [done by m_realloc()]
|
|
|
|
*/
|
|
|
|
int mpi_resize(MPI a, unsigned nlimbs)
|
|
|
|
{
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
if (nlimbs <= a->alloced)
|
|
|
|
return 0; /* no need to do it */
|
|
|
|
|
|
|
|
if (a->d) {
|
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 23:55:00 +03:00
|
|
|
p = kmalloc_array(nlimbs, sizeof(mpi_limb_t), GFP_KERNEL);
|
2011-08-31 15:05:16 +04:00
|
|
|
if (!p)
|
|
|
|
return -ENOMEM;
|
|
|
|
memcpy(p, a->d, a->alloced * sizeof(mpi_limb_t));
|
2020-08-07 09:18:13 +03:00
|
|
|
kfree_sensitive(a->d);
|
2011-08-31 15:05:16 +04:00
|
|
|
a->d = p;
|
|
|
|
} else {
|
treewide: kzalloc() -> kcalloc()
The kzalloc() function has a 2-factor argument form, kcalloc(). This
patch replaces cases of:
kzalloc(a * b, gfp)
with:
kcalloc(a * b, gfp)
as well as handling cases of:
kzalloc(a * b * c, gfp)
with:
kzalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kzalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kzalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kzalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kzalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kzalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kzalloc
+ kcalloc
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kzalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kzalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kzalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kzalloc(sizeof(THING) * C2, ...)
|
kzalloc(sizeof(TYPE) * C2, ...)
|
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(C1 * C2, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * E2
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 00:03:40 +03:00
|
|
|
a->d = kcalloc(nlimbs, sizeof(mpi_limb_t), GFP_KERNEL);
|
2011-08-31 15:05:16 +04:00
|
|
|
if (!a->d)
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
a->alloced = nlimbs;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-09-20 19:20:55 +03:00
|
|
|
void mpi_clear(MPI a)
|
|
|
|
{
|
|
|
|
if (!a)
|
|
|
|
return;
|
|
|
|
a->nlimbs = 0;
|
|
|
|
a->flags = 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_clear);
|
|
|
|
|
2011-08-31 15:05:16 +04:00
|
|
|
void mpi_free(MPI a)
|
|
|
|
{
|
|
|
|
if (!a)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (a->flags & 4)
|
2020-08-07 09:18:13 +03:00
|
|
|
kfree_sensitive(a->d);
|
2011-08-31 15:05:16 +04:00
|
|
|
else
|
|
|
|
mpi_free_limb_space(a->d);
|
|
|
|
|
|
|
|
if (a->flags & ~7)
|
|
|
|
pr_info("invalid flag value in mpi\n");
|
|
|
|
kfree(a);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_free);
|
2013-09-17 15:14:52 +04:00
|
|
|
|
2020-09-20 19:20:55 +03:00
|
|
|
/****************
|
|
|
|
* Note: This copy function should not interpret the MPI
|
|
|
|
* but copy it transparently.
|
|
|
|
*/
|
|
|
|
MPI mpi_copy(MPI a)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
MPI b;
|
|
|
|
|
|
|
|
if (a) {
|
|
|
|
b = mpi_alloc(a->nlimbs);
|
|
|
|
b->nlimbs = a->nlimbs;
|
|
|
|
b->sign = a->sign;
|
|
|
|
b->flags = a->flags;
|
|
|
|
b->flags &= ~(16|32); /* Reset the immutable and constant flags. */
|
|
|
|
for (i = 0; i < b->nlimbs; i++)
|
|
|
|
b->d[i] = a->d[i];
|
|
|
|
} else
|
|
|
|
b = NULL;
|
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************
|
|
|
|
* This function allocates an MPI which is optimized to hold
|
|
|
|
* a value as large as the one given in the argument and allocates it
|
|
|
|
* with the same flags as A.
|
|
|
|
*/
|
|
|
|
MPI mpi_alloc_like(MPI a)
|
|
|
|
{
|
|
|
|
MPI b;
|
|
|
|
|
|
|
|
if (a) {
|
|
|
|
b = mpi_alloc(a->nlimbs);
|
|
|
|
b->nlimbs = 0;
|
|
|
|
b->sign = 0;
|
|
|
|
b->flags = a->flags;
|
|
|
|
} else
|
|
|
|
b = NULL;
|
|
|
|
|
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Set U into W and release U. If W is NULL only U will be released. */
|
|
|
|
void mpi_snatch(MPI w, MPI u)
|
|
|
|
{
|
|
|
|
if (w) {
|
|
|
|
mpi_assign_limb_space(w, u->d, u->alloced);
|
|
|
|
w->nlimbs = u->nlimbs;
|
|
|
|
w->sign = u->sign;
|
|
|
|
w->flags = u->flags;
|
|
|
|
u->alloced = 0;
|
|
|
|
u->nlimbs = 0;
|
|
|
|
u->d = NULL;
|
|
|
|
}
|
|
|
|
mpi_free(u);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
MPI mpi_set(MPI w, MPI u)
|
|
|
|
{
|
|
|
|
mpi_ptr_t wp, up;
|
|
|
|
mpi_size_t usize = u->nlimbs;
|
|
|
|
int usign = u->sign;
|
|
|
|
|
|
|
|
if (!w)
|
|
|
|
w = mpi_alloc(mpi_get_nlimbs(u));
|
|
|
|
RESIZE_IF_NEEDED(w, usize);
|
|
|
|
wp = w->d;
|
|
|
|
up = u->d;
|
|
|
|
MPN_COPY(wp, up, usize);
|
|
|
|
w->nlimbs = usize;
|
|
|
|
w->flags = u->flags;
|
|
|
|
w->flags &= ~(16|32); /* Reset the immutable and constant flags. */
|
|
|
|
w->sign = usign;
|
|
|
|
return w;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_set);
|
|
|
|
|
|
|
|
MPI mpi_set_ui(MPI w, unsigned long u)
|
|
|
|
{
|
|
|
|
if (!w)
|
|
|
|
w = mpi_alloc(1);
|
|
|
|
/* FIXME: If U is 0 we have no need to resize and thus possible
|
|
|
|
* allocating the the limbs.
|
|
|
|
*/
|
|
|
|
RESIZE_IF_NEEDED(w, 1);
|
|
|
|
w->d[0] = u;
|
|
|
|
w->nlimbs = u ? 1 : 0;
|
|
|
|
w->sign = 0;
|
|
|
|
w->flags = 0;
|
|
|
|
return w;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mpi_set_ui);
|
|
|
|
|
|
|
|
MPI mpi_alloc_set_ui(unsigned long u)
|
|
|
|
{
|
|
|
|
MPI w = mpi_alloc(1);
|
|
|
|
w->d[0] = u;
|
|
|
|
w->nlimbs = u ? 1 : 0;
|
|
|
|
w->sign = 0;
|
|
|
|
return w;
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************
|
|
|
|
* Swap the value of A and B, when SWAP is 1.
|
|
|
|
* Leave the value when SWAP is 0.
|
|
|
|
* This implementation should be constant-time regardless of SWAP.
|
|
|
|
*/
|
|
|
|
void mpi_swap_cond(MPI a, MPI b, unsigned long swap)
|
|
|
|
{
|
|
|
|
mpi_size_t i;
|
|
|
|
mpi_size_t nlimbs;
|
|
|
|
mpi_limb_t mask = ((mpi_limb_t)0) - swap;
|
|
|
|
mpi_limb_t x;
|
|
|
|
|
|
|
|
if (a->alloced > b->alloced)
|
|
|
|
nlimbs = b->alloced;
|
|
|
|
else
|
|
|
|
nlimbs = a->alloced;
|
|
|
|
if (a->nlimbs > nlimbs || b->nlimbs > nlimbs)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for (i = 0; i < nlimbs; i++) {
|
|
|
|
x = mask & (a->d[i] ^ b->d[i]);
|
|
|
|
a->d[i] = a->d[i] ^ x;
|
|
|
|
b->d[i] = b->d[i] ^ x;
|
|
|
|
}
|
|
|
|
|
|
|
|
x = mask & (a->nlimbs ^ b->nlimbs);
|
|
|
|
a->nlimbs = a->nlimbs ^ x;
|
|
|
|
b->nlimbs = b->nlimbs ^ x;
|
|
|
|
|
|
|
|
x = mask & (a->sign ^ b->sign);
|
|
|
|
a->sign = a->sign ^ x;
|
|
|
|
b->sign = b->sign ^ x;
|
|
|
|
}
|
|
|
|
|
2013-09-17 15:14:52 +04:00
|
|
|
MODULE_DESCRIPTION("Multiprecision maths library");
|
|
|
|
MODULE_LICENSE("GPL");
|