random: simplify accounting code

With this we handle "reserved" in just one place.  As a bonus the
code becomes less nested, and the "wakeup_write" flag variable
becomes unnecessary.  The variable "flags" was already unused.

This code behaves identically to the previous version except in
two pathological cases that don't occur.  If the argument "nbytes"
is already less than "min", then we didn't previously enforce
"min".  If r->limit is false while "reserved" is nonzero, then we
previously applied "reserved" in checking whether we had enough
bits, even though we don't apply it to actually limit how many we
take.  The callers of account() never exercise either of these cases.

Before the previous commit, it was possible for "nbytes" to be less
than "min" if userspace chose a pathological configuration, but no
longer.

Cc: Jiri Kosina <jkosina@suse.cz>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Signed-off-by: Greg Price <price@mit.edu>
Signed-off-by: "Theodore Ts'o" <tytso@mit.edu>
This commit is contained in:
Greg Price 2013-12-05 19:32:19 -05:00 коммит произвёл Theodore Ts'o
Родитель 8c2aa3390e
Коммит 0fb7a01af5
1 изменённых файлов: 10 добавлений и 17 удалений

Просмотреть файл

@ -964,8 +964,6 @@ static void push_to_pool(struct work_struct *work)
static size_t account(struct entropy_store *r, size_t nbytes, int min, static size_t account(struct entropy_store *r, size_t nbytes, int min,
int reserved) int reserved)
{ {
unsigned long flags;
int wakeup_write = 0;
int have_bytes; int have_bytes;
int entropy_count, orig; int entropy_count, orig;
size_t ibytes; size_t ibytes;
@ -977,24 +975,19 @@ retry:
entropy_count = orig = ACCESS_ONCE(r->entropy_count); entropy_count = orig = ACCESS_ONCE(r->entropy_count);
have_bytes = entropy_count >> (ENTROPY_SHIFT + 3); have_bytes = entropy_count >> (ENTROPY_SHIFT + 3);
ibytes = nbytes; ibytes = nbytes;
if (have_bytes < min + reserved) { /* If limited, never pull more than available */
if (r->limit)
ibytes = min_t(size_t, ibytes, have_bytes - reserved);
if (ibytes < min)
ibytes = 0; ibytes = 0;
} else { entropy_count = max_t(int, 0,
/* If limited, never pull more than available */ entropy_count - (ibytes << (ENTROPY_SHIFT + 3)));
if (r->limit) if (cmpxchg(&r->entropy_count, orig, entropy_count) != orig)
ibytes = min_t(size_t, ibytes, have_bytes - reserved); goto retry;
entropy_count = max_t(int, 0,
entropy_count - (ibytes << (ENTROPY_SHIFT + 3)));
if (cmpxchg(&r->entropy_count, orig, entropy_count) != orig)
goto retry;
if ((r->entropy_count >> ENTROPY_SHIFT)
< random_write_wakeup_thresh)
wakeup_write = 1;
}
trace_debit_entropy(r->name, 8 * ibytes); trace_debit_entropy(r->name, 8 * ibytes);
if (wakeup_write) { if (ibytes &&
(r->entropy_count >> ENTROPY_SHIFT) < random_write_wakeup_thresh) {
wake_up_interruptible(&random_write_wait); wake_up_interruptible(&random_write_wait);
kill_fasync(&fasync, SIGIO, POLL_OUT); kill_fasync(&fasync, SIGIO, POLL_OUT);
} }