^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) // SPDX-License-Identifier: GPL-2.0-or-later
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) /* mpihelp-sub.c - MPI helper functions
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) * Copyright (C) 1994, 1996 Free Software Foundation, Inc.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) * Copyright (C) 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) * This file is part of GnuPG.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) * Note: This code is heavily based on the GNU MP Library.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) * Actually it's the same code with only minor changes in the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) * way the data is stored; this is to support the abstraction
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) * of an optional secure memory allocation which may be used
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) * to avoid revealing of sensitive data due to paging etc.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) * The GNU MP Library itself is published under the LGPL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) * however I decided to publish this code under the plain GPL.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) #include "mpi-internal.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19) /****************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) * Compare OP1_PTR/OP1_SIZE with OP2_PTR/OP2_SIZE.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) * There are no restrictions on the relative sizes of
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) * the two arguments.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) * Return 1 if OP1 > OP2, 0 if they are equal, and -1 if OP1 < OP2.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) int mpihelp_cmp(mpi_ptr_t op1_ptr, mpi_ptr_t op2_ptr, mpi_size_t size)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) mpi_size_t i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) mpi_limb_t op1_word, op2_word;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) for (i = size - 1; i >= 0; i--) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) op1_word = op1_ptr[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) op2_word = op2_ptr[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) if (op1_word != op2_word)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) goto diff;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) diff:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) /* This can *not* be simplified to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) * op2_word - op2_word
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) * since that expression might give signed overflow. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) return (op1_word > op2_word) ? 1 : -1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) }