summaryrefslogtreecommitdiff
path: root/shared/nm-glib-aux/nm-random-utils.c
diff options
context:
space:
mode:
authorThomas Haller <thaller@redhat.com>2019-04-15 08:16:00 +0200
committerThomas Haller <thaller@redhat.com>2019-04-18 19:57:27 +0200
commitd984b2ce4a119428c2003120ea306198ba068df2 (patch)
tree69fa5e8707d38371cb8553279b4d1cf3c0fb5f6a /shared/nm-glib-aux/nm-random-utils.c
parent956215868cf4eb7809c9c823a9f2c2f0a7d20176 (diff)
downloadNetworkManager-d984b2ce4a119428c2003120ea306198ba068df2.tar.gz
shared: move most of "shared/nm-utils" to "shared/nm-glib-aux"
From the files under "shared/nm-utils" we build an internal library that provides glib-based helper utilities. Move the files of that basic library to a new subdirectory "shared/nm-glib-aux" and rename the helper library "libnm-core-base.la" to "libnm-glib-aux.la". Reasons: - the name "utils" is overused in our code-base. Everything's an "utils". Give this thing a more distinct name. - there were additional files under "shared/nm-utils", which are not part of this internal library "libnm-utils-base.la". All the files that are part of this library should be together in the same directory, but files that are not, should not be there. - the new name should better convey what this library is and what is isn't: it's a set of utilities and helper functions that extend glib with funcitonality that we commonly need. There are still some files left under "shared/nm-utils". They have less a unifying propose to be in their own directory, so I leave them there for now. But at least they are separate from "shared/nm-glib-aux", which has a very clear purpose. (cherry picked from commit 80db06f768e47541eae7d66ef48fbe47bf1a69ce)
Diffstat (limited to 'shared/nm-glib-aux/nm-random-utils.c')
-rw-r--r--shared/nm-glib-aux/nm-random-utils.c165
1 files changed, 165 insertions, 0 deletions
diff --git a/shared/nm-glib-aux/nm-random-utils.c b/shared/nm-glib-aux/nm-random-utils.c
new file mode 100644
index 0000000000..d7c7da4221
--- /dev/null
+++ b/shared/nm-glib-aux/nm-random-utils.c
@@ -0,0 +1,165 @@
+/* -*- Mode: C; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*- */
+/* NetworkManager -- Network link manager
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+ *
+ * This library 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
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the
+ * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
+ * Boston, MA 02110-1301 USA.
+ *
+ * (C) Copyright 2017 Red Hat, Inc.
+ */
+
+#include "nm-default.h"
+
+#include "nm-random-utils.h"
+
+#include <fcntl.h>
+
+#if USE_SYS_RANDOM_H
+#include <sys/random.h>
+#else
+#include <linux/random.h>
+#endif
+
+#include "nm-shared-utils.h"
+
+/*****************************************************************************/
+
+/**
+ * nm_utils_random_bytes:
+ * @p: the buffer to fill
+ * @n: the number of bytes to write to @p.
+ *
+ * Uses getrandom() or reads /dev/urandom to fill the buffer
+ * with random data. If all fails, as last fallback it uses
+ * GRand to fill the buffer with pseudo random numbers.
+ * The function always succeeds in writing some random numbers
+ * to the buffer. The return value of FALSE indicates that the
+ * obtained bytes are probably not of good randomness.
+ *
+ * Returns: whether the written bytes are good. If you
+ * don't require good randomness, you can ignore the return
+ * value.
+ *
+ * Note that if calling getrandom() fails because there is not enough
+ * entropy (at early boot), the function will read /dev/urandom.
+ * Which of course, still has low entropy, and cause kernel to log
+ * a warning.
+ */
+gboolean
+nm_utils_random_bytes (void *p, size_t n)
+{
+ int fd;
+ int r;
+ gboolean has_high_quality = TRUE;
+ gboolean urandom_success;
+ guint8 *buf = p;
+ gboolean avoid_urandom = FALSE;
+
+ g_return_val_if_fail (p, FALSE);
+ g_return_val_if_fail (n > 0, FALSE);
+
+#if HAVE_GETRANDOM
+ {
+ static gboolean have_syscall = TRUE;
+
+ if (have_syscall) {
+ r = getrandom (buf, n, GRND_NONBLOCK);
+ if (r > 0) {
+ if ((size_t) r == n)
+ return TRUE;
+
+ /* no or partial read. There is not enough entropy.
+ * Fill the rest reading from urandom, and remember that
+ * some bits are not high quality. */
+ nm_assert (r < n);
+ buf += r;
+ n -= r;
+ has_high_quality = FALSE;
+
+ /* At this point, we don't want to read /dev/urandom, because
+ * the entropy pool is low (early boot?), and asking for more
+ * entropy causes kernel messages to be logged.
+ *
+ * We use our fallback via GRand. Note that g_rand_new() also
+ * tries to seed itself with data from /dev/urandom, but since
+ * we reuse the instance, it shouldn't matter. */
+ avoid_urandom = TRUE;
+ } else {
+ if (errno == ENOSYS) {
+ /* no support for getrandom(). We don't know whether
+ * we urandom will give us good quality. Assume yes. */
+ have_syscall = FALSE;
+ } else {
+ /* unknown error. We'll read urandom below, but we don't have
+ * high-quality randomness. */
+ has_high_quality = FALSE;
+ }
+ }
+ }
+ }
+#endif
+
+ urandom_success = FALSE;
+ if (!avoid_urandom) {
+fd_open:
+ fd = open ("/dev/urandom", O_RDONLY | O_CLOEXEC | O_NOCTTY);
+ if (fd < 0) {
+ r = errno;
+ if (r == EINTR)
+ goto fd_open;
+ } else {
+ r = nm_utils_fd_read_loop_exact (fd, buf, n, TRUE);
+ nm_close (fd);
+ if (r >= 0)
+ urandom_success = TRUE;
+ }
+ }
+
+ if (!urandom_success) {
+ static _nm_thread_local GRand *rand = NULL;
+ gsize i;
+ int j;
+
+ /* we failed to fill the bytes reading from urandom.
+ * Fill the bits using GRand pseudo random numbers.
+ *
+ * We don't have good quality.
+ */
+ has_high_quality = FALSE;
+
+ if (G_UNLIKELY (!rand))
+ rand = g_rand_new ();
+
+ nm_assert (n > 0);
+ i = 0;
+ for (;;) {
+ const union {
+ guint32 v32;
+ guint8 v8[4];
+ } v = {
+ .v32 = g_rand_int (rand),
+ };
+
+ for (j = 0; j < 4; ) {
+ buf[i++] = v.v8[j++];
+ if (i >= n)
+ goto done;
+ }
+ }
+done:
+ ;
+ }
+
+ return has_high_quality;
+}