mirror of
https://gitlab.com/cryptsetup/cryptsetup.git
synced 2025-12-05 16:00:05 +01:00
661f57def4
This patch switches code to SPDX one-line license identifiers according to https://spdx.dev/learn/handling-license-info/ and replacing long license text headers. I used C++ format on the first line in style // SPDX-License-Identifier: <id> except exported libcryptsetup.h, when only C comments are used. The only additional changes are: - switch backend utf8.c from LGPL2+ to LGPL2.1+ (as in systemd) - add some additional formatting lines.
57 lines
1.4 KiB
C
57 lines
1.4 KiB
C
// SPDX-License-Identifier: LGPL-2.1-or-later
|
|
/*
|
|
* Safe memory utilities
|
|
*
|
|
* Copyright (C) 2024 Milan Broz
|
|
*/
|
|
|
|
#include "crypto_backend_internal.h"
|
|
|
|
#define ATTR_NOINLINE __attribute__ ((noinline))
|
|
#define ATTR_ZERO_REGS
|
|
#if defined __has_attribute
|
|
# if __has_attribute (zero_call_used_regs)
|
|
# undef ATTR_ZERO_REGS
|
|
# define ATTR_ZERO_REGS __attribute__ ((zero_call_used_regs("used")))
|
|
# endif
|
|
#endif
|
|
|
|
/* Memzero helper (memset on stack can be optimized out) */
|
|
ATTR_NOINLINE ATTR_ZERO_REGS
|
|
void crypt_backend_memzero(void *s, size_t n)
|
|
{
|
|
#ifdef HAVE_EXPLICIT_BZERO
|
|
explicit_bzero(s, n);
|
|
#else
|
|
volatile uint8_t *p = (volatile uint8_t *)s;
|
|
while(n--) *p++ = 0;
|
|
#endif
|
|
}
|
|
|
|
/* Memcpy helper to avoid spilling sensitive data through additional registers */
|
|
ATTR_NOINLINE ATTR_ZERO_REGS
|
|
void *crypt_backend_memcpy(void *dst, const void *src, size_t n)
|
|
{
|
|
volatile uint8_t *d = (volatile uint8_t *)dst;
|
|
const volatile uint8_t *s = (const volatile uint8_t *)src;
|
|
|
|
while(n--) *d++ = *s++;
|
|
|
|
return dst;
|
|
}
|
|
|
|
/* Internal implementation for constant time memory comparison */
|
|
ATTR_NOINLINE ATTR_ZERO_REGS
|
|
int crypt_internal_memeq(const void *m1, const void *m2, size_t n)
|
|
{
|
|
const unsigned char *_m1 = (const unsigned char *) m1;
|
|
const unsigned char *_m2 = (const unsigned char *) m2;
|
|
unsigned char result = 0;
|
|
size_t i;
|
|
|
|
for (i = 0; i < n; i++)
|
|
result |= _m1[i] ^ _m2[i];
|
|
|
|
return result;
|
|
}
|